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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00439 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <deque>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
int ini[10001];
int main() {
while (1) {
int n, m;
scanf("%d%d",... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
int ini[100001];
int main() {
while (1) {
int n, m;
scanf("%d%d"... | replace | 13 | 14 | 13 | 14 | 0 | |
p00439 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c[100000] = {0}, d = 0, e = 0, max = 0;
cin >> a >> b;
if (a == 0 && b == 0)
break;
for (int A = 0; A < a; A++) {
cin >> c[A];
if (A >= b) {
for (int B = 0; B < b; B++) {
d = d + c[A + e]... | #include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c[100000] = {0}, d = 0, e = 0, max = 0;
cin >> a >> b;
if (a == 0 && b == 0)
break;
for (int A = 0; A < a; A++) {
cin >> c[A];
if (A >= b) {
for (int B = 0; B < b; B++) {
d = d + c[A + e]... | insert | 18 | 18 | 18 | 19 | 0 | |
p00439 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
int main() {
while (true) {
int n, k;
cin >> n >> k;
int sum = 0;
int ans = 0;
queue<int> q;
for (int i = 0; i < n; ++i) {
int num;
scanf("%d", &num);
sum += num;
if (i =... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
int main() {
while (true) {
int n, k;
cin >> n >> k;
if (!n && !k)
break;
int sum = 0;
int ans = 0;
queue<int> q;
for (int i = 0; i < n; ++i) {
int num;
scanf("%d", &num);
... | insert | 11 | 11 | 11 | 14 | TLE | |
p00439 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n, m, a;
while (cin >> n >> m, n | m) {
int d[10001] = {};
cin >> d[0];
for (int i = 1; i < n; i++) {
cin >> a;
d[i] += d[i - 1] + a;
}
int MAX = 0;
for (int i = 0; i < n - m; i++) {
if (d[i + m] - d[i] > MAX)... | #include <iostream>
using namespace std;
int main(void) {
int n, m, a;
while (cin >> n >> m, n | m) {
int d[100001] = {};
cin >> d[0];
for (int i = 1; i < n; i++) {
cin >> a;
d[i] += d[i - 1] + a;
}
int MAX = 0;
for (int i = 0; i < n - m; i++) {
if (d[i + m] - d[i] > MAX... | replace | 7 | 8 | 7 | 8 | 0 | |
p00439 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF (1 << 29)
#define ALL(a) (a).begin(), (a).end()
#de... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF (1 << 29)
#define ALL(a) (a).begin(), (a).end()
#de... | replace | 23 | 24 | 23 | 24 | 0 | |
p00439 | C++ | Runtime Error | #include <cstdio>
using namespace std;
int main() {
int n, k;
int s = 0;
int a[10000] = {0};
for (;;) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int x = 0;
for (int i = 0; i < k; i++) {
x += a[i];
}
... | #include <cstdio>
using namespace std;
int main() {
int n, k;
int s = 0;
int a[100000] = {0};
for (;;) {
scanf("%d%d", &n, &k);
if (n == 0 && k == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int x = 0;
for (int i = 0; i < k; i++) {
x += a[i];
}
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00439 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long int ll;
int main() {
int n, k;
while (1) {
scanf("%d %d", &n, &k);
if (n == 0)
return 0;
int a[n];
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
;
ll bgs = 0;
for (int i = 0; i <= n - k; i++) {
... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef long long int ll;
int main() {
int n, k;
while (1) {
scanf("%d %d", &n, &k);
if (n == 0)
return 0;
int a[n];
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
ll bgs = 0, temp = 0;
for (int i = 0; i < k; i++)
... | replace | 13 | 19 | 13 | 19 | TLE | |
p00440 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
out << "(" << o.first << "," << o.second << ")";
return out;
}
tem... | delete | 76 | 77 | 76 | 76 | 0 | (1,2) (4,4) (6,7)
(2,2) (4,4) (6,7)
|
p00440 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#define _3_ true
using namespace std;
int main() {
int n, k, index, ini;
int in[100005];
bool ZeroE;
while (_3_) {
scanf("%d %d", &n, &k);
if (!(n | k))
break;
ZeroE = false;
index = 0;
for (int i = 0; i < k; i++) {
sc... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define _3_ true
using namespace std;
int main() {
int n, k, index, ini;
int in[100005];
bool ZeroE;
while (_3_) {
scanf("%d %d", &n, &k);
if (!(n | k))
break;
ZeroE = false;
index = 0;
for (int i = 0; i < k; i++) {
sc... | replace | 61 | 62 | 61 | 62 | 178 | |
p00440 | C++ | Runtime Error | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | /* {{{ Shinobu kawaii */
/*
______ __ _ __
.' ____ \ [ | (_) [ |
| (___ \_| | |--. __ _ .--. .--. | |.--. __ _
_.____`. | .-. | [ | [ `.-. |/ .'`\ \| '/'`\ \[ | | |
| \____) | | | | | | | | | | || \__. || \__/ | | \_/ |,
\______.'[___]|__][___][___||_... | delete | 105 | 106 | 105 | 105 | 0 | 2 (L:106)
2 (L:106)
|
p00440 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
if (!n && !m)
break;
bool card[10001] = {false};
for (int i = 0; i < m; i++) {
int a;
cin >> a;
card[a] = true;
}
int ma = 1;
for (int i = 1; i <= n; i++) {
int sum = 0;
... | #include <iostream>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m) {
if (!n && !m)
break;
bool card[100001] = {false};
for (int i = 0; i < m; i++) {
int a;
cin >> a;
card[a] = true;
}
int ma = 1;
for (int i = 1; i <= n; i++) {
int sum = 0;
... | replace | 8 | 9 | 8 | 9 | 0 | |
p00440 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
int data[1003];
for (int i = 0; i < n + 3; i++) {
data[i] = 0;
}
int all = 0, ans = 0;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
int card;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (1) {
cin >> n >> k;
int data[100300];
for (int i = 0; i < n + 3; i++) {
data[i] = 0;
}
int all = 0, ans = 0;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
int card;... | replace | 8 | 9 | 8 | 9 | 0 | |
p00440 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int n = 0, k = 0, a[200000] = {}, sam, b[100000] = {}, roop = 0,
save[100000] = {0}, ans[100000] = {}, w = 0;
int main(void) {
while (1) {
int n = 0, k = 0, a[100000] = {}, sam, b[1000] = {}, roop = 0,
save[1000] = {0}, ans[1000] = {}, w = ... | #include <algorithm>
#include <iostream>
using namespace std;
int n = 0, k = 0, a[200000] = {}, sam, b[100000] = {}, roop = 0,
save[100000] = {0}, ans[100000] = {}, w = 0;
int main(void) {
while (1) {
// int n=0, k=0, a[100000] = {}, sam, b[1000] = {}, roop = 0, save[1000] =
// {0}, ans[1000] = {}, w = 0;... | replace | 7 | 9 | 7 | 9 | 0 | |
p00440 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int card[100000];
bool shiro = false;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 and m == 0) {
break;
}
shiro = false;
for (int i = 0; i < 100000; i++) {
card[i] = 0;
}
for (in... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int card[100000];
bool shiro = false;
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 and m == 0) {
break;
}
shiro = false;
for (int i = 0; i < 100000; i++) {
card[i] = 0;
}
for (in... | replace | 17 | 18 | 17 | 18 | TLE | |
p00440 | 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;
int main() {
while (1) {
int N, K;
cin >> N >> K;
vector<int> oks(N + 1);
bo... | #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;
int main() {
while (1) {
int N, K;
cin >> N >> K;
if (!N)
break;
vecto... | insert | 13 | 13 | 13 | 15 | TLE | |
p00440 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n || k) {
int C[10002] = {0};
int dp[10002] = {0};
for (int i = 0; i < k; i++) {
int j;
cin >> j;
C[j] = 1;
}
if (C[1] == 1) {
dp[1] = 1;
}
for (int i = 2... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
while (cin >> n >> k, n || k) {
int C[100002] = {0};
int dp[100002] = {0};
for (int i = 0; i < k; i++) {
int j;
cin >> j;
C[j] = 1;
}
if (C[1] == 1) {
dp[1] = 1;
}
for (int i =... | replace | 8 | 10 | 8 | 10 | 0 | |
p00440 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
int n, k;
bool used[100001] = {};
int num[100001];
int main() {
while (1) {
fill(used, used + 100001, false);
scanf("%d %d", &n, &k);
for (int i = 0; i < k; i++) {
scanf("%d", &num[i]);
used[num[i]] = true;
}
sort(num, num + k... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, k;
bool used[100001] = {};
int num[100001];
int main() {
while (1) {
fill(used, used + 100001, false);
scanf("%d %d", &n, &k);
if (!n)
break;
for (int i = 0; i < k; i++) {
scanf("%d", &num[i]);
used[num[i]] = true;
... | insert | 10 | 10 | 10 | 12 | TLE | |
p00441 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int exist[5001][5001];
inline bool check(int x, int y) {
if (x < 0 || y < 0 || x > 5000 || y > 5000)
return false;
return exist[x][y];
}
int main() {
int n;
while (cin >> n, n) {
memset(exist, 0, sizeof(exist));
vector<int> x(n), y(n);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
bool exist[5001][5001];
inline bool check(int x, int y) {
if (x < 0 || y < 0 || x > 5000 || y > 5000)
return false;
return exist[x][y];
}
int main() {
int n;
while (cin >> n, n) {
memset(exist, 0, sizeof(exist));
vector<int> x(n), y(n);
for (int i... | replace | 2 | 3 | 2 | 3 | MLE | |
p00441 | C++ | Runtime Error | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
// これは、頭が悪く競プロが世界で一番できないHIR180が
// IOI2014日本代表になるまでのN日間の記録である。
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <q... | // Bokan ga bokka--nn!!
// Daily Lunch Special Tanoshii !!
// これは、頭が悪く競プロが世界で一番できないHIR180が
// IOI2014日本代表になるまでのN日間の記録である。
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <q... | insert | 55 | 55 | 55 | 58 | 0 | |
p00441 | C++ | Memory Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <memory>
#include <numeric>... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <memory>
#include <numeric>... | replace | 62 | 63 | 62 | 63 | MLE | |
p00441 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define ... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dx[] = {1, -1, 0, 0, 1, -1, -1, 1};
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define ... | insert | 47 | 47 | 47 | 55 | 0 | |
p00441 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAX_N = 3000;
const int MAX_XY = 5000;
int n;
int a[MAX_N][2];
bool b[MAX_XY][MAX_XY];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < MAX_N; i++)
for (int j = 0; j < 2; j++)
a[i][... | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAX_N = 3000;
const int MAX_XY = 5000;
int n;
int a[MAX_N][2];
bool b[MAX_XY][MAX_XY];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < MAX_N; i++)
for (int j = 0; j < 2; j++)
a[i][... | replace | 39 | 41 | 39 | 44 | 0 | |
p00441 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
bool p[5001][5001];
int x[3000], y[3000], n, maxn;
int main() {
while (true) {
cin >> n;
maxn = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
p[x[i]][y[i]] = true;
}
for (int i = 0; i < n... | #include <algorithm>
#include <iostream>
using namespace std;
bool p[5001][5001];
int x[3000], y[3000], n, maxn;
int main() {
while (true) {
cin >> n;
maxn = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
p[x[i]][y[i]] = true;
}
for (int i = 0; i < n... | replace | 22 | 24 | 22 | 28 | -11 | |
p00441 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int n, x[3009], y[3009];
bool ok[5009][5009];
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
scanf("%d%d", &x[i], &y[i]);
ok[x[i]][y[i]] = true;
}
int ret = ... | #include <algorithm>
#include <iostream>
#include <vector>
#pragma warning(disable : 4996)
using namespace std;
int n, x[3009], y[3009];
bool ok[5009][5009];
int main() {
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) {
scanf("%d%d", &x[i], &y[i]);
ok[x[i]][y[i]] = true;
}
int ret = ... | replace | 19 | 21 | 19 | 21 | 0 | |
p00441 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n;
bool p[5001][5001];
bool c(int a) { return 0 <= a && a <= 5000; }
int main() {
while (cin >> n && n) {
int x[5001], y[5001], an = 0;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i], p[x[i]][y[i]] = 1;
for (int i = 0; i < n; i++)
for (int j = i; j... | #include <iostream>
using namespace std;
int n;
bool p[5001][5001];
bool c(int a) { return 0 <= a && a <= 5000; }
int main() {
while (cin >> n && n) {
int x[5001], y[5001], an = 0;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i], p[x[i]][y[i]] = 1;
for (int i = 0; i < n; i++)
for (int j = i; j... | replace | 21 | 22 | 21 | 22 | -11 | |
p00441 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef long lo... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef complex<double> P;
typedef long lo... | replace | 30 | 31 | 30 | 31 | 0 | |
p00441 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9 + 7;
te... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int mod = 1e9 + 7;
te... | replace | 36 | 37 | 36 | 37 | 0 | 0 1
-3 1
0 -1
-1 0
3 -1
1 0
0 1
-3 1
0 -1
-1 0
3 -1
1 0
|
p00441 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <map>
#include <set>
using namespace std;
typedef pair<int, int> P;
int n;
P st[3000];
int main() {
while (scanf("%d", &n)) {
if (!n)
break;
set<P> stat;
for (int i = 0; i < n; i++) {
scanf("%d%d", &st[i].first, &st[i].second);
stat.insert(... | #include <algorithm>
#include <cstdio>
#include <map>
#include <set>
using namespace std;
typedef pair<int, int> P;
int n;
P st[3000];
int main() {
while (scanf("%d", &n)) {
if (!n)
break;
set<P> stat;
for (int i = 0; i < n; i++) {
scanf("%d%d", &st[i].first, &st[i].second);
stat.insert(... | replace | 23 | 29 | 23 | 25 | TLE | |
p00441 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
inline bool isRange(pii &p1) { return 0 <= p1.first && p1.second <= 5000; }
inline double dis(pii &p1, pii &p2) {
double a = abs(p1.first - p2.first), b = abs(p1.s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
typedef pair<int, int> pii;
static const int INF = 1LL << 61;
inline bool isRange(pii &p1) {
return 0 <= p1.first && p1.first <= 5000 && 0 <= p1.second &&
p1.second <= 5000;
}
inline double dis(pii &p1, pii &p2) {
... | replace | 9 | 10 | 9 | 13 | 0 | |
p00441 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define sint(i) scanf("%d", &i);
#define sintt(i, j) scanf("%d%d", &i, &j);
#define sinttt(i, j, k) scanf("%d%d%d", &i, &j, &k);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
char masu[5001][5001];
int main() {
while ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define sint(i) scanf("%d", &i);
#define sintt(i, j) scanf("%d%d", &i, &j);
#define sinttt(i, j, k) scanf("%d%d%d", &i, &j, &k);
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
char masu[5001][5001];
int main() {
while ... | replace | 17 | 18 | 17 | 19 | TLE | |
p00441 | C++ | Memory Limit Exceeded | #include <iostream>
#define REP(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int n;
int x[3000], y[3000];
int mp[5001][5001];
int m, dx, dy, s;
int exists(int x, int y) {
return 0 <= x && x <= 5000 && 0 <= y && y <= 5000 && mp[x][y] == 1;
}
int main(void) {
while (cin >> n, n != 0) {
REP(i, 0, 5... | #include <iostream>
#define REP(i, a, n) for (int i = a; i < n; i++)
using namespace std;
int n;
int x[3000], y[3000];
bool mp[5001][5001];
int m, dx, dy, s;
int exists(int x, int y) {
return 0 <= x && x <= 5000 && 0 <= y && y <= 5000 && mp[x][y] == 1;
}
int main(void) {
while (cin >> n, n != 0) {
REP(i, 0, ... | replace | 6 | 7 | 6 | 7 | MLE | |
p00441 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int x[3000], y[3000];
bool f[5001][5001];
int main() {
int n;
while (scanf("%d", &n), n) {
memset(x, 0, sizeof(x));
memset(y, 0, sizeof(y));
memset(f, 0, sizeof(f));
for (int i = 0; i < n; i++) {
scanf("%d %d", &x[i], &y[i]);
f[x[i]][y[i]]... | #include <bits/stdc++.h>
using namespace std;
int x[3000], y[3000];
bool f[5001][5001];
int main() {
int n;
while (scanf("%d", &n), n) {
memset(x, 0, sizeof(x));
memset(y, 0, sizeof(y));
memset(f, 0, sizeof(f));
for (int i = 0; i < n; i++) {
scanf("%d %d", &x[i], &y[i]);
f[x[i]][y[i]]... | replace | 24 | 26 | 24 | 29 | 0 | |
p00441 | C++ | Memory Limit Exceeded | #include <iostream>
#define N 3000
#define S 5001
int px[N], py[N];
int n;
int pillar[S][S];
void init() {
int i, j;
for (i = 0; i < S; i++) {
for (j = 0; j < S; j++) {
pillar[i][j] = 0;
}
}
return;
}
int input() {
int i, x, y;
init();
std::cin >> n;
for (i = 0; i < n; i++) {
std::c... | #include <iostream>
#define N 3000
#define S 5001
int px[N], py[N];
int n;
char pillar[S][S];
void init() {
int i, j;
for (i = 0; i < S; i++) {
for (j = 0; j < S; j++) {
pillar[i][j] = 0;
}
}
return;
}
int input() {
int i, x, y;
init();
std::cin >> n;
for (i = 0; i < n; i++) {
std::... | replace | 6 | 7 | 6 | 7 | MLE | |
p00441 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#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)
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#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)
#de... | replace | 34 | 35 | 34 | 35 | MLE | |
p00441 | C++ | Runtime Error | //
// main.cpp
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<int, int>> hashira;
bool check[5001][5001];
for (int i = 0; i < 5001; i++) {
for (int j = 0; j < 5001; j++) {
check[i][j] = ... | //
// main.cpp
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
vector<pair<int, int>> hashira;
bool check[5001][5001];
for (int i = 0; i < 5001; i++) {
for (int j = 0; j < 5001; j++) {
check[i][j] = ... | insert | 31 | 31 | 31 | 39 | -11 | |
p00442 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int lose[1005] = {0};
bool match[5005][5005];
int main() {
int n;
cin >> n;
int m;
cin >> m;
int tf = 0;
int no_1 = -1;
for (int i = 0; i < 5005; i++) {
for (int j = 0; j < 5005; j++)
match[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int lose[5005] = {0};
bool match[5005][5005];
int main() {
int n;
cin >> n;
int m;
cin >> m;
int tf = 0;
int no_1 = -1;
for (int i = 0; i < 5005; i++) {
for (int j = 0; j < 5005; j++)
match[... | replace | 5 | 6 | 5 | 6 | 0 | |
p00442 | C++ | Runtime Error | #include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define PB push_back
const int N = 3e3 + 10;
int main() {
int n, m, l, r, d[N], nxt;
vector<int> graph[N];
queue<int> q;
bool y = false;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
d[i] = 0;
while (m--) {
scanf("%d%... | #include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define PB push_back
const int N = 5e3 + 10;
int main() {
int n, m, l, r, d[N], nxt;
vector<int> graph[N];
queue<int> q;
bool y = false;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
d[i] = 0;
while (m--) {
scanf("%d%... | replace | 5 | 6 | 5 | 6 | 0 | |
p00442 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
struct team {
int num, dep;
};
#define MAX_N 5000
#define MAX_M 100000
int n, m;
vector<int> beat[MAX_N + 1];
team dat[MAX_N + 1];
team win[MAX_N + 1];
bool used[MAX_N + 1];
bool point[MAX_N + 1];
bool exi[MAX_N + 1] = {false};
bool check[... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
struct team {
int num, dep;
};
#define MAX_N 5000
#define MAX_M 100000
int n, m;
vector<int> beat[MAX_N + 1];
team dat[MAX_N + 1];
team win[MAX_N + 1];
bool used[MAX_N + 1];
bool point[MAX_N + 1];
bool exi[MAX_N + 1] = {false};
bool check[... | insert | 23 | 23 | 23 | 25 | TLE | |
p00442 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
#define FOR(i, a) for (i = 0; i < (a); i++)
#define FORM(i, a) for (i = (a)i >= 0; i--)
using namespace std;
vector<int> E[1010];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
#define FOR(i, a) for (i = 0; i < (a); i++)
#define FORM(i, a) for (i = (a)i >= 0; i--)
using namespace std;
vector<int> E[5050];
... | replace | 15 | 17 | 15 | 17 | 0 | |
p00442 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000005
#define MAX 5001
using namespace std;
queue<int> s;
stack<int> a[MAX];
bool check[MAX][MAX];
int b[MAX];
int main() {
int n, m, t1, t2;
scanf("%d %d", &n, &m);
fill(b, b + MAX, 0);
fill((int *)chec... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000005
#define MAX 5001
using namespace std;
queue<int> s;
stack<int> a[MAX];
bool check[MAX][MAX];
int b[MAX];
int main() {
int n, m, t1, t2;
scanf("%d %d", &n, &m);
fill(b, b + MAX, 0);
rep(i, MAX) rep(... | replace | 15 | 16 | 15 | 17 | -11 | |
p00442 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int N, M;
int X[5000][5000];
int W[5000], L[5000];
pair<int, int> P[5000];
bool F = true;
int main() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) {
int A, B;
scanf("%d%d", &A, &B);
X[A - 1][B - 1] = 1;
W[A - 1]++... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int N, M;
bool X[5000][5000];
int W[5000], L[5000];
pair<int, int> P[5000];
bool F = true;
int main() {
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++) {
int A, B;
scanf("%d%d", &A, &B);
X[A - 1][B - 1] = 1;
W[A - 1]+... | replace | 5 | 6 | 5 | 6 | MLE | |
p00442 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define all(c) c.begin(), c.end()
const int MAX_N = 5000;
// win[i]にjが含まれるならiはjに勝った
// win[i]にjが含まれるならiはjに負けた
vector<int> win[MAX_N + 1];
vector<int> lose[MAX_N + 1];
vector<int> ord;
int used[MAX_N + 1] = {0};
// v... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define all(c) c.begin(), c.end()
const int MAX_N = 5000;
// win[i]にjが含まれるならiはjに勝った
// win[i]にjが含まれるならiはjに負けた
vector<int> win[MAX_N + 1];
vector<int> lose[MAX_N + 1];
vector<int> ord;
int used[MAX_N + 1] = {0};
// v... | replace | 23 | 24 | 23 | 24 | -11 | |
p00442 | C++ | Memory Limit Exceeded | // 0519-Worst Sportwriter
#include <bits/stdc++.h>
using namespace std;
int data[5000][5000];
vector<int> win(5000);
vector<int> unknown(5000);
int main() {
int n, m;
cin >> n >> m;
for (int t = 0; t < m; t++) {
int i, j;
cin >> i >> j;
i--;
j--;
data[i][j] = 1;
data[j][i] = -1;
}
for ... | // 0519-Worst Sportwriter
#include <bits/stdc++.h>
using namespace std;
short data[5000][5000];
vector<int> win(5000);
vector<int> unknown(5000);
int main() {
int n, m;
cin >> n >> m;
for (int t = 0; t < m; t++) {
int i, j;
cin >> i >> j;
i--;
j--;
data[i][j] = 1;
data[j][i] = -1;
}
fo... | replace | 3 | 4 | 3 | 4 | MLE | |
p00442 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
short table[5010][5010];
vector<int> e[5010], e2[5010];
int done[5010];
vector<int> tpr;
void dfs(int x, int s) {
if (done[x])
return;
else
done[x] = true;
if (s != x) {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
char table[5010][5010];
vector<int> e[5010], e2[5010];
int done[5010];
vector<int> tpr;
void dfs(int x, int s) {
if (done[x])
return;
else
done[x] = true;
if (s != x) {
... | replace | 8 | 9 | 8 | 9 | MLE | |
p00443 | 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 | 48 | 50 | 48 | 50 | 0 | |
p00443 | 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 | 95 | 96 | 95 | 96 | 0 | sh: 1: pause: not found
|
p00444 | C++ | Time Limit Exceeded | //============================================================================
// Name : 0521.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iost... | //============================================================================
// Name : 0521.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iost... | replace | 18 | 19 | 18 | 19 | TLE | |
p00444 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, b;
while (true) {
cin >> b;
n = 1000 - b;
;
if (n == 0) {
break;
}
cout << n / 500 + (n / 100) % 5 + (n / 50) % 2 + (n / 10) % 5 +
(n / 5) % 2 + n % 5
<< endl;
}
} | #include <iostream>
using namespace std;
int main() {
int n, b;
while (true) {
cin >> b;
n = 1000 - b;
;
if (b == 0) {
break;
}
cout << n / 500 + (n / 100) % 5 + (n / 50) % 2 + (n / 10) % 5 +
(n / 5) % 2 + n % 5
<< endl;
}
} | replace | 8 | 9 | 8 | 9 | TLE | |
p00444 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int main() {
int x, y;
while (scanf("%d", &x) != 0) {
x = 1000 - x;
y = 0;
while (x >= 500) {
x -= 500;
y++;
}
while (x >= 100) {
x -= 100;
y++;
}
while (x >= 50) {
x -= 50;
y++;
}
while (x >= 10) {
... | #include <cstdio>
using namespace std;
int main() {
int x, y;
while (scanf("%d", &x)) {
if (x == 0) {
break;
}
x = 1000 - x;
y = 0;
while (x >= 500) {
x -= 500;
y++;
}
while (x >= 100) {
x -= 100;
y++;
}
while (x >= 50) {
x -= 50;
y++;
... | replace | 5 | 6 | 5 | 9 | TLE | |
p00444 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int total;
int change;
int count = 0;
while (true) {
cin >> total;
if (total == 0) {
break;
}
change = 1000 - total;
while (true) {
if (change >= 500) {
change -= 500;
count++;
} else if (change >= 100) ... | #include <iostream>
using namespace std;
int main() {
int total;
int change;
int count = 0;
while (true) {
cin >> total;
if (total == 0) {
break;
}
change = 1000 - total;
while (true) {
if (change >= 500) {
change -= 500;
count++;
} else if (change >= 100) ... | insert | 33 | 33 | 33 | 36 | TLE | |
p00444 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g;
while (1) {
cin >> a;
if (a = 0)
break;
b = (1000 - a) / 500;
c = (1000 - (a + 500 * b)) / 100;
d = (1000 - (a + 500 * b + 100 * c)) / 50;
e = (1000 - (a + 500 * b + 100 * c + 50 * d)) / 10;
f = (1000 - ... | #include <iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g;
while (1) {
cin >> a;
if (a == 0)
break;
b = (1000 - a) / 500;
c = (1000 - (a + 500 * b)) / 100;
d = (1000 - (a + 500 * b + 100 * c)) / 50;
e = (1000 - (a + 500 * b + 100 * c + 50 * d)) / 10;
f = (1000 -... | replace | 6 | 7 | 6 | 7 | TLE | |
p00444 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
n = 1000 - n;
int ans = 0, i;
int w[6] = {500, 100, 50, 10, 5, 1};
for (i = 0; i <= 6; i++) {
ans = ans + n / w[i];
n = n - n / w[i] * w[i];
}
cout << a... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0)
break;
n = 1000 - n;
int ans = 0, i;
int w[6] = {500, 100, 50, 10, 5, 1};
for (i = 0; i <= 5; i++) {
ans = ans + n / w[i];
n = n - n / w[i] * w[i];
}
cout << a... | replace | 12 | 13 | 12 | 13 | 0 | |
p00445 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
char x[10005];
while (scanf("%s", &x)) {
int k = 0, JOI = 0, IOI = 0;
while (x[k + 2] != '\0') {
if (x[k + 1] == 'O' && x[k + 2] == 'I') {
if (x[k] == 'J')
JOI++;
if (x[k] == 'I')
IOI++;
}
k++;
}... | #include <iostream>
using namespace std;
int main() {
char x[10005];
while (scanf("%s", &x) != EOF) {
int k = 0, JOI = 0, IOI = 0;
while (x[k + 2] != '\0') {
if (x[k + 1] == 'O' && x[k + 2] == 'I') {
if (x[k] == 'J')
JOI++;
if (x[k] == 'I')
IOI++;
}
k++... | replace | 5 | 6 | 5 | 6 | TLE | |
p00445 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
char s[10010] = {0};
while (cin >> s) {
int J = 0;
int I = 0;
int len = 0;
while (1) {
if (s[len] == 0) {
break;
}
}
for (int i = 0; i < len - 2; i++) {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I') {
... | #include <iostream>
using namespace std;
int main() {
char s[10010] = {0};
while (cin >> s) {
int J = 0;
int I = 0;
int len = 0;
while (1) {
if (s[len] == 0) {
break;
}
len++;
}
for (int i = 0; i < len - 2; i++) {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2]... | insert | 12 | 12 | 12 | 13 | TLE | |
p00445 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
while (true) {
string s;
cin >> s;
// if(cin.eof()==false)break;
int a = 0, b = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I') {
a += 1;
}
if (s[i] == 'I' && s[i + 1]... | #include <iostream>
using namespace std;
int main() {
string s;
while (cin >> s) {
int a = 0, b = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I') {
a += 1;
}
if (s[i] == 'I' && s[i + 1] == 'O' && s[i + 2] == 'I') {
b += 1;
... | replace | 3 | 7 | 3 | 5 | -11 | |
p00445 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
using namespace std;
char ary[10010];
int main() {
int cnt, cnj, cni;
while (true) {
cin >> ary;
if (ary[0] == (-1))
break;
cnj = cni = 0;
cnt = strlen(ary);
for (int i = 2; i < cnt; i++) {
if (ary[i] == 'I' && ary[i - 1] == 'O') {
if (... | #include <cstring>
#include <iostream>
using namespace std;
char ary[10010];
int main() {
int cnt, cnj, cni;
while (true) {
cin >> ary;
if (cin.eof())
break;
cnj = cni = 0;
cnt = strlen(ary);
for (int i = 2; i < cnt; i++) {
if (ary[i] == 'I' && ary[i - 1] == 'O') {
if (ary[i... | replace | 9 | 10 | 9 | 10 | TLE | |
p00445 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
using namespace std;
char s[10002];
int J, I;
int main() {
while (1) {
scanf("%s", s);
if (s[0] == 0xff)
return 0;
J = 0;
I = 0;
for (int i = 0; i < strlen(s) - 2; i++) {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I')
J++;
if (... | #include <cstdio>
#include <cstring>
using namespace std;
char s[10002];
int J, I;
int main() {
while (scanf("%s", s) != EOF) {
J = 0;
I = 0;
for (int i = 0; i < strlen(s) - 2; i++) {
if (s[i] == 'J' && s[i + 1] == 'O' && s[i + 2] == 'I')
J++;
if (s[i] == 'I' && s[i + 1] == 'O' && s[i ... | replace | 6 | 10 | 6 | 7 | TLE | |
p00445 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
for (;;) {
char str[1000];
int joi = 0, ioi = 0, temp;
if (scanf("%s", str) == EOF) {
break;
}
// JOIツ板サツ津ィ
for (int i = 2; str[i] != '\0'; i++) {
if (str[i - 2] == 'J' && str[i - 1] == 'O' && str[i] == 'I'... | #include <iostream>
#include <string>
using namespace std;
int main() {
for (;;) {
char str[10001];
int joi = 0, ioi = 0, temp;
if (scanf("%s", str) == EOF) {
break;
}
// JOIツ板サツ津ィ
for (int i = 2; str[i] != '\0'; i++) {
if (str[i - 2] == 'J' && str[i - 1] == 'O' && str[i] == 'I... | replace | 7 | 8 | 7 | 8 | 0 | |
p00445 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | replace | 25 | 31 | 25 | 27 | TLE | |
p00445 | C++ | Time Limit Exceeded | // https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Prelim/0522?year=2008
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (true) {
cin >> s;
if (s.empty())
return 0;
int joi = 0, ioi = 0;
for (int i = 0; i < s.size() - 2; ++i) {
if (s[i + 1] == 'O' ... | // https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Prelim/0522?year=2008
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
while (cin >> s) {
int joi = 0, ioi = 0;
for (int i = 0; i < s.size() - 2; ++i) {
if (s[i + 1] == 'O' and s[i + 2] == 'I') {
if (s[i] == 'J'... | replace | 9 | 14 | 9 | 10 | TLE | |
p00445 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
int i;
int ioi = 0, joi = 0;
std::string s;
#define I if (s[i] == 'I')
#define J if (s[i] == 'J')
int main() {
while (true) {
std::cin >> s;
if (s == "EOF" || s == "eof")
break;
for (i = 0; i < s.size(); i++) {
I {
if (s[i + 1]... | #include <algorithm>
#include <iostream>
#include <string>
int i;
int ioi = 0, joi = 0;
std::string s;
#define I if (s[i] == 'I')
#define J if (s[i] == 'J')
int main() {
while (std::cin >> s) {
for (i = 0; i < s.size(); i++) {
I {
if (s[i + 1] == 'O') {
if (s[i + 2] == 'I') {
i... | replace | 9 | 13 | 9 | 10 | TLE | |
p00445 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int I = 0, J = 0;
char d[10000];
while (scanf("%s", d) && d[0]) {
for (int i = 0; i < 10000; i++)
if (d[i + 2] == 0)
break;
else {
if (d[i + 1] ... | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int I = 0, J = 0;
char d[10000];
while (cin >> d) {
for (int i = 0; i < 10000; i++)
if (d[i + 2] == 0)
break;
else {
if (d[i + 1] == 'O' && d[i ... | replace | 10 | 11 | 10 | 11 | TLE | |
p00445 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
string line;
cin >> line;
if (line[0] == 'EOF') {
break;
}
int joi = 0, ioi = 0;
for (int i = 0; i < line.size() - 2; i++) {
if (line[i + 1] == 'O' && line[i + 2] == 'I') {
if (line[i] ... | #include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
string line;
cin >> line;
if (!line.size()) {
break;
}
int joi = 0, ioi = 0;
for (int i = 0; i < line.size() - 2; i++) {
if (line[i + 1] == 'O' && line[i + 2] == 'I') {
if (line[i] == '... | replace | 8 | 9 | 8 | 9 | -11 | |
p00446 | C++ | Time Limit Exceeded | #include <algorithm>
#include <stdio.h>
using namespace std;
int main(void) {
int n, i, a[10], e[201], c, x, y, flg;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 1; i <= n * 2; i++)
e[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main(void) {
int n, i, a[101], e[201], c, x, y, flg;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 1; i <= n * 2; i++)
e[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i+... | replace | 4 | 5 | 4 | 5 | TLE | |
p00446 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, ba, d, c1, c2;
int tc, hc, flag;
int taro[100], hana[100];
while (1) {
int F[101] = {0};
ba = 0;
cin >> N;
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> d;
F[d] = 1;
}
c1 = 0;
c2 = 0;
for... | #include <iostream>
using namespace std;
int main() {
int N, ba, d, c1, c2;
int tc, hc, flag;
int taro[100], hana[100];
while (1) {
int F[201] = {0};
ba = 0;
cin >> N;
if (N == 0)
break;
for (int i = 0; i < N; i++) {
cin >> d;
F[d] = 1;
}
c1 = 0;
c2 = 0;
for... | replace | 7 | 8 | 7 | 8 | 0 | |
p00446 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
using namespace std;
int main() {
while (1) {
int n, x;
int i, j;
int tarou[110] = {0}, hanako[110] = {0};
int field = 0;
int flg1 = 0, flg2 = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf... | #include <algorithm>
#include <cstdio>
#include <functional>
using namespace std;
int main() {
while (1) {
int n, x;
int i, j;
int tarou[300] = {0}, hanako[300] = {0};
int field = 0;
int flg1 = 0, flg2 = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf... | replace | 8 | 9 | 8 | 9 | 0 | |
p00446 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
vector<int> card[2];
int ba = -1, in;
bool latte[101] = {}, turn = 0;
for (int i = 0; i < N; i++) {
cin >> in;
la... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
vector<int> card[2];
int ba = -1, in;
bool latte[201] = {}, turn = 0;
for (int i = 0; i < N; i++) {
cin >> in;
la... | replace | 13 | 14 | 13 | 14 | 0 | |
p00446 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | replace | 48 | 49 | 48 | 49 | 0 | |
p00446 | C++ | Runtime Error | #include <stdio.h>
int main() {
int c[101] = {0}, ba = 0, n, i, a, t = 0, o;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 1; i <= n * 2; i++) {
c[i] = 0;
}
ba = 0;
t = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a);
c[a] = 1;
}
while (1) ... | #include <stdio.h>
int main() {
int c[201] = {0}, ba = 0, n, i, a, t = 0, o;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 1; i <= n * 2; i++) {
c[i] = 0;
}
ba = 0;
t = 0;
for (i = 0; i < n; i++) {
scanf("%d", &a);
c[a] = 1;
}
while (1) ... | replace | 2 | 3 | 2 | 3 | 0 | |
p00446 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi f... | #include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi f... | insert | 96 | 96 | 96 | 100 | TLE | |
p00446 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int a;
cin >> a;
while (a != 0) {
int b[100] = {0}, c[100] = {0}, d, e = 0, f[101] = {0}, g = 0, h = 0, i,
k = 0, n = 0;
h = 2 * a;
for (i = 1; i <= a; i++) {
cin >> d;
f[d] = 1;
}
for (i = 1; i <= h; i++) {
if... | #include <iostream>
using namespace std;
int main(void) {
int a;
cin >> a;
while (a != 0) {
int b[10000] = {0}, c[10000] = {0}, d, e = 0, f[10000] = {0}, g = 0, h = 0,
i, k = 0, n = 0;
h = 2 * a;
for (i = 1; i <= a; i++) {
cin >> d;
f[d] = 1;
}
for (i = 1; i <= h; i++) {
... | replace | 6 | 8 | 6 | 8 | 0 | |
p00446 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | replace | 23 | 24 | 23 | 24 | 0 | |
p00446 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
vector<int> taro, hanako;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
taro.push_back(a);
}
sort(taro.begin(), taro.end());
for (int j = 1; j < ta... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
if (!n)
break;
vector<int> taro, hanako;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
taro.push_back(a);
}
sort(taro.begin(), taro.end());
... | insert | 9 | 9 | 9 | 11 | -11 | |
p00446 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
while (scanf("%d", &n) != 0) {
vector<int> t, h;
for (int i = 0; i < n; i++) {
int tmp;
scanf("%d", &tmp);
t.push_back(tmp);
}
for (int i = 0; i < 2 * n; i++) {
bool find = fals... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
vector<int> t, h;
for (int i = 0; i < n; i++) {
int tmp;
scanf("%d", &tmp);
t.push_back(tmp);
}
for (int i = 0; i < 2 * n... | replace | 7 | 8 | 7 | 11 | TLE | |
p00446 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, a, t[100], h[100], b[101] = {};
int c = 0, d = 0, e = 0, ba = 0, ta = 0, ha = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a;
b[a]++;
}
for (int i = 1; i <= ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (1) {
int n, a, t[1000], h[1000], b[1000] = {};
int c = 0, d = 0, ba = 0, ta = 0, ha = 0;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> a;
b[a]++;
}
for (int i = 1; i <= n * ... | replace | 5 | 7 | 5 | 7 | 0 | |
p00446 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
// タロー→ハナァコォ
const int NONE = -1;
int main(void) {
while (1) {
int n;
vector<int> card[2];
cin >> n;
if (n == 0)
return 0;
int field = NONE; // 今場に出ているカード
i... | #include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
// タロー→ハナァコォ
const int NONE = -1;
int main(void) {
while (1) {
int n;
vector<int> card[2];
cin >> n;
if (n == 0)
return 0;
int field = NONE; // 今場に出ているカード
i... | replace | 40 | 41 | 40 | 41 | 0 | |
p00447 | 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 ZERO(a) memset(a, 0, sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
const int M = 1e6 + 10;
bool px[M], py[M];... | #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 ZERO(a) memset(a, 0, sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
const int M = 1e6 + 10;
bool px[M], py[M];... | insert | 25 | 25 | 25 | 27 | 0 | |
p00447 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#define x first
#define y second
using namespace std;
typedef pair<int, int> P;
P hosi[100];
P hosi2[100];
P shift;
bool flag;
int main() {
int m, n;
while (1) {
cin >> m;
if (!m)
break;
for (int i = 0; i < m; i++) {
cin >> hosi[i].x ... | #include <algorithm>
#include <iostream>
#include <map>
#define x first
#define y second
using namespace std;
typedef pair<int, int> P;
P hosi[220];
P hosi2[1010];
P shift;
bool flag;
int main() {
int m, n;
while (1) {
cin >> m;
if (!m)
break;
for (int i = 0; i < m; i++) {
cin >> hosi[i].x... | replace | 9 | 11 | 9 | 11 | 0 | |
p00447 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define sint(i) scanf("%d", &i)
#define sintt(i, j) scanf("%d%d", &i, &j)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int nx[200];
int ny[200];
int mx[200];
int my[200];
while (1) {
int n;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
#define sint(i) scanf("%d", &i)
#define sintt(i, j) scanf("%d%d", &i, &j)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int nx[200];
int ny[200];
int mx[1000];
int my[1000];
while (1) {
int n;... | replace | 13 | 15 | 13 | 15 | 0 | |
p00447 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
typedef pair<int, int> PA;
int main() {
int m, n;
PA seiza[200], hosi[200];
while (scanf("%d", &m), m) {
for (int i = 0; i < m; i++)
scanf("%d %d", &seiza[i].first, &seiza[i].second);
scanf("%d", &n);
for (int i = 0; i < n; i++)
s... | #include <algorithm>
#include <cstdio>
using namespace std;
typedef pair<int, int> PA;
int main() {
int m, n;
PA seiza[200], hosi[1001];
while (scanf("%d", &m), m) {
for (int i = 0; i < m; i++)
scanf("%d %d", &seiza[i].first, &seiza[i].second);
scanf("%d", &n);
for (int i = 0; i < n; i++)
... | replace | 6 | 7 | 6 | 7 | 0 | |
p00448 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (!h && !w)
break;
bool mp[11][1001];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
cin >> mp[i][j];
int ans = 0;
for (int i = 0; i < (1 << h); i++) {
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (!h && !w)
break;
bool mp[11][10001];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
cin >> mp[i][j];
int ans = 0;
for (int i = 0; i < (1 << h); i++) {
in... | replace | 9 | 11 | 9 | 10 | 0 | |
p00448 | C++ | Runtime Error | #include <bitset>
#include <cstdio>
#include <iostream>
using namespace std;
#define MaxC 1000
#define MaxR 10
// bitset<MaxC> pan[MaxR];
int pan[MaxR][MaxC];
int R, C;
int result = 0;
void dfs(
int index) { // sum表示已经得到的最大1的数目，dfs搜索当前行是否反转，得到最大的1的数
if (index == R) {
int sum = 0;
for (int i = 0; i < C;... | #include <bitset>
#include <cstdio>
#include <iostream>
using namespace std;
#define MaxC 10000
#define MaxR 10
// bitset<MaxC> pan[MaxR];
int pan[MaxR][MaxC];
int R, C;
int result = 0;
void dfs(
int index) { // sum表示已经得到的最大1的数目，dfs搜索当前行是否反转，得到最大的1的数
if (index == R) {
int sum = 0;
for (int i = 0; i < C... | replace | 6 | 7 | 6 | 7 | 0 | |
p00448 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
// #define int long long
using namespace std;
typedef long long ll;
int R, C;
int a[10][10000];
signed main() {
while (true) {
cin >> R >> C;
// rep(i,R) rep(j,C) cin >> a[i][j];
rep(i, R) rep(j, C) scanf("%d", &a[i][j]);
int an... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
// #define int long long
using namespace std;
typedef long long ll;
int R, C;
int a[10][10000];
signed main() {
while (true) {
cin >> R >> C;
if (R == 0 && C == 0)
break;
// rep(i,R) rep(j,C) cin >> a[i][j];
rep(i, R) rep(j... | insert | 12 | 12 | 12 | 14 | TLE | |
p00448 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int ary[20][10010];
int main() {
int R, C, res, tmp, cnt;
while (true) {
cin >> R >> C;
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
cin >> ary[i][j];
}
}
res = 0;
for (int i = 0; i < (1 << R); i++) {
cnt = 0;
... | #include <iostream>
using namespace std;
int ary[20][10010];
int main() {
int R, C, res, tmp, cnt;
while (true) {
cin >> R >> C;
if (R == 0 && C == 0)
break;
for (int i = 0; i < R; i++) {
for (int j = 0; j < C; j++) {
cin >> ary[i][j];
}
}
res = 0;
for (int i = 0;... | insert | 8 | 8 | 8 | 10 | TLE | |
p00448 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define rep2(i, b, n) for (int i = b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
bool fd[10][10000];
int h, w;
int search(int r) {
int res = 0;
if (r >= w) {
rep(x, w) {
int t_sum = 0;
rep(y, h) {
if (!fd[y][x])
++... | #include <algorithm>
#include <iostream>
#define rep2(i, b, n) for (int i = b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
bool fd[10][10000];
int h, w;
int search(int r) {
int res = 0;
if (r >= h) {
rep(x, w) {
int t_sum = 0;
rep(y, h) {
if (!fd[y][x])
++... | replace | 14 | 15 | 14 | 15 | 0 | |
p00448 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define FOR(i, j, k) for (int i = j; i < (int)k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define INF (1 << 30)
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> Pi;
const int MOD = 1e9 + 7;
const int dy[] = {0, 0, 1, -1}... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define FOR(i, j, k) for (int i = j; i < (int)k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define INF (1 << 30)
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> Pi;
const int MOD = 1e9 + 7;
const int dy[] = {0, 0, 1, -1}... | replace | 21 | 22 | 21 | 22 | 0 | |
p00448 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int R, C;
const int MAX = 10000;
bool senbei[10... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int R, C;
const int MAX = 10000;
bool senbei[MA... | replace | 18 | 19 | 18 | 19 | 0 | |
p00448 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int g[11][1001];
int maxn;
int r, c;
void dfs(int step) {
if (step == r) {
int num = 0;
for (int i = 0; i < c; ++i) {
int res = 0;
for (int j = 0; j < r; ++j)
res += g[j][i];
num += max(res, r - res);
}
maxn = max(... | #include <algorithm>
#include <iostream>
using namespace std;
int g[10][10000];
int maxn;
int r, c;
void dfs(int step) {
if (step == r) {
int num = 0;
for (int i = 0; i < c; ++i) {
int res = 0;
for (int j = 0; j < r; ++j)
res += g[j][i];
num += max(res, r - res);
}
maxn = max... | replace | 3 | 4 | 3 | 4 | 0 | |
p00448 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 10;
bitset<maxn> cookie[10];
int main() {
int R, C;
while (cin >> R >> C && (R || C)) {
int i, j;
for (int i = 0; i < R; i++)
for (int j = 0; j < C; j++) {
bool upward;
cin >> upward;
cookie[i][j] = upward;
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 10;
bitset<maxn> cookie[10];
int main() {
int R, C;
while (cin >> R >> C && (R || C)) {
int i, j;
for (int i = 0; i < R; i++)
for (int j = 0; j < C; j++) {
bool upward;
cin >> upward;
cookie[i][j] = upward;
... | replace | 22 | 23 | 22 | 23 | 0 | |
p00448 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using names... | insert | 78 | 78 | 78 | 81 | TLE | |
p00448 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef bitset<1000> bs;
int R, C;
int check(const vector<bs> &s) {
int res = 0;
rep(j, C) {
int cnt = 0;
rep(i, R) if (s[i][j]) cnt++;
res += max(cnt, R - cnt);
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
typedef bitset<10000> bs;
int R, C;
int check(const vector<bs> &s) {
int res = 0;
rep(j, C) {
int cnt = 0;
rep(i, R) if (s[i][j]) cnt++;
res += max(cnt, R - cnt);
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00448 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
using namespace std;
int sen[20][10010];
int tate, yoko;
int cou(int sum[10010][2], int row) {
if (row == tate) {
int ans = 0;
for (int i = 0; i < yoko; i++)
ans = ans + max(sum[i][0], sum[i][1]);
return ans;
}
int sum0[10010][2] = {0}, sum1[10010][2] = {0... | #include <algorithm>
#include <stdio.h>
using namespace std;
int sen[10010][20];
int tate, yoko;
int cou(int sum[10010][2], int row) {
if (row == tate) {
int ans = 0;
for (int i = 0; i < yoko; i++)
ans = ans + max(sum[i][0], sum[i][1]);
return ans;
}
int sum0[10010][2] = {0}, sum1[10010][2] = {0... | replace | 3 | 4 | 3 | 4 | 0 | |
p00448 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int R, C;
const int MAX_R = 12;
const int MAX_C = 10020;
bool omote[MAX_R][MAX_C];
int avai[MAX_C];
int avai_ori[MAX_C]; // 変化させない
int main(int argc, const char *argv[]) {
while (tr... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int R, C;
const int MAX_R = 12;
const int MAX_C = 10020;
bool omote[MAX_R][MAX_C];
int avai[MAX_C];
int avai_ori[MAX_C]; // 変化させない
int main(int argc, const char *argv[]) {
while (tr... | replace | 40 | 46 | 40 | 44 | 0 | |
p00448 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int r, c;
vector<vector<int>> field;
int search() {
int counter;
int max_num = 0;
counter = 1 << r;
for (int i = 0; i < counter; i++) {
int num = 0;
for (int j = 0; j < r; j++) {
if ((i >> j) & 1) {
for (int k = 0; k < c; k++)... | #include <iostream>
#include <vector>
using namespace std;
int r, c;
vector<vector<int>> field;
int search() {
int counter;
int max_num = 0;
counter = 1 << r;
for (int i = 0; i < counter; i++) {
int num = 0;
for (int j = 0; j < r; j++) {
if ((i >> j) & 1) {
for (int k = 0; k < c; k++)... | insert | 57 | 57 | 57 | 58 | 0 | |
p00448 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int bd[10][1000];
int main() {
while (1) {
int r, c;
scanf(" %d %d", &r, &c);
if (r == 0 && c == 0)
break;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf(" %d", &bd[i][j]);
}
}
int ans =... | #include <algorithm>
#include <cstdio>
using namespace std;
int bd[10][10000];
int main() {
while (1) {
int r, c;
scanf(" %d %d", &r, &c);
if (r == 0 && c == 0)
break;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
scanf(" %d", &bd[i][j]);
}
}
int ans ... | replace | 5 | 6 | 5 | 6 | 0 | |
p00448 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int x[10][10000], H, W;
int main() {
while (true) {
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++)
cin >> x[i][j];
}
int maxn = 0;
for (int i = 0; i < (1 << H); i++) {
int cnt = 0;
for... | #include <algorithm>
#include <iostream>
using namespace std;
int x[10][10000], H, W;
int main() {
while (true) {
cin >> H >> W;
if (H + W == 0)
break;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++)
cin >> x[i][j];
}
int maxn = 0;
for (int i = 0; i < (1 << H); i+... | insert | 7 | 7 | 7 | 9 | TLE | |
p00449 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> Pi;
struct edge {
int to, cost;
};
typedef vector<vector<edge>> Graph;
int Dijkstr(Graph &info, int s, int g) {
// if(info.size() <= 0) return -1;
vector<int> min_cost; // その場の最小値
priority_queue... | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> Pi;
struct edge {
int to, cost;
};
typedef vector<vector<edge>> Graph;
int Dijkstr(Graph &info, int s, int g) {
// if(info.size() <= 0) return -1;
vector<int> min_cost; // その場の最小値
priority_queue... | replace | 31 | 32 | 31 | 32 | 0 | |
p00449 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | replace | 55 | 57 | 55 | 57 | TLE | |
p00449 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | replace | 78 | 83 | 78 | 84 | TLE | |
p00449 | C++ | Time Limit Exceeded | #include <iostream>
#define INF 1000000000
using namespace std;
int dis[5010][5010];
int gedi(int x, int y) {
if (x > y)
return dis[y][x];
else
return dis[x][y];
}
void sedi(int x, int y, int v) {
if (x > y)
dis[y][x] = v;
else
dis[x][y] = v;
}
int N;
void wf() {
for (int k = 0; k < N; k++) {... | #include <iostream>
#define INF 1000000000
using namespace std;
int dis[5010][5010];
int gedi(int x, int y) {
if (x > y)
return dis[y][x];
else
return dis[x][y];
}
void sedi(int x, int y, int v) {
if (x > y)
dis[y][x] = v;
else
dis[x][y] = v;
}
int N;
void wf() {
for (int k = 0; k < N; k++) {... | replace | 21 | 22 | 21 | 22 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.