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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00461 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int cont;
int kaisu[1000000] = {0};
int main() {
for (;;) {
string str;
int n;
int m;
bool flg = true;
int cont = 0;
char temp = -1;
cin >> n;
if (n == 0) {
break;
}
cin >> m;
cin >> str;
for (int... | #include <iostream>
#include <string>
using namespace std;
int cont;
int kaisu[1000000] = {0};
int main() {
for (;;) {
string str;
int n;
int m;
bool flg = true;
int cont = 0;
char temp = -1;
cin >> n;
if (n == 0) {
break;
}
cin >> m;
cin >> str;
for (int... | replace | 69 | 70 | 69 | 70 | TLE | |
p00461 | C++ | Time Limit Exceeded | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | replace | 83 | 86 | 83 | 90 | TLE | |
p00461 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
string s;
while (std::cin >> n >> m >> s, n) {
string p;
for (int i = 0; i < n; i++) {
p += "IO";
}
p += "I";
if (p.length() > s.length()) {
std::cout << 0 << std::endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
string s;
while (std::cin >> n >> m >> s, n) {
string p;
for (int i = 0; i < n; i++) {
p += "IO";
}
p += "I";
if (p.length() > s.length()) {
std::cout << 0 << std::endl;
return 0;
... | replace | 16 | 23 | 16 | 30 | TLE | |
p00462 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#in... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#in... | replace | 62 | 64 | 62 | 66 | TLE | |
p00462 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | replace | 51 | 52 | 51 | 52 | 0 | |
p00462 | C++ | Runtime Error | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int d, n, m;
while (cin >> d, d) {
cin >> n >> m;
int D[10001], M[10001];
;
D[0] = 0, D[n] = d;
for (int i = 1; i < n; i++)
cin >> D[i];
for (int... | #include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int main() {
int d, n, m;
while (cin >> d, d) {
cin >> n >> m;
int D[100001], M[100001];
;
D[0] = 0, D[n] = d;
for (int i = 1; i < n; i++)
cin >> D[i];
for (i... | replace | 11 | 12 | 11 | 12 | 0 | |
p00462 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int d, n, m, shop[100000], k[10000];
int main() {
while (true) {
cin >> d;
if (!d)
break;
cin >> n >> m;
for (int i = 1; i < n; i++) {
cin >> shop[i];
}
shop[0] = 0;
shop[n] = d;
for (int i = 0; i < m; i++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int d, n, m, shop[100001], k[10000];
int main() {
while (true) {
cin >> d;
if (!d)
break;
cin >> n >> m;
for (int i = 1; i < n; i++) {
cin >> shop[i];
}
shop[0] = 0;
shop[n] = d;
for (int i = 0; i < m; i++) {
... | replace | 4 | 5 | 4 | 5 | TLE | |
p00462 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
#define INF (1 << 29)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m, d, k;
int dist[100000];
while (cin >> d && d) {
int ans = 0;
cin >> n >> m;
rep(i, n - ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
using namespace std;
#define INF (1 << 29)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m, d, k;
int dist[100001];
while (cin >> d && d) {
int ans = 0;
cin >> n >> m;
rep(i, n - ... | replace | 11 | 12 | 11 | 12 | 0 | |
p00463 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define P pair<int, int>
using namespace std;
P e[10000];
int main() {
int a, b, c, d;
while (cin >> a >> b >> c >> d, a | b || c || d) {
int f[100... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define P pair<int, int>
using namespace std;
P e[100000];
int main() {
int a, b, c, d;
while (cin >> a >> b >> c >> d, a | b || c || d) {
int f[10... | replace | 12 | 13 | 12 | 13 | 0 | |
p00463 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
struct Border {
int position_height{0}, position_width{0};
};
void solve() {
int width, height, h, k;
std::cin >> width >> height >> h >> k;
while (width != 0 && height != 0) {
std::vector<int> start_pos(width);
std::vecto... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
struct Border {
int position_height{0}, position_width{0};
};
void solve() {
int width, height, h, k;
std::cin >> width >> height >> h >> k;
while (width != 0 && height != 0) {
std::vector<int> start_pos(width);
std::vecto... | replace | 52 | 53 | 52 | 53 | 0 | |
p00463 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
#define N 1000
#define M 100000
#define S second
#define F first
#define MP(i, j) make_pair((i), (j))
#define INF 1e9
typedef pair<int, int> P;
vector<int> vec[N + 1][2], vec2, vec3;
P yoko[M];
int s[N... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
#define N 1000
#define M 100000
#define S second
#define F first
#define MP(i, j) make_pair((i), (j))
#define INF 1e9
typedef pair<int, int> P;
vector<int> vec[N + 1][2], vec2, vec3;
P yoko[M];
int s[N... | replace | 50 | 51 | 50 | 51 | 0 | |
p00463 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include... | replace | 100 | 101 | 100 | 101 | 0 | |
p00463 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int s[1000], d[1000], y[1000];
P p[100000];
int main() {
int n, m, h, k;
while (scanf("%d%d%d%d", &n, &m, &h, &k), n) {
rep(i, n) scanf("%d", &s[i]);
rep(i, m) {
int a, b;
scanf... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int s[1000], d[1000], y[1000];
P p[100000];
int main() {
int n, m, h, k;
while (scanf("%d%d%d%d", &n, &m, &h, &k), n) {
rep(i, n) scanf("%d", &s[i]);
rep(i, m) {
int a, b;
scanf... | replace | 17 | 18 | 17 | 18 | 0 | |
p00463 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m, h, k;
typedef pair<int, int> P;
vector<P> ber;
long long int x[1001], ax[1001];
long long int sc[1001], scn[1001];
long long int yk[100001... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m, h, k;
typedef pair<int, int> P;
vector<P> ber;
long long int x[1001], ax[1001];
long long int sc[1001], scn[1001];
long long int yk[100001... | replace | 35 | 36 | 35 | 36 | -11 | |
p00464 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define pb push_back
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define pb push_back
#defi... | replace | 19 | 21 | 19 | 21 | 0 | |
p00464 | C++ | Runtime Error |
#include <stdio.h>
#include <string.h>
int board[1234][1234];
int mark[1234][1234];
int main() {
for (;;) {
int h, w, n;
scanf("%d %d %d", &h, &w, &n);
if (h == 0 && w == 0 && n == 0)
break;
memset(board, 255, sizeof(board));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j)... |
#include <stdio.h>
#include <string.h>
int board[1234][1234];
int mark[1234][1234];
int main() {
for (;;) {
int h, w, n;
scanf("%d %d %d", &h, &w, &n);
if (h == 0 && w == 0 && n == 0)
break;
memset(board, 255, sizeof(board));
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j)... | insert | 23 | 23 | 23 | 25 | 0 | |
p00464 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int h, w, n;
int a[1002][1002], b[1002][1002] = {0};
pair<int, int> walk(int x, int y) {
if (a[x][y] == 0)
x++;
else
y++;
if (x < h && y < w)
return walk(x, y);
pair<int, int> ret;
ret.first = x + 1;
ret.second = y + 1;
return ret;
}
int main() {
wh... | #include <iostream>
using namespace std;
int h, w, n;
int a[1002][1002], b[1002][1002] = {0};
pair<int, int> walk(int x, int y) {
if (a[x][y] == 0)
x++;
else
y++;
if (x < h && y < w)
return walk(x, y);
pair<int, int> ret;
ret.first = x + 1;
ret.second = y + 1;
return ret;
}
int main() {
wh... | insert | 21 | 21 | 21 | 23 | TLE | |
p00464 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int d[1005][1005];
bool e[1005][1005];
int a, b, c;
signed main() {
while (cin >> a >> b >> c, a | b | c) {
memset(d, 0, sizeof(d));
memset(e, false, sizeof(e));
for (int f = 0; f < a; f++) {
for (int g = 0; g < b; g++) {
scanf("%d", &e[f][g]);
... | #include <bits/stdc++.h>
using namespace std;
int d[3005][3005];
bool e[3005][3005];
int a, b, c;
signed main() {
while (cin >> a >> b >> c, a | b | c) {
memset(d, 0, sizeof(d));
memset(e, false, sizeof(e));
for (int f = 0; f < a; f++) {
for (int g = 0; g < b; g++) {
scanf("%d", &e[f][g]);
... | replace | 3 | 5 | 3 | 5 | 0 | |
p00464 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 2000
long long x[MAX_N][MAX_N];
long long dp[MAX_N][MAX_N];
int h, w, n, cx, cy;
int main() {
while (true) {
memset(dp, 0, sizeof(dp));
cin >> h >> w >> n;
if (h == 0 && w == 0 && n == 0) {
break;
}
... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 2000
long long x[MAX_N][MAX_N];
long long dp[MAX_N][MAX_N];
int h, w, n, cx, cy;
int main() {
while (true) {
memset(dp, 0, sizeof(dp));
cin >> h >> w >> n;
if (h == 0 && w == 0 && n == 0) {
break;
}
... | replace | 19 | 20 | 19 | 20 | -11 | |
p00465 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const LL INF = 1001001001001001;
int r, x[2], y[2];
LL grid[2][502][502];
bool done[2][502][502];
LL memo[2][5001];
struct P {
int g, x, y;
bool operator<(const P &t) const { return... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
const LL INF = 1001001001001001;
int r, x[2], y[2];
LL grid[2][502][502];
bool done[2][502][502];
LL memo[2][500001];
struct P {
int g, x, y;
bool operator<(const P &t) const { retu... | replace | 10 | 11 | 10 | 11 | 0 | |
p00465 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <queue>
#include <stdio.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
struct cxy {
int cost, x, y;
bool operator<(const cxy &rhs) const { return cost < rhs.cost; }
bool operator>(const cxy &rhs) const ... | #include <algorithm>
#include <functional>
#include <queue>
#include <stdio.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
struct cxy {
int cost, x, y;
bool operator<(const cxy &rhs) const { return cost < rhs.cost; }
bool operator>(const cxy &rhs) const ... | replace | 65 | 66 | 65 | 66 | 0 | |
p00465 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, pair<int, int>> pp;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int level[2][100001];
int room[500][500];
bool visited[500][500];
int main() {
int r;
while (cin >> r, r) {
int w, h, ex, ey;
... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, pair<int, int>> pp;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int level[2][250001];
int room[500][500];
bool visited[500][500];
int main() {
int r;
while (cin >> r, r) {
int w, h, ex, ey;
... | replace | 9 | 10 | 9 | 10 | 0 | |
p00465 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int w[2], h[2], l[2][500][500], sx[2], sy[2], r;
int dx[]{1, -1, 0, 0}, dy[]{0, 0, 1, -1};
int ans[2][100001], d[250000];
bool vis[500][500], used[500][500];
deque<P> que[250000];
int compress(int k) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int w[2], h[2], l[2][500][500], sx[2], sy[2], r;
int dx[]{1, -1, 0, 0}, dy[]{0, 0, 1, -1};
int ans[2][100001], d[250000];
bool vis[500][500], used[500][500];
vector<P> que[250000];
int compress(int k) ... | replace | 9 | 10 | 9 | 10 | MLE | |
p00466 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int main(void) {
int a, b;
while (scanf("%d", &a) != 0) {
int c = 0;
for (int i = 1; i < 10; i++) {
scanf("%d", &b);
c += b;
}
c = a - c;
printf("%d\n", c);
}
return 0;
} | #include <cstdio>
using namespace std;
int main(void) {
int a, b;
while (scanf("%d", &a)) {
if (a == 0)
break;
int c = 0;
for (int i = 1; i < 10; i++) {
scanf("%d", &b);
c += b;
}
c = a - c;
printf("%d\n", c);
}
return 0;
} | replace | 5 | 6 | 5 | 8 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c, d;
cin >> a;
if (a == 0) {
break;
}
d = 0;
for (b = 0; b < 10; b++) {
cin >> c;
d = d + c;
}
b = a - d;
cout << b << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c, d;
cin >> a;
if (a == 0) {
break;
}
d = 0;
for (b = 0; b < 9; b++) {
cin >> c;
d = d + c;
}
b = a - d;
cout << b << endl;
}
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
while (1) {
int n;
int a;
int sum = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < 10; i++) {
cin >> a;
sum += a;
}
a = n - sum;
cout << a << endl;
}
return 0... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
while (1) {
int n;
int a;
int sum = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < 9; i++) {
cin >> a;
sum += a;
}
a = n - sum;
cout << a << endl;
}
return 0;... | replace | 13 | 14 | 13 | 14 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int sum = 0, in;
while (cin >> sum, sum) {
for (int i = 0; i < 10; i++) {
cin >> in;
sum -= in;
}
cout << sum << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int sum = 0, in;
while (cin >> sum, sum) {
for (int i = 0; i < 9; i++) {
cin >> in;
sum -= in;
}
cout << sum << endl;
}
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, n = 1, i = 0;
cin >> a;
do {
if (a > 10000) {
break;
}
cin >> b;
a = a - b;
i++;
if (i = 9 * n) {
cout << a << endl;
n++;
}
} while (i <= 9 * n);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int total;
cin >> total;
while (total != 0) {
int a, b, c, d, e, f, g, h, i, j;
cin >> a >> b >> c >> d >> e >> f >> g >> h >> i;
j = total - (a + b + c + d + e + f + g + h + i);
cout << j << endl;
cin >> total;
}
return 0;
} | replace | 3 | 18 | 3 | 12 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int total;
int books;
int count = 0;
while (true) {
if (count == 0) {
cin >> total;
if (total == 0) {
break;
}
count++;
} else {
cin >> books;
total -= books;
count++;
}
if (count == 10) {
... | #include <iostream>
using namespace std;
int main() {
int total;
int books;
int count = 0;
while (true) {
if (count == 0) {
cin >> total;
if (total == 0) {
break;
}
count++;
} else {
cin >> books;
total -= books;
count++;
}
if (count == 10) {
... | insert | 22 | 22 | 22 | 23 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | replace | 52 | 53 | 52 | 53 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a;
while (1) {
int ruio = 0;
for (int i = 0; i < 9; i++) {
cin >> b;
ruio += b;
}
cout << a - ruio << endl;
cin >> a;
}
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a;
while (a != 0) {
int ruio = 0;
for (int i = 0; i < 9; i++) {
cin >> b;
ruio += b;
}
cout << a - ruio << endl;
cin >> a;
}
} | replace | 5 | 6 | 5 | 6 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a;
while (cin >> s, s) {
cin >> s;
for (int i = 0; i < 9; i++) {
cin >> a;
s -= a;
}
cout << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int s, a;
while (cin >> s) {
if (s == 0)
break;
for (int i = 0; i < 9; i++) {
cin >> a;
s -= a;
}
cout << s << endl;
}
} | replace | 5 | 7 | 5 | 8 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int total;
cin >> total;
int a, b, c, d, e, f, g, h, i, j;
while (total != 0) {
cin >> a >> b >> c >> d >> e >> f >> g >> h >> i >> j;
j = total - (a + b + c + d + e + f + g + h + i);
cout << j << '\n';
cin >> total;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int total;
cin >> total;
int a, b, c, d, e, f, g, h, i, j;
while (total != 0) {
cin >> a >> b >> c >> d >> e >> f >> g >> h >> i;
j = total - (a + b + c + d + e + f + g + h + i);
cout << j << '\n';
cin >> total;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int main() {
while (1) {
int n;
scanf("%d", &n);
for (int i = 0; i < 9; i++) {
int c;
scanf("%d", &c);
n -= c;
}
printf("%d\n", n);
}
} | #include <cstdio>
using namespace std;
int main() {
while (1) {
int n;
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < 9; i++) {
int c;
scanf("%d", &c);
n -= c;
}
printf("%d\n", n);
}
} | insert | 6 | 6 | 6 | 8 | TLE | |
p00466 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int sum;
int value[9];
while (cin >> sum || sum) {
for (int i = 0; i < 9; i++) {
cin >> value[i];
sum -= value[i];
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int sum;
int value[9];
while (cin >> sum, sum) {
for (int i = 0; i < 9; i++) {
cin >> value[i];
sum -= value[i];
}
cout << sum << endl;
}
return 0;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p00467 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int masu[4000], n, m, iti, f;
while (cin >> n >> m) {
if (n == 0) {
break;
}
iti = f = 1;
for (int i = 1; i <= n + m; i++) {
cin >> masu[i];
if (i > n) {
iti += masu[i];
iti += masu[iti];
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int masu[9000], n, m, iti, f;
while (cin >> n >> m) {
if (n == 0) {
break;
}
iti = f = 1;
for (int i = 1; i <= n + m; i++) {
cin >> masu[i];
if (i > n) {
iti += masu[i];
iti += masu[iti];
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00467 | C++ | Runtime Error | #include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m | scanf("%d", &s[i]); i++) {
;
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
} | #include <stdio.h>
int main() {
int s[9000], n, m, t, f, i;
while (scanf("%d%d", &n, &m), n)
for (i = t = f = 1; i <= n + m; i++) {
scanf("%d", &s[i]);
if (i > n)
if (t += s[t += s[i]], t >= n & f == 1)
printf("%d\n", i - n, f = 0);
}
} | replace | 4 | 6 | 4 | 6 | -11 | |
p00467 | C++ | Runtime Error | #include <iostream>
using namespace std;
#include <cstring>
int main() {
int n, m;
cin >> n >> m;
while (n != 0 && m != 0) {
int date[1024];
memset(date, 0, sizeof(date));
for (int i = 0; i < n; ++i) {
cin >> date[i];
}
int me;
int point = 0;
int ans;
bool flg = true;
fo... | #include <iostream>
using namespace std;
#include <cstring>
int main() {
int n, m;
while (cin >> n >> m && n != 0 && m != 0) {
int date[1024];
memset(date, 0, sizeof(date));
for (int i = 0; i < n; ++i) {
cin >> date[i];
}
int me;
int point = 0;
int ans;
bool flg = true;
f... | replace | 6 | 8 | 6 | 8 | TLE | |
p00467 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, a) for (i = 0; i < a; i++)
using namespace std;
int main(void) {
int n, m, d, i, cnt = 0, now = 0, flag = 0, x[3001] = {0};
cin >> n >> m;
while (n != 0 && m != 0) {
fo(i, n) cin >> x[i];
i = 0;
fo(i, m) {
cin >> d;
now += d + x[now + d];
if (f... | #include <bits/stdc++.h>
#define fo(i, a) for (i = 0; i < a; i++)
using namespace std;
int main(void) {
int n, m, d, i, cnt = 0, now = 0, flag = 0, x[3001] = {0};
cin >> n >> m;
while (n != 0 && m != 0) {
fo(i, n) cin >> x[i];
i = 0;
fo(i, m) {
cin >> d;
now += d + x[now + d];
now ... | insert | 13 | 13 | 13 | 16 | 0 | |
p00467 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n, m, l[1024] = {0}, i, x, p, a;
while (1) {
scanf("%d%d", &n, &m);
p = 0;
a = 0;
if (n == 0 && m == 0) {
break;
}
for (i = 0; i < 1024; i++) {
l[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
}
for (i = 0; i < ... | #include <stdio.h>
int main() {
int n, m, l[10000], i, x, p, a;
while (1) {
scanf("%d%d", &n, &m);
p = 0;
a = 0;
if (n == 0 && m == 0) {
break;
}
for (i = 0; i < 1024; i++) {
l[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &l[i]);
}
for (i = 0; i < m; i+... | replace | 2 | 3 | 2 | 3 | 0 | |
p00467 | C++ | Runtime Error | #include <iostream>
using namespace std;
int t[2000], n, m, a, ans, pos;
void init() {
for (int i = 0; i < 2000; i++)
t[i] = 0;
}
int main() {
while (cin >> n >> m && n && m) {
init();
for (int i = 0; i < n; i++)
cin >> t[i];
ans = -1, pos = 0;
for (int i = 0; i < m; i++) {
cin >> a;... | #include <iostream>
using namespace std;
int t[2000], n, m, a, ans, pos;
void init() {
for (int i = 0; i < 2000; i++)
t[i] = 0;
}
int main() {
while (cin >> n >> m && n && m) {
init();
for (int i = 0; i < n; i++)
cin >> t[i];
ans = -1, pos = 0;
for (int i = 0; i < m; i++) {
cin >> a;... | replace | 15 | 21 | 15 | 23 | 0 | |
p00467 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, m;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
int mas[n], me[m];
for (int i = 0; i < n; i++)
scanf("%d", &mas[i]);
for (int i = 0; i < m; i++)
scanf("... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, m;
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
int mas[n], me[m];
for (int i = 0; i < n; i++)
scanf("%d", &mas[i]);
for (int i = 0; i < m; i++)
scanf("... | replace | 19 | 20 | 19 | 20 | 0 | |
p00467 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 1000
int main() {
int n, m;
int ms[MAX + 1];
while (true) {
cin >> n >> m;
if (!n && !m)
break;
for (int i = 0; i < n; i++)
cin >> ms[i];
int go, t = 0, cnt = 0;
bool flg = false;
for (int i = 0; i < m; i++) {
cin ... | #include <iostream>
using namespace std;
#define MAX 2000
int main() {
int n, m;
int ms[MAX + 1];
while (true) {
cin >> n >> m;
if (!n && !m)
break;
for (int i = 0; i < n; i++)
cin >> ms[i];
int go, t = 0, cnt = 0;
bool flg = false;
for (int i = 0; i < m; i++) {
cin ... | replace | 2 | 3 | 2 | 3 | 0 | |
p00467 | C++ | Runtime Error | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n || m) {
int ans =... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) range(i, 0, b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n || m) {
int ans =... | insert | 17 | 17 | 17 | 18 | -11 | |
p00467 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int pos = 0;
int n, m;
int cnt = 0;
while (cin >> n >> m, n) {
int array[n];
cnt = 0;
pos = 0;
for (int i = 0; i < n; i++) {
cin >> array[i];
}
for (int i = 0; i < m; i++) {
int tmp;
cin >> tmp;
if (pos < n) {... | #include <iostream>
using namespace std;
int main() {
int pos = 0;
int n, m;
int cnt = 0;
int array[n];
while (cin >> n >> m) {
if (n == 0)
break;
cnt = 0;
pos = 0;
for (int i = 0; i < n; i++) {
cin >> array[i];
}
for (int i = 0; i < m; i++) {
int tmp;
cin >> t... | replace | 7 | 9 | 7 | 11 | 0 | |
p00467 | C++ | Runtime Error | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
if (a + b == 0)
break;
int m[a], w = 0, o[b], c = 0;
r(i, a) cin >> m[i];
r(i, b) cin >> o[i];
r(i, b) {
c++;
w += o[i];
w += m[w];
... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
if (a + b == 0)
break;
int m[1100], w = 0, o[1100], c = 0;
r(i, a) cin >> m[i];
r(i, b) cin >> o[i];
r(i, b) {
c++;
w += o[i];
w += m[w... | replace | 8 | 9 | 8 | 9 | 0 | |
p00467 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | replace | 56 | 62 | 56 | 67 | 0 | |
p00467 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#includ... | delete | 216 | 217 | 216 | 216 | TLE | |
p00467 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int n, m, c, g, a[10000];
int main() {
while (true) {
cin >> n >> m;
c = 1;
g = 0;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++) {
int p;
cin >> p;
c += p;
c += a[c];
if (c >= n && g == 0) {
... | #include <iostream>
using namespace std;
int n, m, c, g, a[10000];
int main() {
while (true) {
cin >> n >> m;
c = 1;
g = 0;
if (n == 0 && m == 0)
break;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= m; i++) {
int p;
cin >> p;
c += p;
c += a[... | insert | 8 | 8 | 8 | 10 | TLE | |
p00467 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int n, m;
int now = 1;
int field[110] = {0}, sai[110] = {0};
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (int i = 1; i <= n; i++) {
cin >> field[i];
}
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
int n, m;
int now = 1;
int field[1010] = {0}, sai[1010] = {0};
cin >> n >> m;
if (n == 0 && m == 0)
break;
for (int i = 1; i <= n; i++) {
cin >> field[i];
... | replace | 9 | 10 | 9 | 10 | TLE | |
p00467 | C++ | Runtime Error | #include <iostream>
#define MAX 2048
using namespace std;
int main() {
while (true) {
int ans = 0;
int pos = 0;
int n, m;
int sg[MAX];
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; ++i) {
scanf("%d", &sg[i]);
}
bool end = false;
for (int... | #include <iostream>
#define MAX 2048
using namespace std;
int main() {
while (true) {
int ans = 0;
int pos = 0;
int n, m;
int sg[MAX];
scanf("%d%d", &n, &m);
if (n == 0 && m == 0)
break;
for (int i = 0; i < n; ++i) {
scanf("%d", &sg[i]);
}
bool end = false;
for (int... | replace | 20 | 29 | 20 | 32 | 0 | |
p00467 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int N, M;
int field[... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for (int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for (int i = j; i >= 0; --i)
#define INF (1 << 30)
#define MOD 1e9 + 7
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
int N, M;
int field[... | replace | 15 | 16 | 15 | 16 | 0 | |
p00467 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
... | replace | 31 | 32 | 31 | 33 | 0 | |
p00467 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
while (true) {
int m = 0, n = 0, move[1000] = {}, turn = 0, flag = 0;
double masu[1000] = {};
cin >> m >> n;
if (n == 0 || m == 0)
break;
for (int i = 0; i < m; i++) {
cin >> masu[i];
}
for (int i = 0; i < n; i++) {
c... | #include <iostream>
using namespace std;
int main() {
while (true) {
int m = 0, n = 0, move[1000] = {}, turn = 0, flag = 0;
double masu[1000] = {};
cin >> m >> n;
if (n == 0 || m == 0)
break;
for (int i = 0; i < m; i++) {
cin >> masu[i];
}
for (int i = 0; i < n; i++) {
c... | replace | 20 | 21 | 20 | 21 | 0 | |
p00468 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int n, m;
pair<int, int> p[512];
while (scanf("%d%d", &n, &m), n | m) {
set<int> st1, st2;
st1.insert(1);
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
int main() {
int n, m;
pair<int, int> p[10010];
while (cin >> n >> m, n | m) {
set<int> st1, st2;
st1.insert(1);
rep... | replace | 11 | 13 | 11 | 13 | 0 | |
p00468 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M, N || M) {
vector<int> v[500];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v[a - 1].push_back(b - 1);
v[b - 1].push_back(a - 1);
}
bool f[500] = {0};
for (... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M, N || M) {
vector<int> v[500];
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
v[a - 1].push_back(b - 1);
v[b - 1].push_back(a - 1);
}
bool f[500] = {0};
for (... | replace | 19 | 20 | 19 | 20 | 0 | |
p00468 | C++ | Runtime Error | #include <cstdio>
constexpr int MAX_N = 500;
constexpr int MAX_M = 10000;
int N, M;
int e[MAX_N][MAX_N];
bool flag[MAX_N] = {false};
int dfs(int n = 0, int depth = 0) {
if (depth == 2) {
if (flag[n]) {
return 0;
} else {
flag[n] = true;
return 1;
}
}
int res = 0;
if (!flag[n]) ... | #include <cstdio>
constexpr int MAX_N = 500;
constexpr int MAX_M = 10000;
int N, M;
int e[MAX_N][MAX_N];
bool flag[MAX_N] = {false};
int dfs(int n = 0, int depth = 0) {
if (depth == 2) {
if (flag[n]) {
return 0;
} else {
flag[n] = true;
return 1;
}
}
int res = 0;
if (!flag[n]) ... | replace | 43 | 44 | 43 | 44 | 0 | |
p00468 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | replace | 19 | 20 | 19 | 20 | -11 | |
p00468 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<vector<bool>> relation(n, vector<bool>(n));
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
relation[a][b] = relation[b][a] = true;
}
vector<bool> fr... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<vector<bool>> relation(n, vector<bool>(n));
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
a--;
b--;
relation[a][b] = relation[b][a] = true;
}
vector<bool> fr... | replace | 7 | 8 | 7 | 8 | -11 | |
p00469 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 29)
set<string> st;
void solve(int K, int S, vector<string> &s, string str) {
if (K == 0) {
st.insert(str);
}
int N = s.size();
for (int i = 0; i < N; i++) {
if (S >> i & 1)
continue;
solve(K - 1, S | (1 << i), s, str + s[i])... | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 29)
set<string> st;
void solve(int K, int S, vector<string> &s, string str) {
if (K == 0) {
st.insert(str);
return;
}
int N = s.size();
for (int i = 0; i < N; i++) {
if (S >> i & 1)
continue;
solve(K - 1, S | (1 << i), s,... | insert | 11 | 11 | 11 | 12 | TLE | |
p00469 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, k;
string a[11];
set<string> all;
bool flag[11];
void solve(int num, string s) {
if (num == k) {
all.insert(s);
}
for (int i = 0; i < n; i++) {
if (flag[i])
continue;
flag[i] = true;
solve(num + 1, s + a[i]);
flag[i] = false;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int n, k;
string a[11];
set<string> all;
bool flag[11];
void solve(int num, string s) {
if (num == k) {
all.insert(s);
return;
}
for (int i = 0; i < n; i++) {
if (flag[i])
continue;
flag[i] = true;
solve(num + 1, s + a[i]);
flag[i] = fa... | insert | 11 | 11 | 11 | 12 | TLE | |
p00469 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
while (1) {
int a, b, c, x[11];
vector<int> vec;
scanf("%d", &a);
scanf("%d", &b);
for (int i = 0; i < a; i++) {
scanf("%d", &x[i]);
}
if (b == 2) {
for (int i = 0; i < a; i++) {
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
while (1) {
int a, b, c, x[11];
vector<int> vec;
scanf("%d", &a);
scanf("%d", &b);
if (a == 0) {
break;
}
for (int i = 0; i < a; i++) {
scanf("%d", &x[i]);
}
if (b == 2) {
f... | insert | 10 | 10 | 10 | 13 | -11 | |
p00469 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
template <class BidirectionalIterator>
bool next_combination(BidirectionalIterator first1, Bid... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
template <class BidirectionalIterator>
bool next_combination(BidirectionalIterator first1, Bid... | replace | 73 | 80 | 73 | 83 | TLE | |
p00469 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#include <set>
using namespace std;
set<int> se;
int N, K;
int card[10];
bool used[10];
void rec(int num, int k) {
if (k == K) {
se.insert(num);
return;
}
for (int i = 0; i < N; i++) {
if (used[i] == true)
continue;
used[i] = true;
int nnum;
... | #include <cstdio>
#include <cstring>
#include <set>
using namespace std;
set<int> se;
int N, K;
int card[10];
bool used[10];
void rec(int num, int k) {
if (k == K) {
se.insert(num);
return;
}
for (int i = 0; i < N; i++) {
if (used[i] == true)
continue;
used[i] = true;
int nnum;
... | insert | 35 | 35 | 35 | 37 | TLE | |
p00469 | C++ | Memory Limit Exceeded | #include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#ifdef _MSC_VER
#define __builtin_popcount __popcnt
#endif
int n, m;
int main() {
while (cin >> n >> m, n) {
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<set<ll>>... | #include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#ifdef _MSC_VER
#define __builtin_popcount __popcnt
#endif
int n, m;
int main() {
while (cin >> n >> m, n) {
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<set<ll>>... | insert | 21 | 21 | 21 | 23 | MLE | |
p00469 | C++ | Time Limit Exceeded | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | replace | 86 | 87 | 86 | 87 | TLE | |
p00470 | C++ | Runtime Error | #include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int w, h;
while (cin >> w >> h) {
static int dp[111][111][4];
for (int i = 0; i < 111; i++)
for (int j = 0; j < 111; j++)
for (int k = 0; k < 4; k++)
dp[i][j][k] = 0;
for (int i = 0; i < ... | #include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int w, h;
while (cin >> w >> h && h | w) {
static int dp[111][111][4];
for (int i = 0; i < 111; i++)
for (int j = 0; j < 111; j++)
for (int k = 0; k < 4; k++)
dp[i][j][k] = 0;
for (int i ... | replace | 7 | 8 | 7 | 8 | 0 | |
p00470 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int w, h;
int dp[100][100][2][2];
int main() {
while (1) {
scanf("%d %d", &w, &h);
for (int i = 1; i < w; i++) {
dp[i][0][1][1] = 1;
}
for (int j = 1; j < h; j++) {
dp[0][j][0][0] = 1;
}
for (int i = 1; i < w; i++) {
for (int j = 1; j ... | #include <cstdio>
using namespace std;
int w, h;
int dp[100][100][2][2];
int main() {
while (1) {
scanf("%d %d", &w, &h);
if (w == 0 && h == 0)
break;
for (int i = 1; i < w; i++) {
dp[i][0][1][1] = 1;
}
for (int j = 1; j < h; j++) {
dp[0][j][0][0] = 1;
}
for (int i = 1;... | insert | 9 | 9 | 9 | 11 | TLE | |
p00470 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#defi... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
#define drep(i, n) for (int i = n; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#defi... | insert | 20 | 20 | 20 | 22 | TLE | |
p00470 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define LL long long
static const LL INF = 1 << 24;
static const LL LL_INF = 1 << 60;
static const int mod = 1e+5;
static const int MAX_N = 100;
int dx[] = {0, 1};
int dy[] = {1, 0};
using namespace std;
int w, h;
LL mem[MAX_N][MAX_N][2][2][2][... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define LL long long
static const LL INF = 1 << 24;
static const LL LL_INF = 1 << 60;
static const int mod = 1e+5;
static const int MAX_N = 101;
int dx[] = {0, 1};
int dy[] = {1, 0};
using namespace std;
int w, h;
LL mem[MAX_N][MAX_N][2][2][2][... | replace | 6 | 7 | 6 | 7 | 0 | |
p00471 | C++ | Memory Limit Exceeded | #include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int x, y;
int sx, sy;
int N;
int hx[24], hy[24];
int fie[12][12];
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
map<int, int> memo[24];
int dfs(int pos, int bit, bool done[12][12], int home) {
if (mem... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int x, y;
int sx, sy;
int N;
int hx[24], hy[24];
int fie[12][12];
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
map<int, int> memo[24];
int dfs(int pos, int bit, bool done[12][12], int home) {
if (mem... | replace | 42 | 43 | 42 | 43 | MLE | |
p00471 | C++ | Time Limit Exceeded | #include <cstdio>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
struct P {
int x, y;
P() {}
P(int X, int Y) : x(X), y(Y) {}
};
map<int, int> dp[24];
int adj[24][4][23], deg[24][4], house_num;
int dfs(int id, int picke... | #include <cstdio>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
struct P {
int x, y;
P() {}
P(int X, int Y) : x(X), y(Y) {}
};
map<int, int> dp[24];
int adj[24][4][23], deg[24][4], house_num;
int dfs(int id, int picke... | replace | 35 | 36 | 35 | 36 | TLE | |
p00471 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define F first
#define S second
using namespace std;
int n, m;
int c;
int f[22][22];
typedef pair<int, int> P;
vector<P> v;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool used[33]... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define F first
#define S second
using namespace std;
int n, m;
int c;
int f[22][22];
typedef pair<int, int> P;
vector<P> v;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool used[33]... | replace | 51 | 52 | 51 | 52 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int px[24], py[24], kx, ky;
int num[24][4] = {0};
int H, W, N, ans;
int field[12][12] = {0};
int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
bool done[12][12];
map<int, int> memo... | #include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int px[24], py[24], kx, ky;
int num[24][4] = {0};
int H, W, N, ans;
int field[12][12] = {0};
int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
bool done[12][12];
map<int, int> memo... | replace | 44 | 45 | 44 | 49 | MLE | |
p00471 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <string.h>
int map[10 + 2][10 + 2];
int housecnt;
int ans;
int cathx, cathy;
int calc(int x, int y, int depth) {
int i;
if (depth == housecnt && (cathx == x || cathy == y)) {
ans++;
return (0);
}
map[x][y] = 0;
i = 1;
while (map[x + i][y] == 0)
i++;
if (map[x +... | #include <stdio.h>
#include <string.h>
int map[10 + 2][10 + 2];
int housecnt;
int ans;
int cathx, cathy;
int calc(int x, int y, int depth) {
int i;
if (depth == housecnt && (cathx == x || cathy == y)) {
ans++;
return (0);
}
map[x][y] = 0;
i = 1;
while (map[x + i][y] == 0)
i++;
if (map[x +... | insert | 53 | 53 | 53 | 57 | TLE | |
p00471 | C++ | Memory Limit Exceeded | #include <cstdio>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int m, n, pn, tmp;
int ans, upper;
map<int, int> dp[24];
// int dp[24][1<<18];
P pos[24];
int g[10][10];
int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
int rec(int vis, int id) {
if (dp[id].count(vis))
return dp... | #include <cstdio>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int m, n, pn, tmp;
int ans, upper;
map<int, int> dp[24];
// int dp[24][1<<18];
P pos[24];
int g[10][10];
int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
int rec(int vis, int id) {
if (dp[id].count(vis))
return dp... | replace | 46 | 47 | 46 | 47 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 52 | 53 | 52 | 53 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
typedef pair<int, int> state;
int main() {
int n, m, field[10][10];
while (cin >> m >> n, n) {
int cnt = 0, x[25], y[25], sx, sy, res = 0;
map<state, int> ans;
fo... | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
typedef pair<int, int> state;
int main() {
int n, m, field[10][10];
while (cin >> m >> n, n) {
int cnt = 0, x[25], y[25], sx, sy, res = 0;
map<state, int> ans;
fo... | insert | 58 | 58 | 58 | 59 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <cstdlib>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
#define operation(x, y) \
{ \
if (house[y][x] >= 0 && !((visited >> hou... | #include <cstdlib>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
#define operation(x, y) \
{ \
if (house[y][x] >= 0 && !((visited >> hou... | replace | 45 | 46 | 45 | 49 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define pb push_back
#define all(x) (x).beg... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define pb push_back
#define all(x) (x).beg... | replace | 30 | 32 | 30 | 33 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define F first
#define S second
using namespace std;
int n, m;
int c;
int f[22][22];
typedef pair<int, int> P;
vector<P> v;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool used[33]... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define F first
#define S second
using namespace std;
int n, m;
int c;
int f[22][22];
typedef pair<int, int> P;
vector<P> v;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool used[33]... | replace | 51 | 52 | 51 | 52 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <iostream>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
class range {
private:
struct Iterator {
int val;
int operator*() { return val; }
bool operator!=(Iterator &itr) { return val < itr.val; }
void operator++() { ++val; }
};
Iterator i, n;
p... | #include <iostream>
#include <map>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
class range {
private:
struct Iterator {
int val;
int operator*() { return val; }
bool operator!=(Iterator &itr) { return val < itr.val; }
void operator++() { ++val; }
};
Iterator i, n;
p... | insert | 91 | 91 | 91 | 92 | MLE | |
p00471 | C++ | Memory Limit Exceeded | #include <cstdlib>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
#define operation(x, y) \
{ \
if (house[y][x] >= 0 && !((visited >> hou... | #include <cstdlib>
#include <iostream>
#include <map>
#include <utility>
#include <vector>
using namespace std;
#define operation(x, y) \
{ \
if (house[y][x] >= 0 && !((visited >> hou... | replace | 45 | 46 | 45 | 46 | MLE | |
p00472 | C++ | Runtime Error | // 57
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int d[10000] = {};
for (int i = 1; i < n; i++) {
cin >> d[i];
d[i] += d[i - 1];
}
int p = 0;
int s = 0;
while (m--) {
int a;
cin >> a;
s = (s + abs(d[p] - d[p + a])) % 100000;
... | // 57
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int d[100000] = {};
for (int i = 1; i < n; i++) {
cin >> d[i];
d[i] += d[i - 1];
}
int p = 0;
int s = 0;
while (m--) {
int a;
cin >> a;
s = (s + abs(d[p] - d[p + a])) % 100000;
... | replace | 9 | 10 | 9 | 10 | 0 | |
p00472 | C++ | Runtime Error | #include <iostream>
const int MAX_N = 1 << 17, MOD = 100000; // ちょっと多いけど気にしないし
class SegmentTree {
public:
SegmentTree(int _n) {
n = 1;
while (n < _n)
n *= 2;
std::fill(data, data + MAX_N, 0);
}
void update(int k, int i) {
k += n - 1;
data[k] = i;
while (k > 0) {
k = (k - 1) ... | #include <iostream>
const int MAX_N = 1 << 18,
MOD = 100000; // ちょっと多いけど気にしないし(少なかったし)
class SegmentTree {
public:
SegmentTree(int _n) {
n = 1;
while (n < _n)
n *= 2;
std::fill(data, data + MAX_N, 0);
}
void update(int k, int i) {
k += n - 1;
data[k] = i;
while (k > 0) {
... | replace | 2 | 3 | 2 | 4 | 0 | |
p00472 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#def... | replace | 39 | 40 | 39 | 40 | 0 | |
p00472 | C++ | Time Limit Exceeded | #include <algorithm> // require sort next_permutation count etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits> // require INT_MAX etc
#include <cmath> // require sqrt ceil floor
#include <cstdio> // require printf
#include <cstdlib> // require abs
#include <cstring> // require... | #include <algorithm> // require sort next_permutation count etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits> // require INT_MAX etc
#include <cmath> // require sqrt ceil floor
#include <cstdio> // require printf
#include <cstdlib> // require abs
#include <cstring> // require... | replace | 46 | 53 | 46 | 54 | TLE | |
p00472 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
int main() {
int town[100] = {0};
int n, m;
int ans = 0;
int now = 0;
scanf("%d%d", &n, &m);
town[0] = 0;
for (int i = 1; i < n; i++) {
scanf("%d", &town[i]);
}
/*
for(int i = 0; i < n; i++)
printf("town%d:%d\n", ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
int main() {
int town[1000000] = {0};
int n, m;
int ans = 0;
int now = 0;
scanf("%d%d", &n, &m);
town[0] = 0;
for (int i = 1; i < n; i++) {
scanf("%d", &town[i]);
}
/*
for(int i = 0; i < n; i++)
printf("town%d:%d\... | replace | 6 | 7 | 6 | 7 | 0 | |
p00472 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
for (; cin >> n >> m, n;) {
long long int map[n + 2];
long long int sum = 0;
map[1] = 0;
for (int i = 2; i <= n; i++) {
int tmp;
cin >> tmp;
sum += tmp;
map[i] = sum;
// cout<<"map["... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
for (; cin >> n >> m;) {
long long int map[n + 2];
long long int sum = 0;
map[1] = 0;
for (int i = 2; i <= n; i++) {
int tmp;
cin >> tmp;
sum += tmp;
map[i] = sum;
// cout<<"map["<<i... | replace | 6 | 7 | 6 | 7 | TLE | |
p00472 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX_N (1 << 16)
#define N 100000
#define mod 100000
class Range {
int data[MAX_N];
int n;
public:
void init(int pn) {
n = 1;
while (n < pn)
n <<= 1;
for (int i = 0; i < 2 * n; ++i)
data[i] = 0;
}
void add(int k, int a) {
k += n -... | #include <iostream>
using namespace std;
#define MAX_N (1 << 18)
#define N 100000
#define mod 100000
class Range {
int data[MAX_N];
int n;
public:
void init(int pn) {
n = 1;
while (n < pn)
n <<= 1;
for (int i = 0; i < 2 * n; ++i)
data[i] = 0;
}
void add(int k, int a) {
k += n -... | replace | 3 | 4 | 3 | 4 | 0 | |
p00473 | 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 | 41 | 42 | 41 | 42 | 0 | |
p00473 | C++ | Runtime Error | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
type... | replace | 45 | 46 | 45 | 46 | 0 | |
p00473 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 2000
#define INF 2000000000
int dp[2][MAX_N]
[2]; // dp[????????????][???????????§??§A?????????????????????][??´???]
int n, a[MAX_N];
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
me... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
#define MAX_N 500000
#define INF 2000000000
int dp[2][MAX_N]
[2]; // dp[????????????][???????????§??§A?????????????????????][??´???]
int n, a[MAX_N];
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a[i];
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00473 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, pii> pipii;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int, pii> pipii;
typedef vec... | replace | 44 | 45 | 44 | 45 | 0 | |
p00474 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
#define X first
#define Y second
#def... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
#define X first
#define Y second
#def... | replace | 27 | 29 | 27 | 29 | 0 | |
p00474 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j;
int a[100002], m, n;
long long b[100002], mx = -1;
a[0] = 0;
a[100001] = 0;
cin >> n >> m;
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int i, j;
int a[100002], m, n;
long long b[100002], mx = -1;
a[0] = 0;
a[100001] = 0;
cin >> n >> m;
for (... | replace | 33 | 34 | 33 | 35 | TLE | |
p00474 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int turara[100000];
int dp[100000];
int N, L;
int rec(int idx) {
if (~dp[idx])
return dp[idx];
int ret = 0;
if (idx > 0 && turara[idx - 1] > turara[idx])
ret = max(ret, rec(idx - 1));
if (idx < N - 1 && turara[idx + 1] > turara[idx])
ret = max(ret, rec(... | #include <bits/stdc++.h>
using namespace std;
int turara[100000];
int dp[100000];
int N, L;
int rec(int idx) {
if (~dp[idx])
return dp[idx];
int ret = 0;
if (idx > 0 && turara[idx - 1] > turara[idx])
ret = max(ret, rec(idx - 1));
if (idx < N - 1 && turara[idx + 1] > turara[idx])
ret = max(ret, rec(... | replace | 14 | 15 | 14 | 15 | TLE | |
p00474 | C++ | Time Limit Exceeded | #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 = 100005;
const int MAX_L = 500001;
int a[MAX_N];
int k[MAX_N];
multimap<int, int> mp;
ll t[MAX_N];
int n, L;
int ... | #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 = 100005;
const int MAX_L = 500001;
int a[MAX_N];
int k[MAX_N];
multimap<int, int> mp;
ll t[MAX_N];
int n, L;
int ... | replace | 32 | 33 | 32 | 33 | TLE | |
p00474 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
#define PII pair<int, int>
priority_queue<PII, vector<PII>, greater<PII>> Q;
int main(void) {
int N, L;
while (scanf("%d%d", &N, &L) && N != 0) {
int a[100005] = {0};
int temp;
int ans = 0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;
#define PII pair<int, int>
priority_queue<PII, vector<PII>, greater<PII>> Q;
int main(void) {
int N, L;
while (scanf("%d%d", &N, &L) != EOF) {
int a[100005] = {0};
int temp;
int ans = 0;
... | replace | 14 | 15 | 14 | 15 | TLE | |
p00474 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t[510];
int main() {
int n, l;
cin >> n >> l;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
t[0] = l - a[0];
for (int i = 1; i < n; i++) {
if (a[i - 1] > a[i])
t[i] = t[i - 1] + (l - a[i]);
else
t[i] = l - a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t[100010];
int main() {
int n, l;
cin >> n >> l;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
t[0] = l - a[0];
for (int i = 1; i < n; i++) {
if (a[i - 1] > a[i])
t[i] = t[i - 1] + (l - a[i]);
else
t[i] = l -... | replace | 3 | 4 | 3 | 4 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.