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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00255 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | replace | 25 | 26 | 25 | 26 | 0 | |
p00255 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main(void) {
int n, i, e, h[10000];
unsigned int x, z, a, w;
while (1) {
w = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &e);
w += e;
}
for (i = 0; i <... | #include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main(void) {
int n, i, e, h[65000];
unsigned int x, z, a, w;
while (1) {
w = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &e);
w += e;
}
for (i = 0; i <... | replace | 6 | 7 | 6 | 7 | TLE | |
p00256 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct S {
ll y, m, d;
};
struct Ma {
ll b, ka, t, w, ki;
};
// 12,1,2,3...11
int M[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool check(ll y) { return (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0)); }
S M2S(ll b, ll ka, ll t, ll w, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct S {
ll y, m, d;
};
struct Ma {
ll b, ka, t, w, ki;
};
// 12,1,2,3...11
int M[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool check(ll y) { return (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0)); }
S M2S(ll b, ll ka, ll t, ll w, ... | replace | 27 | 28 | 27 | 29 | 0 | |
p00256 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, a) for (int i = 0; i != (a); ++i)
#define repd(i, a) for (int i = (a); i >= 0; --i)
const int units[4] = {20, 18, 20, 20}, cycle = 13 * 20 * 20 * 20 * 18;
typedef long long ll;
bool isLeap(int y) { return (y... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, a) for (int i = 0; i != (a); ++i)
#define repd(i, a) for (int i = (a); i >= 0; --i)
const int units[4] = {20, 18, 20, 20}, cycle = 13 * 20 * 20 * 20 * 18;
typedef long long ll;
bool isLeap(int y) { return (y... | insert | 44 | 44 | 44 | 51 | TLE | |
p00256 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <... | replace | 92 | 93 | 92 | 93 | MLE | |
p00256 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int64;
#define __2012_12_21__ 735224
#define MAX_YEAR 10000000
int64 days[MAX_YEAR + 1];
int month[2][13] = {
{0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365},
{0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366}};
bool urudos... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned int64;
#define __2012_12_21__ 735224
#define MAX_YEAR 10000000
int64 days[MAX_YEAR + 1];
int month[2][13] = {
{0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365},
{0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366}};
bool urudosi... | replace | 2 | 3 | 2 | 3 | MLE | |
p00257 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | insert | 76 | 76 | 76 | 77 | -6 | double free or corruption (out)
|
p00257 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 255
using namespace std;
int m, n, d[N];
bool used[2][N], ans;
void dfs(int x, int idx) {
if (used[idx][x])
return;
x += d[x];
if (x < 0)
x = 0;
if (n + 1 < x)
x = n + 1;
for (int i = 1; i <= m; i++) {
int nx = x + i;
if (n + 1 < nx)
nx = n + 1;
... | #include <bits/stdc++.h>
#define N 255
using namespace std;
int m, n, d[N];
bool used[2][N], ans;
void dfs(int x, int idx) {
if (used[idx][x])
return;
used[idx][x] = true;
x += d[x];
if (x < 0)
x = 0;
if (n + 1 < x)
x = n + 1;
for (int i = 1; i <= m; i++) {
int nx = x + i;
if (n + 1 < n... | insert | 9 | 9 | 9 | 10 | -11 | |
p00257 | 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"
typede... | #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"
typede... | replace | 196 | 197 | 196 | 198 | 0 | |
p00258 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | replace | 58 | 59 | 58 | 59 | TLE | |
p00258 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, x;
int a[30], b[30];
int dp[30][(1 << 16)];
int main() {
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++) {
a[i] = 0;
for (int j = 0; j < 16; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int n, m, x;
int a[50], b[50];
int dp[50][(1 << 16)];
int main() {
while (1) {
scanf("%d %d", &n, &m);
if (n == 0 && m == 0)
break;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++) {
a[i] = 0;
for (int j = 0; j < 16; j++) {
... | replace | 3 | 5 | 3 | 5 | 0 | |
p00258 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#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 <fstream>
#include <functional>
#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 | 55 | 56 | 55 | 56 | 0 | |
p00258 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define pb push_back
int cnt_bit(int n) {
int ret = 0;
while (n > 0) {
ret++;
n -= n & -n;
}
return ret;
}
int main() {
while (1) {
static int n, c, in;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
#define pb push_back
int cnt_bit(int n) {
int ret = 0;
while (n > 0) {
ret++;
n -= n & -n;
}
return ret;
}
int main() {
while (1) {
static int n, c, in;
... | insert | 53 | 53 | 53 | 55 | TLE | |
p00258 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#define rep(i, n) reps(i, 0, n)
const int... | #include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define reps(i, f, n) for (int i = f; i < int(n); ++i)
#define rep(i, n) reps(i, 0, n)
const int... | insert | 43 | 43 | 43 | 46 | TLE | |
p00258 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i, m, n) for (int i = m; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i, m, n) for (int i = m; i < n; i+... | insert | 65 | 65 | 65 | 67 | TLE | |
p00258 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int a[30], b[30], dp[30][1 << 16];
int count(int num) {
int res = 0;
for (int i = 0; i < 16; i++)
if (num & (1 << i))
res++;
return res;
}
int main(void) {
int n, c, in;
while (cin >> n >> c, n | c) {
fill(a,... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int a[31], b[31], dp[31][1 << 16];
int count(int num) {
int res = 0;
for (int i = 0; i < 16; i++)
if (num & (1 << i))
res++;
return res;
}
int main(void) {
int n, c, in;
while (cin >> n >> c, n | c) {
fill(a,... | replace | 6 | 7 | 6 | 7 | 0 | |
p00258 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#define debug(x) c... | insert | 62 | 62 | 62 | 64 | TLE | |
p00259 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i, b) loop(i, 0... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i, b) loop(i, 0... | replace | 97 | 98 | 97 | 98 | 0 | |
p00259 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#incl... | replace | 121 | 122 | 121 | 122 | 0 | |
p00259 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i, m, n) for (int i = m; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)), UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a + mod - b) % mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i, m, n) for (int i = m; i < n; i+... | replace | 149 | 150 | 149 | 153 | TLE | |
p00261 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int node[10][10];
node[0][0] = 1;
node[0][1] = 2;
node[1][0] = -1;
node[1][1] = 3;
node[2][0] = 1;
node[2][1] = -1;
node[3][0] = 4;
node[3][1] = 5;
node[4][0] = 5;
node[4][1] = 2;
node[5][0] = 2;
node[5][1] = 1;
while (... | #include <iostream>
#include <string>
using namespace std;
int main() {
int node[10][10];
node[0][0] = 1;
node[0][1] = 2;
node[1][0] = -1;
node[1][1] = 3;
node[2][0] = 1;
node[2][1] = -1;
node[3][0] = 4;
node[3][1] = 5;
node[4][0] = 5;
node[4][1] = 2;
node[5][0] = 2;
node[5][1] = 1;
while (... | insert | 26 | 26 | 26 | 28 | 0 | |
p00262 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int i, j, n, m, s, p, d[100];
while (cin >> n && n > 0) {
s = p = 0;
for (i = 0; i < n; i++) {
cin >> d[i];
s += d[i];
}
for (i = 1, m = 0; i <= 100; i++) {
m += i;
if (s == m)
break;
}
if (i < 101)
... | #include <iostream>
using namespace std;
int main() {
int i, j, n, m, s, p, d[6000];
while (cin >> n && n > 0) {
s = p = 0;
for (i = 0; i < n; i++) {
cin >> d[i];
s += d[i];
}
for (i = 1, m = 0; i <= 100; i++) {
m += i;
if (s == m)
break;
}
if (i < 101)
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00262 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num[1000] = {}, co = n;
for (int i = 0; i < n; i++)
cin >> num[i];
for (int i = 0;; i++) {
bool kawa = 1;
if (i == 10000) {
cout << -1 << endl;
break;
}
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int num[2000] = {}, co = n;
for (int i = 0; i < n; i++)
cin >> num[i];
for (int i = 0;; i++) {
bool kawa = 1;
if (i == 10000) {
cout << -1 << endl;
break;
}
for (int j = ... | replace | 5 | 6 | 5 | 6 | 0 | |
p00262 | C++ | Runtime Error | #include <stdio.h>
int b[100];
int main() {
int a;
while (scanf("%d", &a), a) {
for (int i = 0; i < a; i++)
scanf("%d", b + i);
int now = 0;
int n = a;
while (1) {
bool ok = true;
for (int i = 0; i < n; i++)
if (b[i] != i + 1)
ok = false;
if (ok) {
p... | #include <stdio.h>
int b[10000];
int main() {
int a;
while (scanf("%d", &a), a) {
for (int i = 0; i < a; i++)
scanf("%d", b + i);
int now = 0;
int n = a;
while (1) {
bool ok = true;
for (int i = 0; i < n; i++)
if (b[i] != i + 1)
ok = false;
if (ok) {
... | replace | 1 | 2 | 1 | 2 | 0 | |
p00262 | C++ | Runtime Error | #include <iostream>
using namespace std;
int blocks[101], n;
void update() {
for (int i = 0; i < n; i++)
blocks[i]--;
blocks[n++] = n;
int m = 0;
for (int i = 0; i < n; i++) {
if (blocks[i] == 0) {
m++;
} else
blocks[i - m] = blocks[i];
}
n -= m;
}
bool check() {
for (int i = 0;... | #include <iostream>
using namespace std;
int blocks[1000001], n;
void update() {
for (int i = 0; i < n; i++)
blocks[i]--;
blocks[n++] = n;
int m = 0;
for (int i = 0; i < n; i++) {
if (blocks[i] == 0) {
m++;
} else
blocks[i - m] = blocks[i];
}
n -= m;
}
bool check() {
for (int i ... | replace | 3 | 4 | 3 | 4 | 0 | |
p00262 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int n, s;
bool triangle(vector<int> v) {
for (int i = 0; i < v.size(); i++) {
if (v[i] != i + 1)
return false;
}
return true;
}
vector<int> shift(vector<int> v) {
vector<int> ret;
for (int i = 0; i < v.size(); i++) {
if (v[i])
ret.... | #include <iostream>
#include <vector>
using namespace std;
int n, s;
bool triangle(vector<int> v) {
for (int i = 0; i < v.size(); i++) {
if (v[i] != i + 1)
return false;
}
return true;
}
vector<int> shift(vector<int> v) {
vector<int> ret;
for (int i = 0; i < v.size(); i++) {
if (v[i])
ret.... | replace | 34 | 35 | 34 | 35 | TLE | |
p00262 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (!n)
return 0;
int x[105];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
int res = -1;
for (int i = 0; i <= 10000; i++) {
for (int j = 0; j < n; ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (!n)
return 0;
int x[10005];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
int res = -1;
for (int i = 0; i <= 10000; i++) {
for (int j = 0; j < n... | replace | 10 | 11 | 10 | 11 | -6 | *** stack smashing detected ***: terminated
|
p00262 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <... | replace | 93 | 94 | 93 | 94 | 0 | |
p00265 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 15
int main() {
bool T[MAX + 1];
int N, Q, q, x, L[MAX + 1];
for (int i = 0; i <= MAX; i++) {
T[i] = false;
L[i] = 0;
}
scanf("%d %d", &N, &Q);
for (int i = 0; i < N; i++) {
scanf("%d", &x);
T[x] = true;
}
int m = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define MAX 300000
int main() {
bool T[MAX + 1];
int N, Q, q, x, L[MAX + 1];
for (int i = 0; i <= MAX; i++) {
T[i] = false;
L[i] = 0;
}
scanf("%d %d", &N, &Q);
for (int i = 0; i < N; i++) {
scanf("%d", &x);
T[x] = true;
}
int m = 0;
for... | replace | 2 | 3 | 2 | 3 | 0 | |
p00265 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, P> P3;
const ll MOD = ll(1e9 + 7);
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(3e5 + 5);
const double EPS = 1e-4;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, P> P3;
const ll MOD = ll(1e9 + 7);
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(3e5 + 5);
const double EPS = 1e-4;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define R... | replace | 22 | 23 | 22 | 23 | 0 | |
p00265 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | replace | 30 | 31 | 30 | 31 | 0 | |
p00265 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
#define MAX_N 300000
#define MAX_Q 100000
int N, Q;
bool c[MAX_N + 1] = {false}, found = false;
int q[MAX_Q];
int ub, lb, range;
int main() {
int input;
range = 0;
scanf("%d%d", &N, &Q);
for (int i = 0; i < N; i++) {
scanf("%d", &input);
c[i... | #include <algorithm>
#include <cstdio>
using namespace std;
#define MAX_N 300000
#define MAX_Q 100000
int N, Q;
bool c[MAX_N + 1] = {false}, found = false;
int q[MAX_Q];
int ub, lb, range;
int main() {
int input;
range = 0;
scanf("%d%d", &N, &Q);
for (int i = 0; i < N; i++) {
scanf("%d", &input);
c[i... | replace | 37 | 38 | 37 | 38 | TLE | |
p00266 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int N_MAX = 100000;
const int R_MAX = 50;
const int BigNumber = 1000000007;
long long *Factrial;
const int smallNMax = 100;
struct squaence {
int start, length, counter;
squaence() {}
squaence(int _start, int _... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int N_MAX = 100000;
const int R_MAX = 50;
const int BigNumber = 1000000007;
long long *Factrial;
const int smallNMax = N_MAX;
struct squaence {
int start, length, counter;
squaence() {}
squaence(int _start, int... | replace | 10 | 11 | 10 | 11 | 0 | |
p00268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <deque>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
double eps = 1e-6;
double x[110];
double y[110];
double px[700];
double py[700];
int ijk[700];
int v[700];
const double EPS = 1e-8;
const double INF = 1e12;
double PI = 3... | #include <algorithm>
#include <complex>
#include <deque>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
double eps = 1e-6;
double x[110];
double y[110];
double px[700];
double py[700];
int ijk[700];
int v[700];
const double EPS = 1e-8;
const double INF = 1e12;
double PI = 3... | replace | 42 | 43 | 42 | 43 | TLE | |
p00270 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, x) for (int i = 0; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rep1(i, x) for (int i = 1; i <= x; i... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define rep(i, x) for (int i = 0; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rep1(i, x) for (int i = 1; i <= x; i... | replace | 127 | 132 | 127 | 134 | TLE | |
p00271 | C++ | Time Limit Exceeded | #include <cstdio>
int main() {
for (int a, b; scanf("%d%d", &a, &b);)
printf("%d\n", a - b);
} | #include <cstdio>
int main() {
for (int a, b; scanf("%d%d", &a, &b) + 1;)
printf("%d\n", a - b);
} | replace | 2 | 3 | 2 | 3 | TLE | |
p00273 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int x, y, b, p;
int p1, p2;
cin >> x >> y >> b >> p;
p1 = x * b + y * p;
p2 = x * max(5, b) + y * max(2, p);
p2 *= 0.8;
return min(p1, p2);
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int x, y, b, p;
int p1, p2;
cin >> x >> y >> b >> p;
p1 = x * b + y * p;
p2 = x * max(5, b) + y * max(2, p);
p2 *= 0.8;
cout << min(p1, p2) << endl;
}
return ... | replace | 15 | 16 | 15 | 16 | 200 | |
p00274 | C++ | Runtime Error | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | insert | 42 | 42 | 42 | 43 | 0 | |
p00274 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int N = 1;
static int k[100];
int i;
int a, b;
for (;;) {
scanf("%d", &N);
if (N == 0)
break;
for (i = 0; i < N; i++)
scanf("%d", &k[i]);
a = 0, b = 0;
for (i = 0; i < N; i++) {
if (k[i] == 0)
a++;
if (k[i] < 2)
... | #include <stdio.h>
int main(void) {
int N = 1;
static int k[10000];
int i;
int a, b;
for (;;) {
scanf("%d", &N);
if (N == 0)
break;
for (i = 0; i < N; i++)
scanf("%d", &k[i]);
a = 0, b = 0;
for (i = 0; i < N; i++) {
if (k[i] == 0)
a++;
if (k[i] < 2)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p00274 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, i, j;
int a[1000];
while (1) {
cin >> n;
int c = 0;
int s = 0;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 1) {
c++;
if (a[i] == 0) {
s++;
}
}
}
... | #include <iostream>
using namespace std;
int main() {
int n, i, j;
int a[100001];
while (1) {
cin >> n;
int c = 0;
int s = 0;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 1) {
c++;
if (a[i] == 0) {
s++;
}
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p00274 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int N, i, c;
int *k, *kk;
while (1) {
scanf("%d", &N);
if (N == 0)
break;
k = new int[N];
kk = new int[N];
for (i = 0; i < N; i++)
kk[i] = 0;
for (i = 0; i < N; i++)
scanf("%d", &k[i]);
i = 0, c = 0;
while (1) {
if (k[i %... | #include <stdio.h>
int main(void) {
int N, i, c;
int *k, *kk;
while (1) {
scanf("%d", &N);
if (N == 0)
break;
k = new int[N];
kk = new int[N];
for (i = 0; i < N; i++)
kk[i] = 0;
for (i = 0; i < N; i++)
scanf("%d", &k[i]);
i = 0, c = 0;
while (1) {
if (k[i %... | replace | 26 | 27 | 26 | 27 | TLE | |
p00275 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int N;
cin >> N;
if (N == 0)
break;
string c;
cin >> c;
int maisu[10];
for (int i = 0; i < c.size(); i++) {
maisu[i] = 0;
}
int ba = 0;
int turn = 0;
f... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int N;
cin >> N;
if (N == 0)
break;
string c;
cin >> c;
int maisu[10];
for (int i = 0; i < N; i++) {
maisu[i] = 0;
}
int ba = 0;
int turn = 0;
for (int... | replace | 16 | 17 | 16 | 17 | -6 | *** stack smashing detected ***: terminated
|
p00275 | 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"
int m... | #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"
int m... | insert | 15 | 15 | 15 | 17 | -11 | |
p00276 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
/*
*
*/
int main(int argc, char **argv) {
int Q, c, a, n;
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> c >> a >> n;
int lim = (c + a + n) / 3, res = 0;
if (lim > c)
lim = c;
int j = 0, k = 0, l = 0;
for (; j + k + l <= lim; j++) {
for... | #include <iostream>
using namespace std;
/*
*
*/
int main(int argc, char **argv) {
int Q, c, a, n;
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> c >> a >> n;
int lim = (c + a + n) / 3, res = 0;
if (lim > c)
lim = c;
int j = 0, k = 0, l = 0;
for (;
(j + k + l <= lim && j * ... | replace | 17 | 24 | 17 | 28 | TLE | |
p00276 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | replace | 35 | 36 | 35 | 36 | 0 | |
p00276 | C++ | Time Limit Exceeded | #include <stdio.h>
int A[12];
int main() {
int i, a, b, c = 0, d = 0, n, e = 0, f = 0, l = -1, j;
char S[102];
scanf("%d", &d);
for (i = 0; i < d; i++) {
scanf("%d %d %d", &c, &a, &n);
while (1) {
if (c > 0 && a > 0 && n > 0) {
e++;
c--;
a--;
n--;
} else if (c... | #include <stdio.h>
int A[12];
int main() {
int i, a, b, c = 0, d = 0, n, e = 0, f = 0, l = -1, j;
char S[102];
scanf("%d", &d);
for (i = 0; i < d; i++) {
scanf("%d %d %d", &c, &a, &n);
while (1) {
if (c > 0 && a > 0 && n > 0) {
e++;
c--;
a--;
n--;
} else if (c... | replace | 21 | 23 | 21 | 22 | TLE | |
p00276 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, j) REP((i), 0, (j))
#define REP(i, j, k) for (int i = (j); (i) < (k)... | replace | 35 | 36 | 35 | 36 | 0 | |
p00276 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int Q;
cin >> Q;
while (Q--) {
int C, A, N;
cin >> C >> A >> N;
int ans = 0;
for (int k = 0; k <= N; k++) {
for (int i = 0; i <= A; i++) {
for (int j = 0; j <= C / 3; j++) {
int c ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int Q;
cin >> Q;
while (Q--) {
int C, A, N;
cin >> C >> A >> N;
int ans = 0;
for (int k = 0; k <= N; k++) {
for (int i = 0; i <= (A - k); i++) {
for (int j = 0; j <= (C - k - 2 * i) / 3; j++... | replace | 13 | 15 | 13 | 15 | TLE | |
p00276 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
int q;
int c, a, n;
int main(void) {
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d%d%d", &c, &a, &n);
int res = 0;
for (int j = 0; j <= c / 3; j++) {
for (int k = 0; k <= c / 2; k++) {
for (int l = 0; l <= min(c, min... | #include <algorithm>
#include <cstdio>
using namespace std;
int q;
int c, a, n;
int main(void) {
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d%d%d", &c, &a, &n);
int res = 0;
while (c > 0 && a > 0 && n > 0) {
c--;
a--;
n--;
res++;
}
while (c > 1 && a > 0) {
... | replace | 13 | 23 | 13 | 27 | TLE | |
p00276 | C++ | Time Limit Exceeded | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int Q;
cin >> Q;
while (Q-- > 0) {
int c, a, n, ans = 0;
cin >> c >> a >> n;
// 1 1 1
for (int i = 0; i <= n; i++) {
// 2 1 0
for (int j = 0; j <= (a - i); j++) {
// 3 0 0
for (int k = 0; k <= (c... | #include <cstring>
#include <iostream>
using namespace std;
int main() {
int Q;
cin >> Q;
while (Q-- > 0) {
int c, a, n, ans = 0;
cin >> c >> a >> n;
// 1 1 1
for (int i = 0; i <= n; i++) {
// 2 1 0
for (int j = 0; j <= (a - i); j++) {
// 3 0 0
for (int k = 0; k <= (c... | replace | 16 | 17 | 16 | 17 | TLE | |
p00277 | C++ | Runtime Error | #include <climits>
#include <iostream>
#include <utility>
typedef std::pair<int, int> P;
const int MAX_N = 100000;
int n;
// fst: -得点, snd: チームの番号
P dat[MAX_N * 2 - 1];
int cnt[MAX_N];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i != n * 2 - 1; ++i)
dat[i] = std::make_pair(INT_... | #include <climits>
#include <iostream>
#include <utility>
typedef std::pair<int, int> P;
const int MAX_N = 1 << 17;
int n;
// fst: -得点, snd: チームの番号
P dat[MAX_N * 2 - 1];
int cnt[MAX_N];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i != n * 2 - 1; ++i)
dat[i] = std::make_pair(INT... | replace | 6 | 7 | 6 | 7 | 0 | |
p00277 | C++ | Time Limit Exceeded | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int main() {
/*
int N,R,L;
int n,t,s;
int now... | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef pair<int, int> P;
const int INF = 1000000000;
int main() {
/*
int N,R,L;
int n,t,s;
int now... | replace | 63 | 65 | 63 | 68 | TLE | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | replace | 39 | 40 | 39 | 40 | 0 | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define INF 2000000000
typedef pair<int, int> seg;
seg dat[1 << 18];
int ans[1 << 17];
int n, N, R, L;
void update(int i, seg x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = min(dat[i * 2 + 1], dat[i * 2... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define INF 2000000000
typedef pair<int, int> seg;
seg dat[1 << 18 + 1];
int ans[1 << 17];
int n, N, R, L;
void update(int i, seg x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = min(dat[i * 2 + 1], dat[i... | replace | 7 | 8 | 7 | 8 | 0 | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
#define N_MAX 100000
typedef pair<int, int> P;
int main() {
int N, R, L;
int d, t, x;
int time[N_MAX] = {0};
int score[N_MAX] = {0};
cin >> N >> R >> L;
priority_queue<P> que;
for (int i = 1; i <= N; i++) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
#define N_MAX 100001
typedef pair<int, int> P;
int main() {
int N, R, L;
int d, t, x;
int time[N_MAX] = {0};
int score[N_MAX] = {0};
cin >> N >> R >> L;
priority_queue<P> que;
for (int i = 1; i <= N; i++) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
#define N_MAX 100000
typedef pair<int, int> P;
int main() {
int N, R, L;
int d, t, x;
int time[N_MAX] = {0};
int score[N_MAX] = {0};
cin >> N >> R >> L;
priority_queue<P> que;
for (int i = 1; i <= N; i++) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
using namespace std;
#define N_MAX 100001
typedef pair<int, int> P;
int main() {
int N, R, L;
int d, t, x;
int time[N_MAX] = {0};
int score[N_MAX] = {0};
cin >> N >> R >> L;
priority_queue<P> que;
for (int i = 1; i <= N; i++) {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
#define MAX 1111111
#define MIN -1111111
typedef pair<int, int> P;
void init(int n);
void update(int k, int x);
P maxx(int k1, int k2);
P dat[2 * 100001];
int tim[100001] = {0};
int N;
int main() {
int R, L;
cin >> N >>... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
using namespace std;
#define MAX 1111111
#define MIN -1111111
typedef pair<int, int> P;
void init(int n);
void update(int k, int x);
P maxx(int k1, int k2);
P dat[4 * 100001];
int tim[100001] = {0};
int N;
int main() {
int R, L;
cin >> N >>... | replace | 11 | 12 | 11 | 12 | 0 | |
p00277 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[100010];
struct node {
int id, point;
} node[1 << 21];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[150010];
struct node {
int id, point;
} node[1 << 21];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | replace | 4 | 5 | 4 | 5 | 0 | |
p00277 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[125010];
struct node {
int id, point;
} node[1 << 21];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[137510];
struct node {
int id, point;
} node[1 << 21];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | replace | 4 | 5 | 4 | 5 | 0 | |
p00277 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[130010];
struct node {
int id, point;
} node[1 << 20];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[135010];
struct node {
int id, point;
} node[1 << 20];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | replace | 4 | 5 | 4 | 5 | 0 | |
p00277 | C++ | Runtime Error | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[130625];
struct node {
int id, point;
} node[1 << 18];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | #include <bits/stdc++.h>
// #define DEBUG
using namespace std;
int n, a[131100];
struct node {
int id, point;
} node[1 << 18];
void add(int id, int x) {
id = n - 1 + id;
node[id].point += x;
while (id > 0) {
id = (id - 1) / 2;
int c1 = 2 * id + 1, c2 = 2 * id + 2;
if (node[c1].point >= node[c2].p... | replace | 4 | 5 | 4 | 5 | 0 | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int a[200005][2];
int s[100005];
int main() {
int i, j, k;
int n, r, l;
int d = 0;
int t = 0;
int x = 0;
int nn = 0;
int f = 0;
memset(a, 0, sizeof(a));
memset(s, 0, sizeof(s));
cin >> n >> r >> l;
nn = 1;
while (nn... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int a[400005][2];
int s[100005];
int main() {
int i, j, k;
int n, r, l;
int d = 0;
int t = 0;
int x = 0;
int nn = 0;
int f = 0;
memset(a, 0, sizeof(a));
memset(s, 0, sizeof(s));
cin >> n >> r >> l;
nn = 1;
while (nn... | replace | 4 | 5 | 4 | 5 | 0 | |
p00277 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF (1e9)
typedef pair<int, int> pii;
const int MAX_N = (1 << 17);
struct RMQ {
int n;
pii dat[MAX_N];
void init(int n_) {
n = 1;
while (n < n_) {
n *= 2;
}
for (int i = 0; i < 2 * n - 1; i++) {
dat[i] = pii(-INF, -INF);
}
... | #include <bits/stdc++.h>
using namespace std;
#define INF (1e9)
typedef pair<int, int> pii;
const int MAX_N = (1 << 18);
struct RMQ {
int n;
pii dat[MAX_N];
void init(int n_) {
n = 1;
while (n < n_) {
n *= 2;
}
for (int i = 0; i < 2 * n - 1; i++) {
dat[i] = pii(-INF, -INF);
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p00277 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#define f first
#define s second
#define MAX_T 100005
using namespace std;
typedef pair<int, int> P;
P teamp[MAX_T * 2 - 1];
P teamt[MAX_T * 2 - 1];
void init(int n);
void updateP(int k, int a, int n);
void updateT(int k, int a, int n);
int main() {
int N, R, ... | #include <algorithm>
#include <iostream>
#include <map>
#define f first
#define s second
#define MAX_T 100005
using namespace std;
typedef pair<int, int> P;
P teamp[MAX_T * 4 - 1];
P teamt[MAX_T * 4 - 1];
void init(int n);
void updateP(int k, int a, int n);
void updateT(int k, int a, int n);
int main() {
int N, R, ... | replace | 9 | 11 | 9 | 11 | 0 | |
p00277 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXI... | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
// #define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXI... | replace | 28 | 29 | 28 | 29 | 0 | |
p00277 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, R, L;
cin >> N >> R >> L;
vector<long long int> data(N + 1, 0);
vector<int> timet(N + 1, 0);
int maxteam = 1;
int maxs = 0;
int time = 0;
int d, t, x;
for (int i = 0; i < R; i++) {
cin >> d >> t >> x;
timet[maxtea... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, R, L;
cin >> N >> R >> L;
vector<long long int> data(N + 1, 0);
vector<int> timet(N + 1, 0);
int maxteam = 1;
int maxs = 0;
int time = 0;
int d, t, x;
for (int i = 0; i < R; i++) {
cin >> d >> t >> x;
timet[maxtea... | replace | 19 | 25 | 19 | 32 | TLE | |
p00277 | C++ | Time Limit Exceeded | // 2013/11/05 Tazoe
#include <iostream>
using namespace std;
int main() {
int N, R, L;
cin >> N >> R >> L;
long long P[100001] = {0};
int W = 1;
int T[100001] = {0};
int tp = 0;
for (int i = 0; i < R; i++) {
int d, t, x;
cin >> d >> t >> x;
T[W] += t - tp;
tp = t;
P[d] += x;
... | // 2013/11/05 Tazoe
#include <iostream>
using namespace std;
int main() {
int N, R, L;
cin >> N >> R >> L;
long long P[100001] = {0};
int W = 1;
int T[100001] = {0};
int tp = 0;
for (int i = 0; i < R; i++) {
int d, t, x;
cin >> d >> t >> x;
T[W] += t - tp;
tp = t;
P[d] += x;
... | replace | 29 | 33 | 29 | 35 | TLE | |
p00279 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const double EPS = 1e-8;
const double INF = 1e77;
struct point {
double x, y;
point() : x(0), y(0) {}
point(double x, double y) : x(x), y(y) {}
po... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const double EPS = 1e-8;
const double INF = 1e77;
struct point {
double x, y;
point() : x(0), y(0) {}
point(double x, double y) : x(x), y(y) {}
po... | replace | 52 | 53 | 52 | 53 | TLE | |
p00279 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
namespace geometry {
// ???????????§??????
typedef complex<double> Point;
struct Segment {
Point p1, p2;
Segment(const Point &p1 = Point(), const Point &p2 = Point())
: p1(p1), p2(p2) {}
};
struct Circle {
Point p;
double r;
Circle(const Point &p = Point... | #include <bits/stdc++.h>
using namespace std;
namespace geometry {
// ???????????§??????
typedef complex<double> Point;
struct Segment {
Point p1, p2;
Segment(const Point &p1 = Point(), const Point &p2 = Point())
: p1(p1), p2(p2) {}
};
struct Circle {
Point p;
double r;
Circle(const Point &p = Point... | replace | 320 | 322 | 320 | 322 | 0 | |
p00280 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int J, Y;
void t(int j, int y, string str) {
if (j > J && y > Y)
return;
if (j == J && y == Y) {
cout << str << endl;
return;
}
if (j == 5 && y == 5) {
return;
}
if ((j <= 3 && y >= 5) || (j >= 5 && y <= 3)) {
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int J, Y;
void t(int j, int y, string str) {
if (j > J || y > Y)
return;
if (j == J && y == Y) {
cout << str << endl;
return;
}
if (j == 5 && y == 5) {
return;
}
if ((j <= 3 && y >= 5) || (j >= 5 && y <= 3)) {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p00280 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int a, b;
void rec(string s, int x, int y) {
if (a == x && b == y) {
cout << s << endl;
return;
}
if ((x < 4 || y < 4) && (x == 5 || y == 5))
return;
rec(s + "A", x + 1, y);
rec(s + "B", x, y + 1);
}
int main() {
scanf("%d%d", &a, &b);
... | #include <iostream>
#include <string>
using namespace std;
int a, b;
void rec(string s, int x, int y) {
if (a == x && b == y) {
cout << s << endl;
return;
}
if ((x < 4 || y < 4) && (x == 5 || y == 5))
return;
if (x + y > 9)
return;
rec(s + "A", x + 1, y);
rec(s + "B", x, y + 1);
}
int main()... | insert | 11 | 11 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p00281 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
using namespace std;
int s[11000];
int t[11000];
int e[11000];
int d[11000];
long long ret[11000];
int main() {
int a, b;
scanf("%d%d", &a, &b);
int p, q, r;
int sz = 0;
while (scanf("%d%d%d", &p, &q, &r), p) {
p--;
q--;
s[sz] = p;
t[sz] = q;
e[sz++]... | #include <algorithm>
#include <stdio.h>
using namespace std;
int s[51000];
int t[51000];
int e[51000];
int d[11000];
long long ret[11000];
int main() {
int a, b;
scanf("%d%d", &a, &b);
int p, q, r;
int sz = 0;
while (scanf("%d%d%d", &p, &q, &r), p) {
p--;
q--;
s[sz] = p;
t[sz] = q;
e[sz++]... | replace | 3 | 6 | 3 | 6 | 0 | |
p00281 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, s, t, e;
cin >> N >> M;
vector<ll> S, T, E, c(N);
while (cin >> s >> t >> e, s) {
S.push_back(s - 1);
T.push_back(t - 1);
E.push_back(e);
}
ll L;
cin >> L;
for (int i = 0; i < L; i++) {
ll b[L];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, s, t, e;
cin >> N >> M;
vector<ll> S, T, E, c(N);
while (cin >> s >> t >> e, s) {
S.push_back(s - 1);
T.push_back(t - 1);
E.push_back(e);
}
ll L;
cin >> L;
for (int i = 0; i < L; i++) {
ll b[M];
... | replace | 18 | 19 | 18 | 19 | 0 | |
p00282 | C++ | Runtime Error | // Template {{{
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long LL;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T>... | // Template {{{
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long LL;
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T>... | replace | 77 | 78 | 77 | 78 | 0 | |
p00282 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << (o) << " "; ... | #include "bits/stdc++.h"
using namespace std;
// #define int long long
#define DBG 0
#define dump(o) \
if (DBG) { \
cerr << #o << " " << (o) << " "; ... | replace | 4 | 5 | 4 | 5 | 0 | v 1024 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
v 625 3164 3674 95 0 0 0 0 0 0 0 0 0 0 0 0 0 0
v 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
v 0 0 0 0 720 131 0 0 0 0 0 0 0 0 0 0 0 0
|
p00283 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int D, N;
vector<int> a(110), e(110), r(110); // 耐久力 経験値 必要な経験値
int dp[110][11000]; // 耐久力 i の時に 経験値 j の時の回数
int solve(int d, int exp) {
int ret = 10e8;
if (d <= 0)
return 0;
if (dp[d][exp] != -1)
return dp[d][exp];
for (i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int D, N;
vector<int> a(110), e(110), r(110); // 耐久力 経験値 必要な経験値
int dp[110][11000]; // 耐久力 i の時に 経験値 j の時の回数
int solve(int d, int exp) {
int ret = 10e8;
if (d <= 0)
return 0;
if (dp[d][exp] != -1)
return dp[d][exp];
for (i... | insert | 17 | 17 | 17 | 19 | 0 | |
p00283 | C++ | Time Limit Exceeded | #include <stdio.h>
int min(int a, int b) { return a < b ? a : b; }
int main(void) {
int n, d, i, j, k, inf = 10e8, l;
while (1) {
scanf("%d%d", &d, &n);
if (!d)
break;
int a[n], e[n], r[n], dp[d + 1][200];
for (i = 0; i < n; ++i)
scanf("%d%d%d", &a[i], &e[i], &r[i]);
for (i = 0; i ... | #include <stdio.h>
int min(int a, int b) { return a < b ? a : b; }
int main(void) {
int n, d, i, j, k, inf = 10e8, l;
while (1) {
scanf("%d%d", &d, &n);
if (!d)
break;
int a[n], e[n], r[n], dp[d + 1][200];
for (i = 0; i < n; ++i)
scanf("%d%d%d", &a[i], &e[i], &r[i]);
for (i = 0; i ... | replace | 21 | 25 | 21 | 23 | TLE | |
p00283 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REPR(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REPR(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (... | replace | 116 | 120 | 116 | 122 | TLE | |
p00283 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define INF 100000000
using namespace std;
int n;
int a[101], e[101], r[101];
int dp[101][20001];
int ans, cnt;
int maxr;
void saiki(int d, int ex, int kai) {
cnt++;
if (d <= 0)
dp[0][ex] = 0;
if (d > 0) {
for (int i = 0; i < n; i++) {
if (r[i] <= ex) {
... | #include <algorithm>
#include <iostream>
#define INF 100000000
using namespace std;
int n;
int a[101], e[101], r[101];
int dp[101][20001];
int ans, cnt;
int maxr;
void saiki(int d, int ex, int kai) {
cnt++;
if (d <= 0)
dp[0][ex] = 0;
if (d > 0) {
for (int i = 0; i < n; i++) {
if (r[i] <= ex) {
... | insert | 21 | 21 | 21 | 23 | 0 | |
p00284 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
while (n--) {
cin >> a >> b;
if (a * b > 0) {
if (a < 0)
a *= -1, b *= -1, swap(a, b);
assert(a > 0);
int l = 0;
while (a < b) {
int k = __builtin_ctz(a);
while (a > b - (1 <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
while (n--) {
cin >> a >> b;
if ((a < 0 && b < 0) || (a > 0 && b > 0)) {
if (a < 0) {
a *= -1;
b *= -1;
swap(a, b);
}
int l = 0;
while (a < b) {
int k = __builtin_ctz... | replace | 9 | 13 | 9 | 15 | 0 | |
p00284 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dfs(int s, int g) {
if (s == g)
return 0;
int n = 1;
while (1) {
... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dfs(int s, int g) {
if (s == g)
return 0;
int n = 1;
while (1) {
... | replace | 28 | 30 | 28 | 30 | 0 | |
p00285 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef long long ll;
typedef long double ld;
#define rep(i, x) for (int i = 0; i < x; ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef long long ll;
typedef long double ld;
#define rep(i, x) for (int i = 0; i < x; ... | replace | 40 | 41 | 40 | 42 | 0 | |
p00286 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int H, N, Q, p[30][30];
vector<int> r[30], J;
string c[30];
string S;
vector<int> amida_add(vector<int> a, vector<int> b) {
vector<int> c = a, p = a, q = a;
for (int i = 0; i < a.size(); i++)
p[a[i]] = i;
for (int i = 0; i < b.size... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int H, N, Q, p[30][30];
vector<int> r[30], J;
string c[30];
string S;
vector<int> amida_add(vector<int> a, vector<int> b) {
vector<int> c = a, p = a, q = a;
for (int i = 0; i < a.size(); i++)
p[a[i]] = i;
for (int i = 0; i < b.size... | replace | 82 | 83 | 82 | 83 | 0 | |
p00287 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
bool f[305][305][2];
int d[305][305];
int H, W, M, Q, h, w;
int ax[100], ay[100], bx[100], by[100];
map<int, int> X, Y;
int solve(int sx, int sy, int tx, int ty) {
memset(d, 1, sizeof(d));
deque<int> qx, qy;
qx.pu... | #include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
bool f[405][405][2];
int d[405][405];
int H, W, M, Q, h, w;
int ax[100], ay[100], bx[100], by[100];
map<int, int> X, Y;
int solve(int sx, int sy, int tx, int ty) {
memset(d, 1, sizeof(d));
deque<int> qx, qy;
qx.pu... | replace | 6 | 8 | 6 | 8 | 0 | |
p00287 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef pair<int, int> Pii;
void compress(vector<int> &v) {
sort(v... | #include <algorithm>
#include <cstring>
#include <deque>
#include <iostream>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef pair<int, int> Pii;
void compress(vector<int> &v) {
sort(v... | replace | 23 | 25 | 23 | 25 | 0 | |
p00288 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef pair<int, int> Pii;
us... | #include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef pair<int, int> Pii;
us... | insert | 75 | 75 | 75 | 77 | TLE | |
p00288 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <queue>
#include <vector>
#define INF 1e9
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
edge(int t, int ca, int co, int r) {
to = t;
cap = ca;
cost = co;
rev = r;
}
};
i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <queue>
#include <vector>
#define INF 1e9
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
edge(int t, int ca, int co, int r) {
to = t;
cap = ca;
cost = co;
rev = r;
}
};
i... | replace | 126 | 127 | 126 | 127 | TLE | |
p00292 | C++ | Runtime Error |
#include <iostream>
using namespace std;
int main() {
int N = 0;
int K[10000], P[10000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> K[i];
P[i];
}
for (int i = 0; i < N; i++) {
int ans = K[i] % P[i];
if (ans == 0) {
cout << P[i] << endl;
} else {
cout << ans << endl;
... |
#include <iostream>
using namespace std;
int main() {
int N = 0;
int K[10000], P[10000];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> K[i];
cin >> P[i];
}
for (int i = 0; i < N; i++) {
int ans = K[i] % P[i];
if (ans == 0) {
cout << P[i] << endl;
} else {
cout << ans << en... | replace | 10 | 11 | 10 | 11 | -8 | |
p00292 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
vector<int> a(n);
vector<int> b(n);
while (s <= n - 1) {
cin >> a[s] >> b[s];
s++;
}
s = 0;
while (s <= n - 1) {
if (a[s] % b[s] == 0) {
cout << n << endl;
} else {
cout << ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
vector<int> a(n);
vector<int> b(n);
while (s <= n - 1) {
cin >> a[s] >> b[s];
s++;
}
s = 0;
while (s <= n - 1) {
if (a[s] % b[s] == 0) {
cout << b[s] << endl;
s++;
} else {
... | replace | 17 | 18 | 17 | 19 | TLE | |
p00293 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int i, j, h, w, e, k, min = 9999;
int D = 0, A = 0, R = 0, E = 0, K = 0;
int a[101], b[101], c[101], d[101], scride, z[101] = {0}, p[101] = {0};
cin >> h;
for (i = 0; i < 101; i++) {
a[i] = 999;
b[i] = 999;
d[i] = 999;
c[i] = 999;
}
... | #include <iostream>
using namespace std;
int main(void) {
int i, h, w, e, k;
int D = 0, E = 0, K = 0;
int a[101], b[101], c[101], d[101], z[203] = {0}, p[203] = {0};
cin >> h;
for (i = 0; i < 101; i++) {
a[i] = 999;
b[i] = 999;
d[i] = 999;
c[i] = 999;
}
for (i = 0; i < h; i++) {
cin >>... | replace | 3 | 6 | 3 | 6 | 0 | |
p00293 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int h[110] = {}, k[110] = {}, g[110];
for (int i = 0; i < 110; i++) {
g[i] = 100000;
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i] >> k[i];
}
cin >> m;
for (int i = n; i < n + m; i++) {
cin >> h[i] >> k[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int h[300] = {}, k[300] = {}, g[300];
for (int i = 0; i < 300; i++) {
g[i] = 100000;
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i] >> k[i];
}
cin >> m;
for (int i = n; i < n + m; i++) {
cin >> h[i] >> k[i];
}
... | replace | 4 | 6 | 4 | 6 | 0 | |
p00293 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define Max 24 * 60 + 60 + 1
int main() {
int n, m, n2[101], m2[101];
cin >> n;
for (int i = 0; i < 100; i++)
n2[i] = Max;
for (int i = 0; i < n; i++) {
int h, m;
cin >> h >> m;
n2[i] = h * 60 + m;
}
cin >> m;
for (int i = 0; i < m; i++) {
... | #include "bits/stdc++.h"
using namespace std;
#define Max 24 * 60 + 60 + 1
int main() {
int n, m, n2[101], m2[101];
cin >> n;
for (int i = 0; i < 100; i++)
n2[i] = Max;
for (int i = 0; i < n; i++) {
int h, m;
cin >> h >> m;
n2[i] = h * 60 + m;
}
cin >> m;
for (int i = 0; i < m; i++) {
... | replace | 17 | 18 | 17 | 21 | 0 | |
p00293 | C++ | Runtime Error | #include <bitset>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a[100], b[100], n, m, i, min1 = 100, min2 = 100, num, sa = 0, sa1 = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
cin >> m;
for (int j = i; j < m + i; j++) {
cin >> a[j] >>... | #include <bitset>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a[1000], b[1000], n, m, i, min1 = 100, min2 = 100, num, sa = 0, sa1 = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
cin >> m;
for (int j = i; j < m + i; j++) {
cin >> a[j] ... | replace | 6 | 7 | 6 | 7 | 0 | |
p00293 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, iimo1[201], iimo2[201], turu1[101], turu2[101], co1 = 0, co2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> iimo1[i] >> iimo2[i];
cin >> m;
for (int i = 0; i < m; i++)
cin >> turu1[i] >> turu2[i];
while (n != co1... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m, iimo1[201], iimo2[201], turu1[201], turu2[201], co1 = 0, co2 = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> iimo1[i] >> iimo2[i];
cin >> m;
for (int i = 0; i < m; i++)
cin >> turu1[i] >> turu2[i];
while (n != co1... | replace | 4 | 5 | 4 | 5 | 0 | |
p00293 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int a, s[101], d[101], f, g, h, i, j, z;
scanf("%d", &a);
for (i = 0; i < a; i++)
scanf("%d %d", &s[i], &d[i]);
scanf("%d", &f);
for (i = a; i < a + f; i++)
scanf("%d %d", &s[i], &d[i]);
for (i = 0; i < a + f; i++) {
for (... | #include <math.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int a, s[1001], d[1001], f, g, h, i, j, z;
scanf("%d", &a);
for (i = 0; i < a; i++)
scanf("%d %d", &s[i], &d[i]);
scanf("%d", &f);
for (i = a; i < a + f; i++)
scanf("%d %d", &s[i], &d[i]);
for (i = 0; i < a + f; i++) {
for... | replace | 4 | 5 | 4 | 5 | 0 | |
p00294 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, M, p, ans = 100000;
int lis[10001] = {0}, lismap[100001] = {0};
cin >> N >> M >> p;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
lis[i] = a;
lismap[a] = 1;
}
sort(lis, lis +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int N, M, p, ans = 100000;
int lis[10001] = {0}, lismap[100001] = {0};
cin >> N >> M >> p;
for (int i = 0; i < M; i++) {
int a;
cin >> a;
lis[i] = a;
lismap[a] = 1;
}
sort(lis, lis +... | replace | 27 | 28 | 27 | 28 | TLE | |
p00294 | C++ | Runtime Error | #include <iostream>
#include <limits.h>
const long MAX_N = 100000;
const long MAX_M = 10000;
const long FEE = 100;
long next(bool *stations, long N, long current) {
long i = current + 1;
if (i >= N) {
i = 0;
}
if (i < 0) {
i = N - 1;
}
while (!stations[i]) {
i++;
if (i >= N) {
i ... | #include <iostream>
#include <limits.h>
const long MAX_N = 100000;
const long MAX_M = 10000;
const long FEE = 100;
long next(bool *stations, long N, long current) {
long i = current + 1;
if (i >= N) {
i = 0;
}
if (i < 0) {
i = N - 1;
}
while (!stations[i]) {
i++;
if (i >= N) {
i ... | replace | 52 | 53 | 52 | 53 | 0 | |
p00295 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
class FC {
public:
int p[31];
int n;
bool is_over() {
return p[1] == p[2] && p[2] == p[3] && p[3] == p[4] && p[4] == p[5] &&
p[5] == p[6] && p[6] == p[7] && p[7] == p[8] && p[8] == p[9] &&
p[10] == p[11] && p... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
class FC {
public:
int p[31];
int n;
bool is_over() {
return p[1] == p[2] && p[2] == p[3] && p[3] == p[4] && p[4] == p[5] &&
p[5] == p[6] && p[6] == p[7] && p[7] == p[8] && p[8] == p[9] &&
p[10] == p[11] && p... | replace | 24 | 27 | 24 | 27 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p00295 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int L[4][5] = {
{1, 4, 7, 10, 16}, {3, 6, 9, 12, 13}, {1, 2, 3, 15, 19}, {7, 8, 9, 10, 13}};
int R[4][5] = {{24, 27, 30, 21, 16},
{22, 25, 28, 19, 15},
{28, 29, 30, 16, 21},
{22, 23, 24, 12, 18}};
struct Cube {
int cube[... | #include <bits/stdc++.h>
using namespace std;
int L[4][5] = {
{1, 4, 7, 10, 16}, {3, 6, 9, 12, 13}, {1, 2, 3, 15, 19}, {7, 8, 9, 10, 13}};
int R[4][5] = {{24, 27, 30, 21, 18},
{22, 25, 28, 19, 15},
{28, 29, 30, 16, 21},
{22, 23, 24, 12, 18}};
struct Cube {
int cube[... | replace | 6 | 7 | 6 | 7 | MLE | |
p00295 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | replace | 83 | 84 | 83 | 84 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.