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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02670 | C++ | Runtime Error | #include <stdio.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
static inline char CH() {
static char buf[100000], *ptr1 = buf, *ptr2 = buf;
return ptr1 == ptr2 && (ptr2 = (ptr1 = buf) + fread(buf, 1, 1000... | #include <stdio.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
static inline char CH() {
static char buf[100000], *ptr1 = buf, *ptr2 = buf;
return ptr1 == ptr2 && (ptr2 = (ptr1 = buf) + fread(buf, 1, 1000... | replace | 30 | 31 | 30 | 31 | 0 | |
p02670 | C++ | Runtime Error | #include <stdio.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
static inline char CH() {
static char buf[100000], *ptr1 = buf, *ptr2 = buf;
return ptr1 == ptr2 && (ptr2 = (ptr1 = buf) + fread(buf, 1, 1000... | #include <stdio.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
static inline char CH() {
static char buf[100000], *ptr1 = buf, *ptr2 = buf;
return ptr1 == ptr2 && (ptr2 = (ptr1 = buf) + fread(buf, 1, 1000... | replace | 30 | 31 | 30 | 31 | 0 | |
p02670 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o << 1)
#define rs (o << 1 | 1)
#define pb push_back
const double PI = acos(-1.0);
const int M = 500 + 7;
int x[M], y[M];
int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};
int vs[M][M]; // i,j位置当前时刻 是否还有人
int d[M][M]; // i,j位置的人，最快离开剧场所需要... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o << 1)
#define rs (o << 1 | 1)
#define pb push_back
const double PI = acos(-1.0);
const int M = 500 + 7;
int x[M * M], y[M * M];
int dx[10] = {-1, 1, 0, 0}, dy[10] = {0, 0, -1, 1};
int vs[M][M]; // i,j位置当前时刻 是否还有人
int d[M][M]; // i,j位置的人... | replace | 9 | 11 | 9 | 11 | 0 | |
p02670 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define MAXN 100100
#define ll long long
ll n, m, a[510][510], dis[510][510], p[50100], ans;
void dfs(ll x, ll y) {
if (dis[x - 1][y] > ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
#define MAXN 100100
#define ll long long
ll n, m, a[510][510], dis[510][510], p[500100], ans;
void dfs(ll x, ll y) {
if (dis[x - 1][y] >... | replace | 12 | 13 | 12 | 13 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int N = 600005;
int n, rt, cnt, ind, pw[N], ch[N][3], tg[N], val[N], ans[N];
char s[N];
void bud(int &k1, int k2, int k3) {
k1 = ++cnt;
if (k2 == n) {
val[k1] = k3;
return;
}
rep(i, 0, 2) bud(ch[k1]... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int N = 1800005;
int n, rt, cnt, ind, pw[N], ch[N][3], tg[N], val[N], ans[N];
char s[N];
void bud(int &k1, int k2, int k3) {
k1 = ++cnt;
if (k2 == n) {
val[k1] = k3;
return;
}
rep(i, 0, 2) bud(ch[k1... | replace | 3 | 4 | 3 | 4 | 0 | |
p02671 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair... | replace | 80 | 85 | 80 | 85 | TLE | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxN = 6e5 + 10;
int n, len, cnt, root;
int ch[maxN + 1][3], a[maxN + 1];
int rev[maxN + 1], pw[15], ans[maxN + 1];
char s[maxN + 1];
inline void reverse(int x) {
if (!x)
return;
swap(ch[x][1], ch[x][2]);
rev[x] ^= 1;
}
inline void pushdown(int x) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 2e6 + 10;
int n, len, cnt, root;
int ch[maxN + 1][3], a[maxN + 1];
int rev[maxN + 1], pw[15], ans[maxN + 1];
char s[maxN + 1];
inline void reverse(int x) {
if (!x)
return;
swap(ch[x][1], ch[x][2]);
rev[x] ^= 1;
}
inline void pushdown(int x) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02671 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
const int maxn = 6e5;
int n, m, tot, val[maxn + 5], ch[maxn + 5][3], cnt, res[maxn + 5];
bool sal[maxn + 5];
char s[maxn + 5];
int dfs(int k, int t, int s) {
int x = ++tot;
if (!k)
return val[x] = s, x;
ch... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
const int maxn = 8e5;
int n, m, tot, val[maxn + 5], ch[maxn + 5][3], cnt, res[maxn + 5];
bool sal[maxn + 5];
char s[maxn + 5];
int dfs(int k, int t, int s) {
int x = ++tot;
if (!k)
return val[x] = s, x;
ch... | replace | 4 | 5 | 4 | 5 | TLE | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
... | replace | 31 | 32 | 31 | 32 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int maxn = 555555;
#define MP make_pair
#define PB push_back
#define lson o << 1, l, mid
#define rson o << 1 | 1, mid + 1, r
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int maxn = 888888;
#define MP make_pair
#define PB push_back
#define lson o << 1, l, mid
#define rson o << 1 | 1, mid + 1, r
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, a, b) for (int i = (a); ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAXN 13
#define MAXM 500005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
string str;
int ans[MAXM];
int curdigit[MAXN], curres[MAXN];
string reduce(string &t) {
vector<char> s... | #include <bits/stdc++.h>
#define MAXN 13
#define MAXM 550005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
string str;
int ans[MAXM];
int curdigit[MAXN], curres[MAXN];
string reduce(string &t) {
vector<char> s... | replace | 2 | 3 | 2 | 3 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | #include <bits/stdc++.h>
#define For(i, x, y) for (register int i = (x); i <= (y); i++)
#define FOR(i, x, y) for (register int i = (x); i < (y); i++)
#define Dow(i, x, y) for (register int i = (x); i >= (y); i--)
#define Debug(v) \
for (auto i : v) ... | replace | 34 | 35 | 34 | 35 | 0 | |
p02671 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
inline int read() {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar();
if (c == '-')
t = -1, c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
inline int read() {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar();
if (c == '-')
t = -1, c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 ... | replace | 25 | 26 | 25 | 26 | -11 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | replace | 231 | 232 | 231 | 232 | -11 | |
p02671 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | replace | 225 | 226 | 225 | 226 | TLE | |
p02671 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | replace | 217 | 218 | 217 | 218 | TLE | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG \
fprintf(stderr, "Running on Line %d in Function %s\n", __LINE__, __FUNCTION__)
// mt19937 rnd(chrono::st... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG \
fprintf(stderr, "Running on Line %d in Function %s\n", __LINE__, __FUNCTION__)
// mt19937 rnd(chrono::st... | replace | 39 | 40 | 39 | 40 | 0 | |
p02671 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
#define LL long long
#define mp(x, y) make_pair(x,... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
#define LL long long
#define mp(x, y) make_pair(x,... | replace | 63 | 65 | 63 | 65 | 0 | |
p02671 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #define int long long
#define pii pair<int, int>
#define x1 x1228
#define y1 y1228
#define left left228
#define right right228
#define next next228
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// #define int long long
#define pii pair<int, int>
#define x1 x1228
#define y1 y1228
#define left left228
#define right right228
#define next next228
#define pb push_back
#define eb emp... | insert | 0 | 0 | 0 | 3 | TLE | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef vector<bool> vi;
const int maxn = 2e5 + 10;
char s[maxn];
int n, ans[maxn], len, p3[13];
void solve(int x, int v, vi &a) {
int res[3];
vi tmp[3];
for (int i = 0; i < 3; i++) {
tmp[i].clear();
int now = i;
for (int j = 0; j < a.... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef vector<bool> vi;
const int maxn = 1e6 + 10;
char s[maxn];
int n, ans[maxn], len, p3[13];
void solve(int x, int v, vi &a) {
int res[3];
vi tmp[3];
for (int i = 0; i < 3; i++) {
tmp[i].clear();
int now = i;
for (int j = 0; j < a.... | replace | 4 | 5 | 4 | 5 | 0 | |
p02671 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 12;
const int maxN = 600000;
const int maxt = 200002;
struct node {
node *ch[3];
int lazy, id;
};
node *build(int d, int cur);
void pd(node *p);
void change(node *p, int d);
void cal(node *p, int d, int cur);
int n, ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 20;
const int maxN = 1000000;
const int maxt = 2000002;
struct node {
node *ch[3];
int lazy, id;
};
node *build(int d, int cur);
void pd(node *p);
void change(node *p, int d);
void cal(node *p, int d, int cur);
int n... | replace | 5 | 8 | 5 | 8 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ch[600005][3], ed[600005], cnt = 1, ans[600005];
bool rev[600005];
char s[200005];
void pushr(int x) {
swap(ch[x][1], ch[x][2]);
rev[x] ^= 1;
}
void pushdown(int x) {
if (!rev[x])
return;
for (int i = 0; i <= 2; i++)
if (ch[x][i])
pushr(ch[x][i]);
... | #include <bits/stdc++.h>
using namespace std;
int ch[10000005][3], ed[10000005], cnt = 1, ans[10000005];
bool rev[10000005];
char s[200005];
void pushr(int x) {
swap(ch[x][1], ch[x][2]);
rev[x] ^= 1;
}
void pushdown(int x) {
if (!rev[x])
return;
for (int i = 0; i <= 2; i++)
if (ch[x][i])
pushr(ch[... | replace | 2 | 4 | 2 | 4 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void read(int &x) {
register char ch = getchar();
x = 0;
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
for (; ch != ' ' && ch != '\n'; x = x * 10 + ch - '0', ch = getchar())
;
}
void reads(string &s) {
register char ch = getchar();
s = "";
for (; c... | #include <bits/stdc++.h>
using namespace std;
void read(int &x) {
register char ch = getchar();
x = 0;
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
for (; ch != ' ' && ch != '\n'; x = x * 10 + ch - '0', ch = getchar())
;
}
void reads(string &s) {
register char ch = getchar();
s = "";
for (; c... | replace | 23 | 25 | 23 | 25 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define SZ(x) (int)x.size() - 1
#define F(i, a, b) for (int i = a; i <= b; ++i)
#define DF(i, a, b) for (int i = a; i >= b; --i)
#define pb push_back
#define ms(a, b) memset(a, b, sizeof a)
using namespace std;
int read() {
char ch = getchar();
int w = 1, c = 0;
for (... | #include <bits/stdc++.h>
#define LL long long
#define SZ(x) (int)x.size() - 1
#define F(i, a, b) for (int i = a; i <= b; ++i)
#define DF(i, a, b) for (int i = a; i >= b; --i)
#define pb push_back
#define ms(a, b) memset(a, b, sizeof a)
using namespace std;
int read() {
char ch = getchar();
int w = 1, c = 0;
for (... | replace | 18 | 19 | 18 | 19 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define MP make_pair
#define PB push_back
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double d... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define MP make_pair
#define PB push_back
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double d... | replace | 23 | 24 | 23 | 24 | 0 | |
p02671 | C++ | Time Limit Exceeded | #define ENABLE_DEBUG 0
// Kana's kitchen {{{
#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define LOOP(k) \
for (i64 ngtkana_is_a_genius = 0; ngtkana_is_a_genius < (i64)k; \
ngtkana_is_a_genius++)
using i32 = std... | #define ENABLE_DEBUG 0
// Kana's kitchen {{{
#include <bits/stdc++.h>
#define ALL(v) std::begin(v), std::end(v)
#define LOOP(k) \
for (i64 ngtkana_is_a_genius = 0; ngtkana_is_a_genius < (i64)k; \
ngtkana_is_a_genius++)
using i32 = std... | delete | 321 | 323 | 321 | 321 | TLE | |
p02671 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
static inline int Pow(int a, int b) {
return b ? Pow(a * a, b >> 1) * (b & 1 ? a : 1) : 1;
}
int main() {
int N, now, len... | #include <stdio.h>
#include <string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
static inline int Pow(int a, int b) {
return b ? Pow(a * a, b >> 1) * (b & 1 ? a : 1) : 1;
}
int main() {
int N, now, len... | replace | 9 | 10 | 9 | 10 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int N = 6e5 + 50;
int n, p[N];
char S[N];
int ch[N][3], tag[N], vl[N], nd, pw[20];
int build(int d, int v) {
if (!d)
return vl[++nd] = v, nd;
int x = ++nd;
ch[x][0] = build(d - 1, v);
ch[x][1] = build(d - 1, v + pw[n - d]... | #include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
cs int N = 2e6 + 50;
int n, p[N];
char S[N];
int ch[N][3], tag[N], vl[N], nd, pw[20];
int build(int d, int v) {
if (!d)
return vl[++nd] = v, nd;
int x = ++nd;
ch[x][0] = build(d - 1, v);
ch[x][1] = build(d - 1, v + pw[n - d]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02671 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define RI register int
#define CI const int &
using namespace std;
const int N = 531442;
int n, m, rt, tot, ch[N][3], ans[N], id[N];
char s[N];
bool rev[N];
inline void build(int &now, CI dep = 0, CI st = 0) {
now = ++tot;
if (dep == n)
... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define RI register int
#define CI const int &
using namespace std;
const int N = 1594324;
int n, m, rt, tot, ch[N][3], ans[N], id[N];
char s[N];
bool rev[N];
inline void build(int &now, CI dep = 0, CI st = 0) {
now = ++tot;
if (dep == n)
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, rt, tot, sum[N], ans[N], t[N][3], lz[N];
char s[N];
void build(int &now, int n, int b, int c) {
now = ++tot;
if (n == 0) {
sum[now] = c;
return;
}
build(t[now][0], n - 1, b * 3, c);
build(t[now][1], n - 1, b * 3, c + b);
bui... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, rt, tot, sum[N], ans[N], t[N][3], lz[N];
char s[N];
void build(int &now, int n, int b, int c) {
now = ++tot;
if (n == 0) {
sum[now] = c;
return;
}
build(t[now][0], n - 1, b * 3, c);
build(t[now][1], n - 1, b * 3, c + b);
bui... | replace | 2 | 3 | 2 | 3 | 0 | |
p02671 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 531500
void Read(int &p) {
p = 0;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
;
for (; c >= '0' && c <= '9'; c = getchar())
p = p * 10 + c - '0';
}
int n, m, rot, cnt, val[N], a... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 5000005
void Read(int &p) {
p = 0;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
;
for (; c >= '0' && c <= '9'; c = getchar())
p = p * 10 + c - '0';
}
int n, m, rot, cnt, val[N], ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02671 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int M = 15, N = 600005;
int n, m, Q;
char s[N];
int Pw[M];
struct Trie {
struct Node {
int ch[3];
int val;
int tag;
Node() {
ch[0] = ch[1] = ch[2] = 0;
val = -1;
tag = 0;
retur... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int M = 15, N = 600005;
int n, m, Q;
char s[N];
int Pw[M];
struct Trie {
struct Node {
int ch[3];
int val;
int tag;
Node() {
ch[0] = ch[1] = ch[2] = 0;
val = -1;
tag = 0;
retur... | replace | 20 | 21 | 20 | 21 | 0 | |
p02671 | C++ | Runtime Error | #include <bits/stdc++.h>
#define calc(x) swap((x)->son[1], (x)->son[2])
using namespace std;
char s[200010];
struct Node {
int x, rev;
Node *son[3];
Node() { x = -1, son[0] = son[1] = son[2] = NULL, rev = 0; }
void pushdown() {
if (!rev)
return;
son[0]->rev ^= 1, son[1]->rev ^= 1, son[2]->rev ^=... | #include <bits/stdc++.h>
#define calc(x) swap((x)->son[1], (x)->son[2])
using namespace std;
char s[200010];
struct Node {
int x, rev;
Node *son[3];
Node() { x = -1, son[0] = son[1] = son[2] = NULL, rev = 0; }
void pushdown() {
if (!rev)
return;
son[0]->rev ^= 1, son[1]->rev ^= 1, son[2]->rev ^=... | replace | 17 | 18 | 17 | 18 | 0 | |
p02671 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
template <class T> inline void checkmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void checkmax(T... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
template <class T> inline void checkmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> inline void checkmax(T... | replace | 89 | 90 | 89 | 90 | TLE | |
p02671 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inclu... | replace | 77 | 78 | 77 | 78 | 0 | |
p02673 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
#define mp make_pair
#define PI pair<ll, ll>
#define poly vector<ll>
#define mem(a) memset((a), 0, sizeof(a))
#define For(i, l, r) for (int i = (int)(l); i <= (int)(r); i++)
#define Rep(i, r, l) for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
#define mp make_pair
#define PI pair<ll, ll>
#define poly vector<ll>
#define mem(a) memset((a), 0, sizeof(a))
#define For(i, l, r) for (int i = (int)(l); i <= (int)(r); i++)
#define Rep(i, r, l) for (i... | replace | 55 | 56 | 55 | 56 | 0 | |
p02673 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LL long long
#define db long double
using namespace std;
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = get... | #include <bits/stdc++.h>
#define LL long long
#define db long double
using namespace std;
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = get... | delete | 76 | 80 | 76 | 76 | TLE | |
p02674 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define eb(x, y) emplace_back(x, y)
#define fi first
#define se second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define eb(x, y) emplace_back(x, y)
#define fi first
#define se second
#define Rep(x, y, z) for (int x = y; x <= z; x++)
#define Red(x, y, z) for... | replace | 59 | 60 | 59 | 60 | 0 | |
p02675 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int sum = 0, num, num1;
cin >> num;
num1 = num;
while (0 < num1) {
num1 = (num1 / 10);
sum++;
}
sum = sum - 1;
while (sum > 0) {
num = num / 10;
}
switch (num) {
case 3:
std ::cout << "bon" << endl;
break;
case 0:
case 1:
... | #include <iostream>
using namespace std;
int main() {
int sum = 0, num, num1;
cin >> num;
num1 = num;
if (num < 10) {
} else {
num = num % 10;
}
switch (num) {
case 3:
std ::cout << "bon" << endl;
break;
case 0:
case 1:
case 6:
case 8:
std ::cout << "pon" << endl;
break;
de... | replace | 6 | 13 | 6 | 9 | TLE | |
p02675 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
char n;
n = N.at(N.size() - 1);
if (n == '3') {
cout << "bon" << endl;
} else if (n == '0' or n == '1' or n == '6' or n == '8') {
cout << "pon" << endl;
} else {
cout << "hon" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
char n;
cin >> N;
n = N.at(N.size() - 1);
if (n == '3') {
cout << "bon" << endl;
} else if (n == '0' or n == '1' or n == '6' or n == '8') {
cout << "pon" << endl;
} else {
cout << "hon" << endl;
}
}
| insert | 7 | 7 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 18446744073709551615) >= this->size() (which is 0)
|
p02675 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 3; i > 0; i++) {
N = N % (10 * i);
}
if (N == 3) {
cout << "bon" << endl;
}
if (N == 0 || N == 1 || N == 6 || N == 8) {
cout << "pon" << endl;
}
if (N == 2 || N == 4 || N == 5 || N == 7 || N == 9) {
co... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
for (int i = 3; i > 0; i--) {
N = N % (10 * i);
}
if (N == 3) {
cout << "bon" << endl;
}
if (N == 0 || N == 1 || N == 6 || N == 8) {
cout << "pon" << endl;
}
if (N == 2 || N == 4 || N == 5 || N == 7 || N == 9) {
co... | replace | 6 | 7 | 6 | 7 | TLE | |
p02675 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// defines
ty... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// defines
ty... | insert | 54 | 54 | 54 | 55 | 0 | |
p02675 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 10 == 3)
cout << "bon";
else if (n % 0 == 0 || n % 0 == 1 || n % 0 == 6 || n % 0 == 8)
cout << "pon";
else
cout << "hon";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n % 10 == 3)
cout << "bon";
else if (n % 10 == 0 || n % 10 == 1 || n % 10 == 6 || n % 10 == 8)
cout << "pon";
else
cout << "hon";
} | replace | 8 | 9 | 8 | 9 | -8 | |
p02675 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
//{{{ read()
inline int read() {
register int x = 0, f = 1;
register char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
//{{{ read()
inline int read() {
register int x = 0, f = 1;
register char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
... | replace | 25 | 34 | 25 | 32 | TLE | |
p02675 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int out;
while (n > 0) {
if (n / 10 == 0)
out = n;
else
n = n % 10;
}
string output;
if (out == 2 || out == 4 || out == 5 || out == 7 || out == 9)
output = "hon";
else if (out == 0 || out == 1 || out ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int out = n % 10;
string output;
if (out == 2 || out == 4 || out == 5 || out == 7 || out == 9)
output = "hon";
else if (out == 0 || out == 1 || out == 6 || out == 8)
output = "pon";
else
output = "bon";
cout << out... | replace | 7 | 14 | 7 | 8 | TLE | |
p02675 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 12 10
// --------------------------------------------------------------------------------
#define fast_IO ios_base::sync_with_stio(false), cin.tie(NULL), cout.tie(NULL);
#define ll long long
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define deb(name, value) co... | #include <bits/stdc++.h>
using namespace std;
// 12 10
// --------------------------------------------------------------------------------
#define fast_IO ios_base::sync_with_stio(false), cin.tie(NULL), cout.tie(NULL);
#define ll long long
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define deb(name, value) co... | replace | 15 | 16 | 15 | 16 | -11 | |
p02675 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, i, m, j, k, s, a;
int main() {
scanf("%d", n);
n = n % 10;
if (n == 2 || n == 4 || n == 5 || n == 7 || n == 9) {
printf("hon");
} else if (n == 0 || n == 1 || n == 6 || n == 8) {
printf("pon");
} else if (n == 3) {
printf("bon");
}
} | #include <bits/stdc++.h>
using namespace std;
int n, i, m, j, k, s, a;
int main() {
scanf("%d", &n);
n = n % 10;
if (n == 2 || n == 4 || n == 5 || n == 7 || n == 9) {
printf("hon");
} else if (n == 0 || n == 1 || n == 6 || n == 8) {
printf("pon");
} else if (n == 3) {
printf("bon");
}
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02675 | Python | Runtime Error | d = {n: "hon" for n in "24579"}
d.update({n: "pon" for n in "0168"})
d.update({3: "bon"})
print(d[input()[-1]])
| d = {n: "hon" for n in "24579"}
d.update({n: "pon" for n in "0168"})
d.update({"3": "bon"})
print(d[input()[-1]])
| replace | 2 | 3 | 2 | 3 | 0 | |
p02675 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s;
s[0] = "pon";
s[1] = "pon";
s[2] = "hon";
s[3] = "bon";
s[4] = "hon";
s[5] = "hon";
s[6] = "pon";
s[7] = "h... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int n;
cin >> n;
vector<string> s(10);
s[0] = "pon";
s[1] = "pon";
s[2] = "hon";
s[3] = "bon";
s[4] = "hon";
s[5] = "hon";
s[6] = "pon";
s[7] ... | replace | 9 | 10 | 9 | 10 | -11 | |
p02675 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> X;
X[0] = "pon";
X[1] = "pon";
X[2] = "hon";
X[3] = "bon";
X[4] = "hon";
X[5] = "hon";
X[6] = "pon";
X[7] = "hon";
X[8] = "pon";
X[9] = "hon";
int Y;
cin >> Y;
int S = Y % 10;
cout << X... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> X(10);
X[0] = "pon";
X[1] = "pon";
X[2] = "hon";
X[3] = "bon";
X[4] = "hon";
X[5] = "hon";
X[6] = "pon";
X[7] = "hon";
X[8] = "pon";
X[9] = "hon";
int Y;
cin >> Y;
int S = Y % 10;
cout ... | replace | 5 | 6 | 5 | 6 | -11 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
cin >> k;
cin >> s;
if (s.size() <= k) {
cout << s;
} else {
cout << s.at(0) << s.at(1) << s.at(2) << s.at(3) << s.at(4) << s.at(5)
<< s.at(6) << "...";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string s;
cin >> k;
cin >> s;
if (s.size() <= k) {
cout << s;
} else {
for (int i = 0; i < k; i++) {
cout << s.at(i);
}
cout << "...";
}
}
| replace | 12 | 15 | 12 | 16 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t K;
string S;
cin >> K >> S;
int64_t s_size = S.size();
if (s_size <= K) {
cout << S << endl;
} else {
cout << S.erase(7) << "..." << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t K;
string S;
cin >> K >> S;
int64_t s_size = S.size();
if (s_size <= K) {
cout << S << endl;
} else {
cout << S.erase(K) << "..." << endl;
}
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int K;
string S;
cin >> K;
cin >> S;
if (K >= sizeof(S)) {
cout << S << endl;
} else {
S = S.erase(K);
S = S + "...";
cout << S << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int K;
string S;
cin >> K;
cin >> S;
if (K >= S.length()) {
cout << S << endl;
} else {
S = S.erase(K);
S = S + "...";
cout << S << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int L, K;
cin >> K;
cin >> S;
char ch;
L = S.length();
if (L <= K) {
cout << S << "";
} else {
for (int i = 0; i <= L; i++) {
ch = S.at(i);
cout << ch;
}
cout << "...";
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
int L, K;
cin >> K;
cin >> S;
char ch;
L = S.length();
if (L <= K) {
cout << S << "";
} else {
for (int i = 0; i <= (K - 1); i++) {
ch = S.at(i);
cout << ch;
}
cout << "...";
}
return 0;
} | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 15) >= this->size() (which is 15)
|
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int k;
string s;
cin >> k >> s;
string ans;
char add;
rep(i, k) {
add = s.at(i);
ans += add;
}
if (s.size() > k)
ans += "...";
cout <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int k;
string s;
cin >> k >> s;
string ans;
char add;
rep(i, k) {
try {
add = s.at(i);
} catch (out_of_range) {
break;
}
ans... | replace | 13 | 14 | 13 | 18 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
long long a = s.size();
if (a < k + 1) {
cout << s << endl;
} else {
for (int i = 0; i < 7; i++) {
cout << s.at(i);
}
cout << "..." << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
string s;
cin >> s;
long long a = s.size();
if (a < k + 1) {
cout << s << endl;
} else {
for (int i = 0; i < k; i++) {
cout << s.at(i);
}
cout << "..." << endl;
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
string s, t;
int k;
cin >> k >> s;
if (s.size() <= k)
cout << s << endl;
if (s.size() > k) {
for (int i = 0; i < 7; i++) {
t.push_back(s.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
string s, t;
int k;
cin >> k >> s;
if (s.size() <= k)
cout << s << endl;
if (s.size() > k) {
for (int i = 0; i < k; i++) {
t.push_back(s.... | replace | 14 | 15 | 14 | 15 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
string A;
cin >> A;
int B = 0;
if (A.size() <= X) {
cout << A << endl;
} else {
B = X - A.size();
cout << A.at(0) << A.at(1) << A.at(2) << A.at(3) << A.at(4) << A.at(5)
<< A.at(6) << "..."... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int X;
cin >> X;
string A;
cin >> A;
int B = 0;
if (A.size() <= X) {
cout << A << endl;
} else {
B = X - A.size();
for (int i = 0; i < X; i++) {
cout << A.at(i);
}
cout << "..." << endl;
}
} | replace | 14 | 16 | 14 | 18 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define ff first
#define ss second
#define INF (ll)(1e9)
#define mod (ll)(1e9 + 7)
#define endl "\n"
#define tt ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define ff first
#define ss second
#define INF (ll)(1e9)
#define mod (ll)(1e9 + 7)
#define endl "\n"
#define tt ... | replace | 19 | 20 | 19 | 20 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int ABC_168_B() {
int k;
string s;
string s_r;
cin >> k;
cin >> s;
if (s.size() <= k) {
cout << s << endl;
} else {
s_r = s.erase(7);
cout << s_r << "..." << endl;
}
return 0;
}
int main() {
ABC_168_B();
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int ABC_168_B() {
int k;
string s;
string s_r;
cin >> k;
cin >> s;
if (s.size() <= k) {
cout << s << endl;
} else {
s_r = s.erase(k);
cout << s_r << "..." << endl;
}
return 0;
}
int main() {
ABC_168_B();
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
#include <string>
int main() {
int K;
std::string S;
std::cin >> K >> S;
if (K > S.size()) {
for (int i = 0; i < K; ++i) {
std::cout << S.at(i);
}
std::cout << "...\n";
} else {
std::cout << S << "\n";
}
return 0;
} | #include <iostream>
#include <string>
int main() {
int K;
std::string S;
std::cin >> K >> S;
if (K < S.size()) {
for (int i = 0; i < K; ++i) {
std::cout << S.at(i);
}
std::cout << "...\n";
} else {
std::cout << S << "\n";
}
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define int32 int32_t
using namespace std;
int32 main() {
ios_base::sync_with_stdio(false);
int k;
string s;
cin >> k >> s;
if (k >= s.size()) {
cout << s;
return 1;
} else {
cout << s.substr(0, k) + "...";
}
return 0;
} | #include <bits/stdc++.h>
#define int long long
#define int32 int32_t
using namespace std;
int32 main() {
ios_base::sync_with_stdio(false);
int k;
string s;
cin >> k >> s;
if (k >= s.size()) {
cout << s;
return 0;
} else {
cout << s.substr(0, k) + "...";
}
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int N = 0;
string S;
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
cout << S.at(i);
}
if (S.size() > N) {
cout << "...";
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int N = 0;
string S;
cin >> N;
cin >> S;
int A = S.size();
int R = min(A, N);
for (int i = 0; i < R; i++) {
cout << S.at(i);
}
if (S.size() > N) {
cout << "...";
}
} | replace | 10 | 11 | 10 | 13 | 0 | |
p02676 | Python | Runtime Error | k = int(input())
s = list(map(str, input()))
if len(s) > k:
for i in range(k):
print(s[i], end="")
print("...")
else:
for i in s:
print(s[i], end="")
print()
| k = int(input())
s = list(map(str, input()))
if len(s) > k:
for i in range(k):
print(s[i], end="")
print("...")
else:
for i in s:
print(i, end="")
print()
| replace | 8 | 9 | 8 | 9 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K = 0;
string S;
cin >> K >> S;
if (S.size() <= K)
cout << S;
else {
for (int i = 0; i < 7; i++) {
cout << S.at(i);
}
cout << "...";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int K = 0;
string S;
cin >> K >> S;
if (S.size() <= K)
cout << S;
else {
for (int i = 0; i < K; i++) {
cout << S.at(i);
}
cout << "...";
}
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02676 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02676 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#includ... | replace | 27 | 28 | 27 | 28 | 0 | |
p02676 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <type_traits>
#include <utility>
#inclu... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <type_traits>
#include <utility>
#inclu... | replace | 52 | 58 | 52 | 54 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int k;
cin >> k;
string a, p;
cin >> a;
int b;
b = a.size();
if (k >= b) {
cout << a << endl;
} else {
p = a.substr(a.at(0), k);
cout << p << "..." << endl;
}
... | #include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int k;
cin >> k;
string a, p;
cin >> a;
int b;
b = a.size();
if (k >= b) {
cout << a << endl;
} else {
p = a.substr(0, k);
cout << p << "..." << endl;
}
retur... | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 110) > this->size() (which is 15)
|
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifndef LOCAL
#define fprintf \
if (false) \
fprintf
#endif
#define debug_int(x) fprintf(stderr, "%s = %d\n", #x, x)
#define debug_double(x)... | #include <bits/stdc++.h>
using namespace std;
#ifndef LOCAL
#define fprintf \
if (false) \
fprintf
#endif
#define debug_int(x) fprintf(stderr, "%s = %d\n", #x, x)
#define debug_double(x)... | replace | 25 | 26 | 25 | 26 | -11 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string S;
string ans = "", dots = "...";
cin >> K >> S;
for (int i = 0; i < K; i++) {
ans.push_back(S.at(i));
}
if (K < S.size()) {
ans += dots;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
string S;
string ans = "", dots = "...";
cin >> K >> S;
for (int i = 0; i < K; i++) {
if (i >= S.size()) {
break;
}
ans.push_back(S.at(i));
}
if (K < S.size()) {
ans += dots;
}
cout << ans << endl;
} | insert | 9 | 9 | 9 | 12 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
int r = k;
s.erase(r, s.length() - k);
s += "...";
cout << s;
}
| #include <iostream>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
if (k >= s.length()) {
cout << s;
return 0;
}
s += " ";
for (int i = 0; i < k; i++) {
if (s[i] == ' ')
break;
cout << s[i];
}
cout << "...";
return 0;
}
| replace | 8 | 12 | 8 | 20 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define LOOP(i, N) for (int i = 1; i <= (int)N; i++)
#define RREP(i, N) for (int i = (int)N - 1; i >= 0; i--)
#define RLOOP(i, N) for (int i = (int)N; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define LOOP(i, N) for (int i = 1; i <= (int)N; i++)
#define RREP(i, N) for (int i = (int)N - 1; i >= 0; i--)
#define RLOOP(i, N) for (int i = (int)N; i > 0; i--)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#def... | replace | 26 | 30 | 26 | 30 | 0 | |
p02676 | C++ | Runtime Error | /**********************************************************************
File hoge.cpp
Author harunaya
Date 2020-05-17(Sun)
note
**********************************************************************/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll =... | /**********************************************************************
File hoge.cpp
Author harunaya
Date 2020-05-17(Sun)
note
**********************************************************************/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll =... | replace | 22 | 23 | 22 | 23 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int K;
string S;
cin >> K >> S;
if (sizeof(S) <= K) {
cout << S << endl;
} else {
for (int i = 0; i < K; i++) {
cout << S.at(i);
}
cout << "..." << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int K;
string S;
cin >> K >> S;
if (S.size() <= K) {
cout << S << endl;
} else {
for (int i = 0; i < K; i++) {
cout << S.at(i);
}
cout << "..." << endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02676 | C++ | Runtime Error | #include <iostream>
#include <string>
int main() {
int k;
std::string s;
std::cin >> k >> s;
std::cout << s.erase(k) + (k < s.size() ? "..." : "") << std::endl;
}
| #include <iostream>
#include <string>
int main() {
int k;
std::string s;
std::cin >> k >> s;
std::cout << (k < s.size() ? s.erase(k) + "..." : s) << std::endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02676 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
char a[101];
int b, c;
scanf("%d", &b);
scanf("%s", a);
for (c = 0; c < strlen(a) - 1; c++)
printf("%s", a[c]);
}
| #include <stdio.h>
#include <string.h>
int main() {
int g;
char c[101];
scanf("%d ", &g);
scanf("%s", c);
int len = strlen(c);
if (len <= g) {
printf("%s\n", c);
} else {
for (int i = 0; i < g; i++) {
printf("%c", c[i]);
}
printf("...\n");
}
return 0;
} | replace | 3 | 9 | 3 | 17 | -11 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) \
for (auto x : (v)) \
cout ... | replace | 74 | 85 | 74 | 86 | -11 | |
p02676 | C++ | Runtime Error | /**
* created: 17.05.2020 21:02:58
**/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
int main() {
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
if (n <= k) {
cout << s << endl;
} else... | /**
* created: 17.05.2020 21:02:58
**/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1000000000;
int main() {
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
if (n <= k) {
cout << s << endl;
} else... | replace | 21 | 29 | 21 | 34 | 0 | |
p02676 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int K, i, l;
cin >> K;
cin >> S;
l = sizeof(S);
if (l <= K)
cout << S;
else {
for (i = 0; i < K; i++) {
cout << S.at(i);
}
cout << "...";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int K, i, l;
cin >> K;
cin >> S;
if (S.size() <= K)
cout << S;
else {
for (i = 0; i < K; i++) {
cout << S.at(i);
}
cout << "...";
}
} | replace | 8 | 10 | 8 | 9 | 0 | |
p02677 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// defines
ty... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// defines
ty... | insert | 34 | 34 | 34 | 35 | 0 | |
p02677 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define pi 3.1415926535897932
// to set precision use fixed,setprecision(number_of_points_after_decimal
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define mod 1000000007
#define sz(x) (int)(x).siz... |
#include <bits/stdc++.h>
using namespace std;
#define pi 3.1415926535897932
// to set precision use fixed,setprecision(number_of_points_after_decimal
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define mod 1000000007
#define sz(x) (int)(x).siz... | replace | 35 | 40 | 35 | 39 | -6 | terminate called after throwing an instance of 'std::__ios_failure'
what(): basic_ios::clear: iostream error
|
p02677 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 0; i <= n; ++i)
#define yes "yes"
#define Yes "Yes"
#define no "no"
#define No "No"
namespace mydef {
void say(string some) { cout << some << "\n"; }
} // namespace ... | #include <bits/stdc++.h>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 0; i <= n; ++i)
#define yes "yes"
#define Yes "Yes"
#define no "no"
#define No "No"
namespace mydef {
void say(string some) { cout << some << "\n"; }
} // namespace ... | replace | 30 | 33 | 30 | 34 | TLE | |
p02677 | Python | Runtime Error | import math
def main():
a, b, h, m = map(int, input().split())
if h == 0 and m == 0:
print(abs(b - a))
exit()
h_basho = h * 60 + m
m_basho = m * 12
h_m_basho = h_basho - m_basho
if h_m_basho == 360:
print(a + b)
exit()
elif h_m_basho < 360:
kakudo ... | import math
def main():
a, b, h, m = map(int, input().split())
th = (h * 60 + m) / 720 * 2 * math.pi
tm = m / 60 * 2 * math.pi
xh = a * math.cos(th)
yh = a * math.sin(th)
xm = b * math.cos(tm)
ym = b * math.sin(tm)
dx = xh - xm
dy = yh - ym
ans = math.sqrt(dx**2 + dy**2)
pr... | replace | 5 | 30 | 5 | 15 | TypeError: math.cos() takes exactly one argument (2 given) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02677/Python/s745697918.py", line 34, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02677/Python/s745697918.py", line 23, in main
cos = 2 * a * b * (round(math.co... |
p02677 | Python | Runtime Error | import math
A, B, H, M = map(int, input().split())
KA = H / 12 * 360 + ((M / 60) * (360 / 12))
KB = M / 60 * 360
K = abs(KA - KB)
if K > 180:
K = 360 - K
# if K == 180:
# print(A + B)
# exit()
# if K == 0:
# print(abs(B - A))
# exit()
# cosB = round(math.cos(math.radians(K)), 13)
cosB = math.cos(... | import math
A, B, H, M = map(int, input().split())
KA = H / 12 * 360 + ((M / 60) * (360 / 12))
KB = M / 60 * 360
K = abs(KA - KB)
if K > 180:
K = 360 - K
# if K == 180:
# print(A + B)
# exit()
# if K == 0:
# print(abs(B - A))
# exit()
# cosB = round(math.cos(math.radians(K)), 13)
cosB = math.cos(... | replace | 17 | 18 | 17 | 18 | TypeError: unsupported operand type(s) for -: 'int' and 'tuple' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02677/Python/s596954604.py", line 19, in <module>
cc = A ** 2 + B ** 2 - (2 * B * A * cosB)
TypeError: unsupported operand type(s) for -: 'int' and 'tuple'
|
p02677 | Python | Runtime Error | k = int(input())
s = list(input())
an_lis = []
if len(s) <= k:
ans = "".join(s)
print(ans)
else:
for i in range(k):
an_lis.append(s[i])
an_lis.append("...")
ans = "".join(an_lis)
print(ans)
| a, b, h, m = map(int, input().split())
import math
a_ang = (h / 12 + (1 / 12) * (m / 60)) * 2 * math.pi
b_ang = (m / 60) * 2 * math.pi
ax = a * math.cos(a_ang)
bx = b * math.cos(b_ang)
ay = a * math.sin(a_ang)
by = b * math.sin(b_ang)
x = ax - bx
y = ay - by
ans = (x**2 + y**2) ** 0.5
print(ans)
| replace | 0 | 12 | 0 | 14 | ValueError: invalid literal for int() with base 10: '3 4 9 0' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02677/Python/s504646897.py", line 1, in <module>
k = int(input())
ValueError: invalid literal for int() with base 10: '3 4 9 0'
|
p02677 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define multitest 0
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pqgreater(x) x, vector<x>, greater<x>
const ll mod = 998244353;
int solve();
int main() {
ios_base::sync_with_stdio(0), cin.tie(0... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define multitest 0
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pqgreater(x) x, vector<x>, greater<x>
const ll mod = 998244353;
int solve();
int main() {
ios_base::sync_with_stdio(0), cin.tie(0... | insert | 29 | 29 | 29 | 30 | TLE | |
p02677 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define PI 3.14159265359
int main() {
double a, b, h, m;
cin >> a >> b >> h >> m;
double time = h + m / 60;
double theta = 2 * PI / 12 * time;
double phi = 2 * PI * time;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define PI 3.14159265359
int main() {
double a, b, h, m;
cin >> a >> b >> h >> m;
double time = h + m / 60;
double theta = 2 * PI / 12 * time;
double phi = 2 * PI * time;
... | replace | 21 | 22 | 21 | 22 | TLE | |
p02677 | C++ | Time Limit Exceeded | #include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#define PI 3.1415926535
#define eps 1.0e-18
using namespace std;
int main() {
int a, b, h, m;
long double s, c, x;
cin >> a >> b >> h >> m;
s = (h * 60 + m) / 360.0 - m / 30.0;
x = abs(a * a + b * b - 2 * a * b * cos(s * PI));
c = sq... | #include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#define PI 3.1415926535
#define eps 1.0e-18
using namespace std;
int main() {
int a, b, h, m;
long double s, c, x;
cin >> a >> b >> h >> m;
s = (h * 60 + m) / 360.0 - m / 30.0;
x = abs(a * a + b * b - 2 * a * b * cos(s * PI));
c = sq... | delete | 14 | 16 | 14 | 14 | TLE | |
p02678 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\... | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\... | replace | 27 | 28 | 27 | 28 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e9 + 7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> r(n);
vector<int> d(n, -1);
rep(i, m) {
int a, b;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e9 + 7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> r(n);
vector<int> d(n, -1);
rep(i, m) {
int a, b;
... | replace | 23 | 24 | 23 | 24 | TLE | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<vector<int>> to(100010);
int dist[100010];
int pre[100010];
const int INF = 20000000;
int main() {
int N, M;
cin >> N >> M;
REP(i, M) {
int a, b;
cin >> a >> b;
a--;
b--;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
vector<vector<int>> to(100010);
int dist[100010];
int pre[100010];
const int INF = 20000000;
int main() {
int N, M;
cin >> N >> M;
REP(i, M) {
int a, b;
cin >> a >> b;
a--;
b--;
... | replace | 30 | 31 | 30 | 31 | TLE | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
vector<int> to[100005]; // インデックスに対応する部屋が隣接している部屋
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
vector<int> to[100005]; // インデックスに対応する部屋が隣接している部屋
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int a, b;
cin >>... | replace | 37 | 38 | 37 | 38 | 0 | |
p02678 | C++ | Runtime Error | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-05-18 00:07:16
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-05-18 00:07:16
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | replace | 102 | 103 | 102 | 103 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define int long long
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = ve... | replace | 35 | 36 | 35 | 36 | TLE | |
p02678 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, a, b, p, nxt;
cin >> N >> M;
queue<int> q, next_pos;
vector<queue<int>> G(M);
vector<int> done(N, 0);
for (int i = 0; i < M; i++) {
cin >> a >> b;
G[a - 1].emplace(b - 1);
G[b - 1].emplace(a - 1);
}
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, a, b, p, nxt;
cin >> N >> M;
queue<int> q, next_pos;
vector<queue<int>> G(N);
vector<int> done(N, 0);
for (int i = 0; i < M; i++) {
cin >> a >> b;
G[a - 1].emplace(b - 1);
G[b - 1].emplace(a - 1);
}
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02678 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int MAX = 100005;
int head[MAX], ver[MAX], next1[MAX], a[MAX];
int cnt = 0;
int n, m;
void add(int u, int v) {
ver[cnt] = v;
next1[cnt] = head[u];
head[u] = cnt++;
}
bool bfs(int x) {
queue<int> q;
q.push(x);
a[x] = 0;
whil... | #include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int MAX = 1000005;
int head[MAX], ver[MAX], next1[MAX], a[MAX];
int cnt = 0;
int n, m;
void add(int u, int v) {
ver[cnt] = v;
next1[cnt] = head[u];
head[u] = cnt++;
}
bool bfs(int x) {
queue<int> q;
q.push(x);
a[x] = 0;
whi... | replace | 4 | 5 | 4 | 5 | 0 | |
p02678 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<queue<int>> ca(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
ca[a].push(b);
ca[b].push(a);
}
vector<bool> vis(N, false);
queue<int> que;
que.push(0);... | #include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<queue<int>> ca(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
ca[a].push(b);
ca[b].push(a);
}
vector<bool> vis(N, false);
queue<int> que;
que.push(0);... | replace | 29 | 30 | 29 | 30 | TLE | |
p02678 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
int main() {
lint n, m;
cin >> n >> m;
vector<int> to[m]; // 二次元配列
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].push_back(b); // 道筋を... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int INF = 1001001001;
int main() {
lint n, m;
cin >> n >> m;
vector<int> to[100005]; // 二次元配列
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].push_back(b); /... | replace | 10 | 11 | 10 | 11 | 0 | |
p02678 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define NIL = -1;
#define all(x) x.begin(), x.end()
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0)
return 1;
return... | replace | 38 | 39 | 38 | 39 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.