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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p01865 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, N, W[100] = {};
cin >> L >> N;
for (int i = 0; i < N; i++) {
int x, w;
cin >> x >> w;
W[x + 50] += w;
}
vector<pair<int, int>> ret;
for (int i = -2 * L; i < 0; i++) {
int P = W[50 + i];
int Q = W[50 - i];
int R = max... | #include <bits/stdc++.h>
using namespace std;
int main() {
int L, N, W[100] = {};
cin >> L >> N;
for (int i = 0; i < N; i++) {
int x, w;
cin >> x >> w;
W[x + 50] += w;
}
vector<pair<int, int>> ret;
for (int i = -L; i < 0; i++) {
int P = W[50 + i];
int Q = W[50 - i];
int R = max(W[5... | replace | 13 | 14 | 13 | 14 | 0 | |
p01866 | C++ | Runtime Error | #include <cassert>
#include <cstdio>
#include <vector>
using namespace std;
int n;
int d;
char S[1001];
vector<int> ones;
int main() {
scanf("%d", &n);
scanf("%s", S);
scanf("%d", &d);
for (int i = 0; i < n && d > 0; i++) {
if (S[i] == '1')
ones.push_back(i);
else if (S[i] == '0') {
S[i] ... | #include <cassert>
#include <cstdio>
#include <vector>
using namespace std;
int n;
int d;
char S[1001];
vector<int> ones;
int main() {
scanf("%d", &n);
scanf("%s", S);
scanf("%d", &d);
for (int i = 0; i < n && d > 0; i++) {
if (S[i] == '1')
ones.push_back(i);
else if (S[i] == '0') {
S[i] ... | insert | 29 | 29 | 29 | 30 | 0 | |
p01868 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
int main() {
int N, sum = 0;
cin >> N;
vector<int> T(N);
for (auto &i : T)
cin >> i, sum += i;
vector<vector<vector<int>>> dp(
55, vector<vector<int>>(1111, vector<int>(1111, INF)));
dp[0][0][0] = 0;
int res = INF;
for ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
int main() {
int N, sum = 0;
cin >> N;
vector<int> T(N);
for (auto &i : T)
cin >> i, sum += i;
vector<vector<vector<int>>> dp(
51, vector<vector<int>>(1000, vector<int>(1000, INF)));
dp[0][0][0] = 0;
int res = INF;
for ... | replace | 13 | 14 | 13 | 14 | MLE | |
p01869 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int ans = -1;
ll n;
vector<ll> a;
void mk28(ll div) {
if (n < div)
return;
if (div)
a.push_back(div);
mk28(div * 10 + 2);
mk28(div * 10 + 8);
}
void saiki(ll num, int idx, int sum) {
if (num == 1)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int ans = -1;
ll n;
vector<ll> a;
void mk28(ll div) {
if (n < div)
return;
if (div)
a.push_back(div);
mk28(div * 10 + 2);
mk28(div * 10 + 8);
}
void saiki(ll num, int idx, int sum) {
if (num == 1)
... | replace | 21 | 22 | 21 | 22 | TLE | |
p01869 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | insert | 78 | 78 | 78 | 83 | 0 | |
p01869 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | replace | 26 | 27 | 26 | 27 | 0 | |
p01869 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int d[2] = {2, 8}, ans = -1;
vector<ll> v;
void func(int x, ll k) {
if (x)
v.push_back(k);
if (x == 18)
return;
for (int i = 0; i < 2; i++)
func(x + 1, k * 10 + d[i]);
}
void func2(int x, ll k, int ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int d[2] = {2, 8}, ans = -1;
vector<ll> v;
void func(int x, ll k) {
if (x)
v.push_back(k);
if (x == 18)
return;
for (int i = 0; i < 2; i++)
func(x + 1, k * 10 + d[i]);
}
void func2(int x, ll k, int ... | replace | 22 | 23 | 22 | 23 | 0 | |
p01869 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1LL << 28;
ll N;
vector<ll> num;
map<ll, ll> memo;
queue<ll> q;
function<ll(ll)> seki;
int main() {
cin >> N;
q.push(2LL);
q.push(8LL);
while (q.size()) {
ll n = q.front();
q.pop();
if (n <= 1000000000000000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1LL << 28;
ll N;
vector<ll> num;
map<ll, ll> memo;
queue<ll> q;
function<ll(ll)> seki;
int main() {
cin >> N;
q.push(2LL);
q.push(8LL);
while (q.size()) {
ll n = q.front();
q.pop();
num.push_back(n);
if (n ... | replace | 19 | 21 | 19 | 21 | 0 | |
p01869 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
typedef pair<int, P> iP;
ll n;
vector<ll> a;
queue<iP> Q;
void mk28(ll div) {
if (n < div)
return;
if (div)
a.push_back(div);
mk28(div * 10 + 2);
mk28(div * 10... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, ll> P;
typedef pair<int, P> iP;
ll n;
vector<ll> a;
queue<iP> Q;
void mk28(ll div) {
if (n < div)
return;
if (div)
a.push_back(div);
mk28(div * 10 + 2);
mk28(div * 10... | insert | 22 | 22 | 22 | 24 | -11 | |
p01873 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main() {
int N;
scanf("%d"... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main() {
int N;
scanf("%d"... | insert | 28 | 28 | 28 | 30 | TLE | |
p01873 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &a[i]);
}
set<int> s;
for (int i = 1; i * i <= N; ++i) {
if (N % i == 0) {
s.insert(i);
s.insert(N / i)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
scanf("%d", &a[i]);
}
set<int> s;
for (int i = 1; i * i <= N; ++i) {
if (N % i == 0) {
s.insert(i);
s.insert(N / i)... | replace | 26 | 27 | 26 | 27 | TLE | |
p01874 | 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;
const ld eps = 1e-9;
/* ??????????????¬ */
#include <complex>
typedef complex<ld> Point;
const ld pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld ptod = 1. / d... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-6;
/* ??????????????¬ */
#include <complex>
typedef complex<ld> Point;
const ld pi = acos(-1.0);
const ld dtop = pi / 180.;
const ld ptod = 1. / dtop;
... | replace | 5 | 7 | 5 | 7 | TLE | |
p01877 | C++ | Runtime Error | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | /*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
... | replace | 50 | 51 | 50 | 51 | 0 | |
p01878 | 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 mp make_pair
#define pb push_back
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define dbg(x) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define pb push_back
#define each(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define dbg(x) ... | delete | 47 | 49 | 47 | 47 | 0 | |
p01878 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
typedef vector<vector<ll>> Matrix;
int N, K, C, T;
vector<int> shuffle(vector<int> &v, int a, int b) {
vector<int> res;
for (int i = 0; i < b; ++i) {
res.push_back(v[a + i]);
}
for (int i = 0; i < a; ++i) {
res.p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
typedef vector<vector<ll>> Matrix;
int N, K, C, T;
vector<int> shuffle(vector<int> &v, int a, int b) {
vector<int> res;
for (int i = 0; i < b; ++i) {
res.push_back(v[a + i]);
}
for (int i = 0; i < a; ++i) {
res.p... | replace | 50 | 51 | 50 | 53 | TLE | |
p01879 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
struct bit {
vector<ll> v;
bit(int n) : v(n + 1) {}
ll sum(int i) {
ll res = 0;
for (; i > 0; i -= i & -i)
res += v[i];
return res;
}
void add(int i... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
struct bit {
vector<ll> v;
bit(int n) : v(n + 1) {}
ll sum(int i) {
ll res = 0;
for (; i > 0; i -= i & -i)
res += v[i];
return res;
}
void add(int i... | replace | 34 | 35 | 34 | 35 | 0 | |
p01879 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
inline int calcIndex(int i, int j) { return j * (j + 1) / 2 + (j - i); }
int main() {
const int BlockSize = 200;
const int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
inline int calcIndex(int i, int j) { return j * (j + 1) / 2 + (j - i); }
int main() {
const int BlockSize = 250;
const int MaxN = 100000, MaxNumBlocks = (MaxN + BlockSize - 1) / ... | replace | 11 | 12 | 11 | 12 | MLE | |
p01880 | C++ | Runtime Error | //
// main.cpp
// L
//
// Created by LucienShui on 2017/4/20.
// Copyright ? 2017年 LucienShui. All rights reserved.
//
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define mfor(i, n... | //
// main.cpp
// L
//
// Created by LucienShui on 2017/4/20.
// Copyright ? 2017年 LucienShui. All rights reserved.
//
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define mfor(i, n... | delete | 35 | 38 | 35 | 35 | TLE | |
p01880 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define range(i, s... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define range(i, s... | replace | 32 | 33 | 32 | 37 | 0 | |
p01881 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
const int INF = numeric_limits<int>::max() / 2;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
vector<string> v(h);
int sx, sy, px, py;
for (int i = 0; i < h; i++) {
cin >> v[i];
for (int j = 0; j < w; j++) ... | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
const int INF = numeric_limits<int>::max() / 2;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> v(h);
int sx, sy, px, py;
for (int i = 0; i < h; i++) {
cin >> v[i];
for (int j ... | insert | 12 | 12 | 12 | 13 | -11 | |
p01881 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, (n))
#define ALL(a) (a.begin(), a.end())
typedef vector<int> vi;
constexpr int INF = 1000000000;
int main() {
int h, w;
cin >> h >> w;
vector<string> t(h);
int pi, pj, hi, hj;
vi s... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, (n))
#define ALL(a) (a.begin(), a.end())
typedef vector<int> vi;
constexpr int INF = 1000000000;
int main() {
int h, w;
cin >> h >> w;
vector<string> t(h);
int pi, pj, hi, hj;
vi s... | replace | 51 | 52 | 51 | 52 | MLE | |
p01881 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++... | insert | 61 | 61 | 61 | 62 | TLE | |
p01881 | C++ | Time Limit Exceeded | ///
// File: 2781.cpp
// Author: ymiyamoto
//
// Created on Fri Dec 29 19:30:51 2017
//
#include <cstdint>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
uint32_t wfs(vector<string> map, int32_t y, int32_t x) {
vector<vector<int32_t>> visited(map.size(),
... | ///
// File: 2781.cpp
// Author: ymiyamoto
//
// Created on Fri Dec 29 19:30:51 2017
//
#include <cstdint>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
uint32_t wfs(vector<string> map, int32_t y, int32_t x) {
vector<vector<int32_t>> visited(map.size(),
... | replace | 32 | 33 | 32 | 33 | TLE | |
p01900 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
priority_queue<int> Q[3];
int a[100010];
int F(int bef, int aft) {
int cnt = 0;
while (true) {
int pnt = (3 + aft - bef) % 3;
if (Q[pnt].empty())
break;
cnt++;
Q[pnt].pop();
if (!Q[0].empty())... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
priority_queue<int> Q[3];
int a[500010];
int F(int bef, int aft) {
int cnt = 0;
while (true) {
int pnt = (3 + aft - bef) % 3;
if (Q[pnt].empty())
break;
cnt++;
Q[pnt].pop();
if (!Q[0].empty())... | replace | 6 | 7 | 6 | 7 | 0 | |
p01900 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define s second
#define f first
using namespace std;
int main(void) {
int n, ary[3] = {0}, in, ret = 0;
cin >> n;
rep(i, n) {
cin >> in;
ary[in % 3]++;
}
if (ary[1] || ary[2])
ret = ary[0];
int h = 1, now = 0;
;
while (... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define s second
#define f first
using namespace std;
int main(void) {
int n, ary[3] = {0}, in, ret = 0;
cin >> n;
rep(i, n) {
cin >> in;
ary[in % 3]++;
}
if (ary[1] || ary[2])
ret = ary[0];
int mi = min(ary[1], ary[2]);
i... | replace | 15 | 38 | 15 | 21 | TLE | |
p01901 | 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 | |
p01901 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX_N 111111
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 0;
int n;
ll dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INF;
}
void update(int k, ll a) {
k += n - 1;... | #include <bits/stdc++.h>
#define MAX_N 1111111
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 0;
int n;
ll dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INF;
}
void update(int k, ll a) {
k += n - 1... | replace | 1 | 2 | 1 | 2 | 0 | |
p01903 | 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 | 118 | 119 | 118 | 119 | 0 | dinic.solve(0,1) = 5
|
p01903 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF (1e9 + 1)
// #define INF (1LL<<59)
#define MAX_V 100
struct edge {
int to, cap, rev;
};
vector<ed... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define INF (1e9 + 1)
// #define INF (1LL<<59)
#define MAX_V 110
struct edge {
int to, cap, rev;
};
vector<ed... | replace | 10 | 11 | 10 | 11 | 0 | |
p01904 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>... | replace | 67 | 68 | 67 | 68 | TLE | |
p01905 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | replace | 34 | 35 | 34 | 35 | 0 | |
p01906 | C++ | Runtime Error | #include <cstdio>
const int MAX_N = 1000;
int N, M;
int A[MAX_N];
int gcf(int a, int b);
int ans = 0;
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
if (N % M == 0) {
for (int i = 0; i < N; i += M) {
int max = 0, min = 1000;
for (int j = 0; j < M... | #include <cstdio>
const int MAX_N = 1000;
int N, M;
int A[MAX_N];
int gcf(int a, int b);
int ans = 0;
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
if (N % M == 0) {
for (int i = 0; i < N; i += M) {
int max = 0, min = 1000;
for (int j = 0; j < M... | replace | 33 | 40 | 33 | 38 | 0 | |
p01906 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define lol(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int a[110];
pair<int, int> F(int left, int right) {
int p = -1, q = mod;
for (int i = left; i < right; i++) {
p = max(p, a[i... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define lol(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int a[1100];
pair<int, int> F(int left, int right) {
int p = -1, q = mod;
for (int i = left; i < right; i++) {
p = max(p, a[... | replace | 8 | 9 | 8 | 9 | 0 | |
p01907 | C++ | Runtime Error | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
inline double getDouble() {
double s;
scanf("%lf", &s);
return s;
}
#include <queue>
#include <set>
using namespace std;
vector<pair<int, int>> g[10000];
double pp[100000];
do... | #define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
inline double getDouble() {
double s;
scanf("%lf", &s);
return s;
}
#include <queue>
#include <set>
using namespace std;
vector<pair<int, int>> g[100000];
double pp[100000];
d... | replace | 19 | 20 | 19 | 20 | 0 | |
p01907 | C++ | Runtime Error | #include <cstdio>
#include <math.h>
#include <vector>
using namespace std;
const int MAX_N = 10000;
struct edge {
int to, cost;
};
vector<edge> tree[MAX_N];
bool flag[MAX_N] = {false};
int depth[MAX_N];
int s, t, c;
double sum = 0.0;
double ans = 0.0;
double p;
int N;
void dfs(int v, int d) {
flag[v] = true;
... | #include <cstdio>
#include <math.h>
#include <vector>
using namespace std;
const int MAX_N = 100001;
struct edge {
int to, cost;
};
vector<edge> tree[MAX_N];
bool flag[MAX_N] = {false};
int depth[MAX_N];
int s, t, c;
double sum = 0.0;
double ans = 0.0;
double p;
int N;
void dfs(int v, int d) {
flag[v] = true;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p01908 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
//// < "d:\d_download\visual studio
///2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual
///studio 2015\projects\programin... | replace | 20 | 21 | 20 | 21 | 0 | |
p01908 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1e9;
const int64_t in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf = 1e9;
const int64_t in... | insert | 75 | 75 | 75 | 77 | MLE | |
p01908 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | insert | 37 | 37 | 37 | 39 | 0 | |
p01908 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long lon... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef pair<long long int, long long int> P;
long long int INF = 1e18;
long lon... | replace | 47 | 48 | 47 | 48 | 0 | |
p01908 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MAX_L 8
#define MAX_N 100005
typedef long long ll;
ll mod = 1e9 + 7;
ll B = 5575777;
int N;
string S[MAX_N];
set<ll> t[MAX_L + 1];
char tmp[MAX_L + 5];
bool dfs(ll hash, int depth, int anslen) {
if (depth == anslen) {
if (t[anslen].count(hash) == 1)
re... | #include <bits/stdc++.h>
using namespace std;
#define MAX_L 8
#define MAX_N 100005
typedef long long ll;
ll mod = 1e9 + 7;
ll B = 5575777;
int N;
string S[MAX_N];
unordered_set<ll> t[MAX_L + 1];
char tmp[MAX_L + 5];
bool dfs(ll hash, int depth, int anslen) {
if (depth == anslen) {
if (t[anslen].count(hash) == 1... | replace | 10 | 11 | 10 | 11 | TLE | |
p01908 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
S.push_back(s);
}
set<string> st;
for (int i = 0; i < N; i++) {
string s = S[i];
for (int j = 1; j <= s.size(); j++) {
for (int k = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
S.push_back(s);
}
set<string> st;
for (int i = 0; i < N; i++) {
string s = S[i];
for (int j = 1; j <= 4; j++) {
for (int k = 0; k + j <... | replace | 15 | 16 | 15 | 16 | MLE | |
p01908 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
const int width = 20;
bool dfs(const int len, unordered_set<string> &S, string pas) {
if ((int)pas.size() >= len) {
if (S.count(pas) == 0) {
cout << pas << endl;
return tru... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
const int width = 7;
bool dfs(const int len, unordered_set<string> &S, string pas) {
if ((int)pas.size() >= len) {
if (S.count(pas) == 0) {
cout << pas << endl;
return true... | replace | 7 | 8 | 7 | 8 | MLE | |
p01908 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
string _s;
int _n;
int sa_k;
vector<int> Rank, tmp, sa, lcp;
bool cmp_sa(int i, int j) {
if (Rank[i] != Rank[j])
return Rank[i] < Rank[j];
return (i + sa_k <= _n ? Rank[i + sa_k] : -1) <
(j + sa_k <= _n ? Ra... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
string _s;
int _n;
int sa_k;
vector<int> Rank, tmp, sa, lcp;
bool cmp_sa(int i, int j) {
if (Rank[i] != Rank[j])
return Rank[i] < Rank[j];
return (i + sa_k <= _n ? Rank[i + sa_k] : -1) <
(j + sa_k <= _n ? Ra... | replace | 57 | 58 | 57 | 58 | TLE | |
p01909 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | insert | 31 | 31 | 31 | 33 | 0 | |
p01910 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb emplace_back
#define INF (1LL << 60)
// verified AOJ GRL_1
#define MAX_V 100020
template <typename T> struct... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb emplace_back
#define INF (1LL << 60)
// verified AOJ GRL_1
#define MAX_V 100020
template <typename T> struct... | replace | 56 | 57 | 56 | 57 | 0 | |
p01911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | replace | 15 | 16 | 15 | 16 | 0 | |
p01911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | replace | 31 | 35 | 31 | 35 | 0 | |
p01912 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define mp(a, b) make_pair((a), (b))
#define pb(a) push_back((a))
#define all(x) (x).begin(), (x).end()
#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define fi... | replace | 34 | 35 | 34 | 35 | 0 | |
p01912 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int h, w, n;
int G[25001][22];
bool used[2... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int h, w, n;
int G[250001][22];
bool used[... | replace | 16 | 18 | 16 | 18 | 0 | |
p01913 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector... | replace | 56 | 57 | 56 | 57 | MLE | |
p01914 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(... | insert | 90 | 90 | 90 | 91 | TLE | |
p01915 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
struct Primal_Dual {
typedef pair<int, int> Pi;
struct edge {
int to, cap, cost, rev;
};
vector<vector<edge>> graph;
vector<int> potential, min_cost, prevv, preve;
Primal_Dual(int V) : graph(V) {}
void add_edge(int from, int ... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
struct Primal_Dual {
typedef pair<int, int> Pi;
struct edge {
int to, cap, cost, rev;
};
vector<vector<edge>> graph;
vector<int> potential, min_cost, prevv, preve;
Primal_Dual(int V) : graph(V) {}
void add_edge(int from, int ... | replace | 71 | 73 | 71 | 72 | 0 | |
p01917 | C++ | Runtime Error | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
int n, score[101], a[101][3];
bool ch() {
int t[10] = {}, x[10];
r(i, 3) {
int cnt = 0, pre, c2 = 0;
memset(x, 0, sizeof(x));
vector<P> v;
r(j, n... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;
int n, score[101], a[101][3];
bool ch() {
int t[101] = {}, x[101];
r(i, 3) {
int cnt = 0, pre, c2 = 0;
memset(x, 0, sizeof(x));
vector<P> v;
r(j,... | replace | 10 | 11 | 10 | 11 | 0 | |
p01919 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c... | insert | 97 | 97 | 97 | 99 | TLE | |
p01919 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | replace | 79 | 80 | 79 | 80 | 0 | |
p01919 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <queue>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define MAX 1e9
int INF = MAX * MAX;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
// vector<vector<long long> >d(501,vector<long long>(51,INF));
int... | #include <iostream>
#include <map>
#include <queue>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define MAX 1e9
int INF = MAX * MAX;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
// vector<vector<long long> >d(501,vector<long long>(51,INF));
int... | replace | 43 | 44 | 43 | 44 | 0 | |
p01919 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define MAX 1e9
int INF = MAX * MAX;
typedef pair<int, int> pii;
typedef pair<pii, long long> piii;
vector<vector<long long>> d(501, vector<long long>(51, INF));
signed main() {
int n, m;
cin >> n >> m... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
#define MAX 1e9
int INF = MAX * MAX;
typedef pair<int, int> pii;
typedef pair<pii, long long> piii;
vector<vector<long long>> d(501, vector<long long>(51, INF));
signed main() {
int n, m;
cin >> n >> m... | replace | 55 | 56 | 55 | 56 | 0 | |
p01920 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, buckets, y) for (int i = (buckets); i < (y); ++i)
#define debug(buckets) #buckets << "=" << (buckets)
#ifdef DEBUG
#define _GLIBCbucketsbuckets_DEBUG
#define print(buckets) \
std::cerr << debug(bucke... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, buckets, y) for (int i = (buckets); i < (y); ++i)
#define debug(buckets) #buckets << "=" << (buckets)
#ifdef DEBUG
#define _GLIBCbucketsbuckets_DEBUG
#define print(buckets) \
std::cerr << debug(bucke... | replace | 30 | 31 | 30 | 31 | TLE | |
p01925 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
int testcase_ends() {
size_t N, M;
scanf("%zu %zu", &N, &M);
if (N == 0 && M == 0)
return 1;
std::vector<int> min(N), max(N);
for (size_t i = 0; i < M; ++i) {
int S;
size_t k;
scanf("%d %zu", &S, &k);
std::vector<size_t> c(k);
... | #include <algorithm>
#include <cstdio>
#include <vector>
int testcase_ends() {
size_t N, M;
scanf("%zu %zu", &N, &M);
if (N == 0 && M == 0)
return 1;
std::vector<int> min(N), max(N);
for (size_t i = 0; i < M; ++i) {
int S;
size_t k;
scanf("%d %zu", &S, &k);
std::vector<size_t> c(k);
... | replace | 31 | 32 | 31 | 32 | 0 | |
p01927 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | replace | 54 | 56 | 54 | 57 | TLE | |
p01928 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define llint long long
#define inf 1e18
using namespace std;
struct Edge {
llint to, cost;
Edge() {}
Edge(llint a, llint b) { to = a, cost = b; }
};
llint N;
llint L[105][3];
vector<Edge> g[105];
llint volume(llint x) {
llint ret = 1;
for (llint ... | #include <algorithm>
#include <iostream>
#include <vector>
#define llint long long
#define inf 1e18
using namespace std;
struct Edge {
llint to, cost;
Edge() {}
Edge(llint a, llint b) { to = a, cost = b; }
};
llint N;
llint L[105][3];
vector<Edge> g[105];
llint volume(llint x) {
llint ret = 1;
for (llint ... | replace | 101 | 102 | 101 | 102 | -11 | |
p01933 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
#define INF (1 << 30)
using namespace std;
int N, K, A;
vector<int> R, E[100000];
bool ans[100000];
int dfs(int v) {
int depth = INF;
for (int u : E[v])
depth = min(depth, dfs(u));
if (depth == INF)
depth = 0;
if (... | #include <bits/stdc++.h>
#define REP(i, a, n) for (int i = ((int)a); i < ((int)n); i++)
#define INF (1 << 30)
using namespace std;
int N, K, A;
vector<int> R, E[100000];
bool ans[100000];
int dfs(int v) {
int depth = INF;
REP(i, 0, E[v].size()) depth = min(depth, dfs(E[v][i]));
if (depth == INF)
depth = 0;
... | replace | 11 | 13 | 11 | 12 | 0 | |
p01933 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (n); i++)
vector<int> g[100005]; // 0-indexed
int root[100005];
const int inf = 1e8;
vector<int> d(100005, inf);
int N, K;
void f(int i, int p = -1) {
int ret = inf;
for (int j : g[i])
if (j != p) {
f(j,... | #include <iostream>
#include <vector>
using namespace std;
#define repeat(i, n) for (int i = 0; i < (n); i++)
vector<int> g[100005]; // 0-indexed
int root[100005];
const int inf = 1e8;
vector<int> d(100005, inf);
int N, K;
void f(int i, int p = -1) {
int ret = inf;
for (int j : g[i])
if (j != p) {
f(j,... | replace | 35 | 36 | 35 | 36 | TLE | |
p01934 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fi first
#define se second
#defi... | replace | 34 | 38 | 34 | 38 | 0 | |
p01935 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
//
// using Graph = vector<vector<int>>;
//
// int dfs(const Graph&g, const int now, vector<int>&ch_cnts) {
// ch_cnts[now]++;
// for (auto&& e : g[no... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
const ld eps = 1e-9;
//
// using Graph = vector<vector<int>>;
//
// int dfs(const Graph&g, const int now, vector<int>&ch_cnts) {
// ch_cnts[now]++;
// for (auto&& e : g[no... | replace | 138 | 155 | 138 | 139 | TLE | |
p01935 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | replace | 32 | 33 | 32 | 33 | 0 | |
p01939 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define ll long long
stati... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; (i) < (n); (i)++)
#define ll long long
stati... | replace | 26 | 27 | 26 | 30 | 0 | |
p01939 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll mod = 1000000007;
ll n;
ll m;
cin >> n >> m;
// ll ks=m/(n-1)
if (n == 1) {
assert(0);
cout << m + 1 << endl;
return 0;
}
ll sy = m + 1;
ll ma = sy % (n - 1);
ll ks = sy / (n - 1);
// if(ma)ks++;
ks... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll mod = 1000000007;
ll n;
ll m;
cin >> n >> m;
// ll ks=m/(n-1)
if (n == 1) {
cout << (m + 1) % mod << endl;
return 0;
}
ll sy = m + 1;
ll ma = sy % (n - 1);
ll ks = sy / (n - 1);
// if(ma)ks++;
ks++;
c... | replace | 10 | 12 | 10 | 11 | 0 | |
p01940 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(void) {
string S;
string P;
cin >> S;
cin >> P;
int search = 0;
int count = 0;
bool finish = false;
int preserch = 0;
bool many_same_char = false;
vector<tuple<int, int>> st;
for (int ptr = 0... | #include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(void) {
string S;
string P;
cin >> S;
cin >> P;
int search = 0;
int count = 0;
bool finish = false;
int preserch = 0;
bool many_same_char = false;
vector<tuple<int, int>> st;
for (int ptr = 0... | replace | 56 | 64 | 56 | 57 | TLE | |
p01942 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include "bits/stdc++.h"
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | replace | 82 | 84 | 82 | 84 | 0 | |
p01942 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
template <typename T> class BinaryIndexedTree2D {
vector<vector<ll>> vec;
const ll m, n;
public:
BinaryIndexedTree2D(ll _m, ll _n)
: vec(_m + 1, vector<T>(_n + 1)), m(_m), n(_n) ... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
template <typename T> class BinaryIndexedTree2D {
vector<vector<ll>> vec;
const ll m, n;
public:
BinaryIndexedTree2D(ll _m, ll _n)
: vec(_m + 1, vector<T>(_n + 1)), m(_m), n(_n) ... | replace | 22 | 24 | 22 | 24 | 0 | |
p01944 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | replace | 47 | 53 | 47 | 58 | TLE | |
p01956 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 57 | 59 | 57 | 59 | -6 | munmap_chunk(): invalid pointer
|
p01961 | C++ | Runtime Error | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
vector<int> solve(int H, int W, int y, int x) {
vector<int> anss;
bool h_swap = false;
bool hw_swap = false;
bool w_swap = false;
bool rot = false;
if (y % 2 == 0) {
y = H - 1 - y;
h_swap = true;... | #include "bits/stdc++.h"
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
vector<int> solve(int H, int W, int y, int x) {
vector<int> anss;
bool h_swap = false;
bool hw_swap = false;
bool w_swap = false;
bool rot = false;
if (y % 2 == 0) {
y = H - 1 - y;
h_swap = true;... | replace | 25 | 26 | 25 | 26 | 0 | |
p01967 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | replace | 19 | 20 | 19 | 20 | 0 | |
p01970 | C++ | Runtime Error | // {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | // {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | replace | 34 | 35 | 34 | 35 | -11 | |
p01970 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
bool prime[1000009];
void era() {
prime[0] = 1;
prime[1] = 1;
for (int i = 2; i < 1000009; i++) {
if (!prime[i]) {
for (int j = i + i; j < 1000009; j += i)
prime[j] = 1;
}
}
}
int dp[100009][2];
signed main() {
era()... | #include <bits/stdc++.h>
#define int long long
using namespace std;
bool prime[1000009];
void era() {
prime[0] = 1;
prime[1] = 1;
for (int i = 2; i < 1000009; i++) {
if (!prime[i]) {
for (int j = i + i; j < 1000009; j += i)
prime[j] = 1;
}
}
}
int dp[100009][2];
signed main() {
era()... | replace | 25 | 26 | 25 | 26 | -11 | |
p01973 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
// #define int long long
#define inf 1000000007
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
// #define int long long
#define inf 1000000007
#define ... | replace | 386 | 388 | 386 | 390 | 0 | |
p01973 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
using ull = unsigned long long;
const ull b = 1000000007;
ull f(string s) {
ull h = 0;
rep(i, s.size()) h = b * h + s[i];
return h;
}
int main() {
std::ios::sync... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
using ull = unsigned long long;
const ull b = 1000000007;
ull f(string s) {
ull h = 0;
rep(i, s.size()) h = b * h + s[i];
return h;
}
int main() {
std::ios::sync... | insert | 37 | 37 | 37 | 39 | TLE | |
p01973 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | replace | 51 | 52 | 51 | 54 | TLE | |
p01975 | C++ | Runtime Error | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld = long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep... | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld = long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep... | delete | 54 | 55 | 54 | 54 | 0 | |
p01978 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T> constexpr T inf;
template <> constexpr int inf<int> = 1e9;
template <> constexpr ll inf<ll> = 1e18;
template <> constexpr double inf<double> = 1e18;
template <typename T> std::vector<T> table(int n, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T> constexpr T inf;
template <> constexpr int inf<int> = 1e9;
template <> constexpr ll inf<ll> = 1e18;
template <> constexpr double inf<double> = 1e18;
template <typename T> std::vector<T> table(int n, ... | insert | 84 | 84 | 84 | 85 | TLE | |
p01980 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
/* include file*/
#include <fu... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
typedef pair<i64, i64> P;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
/* include file*/
#include <fu... | replace | 161 | 162 | 161 | 162 | 0 | |
p01980 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#includ... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#includ... | replace | 96 | 97 | 96 | 98 | TLE | |
p01980 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | replace | 106 | 107 | 106 | 107 | 0 | 0 3
1 3
2 3
3 3
|
p01981 | Python | Runtime Error | while True:
a = list(map(str, input().split()))
if a[0] == "0":
break
elif int(a[1]) <= 30:
print(" ".join(a))
elif int(a[1]) == 31 and int(a[2]) <= 4:
print(" ".join(a))
else:
a[0] = "?"
s = int(a[1])
s -= 30
a[1] = str(s)
print(" ".jo... | while True:
a = list(map(str, input().split()))
if a[0] == "#":
break
elif int(a[1]) <= 30:
print(" ".join(a))
elif int(a[1]) == 31 and int(a[2]) <= 4:
print(" ".join(a))
else:
a[0] = "?"
s = int(a[1])
s -= 30
a[1] = str(s)
print(" ".jo... | replace | 2 | 3 | 2 | 3 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p01981/Python/s158524109.py", line 5, in <module>
elif int(a[1]) <= 30:
IndexError: list index out of range
|
p01984 | C++ | Time Limit Exceeded | // 数学をしたほうが実装は楽だと思うけど、さきほどやってみたらバグ死したので、桁DP
// + 2分探索します。
#include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
// a[i] … 10進数における下位i(>=0)桁目.
vector<int> add(vector<int> a, vector<int> b, int n) {
for (int i = 0; i < n; i++) {
a[i] += b[i];
if (i + 1 < n) {
... | // 数学をしたほうが実装は楽だと思うけど、さきほどやってみたらバグ死したので、桁DP
// + 2分探索します。
#include <algorithm>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
// a[i] … 10進数における下位i(>=0)桁目.
vector<int> add(vector<int> a, vector<int> b, int n) {
for (int i = 0; i < n; i++) {
a[i] += b[i];
if (i + 1 < n) {
... | insert | 62 | 62 | 62 | 64 | TLE | |
p01985 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int SIZE = 100010;
vector<int> way[SIZE];
bool visited[SIZE];
int id[SIZE];
int counter[2];
bool dfs(int now, int f) {
if (visited[now]) {
return id[now] == f;
}
visited[now] = true;
id[now] = f;
counter[f]++;
for (int i = 0; i < (int)way[now].si... | #include <bits/stdc++.h>
using namespace std;
const int SIZE = 100010;
vector<int> way[SIZE];
bool visited[SIZE];
int id[SIZE];
int counter[2];
bool dfs(int now, int f) {
if (visited[now]) {
return id[now] == f;
}
visited[now] = true;
id[now] = f;
counter[f]++;
for (int i = 0; i < (int)way[now].si... | replace | 53 | 54 | 53 | 54 | 0 | 4 2
1 1
2 2
3 2
|
p01985 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0)
break;
vector<int> road[1000];
lp(i, n) { road[i].clear(); }
lp(i, m) {
int a, b;
cin >> a >> b;
a--;
... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
int main() {
while (1) {
int n, m;
cin >> n >> m;
if (n == 0 && m == 0)
break;
vector<int> road[1000];
lp(i, n) { road[i].clear(); }
lp(i, m) {
int a, b;
cin >> a >> b;
a--;
... | delete | 26 | 29 | 26 | 26 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02022 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >... | replace | 34 | 38 | 34 | 36 | TLE | |
p02022 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
using namespace std;
int a[1919], b[1919];
signed main() {
int n, m, cnt = 0, cnta = 0;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int j = 0; j < m; j++)
c... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define int long long
using namespace std;
int a[191919], b[191919];
signed main() {
int n, m, cnt = 0, cnta = 0;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int j = 0; j < m; j++)
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02022 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[1010];
long long ans = 0;
long long tmp = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long b;
for (int i = 0; i < m; i++) {
cin >> b;
tmp += b;
}
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long a[100010];
long long ans = 0;
long long tmp = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long b;
for (int i = 0; i < m; i++) {
cin >> b;
tmp += b;
}
for (int i = 0; i < n; i++) {... | replace | 7 | 8 | 7 | 8 | 0 | |
p02026 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int a[200000], b[200000];
ll d[200000];
vector<P> E[200000];
int main() {
int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3f
#define EPS (1e-10)
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int a[200000], b[200000];
ll d[200000];
vector<P> E[200000];
int main() {
int... | replace | 29 | 30 | 29 | 30 | TLE | |
p02026 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define sp ' '
#define nyan "(=^・ω・^=)"
#define mkp make_pair
#define intmax 2147483647
#define llmax 9223372036854775807
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
const int mod = 1e9 + 7;
ll N, A[100000], B[100000], MIN[100000], aa[100000], b... | #include <bits/stdc++.h>
#define sp ' '
#define nyan "(=^・ω・^=)"
#define mkp make_pair
#define intmax 2147483647
#define llmax 9223372036854775807
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
const int mod = 1e9 + 7;
ll N, A[100000], B[100000], MIN[100000], aa[100000], b... | replace | 64 | 65 | 64 | 66 | TLE | |
p02028 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | replace | 91 | 92 | 91 | 92 | 0 | |
p02030 | C++ | Memory Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
int a[n];
int b[m];
vector<int> dup, all;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int j = 0; j < m; j++) {
scanf("%d", &b[j]);
}
int ap = 0;
... | #include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
int a[n];
int b[m];
vector<int> dup, all;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int j = 0; j < m; j++) {
scanf("%d", &b[j]);
}
int ap = 0;
... | replace | 36 | 37 | 36 | 37 | MLE | |
p02100 | C++ | Runtime Error | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
// #include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// #include <array>
// #include <tuple>
#include <complex>
#include <unordered_map>
#include <un... | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
// #include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// #include <array>
// #include <tuple>
#include <complex>
#include <unordered_map>
#include <un... | delete | 245 | 246 | 245 | 245 | 0 | (2, 1) (1, 3) (0, 2)
|
p02100 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
string st;
int a;
int getnum() {
int num = 0;
while (a != st.size() && isdigit(st[a])) {
num *= 10;
num += st[a] - '0';
a++;
}
return num;
}
vector<int> kou() {
vector<int> v(10);
if (st[a] == 'x') {
a++;
assert(st[a] == '^');
a++;
i... | #include "bits/stdc++.h"
using namespace std;
string st;
int a;
int getnum() {
int num = 0;
while (a != st.size() && isdigit(st[a])) {
num *= 10;
num += st[a] - '0';
a++;
}
return num;
}
vector<int> kou() {
vector<int> v(10);
if (st[a] == 'x') {
a++;
if (a == st.size() || st[a] != '^') ... | replace | 18 | 22 | 18 | 27 | 0 | |
p02100 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define ALL(x) (x).begin(), (x).end()
using namespace std;
ll f(vector<ll> &a, ll x) {
return a[0] + a[1] * x + a[2] * x * x + a[3] * x * x * x +
a[4] * x * x * x * x + a[5] * x * x * x * x * x;
}
signed main() {
string str;
cin >> s... | #include <bits/stdc++.h>
#define ll long long
#define int long long
#define ALL(x) (x).begin(), (x).end()
using namespace std;
ll f(vector<ll> &a, ll x) {
return a[0] + a[1] * x + a[2] * x * x + a[3] * x * x * x +
a[4] * x * x * x * x + a[5] * x * x * x * x * x;
}
signed main() {
string str;
cin >> s... | replace | 40 | 42 | 40 | 46 | 0 | |
p02101 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n >> p;
vector<int> X(n);
vector<int> Y(n);
for (int i = 0; i < n; i++) {
cin >> X[i] >> Y[i];
}
// Need[i][j] := i日目から連続して励まされていて、j日目に必要な励まし力
vector<vector<int>> Need(n, vector<int>(n, -1));
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n >> p;
vector<int> X(n);
vector<int> Y(n);
for (int i = 0; i < n; i++) {
cin >> X[i] >> Y[i];
}
// Need[i][j] := i日目から連続して励まされていて、j日目に必要な励まし力
vector<vector<int>> Need(n, vector<int>(n, -1));
for (int i = 0; i < n; i++... | replace | 28 | 29 | 28 | 29 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.