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 |
|---|---|---|---|---|---|---|---|
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const ll MINUSINF = -1e11;
const ll INF = 1e11;
int A, B;
int Q;
cin >> A >> B;
cin >> Q;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (int i = 1; i <= A; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
const ll MINUSINF = -1e11;
const ll INF = 1e11;
int A, B;
int Q;
cin >> A >> B;
cin >> Q;
ll s[A + 2], t[B + 2];
s[0] = MINUSINF;
s[A + 1] = INF;
t[0] = MINUSINF;
t[A + 1] = INF;
for (int i = 1; i <= A; i++)
... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 924,480 | 924,479 | u998251394 | cpp |
p03112 | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>... | [
"assignment.change"
] | 924,492 | 924,493 | u578938637 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
using namespace std;
typedef long long ll;
ll minl(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
int main() {
ll A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A), t(B), x(Q);
rep(i, A) ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
using namespace std;
typedef long long ll;
ll minl(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
int main() {
ll A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A), t(B), x(Q);
rep(i, A) ... | [
"control_flow.branch.if.condition.change"
] | 924,494 | 924,495 | u703503553 | cpp |
p03112 | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | #include <algorithm>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip> //do setprecision
#include <ios... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,498 | 924,499 | u404075706 | cpp |
p03112 | #include <bits/stdc++.h>
#define PI acos(-1)
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define srt(a) sort(all(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define f first
#define s second
#define MOD 1000000007
#define MOD1 998244353
#define EPS 1e-9
#define fore(i, b, e) for (... | #include <bits/stdc++.h>
#define PI acos(-1)
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define srt(a) sort(all(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define f first
#define s second
#define MOD 1000000007
#define MOD1 998244353
#define EPS 1e-9
#define fore(i, b, e) for (... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 924,502 | 924,503 | u736250852 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using TP = tuple<ll, ll, ll>... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using TP = tuple<ll, ll, ll>... | [
"assignment.value.change",
"identifier.change"
] | 924,510 | 924,511 | u432194969 | cpp |
p03112 | #include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep,... | #include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep,... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,512 | 924,513 | u573154728 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define INF 1e14 + 1
typedef long long ll;
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.b... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e14 + 1
typedef long long ll;
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.b... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 924,518 | 924,519 | u624923345 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;... | [
"identifier.change"
] | 924,524 | 924,525 | u195054737 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> s, t;
void solve() {
int x;
cin >> x;
int ans = 1e18;
int sitr = lower_bound(s.begin(), s.end(), x) - s.begin();
int titr = lower_bound(t.begin(), t.end(), x) - t.begin();
for (int i = 0; i < 2; i++) {
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> s, t;
void solve() {
int x;
cin >> x;
int ans = 1e18;
int sitr = lower_bound(s.begin(), s.end(), x) - s.begin();
int titr = lower_bound(t.begin(), t.end(), x) - t.begin();
for (int i = 0; i < 2; i++) {
for (int j = 0; j <... | [
"identifier.change"
] | 924,529 | 924,530 | u862412671 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
/*
*
* 最適解は以下のいずれかの形であることはわかる
まずいずれかの「神社」を訪れて、そこから最も近い「寺」に訪れる
まずいずれかの「寺」を訪れて、そこから最も近い「神社」に訪れる
ここで、1
個目の場合について、最初に訪れる神社が必ずしも初期位置から最も近い位置がよいわけではないことに注意する。なぜ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 58;
/*
*
* 最適解は以下のいずれかの形であることはわかる
まずいずれかの「神社」を訪れて、そこから最も近い「寺」に訪れる
まずいずれかの「寺」を訪れて、そこから最も近い「神社」に訪れる
ここで、1
個目の場合について、最初に訪れる神社が必ずしも初期位置から最も近い位置がよいわけではないことに注意する。なぜ... | [
"variable_declaration.type.narrow.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,533 | 924,534 | u067267880 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
template <class T> void ckmin(T &a, T b) { a = min(a, b); }
template <class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ... | #include <bits/stdc++.h>
using namespace std;
template <class T> void ckmin(T &a, T b) { a = min(a, b); }
template <class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,535 | 924,536 | u235396011 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << end
#define EPS (1... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << end
#define EPS (1... | [
"expression.operation.unary.add"
] | 924,539 | 924,540 | u929582923 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | #include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp,... | [
"literal.number.change"
] | 924,541 | 924,542 | u878615689 | cpp |
p03112 | #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 mp make_pair
#define pb push_... | #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 mp make_pair
#define pb push_... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 924,545 | 924,546 | u160429264 | cpp |
p03112 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
int main() {
long int a, b, q;
cin >> a >> b >> q;
long int s[a];
rep(i, a) cin >> s[i];
long int t[b];
rep(i, b) cin >>... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
int main() {
long int a, b, q;
cin >> a >> b >> q;
long int s[a];
rep(i, a) cin >> s[i];
long int t[b];
rep(i, b) cin >>... | [
"call.arguments.change"
] | 924,549 | 924,550 | u416773418 | cpp |
p03112 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long int a, b, q;
cin >> a >> b >> q;
long int s[a];
rep(i, a) cin >> s[i];
long int t[b];
rep(i, b) cin >> t[i]... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (long int i = 0; i < n; i++)
int main() {
long int a, b, q;
cin >> a >> b >> q;
long int s[a];
rep(i, a) cin >> s[i];
long int t[b];
rep(i, b) cin >>... | [
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 924,551 | 924,550 | u416773418 | cpp |
p03112 | #include "bits/stdc++.h"
using namespace std;
const long long INF = 20000000001;
void Main() {
int a, b, q;
cin >> a >> b >> q;
vector<long long> s, t;
for (int i = 0; i < a; i++) {
long long tmp;
cin >> tmp;
s.push_back(tmp);
}
for (int i = 0; i < b; i++) {
long long tmp;
cin >> tmp;
... | #include "bits/stdc++.h"
using namespace std;
const long long INF = 20000000001;
void Main() {
int a, b, q;
cin >> a >> b >> q;
vector<long long> s, t;
for (int i = 0; i < a; i++) {
long long tmp;
cin >> tmp;
s.push_back(tmp);
}
for (int i = 0; i < b; i++) {
long long tmp;
cin >> tmp;
... | [
"identifier.change"
] | 924,557 | 924,558 | u931698099 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const int int_inf = 100000000;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <cla... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const int int_inf = 100000000;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <cla... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.change"
] | 924,559 | 924,560 | u831873811 | cpp |
p03112 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0;... | [] | 924,561 | 924,562 | u136342563 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e15;
const int maxn = 1e5 + 7;
typedef long long ll;
int T;
int a, b, c, n;
ll la[maxn], lb[maxn], x, ans;
double pi = 3.14159265359;
double d, r;
int main() {
scanf("%d%d%d", &a, &b, &c);
for (int i = 0; i < a; i++)
scanf("%ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e15;
const int maxn = 1e5 + 7;
typedef long long ll;
int T;
int a, b, c, n;
ll la[maxn], lb[maxn], x, ans;
double pi = 3.14159265359;
double d, r;
int main() {
scanf("%d%d%d", &a, &b, &c);
for (int i = 0; i < a; i++)
scanf("%ll... | [
"assignment.change"
] | 924,563 | 924,564 | u551243477 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define rep(i, N) for (int i = 0; i < N; i++)
int main() {
ios::sync_with_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define rep(i, N) for (int i = 0; i < N; i++)
int main() {
ios::sync_with_... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,565 | 924,566 | u864171425 | cpp |
p03112 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | [
"identifier.change",
"expression.operation.binary.change"
] | 924,571 | 924,572 | u845000384 | cpp |
p03112 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | [
"identifier.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 924,573 | 924,572 | u845000384 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
ci... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
ci... | [
"call.arguments.change",
"call.arguments.add"
] | 924,574 | 924,575 | u756088996 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 2), t(B + 2);
s[0] = -1e18;
s[A + 1] = 1e18;
t[0] = s[0];
t[B + 1] = s[A + 1];
for (int i = 1; i < A + 1; i++)
cin >> s[i];
for (int i = 1; i < B + 1; i++)
cin ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 2), t(B + 2);
s[0] = -1e18;
s[A + 1] = 1e18;
t[0] = s[0];
t[B + 1] = s[A + 1];
for (int i = 1; i < A + 1; i++)
cin >> s[i];
for (int i = 1; i < B + 1; i++)
cin ... | [] | 924,584 | 924,585 | u519194615 | cpp |
p03112 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace s... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace s... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 924,588 | 924,589 | u017293723 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge {
ll to, cost;
};
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define eachdo(e, array) for (const auto &e : array)
#define upper_index(v, a) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge {
ll to, cost;
};
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
#define eachdo(e, array) for (const auto &e : array)
#define upper_index(v, a) ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 924,590 | 924,591 | u926099741 | cpp |
p03112 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"variable_declaration.type.change"
] | 924,602 | 924,603 | u284124505 | cpp |
p03112 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::s... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::s... | [
"variable_declaration.type.widen.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 924,604 | 924,605 | u264265458 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 924,608 | 924,609 | u806999568 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | [
"identifier.change"
] | 924,624 | 924,625 | u139031151 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | [
"call.remove",
"identifier.change"
] | 924,626 | 924,625 | u139031151 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<long long> s(A + 2), t(B + 2), x(Q);
for (int i = 0; i < A; i++)
cin >> s.at(i);
for (int i = 0; i < B; i++)
cin >> t.at(i);
for (int i = 0; i < Q; i++)
cin >> x.at(i);
long long INF = 1LL << 50... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<long long> s(A + 2), t(B + 2), x(Q);
for (int i = 0; i < A; i++)
cin >> s.at(i);
for (int i = 0; i < B; i++)
cin >> t.at(i);
for (int i = 0; i < Q; i++)
cin >> x.at(i);
long long INF = 1LL << 50... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,629 | 924,630 | u642120132 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define lint long long
#define all(x) (x).begin(), (x).en... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define lint long long
#define all(x) (x).begin(), (x).en... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,636 | 924,637 | u632094970 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, q;
cin >> n >> m >> q;
vector<ll> a(n + 2), b(m + 2);
ll x;
a[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, m, q;
cin >> n >> m >> q;
vector<ll> a(n + 2), b(m + 2);
ll x;
a[... | [
"identifier.change",
"io.output.change"
] | 924,638 | 924,639 | u151855078 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | [
"control_flow.loop.for.condition.change"
] | 924,640 | 924,641 | u190018920 | cpp |
p03111 | #include <iostream>
#include <string>
#include <vector>
const int INF = 1000000000;
int n;
int target[3];
std::vector<int> l;
// ref : https://img.atcoder.jp/abc119/editorial.pdf
// ref : https://drken1215.hatenablog.com/entry/2019/02/24/224100
/*
延長、縮小は合成の前後どっちでやろうが同じ
->
合成魔法を一切これ以降使用しない場合に限り延長、縮小魔法を使用としても一般性は失われない
... | #include <iostream>
#include <string>
#include <vector>
const int INF = 1000000000;
int n;
int target[3];
std::vector<int> l;
// ref : https://img.atcoder.jp/abc119/editorial.pdf
// ref : https://drken1215.hatenablog.com/entry/2019/02/24/224100
/*
延長、縮小は合成の前後どっちでやろうが同じ
->
合成魔法を一切これ以降使用しない場合に限り延長、縮小魔法を使用としても一般性は失われない
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 924,642 | 924,643 | u390165589 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | [
"call.remove"
] | 924,644 | 924,645 | u011716617 | cpp |
p03111 | #include <cmath>
#include <iostream>
using namespace std;
const int INF = 1e9;
int calc_mp(int *take, int a, int b, int c) {
if (take[0] == 0 || take[1] == 0 || take[2] == 0) {
return INF;
}
return std::abs(take[0] - a) + std::abs(take[1] - b) + std::abs(take[2] - c);
}
void copy(int *l, int *m) {
m[0] ... | #include <cmath>
#include <iostream>
using namespace std;
const int INF = 1e9;
int calc_mp(int *take, int a, int b, int c) {
if (take[0] == 0 || take[1] == 0 || take[2] == 0) {
return INF;
}
return std::abs(take[0] - a) + std::abs(take[1] - b) + std::abs(take[2] - c);
}
void copy(int *l, int *m) {
m[0] ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 924,657 | 924,658 | u313766957 | cpp |
p03111 | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 924,665 | 924,666 | u665871498 | cpp |
p03111 | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
// using Graph = vector<vector<int>>;
... | [
"variable_declaration.type.change"
] | 924,667 | 924,668 | u665871498 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
#define rrep(i, n) for (int i = ((int)n - 1); i >= 0; --i)
using ll = long long;
using ld = long double;
const ll INF = 1e18;
const int Inf = 1e9;
const double EPS =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = a; i < (int)b; ++i)
#define rrep(i, n) for (int i = ((int)n - 1); i >= 0; --i)
using ll = long long;
using ld = long double;
const ll INF = 1e18;
const int Inf = 1e9;
const double EPS =... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,669 | 924,670 | u940569542 | cpp |
p03111 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | [
"control_flow.branch.else.add",
"control_flow.return.add"
] | 924,686 | 924,687 | u273928723 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const int INF = INT_MAX;
int N, A, B, C;
vector<int> l;
int dfs(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return INF;
else
return abs(A - a) + abs(B - b) + abs(C - c);
}
int res =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const long long INF = 1 << 29;
int N, A, B, C;
vector<int> l;
int dfs(int i, int a, int b, int c) {
if (i == N) {
if (!a || !b || !c)
return INF;
else
return abs(A - a) + abs(B - b) + abs(C - c);
}
int... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.remove",
"literal.replace.add"
] | 924,688 | 924,689 | u702686470 | cpp |
p03111 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll MIN(ll a, ll b) { return a < b ? a : b; }
ll a, b, c, n;
ll *arr;
ll Synthetic(ll x, ll y, ll z, ll i) {
if (i == n) {
if (x < 0 || y < 0 || z < 0)
return 1e12;
else
return abs(a - x) + abs(b - y) + abs(c - z);
}
ll op1 = ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll MIN(ll a, ll b) { return a < b ? a : b; }
ll a, b, c, n;
ll *arr;
ll Synthetic(ll x, ll y, ll z, ll i) {
if (i == n) {
if (x <= 0 || y <= 0 || z <= 0)
return 1e12;
return abs(a - x) + abs(b - y) + abs(c - z);
}
ll op1 = Synthet... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove"
] | 924,698 | 924,699 | u017126309 | cpp |
p03111 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int N, A, B, C;
vector<int> L(8);
int DFS(int cur, int a, int b, int c) {
if (cur == N) {
if ((a & b & c) == 0)
return 1 << 30;
else
return a... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
int N, A, B, C;
vector<int> L(8);
int DFS(int cur, int a, int b, int c) {
if (cur == N) {
if (min({a, b, c}) == 0)
return 1 << 30;
else
retur... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 924,704 | 924,705 | u823855263 | cpp |
p03111 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 1 << 29;
int N, A, B, C;
int l[8];
int dfs(int a, in... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 1 << 29;
int N, A, B, C;
int l[8];
int dfs(int a, in... | [
"expression.operation.binary.remove"
] | 924,708 | 924,709 | u263000123 | cpp |
p03111 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 1 << 29;
int N, A, B, C;
int l[8];
int dfs(int a, in... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
static const int INF = 1 << 29;
int N, A, B, C;
int l[8];
int dfs(int a, in... | [
"expression.operation.binary.remove",
"control_flow.return.add"
] | 924,710 | 924,709 | u263000123 | cpp |
p03112 | //解説読了後の実装
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
vector<long long int> s;
vector<long long int> t;
// index が条件を満たすかどうか
bool isOKs(int index, long long key) {
if (s[index] > key)
return true;
else
return false;
}
bool isOKt(int index, long long... | //解説読了後の実装
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
vector<long long int> s;
vector<long long int> t;
// index が条件を満たすかどうか
bool isOKs(int index, long long key) {
if (s[index] > key)
return true;
else
return false;
}
bool isOKt(int index, long long... | [
"assignment.change"
] | 924,715 | 924,716 | u707498674 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void chmin(long long &a, long long b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 59;
// 前方の index
int former(const vector<long long> &v, long long x) {
return (int)(upper_bound(v.begin(), v.end(), x) - v.begin()) - 1;
}
//... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
void chmin(long long &a, long long b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 59;
// 前方の index
int former(const vector<long long> &v, long long x) {
return (int)(upper_bound(v.begin(), v.end(), x) - v.begin()) - 1;
}
//... | [
"identifier.change",
"call.arguments.change"
] | 924,719 | 924,720 | u692336506 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int A, B, Q;
vector<long long> s, t, x;
int main() {
cin >> A >> B >> Q;
s.resize(A + 2);
t.resize(B + 2);
x.resize(Q);
s[0] = LLONG_MIN / 4;
s[A + 1] = LLONG_MAX / 4;
t[0] = LLONG_MI... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <vector>
using namespace std;
int A, B, Q;
vector<long long> s, t, x;
int main() {
cin >> A >> B >> Q;
s.resize(A + 2);
t.resize(B + 2);
x.resize(Q);
s[0] = LLONG_MIN / 4;
s[A + 1] = LLONG_MAX / 4;
t[0] = LLONG_MI... | [
"assignment.variable.change",
"identifier.change"
] | 924,725 | 924,726 | u604023588 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
for (int i = 0; i < a... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
const int INF = 1 << 30;
const long long LINF = 1LL << 60;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b);
for (int i = 0; i < a... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,737 | 924,738 | u480806810 | cpp |
p03112 | #include <bits/stdc++.h>
int a, b, q;
long long s[100005], t[100005];
int main() {
std::cin >> a >> b >> q;
for (int i = 0; i < a; ++i)
std::cin >> s[i];
for (int i = 0; i < b; ++i)
std::cin >> t[i];
std::sort(s, s + a);
std::sort(t, t + b);
for (int i = 0; i < q; ++i) {
long long x;
std:... | #include <bits/stdc++.h>
int a, b, q;
long long s[100005], t[100005];
int main() {
std::cin >> a >> b >> q;
for (int i = 0; i < a; ++i)
std::cin >> s[i];
for (int i = 0; i < b; ++i)
std::cin >> t[i];
std::sort(s, s + a);
std::sort(t, t + b);
for (int i = 0; i < q; ++i) {
long long x;
std:... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,744 | 924,745 | u640248738 | cpp |
p03112 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
t... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 924,748 | 924,749 | u355335354 | cpp |
p03112 | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | #define _CRT_SECURE_NO_WARNINGS
/* include ***********************/
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* define *************************/
// for
#define REP(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define REPS(i, n) for (int i = 1, i##_len = (int)(n); i ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,750 | 924,751 | u539339654 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b, q;
ll x, l[2], r[2], ans;
vector<ll> s, t;
scanf("%d %d %d", &a, &b, &q);
s.resize(a);
t.resize(b);
for (int i = 0; i < a; i++) {
scanf("%lld", &s[i]);
}
for ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int a, b, q;
ll x, l[2], r[2], ans;
vector<ll> s, t;
scanf("%d %d %d", &a, &b, &q);
s.resize(a);
t.resize(b);
for (int i = 0; i < a; i++) {
scanf("%lld", &s[i]);
}
for ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 924,752 | 924,753 | u855429581 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
long *s = new long[100000];
long *t = new long[100000];
long *x = new long[100000];
for (int i = 0; i < a; i++)
cin >> s[i];
for (int i = 0; i < b; i++)
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
long *s = new long[100000];
long *t = new long[100000];
long *x = new long[100000];
for (int i = 0; i < a; i++)
cin >> s[i];
for (int i = 0; i < b; i++)
... | [
"control_flow.branch.if.condition.change"
] | 924,754 | 924,755 | u088893297 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
long *s = new long[100000];
long *t = new long[100000];
long *x = new long[100000];
for (int i = 0; i < a; i++)
cin >> s[i];
for (int i = 0; i < b; i++)
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
long *s = new long[100000];
long *t = new long[100000];
long *x = new long[100000];
for (int i = 0; i < a; i++)
cin >> s[i];
for (int i = 0; i < b; i++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 924,756 | 924,755 | u088893297 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
long *s = new long[100000];
long *t = new long[100000];
long *x = new long[100000];
for (int i = 0; i < a; i++)
cin >> s[i];
for (int i = 0; i < b; i++)
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
int a, b, q;
cin >> a >> b >> q;
long *s = new long[100000];
long *t = new long[100000];
long *x = new long[100000];
for (int i = 0; i < a; i++)
cin >> s[i];
for (int i = 0; i < b; i++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 924,757 | 924,755 | u088893297 | cpp |
p03112 | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
#define int long long
using namespace std;
long long x[100000], y[100000], z[100000], vx[2], vy[2];
signed main() {
long long a, b, c;
cin >> a >> b >> c;
f(i, a) c... | #include <bits/stdc++.h>
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
#define P pair<int, int>
#define int long long
using namespace std;
long long x[100000], y[100000], z[100000], vx[2], vy[2];
signed main() {
long long a, b, c;
cin >> a >> b >> c;
f(i, a) c... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,758 | 924,759 | u259210975 | cpp |
p03112 | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | #include <algorithm>
#include <assert.h>
#include <complex>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using... | [
"call.arguments.change"
] | 924,776 | 924,777 | u262288723 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int n, m, q;
ll a[maxn], b[maxn];
void pd(ll &ret, ll val) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <random>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int n, m, q;
ll a[maxn], b[maxn];
void pd(ll &ret, ll val) ... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 924,803 | 924,804 | u541410431 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).si... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).si... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,818 | 924,819 | u384743704 | cpp |
p03112 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define LLINF 10000000000
using namespace std;
// 自作した二分探索
int my_binary_search(ll *data, int size, ll key) {
int ng = -1;
int ok = size;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (data[mid] <... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define LLINF 1000000000000000000
using namespace std;
// 自作した二分探索
int my_binary_search(ll *data, int size, ll key) {
int ng = -1;
int ok = size;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (dat... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 924,820 | 924,821 | u620059302 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, q;
int main() {
cin >> a >> b >> q;
vector<ll> s(a), t(b);
for (int i = 0; i < a; i++) {
cin >> s[i];
}
for (int i = 0; i < b; i++) {
cin >> t[i];
}
for (int i = 0; i < q; i++) {
ll x;
cin >> x;
vector<ll> a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, q;
int main() {
cin >> a >> b >> q;
vector<ll> s(a), t(b);
for (int i = 0; i < a; i++) {
cin >> s[i];
}
for (int i = 0; i < b; i++) {
cin >> t[i];
}
for (int i = 0; i < q; i++) {
ll x;
cin >> x;
vector<ll> a... | [
"expression.operation.binary.add"
] | 924,832 | 924,833 | u394482932 | cpp |
p03112 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_std... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
int main(void) {
cout << std::fixed << std::setprecision(10);
cin.tie(0);
std::ios::sync_with_std... | [
"variable_declaration.type.primitive.change"
] | 924,834 | 924,835 | u844133200 | cpp |
p03112 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF LLONG_MAX
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
using namespace std;
int a, b... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF LLONG_MAX
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
using namespace std;
int a, b... | [
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,836 | 924,837 | u379822620 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const int MAXN = 200000;
int N, M;
struct Edge {
int to;
int weight;
int next;
};
vector<Edge> edges(MAXN);
vector<int> head(MAXN, -1);
vector<int> matchingx(MAXN,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const int MAXN = 200000;
int N, M;
struct Edge {
int to;
int weight;
int next;
};
vector<Edge> edges(MAXN);
vector<int> head(MAXN, -1);
vector<int> matchingx(MAXN,... | [
"literal.number.change",
"call.arguments.change",
"literal.number.type.widen.change"
] | 924,838 | 924,839 | u666721654 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> sh, tem;
int a, b, q;
ll get_near(ll x, vector<ll> &tem) {
auto nt = lower_bound(tem.begin(), tem.end(), x);
ll ret = INT_MAX;
if (nt != tem.end()) {
ret = *nt - x;
}
if (nt != tem.begin()) {
nt--;
ret = min(ret, x - *nt... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> sh, tem;
int a, b, q;
ll get_near(ll x, vector<ll> &tem) {
auto nt = lower_bound(tem.begin(), tem.end(), x);
ll ret = LONG_LONG_MAX;
if (nt != tem.end()) {
ret = *nt - x;
}
if (nt != tem.begin()) {
nt--;
ret = min(ret, x... | [
"variable_declaration.value.change",
"identifier.change"
] | 924,843 | 924,844 | u914762730 | cpp |
p03112 | // includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered... | // includes
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,845 | 924,846 | u424110125 | cpp |
p03112 | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int Amax = 1e5;
int A, B, Q;
ll S[Amax], T[Amax], X[Amax];
int main() {
cin >> A >> B >> Q;
for (int ... | #include <iomanip>
#include <iostream>
//#include<cstdio>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
const int Amax = 1e5;
int A, B, Q;
ll S[Amax], T[Amax], X[Amax];
int main() {
cin >> A >> B >> Q;
for (int ... | [
"assignment.change"
] | 924,850 | 924,851 | u534998883 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll A, B, Q;
ll s[100002], t[100002], x[100002];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B >> Q;
s[0] = -1e18;
for (int i = 1; i <= A; ++i) {
cin >> s[i];
}
s[A + 1] = 1e18;
t[0] = -1e18;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll A, B, Q;
ll s[100002], t[100002], x[100002];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A >> B >> Q;
s[0] = -1e18;
for (int i = 1; i <= A; ++i) {
cin >> s[i];
}
s[A + 1] = 1e18;
t[0] = -1e18;
for (int i = 1... | [
"expression.operation.binary.change"
] | 924,852 | 924,853 | u482969053 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef vector<ll> vi;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef vector<ll> vi;... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 924,860 | 924,861 | u581807854 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#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 fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
te... | #include <bits/stdc++.h>
using namespace std;
#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 fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
te... | [
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 924,864 | 924,865 | u920299620 | cpp |
p03112 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define INF 1e15
ll A, B, Q, s[101010], t[101010];
ll ab[101010], ba[101010... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define INF 1e15
ll A, B, Q, s[101010], t[101010];
ll ab[101010], ba[101010... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.loop.condition.change"
] | 924,868 | 924,867 | u259396003 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e18;
int A, B, Q;
vector<int> s, t;
int solve(int x) {
// Right, Leftはxより右にあるか左にあるか... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int INF = 1e18;
int A, B, Q;
vector<int> s, t;
int solve(int x) {
// Right, Leftはxより右にあるか左にある... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,876 | 924,877 | u219873012 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) \
sort(x.begin(), x.end()); ... | [] | 924,878 | 924,879 | u219873012 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
vector<long long> A, B;
int N, M, Q;
long long solve(long long x) {
int pos1 = lower_bound(A.begin(), A.end(), x) - A.begin();
i... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
vector<long long> A, B;
int N, M, Q;
long long solve(long long x) {
int pos1 = lower_bound(A.begin(), A.end(), x) - A.begin();
i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 924,884 | 924,885 | u504103417 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
vector<long long> A, B;
int N, M, Q;
long long solve(long long x) {
int pos1 = lower_bound(A.begin(), A.end(), x) - A.begin();
i... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
vector<long long> A, B;
int N, M, Q;
long long solve(long long x) {
int pos1 = lower_bound(A.begin(), A.end(), x) - A.begin();
i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 924,886 | 924,885 | u504103417 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).be... | [
"variable_declaration.type.change"
] | 924,889 | 924,890 | u379947938 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 1000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).be... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.change"
] | 924,891 | 924,890 | u379947938 | cpp |
p03112 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
inline long long mod(long long n, long long m) { return (n % m + m) % m; }
// const i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
inline long long mod(long long n, long long m) { return (n % m + m) % m; }
// const i... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,892 | 924,893 | u918753189 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int s, t, spot, val;
vector<ll> arrS, arrT;
cin >> s >> t >> spot;
for (int i = 0; i < s; i++) {
cin >> val;
arrS.push_back(val);
}
for (int i = 0; i < t; i++) {
cin >> val;
arrT.push_back(val);
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int s, t, spot;
ll val;
vector<ll> arrS, arrT;
cin >> s >> t >> spot;
for (int i = 0; i < s; i++) {
cin >> val;
arrS.push_back(val);
}
for (int i = 0; i < t; i++) {
cin >> val;
arrT.push_back(val);
... | [] | 924,896 | 924,897 | u522598953 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
// #define INF LONG_MAX
#define INF 10000000000
#define ll long long int
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s;
vector<ll> t;
s.push_back(-1 * INF); //二分探索用（スタート位置がs,t範囲に入るように）
t.push_back(-1 * INF);
for (int i = 0; i < A; i++) {
l... | #include <bits/stdc++.h>
using namespace std;
// #define INF LONG_MAX
#define INF 100000000000
#define ll long long int
int main() {
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s;
vector<ll> t;
s.push_back(-1 * INF); //二分探索用（スタート位置がs,t範囲に入るように）
t.push_back(-1 * INF);
for (int i = 0; i < A; i++) {
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 924,898 | 924,899 | u855087874 | cpp |
p03112 | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,900 | 924,901 | u591343832 | cpp |
p03112 | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
#include <complex>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <deque>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <v... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 924,900 | 924,902 | u591343832 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
ll A, B, Q, x;
cin >> A... | #include <bits/stdc++.h>
using namespace std;
#define MD 1000000007
typedef long long int ll;
typedef pair<ll, ll> P;
template <typename T> std::string tostr(const T &t) {
std::ostringstream os;
os << t;
return os.str();
}
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
ll A, B, Q, x;
cin >> A... | [
"literal.number.change",
"assignment.value.change"
] | 924,903 | 924,904 | u287060310 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E17;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n - 1;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E17;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n - 1;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,919 | 924,920 | u651032293 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E12;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n - 1;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E17;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n - 1;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,921 | 924,920 | u651032293 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E12;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]) {
... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E17;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n - 1;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,922 | 924,920 | u651032293 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E11;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]) {
... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2E17;
typedef pair<int, int> Pair;
typedef long long int LL;
void binarySearch(const array<LL, 100100> &L, LL x, int n, LL ret[]) {
int left = 0;
int right = n - 1;
while (right - left != 1) {
int mid = (left + right) / 2;
if (x < L[mid]... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,923 | 924,920 | u651032293 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
// cout.precision(11);
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 1), t(B + 1), x(Q);
s[0] = -INF;
t[0] = -INF;
for (int i = 0; i < A; ++i)
cin >> s[i + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e16)
#define PI (acos(-1))
int main() {
// cout.precision(11);
int A, B, Q;
cin >> A >> B >> Q;
vector<ll> s(A + 1), t(B + 1), x(Q);
s[0] = -INF;
t[0] = -INF;
for (int i = 0; i < A; ++i)
cin >> s[i +... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 924,941 | 924,942 | u529560649 | cpp |
p03112 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namesp... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 924,945 | 924,946 | u287305727 | cpp |
p03112 | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long int
using namespace std;
int A, B, Q;
int main() {
cin >> A >> B >> Q;
vector<ll> s(A), t(B), X(Q);
for (int i = 0; i < A; i++) {
cin >> s[i];
}
for (int i = 0; i < B; i++) {
cin >> t[i];
}
for (int i = 0; i < Q; i+... | #include <algorithm>
#include <iostream>
#include <vector>
#define ll long long int
using namespace std;
int A, B, Q;
int main() {
cin >> A >> B >> Q;
vector<ll> s(A), t(B), X(Q);
for (int i = 0; i < A; i++) {
cin >> s[i];
}
for (int i = 0; i < B; i++) {
cin >> t[i];
}
for (int i = 0; i < Q; i+... | [
"assignment.change"
] | 924,947 | 924,948 | u564056510 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define mk make_pair
#define pb push_back
#define pf push_front
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
typedef pair<int, int> pii;
const int mod = 1000000007;
const int INF ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define mk make_pair
#define pb push_back
#define pf push_front
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
typedef pair<int, int> pii;
const int mod = 1000000007;
const int INF ... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 924,949 | 924,950 | u384299515 | cpp |
p03112 | #include <bits/stdc++.h>
using namespace std;
int binary_search(vector<long long> &n, int x) {
int ok = (int)n.size();
int ng = -1;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (n[mid] >= x)
ok = mid;
else
ng = mid;
}
if (ok == (int)n.size())
ok--;
return ok;
}
int ma... | #include <bits/stdc++.h>
using namespace std;
int binary_search(vector<long long> &n, long long x) {
int ok = (int)n.size();
int ng = -1;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (n[mid] >= x)
ok = mid;
else
ng = mid;
}
if (ok == (int)n.size())
ok--;
return ok;
}
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 924,985 | 924,984 | u013408661 | cpp |
p03112 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return (true);
} else {
return (false);
}
}
template <typename T> bool chmin(T &a, T b) {
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return (true);
} else {
return (false);
}
}
template <typename T> bool chmin(T &a, T b) {
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,995 | 924,996 | u408910484 | cpp |
p03112 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b), x(q);
for (auto &y : s) {
cin >> y;
}
for (auto &y : t) {
cin >> y;
}
for (auto &y : x) {
cin >> y;
}
for (auto p : x) {
ll rights, ri... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<ll> s(a), t(b), x(q);
for (auto &y : s) {
cin >> y;
}
for (auto &y : t) {
cin >> y;
}
for (auto &y : x) {
cin >> y;
}
for (auto p : x) {
ll rights, ri... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 924,997 | 924,998 | u342703951 | cpp |
p03112 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int a, b, q;
cin >> a >> b >> q;
vector<... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 925,003 | 925,004 | u521389909 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.