problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00474 | C++ | Runtime Error | // 21
#include <algorithm>
#include <iostream>
using namespace std;
int n, l;
int c[10000];
int t[10000];
int a = 0;
int gr(int i) {
if (t[i])
return t[i];
int li = (i == 0 || c[i - 1] < c[i]) ? 0 : gr(i - 1);
int ri = (i == n - 1 || c[i + 1] < c[i]) ? 0 : gr(i + 1);
t[i] = max(li, ri) + l - c[i];
a = ... | // 21
#include <algorithm>
#include <iostream>
using namespace std;
int n, l;
int c[100000];
int t[100000];
int a = 0;
int gr(int i) {
if (t[i])
return t[i];
int li = (i == 0 || c[i - 1] < c[i]) ? 0 : gr(i - 1);
int ri = (i == n - 1 || c[i + 1] < c[i]) ? 0 : gr(i + 1);
t[i] = max(li, ri) + l - c[i];
a ... | replace | 7 | 9 | 7 | 9 | 0 | |
p00474 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
typedef pair<int, int> P;
int main() {
int N, L, in, dp[MAX] = {0};
priority_queue<P> Q;
cin >> N >> L;
for (int i = 1; i <= N; i++) {
cin >> in;
Q.push(P(in, i));
}
while (!Q.empty()) {
P p = Q.top();
Q.pop();
dp[p.sec... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100002
typedef pair<int, int> P;
int main() {
int N, L, in, dp[MAX] = {0};
priority_queue<P> Q;
cin >> N >> L;
for (int i = 1; i <= N; i++) {
cin >> in;
Q.push(P(in, i));
}
while (!Q.empty()) {
P p = Q.top();
Q.pop();
dp[p.sec... | replace | 4 | 5 | 4 | 5 | 0 | |
p00474 | C++ | Runtime Error | #include <iostream>
using namespace std;
int ic[50002], icL[50002];
int maxer = 0;
int N, L;
void pick(int i) {
if (icL[i - 1] < icL[i] && icL[i + 1] < icL[i]) {
ic[i] = max(ic[i - 1], ic[i + 1]) + L - icL[i];
maxer = max(ic[i], maxer);
icL[i] = 0;
pick(i + 1);
pick(i - 1);
}
}
int main() {
c... | #include <iostream>
using namespace std;
int ic[100002], icL[100002];
int maxer = 0;
int N, L;
void pick(int i) {
if (icL[i - 1] < icL[i] && icL[i + 1] < icL[i]) {
ic[i] = max(ic[i - 1], ic[i + 1]) + L - icL[i];
maxer = max(ic[i], maxer);
icL[i] = 0;
pick(i + 1);
pick(i - 1);
}
}
int main() {
... | replace | 2 | 3 | 2 | 3 | 0 | |
p00478 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string A, S, T;
int P = 0;
int n;
cin >> A;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S;
T = S + S;
for (int j = 0; j < n; j++) {
if (T.substr(j, A.length()) == A) {
P++;
break;
}
}
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string A, S, T;
int P = 0;
int n;
cin >> A;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S;
T = S + S;
for (int j = 0; j < 10; j++) {
if (T.substr(j, A.length()) == A) {
P++;
break;
}
}
}... | replace | 13 | 14 | 13 | 14 | 0 | |
p00479 | C++ | Time Limit Exceeded | #include <iostream>
#define lli long long int
using namespace std;
int main() {
lli n, m, s, t, u, v;
while (cin >> n && n) {
cin >> m;
if (n % 2 == 0) {
v = n / 2;
} else {
v = (n + 1) / 2;
}
while (m--) {
cin >> s >> t;
if (s > v) {
s = n - s + 1;
}
... | #include <iostream>
#define lli long long int
using namespace std;
int main() {
lli n, m, s, t, u, v;
while (cin >> n && n) {
cin >> m;
if (n % 2 == 0) {
v = n / 2;
} else {
v = (n + 1) / 2;
}
while (m--) {
cin >> s >> t;
if (s > v) {
s = n - s + 1;
}
... | replace | 30 | 43 | 30 | 32 | TLE | |
p00480 | C++ | Runtime Error | #include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, l, n) for (int(i) = (int)(l); (i) < (int)(n); (i)++... | #include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, l, n) for (int(i) = (int)(l); (i) < (int)(n); (i)++... | replace | 38 | 39 | 38 | 39 | 0 | |
p00480 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (int a = b; a < (c); a++)
#define repe(a, b, c) for (int a = b; a <= (c); a++)
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<long long unsigned>> dp(N, vector<long long unsigned>(21, 0));
int num;
cin >> num... | #include <cmath>
#include <iostream>
#include <vector>
#define rep(a, b, c) for (int a = b; a < (c); a++)
#define repe(a, b, c) for (int a = b; a <= (c); a++)
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<long long unsigned>> dp(N, vector<long long unsigned>(21, 0));
int num;
cin >> num... | replace | 17 | 18 | 17 | 18 | -11 | |
p00480 | C++ | Runtime Error | #include <iostream>
int main() {
int a;
int dp[21][101] = {0};
int x[101];
std::cin >> a;
for (int i = 1; i <= a; i++)
std::cin >> x[i];
dp[1][x[1]] = 1;
for (int j = 2; j < a; j++) {
for (int s = 0; s <= 20; s++) {
if (s + x[j] <= 20 && s - x[j] >= 0) {
dp[j][s] = dp[j - 1][s - x[j... | #include <iostream>
int main() {
int a;
long long int dp[101][101] = {0};
int x[101];
std::cin >> a;
for (int i = 1; i <= a; i++)
std::cin >> x[i];
dp[1][x[1]] = 1;
for (int j = 2; j < a; j++) {
for (int s = 0; s <= 20; s++) {
if (s + x[j] <= 20 && s - x[j] >= 0) {
dp[j][s] = dp[j -... | replace | 3 | 4 | 3 | 4 | 0 | |
p00480 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | replace | 58 | 59 | 58 | 59 | TLE | |
p00481 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
#define INF 100000
char map[1001][1001];
int h, w, n;
int d1[4] = {0, 1, 0, -1};
int d2[4] = {1, 0, -1, 0};
int i, j, x[10], y[... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
using namespace std;
#define INF 100000
char map[1001][1001];
int h, w, n;
int d1[4] = {0, 1, 0, -1};
int d2[4] = {1, 0, -1, 0};
int i, j, x[10], y[... | replace | 19 | 21 | 19 | 21 | -11 | |
p00481 | C++ | Runtime Error | #include <iostream>
#include <queue>
#define min(x, y) ((x) < (y) ? (x) : (y))
#define INFI 65535
using namespace std;
typedef pair<int, int> P;
int Strength = 1;
char Maps[1010][1010];
int dist[1010][1010];
int H, W, N;
int hor[] = {1, 0, -1, 0};
int ver[] = {0, -1, 0, 1};
int ans;
void clear();
void show();
P bfs(... | #include <iostream>
#include <queue>
#define min(x, y) ((x) < (y) ? (x) : (y))
#define INFI 100000000
using namespace std;
typedef pair<int, int> P;
int Strength = 1;
char Maps[1010][1010];
int dist[1010][1010];
int H, W, N;
int hor[] = {1, 0, -1, 0};
int ver[] = {0, -1, 0, 1};
int ans;
void clear();
void show();
P ... | replace | 3 | 4 | 3 | 4 | 0 | |
p00481 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int h, w, n;
int x[10], y[10];
string map[1000];
int dmap[1000][1000];
queue<int> qx, qy;
int dis;
cin >> h >> w >> n;
for (int i = 0; i < h; i++)
cin >> map[i];
for (int i = 0; i < h; i++) {
for (i... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
int main() {
int h, w, n;
int x[10], y[10];
string map[1000];
int dmap[1000][1000];
queue<int> qx, qy;
int dis;
cin >> h >> w >> n;
for (int i = 0; i < h; i++)
cin >> map[i];
for (int i = 0; i < h; i++) {
for (i... | delete | 23 | 24 | 23 | 23 | 0 | |
p00481 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define F first
#define S second
const int M = 1024;
const int INF = 114514;
int h, w, n;
char f[M][M];
int d[M][M];
int dx[] = {1, 0, -1, 0};
int dy[] = {0,... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define F first
#define S second
const int M = 1024;
const int INF = 114514810;
int h, w, n;
char f[M][M];
int d[M][M];
int dx[] = {1, 0, -1, 0};
int dy[] = ... | replace | 10 | 11 | 10 | 11 | 0 | |
p00481 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <queue>
#include <utility>
using namespace std;
int H, W, N;
char field[1000][1000];
int d[1000][1000];
pair<int, int> start;
pair<int, int> cheese;
int INF = 1000000;
int result = 0;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void bfs() {
for (int n = 1; n ... | #include <cstdio>
#include <cstdlib>
#include <queue>
#include <utility>
using namespace std;
int H, W, N;
char field[1000][1000];
int d[1000][1000];
pair<int, int> start;
pair<int, int> cheese;
int INF = 1000000;
int result = 0;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void bfs() {
for (int n = 1; n ... | replace | 40 | 41 | 40 | 41 | 0 | |
p00481 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
using namespace std;
#define INF 10000000
typedef pair<int, int> P;
queue<P> que;
char map[1000][1001];
int vst[1000][1000];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int H, W, N, sx, sy, sum = 0;
int main() {
scanf("%d %d %d", &H, &... | #include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
using namespace std;
#define INF 10000000
typedef pair<int, int> P;
queue<P> que;
char map[1000][1001];
int vst[1000][1000];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int H, W, N, sx, sy, sum = 0;
int main() {
scanf("%d %d %d", &H, &... | replace | 45 | 46 | 45 | 47 | 0 | |
p00481 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
#defi... | replace | 96 | 97 | 96 | 97 | MLE | |
p00481 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int xs[10], ys[10];
int H, W, N;
string S[1002];
int main() {
scanf("%d%d%d", &H, &W, &N);
for (int i = 0; i < W + 2; i++) {
S[0] += 'X';
S[H + 1] += 'X';
}
for (int i = 1; i <= H; i++) {
string x;
cin... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int xs[10], ys[10];
int H, W, N;
string S[1002];
int main() {
scanf("%d%d%d", &H, &W, &N);
for (int i = 0; i < W + 2; i++) {
S[0] += 'X';
S[H + 1] += 'X';
}
for (int i = 1; i <= H; i++) {
string x;
cin... | replace | 32 | 34 | 32 | 34 | 0 | |
p00481 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | replace | 69 | 70 | 69 | 70 | 0 | |
p00481 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
struct OZAWA {
int x;
int y;
int c;
};
int Flag[1000][1000];
char MAP[1000][1000];
queue<OZAWA> Q;
OZAWA ba, v;
int main(void) {
int H, W, N, Nc = 0, X[10], Y[10];
int mv[4][2] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}... | #include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
using namespace std;
struct OZAWA {
int x;
int y;
int c;
};
int Flag[1001][1001];
char MAP[1001][1001];
queue<OZAWA> Q;
OZAWA ba, v;
int main(void) {
int H, W, N, Nc = 0, X[10], Y[10];
int mv[4][2] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}... | replace | 11 | 13 | 11 | 13 | 0 | |
p00481 | C++ | Runtime Error | #include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
typedef std::pair<LL, LL> P;
struct edge {
LL to, cost;
};
int H, W, N;
std::string field[1123];
int Sx, Sy, x[11], y[11], ans;
int... | #include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
typedef std::pair<LL, LL> P;
struct edge {
LL to, cost;
};
int H, W, N;
std::string field[1123];
int Sx, Sy, x[11], y[11], ans;
int... | insert | 47 | 47 | 47 | 50 | 0 | |
p00481 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#define N 1002
using namespace std;
int bfs(pair<int, int>, pair<int, int>);
int h, w, d[N][N];
string str[N];
int main() {
int n, i, j, sum;
pair<int, int> P[10];
cin >> h >> w >> n;
for (i = 0; i <= w + 1; i++)
str[0] += 'X', str[h + 1] += 'X';
for (i = 1; i <= h; i+... | #include <iostream>
#include <queue>
#define N 1002
using namespace std;
int bfs(pair<int, int>, pair<int, int>);
int h, w, d[N][N];
string str[N];
int main() {
int n, i, j, sum;
pair<int, int> P[10];
cin >> h >> w >> n;
for (i = 0; i <= w + 1; i++)
str[0] += 'X', str[h + 1] += 'X';
for (i = 1; i <= h; i+... | replace | 49 | 78 | 49 | 72 | TLE | |
p00481 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define VDEL(v, n) v.erase(v.begin() + (n))
#define ALL(v) v.begin(), v.end()
#define INTMAX 2147483647
#define INF 200000... | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define VDEL(v, n) v.erase(v.begin() + (n))
#define ALL(v) v.begin(), v.end()
#define INTMAX 2147483647
#define INF 200000... | replace | 58 | 59 | 58 | 59 | MLE | |
p00481 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
#include <queue>
#include <sstream>
using namespace std;
const int INF = 100000000;
const int MAX_W = 1000;
const int MAX_H = 1000;
int H, W, N;
char field[MAX_H][MAX_W] = {'X'};
int d[MAX_H][MAX_W] = {INF};
typedef pair<int, int> P;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1,... | #include <cstdlib>
#include <iostream>
#include <queue>
#include <sstream>
using namespace std;
const int INF = 100000000;
const int MAX_W = 1001;
const int MAX_H = 1001;
int H, W, N;
char field[MAX_H][MAX_W] = {'X'};
int d[MAX_H][MAX_W] = {INF};
typedef pair<int, int> P;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1,... | replace | 8 | 10 | 8 | 10 | 0 | |
p00481 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info {
int nx;
int ny;
int cost;
int target;
info(int a, int b, int c, int d) {
nx = a;
ny = b;
cost = c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info {
int nx;
int ny;
int cost;
int target;
info(int a, int b, int c, int d) {
nx = a;
ny = b;
cost = c... | replace | 51 | 52 | 51 | 52 | 0 | |
p00481 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <queue>
#define ROP(i, n) for (int i = 0; i < n; i++)
#define ROPP(i, n) for (int i = 1; i <= n; i++)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
int N, M, G, gx[10], gy[10];
char MAP[1000][1000 + 1];
int DX[4] = {1, 0, -1, 0}, DY[4] = {0, 1, 0, -1... | #include <cstdio>
#include <iostream>
#include <queue>
#define ROP(i, n) for (int i = 0; i < n; i++)
#define ROPP(i, n) for (int i = 1; i <= n; i++)
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
int N, M, G, gx[10], gy[10];
char MAP[1005][1005];
int DX[4] = {1, 0, -1, 0}, DY[4] = {0, 1, 0, -1}, F... | replace | 9 | 11 | 9 | 11 | 0 | |
p00481 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int MAX_HW = 1000;
int n, h, w, rat, s[2], g[2], flag[MAX_HW][MAX_HW][2];
int town[MAX_HW][MAX_HW];
char town2[MAX_HW][MAX_HW];
queue<P> que;
P p;
void bfs(int sy, int sx) {
que.push(P(sy, sx));
flag[sy][sx][0] = rat;
while ... | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int MAX_HW = 1000;
int n, h, w, rat, s[2], g[2], flag[MAX_HW + 1][MAX_HW + 1][2];
int town[MAX_HW + 1][MAX_HW + 1];
char town2[MAX_HW + 1][MAX_HW + 1];
queue<P> que;
P p;
void bfs(int sy, int sx) {
que.push(P(sy, sx));
flag[sy... | replace | 5 | 8 | 5 | 8 | 0 | |
p00481 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int MAX_HW = 1000;
int n, h, w, rat, s[2], g[2], flag[MAX_HW][MAX_HW][2];
int town[MAX_HW][MAX_HW];
char town2[MAX_HW][MAX_HW];
queue<P> que;
P p;
void bfs(int sy, int sx) {
que.push(P(sy, sx));
flag[sy][sx][0] = rat;
while ... | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int MAX_HW = 1000;
int n, h, w, rat, s[2], g[2], flag[MAX_HW + 1][MAX_HW + 1][2];
int town[MAX_HW][MAX_HW];
char town2[MAX_HW][MAX_HW];
queue<P> que;
P p;
void bfs(int sy, int sx) {
que.push(P(sy, sx));
flag[sy][sx][0] = rat;
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00481 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
// #include <functional>
#include <cstdio>
#include <fstream>
#include <queue>
using namespace std;
#define START 'S'
#define CANTGO 'X'
#define NONE '.'
#define FINUM field[i][j] - '0'
struct Point {
int x;
int y;
};
int dx[] = {0, -1... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
// #include <functional>
#include <cstdio>
#include <fstream>
#include <queue>
using namespace std;
#define START 'S'
#define CANTGO 'X'
#define NONE '.'
#define FINUM field[i][j] - '0'
struct Point {
int x;
int y;
};
int dx[] = {0, -1... | replace | 88 | 89 | 88 | 89 | TLE | |
p00481 | C++ | Memory Limit Exceeded | #include <iostream>
#include <queue>
#define x first
#define y second
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int h, w, k;
pair<int, int> p[12];
bool t[1010][1010], vis[1010][1010];
queue<pair<int, pair<int, int>>> Q;
int main() {
cin >> h >> w >> k;
rep(i, 0, h) rep(j, 0, w) {
t[i... | #include <iostream>
#include <queue>
#define x first
#define y second
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int h, w, k;
pair<int, int> p[12];
bool t[1010][1010], vis[1010][1010];
queue<pair<int, pair<int, int>>> Q;
int main() {
cin >> h >> w >> k;
rep(i, 0, h) rep(j, 0, w) {
t[i... | replace | 39 | 40 | 39 | 40 | MLE | |
p00481 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<int, pair<int, int>> tup;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<int, pair<int, int>> tup;
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) ... | insert | 75 | 75 | 75 | 76 | 0 | |
p00481 | C++ | Memory Limit Exceeded | #include <iostream>
#include <map>
#include <queue>
#define rep(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define ft first
#define sd second
using namespace std;
char m[1000][1000];
int dis[1000][1000];
queue<pair<int, int>> state;
int main() {
int h, w, n;
cin >> h >> w >> n;
int sx, sy;
rep(i, 0, h) ... | #include <iostream>
#include <map>
#include <queue>
#define rep(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define ft first
#define sd second
using namespace std;
char m[1000][1000];
int dis[1000][1000];
queue<pair<int, int>> state;
int main() {
int h, w, n;
cin >> h >> w >> n;
int sx, sy;
rep(i, 0, h) ... | replace | 67 | 68 | 67 | 68 | MLE | |
p00481 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
int main() {
int h, w, n, px, py, ans;
int field[100][100];
int ch[100][100];
while (cin >> h >> w >> n) {
ans = 0;
string s;
for (int i = 0; i < h; i++) {
cin >> s;
for (int j = 0; j < w; j++) {
... | #include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
int main() {
int h, w, n, px, py, ans;
int field[1000][1000];
int ch[1000][1000];
while (cin >> h >> w >> n) {
ans = 0;
string s;
for (int i = 0; i < h; i++) {
cin >> s;
for (int j = 0; j < w; j++)... | replace | 7 | 9 | 7 | 9 | 0 | |
p00481 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | delete | 94 | 96 | 94 | 94 | TLE | |
p00481 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
typedef std::pair<int, int> T;
const int vecx[4] = {1, 0, -1, 0};
const int vecy[4] = {0, -1, 0, 1};
int h, w, n;
T goal[10];
char filed[1000][1000];
int si, sj;
int ans;
int dis[1000][1000];
void bfs(T _goal, T _start) {
std::queue<T> q;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
typedef std::pair<int, int> T;
const int vecx[4] = {1, 0, -1, 0};
const int vecy[4] = {0, -1, 0, 1};
int h, w, n;
T goal[10];
char filed[1000][1000];
int si, sj;
int ans;
int dis[1000][1000];
void bfs(T _goal, T _start) {
std::queue<T> q;
... | replace | 32 | 33 | 32 | 34 | 0 | |
p00481 | C++ | Memory Limit Exceeded | #include <iostream>
#include <vector>
std::vector<std::pair<int, int>> next_list(const int &x, const int &y) {
return {std::make_pair(x + 1, y), std::make_pair(x - 1, y),
std::make_pair(x, y + 1), std::make_pair(x, y - 1)};
}
template <typename T> class Queue {
public:
Queue(const int &n) : vector(n), f(0... | #include <iostream>
#include <vector>
std::vector<std::pair<int, int>> next_list(const int &x, const int &y) {
return {std::make_pair(x + 1, y), std::make_pair(x - 1, y),
std::make_pair(x, y + 1), std::make_pair(x, y - 1)};
}
template <typename T> class Queue {
public:
Queue(const int &n) : vector(n), f(0... | replace | 84 | 85 | 84 | 85 | MLE | |
p00482 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FI... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FI... | replace | 22 | 23 | 22 | 23 | 0 | |
p00482 | C++ | Time Limit Exceeded | #include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int w, h;
const int MOD = 100000;
int dp[2][1 << 20];
void solve() {
int res = 1;
vector<string> V;
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size(); j++) {
if (s[j] ... | #include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int w, h;
const int MOD = 100000;
int dp[2][1 << 20];
void solve() {
int res = 1;
vector<string> V;
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; j < s.size(); j++) {
if (s[j] ... | insert | 64 | 64 | 64 | 66 | TLE | |
p00482 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | replace | 77 | 78 | 77 | 78 | TLE | |
p00482 | C++ | Memory Limit Exceeded | #include <cstdio>
#include <cstring>
int m, n, ans;
int dp[2][1 << 21][2], fill, all = 1;
char c;
int main() {
scanf("%d%d", &m, &n);
fill = (1 << (n - 1)) - 1;
dp[1][0][0] = 1;
for (int i = 0; i < m * n; i++) {
scanf(" %c", &c);
if (c == '?') {
all *= 3;
all %= 100000;
}
memset(dp[i... | #include <cstdio>
#include <cstring>
int m, n, ans;
int dp[2][1 << 19][2], fill, all = 1;
char c;
int main() {
scanf("%d%d", &m, &n);
fill = (1 << (n - 1)) - 1;
dp[1][0][0] = 1;
for (int i = 0; i < m * n; i++) {
scanf(" %c", &c);
if (c == '?') {
all *= 3;
all %= 100000;
}
memset(dp[i... | replace | 3 | 4 | 3 | 4 | MLE | |
p00482 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
using namespace std;
int MOD = 100000;
char str[20][21];
int dp[2][3][1 << 20];
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = 0; i < a; i++)
scanf("%s", str[i]);
int q = 0;
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
if (str[i][j] ... | #include <algorithm>
#include <stdio.h>
using namespace std;
int MOD = 100000;
char str[20][21];
int dp[2][3][1 << 20];
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = 0; i < a; i++)
scanf("%s", str[i]);
int q = 0;
for (int i = 0; i < a; i++)
for (int j = 0; j < b; j++)
if (str[i][j] ... | insert | 60 | 60 | 60 | 62 | TLE | |
p00482 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FI... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FI... | replace | 22 | 23 | 22 | 23 | 0 | |
p00482 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int M, N;
cin >> M >> N;
char g[20][21];
for (int i = 0; i < M; i++) {
cin >> g[i];
}
static int dp[2][2][1 << 20];
dp[0][0][0] = 1;
int s = M * N;
int MOD = 100000;
int all = 1;
for (int i = 0; i < s; i++) {
int ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int M, N;
cin >> M >> N;
char g[20][21];
for (int i = 0; i < M; i++) {
cin >> g[i];
}
static int dp[2][2][1 << 20];
dp[0][0][0] = 1;
int s = M * N;
int MOD = 100000;
int all = 1;
for (int i = 0; i < s; i++) {
int ... | insert | 27 | 27 | 27 | 29 | TLE | |
p00482 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REP(i, a) FOR(i, 0, a)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef i... | #include <algorithm>
#include <complex>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REP(i, a) FOR(i, 0, a)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef i... | replace | 18 | 19 | 18 | 19 | TLE | |
p00482 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const int MAXH = 21;
const int MAXW = 21;
const lli mod = 100000LL;
const string C = "JOI";
int H, W;
char G[MAXH][MAXW];
map<int, lli> dp[2];
int main() {
lli all = 1;
cin >> H >> W;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; +... | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const int MAXH = 21;
const int MAXW = 21;
const lli mod = 100000LL;
const string C = "JOI";
int H, W;
char G[MAXH][MAXW];
map<int, lli> dp[2];
int main() {
lli all = 1;
cin >> H >> W;
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; +... | replace | 54 | 56 | 54 | 57 | MLE | |
p00483 | C++ | Runtime Error | #include <cstdio>
#include <string>
#include <vector>
using namespace std;
int m, n, k;
vector<string> v;
char t[1001];
int dp[1000][1000][3];
void solve(int a, int b, int c, int d) {
int j = 0, o = 0, i = 0;
for (int x = a - 1; x < c; x++) {
for (int y = b - 1; y < d; y++) {
if (v[x][y] == 'J')
... | #include <cstdio>
#include <string>
#include <vector>
using namespace std;
int m, n, k;
vector<string> v;
char t[1001];
int dp[1000][1000][3];
void solve(int a, int b, int c, int d) {
int j = 0, o = 0, i = 0;
for (int x = a - 1; x < c; x++) {
for (int y = b - 1; y < d; y++) {
if (v[x][y] == 'J')
... | insert | 93 | 93 | 93 | 99 | 0 | |
p00483 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff(i, a, b) for (int i = a; i <= b; i++)
#define fo(i, a, b) for (int i = a; i < b; i++)
#define fod(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const int INF = 1e9, N = 10... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff(i, a, b) for (int i = a; i <= b; i++)
#define fo(i, a, b) for (int i = a; i < b; i++)
#define fod(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const int INF = 1e9, N = 10... | replace | 31 | 32 | 31 | 32 | 0 | |
p00483 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LL long long
using namespace std;
static const LL INF = 1LL << 60LL;
typedef pair<int, int> pii;
string Map[1010];
LL J[1010][1010], O[1010][1010], I[1010][1010];
LL m, n, k;
LL a, b, c, d;
LL res_J, res_O, res_I;
int main() {
cin >> m >> n;
cin >> k;
for (int y = 1; y <= m; ++... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
static const LL INF = 1LL << 60LL;
typedef pair<int, int> pii;
char Map[1010][1010];
LL J[1010][1010], O[1010][1010], I[1010][1010];
LL m, n, k;
LL a, b, c, d;
LL res_J, res_O, res_I;
int main() {
cin >> m >> n;
cin >> k;
for (int y = 1; y <= m... | replace | 6 | 7 | 6 | 7 | TLE | |
p00483 | C++ | Runtime Error | #include <cstdio>
int joi2num(char c) {
if (c == 'J')
return 0;
if (c == 'O')
return 1;
return 2;
}
int main() {
int m, n, k;
char fld[1024][1024];
int sum[1024][1024][3];
scanf("%d%d%d", &m, &n, &k);
for (int x = 0; x < m; ++x)
scanf("%s", fld[x]);
for (int i = 0; i < 3; ++i)
sum[0]... | #include <cstdio>
int joi2num(char c) {
if (c == 'J')
return 0;
if (c == 'O')
return 1;
return 2;
}
int main() {
int m, n, k;
static char fld[1024][1024];
static int sum[1024][1024][3] = {0};
scanf("%d%d%d", &m, &n, &k);
for (int x = 0; x < m; ++x)
scanf("%s", fld[x]);
for (int i = 0; i ... | replace | 12 | 14 | 12 | 14 | -11 | |
p00484 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
#define ll long long
int dp[11][2001];
int book[11][2001];
int kind[11] = {0};
int acc[11][2001];
int main() {
int N, K;
int c, g;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> c >> g;
book[g - 1][ki... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
#define ll long long
int dp[12][2001];
int book[11][2001];
int kind[11] = {0};
int acc[11][2001];
int main() {
int N, K;
int c, g;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> c >> g;
book[g - 1][ki... | replace | 6 | 7 | 6 | 7 | 0 | |
p00484 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
vector<int> cost[10];
int dp[10][2001];
int main() {
int n, k;
scanf("%d%d", &n, &k);
rep(i, n) {
int c, g;
scanf("%d%d", &c, &g);
cost[--g].push_back(c);
}
rep(i, 10) sort(cost[i].begin(), cost[i].end(),... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
vector<int> cost[10];
int dp[15][2001];
int main() {
int n, k;
scanf("%d%d", &n, &k);
rep(i, n) {
int c, g;
scanf("%d%d", &c, &g);
cost[--g].push_back(c);
}
rep(i, 10) sort(cost[i].begin(), cost[i].end(),... | replace | 5 | 6 | 5 | 6 | 0 | |
p00484 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 2005;
vector<int> a[10];
vector<int> b[10];
int dp[10][MAX_N];
int n, K;
int main() {
int x, y;
scanf("%d%d"... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 2005;
vector<int> a[11];
vector<int> b[11];
int dp[11][MAX_N];
int n, K;
int main() {
int x, y;
scanf("%d%d"... | replace | 12 | 15 | 12 | 15 | 0 | |
p00484 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define mp(a, b) make_pair((a), (b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define mp(a, b) make_pair((a), (b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
ty... | replace | 56 | 58 | 56 | 58 | 0 | |
p00484 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int lis[11][2003], lissize[11] = {0};
for (int i = 0; i < 11; i++) {
for (int j = 1; j < 2003; j++)
lis[i][j] = -2000000000;
}
for (int i = 0; i < N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int lis[11][2003], lissize[11] = {0};
for (int i = 0; i < 11; i++) {
for (int j = 1; j < 2003; j++)
lis[i][j] = -2000000000;
}
for (int i = 0; i < N; i++... | replace | 35 | 37 | 35 | 37 | 0 | |
p00484 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
for (int n, k; cin >> n >> k, n | k;) {
vector<vector<int>> ps(10);
for (int i = 0; i < n; i++) {
int p, g;
cin >> p >> g;
ps[g - 1].push_back(p);
}
for (int i = 0; i < 10; i++)
sort... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
for (int n, k; cin >> n >> k && n | k;) {
vector<vector<int>> ps(10);
for (int i = 0; i < n; i++) {
int p, g;
cin >> p >> g;
ps[g - 1].push_back(p);
}
for (int i = 0; i < 10; i++)
so... | replace | 7 | 8 | 7 | 8 | TLE | |
p00484 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> pr(10, vector<int>(n + 1, 0));
vector<int> ko(10, 0);
for (int i = 0; i < n; i++) {
int c, g;
cin >> c >> g;
g--;
pr[g][ko[g]] = c;
ko... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> pr(10, vector<int>(n + 1, 0));
vector<int> ko(10, 0);
for (int i = 0; i < n; i++) {
int c, g;
cin >> c >> g;
g--;
pr[g][ko[g]] = c;
ko... | replace | 22 | 23 | 22 | 23 | 0 | |
p00484 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define mp(a, b) make_pair((a), (b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define mp(a, b) make_pair((a), (b))
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif
ty... | replace | 59 | 60 | 59 | 61 | 0 | |
p00484 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
long long int cost[10][3000];
long long int DP[3000];
int main() {
int N, K;
while (true) {
cin >> N >> K;
if (cin.eof()) {
break;
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 3... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
long long int cost[10][3000];
long long int DP[3000];
int main() {
int N, K;
while (true) {
cin >> N >> K;
if (cin.eof()) {
break;
}
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 3... | insert | 31 | 31 | 31 | 32 | 0 | |
p00484 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, latte[2001] = {0};
for (int i = 1; i <= 2000; i++)
latte[i] = (i - 1) * i;
cin >> N >> K;
vector<vector<int>> books(10);
for (int i = 0; i < N; i++) {
int v, j;
cin >> v >> j;
j--;
books... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, latte[2001] = {0};
for (int i = 1; i <= 2000; i++)
latte[i] = (i - 1) * i;
cin >> N >> K;
vector<vector<int>> books(10);
for (int i = 0; i < N; i++) {
int v, j;
cin >> v >> j;
j--;
books... | replace | 32 | 33 | 32 | 33 | 0 | |
p00484 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | insert | 40 | 40 | 40 | 41 | 0 | |
p00485 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
#include <vector>
#define fi first
#define sec second
#define INF 100000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int n, m, k;
int cost[3000][3000];
int cnt[3000];
vector<P> e[3000];
bool shop[... | #include <algorithm>
#include <cstdio>
#include <map>
#include <queue>
#include <vector>
#define fi first
#define sec second
#define INF 100000000
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int n, m, k;
int cost[3000][3000];
int cnt[3000];
vector<P> e[3000];
bool shop[... | insert | 34 | 34 | 34 | 36 | TLE | |
p00485 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
struct TOWN {
bool kaku;
int kyo;
vector<pair<int, int>> road;
TOWN() : kaku(false) {}
} town[3001];
int main() {
int n, m, k, a, b, l, ina[3000], inb[3... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
struct TOWN {
bool kaku;
int kyo;
vector<pair<int, int>> road;
TOWN() : kaku(false) {}
} town[3001];
int main() {
int n, m, k, a, b, l, ina[100000], inb... | replace | 20 | 21 | 20 | 21 | 0 | |
p00485 | C++ | Runtime Error | // #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#def... | // #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#def... | replace | 59 | 60 | 59 | 60 | 0 | |
p00485 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, M, K, A, B, L;
vector<vector<pair<int, int>>> G;
vector<int> P, D;
int main() {
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &K);
G = vector<vecto... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int N, M, K, A, B, L;
vector<vector<pair<int, int>>> G;
vector<int> P, D;
int main() {
scanf("%d", &N);
scanf("%d", &M);
scanf("%d", &K);
G = vector<vecto... | replace | 61 | 62 | 61 | 62 | MLE | |
p00486 | C++ | Memory Limit Exceeded | // JOI2010-2011本選問４歩くサンタクロース(Walking Santa)
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long sum = 0LL, osum = 0LL;
long long f1, f2, f3, w, h, L, HL, temp, oxy[2][2], *LXY[2], ox, oy, max = 0,
... | // JOI2010-2011本選問４歩くサンタクロース(Walking Santa)
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long sum = 0LL, osum = 0LL;
long long f1, f2, f3, w, h, L, HL, temp, oxy[2][2], *LXY[2], ox, oy, max = 0,
... | delete | 12 | 13 | 12 | 12 | MLE | |
p00486 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int ox[100000];
int oy[100000];
int x[100000];
int y[100000];
int n;
long long calc(int a, int b) {
int md = 0, i;
long long ans = 0;
for (i = 0; i < n; i++) {
int d = abs(ox[i] - a) + abs(oy[i] - b);
md = max(md, d);
ans... | #include <algorithm>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int ox[100000];
int oy[100000];
int x[100000];
int y[100000];
int n;
long long calc(int a, int b) {
int md = 0, i;
long long ans = 0;
for (i = 0; i < n; i++) {
int d = abs(ox[i] - a) + abs(oy[i] - b);
md = max(md, d);
ans... | replace | 40 | 42 | 40 | 42 | 0 | |
p00486 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define REP(i, n) for (l... | replace | 72 | 73 | 72 | 73 | TLE | |
p00486 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ALL(a) a.begin(), a.end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#d... | #include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ALL(a) a.begin(), a.end()
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, -1, sizeof(a))
#d... | replace | 35 | 37 | 35 | 37 | 0 | |
p00486 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, x, ...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i,... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, x, ...) x
#define REP1(i, s, cond, cal) for (signed i = signed(s); i cond; i cal)
#define REP2(i, s, n) REP1(i, s, < signed(n), ++)
#define REP3(i, n) REP2(i,... | replace | 91 | 92 | 91 | 92 | 0 | sh: 1: pause: not found
|
p00487 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int N, n;
pair<int, int> p[300000];
bool ok(int t) {
priority_queue<int> Q;
ll sum = 0;
for (int i = n - 1; i >= n - t + 1; i--) {
Q.push(p[i].second);
sum += p[i].second;
}
if (p[n - t... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int N, n;
pair<int, int> p[300000];
bool ok(int t) {
priority_queue<int> Q;
ll sum = 0;
for (int i = n - 1; i >= n - t + 1; i--) {
Q.push(p[i].second);
sum += p[i].second;
}
if (p[n - t... | replace | 17 | 18 | 17 | 18 | 0 | |
p00487 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
struct segtree {
vector<long long> dat;
int n;
segtree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.resize(2 * n, 0);
}
void update(int i, int x) {
i += n - 1;
int diff = x - dat[i... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
struct segtree {
vector<long long> dat;
int n;
segtree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.resize(2 * n, 0);
}
void update(int i, int x) {
i += n - 1;
int diff = x - dat[i... | delete | 98 | 102 | 98 | 98 | 1 | |
p00487 | C++ | Runtime Error | #include <bits/stdc++.h>
#define filein(t) freopen(t, "r", stdin)
#define fileout(t) freopen(t, "w", stdout)
#define f first
#define s second
#define cs 137
#define ll long long
#define mp make_pair
#define N 100025
#define ln 1e16
#define oo 111539786
#define Pa pair<int, int>
#define Pi pair<int, Pa>
using namespace... | #include <bits/stdc++.h>
#define filein(t) freopen(t, "r", stdin)
#define fileout(t) freopen(t, "w", stdout)
#define f first
#define s second
#define cs 137
#define ll long long
#define mp make_pair
#define N 300025
#define ln 1e16
#define oo 111539786
#define Pa pair<int, int>
#define Pi pair<int, Pa>
using namespace... | replace | 8 | 9 | 8 | 9 | 0 | |
p00489 | C++ | Runtime Error | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | replace | 10 | 11 | 10 | 11 | 0 | |
p00489 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int k, n, a[101], b[101], c[101], d[101], t[101] = {0};
int cnt;
cin >> n;
k = n * (n - 1) / 2;
for (int i = 0; i < k; i++)
cin >> a[i] >> b[i] >> c[i] >> d[i];
for (int i = 0; i < k; i++) {
if (c[i] > d[i])
t[a[i]] ... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int k, n, a[5001], b[5001], c[5001], d[5001], t[5001] = {0};
int cnt;
cin >> n;
k = n * (n - 1) / 2;
for (int i = 0; i < k; i++)
cin >> a[i] >> b[i] >> c[i] >> d[i];
for (int i = 0; i < k; i++) {
if (c[i] > d[i])
t[a... | replace | 6 | 7 | 6 | 7 | 0 | |
p00489 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s[100], cop[100], rank[100];
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c == d) {
s[a - 1]++;
s[b - 1]++;
} else {
(c > d ? s[a - 1] : s[b - 1]) += 3;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, s[101], cop[101], rank[10101];
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c == d) {
s[a - 1]++;
s[b - 1]++;
} else {
(c > d ? s[a - 1] : s[b - 1]) += 3;
... | replace | 4 | 5 | 4 | 5 | -11 | |
p00489 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int score[100] = {0}, a, b, c, d;
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
cin >> a >> b >> c >> d;
if (c > d) {
score[a - 1] += 3;
} else if (c < d) {
score[b - 1] += 3;
} else {
s... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int score[10000] = {0}, a, b, c, d;
cin >> n;
for (int i = 0; i < n * (n - 1) / 2; i++) {
cin >> a >> b >> c >> d;
if (c > d) {
score[a - 1] += 3;
} else if (c < d) {
score[b - 1] += 3;
} else {
... | replace | 6 | 7 | 6 | 7 | 0 | |
p00489 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int a[105], b[105], c[105], d[105];
int t[11000], k[105];
cin >> n;
for (int i = 0; i < (n * (n - 1)) / 2; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
t[i] = 0;
}
for (int i = 0; i < (n * (n - 1)) / 2; i++) {
if (... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int a[11000], b[11000], c[11000], d[11000];
int t[11000], k[11000];
cin >> n;
for (int i = 0; i < (n * (n - 1)) / 2; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
t[i] = 0;
}
for (int i = 0; i < (n * (n - 1)) / 2; i++) ... | replace | 7 | 9 | 7 | 9 | 0 | |
p00490 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int a, b;
int c;
int s[100];
int x, y;
cin >> n;
cin >> a >> b;
cin >> c;
for (int i = 1; i < n + 1; i++) {
cin >> s[i];
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
if (s[i] > s[j]) {
x... | #include <iostream>
using namespace std;
int main() {
int n;
int a, b;
int c;
int s[101];
int x, y;
cin >> n;
cin >> a >> b;
cin >> c;
for (int i = 1; i < n + 1; i++) {
cin >> s[i];
}
for (int i = 1; i < n + 1; i++) {
for (int j = 1; j < n + 1; j++) {
if (s[i] > s[j]) {
x... | replace | 7 | 8 | 7 | 8 | 0 | |
p00490 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int main() {
int n, a, b, base, top[100], cal[100];
std::cin >> n >> a >> b >> base;
for (int i = 0; i < n; i++)
std::cin >> top[i];
std::sort(top + 0, top + n);
std::reverse(top + 0, top + n);
for (int i = 0; i <= n; i++) {
int all_cal = base;
for (int ... | #include <algorithm>
#include <iostream>
int main() {
int n, a, b, base, top[101], cal[101];
std::cin >> n >> a >> b >> base;
for (int i = 0; i < n; i++)
std::cin >> top[i];
std::sort(top + 0, top + n);
std::reverse(top + 0, top + n);
for (int i = 0; i <= n; i++) {
int all_cal = base;
for (int ... | replace | 4 | 5 | 4 | 5 | 0 | |
p00491 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int MAX_N = 110;
int n, k;
in... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int MAX_N = 110;
int n, k;
in... | replace | 17 | 18 | 17 | 18 | 0 | |
p00491 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N, K, num;
int day[101];
int a[101][4][3];
long long int dp(int d, int k, int n) {
if (n == 3)
return 0;
if (d == N)
return a[d][k][n] = 1;
long long int b = 0;
if (day[d + 1] != -1) {
if (day[d + 1] == k) {
b += dp(d + 1, day[d + 1], n + ... | #include <bits/stdc++.h>
using namespace std;
int N, K, num;
int day[101];
int a[101][4][3];
long long int dp(int d, int k, int n) {
if (n == 3)
return 0;
if (a[d][k][n] >= 0)
return a[d][k][n];
if (d == N)
return a[d][k][n] = 1;
long long int b = 0;
if (day[d + 1] != -1) {
if (day[d + 1... | insert | 11 | 11 | 11 | 14 | TLE | |
p00492 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MP make_pair
typedef pair<int, int> PII;
int w, h, maps[102][102];
int dx[2][6] = {{0, 1, 0, -1, -1, -1}, {1, 1, 1, 0, -1, 0}};
int d... | #include <cstdio>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MP make_pair
typedef pair<int, int> PII;
int w, h, maps[102][102];
int dx[2][6] = {{0, 1, 0, -1, -1, -1}, {1, 1, 1, 0, -1, 0}};
int d... | insert | 32 | 32 | 32 | 34 | 0 | |
p00493 | C++ | Runtime Error | #include <iostream>
#include <string>
#define int long long
#define MOD 10000
using namespace std;
int m;
int dp[501][500][10][4][2] = {}; // keta,mod,prevnum,UorDorNoorZero,limit
int calc(string s) {
for (int i = 0; i <= s.length(); i++) {
for (int j = 0; j < m; j++) {
for (int k = 0; k < 10; k++) {
... | #include <iostream>
#include <string>
#define int long long
#define MOD 10000
using namespace std;
int m;
int dp[510][500][10][4][2] = {}; // keta,mod,prevnum,UorDorNoorZero,limit
int calc(string s) {
for (int i = 0; i <= s.length(); i++) {
for (int j = 0; j < m; j++) {
for (int k = 0; k < 10; k++) {
... | replace | 7 | 8 | 7 | 8 | -11 | |
p00493 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int mod = 10000;
string A, B, S;
int M;
int memo[1000][10][3][2][500];
int calc(int keta = 0, int mae = 0, int hoko = 0, int jiyuu = 0,
int amari = 0) {
if (keta == S.size()) {
return amari == 0;
}
if (~memo[keta][mae][hoko][jiyuu][amari])
ret... | #include <bits/stdc++.h>
using namespace std;
const int mod = 10000;
string A, B, S;
int M;
int memo[501][10][3][2][500];
int calc(int keta = 0, int mae = 0, int hoko = 0, int jiyuu = 0,
int amari = 0) {
if (keta == S.size()) {
return amari == 0;
}
if (~memo[keta][mae][hoko][jiyuu][amari])
retu... | replace | 6 | 7 | 6 | 7 | MLE | |
p00493 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include... | replace | 27 | 28 | 27 | 28 | -11 | |
p00493 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int dp[501][2][10][3][500];
// dp[a][b][c][d][e]:a桁目 b1で自由に使える0で自由に使えない 今の桁はc
// d1で前より上がってる2で前より下がってる0で前と変わらない eは余り
int MOD = 10000;
int M;
string A, B;
// 1~nまでのジグザグ数%10000
int calc(string n) {
for (int i = 0; i <= 500; i++)
for (int j = 0; j < 2; j+... | #include <iostream>
#include <string>
using namespace std;
int dp[501 + 10][2][10][3][500];
// dp[a][b][c][d][e]:a桁目 b1で自由に使える0で自由に使えない 今の桁はc
// d1で前より上がってる2で前より下がってる0で前と変わらない eは余り
int MOD = 10000;
int M;
string A, B;
// 1~nまでのジグザグ数%10000
int calc(string n) {
for (int i = 0; i <= 500; i++)
for (int j = 0; j < ... | replace | 5 | 6 | 5 | 6 | 0 | |
p00493 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
const int MOD = 10000;
std::string a, b; // <=1e500
int m; // <=500
int dp[2][2][510][510][15][3];
char Ch(int i) { return '0' + i; }
int func(bool lower, bool upper, int mod, int idx, int prev,
int stat) { // stat: 0:... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
const int MOD = 10000;
std::string a, b; // <=1e500
int m; // <=500
int dp[2][2][510][510][15][3];
char Ch(int i) { return '0' + i; }
int func(bool lower, bool upper, int mod, int idx, int prev,
int stat) { // stat: 0:... | replace | 93 | 94 | 93 | 94 | -11 | |
p00493 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
const int mod = 10000;
int dp[600][600][11][2][2];
string S, T;
int power[600], n;
int zen_shori(int Keta) {
for (int i = 0; i < 360000; i++) {
for (int j = 0; j < 10; j++) {
dp[i / 600][i % 600][j][0][0] = 0;
dp[i / 600][i % 600][j][0][1] = 0... | #include <iostream>
#include <string>
using namespace std;
const int mod = 10000;
int dp[600][600][11][2][2];
string S, T;
int power[600], n;
int zen_shori(int Keta) {
for (int i = 0; i < 360000; i++) {
for (int j = 0; j < 10; j++) {
dp[i / 600][i % 600][j][0][0] = 0;
dp[i / 600][i % 600][j][0][1] = 0... | replace | 144 | 145 | 144 | 145 | 0 | |
p00493 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
... | replace | 37 | 38 | 37 | 38 | 0 | |
p00494 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef double db;
#define fr first
#define sc second
#define pb push_back
... | replace | 54 | 55 | 54 | 55 | 0 | |
p00494 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (i = (j); (i) < (k); ++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (i = (j); (i) < (k); ++... | replace | 54 | 55 | 54 | 56 | TLE | |
p00494 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
int main() {
char s[1000001];
vector<pii> v;
cin >> s;
int l = strlen(s);
int cnt = 0;
int x;
for (int i = 0; i < l; i++) {
if (i > 0 && s[i] != s[i - 1]) {
v.push_bac... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
int main() {
char s[1000001];
vector<pii> v;
cin >> s;
int l = strlen(s);
int cnt = 0;
int x;
for (int i = 0; i < l; i++) {
if (i > 0 && s[i] != s[i - 1]) {
v.push_bac... | replace | 35 | 38 | 35 | 39 | 0 | |
p00494 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string S;
int main() {
cin >> S;
int res = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] != 'J')
continue;
int jc, oc, ic;
jc = oc = ic = 0;
int j;
for (j = i; j < S.... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string S;
int main() {
cin >> S;
int res = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] != 'J')
continue;
int jc, oc, ic;
jc = oc = ic = 0;
int j;
for (j = i; j < S.... | insert | 38 | 38 | 38 | 39 | TLE | |
p00494 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#defi... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#defi... | replace | 27 | 28 | 27 | 28 | 0 | |
p00494 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | replace | 33 | 36 | 33 | 39 | 0 | |
p00494 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<char, int> P;
string s;
int main() {
cin >> s;
vector<P> v;
char c = s[0];
int length = 1;
for (int i = 1; i < s.size(); i++) {
if (s[i] == c)
length++;
else {
v.push_back(P(c,... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<char, int> P;
string s;
int main() {
cin >> s;
vector<P> v;
char c = s[0];
int length = 1;
for (int i = 1; i < s.size(); i++) {
if (s[i] == c)
length++;
else {
v.push_back(P(c,... | insert | 28 | 28 | 28 | 33 | 0 | |
p00494 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORV(i, a, b) for (int i = a; i * i <= b; i++)
#define Forv(i, a, b) for (int i = a; i * i < b; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
#define Ford(i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define FORV(i, a, b) for (int i = a; i * i <= b; i++)
#define Forv(i, a, b) for (int i = a; i * i < b; i++)
#define For(i, a, b) for (int i = a; i < b; i++)
#define Ford(i... | replace | 49 | 51 | 49 | 57 | 0 | |
p00494 | C++ | Time Limit Exceeded | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algor... | //============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algor... | replace | 24 | 25 | 24 | 25 | TLE | |
p00494 | C++ | Time Limit Exceeded | //============================================================================
// Name : AOJ.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | //============================================================================
// Name : AOJ.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | replace | 22 | 23 | 22 | 23 | TLE | |
p00494 | C++ | Time Limit Exceeded | //============================================================================
// Name : AOJ.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | //============================================================================
// Name : AOJ.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | replace | 21 | 22 | 21 | 22 | TLE | |
p00494 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<char, int> P;
string s;
vector<P> x;
int main() {
cin >> s;
rep(i, s.size()) {
if (x.empty() || x.back().first != s[i]) {
x.push_back(P(s[i], 1));
} else {
... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<char, int> P;
string s;
vector<P> x;
int main() {
cin >> s;
rep(i, s.size()) {
if (x.empty() || x.back().first != s[i]) {
x.push_back(P(s[i], 1));
} else {
... | replace | 23 | 26 | 23 | 31 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.