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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03204 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define For(i, l, r) for (int i = (l), i##end = (r); i <= i##end; i++)
#define Fordown(i, r, l) for (int i = (r), i##end = (l); i >= i##end; i--)
#define debug(x) cout << #x << " = " << x << endl
using namespace std;
typedef long long ll;
template <typename T> inline bool chkmin(T &x, T y) {... | #include <bits/stdc++.h>
#define For(i, l, r) for (int i = (l), i##end = (r); i <= i##end; i++)
#define Fordown(i, r, l) for (int i = (r), i##end = (l); i >= i##end; i--)
#define debug(x) cout << #x << " = " << x << endl
using namespace std;
typedef long long ll;
template <typename T> inline bool chkmin(T &x, T y) {... | delete | 65 | 69 | 65 | 65 | TLE | |
p03204 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int _ = 1e5 + 7;
struct Edge {
int end, upEd;
} Ed[_ << 1];
int head[_], c... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
const int _ = 2e5 + 7;
struct Edge {
int end, upEd;
} Ed[_ << 1];
int head[_], c... | replace | 14 | 15 | 14 | 15 | 0 | |
p03204 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> g[200000];
int ans[100000];
map<int, int> mp[200000];
int dfs2(int idx, int par, int v) {
if (mp[idx].count(v))
return mp[idx][v];
int ret = 1;
for (auto &to : g[idx]) {
if (to == par)
continue;
if (to < v)
ret += dfs2(to,... | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> g[200000];
int ans[200000];
map<int, int> mp[200000];
int dfs2(int idx, int par, int v) {
if (mp[idx].count(v))
return mp[idx][v];
int ret = 1;
for (auto &to : g[idx]) {
if (to == par)
continue;
if (to < v)
ret += dfs2(to,... | replace | 6 | 7 | 6 | 7 | 0 | |
p03204 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = lon... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = lon... | replace | 41 | 42 | 41 | 42 | 0 | |
p03204 | C++ | Runtime Error | #include <cstdio>
#include <queue>
using namespace std;
#define N 100050
int fa[N], sz[N], head[N], cnt, mx[N], f[N], ti = 1, as[N], n, a, b, fr[N],
vl[N];
struct edge {
int t, next;
} ed[N * 2];
priority_queue<pair<int, int>> st;
int finds(int x) { return fa[x] == x ? x :... | #include <cstdio>
#include <queue>
using namespace std;
#define N 200050
int fa[N], sz[N], head[N], cnt, mx[N], f[N], ti = 1, as[N], n, a, b, fr[N],
vl[N];
struct edge {
int t, next;
} ed[N * 2];
priority_queue<pair<int, int>> st;
int finds(int x) { return fa[x] == x ? x :... | replace | 3 | 4 | 3 | 4 | 0 | |
p03204 | C++ | Runtime Error | #include <bits/stdc++.h>
#define re register
#define ui unsigned int
#define ull unsigned long long
int c[200100], f[200100], fc[200100], n;
struct eg {
int to;
eg *nx;
} e[200100], *la[200100], *cnt = e;
inline void addE(re int a, re int b) {
*++cnt = (eg){b, la[a]};
la[a] = cnt;
*++cnt = (eg){a, la[b]};
l... | #include <bits/stdc++.h>
#define re register
#define ui unsigned int
#define ull unsigned long long
int c[200100], f[200100], fc[200100], n;
struct eg {
int to;
eg *nx;
} e[400100], *la[200100], *cnt = e;
inline void addE(re int a, re int b) {
*++cnt = (eg){b, la[a]};
la[a] = cnt;
*++cnt = (eg){a, la[b]};
l... | replace | 8 | 9 | 8 | 9 | -11 | |
p03204 | C++ | Runtime Error | #include <cstdio>
int n, head[100001], nxt[200001], b[200001], k, ans2[100001];
void push(int s, int t) {
nxt[++k] = head[s];
head[s] = k;
b[k] = t;
}
void dfs(int x, int f, int mx, int skdmx, int down, bool update) {
if (x > mx)
skdmx = mx, mx = x, update = 1;
else if (x > skdmx)
skdmx = x, update =... | #include <cstdio>
int n, head[200001], nxt[400001], b[400001], k, ans2[200001];
void push(int s, int t) {
nxt[++k] = head[s];
head[s] = k;
b[k] = t;
}
void dfs(int x, int f, int mx, int skdmx, int down, bool update) {
if (x > mx)
skdmx = mx, mx = x, update = 1;
else if (x > skdmx)
skdmx = x, update =... | replace | 2 | 3 | 2 | 3 | 0 | |
p03204 | C++ | Time Limit Exceeded | #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 rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #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 rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | replace | 84 | 85 | 84 | 85 | TLE | |
p03204 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int N = 2e5 + 5;
int n, c[N];
vector<int> G[N];
inline void addedge(int u = 0, int v = 0) {
scanf("%d%d", &u, &v), G[u].push_back(v), G[v].push_back(u);
}
int calc(int u, int ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int N = 2e5 + 5;
int n, c[N];
vector<int> G[N];
inline void addedge(int u = 0, int v = 0) {
scanf("%d%d", &u, &v), G[u].push_back(v), G[v].push_back(u);
}
int calc(int u, int ... | replace | 18 | 19 | 18 | 19 | 0 | |
p03204 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
#define pb push_... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
#define pb push_... | replace | 15 | 16 | 15 | 16 | 0 | |
p03204 | C++ | Runtime Error | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define maxn 100010
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define pf push_front
#de... | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define maxn 200010
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#define pf push_front
#de... | replace | 3 | 4 | 3 | 4 | 0 | |
p03204 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
struct Edge {
int to, nex;
} e[N << 1];
int head[N], ecnt;
void adde(int fr, int to) {
e[++ecnt] = (Edge){to, head[fr]};
head[fr] = ecnt;
}
void addedge(int fr, int to) {
adde(to, fr);
adde(fr, to);
}
int n, par[N], c[N], mx[N];
map<in... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
struct Edge {
int to, nex;
} e[N << 1];
int head[N], ecnt;
void adde(int fr, int to) {
e[++ecnt] = (Edge){to, head[fr]};
head[fr] = ecnt;
}
void addedge(int fr, int to) {
adde(to, fr);
adde(fr, to);
}
int n, par[N], c[N], mx[N];
map<in... | replace | 3 | 4 | 3 | 4 | 0 | |
p03205 | C++ | Runtime Error | // Jump, and you will find out how to unfold your wings as you fall.
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n, k) (((n) >> (k)) & 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
con... | // Jump, and you will find out how to unfold your wings as you fall.
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n, k) (((n) >> (k)) & 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
con... | replace | 16 | 17 | 16 | 17 | 0 | |
p03205 | C++ | Runtime Error | #include <bits/stdc++.h>
#define to edge[i].v
#define mp make_pair
#define rint register int
#define debug(x) cerr << #x << "=" << x << endl
#define fgx cerr << "-------------" << endl
#define N 100010
#define T n + n + 1
#define add(x, y, z) addedge(x, y, z), addedge(y, x, 0)
using namespace std;
typedef long long ll;... | #include <bits/stdc++.h>
#define to edge[i].v
#define mp make_pair
#define rint register int
#define debug(x) cerr << #x << "=" << x << endl
#define fgx cerr << "-------------" << endl
#define N 200010
#define T n + n + 1
#define add(x, y, z) addedge(x, y, z), addedge(y, x, 0)
using namespace std;
typedef long long ll;... | replace | 6 | 7 | 6 | 7 | 0 | |
p03205 | C++ | Runtime Error | #include <bits/stdc++.h>
#define il inline
using namespace std;
const int N = 1e5 + 5, M = 2e6;
int n, m, e, S, T, h, t, q[N], lev[N], ax[N], ay[N], o[N];
int to[M], nx[M], cap[M], hd[N], it[N], sze = 1;
std::vector<int> g[N];
il void add(int u, int v, int c) {
to[++sze] = v, nx[sze] = hd[u], cap[sze] = c, hd[u] = ... | #include <bits/stdc++.h>
#define il inline
using namespace std;
const int N = 2e5 + 5, M = 2e6;
int n, m, e, S, T, h, t, q[N], lev[N], ax[N], ay[N], o[N];
int to[M], nx[M], cap[M], hd[N], it[N], sze = 1;
std::vector<int> g[N];
il void add(int u, int v, int c) {
to[++sze] = v, nx[sze] = hd[u], cap[sze] = c, hd[u] = ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03205 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
#define FILL(a, n, x) memset((a), (x), sizeof((a)[0]) * (n))
#define FILLA(a, x) memset((a), (x), sizeof(a))
#define COPY(a, n, b) memcpy((b), (a), sizeof((a)[0]) * (n))
#define COPYA(a, b) memcpy((b), (a), sizeof(a))
type... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
#define FILL(a, n, x) memset((a), (x), sizeof((a)[0]) * (n))
#define FILLA(a, x) memset((a), (x), sizeof(a))
#define COPY(a, n, b) memcpy((b), (a), sizeof((a)[0]) * (n))
#define COPYA(a, b) memcpy((b), (a), sizeof(a))
type... | replace | 50 | 51 | 50 | 51 | 0 | |
p03205 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int n, S, T, d[100010], ans, a[100010], b[100010];
vector<int> v[100010];
int cnt = 1, head[200010], to[800010], nxt[800010], w[800010];
bool used[100010];
void add(int x, int y, int z) {
cnt++;
to[cnt] = y;
nxt[cnt] = head[x];
head[x] = cnt;
... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int n, S, T, d[200010], ans, a[100010], b[100010];
vector<int> v[100010];
int cnt = 1, head[200010], to[800010], nxt[800010], w[800010];
bool used[100010];
void add(int x, int y, int z) {
cnt++;
to[cnt] = y;
nxt[cnt] = head[x];
head[x] = cnt;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03205 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 200005, S = 0, T = 200000;
struct node {
int to, next, val;
} e[N << 4];
int head[N], cnt, dep[N], q[N], c[N], n;
void add(int x, int y, int z) {
e[cnt] = (node){y, head[x], z};
head[x] = cnt++;
}
void insert(int x, int y, int z) { add(x, y, z), add(y, x... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005, S = 0, T = 200000;
struct node {
int to, next, val;
} e[N << 4];
int head[N], cnt, dep[N], q[N], c[N], n;
void add(int x, int y, int z) {
e[cnt] = (node){y, head[x], z};
head[x] = cnt++;
}
void insert(int x, int y, int z) { add(x, y, z), add(y, x... | insert | 42 | 42 | 42 | 44 | TLE | |
p03205 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iterator>
#include <vector>
using namespace std;
struct R {
int v, z, c;
} e[1111111];
int K[222222], cur[222222], ce = 1;
void ins(int a, int b, int c) {
e[++ce] = (R){b, K[a], c};
K[a] = ce;
}
void AE(int a, int b) {
ins... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iterator>
#include <vector>
using namespace std;
struct R {
int v, z, c;
} e[1111111];
int K[222222], cur[222222], ce = 1;
void ins(int a, int b, int c) {
e[++ce] = (R){b, K[a], c};
K[a] = ce;
}
void AE(int a, int b) {
ins... | replace | 61 | 62 | 61 | 62 | 0 | |
p03205 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <vector>
#define MN 200010
#define MM 800010
#define inf 999999999
using namespace std;
int fr[MN], dy[MN], ne[MM], v[MM], w[MM], bs = 0;
void add(int a, int b, int c) {
v[bs] = b;
w[bs] = c;
ne[bs] = fr[a];
fr[a] = bs++;
}
void addb(int a, int b, int c) {
add(a, b, c);
add(b, a,... | #include <stdio.h>
#include <vector>
#define MN 200010
#define MM 800010
#define inf 999999999
using namespace std;
int fr[MN], dy[MN], ne[MM], v[MM], w[MM], bs = 0;
void add(int a, int b, int c) {
v[bs] = b;
w[bs] = c;
ne[bs] = fr[a];
fr[a] = bs++;
}
void addb(int a, int b, int c) {
add(a, b, c);
add(b, a,... | replace | 17 | 19 | 17 | 19 | TLE | |
p03205 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
int n, m;
vector<int> hv[200005];
struct edge {
int to, cap, re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
int n, m;
vector<int> hv[200005];
struct edge {
int to, cap, re... | replace | 14 | 15 | 14 | 15 | 0 | |
p03205 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5, inf = 1e9;
int n, tot, ter[maxn + 3], wei[maxn + 3], nxt[maxn + 3], lnk[maxn + 3];
int cur[maxn + 3], dep[maxn + 3], num[maxn + 3], ans[maxn + 3];
bool vis[maxn + 3];
vector<int> S[maxn + 3], V[maxn + 3], G[maxn + 3];
int adj(int x) { return x & 1 ? ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6, inf = 1e9;
int n, tot, ter[maxn + 3], wei[maxn + 3], nxt[maxn + 3], lnk[maxn + 3];
int cur[maxn + 3], dep[maxn + 3], num[maxn + 3], ans[maxn + 3];
bool vis[maxn + 3];
vector<int> S[maxn + 3], V[maxn + 3], G[maxn + 3];
int adj(int x) { return x & 1 ? ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03205 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (;... | replace | 23 | 24 | 23 | 24 | 0 | |
p03205 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int INF = 1e9;
struct Edge {
int u, v, cap, flow;
};
namespace Max_flow {
vector<Edge> E;
vector<int> G[N];
int S, T, n, d[N];
void init(int _n, int _s, int _t) {
n = _n, S = _s, T = _t;
for (int i = 0; i <= n; i++)
G[i].clear(... | #include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const int INF = 1e9;
struct Edge {
int u, v, cap, flow;
};
namespace Max_flow {
vector<Edge> E;
vector<int> G[N];
int S, T, n, d[N];
void init(int _n, int _s, int _t) {
n = _n, S = _s, T = _t;
for (int i = 0; i <= n; i++)
G[i].clear(... | replace | 4 | 5 | 4 | 5 | 0 | |
p03205 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int n, lk[maxn + 10], vis[maxn + 10], clk;
int l[maxn + 10], r[maxn + 10];
vector<int> g[maxn + 10];
bool dfs(int p) {
for (int i = 0; i < (int)g[p].size(); ++i) {
int e = g[p][i];
if (vis[e] != clk) {
vis[e] = clk;
if (!lk[e] ||... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5;
int n, lk[maxn + 10], vis[maxn + 10], clk;
int l[maxn + 10], r[maxn + 10];
vector<int> g[maxn + 10];
bool dfs(int p) {
for (int i = 0; i < (int)g[p].size(); ++i) {
int e = g[p][i];
if (vis[e] != clk) {
vis[e] = clk;
if (!lk[e] ||... | insert | 44 | 44 | 44 | 46 | TLE | |
p03205 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, p[max_n], nxt[max_n], used[max_n], ans[max_n];
int cur;
vector<int> g[max_n], g2[max_n];
bool dfs(int v) {
if (used[v] == cur) {
return false;
}
used[v] = cur;
for (int to : g[v]) {
if (p[to] == -1 || df... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, p[max_n], nxt[max_n], used[max_n], ans[max_n];
int cur;
vector<int> g[max_n], g2[max_n];
bool dfs(int v) {
if (used[v] == cur) {
return false;
}
used[v] = cur;
for (int to : g[v]) {
if (p[to] == -1 || df... | replace | 51 | 53 | 51 | 64 | TLE | |
p03205 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 201000;
int chosen[N];
namespace MF {
struct Edge {
int v, flow, ne;
} e[N << 3];
int fi[N], tot, S, T, V, cur[N], dis[N], q[N];
void Init(int s, int t, int v) {
S = s;
T = t;
V = v;
tot = 1;
for (int i = 0; i < V; i++) {
fi[i] = 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
const int N = 201000;
int chosen[N];
namespace MF {
struct Edge {
int v, flow, ne;
} e[N << 3];
int fi[N], tot, S, T, V, cur[N], dis[N], q[N];
void Init(int s, int t, int v) {
S = s;
T = t;
V = v;
tot = 1;
for (int i = 0; i < V; i++) {
fi[i] = 0;
}
}
... | replace | 95 | 96 | 95 | 96 | TLE | |
p03206 | Python | Runtime Error | s = int(input)
if s == 22:
print("Christmas Eve Eve Eve")
if s == 23:
print("Christmas Eve Eve")
if s == 24:
print("Christmas Eve")
if s == 25:
print("Christmas")
| s = int(input())
if s == 22:
print("Christmas Eve Eve Eve")
if s == 23:
print("Christmas Eve Eve")
if s == 24:
print("Christmas Eve")
if s == 25:
print("Christmas")
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03206/Python/s541869147.py", line 1, in <module>
s = int(input)
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'
|
p03206 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int n;
while (scanf("%d", &n)) {
if (n == 25)
printf("Christmas\n");
if (n == 24)
printf("Christmas Eve\n");
if (n == 23)
printf("Christmas Eve Eve\n");
if (n == 22)
printf("Christmas Eve Eve Eve\n");
}
return 0;
} | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
if (n == 25)
printf("Christmas\n");
if (n == 24)
printf("Christmas Eve\n");
if (n == 23)
printf("Christmas Eve Eve\n");
if (n == 22)
printf("Christmas Eve Eve Eve\n");
return 0;
} | replace | 3 | 13 | 3 | 14 | TLE | |
p03206 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
int main() {
int d;
while (scanf("%d", &d)) {
if (d == 25)
printf("Christmas\n");
else if (d == 24)
printf("Christmas Eve\n");
else if (d == 23)
printf("Christmas Eve Eve\n");
else if (d == 22)
printf("Christmas Eve Eve Eve\n");
}
}
| #include <stdio.h>
#include <stdlib.h>
int main() {
int d;
scanf("%d", &d);
if (d == 25)
printf("Christmas\n");
else if (d == 24)
printf("Christmas Eve\n");
else if (d == 23)
printf("Christmas Eve Eve\n");
else if (d == 22)
printf("Christmas Eve Eve Eve\n");
}
| replace | 5 | 15 | 5 | 15 | TLE | |
p03206 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
string ans = "Christmas";
while (d < 25) {
ans += " Eve";
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int d;
cin >> d;
string ans = "Christmas";
while (d++ < 25) {
ans += " Eve";
}
cout << ans << endl;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p03206 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<string> word;
word.push_back("Christmas");
if (a == 25) {
cout << word[0];
}
if (a < 25) {
for (int i = 25; i > a; i--) {
word.push_back(" Eve");
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
cin >> a;
vector<string> word;
word.push_back("Christmas");
if (a == 25) {
cout << word[0];
}
if (a < 25) {
for (int i = 25; i > a; i--) {
word.push_back(" Eve");
}
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03206 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << "Christmas" << endl;
for (int i = 25; i != N; i++) {
cout << " "
<< "Eve" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << "Christmas" << endl;
for (int i = 25; i != N; i--) {
cout << " "
<< "Eve" << endl;
}
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p03206 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int d;
cin >> d;
string a[4] = {"Christmas Eve Eve Eve", "Christmas Eve Eve", "Christmas Eve",
"Christmas"};
cout << a[d - 23] << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int d;
cin >> d;
string a[4] = {"Christmas Eve Eve Eve", "Christmas Eve Eve", "Christmas Eve",
"Christmas"};
cout << a[d - 22] << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p03206 | Python | Runtime Error | def solve():
d = int(input())
eves = 25 - d
return "Christmas" + " Eve" + eves
if __name__ == "__main__":
print(solve())
| def solve():
d = int(input())
eves = 25 - d
return "Christmas" + " Eve" * eves
if __name__ == "__main__":
print(solve())
| replace | 3 | 4 | 3 | 4 | TypeError: can only concatenate str (not "int") to str | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03206/Python/s602998179.py", line 8, in <module>
print(solve())
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03206/Python/s602998179.py", line 4, in solve
return "Christmas" + " Ev... |
p03206 | Python | Runtime Error | print(f"Christmas {' '.join(['Eve'] * (25 - int(input())))}".strip())
| print("Christmas {}".format(" ".join(["Eve"] * (25 - int(input())))).strip())
| replace | 0 | 1 | 0 | 1 | 0 | |
p03206 | Python | Runtime Error | #!/usr/bin/env python
# -*- coding: utf-8 -*-
al = [0, 5] + [0] * 49
bl = [0, 3] + [0] * 49
def solve2(ans, x, idx, cnt):
if idx == 1:
return ans + (0, 0, 1, 2, 3, 3, 3)[x] + [0, 1][cnt >= 1]
if x == (al[idx] // 2) + 1:
return ans + bl[idx - 1] + 1 + [0, 1][cnt >= 1]
elif x > (al[idx] // ... | print("Christmas" + (" Eve" * (25 - int(input()))))
| replace | 0 | 30 | 0 | 1 | ValueError: not enough values to unpack (expected 2, got 1) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03206/Python/s885341771.py", line 30, in <module>
solve()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03206/Python/s885341771.py", line 21, in solve
n, x = map(int, input().split(... |
p03206 | Python | Runtime Error | D = int(input)
print("Christmas" + " Eve" * (25 - D))
| D = int(input())
print("Christmas" + " Eve" * (25 - D))
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03206/Python/s854854149.py", line 1, in <module>
D = int(input)
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'builtin_function_or_method'
|
p03207 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | insert | 38 | 38 | 38 | 39 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03207 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x;... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using i64 = int64_t;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, x, n) for (int i = x;... | replace | 19 | 20 | 19 | 20 | -11 | |
p03207 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#includ... | insert | 39 | 39 | 39 | 40 | 0 | |
p03207 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
// cant wait for holiday
// string days[7] ={"SUN","MON","TUE","WED","THU","FRI","SAT"};
// string s;
// int n;
// cin>> s;
// for (int i = 0; i< 7; i++){
// if (s== days[i]){
// n = i;
/... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
// cant wait for holiday
// string days[7] ={"SUN","MON","TUE","WED","THU","FRI","SAT"};
// string s;
// int n;
// cin>> s;
// for (int i = 0; i< 7; i++){
// if (s== days[i]){
// n = i;
/... | replace | 16 | 17 | 16 | 17 | 0 | |
p03207 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) { cin >> p[i]; }
... | replace | 14 | 21 | 14 | 16 | TLE | |
p03207 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(n);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec.at(i);
}
sum = ... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec.at(i);
}
sum = ... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p03207 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | replace | 28 | 29 | 28 | 29 | -11 | |
p03207 | Python | Runtime Error | N = int(input())
p = [int(input()) for _ in N]
print(sum(p) - max(p) // 2)
| N = int(input())
p = [int(input()) for _ in range(N)]
print(sum(p) - max(p) // 2)
| replace | 1 | 2 | 1 | 2 | TypeError: 'int' object is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03207/Python/s805819022.py", line 2, in <module>
p = [int(input()) for _ in N]
TypeError: 'int' object is not iterable
|
p03207 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <i... | insert | 58 | 58 | 58 | 59 | -11 | |
p03207 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> value;
for (int i = 0; i < n; i++) {
cin >> value[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max < value[i])
max = value[i];
}
int sum = 0;
for (int i = 0; i < n; i++)... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> value(10, 0);
for (int i = 0; i < n; i++) {
cin >> value[i];
}
int max = 0;
for (int i = 0; i < n; i++) {
if (max < value[i])
max = value[i];
}
int sum = 0;
for (int i = 0; i < ... | replace | 7 | 8 | 7 | 8 | -11 | |
p03207 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); ++(i))
#define repr(i, n) for ((i) = (n); (i) > 0; == (i))
#define FOR(i, j, n) for ((i) = (j); (i) < (n); ++(i))
#define forr(i, j, n) for ((i) = (j); (i) > (n); --(i))
#define debg(a) cout << (a) << endl;
#define INF 9999999
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for ((i) = 0; (i) < (n); ++(i))
#define repr(i, n) for ((i) = (n); (i) > 0; == (i))
#define FOR(i, j, n) for ((i) = (j); (i) < (n); ++(i))
#define forr(i, j, n) for ((i) = (j); (i) > (n); --(i))
#define debg(a) cout << (a) << endl;
#define INF 9999999
#de... | replace | 18 | 19 | 18 | 19 | 0 | |
p03207 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long Int;
int main() {
priority_queue<int> pque;
int n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pque.push(a);
}
int ans = pque.top();
pque.pop();
ans /= 2;
w... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long Int;
int main() {
priority_queue<int> pque;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pque.push(a);
}
int ans = pque.top();
pque.pop();
a... | insert | 10 | 10 | 10 | 11 | 0 | |
p03207 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define INF 999999999
typedef long long int Int;
using ll = long long;
using VI = vector<int>;
int main() {
int n;... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define INF 999999999
typedef long long int Int;
using ll = long long;
using VI = vector<int>;
int main() {
int n;... | replace | 13 | 25 | 13 | 20 | -11 | |
p03207 | Python | Runtime Error | N = input()
p = [int(input()) for i in range(N)]
print(sum(p) - max(p) // 2)
| N = int(input())
p = [int(input()) for i in range(N)]
print(sum(p) - max(p) // 2)
| replace | 0 | 1 | 0 | 1 | TypeError: 'str' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03207/Python/s736160846.py", line 2, in <module>
p = [int(input()) for i in range(N)]
TypeError: 'str' object cannot be interpreted as an integer
|
p03207 | C++ | Runtime Error | /* mytemplate.cpp {{{ */
/* header */
#include <bits/stdc++.h>
using namespace std;
/* rep */
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1... | /* mytemplate.cpp {{{ */
/* header */
#include <bits/stdc++.h>
using namespace std;
/* rep */
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1... | replace | 168 | 169 | 168 | 169 | -11 | |
p03207 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
p.at(0) /= 2;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += p.at(i);
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
p.at(0) /= 2;
int sum = 0;
for (int i = 0; i < N; i++) {
sum += p.at(i);
}
cout << sum;
}
| insert | 5 | 5 | 5 | 6 | 0 | |
p03207 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> K;
for (int i = 0; i < N; i++) {
cin >> K.at(i);
}
sort(K.begin(), K.end());
K.at(N - 1) /= 2;
int H = 0;
for (int i = 0; i < N; i++) {
H += K.at(i);
}
cout << H << e... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> K(N);
for (int i = 0; i < N; i++) {
cin >> K.at(i);
}
sort(K.begin(), K.end());
K.at(N - 1) /= 2;
int H = 0;
for (int i = 0; i < N; i++) {
H += K.at(i);
}
cout << H <... | replace | 7 | 8 | 7 | 8 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03207 | C++ | Runtime Error | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | // AUTHOR:BlackBox Inc.//
#include <bits/stdc++.h>
#include <tr1/unordered_map>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define endl "\n"
#define vpii vector<pair<int, int>>
#define vs vector<s... | delete | 46 | 50 | 46 | 46 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03208 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define r... |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define r... | replace | 37 | 40 | 37 | 38 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> h;
long long l;
for (int i = 0; i < n; i++) {
cin >> l;
h.push... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> h;
long long l;
for (int i = 0; i < n; i++) {
cin >> l;
h.push... | replace | 22 | 23 | 22 | 23 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n... | delete | 17 | 21 | 17 | 17 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 15;
int n, k, a[N], ans;
int main() {
ios::sync_with_stdio(false);
ans = 0x3f3f3f3f;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n - k + 1; ++i)
ans = min(ans, a[i + k - 1] - a[i]);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k, a[N], ans;
int main() {
ios::sync_with_stdio(false);
ans = 0x3f3f3f3f;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> a[i];
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n - k + 1; ++i)
ans = min(ans, a[i + k - 1] - a[... | replace | 2 | 3 | 2 | 3 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (auto &&e : h)
cin >> e;
sort(h.begin(), h.end());
vector<int> c(n - (k - 1));
for (int i = 0; i + k <= n; ++i) {
for (int j = 1; j < k; ++j) {
c[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (auto &&e : h)
cin >> e;
sort(h.begin(), h.end());
vector<int> c(n - (k - 1));
for (int i = 0; i + k <= n; ++i)
c[i] = h[i + (k - 1)] - h[i];
sort(c.... | replace | 18 | 23 | 18 | 20 | TLE | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string, int> ii;
string IntToStr(int tmp) {
ostringstream out;
out << tmp;
return out.str();
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v;
while (n... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string, int> ii;
string IntToStr(int tmp) {
ostringstream out;
out << tmp;
return out.str();
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v;
while (n... | replace | 25 | 26 | 25 | 26 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
const int max_n = 1e6;
ll h[max_n];
void solve() {
ll mi = 1e10;
for (int i = 0; i < n; i++) {
ll mmi = 1e10;
ll mma = -1;
for (int j = i; j < i + k; j++) {
mmi = min(mmi, h[j]);
mma = max(mma, h[j]);
}
mi ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
const int max_n = 1e6;
ll h[max_n];
void solve() {
ll mi = 1e10;
for (int i = 0; i <= n - k; i++) {
ll mma = h[i + k - 1];
ll mmi = h[i];
mi = min(mi, mma - mmi);
}
cout << mi << endl;
}
int main() {
cin >> n >> k;
fo... | replace | 8 | 15 | 8 | 11 | TLE | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int m... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n; soeji--)
int m... | replace | 31 | 36 | 31 | 39 | TLE | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[10000], ans = 2000000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, a[i + k - 1] - a[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a[100000], ans = 2000000000;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, a[i + k - 1] - a[i]);
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ... | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ... | replace | 34 | 35 | 34 | 35 | 0 | |
p03208 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long inf = numeric_limit... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long inf = numeric_limit... | replace | 19 | 21 | 19 | 21 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | replace | 40 | 42 | 40 | 41 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#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;
int ans = 0;
vector<int> ps = {3, 5, 7};
ll N;
v... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#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;
int ans = 0;
vector<int> ps = {3, 5, 7};
ll N;
v... | replace | 41 | 46 | 41 | 44 | TLE | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define mod 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define mod 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#defi... | replace | 39 | 45 | 39 | 40 | TLE | |
p03208 | C++ | Runtime Error |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <algorithm>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inclu... |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <algorithm>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inclu... | replace | 40 | 41 | 40 | 41 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int K, N;
vector<ll> min_list;
int main() {
scanf("%d%d", &N, &K);
ll h[N];
rep(i, N) { scanf("%lld", &h[i]); }
sort(h, h + N);
for (int i = 0; i < N - K + 1; i+... | #include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int K, N;
vector<ll> min_list;
int main() {
scanf("%d%d", &N, &K);
ll h[N];
rep(i, N) { scanf("%lld", &h[i]); }
sort(h, h + N);
for (int i = 0; i < N - K + 1; i+... | replace | 17 | 22 | 17 | 19 | TLE | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
vector<int> j(N - K + 1);
for (int i = 0; i < N - K + 1; i++) {
j[i] = j[i + K - 1] - j[i];
}
sort(j.begin(), j.end())... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
vector<int> j(N - K + 1);
for (int i = 0; i < N - K + 2; i++) {
j[i] = h[i + K - 1] - h[i];
}
sort(j.begin(), j.end())... | replace | 12 | 14 | 12 | 14 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin... | replace | 26 | 38 | 26 | 31 | TLE | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) ... | insert | 80 | 80 | 80 | 82 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
long long h[11000];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h, h + N);
long long min = 1000000000;
for (int i = 0; i + K - 1 < N; i++) {
if (h[i + K ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int K, N;
cin >> N >> K;
long long h[110000];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h, h + N);
long long min = 1000000000;
for (int i = 0; i + K - 1 < N; i++) {
if (h[i + K... | replace | 8 | 9 | 8 | 9 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
ll a[1005];
int Min = 0x3f3f3f3f;
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (int i = ... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int a[100005];
int Min = 0x3f3f3f3f;
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (int i... | replace | 7 | 8 | 7 | 8 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(all(h));
se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(all(h));
se... | replace | 16 | 17 | 16 | 17 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
long min = 10000000000000;
cin >> N;
cin >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin()... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
long min = 10000000000000;
cin >> N;
cin >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin()... | replace | 22 | 23 | 22 | 23 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const int INF = 1 << 30;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.b... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const int INF = 1 << 30;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.b... | replace | 19 | 20 | 19 | 20 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
std::vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
std::sort(h.begin(), h.end());
int min = h.at(n - 1);
for (int i = 0; i < n - (k - ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
std::vector<int> h;
for (int i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
h.push_back(tmp);
}
std::sort(h.begin(), h.end());
int min = h.at(n - 1);
for (int i = 0; i < n - (k - ... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 7) >= this->size() (which is 5)
|
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <c... | replace | 19 | 20 | 19 | 20 | 0 | |
p03208 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2,tune=native")
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (auto &i : h)
cin >> i;
sort(h.begin(), h.end());
int... | #pragma GCC optimize("Ofast")
#pragma GCC target("tune=native")
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (auto &i : h)
cin >> i;
sort(h.begin(), h.end());
int res ... | replace | 1 | 2 | 1 | 2 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h.begin(), h.end());
long long ans = INF;
for (int i = 0; i <= N - K; i++) {
ans = min(ans, h[i - K + 1] - ... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h.begin(), h.end());
long long ans = INF;
for (int i = 0; i <= N - K; i++) {
ans = min(ans, h[i + K - 1] - ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03208 | C++ | Runtime Error | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include... | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include... | replace | 94 | 95 | 94 | 95 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | replace | 27 | 28 | 27 | 28 | 0 | |
p03208 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end()... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end()... | replace | 19 | 20 | 19 | 20 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++... | replace | 23 | 24 | 23 | 24 | -11 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, k;
cin >> n >> k;
ll h[n];
rep(i, n) { cin >> h[i]; }
sort(h, h + n);
ll diff = 10000000;
rep(i, n) { diff = min(h[i + k - 1] - h[i], diff); }
cout << diff << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int n, k;
cin >> n >> k;
ll h[n];
rep(i, n) { cin >> h[i]; }
sort(h, h + n);
ll diff = 10000000000;
rep(i, n) {
if (i + k - 1 == n)
break;
diff = min(h[i + k... | replace | 14 | 16 | 14 | 20 | 0 | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h.at(i);
}
std::sort(h.begin(), h.end());
int min = 1000000000;
for (int i = 0; i < N + K - 1; i++) {
int temp = h.at(i + K - 1)... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h.at(i);
}
std::sort(h.begin(), h.end());
int min = 1000000000;
for (int i = 0; i < N - K + 1; i++) {
int temp = h.at(i + K - 1)... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p03208 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
vector<int> c(n);
rep(i, 0, n) ... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
vector<int> c(n);
rep(i, 0, n) ... | replace | 17 | 19 | 17 | 19 | 0 | |
p03208 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int compare_lld(const void *a, const void *b) {
long long int *A = (long long int *)a;
long long int *B = (long long int *)b;
if (*A > *B)
return 1;
if (*A < *B)
return -1;
return 0;
}
int main() {
long long int n, k, i;
scanf("%lld", &n... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int compare_lld(const void *a, const void *b) {
long long int *A = (long long int *)a;
long long int *B = (long long int *)b;
if (*A > *B)
return 1;
if (*A < *B)
return -1;
return 0;
}
int main() {
long long int n, k, i;
scanf("%lld", &n... | replace | 25 | 26 | 25 | 26 | 0 | |
p03208 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | replace | 143 | 144 | 143 | 149 | 0 | |
p03208 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
ll x, y, z, l, m, n, r, q, k;
// 0 1 2 3 4 5 6 n = 7;
void solve() {
cin >> n >> k;
ll a[1000];
for (int i = 0; i < n; i++)
cin >> a[i];
ll md = INT_MAX;
sort(a, a + n);... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
ll x, y, z, l, m, n, r, q, k;
// 0 1 2 3 4 5 6 n = 7;
void solve() {
cin >> n >> k;
ll a[100000];
for (int i = 0; i < n; i++)
cin >> a[i];
ll md = INT_MAX;
sort(a, a + n... | replace | 11 | 12 | 11 | 12 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
int diff = INT_MAX;
for (int i = 0; i < n; i++) {
diff = min(diff, v[i + k - 1] - v[i]);
}
cout << d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
int diff = INT_MAX;
for (int i = 0; i <= n - k; i++) {
diff = min(diff, v[i + k - 1] - v[i]);
}
cout... | replace | 14 | 15 | 14 | 15 | 0 | |
p03208 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fst first
#define snd second
#define rep(n) for (lint I = 0; (I) < (lint)(n); ++(I))
#define repeat(i, n) for (lint i = 0; (i) < (lint)(n); ++(i))
#define repeat_to(i, n) for (lint i = 0; (i) <= (lint)(n); ++(i))
#define repeat_from(i, m, n) for (lint i = (m); (i) < (lint)(n); ++(i))
#d... | #include <bits/stdc++.h>
#define fst first
#define snd second
#define rep(n) for (lint I = 0; (I) < (lint)(n); ++(I))
#define repeat(i, n) for (lint i = 0; (i) < (lint)(n); ++(i))
#define repeat_to(i, n) for (lint i = 0; (i) <= (lint)(n); ++(i))
#define repeat_from(i, m, n) for (lint i = (m); (i) < (lint)(n); ++(i))
#d... | replace | 33 | 35 | 33 | 35 | 0 | |
p03208 | C++ | Time Limit Exceeded | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#defin... | // lcmとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF 1001001001
#define ll long long
#define ln cout << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define double long double
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#defin... | replace | 30 | 36 | 30 | 31 | TLE | |
p03208 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
using namespace std;
int abs(int n) { return n >= 0 ? n : -n; }
int main() {
int n, k;
int h[10000];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
sort(h, h + n);
int min = 1000000000;
for (int i = 0; i < n - k + 1; i++) {
if (min... | #include <algorithm>
#include <stdio.h>
using namespace std;
int abs(int n) { return n >= 0 ? n : -n; }
int main() {
int n, k;
int h[100000];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
sort(h, h + n);
int min = 1000000000;
for (int i = 0; i < n - k + 1; i++) {
if (mi... | replace | 8 | 9 | 8 | 9 | 0 | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
ll ans = 1e9 + 1;
for (int i = 0; i < n - k + 1; i++) {
ll hmin = 1e9 + 1;
ll hmax = -1;
for (int j = i; j < i + k; j+... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
ll ans = 1e9 + 1;
for (int i = 0; i < n; i++) {
if (i + k - 1 > n - 1)
continue;
ll tmp = h[i + k - 1] - h[i];
a... | replace | 12 | 20 | 12 | 17 | TLE | |
p03208 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
#define SORT(x, n) sort(x, x)
#define P pair<int... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n); (i) >= 0; (i)--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
#define SORT(x, n) sort(x, x)
#define P pair<int... | replace | 25 | 34 | 25 | 26 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.