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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p01368 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define MAX_V 1001
#define INF 1000000000
void add_edge(int, int);
bool dfs(int);
int bipartite_matching(int);
void warshall_floyd(int);
using namespace std;
vector<int> G[MAX_V];
bool used[MAX_V];
int match[MAX_V], d[MAX_V][MAX_V];
int ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#define MAX_V 10000
#define INF 1000000000
void add_edge(int, int);
bool dfs(int);
int bipartite_matching(int);
void warshall_floyd(int);
using namespace std;
vector<int> G[MAX_V];
bool used[MAX_V];
int match[MAX_V], d[MAX_V][MAX_V];
int... | replace | 5 | 6 | 5 | 6 | 0 | |
p01368 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
// #define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
// #define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof... | replace | 30 | 31 | 30 | 31 | 0 | |
p01388 | C++ | Runtime Error | #include <iostream>
#define MAX 110
using namespace std;
int rmn_min(int x, int y) { return (x < y ? x : y); }
int main() {
int k = 0;
int u = 0;
int p = 0;
int c = 0;
char line[MAX];
cin >> line;
for (int i = 0; line[i] != 0; i++) {
switch (line[i]) {
case 'K':
k++;
break;
case... | #include <iostream>
#define MAX 301
using namespace std;
int rmn_min(int x, int y) { return (x < y ? x : y); }
int main() {
int k = 0;
int u = 0;
int p = 0;
int c = 0;
char line[MAX];
cin >> line;
for (int i = 0; line[i] != 0; i++) {
switch (line[i]) {
case 'K':
k++;
break;
case... | replace | 1 | 2 | 1 | 2 | 0 | |
p01388 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
char KUPC[50];
int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0, ans;
cin >> KUPC;
for (int i = 0; i < strlen(KUPC); i++) {
if (KUPC[i] == 'K')
cnt1++;
else if (KUPC[i] == 'U')
cnt2++;
else if (KUP... | #include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
char KUPC[301];
int cnt1 = 0, cnt2 = 0, cnt3 = 0, cnt4 = 0, ans;
cin >> KUPC;
for (int i = 0; i < strlen(KUPC); i++) {
if (KUPC[i] == 'K')
cnt1++;
else if (KUPC[i] == 'U')
cnt2++;
else if (KU... | replace | 6 | 7 | 6 | 7 | 0 | |
p01389 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n, m;
int main() {
string s[20];
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> s[i];
int field[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
field[i][j] = stoi(s[i].subs... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
using namespace std;
int n, m;
int main() {
string s[60];
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> s[i];
int field[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
field[i][j] = stoi(s[i].subs... | replace | 10 | 11 | 10 | 11 | 0 | |
p01389 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int cnt[50][50], dp[60][60];
int main() {
int h, w;
scanf("%d%d", &h, &w);
rep(i, h) rep(j, w) scanf("%1d", &cnt[i][j]);
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = cnt[0][0];
rep(i, h) rep(j, w) {
dp[i + 1][j] = m... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int cnt[60][60], dp[60][60];
int main() {
int h, w;
scanf("%d%d", &h, &w);
rep(i, h) rep(j, w) scanf("%1d", &cnt[i][j]);
memset(dp, 0x3f, sizeof(dp));
dp[0][0] = cnt[0][0];
rep(i, h) rep(j, w) {
dp[i + 1][j] = m... | replace | 4 | 5 | 4 | 5 | 0 | |
p01391 | C++ | Time Limit Exceeded | #include <ctime>
#include <iostream>
#pragma warning(disable : 4996)
using namespace std;
int N, K, card[500][500], r[1000];
int main() {
srand((unsigned)time(NULL));
scanf("%d%d", &N, &K);
for (int i = 0; i < K; i++) {
for (int j = 0; j < N / 2; j++) {
scanf("%d", &card[i][j]);
}
}
while (true)... | #include <ctime>
#include <iostream>
#pragma warning(disable : 4996)
using namespace std;
int N, K, card[500][500], r[1000];
int main() {
srand((unsigned)time(NULL));
scanf("%d%d", &N, &K);
for (int i = 0; i < K; i++) {
for (int j = 0; j < N / 2; j++) {
scanf("%d", &card[i][j]);
}
}
while (true)... | insert | 33 | 33 | 33 | 34 | TLE | |
p01392 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
bool isprime[1000001];
int fact[1000001];
bool isfox[1000001];
int primes[78498];
int factorial(ll arg, int base) {
int ret = 0;
while (arg % base == 0) {
arg /= base;
ret++;
}
return ret;
}
int main() {
std::ios_b... | #include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
bool isprime[1000001];
int fact[1000001];
bool isfox[1000001];
int primes[78498];
int factorial(ll arg, int base) {
int ret = 0;
while (arg % base == 0) {
arg /= base;
ret++;
}
return ret;
}
int main() {
std::ios_b... | replace | 44 | 45 | 44 | 45 | 0 | |
p01392 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 76 | 77 | 76 | 78 | 0 | |
p01392 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define f first
#define s second
#define mp make_pair
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long s = a - b;
long long e = a + b;
const int MAX = 15000... | #include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define f first
#define s second
#define mp make_pair
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long s = a - b;
long long e = a + b;
const int MAX = 15000... | insert | 37 | 37 | 37 | 42 | TLE | |
p01392 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
#define MAX_N 1000007
long long A, B, W[MAX_N], cnt;
bool prime[MAX_N];
vector<short> V[MAX_N];
void primesieve() {
for (int i = 2; i * i <= 1000000; i++) {
for (int j = i * i; j <= 1000000; j += i)
prime[j] = true;
}
for (int i = 0; i <= 100000... | #include <iostream>
#include <vector>
using namespace std;
#define MAX_N 1000007
long long A, B, W[MAX_N], cnt;
bool prime[MAX_N];
vector<short> V[MAX_N];
void primesieve() {
for (int i = 2; i * i <= 1000000; i++) {
for (int j = i * i; j <= 1000000; j += i)
prime[j] = true;
}
for (int i = 0; i <= 100000... | replace | 19 | 20 | 19 | 20 | TLE | |
p01398 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int k(int a) {
for (int i = 0;; i++) {
if (a - 26 * i >= 'a' && a - 26 * i <= 'z')
return a - 26 * i;
}
}
int main() {
int a;
while (cin >> a, a) {
string b;
cin >> b;
int x[100], y[100];
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int k(int a) {
for (int i = 0;; i++) {
if (a - 26 * i >= 'a' && a - 26 * i <= 'z')
return a - 26 * i;
}
}
int main() {
int a;
while (cin >> a, a) {
string b;
cin >> b;
int x[100], y[100];
... | replace | 26 | 28 | 26 | 28 | TLE | |
p01399 | C++ | Runtime Error | // 50
#include <algorithm>
#include <iostream>
using namespace std;
struct S {
int d, t, n;
bool operator<(S a) const {
if (t != a.t) {
return t < a.t;
} else {
return d < a.d;
}
}
};
int main() {
for (int n, m; cin >> n >> m, n | m;) {
S p[40];
for (int i = 0; i < n; i++) {
... | // 50
#include <algorithm>
#include <iostream>
using namespace std;
struct S {
int d, t, n;
bool operator<(S a) const {
if (t != a.t) {
return t < a.t;
} else {
return d < a.d;
}
}
};
int main() {
for (int n, m; cin >> n >> m, n | m;) {
S p[1000];
for (int i = 0; i < n; i++) {... | replace | 19 | 20 | 19 | 20 | 0 | |
p01400 | C++ | Time Limit Exceeded | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
map<string, int> mp;
struct edge {
int to, cost;
};
vector<edge> dis[600];
int d[600];
int main() {
int n, m;
for (;;) {
cin >> n >> m;
if (n == 0 && m == 0)
... | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
map<string, int> mp;
struct edge {
int to, cost;
};
vector<edge> dis[600];
int d[600];
int main() {
int n, m;
for (;;) {
cin >> n >> m;
if (n == 0 && m == 0)
... | replace | 53 | 54 | 53 | 56 | TLE | |
p01401 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define fr first
#define sc second
typedef pair<int, int> P;
P s, g;
typedef pair<P, P> Q;
int h, w, sx, sy, gx, gy, c, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0},
... | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define fr first
#define sc second
typedef pair<int, int> P;
P s, g;
typedef pair<P, P> Q;
int h, w, sx, sy, gx, gy, c, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0},
... | replace | 15 | 16 | 15 | 16 | 0 | |
p01401 | C++ | Runtime Error | #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 | 33 | 34 | 33 | 34 | 0 | |
p01401 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define p pair<int, int>
#define P pair<p, int>
using namespace std;
int parse(string a) {
int b = 0;
for (char c : a)
b = b * 10 + c - 48;
return b;
}
int main() {
int a, b;
while (cin >> b >> a, a | b) {
p G;
vector<P>... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define p pair<int, int>
#define P pair<p, int>
using namespace std;
int parse(string a) {
int b = 0;
for (char c : a)
b = b * 10 + c - 48;
return b;
}
int main() {
int a, b;
while (cin >> b >> a, a | b) {
p G;
vector<P>... | replace | 18 | 19 | 18 | 19 | 0 | |
p01401 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... | replace | 71 | 72 | 71 | 72 | 0 | |
p01401 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (int)s; i < (int)e; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define mp nake_pair
typedef long long ll;
typ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (int)s; i < (int)e; i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define pb push_back
#define mp nake_pair
typedef long long ll;
typ... | replace | 36 | 37 | 36 | 37 | -11 | |
p01403 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | replace | 24 | 27 | 24 | 27 | MLE | |
p01403 | C++ | Time 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)
#define IINF (INT_MAX)
#define MAX_N 1000100
using namespace std;
typedef unsigned long long ll;
ll euler_phi(ll n) {
ll res = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = res / i *... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define MAX_N 1000100
using namespace std;
typedef unsigned long long ll;
ll euler_phi(ll n) {
ll res = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = res / i *... | replace | 44 | 49 | 44 | 49 | TLE | |
p01407 | C++ | Memory Limit Exceeded | #define NDEBUG
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
template <class T> struct PrimalDual {
struct Edge {
int to, rev;
T cap, cost;
};
const int n;
const T inf = numeric_limits<T>:... | #define NDEBUG
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = V<V<T>>;
template <class T> struct PrimalDual {
struct Edge {
int to, rev;
T cap, cost;
};
const int n;
const T inf = numeric_limits<T>:... | replace | 80 | 81 | 80 | 81 | MLE | |
p01407 | 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)... | delete | 58 | 59 | 58 | 58 | 0 | 2
1
|
p01407 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp make_pair
#define INF (1LL << 60)
typedef long long Int;
struct node {
int x, t, p;
};
bool opera... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp make_pair
#define INF (1LL << 60)
typedef long long Int;
struct node {
int x, t, p;
};
bool opera... | replace | 30 | 32 | 30 | 32 | 0 | |
p01407 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
typedef int Weight;
struct Edge {
int dest;
int cap, rev;
Weight weight;
bool operator<(const Edge &rhs) const { return weight > rhs.weight; }
};
const int V = 6010;
typedef vector<E... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
typedef int Weight;
struct Edge {
int dest;
int cap, rev;
Weight weight;
bool operator<(const Edge &rhs) const { return weight > rhs.weight; }
};
const int V = 6010;
typedef vector<E... | replace | 38 | 39 | 38 | 39 | TLE | |
p01407 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | replace | 291 | 292 | 291 | 302 | TLE | |
p01410 | C++ | Runtime Error | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp make_pair
#define INF (1LL << 60)
struct MinCostFlow {
static const int N = 1024 * 4, M = 1024 * 8;
typedef long long cost_t;
int E,... | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp make_pair
#define INF (1LL << 60)
struct MinCostFlow {
static const int N = 1024 * 4, M = 1024 * 16;
typedef long long cost_t;
int E... | replace | 12 | 13 | 12 | 13 | 0 | |
p01410 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) reep((i), 0, (n))
template <class T> class MinCostFlow {
public:
class edge {
public:
int to;
int capacity;
T cost;
int reve;
edge(int _to, int _capacity, int _reve, T _cost) ... | #include <bits/stdc++.h>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) reep((i), 0, (n))
template <class T> class MinCostFlow {
public:
class edge {
public:
int to;
int capacity;
T cost;
int reve;
edge(int _to, int _capacity, int _reve, T _cost) ... | replace | 22 | 23 | 22 | 23 | 0 | |
p01410 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define range(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const int vmax = 1001;
const int inf = 1 << 29;
struct edge {
int to, cap, cost, rev;
};
vector<edge> graph[vmax];
int h[vmax], dist[vm... | #include <bits/stdc++.h>
#define int long long
#define range(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const int vmax = 10001;
const int inf = 1 << 29;
struct edge {
int to, cap, cost, rev;
};
vector<edge> graph[vmax];
int h[vmax], dist[v... | replace | 6 | 7 | 6 | 7 | 0 | |
p01410 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | replace | 88 | 89 | 88 | 89 | 0 | |
p01410 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define LLINF (LLONG_MAX)
#define MAX_V 3000
using namespace std;
typedef long long ll;
typedef pair<ll... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define IINF (INT_MAX)
#define LLINF (LLONG_MAX)
#define MAX_V 10000
using namespace std;
typedef long long ll;
typedef pair<l... | replace | 11 | 12 | 11 | 12 | 0 | |
p01410 | C++ | Runtime Error | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
namespace MCF {
// required <string.h> <vector> <queue> <algorithm>
#define MAXN 2100
#define MAXM 21000
#define wint int
#define cint long long
const wint wEPS = 0;
const wint wINF = 1001001001;
const ci... | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
namespace MCF {
// required <string.h> <vector> <queue> <algorithm>
#define MAXN 3100
#define MAXM 21000
#define wint int
#define cint long long
const wint wEPS = 0;
const wint wINF = 1001001001;
const ci... | replace | 8 | 9 | 8 | 9 | 0 | |
p01411 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int H, N, P, M, K;
vector<int> stick... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
typedef long double ld;
#define rep(i, s, e) for (int i = (s); i <= (e); i++)
int H, N, P, M, K;
vector<int> stick... | replace | 44 | 45 | 44 | 45 | 0 | |
p01411 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
// bou height rest
ld dp[100][501][101];
int main() {
for (int i = 0; i < 100; ++i) {
for (int j = 0; j < 501; ++j) {
for (int k... | #include "bits/stdc++.h"
#include <unordered_map>
#pragma warning(disable : 4996)
using namespace std;
using ld = double;
template <class T> using Table = vector<vector<T>>;
// bou height rest
ld dp[100][501][101];
int main() {
for (int i = 0; i < 100; ++i) {
for (int j = 0; j < 501; ++j) {
for (int k = 0;... | replace | 4 | 5 | 4 | 5 | MLE | |
p01411 | 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 | 21 | 22 | 21 | 22 | 0 | |
p01412 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> last;
while (A.size() && A[0] == 0)
last.push_back(0), A.erase(A.begin());
if (A.size() && last.size() % 2)
last.ins... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> last;
while (A.size() && A[0] == 0)
last.push_back(0), A.erase(A.begin());
if (A.size() && last.size() % 2)
last.ins... | replace | 16 | 17 | 16 | 17 | 0 | |
p01412 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int a[101];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
reverse(a, a + n);
int all = n;
for (int i = n - 1; i >= 0; i--) {
if (a[i] == 0... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int a[101];
int main(void) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
reverse(a, a + n);
int all = n;
for (int i = n - 1; i >= 0; i--) {
if (a[i] == 0... | replace | 41 | 42 | 41 | 43 | 0 | |
p01412 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, k, n) for (int i = (k); i < (i... | replace | 98 | 102 | 98 | 106 | 0 | |
p01412 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iostream>
#include <array>
#include <cmath>
#include <map>
using namespace std;
// const int T=5;
// array<int,T> a;
// map<array<int,T>,array<int,T> > m;
// double pow(array<int,T> a){
// double d=a[T-1];
// for(int x=T-2;x>=0;x--){
// d=(a[x]==0&&d==0)?1:po... | #include <algorithm>
#include <deque>
#include <iostream>
#include <array>
#include <cmath>
#include <map>
using namespace std;
// const int T=5;
// array<int,T> a;
// map<array<int,T>,array<int,T> > m;
// double pow(array<int,T> a){
// double d=a[T-1];
// for(int x=T-2;x>=0;x--){
// d=(a[x]==0&&d==0)?1:po... | replace | 58 | 77 | 58 | 70 | 0 | |
p01412 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
namespace {
typedef double real;
typedef long long ll;
template <class T> ostream &operator<<(ostream &os, const vector<T> &vs) {
for (int i = 0; i < vs.size(); i++) {
os << vs[i] << endl;
}
return os;
}
template <class T> istream &operator>>(istream &is, vect... | #include <bits/stdc++.h>
using namespace std;
namespace {
typedef double real;
typedef long long ll;
template <class T> ostream &operator<<(ostream &os, const vector<T> &vs) {
for (int i = 0; i < vs.size(); i++) {
os << vs[i] << endl;
}
return os;
}
template <class T> istream &operator>>(istream &is, vect... | replace | 81 | 86 | 81 | 88 | 0 | |
p01413 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi... | replace | 23 | 24 | 23 | 24 | MLE | |
p01413 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | replace | 93 | 94 | 93 | 94 | 0 | |
p01414 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ cout << #a << " = " <<... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) \
{ cout << #a << " = " <<... | replace | 52 | 53 | 52 | 53 | -11 | |
p01414 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100000000;
const double EPS = 1e-10;
const int MOD = 1000000007;
using namespace std;
typedef pair<int, int> P;
int n;
int h[20], w[20];
int brd[7][7];
int dp[(1 << 16)];
int main() {
rep(i, (1 << 16)) dp[i] = INF;
dp[0] = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 100000000;
const double EPS = 1e-10;
const int MOD = 1000000007;
using namespace std;
typedef pair<int, int> P;
int n;
int h[20], w[20];
int brd[7][7];
int dp[(1 << 16)];
int main() {
rep(i, (1 << 16)) dp[i] = INF;
dp[0] = 0;
... | insert | 97 | 97 | 97 | 101 | TLE | |
p01414 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#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++)
int n;
vecto... | #include <algorithm>
#include <bitset>
#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++)
int n;
vecto... | replace | 49 | 50 | 49 | 50 | TLE | |
p01414 | C++ | Time Limit Exceeded | #include <algorithm>
#include <queue>
#include <stdio.h>
using namespace std;
int p[20];
int q[20];
char str[5][5];
int bfs[1 << 16];
char col[5] = "RGB";
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
scanf("%d%d", p + i, q + i);
}
for (int i = 0; i < 4; i++)
scanf("%s", str[i]);
... | #include <algorithm>
#include <queue>
#include <stdio.h>
using namespace std;
int p[20];
int q[20];
char str[5][5];
int bfs[1 << 16];
char col[5] = "RGB";
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
scanf("%d%d", p + i, q + i);
}
for (int i = 0; i < 4; i++)
scanf("%s", str[i]);
... | replace | 32 | 36 | 32 | 35 | TLE | |
p01414 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> v... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
#define D10 fixed << setprecision(10)
typedef long long ll;
typedef long double ld;
typedef vector<int> v... | replace | 64 | 68 | 64 | 65 | TLE | |
p01414 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dp[1 << 16], n;
vector<pair<int, int>> x;
int col[4][4];
queue<int> Q;
int main() {
for (int i = 0; i < (1 << 16); i++)
dp[i] = 999999999;
dp[0] = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
ci... | #include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int dp[1 << 16], n;
vector<pair<int, int>> x;
int col[4][4];
queue<int> Q;
int main() {
for (int i = 0; i < (1 << 16); i++)
dp[i] = 999999999;
dp[0] = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
ci... | replace | 46 | 47 | 46 | 47 | TLE | |
p01414 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define dump(n) cout << "# " << #n << '=' << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define peri(i, a, b) for (int i = int(b); i-- > int(a);)
#define rep(i, n) repi(i, 0, n)
#define per(i, n) peri(i, 0, n)
#define all(c) begin(c), end(c)
#d... | #include <bits/stdc++.h>
using namespace std;
#define dump(n) cout << "# " << #n << '=' << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define peri(i, a, b) for (int i = int(b); i-- > int(a);)
#define rep(i, n) repi(i, 0, n)
#define per(i, n) peri(i, 0, n)
#define all(c) begin(c), end(c)
#d... | replace | 76 | 77 | 76 | 77 | MLE | |
p01414 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
char Color[3] = {'R', 'G', 'B'};
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> h[i] >> w[i];
string C;
for (int i = 0; i < 4; i++) {
string tmp;
cin >> tmp;
C = C + tmp;
}
queue<pair... | #include <bits/stdc++.h>
using namespace std;
char Color[3] = {'R', 'G', 'B'};
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> w(n);
for (int i = 0; i < n; i++)
cin >> h[i] >> w[i];
string C;
for (int i = 0; i < 4; i++) {
string tmp;
cin >> tmp;
C = C + tmp;
}
queue<pair... | replace | 51 | 61 | 51 | 58 | TLE | |
p01415 | C++ | Runtime Error | #include <cstdio>
int main(void) {
int n, k, t, u, v, l;
char d[1000] = {};
scanf("%d%d%d%d%d%d", &n, &k, &t, &u, &v, &l);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
d[t] = 1;
}
double res = 0.0, rem = 0.0;
int carrot = 0;
for (int i = 0; i < l; i++) {
if (d[i])
carrot... | #include <cstdio>
int main(void) {
int n, k, t, u, v, l;
char d[100000] = {};
scanf("%d%d%d%d%d%d", &n, &k, &t, &u, &v, &l);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
d[t] = 1;
}
double res = 0.0, rem = 0.0;
int carrot = 0;
for (int i = 0; i < l; i++) {
if (d[i])
carr... | replace | 4 | 5 | 4 | 5 | 0 | |
p01415 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using nam... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using nam... | replace | 49 | 50 | 49 | 50 | 0 | |
p01415 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | #define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#inc... | replace | 43 | 44 | 43 | 44 | 0 | |
p01415 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
enum State { Carrot, End };
typedef struct Event {
int x;
State state;
bool operator<(const Event &right) const { return x > right.x; }
} Event;
int N, K, T, U, V, L;
vector<int> D;
int main() {
cout.precision(16);
cout.setf(ios::fixed);
cin >> N >> K >> T... | #include <bits/stdc++.h>
using namespace std;
enum State { Carrot, End };
typedef struct Event {
int x;
State state;
bool operator<(const Event &right) const { return x > right.x; }
} Event;
int N, K, T, U, V, L;
vector<int> D;
int main() {
cout.precision(16);
cout.setf(ios::fixed);
cin >> N >> K >> T... | replace | 49 | 50 | 49 | 50 | 0 | |
p01416 | C++ | Runtime Error | // #ifdef DEBUG
// #define _GLIBCXX_DEBUG
// #endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <uti... | // #ifdef DEBUG
// #define _GLIBCXX_DEBUG
// #endif
#include <algorithm>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <uti... | delete | 164 | 167 | 164 | 164 | 0 | ..........
..........
..........
..........
....CC....
|
p01416 | C++ | Runtime Error | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void gstr(char *str) {
int i;
for (i = 0; (str[i] = getchar()) != '\n'; i++)
;
str[i] = '\0';
}
int main(void) {
int i, j, k, l, m, n, h, w, dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0},
ans = 0, f[... | #include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void gstr(char *str) {
int i;
for (i = 0; (str[i] = getchar()) != '\n'; i++)
;
str[i] = '\0';
}
int main(void) {
int i, j, k, l, m, n, h, w, dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0},
ans = 0, f[... | replace | 14 | 15 | 14 | 15 | 0 | |
p01416 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using T = tuple<int, int, char>;
int main() {
int M, N;
cin >> M >> N;
vector<T> V;
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
char c;
cin >> c;
if (c != '.') {
V.empla... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using T = tuple<int, int, char>;
int main() {
int M, N;
cin >> M >> N;
vector<T> V;
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
char c;
cin >> c;
if (c != '.') {
V.empla... | insert | 18 | 18 | 18 | 22 | 0 | |
p01416 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) lp(i, 0, n)
#define rlp(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rrep(i, n) rlp(i, 0, n)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) lp(i, 0, n)
#define rlp(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define rrep(i, n) rlp(i, 0, n)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace... | replace | 48 | 49 | 48 | 49 | 0 | |
p01416 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define al... | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define al... | replace | 51 | 53 | 51 | 53 | TLE | |
p01417 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
template <typename T> inline T sqr(T x) { return x * x; }
template <typename T> inline void chmax(T &t, T f) {
if (t < f)
t = f;
}
int N, M;
int next_combination(... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
template <typename T> inline T sqr(T x) { return x * x; }
template <typename T> inline void chmax(T &t, T f) {
if (t < f)
t = f;
}
int N, M;
int next_combination(... | insert | 25 | 25 | 25 | 27 | 0 | |
p01417 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | insert | 38 | 38 | 38 | 42 | 0 | |
p01417 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#de... |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#de... | replace | 37 | 39 | 37 | 39 | TLE | |
p01417 | C++ | Runtime Error | #include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
int N, M;
cin >> N >> M;
std::vector<std::vector<double>> colors(N, std::vector<double>(3));
for (int i = 0; i < N; i++) {
cin >> colors[i][0];
cin >> colors[i]... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
int N, M;
cin >> N >> M;
std::vector<std::vector<double>> colors(N, std::vector<double>(3));
for (int i = 0; i < N; i++) {
cin >> colors[i][0];
cin >> colors[i]... | replace | 42 | 45 | 42 | 44 | 0 | |
p01417 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr... | #include <bits/stdc++.h>
using namespace std;
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr... | replace | 58 | 59 | 58 | 59 | 0 | |
p01417 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<str... | #include <bits/stdc++.h>
using namespace std;
typedef ostringstream OSS;
typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<str... | insert | 95 | 95 | 95 | 97 | TLE | |
p01417 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
double a[20], b[20], c[20];
double dist[20][32];
double squ(double x) { return x * x; }
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lf %lf %lf", a + i, b + i, c + i);
}
for (int i = 0; i < n; i++)
for... | #include <algorithm>
#include <cstdio>
using namespace std;
double a[20], b[20], c[20];
double dist[20][32];
double squ(double x) { return x * x; }
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%lf %lf %lf", a + i, b + i, c + i);
}
if (m == 0) {
printf("%.5f\n", ... | insert | 12 | 12 | 12 | 16 | 0 | |
p01418 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int k, r, l;
double p, e, t;
double solve(int k, double r, double l) {
if (t + e < r || l < t - e) {
return 0.0;
}
double h = (r + l) / 2;
if (k == 0) {
if (t - e <= h && h <= t + e) {
return 1.0;
} else
return 0.0;
}
double k1 = 1.0... | #include <bits/stdc++.h>
using namespace std;
int k, r, l;
double p, e, t;
double solve(int k, double r, double l) {
if (t + e < r || l < t - e) {
return 0.0;
}
if (t - e <= r && l <= t + e) {
return 1.0;
}
double h = (r + l) / 2;
if (k == 0) {
if (t - e <= h && h <= t + e) {
return 1.... | insert | 9 | 9 | 9 | 12 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
dou... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> pii;
dou... | insert | 24 | 24 | 24 | 29 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | replace | 61 | 62 | 61 | 62 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) ... | insert | 27 | 27 | 27 | 29 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#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 <time.h>
#include <tuple>
#include <u... | #include <algorithm>
#include <bitset>
#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 <time.h>
#include <tuple>
#include <u... | replace | 65 | 66 | 65 | 67 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
int K;
long double P;
long double rec(const int n, const long double l, const long double r,
const long double tl, const long double tr,
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using ll = long long;
int K;
long double P;
long double rec(const int n, const long double l, const long double r,
const long double tl, const long double tr,
... | insert | 18 | 18 | 18 | 25 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
double P, E, T;
double dfs(int k, double L, double R) {
double H = (R + L) / 2, PP = H >= T ? 1 - P : P;
if (k == 0 || (abs(L - T) <= E && abs(R - T) <= E))
return abs(H - T) <= E;
return PP * dfs(k - 1, H, R) + (1 - PP) * dfs(k - 1, L, H);
}
int main() {
doub... | #include <bits/stdc++.h>
using namespace std;
double P, E, T;
double dfs(int k, double L, double R) {
double H = (R + L) / 2, PP = H >= T ? 1 - P : P;
if (k == 0 || (abs(L - T) <= E && abs(R - T) <= E))
return abs(H - T) <= E;
if (T < R - E || L + E < T)
return 0;
return PP * dfs(k - 1, H, R) + (1 - PP... | insert | 8 | 8 | 8 | 10 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 30
#define pb push_back
#define mp make_pair
using namespace ... | insert | 25 | 25 | 25 | 30 | TLE | |
p01418 | 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 | 35 | 36 | 35 | 36 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int k, r, l;
double p, e, t;
double rec(int depth, double l, double r) {
// printf("%d %lf %lf\n", depth, l, r);
double mid = (l + r) / 2, ret = 0;
if (depth == k) {
if (mid >= t - e && mid <= t + e)
return 1;
return 0;
}
if (r + e < t || l - e > t)
... | #include <cstdio>
using namespace std;
int k, r, l;
double p, e, t;
double rec(int depth, double l, double r) {
// printf("%d %lf %lf\n", depth, l, r);
double mid = (l + r) / 2, ret = 0;
if (depth == k) {
if (mid >= t - e && mid <= t + e)
return 1;
return 0;
}
if (r + e < t || l - e > t)
... | insert | 17 | 17 | 17 | 19 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const double eps = 1e-11;
int K, R, L;
double P, E, T;
bool equals(double a, double b) { return abs(a - b) < eps; }
double rec(double r, double l, int k, int flag) {
if (flag) {
double dist = min(abs(T - r), abs(T... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const double eps = 1e-11;
int K, R, L;
double P, E, T;
bool equals(double a, double b) { return abs(a - b) < eps; }
double rec(double r, double l, int k, int flag) {
if (flag) {
double dist = min(abs(T - r), abs(T... | insert | 18 | 18 | 18 | 26 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
double P, E, T;
double solve(double L, double R, int K) {
double H = (L + R) / 2.0;
if (K == 0) {
if (T - E <= H && H <= T + E) {
return 1;
} else {
return 0;
}
}
if (T - E > L || T + E < R) {
return 0;
}
double res = 0;
if (H ... | #include <bits/stdc++.h>
using namespace std;
double P, E, T;
double solve(double L, double R, int K) {
double H = (L + R) / 2.0;
if (K == 0) {
if (T - E <= H && H <= T + E) {
return 1;
} else {
return 0;
}
}
if (T - E <= L && L <= T + E && T - E <= R && R <= T + E) {
return 1;
... | insert | 14 | 14 | 14 | 18 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
double R, L, H;
double P, E, T;
int k;
double sleep(double L, double R, double k) {
double H = (L + R) / 2;
if (!k) {
if (abs(T - H) > E)
return 0.0;
return 1.0;
}
if (T + E < R)
return 0.0;
if (T - E > L)
ret... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
double R, L, H;
double P, E, T;
int k;
double sleep(double L, double R, double k) {
double H = (L + R) / 2;
if (!k) {
if (abs(T - H) > E)
return 0.0;
return 1.0;
}
if (T - E < R && L < T + E)
return 1.0;
if (T + E... | insert | 17 | 17 | 17 | 19 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int R, L, K;
double P, E, T, ans = 0;
void b_search(int k, double r, double l, double p) {
if (l <= (T - E) || (T + E) <= r)
return;
if (k == K) {
double H = (r + l) / 2;
if (T - E < H && H < T + E)
ans += p;
} else {
double H = (... | #include <cstdio>
#include <iostream>
using namespace std;
int R, L, K;
double P, E, T, ans = 0;
void b_search(int k, double r, double l, double p) {
if (l <= (T - E) || (T + E) <= r)
return;
if ((T - E) <= r && l <= (T + E)) {
ans += p;
return;
}
if (k == K) {
double H = (r + l) / 2;
if (... | replace | 10 | 11 | 10 | 14 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using name... | replace | 64 | 65 | 64 | 65 | TLE | |
p01418 | C++ | Time Limit Exceeded | #include <iomanip>
#include <iostream>
using namespace std;
int K, L, R;
double P, E, T;
double solve(double l, double r, int d) {
double v = (l + r) / 2;
if (d == K)
return ((T - E <= v && v < T + E) ? 1.0 : 0.0);
if (v < T)
return solve(l, (l + r) / 2, d + 1) * P +
solve((l + r) / 2, r, d + 1... | #include <iomanip>
#include <iostream>
using namespace std;
int K, L, R;
double P, E, T;
inline double solve(double l, double r, int d) {
double v = (l + r) / 2;
if (d == K)
return ((T - E <= v && v < T + E) ? 1.0 : 0.0);
if (v < T)
return solve(l, (l + r) / 2, d + 1) * P +
solve((l + r) / 2, r... | replace | 5 | 6 | 5 | 6 | TLE | |
p01419 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
void dfs(bool &end, int a, int b, vector<vector<int>> adjlist,
vector<int> &temp_node, vector<bool> &used) {
// cout << a << " ";
if (a == b) {
end = true;
return;
}
for (int i = 0; i < adjlist[a].size(); i++) {
if (used[adjlist[a][i]] == fa... | #include <bits/stdc++.h>
using namespace std;
void dfs(bool &end, int a, int b, vector<vector<int>> &adjlist,
vector<int> &temp_node, vector<bool> &used) {
// cout << a << " ";
if (a == b) {
end = true;
return;
}
for (int i = 0; i < adjlist[a].size(); i++) {
if (used[adjlist[a][i]] == f... | replace | 3 | 4 | 3 | 4 | TLE | |
p01420 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 101;
const int MAX_M = 51;
ll comb[MAX_M][MAX_M];
do... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 101;
const int MAX_M = 51;
ll comb[MAX_M][MAX_M];
do... | replace | 36 | 37 | 36 | 43 | 0 | |
p01421 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string... | #include <algorithm>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string... | replace | 106 | 107 | 106 | 107 | 0 | |
p01422 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 25
#define MAX_C 300000
#define INF 9999999999.99
vector<int> yakusuu[MAX_C];
double dp[MAX_N][MAX_C];
int n;
int x[MAX_N];
void yaku() {
for (int i = 1; i < MAX_C; i++) {
for (int ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_N 22
#define MAX_C 222222
#define INF 9999999999.99
vector<int> yakusuu[MAX_C];
double dp[MAX_N][MAX_C];
int n;
int x[MAX_N];
void yaku() {
for (int i = 1; i < MAX_C; i++) {
for (int ... | replace | 7 | 9 | 7 | 9 | MLE | |
p01422 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) ... | replace | 115 | 116 | 115 | 116 | MLE | |
p01422 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int maxn = 22;
const int maxm = 222222;
double dp[maxn][maxm];
int a[maxn... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int maxn = 22;
const int maxm = 150000;
double dp[maxn][maxm];
int a[maxn... | replace | 16 | 17 | 16 | 17 | MLE | |
p01422 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const double eps = 1e-9;
int N;
int a[20];
vector<double> v;
bool equals(double s, double t) { return fabs(s - t) < eps; }
double cost(int s, int t) { return (double)abs(s - t) / s; }
bool rec(int bx, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const double eps = 1e-9;
int N;
int a[20];
vector<double> v;
bool equals(double s, double t) { return fabs(s - t) < eps; }
double cost(int s, int t) { return (double)abs(s - t) / s; }
bool rec(int bx, ... | replace | 19 | 22 | 19 | 20 | TLE | |
p01423 | C++ | Time Limit Exceeded | #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 = (i... | #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 = (i... | insert | 96 | 96 | 96 | 99 | TLE | |
p01423 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, m;
int ans;
vector<int> neighbors[100];
set<set<int>> used;
int weight[100][100];
void dfs(set<int> vs) {
if (used.count(vs))
return;
int score = 0;
if (vs.size() > 1) {
for (auto &&i : vs) {
int c = 1e9;
for (auto &&j : vs) {
if ... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int ans;
vector<int> neighbors[100];
set<set<int>> used;
int weight[100][100];
void dfs(set<int> vs) {
if (used.count(vs))
return;
used.insert(vs);
int score = 0;
if (vs.size() > 1) {
for (auto &&i : vs) {
int c = 1e9;
for (auto &&j ... | insert | 12 | 12 | 12 | 13 | TLE | |
p01423 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define inf (1LL << 50)
int N, M;
vector<vector<long long int>> bridge;
long long int solve(vector<long long int> D, long long int idx) {
long long int ret = 0;
for (int i = idx; i < N; i++) {
auto next = D;
for (int j = 0; j < N; j++) {
if (i != j &&... | #include <bits/stdc++.h>
using namespace std;
#define inf (1LL << 50)
int N, M;
vector<vector<long long int>> bridge;
long long int solve(vector<long long int> D, long long int idx) {
long long int ret = 0;
for (int i = idx; i < N; i++) {
auto next = D;
for (int j = 0; j < N; j++) {
if (i != j &&... | replace | 65 | 66 | 65 | 66 | TLE | |
p01423 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a, 0, sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a, 0, sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch ... | replace | 25 | 26 | 25 | 26 | 0 | |
p01423 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#incl... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#incl... | replace | 57 | 58 | 57 | 58 | 0 | |
p01423 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | replace | 80 | 81 | 80 | 81 | TLE | |
p01423 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
const int INF = 1e8;
using namespace std;
#define int long long
int n, m;
int g[105][105];
int ans;
... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
const int INF = 1e8;
using namespace std;
#define int long long
int n, m;
int g[105][105];
int ans;
... | replace | 26 | 27 | 26 | 27 | TLE | |
p01424 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef vector<int> Node;
typedef vector<Node> Graph;
typedef pair<int, int> P;
typedef tuple<int, int, int, int> T;
const int INF = 1000000000;
int main() {
int N, M;
while (cin >> N >> M) {
vector<string> s(N... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef vector<int> Node;
typedef vector<Node> Graph;
typedef pair<int, int> P;
typedef tuple<int, int, int, int> T;
const int INF = 1000000000;
int main() {
int N, M;
while (cin >> N >> M) {
vector<string> s(N... | replace | 62 | 63 | 62 | 63 | TLE | |
p01424 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP... | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);
#define REP... | replace | 143 | 144 | 143 | 144 | TLE | |
p01425 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#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 MP make_pair
#define PB push_back
typedef doubl... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#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 MP make_pair
#define PB push_back
typedef doubl... | replace | 90 | 91 | 90 | 91 | TLE | |
p01426 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | insert | 323 | 323 | 323 | 324 | MLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.