problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template <typename T1, typename T2> inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2> inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
namespace ae86 {
const int bufl = 1 << ... | [] | 996,087 | 996,088 | u326034736 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
ll n;
vector<ll> vec;
bool judge(ll x) {
map<ll, ll> mp;
for (int i = 1; i < n; i++) {
if (vec[i - 1] >= vec[i]) {
if (mp.find(vec[i]) == mp.end())
mp[vec[i]] = 1;
else
mp[vec[i]]++;
auto itr = m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
ll n;
vector<ll> vec;
bool judge(ll x) {
map<ll, ll> mp;
for (int i = 1; i < n; i++) {
if (vec[i - 1] >= vec[i]) {
if (mp.find(vec[i]) == mp.end())
mp[vec[i]] = 1;
else
mp[vec[i]]++;
auto itr = m... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,089 | 996,090 | u440213743 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int n, a[N], l, r, t;
vector<int> p, q;
bool C(int k) {
p.clear(), q.clear();
for (int i = 2; i <= n; i++)
if (a[i] <= a[i - 1]) {
if (k == 1)
return false;
while (!p.empty() && p[p.size() - 1] > a[i])
p.pop_back(),... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1;
int n, a[N], l, r, t;
vector<int> p, q;
bool C(int k) {
p.clear(), q.clear();
for (int i = 2; i <= n; i++)
if (a[i] <= a[i - 1]) {
if (k == 1)
return false;
while (!p.empty() && p[p.size() - 1] > a[i])
p.pop_back(),... | [
"call.function.change",
"control_flow.branch.if.condition.change"
] | 996,091 | 996,092 | u638668562 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
t *= f;... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t = 0;
char ch = getchar();
int f = 1;
while ('0' > ch || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
do {
(t *= 10) += ch - '0';
ch = getchar();
} while ('0' <= ch && ch <= '9');
t *= f;... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 996,095 | 996,096 | u880862257 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
#define reps(i, s, n) for (int(i) = (s... | #include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
//#define int long long
#define reps(i, s, n) for (int(i) = (s... | [
"control_flow.branch.if.condition.change"
] | 996,099 | 996,100 | u065125881 | cpp |
p03203 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDO... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDO... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 996,101 | 996,102 | u240776358 | cpp |
p03203 | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define umax(x, y) x = max(x, y)
#define umin(x, y) x = min(x, y)
#define ll long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair<ii, ii>
#define sz(x) ((int)x.size())
#... | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define umax(x, y) x = max(x, y)
#define umin(x, y) x = min(x, y)
#define ll long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair<ii, ii>
#define sz(x) ((int)x.size())
#... | [
"expression.unary.arithmetic.add"
] | 996,107 | 996,108 | u918828564 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 996,113 | 996,114 | u962966398 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)(a); i <= (sign)(b); ++i)
#define Fordown(i, a, b) for (register sign i = (sign)(a); i >= (sign)(b); --i)
const int N = 2e5 + 5;
template <typename T> bool cmax(T &a, T b) { return (a ... | [
"expression.operation.binary.remove"
] | 996,115 | 996,116 | u332108407 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define SIZE(a) ll(a.size())
#define vll ... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define SIZE(a) ll(a.size())
#define vll ... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,138 | 996,139 | u834354741 | cpp |
p03203 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
void min_u(int &m, int v) {
if (m > v)
m = v;
}
int main(void) {
int h, w, n;
while (scanf("%d%d%d", &h, &w, &n) == 3) {
vll b(n);... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using vll = vector<ll>;
void min_u(int &m, int v) {
if (m > v)
m = v;
}
int main(void) {
int h, w, n;
while (scanf("%d%d%d", &h, &w, &n) == 3) {
vll b(n);... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,145 | 996,146 | u565795452 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define rep(it, st, en) for (int it = (st); it < (int)(en); ++it)
#define all(c) (c).begin(), (c).end()
#define debug(x) cerr << #x << " = " << x << endl
#define eb emplace_back
#define X first
#define Y second
typedef long long int ll;
typedef long double ld;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(it, st, en) for (int it = (st); it < (int)(en); ++it)
#define all(c) (c).begin(), (c).end()
#define debug(x) cerr << #x << " = " << x << endl
#define eb emplace_back
#define X first
#define Y second
typedef long long int ll;
typedef long double ld;
typedef vecto... | [
"expression.operation.binary.remove"
] | 996,147 | 996,148 | u038861804 | cpp |
p03203 | #include <algorithm>
#include <iostream>
using namespace std;
const int MAX = 200000;
int main() {
int H, W, N, diff = 0;
static pair<int, int> point[MAX];
cin >> H >> W >> N;
for (int i = 0; i < N; ++i)
cin >> point[i].first >> point[i].second;
sort(point, point + N);
for (int i = 0; i < N; ++i) {
... | #include <algorithm>
#include <iostream>
using namespace std;
const int MAX = 200000;
int main() {
int H, W, N, diff = 0;
static pair<int, int> point[MAX];
cin >> H >> W >> N;
for (int i = 0; i < N; ++i)
cin >> point[i].first >> point[i].second;
sort(point, point + N); // X昇順、同値ならY昇順
for (int i = 0; i ... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"io.output.change"
] | 996,153 | 996,154 | u550314572 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int H, W, N;
cin >> H >> W >> N;
map<P, int> mp;
vector<vector<int>> g(H);
for (int i = 0; i < N; i++) {
int X, Y;
cin >> X >> Y, X--, Y--;
g[X].push_back(Y);
mp[{X, Y}] = 1;
}
for (int x = 0; x <= H; x++... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int H, W, N;
cin >> H >> W >> N;
map<P, int> mp;
vector<vector<int>> g(H + 1);
for (int i = 0; i < N; i++) {
int X, Y;
cin >> X >> Y, X--, Y--;
g[X].push_back(Y);
mp[{X, Y}] = 1;
}
for (int x = 0; x <= H;... | [
"assignment.change"
] | 996,155 | 996,156 | u858748695 | cpp |
p03203 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
/////////////////////////////////////////////////////
#define pii pair<int, int>
#define mkp make_pair
int H, W, N, X[202020], Y[202020];
vector<pii> XYv;
int wall[202020];
int i, j, h;
int main() {
... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
/////////////////////////////////////////////////////
#define pii pair<int, int>
#define mkp make_pair
int H, W, N, X[202020], Y[202020];
vector<pii> XYv;
int wall[202020];
int i, j, h;
int main() {
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 996,159 | 996,160 | u259396003 | cpp |
p03203 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
/////////////////////////////////////////////////////
#define pii pair<int, int>
#define mkp make_pair
int H, W, N, X[202020], Y[202020];
vector<pii> XYv;
int wall[202020];
int i, j, h;
int main() {
... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
/////////////////////////////////////////////////////
#define pii pair<int, int>
#define mkp make_pair
int H, W, N, X[202020], Y[202020];
vector<pii> XYv;
int wall[202020];
int i, j, h;
int main() {
... | [
"control_flow.loop.condition.change",
"call.add",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 996,161 | 996,160 | u259396003 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int H, W;
int N;
cin >> H >> W >> N;
vector<int> wall[200002];
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
wall[x].push_back(y);
}
wall[W + 1].push_back(1);
int y = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int H, W;
int N;
cin >> H >> W >> N;
vector<int> wall[200002];
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
wall[x].push_back(y);
}
wall[H + 1].push_back(1);
int y = ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 996,166 | 996,167 | u726604439 | cpp |
p03203 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
#define sz(a) ((int)(a).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
const int N = (int)3e5 + 10;
int h, w, n, x, y;
vector<int> bad[N];
int main() {
scanf("%d%d%d"... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
#define sz(a) ((int)(a).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
const int N = (int)3e5 + 10;
int h, w, n, x, y;
vector<int> bad[N];
int main() {
scanf("%d%d%d"... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 996,175 | 996,176 | u139404905 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, N;
cin >> H >> W >> N;
vector<int> x(N), y(N), idxs(N), memo(H, W);
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
memo[x[i]] = min(memo[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, N;
cin >> H >> W >> N;
vector<int> x(N), y(N), idxs(N), memo(H, W);
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
x[i]--;
y[i]--;
memo[x[i]] = min(memo[... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 996,177 | 996,178 | u553623615 | cpp |
p03203 | /* --- author: dxm --- */
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define INF 1e9
#define Inf 1e18
#define rep(i, n) for (int(i) = 0; (i) < n; i++)
#define REP(i, n) for (int(i) = 1; (i) <= n; i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
typedef long... | /* --- author: dxm --- */
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define INF 1e9
#define Inf 1e18
#define rep(i, n) for (int(i) = 0; (i) < n; i++)
#define REP(i, n) for (int(i) = 1; (i) <= n; i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
typedef long... | [
"identifier.change",
"call.arguments.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 996,181 | 996,182 | u804209422 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 996,183 | 996,184 | u572665222 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 996,185 | 996,184 | u572665222 | cpp |
p03203 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<pair<int, int>> v;
REP(i, n) {
int x, y;
... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<pair<int, int>> v;
REP(i, n) {
int x, y;
... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,193 | 996,194 | u508192873 | cpp |
p03203 | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<pair<int, int>> v;
REP(i, n) {
int x, y;
... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<pair<int, int>> v;
REP(i, n) {
int x, y;
... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change"
] | 996,195 | 996,194 | u508192873 | cpp |
p03203 | #include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n... | #include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define REP(i, n) for (int i = 0; i < (n... | [
"expression.operation.binary.add"
] | 996,196 | 996,197 | u213441713 | cpp |
p03203 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, h, w;
cin >> h >> w >> n;
vector<pair<int, int>> p(n);
for (int i = ... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, h, w;
cin >> h >> w >> n;
vector<pair<int, int>> p(n);
for (int i = ... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,198 | 996,199 | u656572785 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,202 | 996,203 | u360980679 | cpp |
p03203 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,211 | 996,212 | u093922224 | cpp |
p03203 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"variable_declaration.value.change",
"identifier.change",
"expression.operation.unary.arithmetic.remove",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 996,214 | 996,212 | u093922224 | cpp |
p03203 | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | [
"variable_declaration.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,215 | 996,212 | u093922224 | cpp |
p03203 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int h, w, n;
int x[1 << 18], y[1 << 18];
pair<int, int> X[1 << 18];
main() {
cin >> h >> w >> n;
int ans = h;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
X[i] = make_pair(x[i], y[i]);
}
sort(X, X + n);
int nowx = ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int h, w, n;
int x[1 << 18], y[1 << 18];
pair<int, int> X[1 << 18];
main() {
cin >> h >> w >> n;
int ans = h;
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
X[i] = make_pair(x[i], y[i]);
}
sort(X, X + n);
int nowx = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,221 | 996,222 | u657913472 | cpp |
p03203 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | [] | 996,223 | 996,224 | u075551644 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> A;
for (int i = 0; i < N; i++) {
int X, Y;
cin >> X >> Y;
if (X >= Y) {
A.emplace_back(X, Y);
}
}
sort(A.begin(), A.end());
int k = 0;
for (auto... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> A;
for (int i = 0; i < N; i++) {
int X, Y;
cin >> X >> Y;
if (X >= Y) {
A.emplace_back(X, Y);
}
}
sort(A.begin(), A.end());
int k = 0;
for (auto... | [
"identifier.change",
"io.output.change"
] | 996,225 | 996,226 | u449722246 | cpp |
p03203 | #include <set>
#include <stdio.h>
#define MN 200000
#define mpair(a, b) std::make_pair(a, b)
int n, m, c, q[MN + 5], ans;
std::set<std::pair<int, int>> s;
bool ck(int x, int y) {
if (x > n || y > m)
return false;
return s.find(mpair(x, y)) == s.end();
}
bool down(int &x, int y) {
if (!ck(x + 1, y))
return... | #include <set>
#include <stdio.h>
#define MN 200000
#define mpair(a, b) std::make_pair(a, b)
int n, m, c, q[MN + 5], ans;
std::set<std::pair<int, int>> s;
bool ck(int x, int y) {
if (x > n || y > m)
return false;
return s.find(mpair(x, y)) == s.end();
}
bool down(int &x, int y) {
if (!ck(x + 1, y))
return... | [
"assignment.value.change",
"identifier.change"
] | 996,227 | 996,228 | u193907075 | cpp |
p03203 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int H, W, N;
cin >> H >> W;
cin >> N;
unordered_map<int, vector<i... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int H, W, N;
cin >> H >> W;
cin >> N;
unordered_map<int, vector<i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 996,236 | 996,237 | u202239169 | cpp |
p03203 | /// Kazuki Hoshino
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#def... | /// Kazuki Hoshino
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define inf 1000000000
#def... | [
"assignment.change"
] | 996,238 | 996,239 | u284140331 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ ... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,240 | 996,241 | u382880969 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ ... | [
"control_flow.loop.for.condition.change",
"variable_declaration.value.change",
"identifier.change"
] | 996,242 | 996,241 | u382880969 | cpp |
p03203 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename has_less>
using ordered_set = tree<has_less, n... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename has_less>
using ordered_set = tree<has_less, n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 996,243 | 996,244 | u134020944 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T> ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T> ... | [
"variable_declaration.name.change",
"identifier.change"
] | 996,251 | 996,252 | u260687256 | cpp |
p03203 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | [
"assignment.value.change",
"identifier.change"
] | 996,255 | 996,256 | u202928696 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<pair<int, int>> v(n);
for (auto &e : v) {
cin >> e.second >> e.first;
e.first--;
e.second--;
}
sort(begin(v), end(v));
int r = w, d = 0;
for (auto e : v) {
if (e.seco... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<pair<int, int>> v(n);
for (auto &e : v) {
cin >> e.second >> e.first;
e.first--;
e.second--;
}
sort(begin(v), end(v));
int r = h, d = 0;
for (auto e : v) {
if (e.second - e.first == d) {
... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,257 | 996,258 | u848737670 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define N 200010
int h, w, n;
vector<int> v[N];
int main() {
while (scanf("%d%d", &h, &w) != EOF) {
scanf("%d", &n);
int res = h;
for (int i = 1; i <= h; ++i)
v[i].clear();
for (int i = 1, x, y; i <= n; ++i) {
scanf("%d%d", &x, &y);
v[x... | #include <bits/stdc++.h>
using namespace std;
#define N 200010
int h, w, n;
vector<int> v[N];
int main() {
while (scanf("%d%d", &h, &w) != EOF) {
scanf("%d", &n);
int res = h;
for (int i = 1; i <= h; ++i)
v[i].clear();
for (int i = 1, x, y; i <= n; ++i) {
scanf("%d%d", &x, &y);
v[x... | [
"expression.unary.arithmetic.add"
] | 996,259 | 996,260 | u717168969 | cpp |
p03203 | #include <bits/stdc++.h>
#define inc(l, i, r) for (int i = l; i <= r; i++)
#define dec(r, i, l) for (int i = r; i >= l; i--)
#define mid ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define ___ putchar(10);
#define N 200200
using namespace std;
t... | #include <bits/stdc++.h>
#define inc(l, i, r) for (int i = l; i <= r; i++)
#define dec(r, i, l) for (int i = r; i >= l; i--)
#define mid ((l + r) >> 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int, int>
#define ___ putchar(10);
#define N 400400
using namespace std;
t... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"misc.opposites"
] | 996,265 | 996,266 | u155100236 | cpp |
p03203 | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
vector<int> pl[200009];
int main() {
int h, w, n, aom = 1;
cin >> h >> w >> n;
for (int i = 0; i < 200008; i++) {
pl[i].pb(w + 1);
}
for (int i = 0; i < 200008; i++) {
pl... | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
#define mp make_pair
using namespace std;
vector<int> pl[200009];
int main() {
int h, w, n, aom = 1;
cin >> h >> w >> n;
for (int i = 0; i < 200008; i++) {
pl[i].pb(w + 1);
}
for (int i = 0; i < 200008; i++) {
pl... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 996,267 | 996,268 | u335590796 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
vector<int> w2h[200001];
int main() {
int H, W, N;
cin >> H >> W >> N;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
w2h[y].push_back(x);
}
int ans = H, loss = 0;
for (int w = 1; w <= W; w++) {
sort(w2h[w].begin(), w2h[w].end());
... | #include <bits/stdc++.h>
using namespace std;
vector<int> w2h[200001];
int main() {
int H, W, N;
cin >> H >> W >> N;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
w2h[y].push_back(x);
}
int ans = H, loss = 0;
for (int w = 1; w <= W; w++) {
sort(w2h[w].begin(), w2h[w].end());
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 996,269 | 996,270 | u314396879 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int H, W, N;
cin >> H >> W >> N;
pair<int, int> pos[N];
for (int i = 0; i < N... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int H, W, N;
cin >> H >> W >> N;
pair<int, int> pos[N];
for (int i = 0; i < N... | [
"identifier.change",
"io.output.change"
] | 996,275 | 996,276 | u118797367 | cpp |
p03203 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#de... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#de... | [
"expression.operation.binary.remove"
] | 996,279 | 996,280 | u022317850 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int h, w, n, d;
struct A {
int x, y;
} a[MAXN];
bool CMP(A c, A d) {
if (c.x == d.x)
return c.y < d.y... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int h, w, n, d;
struct A {
int x, y;
} a[MAXN];
bool CMP(A c, A d) {
if (c.x == d.x)
return c.y < d.y... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,281 | 996,282 | u229056063 | cpp |
p03203 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int h, w, n, d;
struct A {
int x, y;
} a[MAXN];
bool CMP(A c, A d) {
if (c.x == d.x)
return c.y < d.y... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define MAXN 200005
#define MAXM
#define LL long long
#define LD long double
using namespace std;
int h, w, n, d;
struct A {
int x, y;
} a[MAXN];
bool CMP(A c, A d) {
if (c.x == d.x)
return c.y < d.y... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,283 | 996,282 | u229056063 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
int main() {
cin >> h >> w >> n;
set<pair<int, int>> s;
while (n--) {
int x, y;
cin >> x >> y;
s.insert({x, y});
}
int st = 0;
for (auto it = s.begin(); it != s.end();)
if (it->first - it->second < st)
s.erase(it++);
else i... | #include <bits/stdc++.h>
using namespace std;
int h, w, n;
int main() {
cin >> h >> w >> n;
set<pair<int, int>> s;
while (n--) {
int x, y;
cin >> x >> y;
s.insert({x, y});
}
int st = 0;
for (auto it = s.begin(); it != s.end();)
if (it->first - it->second < st)
s.erase(it++);
else i... | [
"call.remove",
"call.arguments.change"
] | 996,286 | 996,287 | u844771757 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> XY(N);
for (pair<int, int> &xy : XY)
cin >> xy.first >> xy.second;
sort(XY.begin(), XY.end());
int ans = W;
int h = 0;
for (pair<int, int> xy : XY) {
if (xy.fi... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> XY(N);
for (pair<int, int> &xy : XY)
cin >> xy.first >> xy.second;
sort(XY.begin(), XY.end());
int ans = H;
int h = 0;
for (pair<int, int> xy : XY) {
if (xy.fi... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,292 | 996,293 | u296096665 | cpp |
p03203 | #include <bits/stdc++.h>
#define pb emplace_back
#define mp make_pair
#define int long long
#define y second
#define x first
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int h;
cin >> h;
int w;
cin >> w;
int n;
cin >> n;
std::set<pair<int, i... | #include <bits/stdc++.h>
#define pb emplace_back
#define mp make_pair
#define int long long
#define y second
#define x first
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int h;
cin >> h;
int w;
cin >> w;
int n;
cin >> n;
std::set<pair<int, i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 996,294 | 996,295 | u642455110 | cpp |
p03203 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | [
"expression.operation.binary.remove"
] | 996,300 | 996,301 | u899220667 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<int> Y[200000];
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
--x, --y;
Y[x].push_back(y);
}
int ret = max(H, W);
for (int i = 1; i < H; i++) {
sort(... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int H, W, N;
cin >> H >> W >> N;
vector<int> Y[200000];
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
--x, --y;
Y[x].push_back(y);
}
int ret = H;
for (int i = 1; i < H; i++) {
sort(begin(Y[i... | [
"call.remove",
"call.arguments.change"
] | 996,305 | 996,306 | u524343822 | cpp |
p03203 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#define f first
#define s second
#define PI pair<int, int>
#define M 400010
using namespace std;
int n, m, k, X[M], Y[M];
PI S[M];
set<PI> hsh;
set<int> OvO[M];
int Mn[M];
int main() {
scanf("%d%d%d", &n,... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#define f first
#define s second
#define PI pair<int, int>
#define M 400010
using namespace std;
int n, m, k, X[M], Y[M];
PI S[M];
set<PI> hsh;
set<int> OvO[M];
int Mn[M];
int main() {
scanf("%d%d%d", &n,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 996,307 | 996,308 | u280475878 | cpp |
p03203 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
int main() {
ios_base::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pii> objs;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
int main() {
ios_base::sync_with_stdio(false);
int h, w, n;
cin >> w >> h >> n;
vector<pii> objs;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
... | [
"expression.operation.binary.remove"
] | 996,309 | 996,310 | u424163068 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> data;
set<pii> bad;
set<int> blocked[200005];
void solve() {
int r, c, n;
cin >> r >> c >> n;
while (n--) {
int x, y;
cin >> x >> y;
bad.insert({x, y});
blocked[y].insert(x);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<pii, int> data;
set<pii> bad;
set<int> blocked[200005];
void solve() {
int r, c, n;
cin >> r >> c >> n;
while (n--) {
int x, y;
cin >> x >> y;
bad.insert({x, y});
blocked[y].insert(x);
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 996,321 | 996,322 | u109256064 | cpp |
p03203 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long lon... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long lon... | [] | 996,323 | 996,324 | u963781738 | cpp |
p03203 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | [
"control_flow.branch.if.condition.change"
] | 996,325 | 996,326 | u965315642 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | [
"expression.operation.binary.remove"
] | 996,329 | 996,330 | u352642493 | cpp |
p03204 | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
#define add(x, y) (e[++ee].nxt = lnk[x], e[lnk[x] = ee].to = y)
using namespace st... | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
#define add(x, y) (e[++ee].nxt = lnk[x], e[lnk[x] = ee].to = y)
using namespace st... | [
"call.arguments.add"
] | 996,335 | 996,336 | u752711517 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
int n, a[200010];
int poss(int len) {
if (len == 1) {
for (int i = 1; i < n; i++) {
if (a[i] <= a[i - 1])
return 0;
}
return 1;
}
deque<pair<int, int>> str;
int prevlen = 0;
for (int i = 0; i < n; i++) {
if (a[i] > prevlen) {
st... | #include <bits/stdc++.h>
using namespace std;
int n, a[200010];
int poss(int len) {
if (len == 1) {
for (int i = 1; i < n; i++) {
if (a[i] <= a[i - 1])
return 0;
}
return 1;
}
deque<pair<int, int>> str;
int prevlen = 0;
for (int i = 0; i < n; i++) {
if (a[i] > prevlen) {
st... | [
"call.function.change"
] | 996,347 | 996,348 | u875551424 | cpp |
p03202 | #include <bits/stdc++.h>
#ifndef LOCAL
#define cerr dolor_sit_amet
#endif
#define mp make_pair
#define sz(x) ((int)((x).size()))
#define X first
#define Y second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, ... | #include <bits/stdc++.h>
#ifndef LOCAL
#define cerr dolor_sit_amet
#endif
#define mp make_pair
#define sz(x) ((int)((x).size()))
#define X first
#define Y second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, ... | [
"control_flow.branch.if.condition.change"
] | 996,351 | 996,352 | u796366385 | cpp |
p03202 | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef wxh010910
freopen("input.txt", "r", stdin);
#endif
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
auto check = [&](int b) {
map<int, int> s;
for (int i = 0; i < n - 1; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef wxh010910
freopen("input.txt", "r", stdin);
#endif
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
auto check = [&](int b) {
map<int, int> s;
for (int i = 0; i < n - 1; ++i) {
... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.loop.for.initializer.change"
] | 996,353 | 996,354 | u877679608 | cpp |
p03202 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"expression.operation.binary.remove"
] | 996,355 | 996,356 | u883692173 | cpp |
p03203 | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
using namespace std;
int h, w, n, s[N + 5];
map<int, map<int, int>> p;
int main() ... | #include <bits/stdc++.h>
#define Tp template <typename Ty>
#define Ts template <typename Ty, typename... Ar>
#define Reg register
#define RI Reg int
#define Con const
#define CI Con int &
#define I inline
#define W while
#define N 200000
using namespace std;
int h, w, n, s[N + 5];
map<int, map<int, int>> p;
int main() ... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"io.output.change"
] | 996,359 | 996,360 | u752711517 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | [
"control_flow.branch.if.add"
] | 996,364 | 996,365 | u160429264 | cpp |
p03203 | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double lon... | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double lon... | [
"call.remove",
"call.arguments.change"
] | 996,366 | 996,367 | u441250130 | cpp |
p03203 | #include <bits/stdc++.h>
#define rep(i, a, ...) \
for (int i = (a) * (strlen(#__VA_ARGS__) != 0); \
i < (int)(strlen(#__VA_ARGS__) ? __VA_ARGS__ : (a)); ++i)
#define per(i, a, ...) ... | #include <bits/stdc++.h>
#define rep(i, a, ...) \
for (int i = (a) * (strlen(#__VA_ARGS__) != 0); \
i < (int)(strlen(#__VA_ARGS__) ? __VA_ARGS__ : (a)); ++i)
#define per(i, a, ...) ... | [
"variable_declaration.remove",
"variable_declaration.add"
] | 996,376 | 996,377 | u493610446 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll h, w, n;
cin >> h >> w >> n;
vector<priority_queue<ll, vec, greater<ll>>> p(w... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll h, w, n;
cin >> h >> w >> n;
vector<priority_queue<ll, vec, greater<ll>>> p(h... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change"
] | 996,382 | 996,383 | u718758485 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
vector<int> obj[200010];
int main() {
int h, w, n;
cin >> h >> w >> n;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
--x, --y;
if (y > x)
continue;
obj[y].push_back(x);
}
for (int i = 0; i < h; ++i) {
obj[i].push_back(w);
... | #include <bits/stdc++.h>
using namespace std;
vector<int> obj[200010];
int main() {
int h, w, n;
cin >> w >> h >> n;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
--x, --y;
if (y > x)
continue;
obj[y].push_back(x);
}
for (int i = 0; i < h; ++i) {
obj[i].push_back(w);
... | [
"expression.operation.binary.remove"
] | 996,384 | 996,385 | u918753189 | cpp |
p03203 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | [] | 996,393 | 996,394 | u839397805 | cpp |
p03203 | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T> using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T> using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 996,395 | 996,396 | u564902833 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int h, w, n;
vector<pair<int, int>> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> h >> w >> n;
a.resize(n);
for (auto &i : a)
cin >> i.first >> i.second;
sort(a.begin(), ... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int h, w, n;
vector<pair<int, int>> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> h >> w >> n;
a.resize(n);
for (auto &i : a)
cin >> i.first >> i.second;
sort(a.begin(), ... | [
"assignment.change"
] | 996,402 | 996,403 | u878355493 | cpp |
p03203 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size(... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size(... | [
"call.arguments.change",
"call.arguments.add"
] | 996,406 | 996,407 | u172873334 | cpp |
p03203 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | [
"call.remove",
"call.arguments.change"
] | 996,412 | 996,413 | u591914971 | cpp |
p03203 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 996,414 | 996,413 | u591914971 | cpp |
p03203 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 996,415 | 996,413 | u591914971 | cpp |
p03203 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 996,416 | 996,417 | u591914971 | cpp |
p03203 | #include <cstdio>
#include <iostream>
using namespace std;
int h, w, n, r, c, to, mn[200005];
int main() {
int i;
cin >> h >> w >> n;
for (i = 1; i <= w; i++)
mn[i] = 1e9;
while (n--) {
scanf("%d%d", &c, &r);
mn[c] = min(mn[c], r);
}
for (i = 1; i <= w; i++) {
if (mn[i] <= to)
break;
... | #include <cstdio>
#include <iostream>
using namespace std;
int h, w, n, r, c, to, mn[200005];
int main() {
int i;
cin >> h >> w >> n;
for (i = 1; i <= h; i++)
mn[i] = 1e9;
while (n--) {
scanf("%d%d", &c, &r);
mn[c] = min(mn[c], r);
}
for (i = 1; i <= h; i++) {
if (mn[i] <= to)
break;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 996,421 | 996,422 | u093170535 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll h, w, n;
cin >> h >> w >> n;
int ans = w... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, n;
cin >> h >> w >> n;
int ans = ... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.change"
] | 996,434 | 996,435 | u949755084 | cpp |
p03203 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typede... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typede... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 996,436 | 996,437 | u443685186 | cpp |
p03203 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
//#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
type... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typede... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 996,438 | 996,437 | u443685186 | cpp |
p03203 | #include <bits/stdc++.h>
// created [2020/02/01] 04:28:57
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
... | #include <bits/stdc++.h>
// created [2020/02/01] 04:28:57
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
using uint = unsigned int;
using usize = std::size_t;
using ll = long long;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change",
"function.return_value.change"
] | 996,443 | 996,444 | u603303736 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
vector<int> v[N];
int main() {
scanf("%d%d", &n, &m);
int k;
scanf("%d", &k);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
v[1].push_back(m + 1);
for (int i = 1; i <= m; i++)
sort(v[i].beg... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
vector<int> v[N];
int main() {
scanf("%d%d", &n, &m);
int k;
scanf("%d", &k);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
v[1].push_back(n + 1);
for (int i = 1; i <= m; i++)
sort(v[i].beg... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 996,445 | 996,446 | u676323984 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
vector<int> v[N];
int main() {
scanf("%d%d", &n, &m);
int k;
scanf("%d", &k);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
v[1].push_back(m + 1);
for (int i = 1; i <= m; i++)
sort(v[i].beg... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
vector<int> v[N];
int main() {
scanf("%d%d", &n, &m);
int k;
scanf("%d", &k);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
v[1].push_back(n + 1);
for (int i = 1; i <= m; i++)
sort(v[i].beg... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 996,447 | 996,448 | u676323984 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
vector<int> v[N];
int main() {
scanf("%d%d", &n, &m);
int k;
scanf("%d", &k);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
v[1].push_back(m + 1);
for (int i = 1; i <= m; i++)
sort(v[i].beg... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, m;
vector<int> v[N];
int main() {
scanf("%d%d", &n, &m);
int k;
scanf("%d", &k);
while (k--) {
int x, y;
scanf("%d%d", &x, &y);
v[y].push_back(x);
}
v[1].push_back(n + 1);
for (int i = 1; i <= m; i++)
sort(v[i].beg... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 996,449 | 996,448 | u676323984 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | [
"variable_declaration.value.change",
"identifier.change"
] | 996,452 | 996,453 | u030685402 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> kabe[200005];
int main() {
ll h, w, n;
cin >> h >> w >> n;
ll ans = h;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
kabe[x].push_back(y);
}
for (int i = 1; i <= h; i++) {
kabe[i].push_back(17441744);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> kabe[200005];
int main() {
ll h, w, n;
cin >> h >> w >> n;
ll ans = h;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
kabe[x].push_back(y);
}
for (int i = 1; i <= h; i++) {
kabe[i].push_back(17441744);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 996,454 | 996,455 | u440213743 | cpp |
p03203 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ff first
#define ss second
vector<pair<int, int>> v;
signed main() {
int h, n, x = 0;
cin >> h >> n >> n;
v.resize(n);
for (auto &i : v)
cin >> i.ff >> i.ss;
sort(v.begin(), v.end());
for (auto p : v) {
if (p.ss ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define ff first
#define ss second
vector<pair<int, int>> v;
signed main() {
int h, n, x = 0;
cin >> h >> n >> n;
v.resize(n);
for (auto &i : v)
cin >> i.ss >> i.ff;
sort(v.begin(), v.end());
for (auto p : v) {
if (p.ss ... | [
"expression.operation.binary.change"
] | 996,466 | 996,467 | u579678749 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#if... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#if... | [
"expression.operation.binary.remove",
"call.arguments.add"
] | 996,470 | 996,471 | u715750943 | cpp |
p03203 | #include <bits/stdc++.h>
typedef long long ll;
ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int mn[100010];
int main() {
#ifdef XZZSB
freopen("in.in", "r", stdin);
... | #include <bits/stdc++.h>
typedef long long ll;
ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int mn[200010];
int main() {
#ifdef XZZSB
freopen("in.in", "r", stdin);
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 996,472 | 996,473 | u713368169 | cpp |
p03203 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, h, w, ans, minp[100005];
int main() {
scanf("%d%d%d", &h, &w, &n);
ans = h;
for (int i = 1; i <= h; i++)
minp[i] = w + 1;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
minp[x] = min(minp[x], y... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, h, w, ans, minp[200005];
int main() {
scanf("%d%d%d", &h, &w, &n);
ans = h;
for (int i = 1; i <= h; i++)
minp[i] = w + 1;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
minp[x] = min(minp[x], y... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 996,476 | 996,477 | u656762776 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
const int inf = 0x3f3f3f3f;
int H, W, n;
int x[N], y[N];
vector<int> v[N], s[N];
int p[N], q[N];
int main() {
scanf("%d%d%d", &H, &W, &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= n; ++i)
v[x[i]].push... | #include <bits/stdc++.h>
using namespace std;
const int N = 200010;
const int inf = 0x3f3f3f3f;
int H, W, n;
int x[N], y[N];
vector<int> v[N], s[N];
int p[N], q[N];
int main() {
scanf("%d%d%d", &H, &W, &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= n; ++i)
v[x[i]].push... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 996,480 | 996,481 | u195524909 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); \
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); \
c... | [
"literal.number.change",
"expression.operation.binary.change"
] | 996,485 | 996,486 | u722777218 | cpp |
p03203 | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 996,489 | 996,490 | u530846427 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | [
"identifier.change",
"io.output.change"
] | 996,493 | 996,494 | u212904724 | cpp |
p03203 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 996,495 | 996,494 | u212904724 | cpp |
p03203 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
ll MOD = 1000000007;
int inf = 1000000000;
ll INF = 10000000000000000;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int> a(w + 1, inf);
rep(i, n) {
int f,... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
ll MOD = 1000000007;
int inf = 1000000000;
ll INF = 10000000000000000;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int> a(h + 1, inf);
rep(i, n) {
int f,... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 996,496 | 996,497 | u112775098 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.