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 9 values |
|---|---|---|---|---|---|---|---|
p03034 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll N;
ll S[200010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> S[i];
ll res = 0;
repl(d, 1, N - 1) {
map<ll, bool> used;
ll sum = 0;
for (ll l = 0, r = N - 1; l < N && r > d; l += d, r -= d) {
if (used[l] || used[r] || l == r)
break;
used[l] = used[r] = true;
sum += S[l] + S[r];
}
maxch(res, sum);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll N;
ll S[200010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> S[i];
ll res = 0;
repl(d, 1, N - 1) {
map<ll, bool> used;
ll sum = 0;
for (ll l = 0, r = N - 1; l < N && r > d; l += d, r -= d) {
if (used[l] || used[r] || l == r)
break;
used[l] = used[r] = true;
sum += S[l] + S[r];
maxch(res, sum);
}
}
cout << res << endl;
return 0;
}
| [] | 844,896 | 844,897 | u762921614 | cpp |
p03034 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll N;
ll S[200010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> S[i];
ll res = 0;
repl(d, 1, N - 1) {
map<ll, bool> used;
ll sum = 0;
for (ll l = 0, r = N - 1; l < N && r >= 0; l += d, r -= d) {
if (used[l] || used[r] || l == r)
break;
used[l] = used[r] = true;
sum += S[l] + S[r];
}
maxch(res, sum);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll N;
ll S[200010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
rep(i, N) cin >> S[i];
ll res = 0;
repl(d, 1, N - 1) {
map<ll, bool> used;
ll sum = 0;
for (ll l = 0, r = N - 1; l < N && r > d; l += d, r -= d) {
if (used[l] || used[r] || l == r)
break;
used[l] = used[r] = true;
sum += S[l] + S[r];
maxch(res, sum);
}
}
cout << res << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 844,898 | 844,897 | u762921614 | cpp |
p03034 | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
LL p = 1000000007ll;
int main(void) {
LL n;
cin >> n;
vector<LL> s(n);
for (auto &x : s)
cin >> x;
LL answer = 0;
FOR(a, 1, n / 2 - 1) {
LL tmp = 0;
for (LL pos = 0; pos < n; pos += a) {
if (pos == n - pos - 1)
break;
if (pos - a == n - pos - 1)
break;
tmp += s[pos];
tmp += s[n - pos - 1];
answer = max(answer, tmp);
}
}
cout << answer << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
LL p = 1000000007ll;
int main(void) {
LL n;
cin >> n;
vector<LL> s(n);
for (auto &x : s)
cin >> x;
LL answer = 0;
FOR(a, 1, n) {
LL tmp = 0;
for (LL pos = 0; pos < n - a; pos += a) {
if (pos == n - pos - 1)
break;
if (pos - a == n - pos - 1)
break;
tmp += s[pos];
tmp += s[n - pos - 1];
answer = max(answer, tmp);
}
}
cout << answer << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 844,904 | 844,903 | u633757735 | cpp |
p03034 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
int n;
cin >> n;
VL a(n);
REP(i, n) a[i] = in();
ll ans = 0;
FOR(d, 1, n) {
ll tmp = 0;
set<int> st;
REP(x, n) {
int i = d * x;
int j = n - 1 - d * x;
if (i >= n - 1)
break;
tmp += a[i] + a[j];
if (i < d)
break;
if (st.count(i))
break;
st.insert(i);
if (st.count(j))
break;
st.insert(j);
chmax(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
typedef vector<double> VD;
typedef vector<VD> VVD;
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
int in() {
int x;
scanf("%d", &x);
return x;
}
ll lin() {
ll x;
scanf("%lld", &x);
return x;
}
int main() {
int n;
cin >> n;
VL a(n);
REP(i, n) a[i] = in();
ll ans = 0;
FOR(d, 1, n) {
ll tmp = 0;
set<int> st;
REP(x, n) {
int i = d * x;
int j = n - 1 - d * x;
if (i >= n - 1)
break;
tmp += a[i] + a[j];
if (j < d)
break;
if (st.count(i))
break;
st.insert(i);
if (st.count(j))
break;
st.insert(j);
chmax(ans, tmp);
}
}
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 844,920 | 844,921 | u016572066 | cpp |
p03034 | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 111111;
int A[maxn];
bool vis[maxn];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d", A + i);
LL Ans = 0;
for (int i = 1; i < N; ++i) {
LL ans = 0;
for (int j = 0, k = N - 1; j < N - 1 - i && !vis[j] && !vis[k];
j += i, k -= i) {
vis[j] = vis[k] = true;
ans += (A[j] + A[k]);
Ans = max(Ans, ans);
// printf("%d %d %d %lld\n",i,j,k,ans);
}
for (int j = 0, k = N - 1; j < N - 1 - i && vis[j] && vis[k];
j += i, k -= i)
vis[j] = vis[k] = false;
}
printf("%lld", Ans);
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 111111;
int A[maxn];
bool vis[maxn];
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; ++i)
scanf("%d", A + i);
LL Ans = 0;
for (int i = 1; i < N; ++i) {
LL ans = 0;
for (int j = 0, k = N - 1; j < N - 1 - i && !vis[j] && !vis[k] && j != k;
j += i, k -= i) {
vis[j] = vis[k] = true;
ans += (A[j] + A[k]);
Ans = max(Ans, ans);
// printf("%d %d %d %lld\n",i,j,k,ans);
}
for (int j = 0, k = N - 1; j < N - 1 - i && vis[j] && vis[k];
j += i, k -= i)
vis[j] = vis[k] = false;
}
printf("%lld", Ans);
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 844,926 | 844,927 | u136503093 | cpp |
p03035 | #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
#define MOD (long long)(1E9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 844,930 | 844,931 | u503170128 | cpp |
p03035 | #include <iostream>
using namespace std;
int solve(int A, int B) {
if (A >= 13)
return B;
else if (A <= 12)
return B / 2;
else
return 0;
}
int main() {
int A, B;
cin >> A >> B;
int answer = solve(A, B);
cout << answer;
return 0;
} | #include <iostream>
using namespace std;
int solve(int A, int B) {
if (A >= 13)
return B;
else if (A >= 6)
return B / 2;
else
return 0;
}
int main() {
int A, B;
cin >> A >> B;
int answer = solve(A, B);
cout << answer;
return 0;
} | [] | 844,932 | 844,933 | u483483585 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << a << endl;
else if (a >= 6)
cout << a / 2 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [
"identifier.change",
"io.output.change"
] | 844,934 | 844,935 | u523698212 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << 6 / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 844,945 | 844,946 | u618263300 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << 100 << endl;
else if (a > 5)
cout << 50 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 844,952 | 844,953 | u152437290 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a > 13)
cout << 100 << endl;
else if (a > 5)
cout << 50 << endl;
else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
const int N = 1e7;
ll v[N + 10];
ll a[N + 10];
bool compare(string &a, string &b) {
string f = a + b, c = b + a;
return f < c;
}
int main() {
ll a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a > 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 844,954 | 844,953 | u152437290 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if ((A >= 6) || (A <= 12)) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if ((A >= 6) && (A <= 12)) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 844,959 | 844,960 | u278557766 | cpp |
p03035 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, cost;
cin >> a >> b;
if (a >= 13) {
cost = b;
} else if (a >= 6 && a <= 12) {
cost = 13 / 2;
} else
cost = 0;
cout << cost;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int a, b, cost;
cin >> a >> b;
if (a >= 13) {
cost = b;
} else if (a >= 6 && a <= 12) {
cost = b / 2;
} else
cost = 0;
cout << cost;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 844,966 | 844,967 | u222481461 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5)
cout << 0 << endl;
else if (6 <= A && A <= 12)
cout << A / 2 << endl;
else
cout << A << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5)
cout << 0 << endl;
else if (6 <= A && A <= 12)
cout << B / 2 << endl;
else
cout << B << endl;
return 0;
} | [
"identifier.change",
"io.output.change"
] | 844,968 | 844,969 | u629603666 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if (x < 6) {
cout << 0;
} else if (x < 13) {
cout << x / 2;
} else {
cout << x;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y;
cin >> x >> y;
if (x < 6) {
cout << 0;
} else if (x < 13) {
cout << y / 2;
} else {
cout << y;
}
} | [
"identifier.change",
"io.output.change"
] | 844,970 | 844,971 | u565670345 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a >= 13)
ans = b;
if (a <= 5)
ans = 0;
else
ans = b / 2;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (a >= 13)
ans = b;
else if (a <= 5)
ans = 0;
else
ans = b / 2;
cout << ans << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 844,979 | 844,980 | u184943320 | cpp |
p03035 | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a > 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 844,981 | 844,982 | u526278960 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a < 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) \
; \
for (ll i = 0; i < (ll)n; i++)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 844,987 | 844,988 | u678961336 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n - 1; i >= (int)(k); i--)
#define all(x) (x).begin(), (x).end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
// V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const ll mod = 1000000007;
const ll inf = 1000000000000; // 10の12乗
int main() {
int a, b;
cin >> a >> b;
ll ans;
if (a >= 13)
ans = b;
else if (a < 5)
ans = 0;
else
ans = b / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n - 1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n - 1; i >= (int)(k); i--)
#define all(x) (x).begin(), (x).end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
// V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const ll mod = 1000000007;
const ll inf = 1000000000000; // 10の12乗
int main() {
int a, b;
cin >> a >> b;
ll ans;
if (a >= 13)
ans = b;
else if (a < 6)
ans = 0;
else
ans = b / 2;
cout << ans << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 844,989 | 844,990 | u823083725 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 844,991 | 844,992 | u757670973 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
}
if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A <= 5) {
cout << 0 << endl;
} else {
cout << B / 2 << endl;
}
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.return.add",
"control_flow.return.0.add"
] | 844,993 | 844,992 | u757670973 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main() {
int a, b;
cin >> a >> b;
if (a >= 6 && a <= 12)
b /= 2;
if (a < 5)
b = 0;
cout << b << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main() {
int a, b;
cin >> a >> b;
if (a >= 6 && a <= 12)
b /= 2;
if (a <= 5)
b = 0;
cout << b << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,004 | 845,005 | u682820318 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,006 | 845,007 | u596311864 | cpp |
p03035 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << a << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << a / 2 << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
}
| [
"identifier.change",
"io.output.change"
] | 845,011 | 845,012 | u239409893 | cpp |
p03035 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a >> b;
if (a > 13)
cout << a << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << a / 2 << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"io.output.change"
] | 845,013 | 845,012 | u239409893 | cpp |
p03035 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int main() {
int a, b;
cin >> a >> b;
if (a < 5)
cout << 0 << endl;
else if (a < 13) {
cout << b / 2 << endl;
} else
cout << b << endl;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector<ll> par;
vector<ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int main() {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a < 13) {
cout << b / 2 << endl;
} else
cout << b << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,014 | 845,015 | u577774192 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
}
if (a >= 6 && a <= 12) {
cout << b / 2;
} else {
cout << b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else if (a >= 6 && a <= 12) {
cout << b / 2;
} else {
cout << b;
}
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,024 | 845,025 | u018679195 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b <= 5) {
cout << 0;
} else {
if (b <= 12) {
cout << b / 2;
} else {
cout << b;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0;
} else {
if (a <= 12) {
cout << b / 2;
} else {
cout << b;
}
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,030 | 845,031 | u644497121 | cpp |
p03035 | /*
author : nishi5451
created: 11.08.2020 21:56:19
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (b >= 13)
cout << b << endl;
else if (b <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
return 0;
} | /*
author : nishi5451
created: 11.08.2020 22:00:58
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,061 | 845,062 | u033937898 | cpp |
p03035 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define all(con) con.begin(), con.end()
#define w(x) \
int x; \
cin >> x; \
while (x--)
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
// const int mod=998244353;
const int mod = 1000000007;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> pbds;
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif */
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cout << fixed << setprecision(8);
ll a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a >= 7 && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define all(con) con.begin(), con.end()
#define w(x) \
int x; \
cin >> x; \
while (x--)
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
// const int mod=998244353;
const int mod = 1000000007;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> pbds;
/*#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif */
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cout << fixed << setprecision(8);
ll a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,067 | 845,068 | u003425494 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 || a < 13) {
cout << b / 2 << endl;
} else if (a < 6) {
cout << "0" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a < 13) {
cout << b / 2 << endl;
} else if (a < 6) {
cout << b * 0 << endl;
}
return 0;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 845,074 | 845,075 | u089230684 | cpp |
p03035 | #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
int ret = B;
if (A < 5) {
ret = 0;
} else if (A <= 12) {
ret = B / 2;
}
std::cout << ret << std::endl;
return 0;
}
| #include <iostream>
int main() {
int A, B;
std::cin >> A >> B;
int ret = B;
if (A <= 5) {
ret = 0;
} else if (A <= 12) {
ret = B / 2;
}
std::cout << ret << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,096 | 845,097 | u306805217 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A < 5) {
cout << 0 << endl;
} else if (5 < A && A < 13) {
cout << B / 2 << endl;
} else {
cout << B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A <= 5) {
cout << 0 << endl;
} else if (5 < A && A < 13) {
cout << B / 2 << endl;
} else {
cout << B << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,119 | 845,120 | u112478047 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(int a, int b) { return (long long)a * b / gcd(a, b); }
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
cout << B / 2 << endl;
else if (A <= 5)
cout << 0 << endl;
else
cout << A << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
#define PI 3.14159265359
template <typename T> void remove(std::vector<T> &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(int a, int b) { return (long long)a * b / gcd(a, b); }
int main() {
int A, B;
cin >> A >> B;
if (A >= 6 && A <= 12)
cout << B / 2 << endl;
else if (A <= 5)
cout << 0 << endl;
else
cout << B << endl;
}
| [
"identifier.change",
"io.output.change"
] | 845,125 | 845,126 | u892615201 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << A << endl;
} else if (A >= 6 && 12 >= A) {
cout << A / 2 << endl;
}
else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (A >= 6 && 12 >= A) {
cout << B / 2 << endl;
}
else {
cout << 0 << endl;
}
} | [
"identifier.change",
"io.output.change"
] | 845,144 | 845,145 | u714624983 | cpp |
p03035 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << "0";
} else if ((a <= 12) && (a >= 6)) {
cout << a / 2;
} else if (a >= 13) {
cout << a;
}
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << "0";
} else if ((a <= 12) && (a >= 6)) {
cout << b / 2;
} else if (a >= 13) {
cout << b;
}
return 0;
} | [
"identifier.change",
"io.output.change"
] | 845,146 | 845,147 | u311099484 | cpp |
p03033 | #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 n, q;
cin >> n >> q;
int s[n], t[n], x[n];
rep(i, n) cin >> s[i] >> t[i] >> x[i];
pair<int, int> left[n];
rep(i, n) left[i] = mp(s[i] - x[i], i);
sort(left, left + n);
int d[q];
rep(i, q) cin >> d[i];
int lcou = 0;
// priority_queue<long long> small;
// priority_queue<long long, vector<long long>, greater<long long> > large;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
qu;
multiset<int> ms;
rep(i, q) {
if (lcou != q) {
while (d[i] >= left[lcou].first) {
int ind = left[lcou].second;
ms.insert(x[ind]);
qu.push(mp(t[ind] - x[ind] - 1, ind));
lcou++;
if (lcou == q)
break;
}
}
if (!qu.empty()) {
while (qu.top().first < d[i]) {
auto tm = qu.top();
qu.pop();
auto it = ms.lower_bound(x[tm.second]);
// cout << "query i erase x: " << i << " " << *it <<" " <<
//x[tm.second] << endl; cout << ms.size() << endl;
ms.erase(it);
// cout << ms.size() << endl;
if (qu.empty())
break;
}
}
// for(auto j:ms) cout << j << " ";
// cout << "" << endl;
// cout << *(ms.begin()) << endl;
if (qu.empty())
cout << -1 << endl;
else {
cout << *(ms.begin()) << endl;
}
}
return 0;
}
| #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 n, q;
cin >> n >> q;
int s[n], t[n], x[n];
rep(i, n) cin >> s[i] >> t[i] >> x[i];
pair<int, int> left[n];
rep(i, n) left[i] = mp(s[i] - x[i], i);
sort(left, left + n);
int d[q];
rep(i, q) cin >> d[i];
int lcou = 0;
// priority_queue<long long> small;
// priority_queue<long long, vector<long long>, greater<long long> > large;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
qu;
multiset<int> ms;
rep(i, q) {
if (lcou != n) {
while (d[i] >= left[lcou].first) {
int ind = left[lcou].second;
ms.insert(x[ind]);
qu.push(mp(t[ind] - x[ind] - 1, ind));
lcou++;
if (lcou == n)
break;
}
}
if (!qu.empty()) {
while (qu.top().first < d[i]) {
auto tm = qu.top();
qu.pop();
auto it = ms.lower_bound(x[tm.second]);
ms.erase(it);
if (qu.empty())
break;
}
}
if (qu.empty())
cout << -1 << endl;
else {
cout << *(ms.begin()) << endl;
}
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,153 | 845,154 | u949755084 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
const int K = 19;
const int KM = 1 << (K - 1);
int laz[1 << K];
int zero = 2e9;
void update(int L, int R, int X, int A, int l, int r) {
if (r <= L || R <= l)
return;
if (L <= l && r <= R) {
laz[A] = min(laz[A], X);
return;
}
update(L, R, X, A * 2, l, (l + r) / 2);
update(L, R, X, A * 2 + 1, (l + r) / 2, r);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
pair<int, pair<int, int>> XST[200000];
rep(i, N) {
int S, T, X;
cin >> S >> T >> X;
XST[i] = mp(X, mp(S, T));
}
int D[200002];
D[0] = -zero;
D[Q + 1] = zero;
rep1(i, Q) cin >> D[i];
rep(i, 1 << K) laz[i] = zero;
rep(i, N) {
int L = lower_bound(D, D + Q, XST[i].second.first - XST[i].first) - D;
int R = lower_bound(D, D + Q, XST[i].second.second - XST[i].first) - D;
if (L < R)
update(L, R, XST[i].first, 1, 0, KM);
}
rep1(i, KM - 1) {
laz[i * 2] = min(laz[i * 2], laz[i]);
laz[i * 2 + 1] = min(laz[i * 2 + 1], laz[i]);
}
rep1(i, Q) {
if (laz[KM + i] == zero)
co(-1);
else
co(laz[KM + i]);
}
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
const int K = 19;
const int KM = 1 << (K - 1);
int laz[1 << K];
int zero = 2e9;
void update(int L, int R, int X, int A, int l, int r) {
if (r <= L || R <= l)
return;
if (L <= l && r <= R) {
laz[A] = min(laz[A], X);
return;
}
update(L, R, X, A * 2, l, (l + r) / 2);
update(L, R, X, A * 2 + 1, (l + r) / 2, r);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
pair<int, pair<int, int>> XST[200000];
rep(i, N) {
int S, T, X;
cin >> S >> T >> X;
XST[i] = mp(X, mp(S, T));
}
int D[200002];
D[0] = -zero;
D[Q + 1] = zero;
rep1(i, Q) cin >> D[i];
rep(i, 1 << K) laz[i] = zero;
rep(i, N) {
int L = lower_bound(D, D + Q + 2, XST[i].second.first - XST[i].first) - D;
int R = lower_bound(D, D + Q + 2, XST[i].second.second - XST[i].first) - D;
if (L < R)
update(L, R, XST[i].first, 1, 0, KM);
}
rep1(i, KM - 1) {
laz[i * 2] = min(laz[i * 2], laz[i]);
laz[i * 2 + 1] = min(laz[i * 2 + 1], laz[i]);
}
rep1(i, Q) {
if (laz[KM + i] == zero)
co(-1);
else
co(laz[KM + i]);
}
Would you please return 0;
} | [
"assignment.change"
] | 845,163 | 845,164 | u096883693 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; \
for (int(i) = (a); (i) < (b); ++(i)) \
cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); \
cout << "]\n"; \
} while (0)
#define p_map(map, it) \
do { \
cout << "{"; \
for (auto(it) = map.begin();; ++(it)) { \
if ((it) == map.end()) { \
cout << "}\n"; \
break; \
} else \
cout << "" << (it)->first << "=>" << (it)->second << ", "; \
} \
} while (0)
struct LazySegmentTree {
private:
int n;
vector<ll> node, lazy;
vector<bool> upd;
public:
LazySegmentTree(vector<ll> v) {
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, 0);
upd.resize(2 * n - 1, false);
for (int i = 0; i < sz; ++i)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; --i)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void eval(int k, int l, int r) {
if (upd[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[2 * k + 1] = lazy[2 * k + 2] = lazy[k];
upd[2 * k + 1] = upd[2 * k + 2] = true;
}
lazy[k] = 0;
upd[k] = false;
}
}
void update(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
eval(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
upd[k] = true;
eval(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = min(node[2 * k + 1], node[2 * k + 2]);
}
}
ll getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (b <= l || r <= a)
return INT64_MAX;
eval(k, l, r);
if (a <= l && r <= b)
return node[k];
ll vl = getmin(a, b, k * 2 + 1, l, (l + r) / 2);
ll vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
struct kouji {
int s, t, x;
bool operator<(const kouji &a) const { return x < a.x; }
};
int main() {
int n, q;
cin >> n >> q;
vector<kouji> a(n), b(n);
vector<int> d(q), e(n);
for (int i = 0; i < n; ++i)
cin >> a[i].s >> a[i].t >> a[i].x;
for (int i = 0; i < q; ++i)
cin >> d[i];
/*
map<int,int> mp,mp2;
for (int i = 0;i < n;++i) {
mp[a[i].s] = 0;
mp[a[i].t] = 0;
mp[a[i].x] = 0;
}
for (int i = 0;i < q;++i) mp[d[i]] = 0;
int x = 1;
for (auto& i : mp) {
i.second = x;
mp2[x] = i.first;
x++;
}
for (int i = 0;i < n;++i) {
b[i].s = mp[a[i].s];
b[i].t = mp[a[i].t];
b[i].x = mp[a[i].x];
}
for (int i = 0;i < q;++i) e[i] = mp[d[i]];
*/
LazySegmentTree seg(vector<ll>(q + 1, 1LL << 60));
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
d.push_back(1e9);
for (int i = 0; i < n; ++i) {
int l = lower_bound(d.begin(), d.end(), a[i].s - a[i].x) - d.begin();
int r = lower_bound(d.begin(), d.end(), a[i].t - a[i].x) - d.begin();
seg.update(l, r, a[i].x);
// cout << l << " " << r << endl;
}
for (int i = 0; i < q; ++i) {
int l = seg.getmin(i, i + 1);
if (l < 1e9)
printf("%d\n", l);
else
printf("-1\n");
}
// for (int i = 0;i < n;++i) cout << a[i].s << " " << a[i].t << " " << a[i].x
// << endl; for (int i = 0;i < q+1;++i) cout << seg.getmin(i,i+1) << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; \
for (int(i) = (a); (i) < (b); ++(i)) \
cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); \
cout << "]\n"; \
} while (0)
#define p_map(map, it) \
do { \
cout << "{"; \
for (auto(it) = map.begin();; ++(it)) { \
if ((it) == map.end()) { \
cout << "}\n"; \
break; \
} else \
cout << "" << (it)->first << "=>" << (it)->second << ", "; \
} \
} while (0)
struct LazySegmentTree {
private:
int n;
vector<ll> node, lazy;
vector<bool> upd;
public:
LazySegmentTree(vector<ll> v) {
int sz = v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, 0);
upd.resize(2 * n - 1, false);
for (int i = 0; i < sz; ++i)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; --i)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void eval(int k, int l, int r) {
if (upd[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[2 * k + 1] = lazy[2 * k + 2] = lazy[k];
upd[2 * k + 1] = upd[2 * k + 2] = true;
}
lazy[k] = 0;
upd[k] = false;
}
}
void update(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
eval(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
upd[k] = true;
eval(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = min(node[2 * k + 1], node[2 * k + 2]);
}
}
ll getmin(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
if (b <= l || r <= a)
return INT64_MAX;
eval(k, l, r);
if (a <= l && r <= b)
return node[k];
ll vl = getmin(a, b, k * 2 + 1, l, (l + r) / 2);
ll vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
struct kouji {
int s, t, x;
bool operator<(const kouji &a) const { return x < a.x; }
};
int main() {
int n, q;
cin >> n >> q;
vector<kouji> a(n), b(n);
vector<int> d(q), e(n);
for (int i = 0; i < n; ++i)
cin >> a[i].s >> a[i].t >> a[i].x;
for (int i = 0; i < q; ++i)
cin >> d[i];
LazySegmentTree seg(vector<ll>(q + 1, 1LL << 60));
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
d.push_back(1e9);
for (int i = 0; i < n; ++i) {
int l = lower_bound(d.begin(), d.end(), a[i].s - a[i].x) - d.begin();
int r = lower_bound(d.begin(), d.end(), a[i].t - a[i].x) - d.begin();
seg.update(l, r, a[i].x);
// cout << l << " " << r << endl;
}
for (int i = 0; i < q; ++i) {
ll l = seg.getmin(i, i + 1);
if (l < 1e9)
printf("%d\n", l);
else
printf("-1\n");
}
// for (int i = 0;i < n;++i) cout << a[i].s << " " << a[i].t << " " << a[i].x
// << endl; for (int i = 0;i < q+1;++i) cout << seg.getmin(i,i+1) << " ";
return 0;
} | [
"variable_declaration.type.change"
] | 845,218 | 845,219 | u506255180 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
struct LazySegmentTree {
private:
int n;
vector<LL> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<LL> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, -1);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, LL x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = max(node[2 * k + 1], node[2 * k + 2]);
}
}
LL find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return -1;
if (a <= l && r <= b)
return node[k];
LL vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
LL vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return max(vl, vr);
}
};
int main() {
int n, q;
cin >> n >> q;
vector<LL> s(n), t(n), x(n), d(q);
vector<pair<LL, P>> v(n);
LazySegmentTree seg(vector<LL>(400001, -1));
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
v[i] = mp(x[i], mp(s[i], t[i]));
}
sort(ALL(v));
for (int i = 0; i < q; i++) {
cin >> d[i];
}
for (int i = q - 1; i >= 0; i--) {
int l = lower_bound(ALL(d), v[i].sc.fs - v[i].fs) - d.begin();
int r = lower_bound(ALL(d), v[i].sc.sc - v[i].fs) - d.begin();
seg.update(l, r, v[i].fs);
}
for (int i = 0; i < q; i++) {
LL t = seg.find(i, i + 1);
cout << t << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
struct LazySegmentTree {
private:
int n;
vector<LL> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<LL> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, -1);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, LL x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = max(node[2 * k + 1], node[2 * k + 2]);
}
}
LL find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return -1;
if (a <= l && r <= b)
return node[k];
LL vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
LL vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return max(vl, vr);
}
};
int main() {
int n, q;
cin >> n >> q;
vector<LL> s(n), t(n), x(n), d(q);
vector<pair<LL, P>> v(n);
LazySegmentTree seg(vector<LL>(q + 1, -1));
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
v[i] = mp(x[i], mp(s[i], t[i]));
}
sort(ALL(v));
for (int i = 0; i < q; i++) {
cin >> d[i];
}
for (int i = n - 1; i >= 0; i--) {
int l = lower_bound(ALL(d), v[i].sc.fs - v[i].fs) - d.begin();
int r = lower_bound(ALL(d), v[i].sc.sc - v[i].fs) - d.begin();
seg.update(l, r, v[i].fs);
}
for (int i = 0; i < q; i++) {
LL t = seg.find(i, i + 1);
cout << t << endl;
}
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 845,230 | 845,231 | u640323045 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
struct LazySegmentTree {
private:
int n;
vector<LL> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<LL> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, -1);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, LL x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = max(node[2 * k + 1], node[2 * k + 2]);
}
}
LL find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return -1;
if (a <= l && r <= b)
return node[k];
LL vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
LL vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return max(vl, vr);
}
};
int main() {
int n, q;
cin >> n >> q;
vector<LL> s(n), t(n), x(n), d(q);
vector<pair<LL, P>> v(n);
LazySegmentTree seg(vector<LL>(q + 1, -1));
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
v[i] = mp(x[i], mp(s[i], t[i]));
}
sort(ALL(v));
for (int i = 0; i < q; i++) {
cin >> d[i];
}
for (int i = q - 1; i >= 0; i--) {
int l = lower_bound(ALL(d), v[i].sc.fs - v[i].fs) - d.begin();
int r = lower_bound(ALL(d), v[i].sc.sc - v[i].fs) - d.begin();
seg.update(l, r, v[i].fs);
}
for (int i = 0; i < q; i++) {
LL t = seg.find(i, i + 1);
cout << t << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
const int INF = 1 << 30;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
struct LazySegmentTree {
private:
int n;
vector<LL> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<LL> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, -1);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, LL x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = max(node[2 * k + 1], node[2 * k + 2]);
}
}
LL find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return -1;
if (a <= l && r <= b)
return node[k];
LL vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
LL vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return max(vl, vr);
}
};
int main() {
int n, q;
cin >> n >> q;
vector<LL> s(n), t(n), x(n), d(q);
vector<pair<LL, P>> v(n);
LazySegmentTree seg(vector<LL>(q + 1, -1));
for (int i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
v[i] = mp(x[i], mp(s[i], t[i]));
}
sort(ALL(v));
for (int i = 0; i < q; i++) {
cin >> d[i];
}
for (int i = n - 1; i >= 0; i--) {
int l = lower_bound(ALL(d), v[i].sc.fs - v[i].fs) - d.begin();
int r = lower_bound(ALL(d), v[i].sc.sc - v[i].fs) - d.begin();
seg.update(l, r, v[i].fs);
}
for (int i = 0; i < q; i++) {
LL t = seg.find(i, i + 1);
cout << t << endl;
}
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 845,232 | 845,231 | u640323045 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct RW {
ll S, T, X;
};
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> p;
vector<RW> R(N);
for (int i = 0; i < N; i++) {
cin >> R[i].S >> R[i].T >> R[i].X;
RW r = R[i];
p.push_back(r.S - r.X - 1);
p.push_back(r.S - r.X);
p.push_back(r.T - r.X - 1);
p.push_back(r.T - r.X);
}
sort(R.begin(), R.end(), [](RW &a, RW &b) { return a.X < b.X; });
vector<ll> D(Q);
for (int i = 0; i < Q; i++) {
cin >> D[i];
p.push_back(D[i]);
}
sort(p.begin(), p.end());
p.erase(unique(p.begin(), p.end()), p.end());
vector<int> num(p.size(), -1);
set<int> todo;
for (int i = 0; i < p.size(); i++)
todo.insert(i);
for (int i = 0; i < N; i++) {
ll p1 = lower_bound(p.begin(), p.end(), R[i].S - R[i].X) - p.begin();
ll p2 = lower_bound(p.begin(), p.end(), R[i].T - R[i].X) - p.begin();
auto it = todo.find(p1);
while (it != todo.end() && *it < p2) {
ll v = *it;
num[v] = i;
it = next(it);
todo.erase(v);
}
}
for (int i = 0; i < Q; i++) {
ll v = lower_bound(p.begin(), p.end(), D[i]) - p.begin();
ll ans;
if (num[v] >= 0) {
ans = R[num[v]].X;
} else {
ans = -1;
}
cout << ans << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct RW {
ll S, T, X;
};
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> p;
vector<RW> R(N);
for (int i = 0; i < N; i++) {
cin >> R[i].S >> R[i].T >> R[i].X;
RW r = R[i];
p.push_back(r.S - r.X - 1);
p.push_back(r.S - r.X);
p.push_back(r.T - r.X - 1);
p.push_back(r.T - r.X);
}
sort(R.begin(), R.end(), [](RW &a, RW &b) { return a.X < b.X; });
vector<ll> D(Q);
for (int i = 0; i < Q; i++) {
cin >> D[i];
p.push_back(D[i]);
}
sort(p.begin(), p.end());
p.erase(unique(p.begin(), p.end()), p.end());
vector<int> num(p.size(), -1);
set<int> todo;
for (int i = 0; i < p.size(); i++)
todo.insert(i);
for (int i = 0; i < N; i++) {
ll p1 = lower_bound(p.begin(), p.end(), R[i].S - R[i].X) - p.begin();
ll p2 = lower_bound(p.begin(), p.end(), R[i].T - R[i].X) - p.begin();
auto it = todo.lower_bound(p1);
while (it != todo.end() && *it < p2) {
ll v = *it;
num[v] = i;
it = next(it);
todo.erase(v);
}
}
for (int i = 0; i < Q; i++) {
ll v = lower_bound(p.begin(), p.end(), D[i]) - p.begin();
ll ans;
if (num[v] >= 0) {
ans = R[num[v]].X;
} else {
ans = -1;
}
cout << ans << "\n";
}
return 0;
} | [
"call.function.change"
] | 845,263 | 845,264 | u930841425 | cpp |
p03033 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \
exit(0); \
} while (0)
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : x) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define exp2(x) (1LL << (x))
using namespace std;
using ll = long long;
const int NN = 2 * 1e5 + 10;
int S[NN], T[NN], X[NN];
int D[NN];
int W[NN];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N, Q;
cin >> N >> Q;
vector<pair<ll, ll>> RB;
rep(i, 0, N - 1) {
cin >> S[i] >> T[i] >> X[i];
RB.emplace_back(T[i], i);
}
set<pair<ll, int>> PP;
rep(i, 0, Q - 1) {
cin >> D[i];
PP.emplace(D[i], i);
}
sort(RB.begin(), RB.end());
rep(i, 0, Q - 1) W[i] = -1;
for (auto &e : RB) {
int i = e.second;
int lb = S[i] - X[i];
int ub = T[i] - X[i] - 1;
if (PP.empty())
break;
auto it = PP.lower_bound({lb, -1LL});
while (!PP.empty() && it != PP.end() && it->first <= ub &&
it->first >= lb) {
int id = it->second;
W[id] = X[i];
PP.erase(it++);
}
}
rep(i, 0, Q - 1) cout << W[i] << "\n";
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i <= (b); i++)
#define END(x) \
do { \
cout << (x) << endl; \
exit(0); \
} while (0)
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : x) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define exp2(x) (1LL << (x))
using namespace std;
using ll = long long;
const int NN = 2 * 100 * 1000 + 110;
int S[NN], T[NN], X[NN];
int D[NN];
int W[NN];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N, Q;
cin >> N >> Q;
vector<pair<ll, ll>> RB;
rep(i, 0, N - 1) {
cin >> S[i] >> T[i] >> X[i];
RB.emplace_back(X[i], i);
}
set<pair<ll, int>> PP;
rep(i, 0, Q - 1) {
cin >> D[i];
PP.emplace(D[i], i);
}
sort(RB.begin(), RB.end());
rep(i, 0, Q - 1) W[i] = -1;
for (auto &e : RB) {
int i = e.second;
int lb = S[i] - X[i];
int ub = T[i] - X[i] - 1;
if (PP.empty())
break;
auto it = PP.lower_bound({lb, -1LL});
while (!PP.empty() && it != PP.end() && it->first <= ub &&
it->first >= lb) {
int id = it->second;
W[id] = X[i];
PP.erase(it++);
}
}
rep(i, 0, Q - 1) cout << W[i] << "\n";
}
| [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"call.arguments.change"
] | 845,274 | 845,275 | u993688697 | cpp |
p03035 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B << endl;
} else if (6 <= A < 13) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (13 <= A) {
cout << B << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 845,296 | 845,297 | u084069244 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
}
if (A < 6) {
cout << 0 << endl;
}
if (A > 6 && A < 13) {
cout << B / 2 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A > 12) {
cout << B << endl;
}
if (A < 6) {
cout << 0 << endl;
}
if (A > 5 && A < 13) {
cout << B / 2 << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,306 | 845,307 | u425231382 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0 << endl;
} else if (a <= 12) {
cout << b << endl;
} else {
cout << (b / 2) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a < 6) {
cout << 0 << endl;
} else if (a <= 12) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
} | [
"expression.operation.binary.add"
] | 845,321 | 845,322 | u654466549 | cpp |
p03035 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a < 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
else
cout << b / 2 << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,332 | 845,333 | u849151695 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef pair<ll, ll> P;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef pair<ll, ll> P;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,346 | 845,347 | u077104253 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int dx[4] = {0, -1, 0, 1};
int dy[4] = {-1, 0, 1, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"expression.operation.binary.remove"
] | 845,352 | 845,353 | u609061751 | cpp |
p03035 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int a, b, fare;
cin >> a >> b;
if (a >= 13) {
fare = a;
} else if (a >= 6) {
fare = a / 2;
} else {
fare = 0;
}
cout << fare << endl;
} | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int a, b, fare;
cin >> a >> b;
if (a >= 13) {
fare = b;
} else if (a >= 6) {
fare = b / 2;
} else {
fare = 0;
}
cout << fare << endl;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 845,354 | 845,355 | u790493075 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int a, b;
cin >> a >> b;
if (a == 0) {
cout << 0 << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int a, b;
cin >> a >> b;
if (a <= 5) {
cout << 0 << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << b << endl;
}
return 0;
}
| [] | 845,368 | 845,369 | u651235280 | cpp |
p03035 | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii, nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade, bde) __gcd(ade, bde)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define vc vector<char>
#define pb(ade) push_back(ade)
#define pp pop_back()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define type(ade) typeid(ade).name();
#define starting() auto start = high_resolution_clock::now()
#define ending() \
auto stop = high_resolution_clock::now(); \
auto duration = duration_cast<microseconds>(stop - start); \
cerr << "\n" \
<< "\n" \
<< "Execution Time : " << duration.count() / 1000 << " ms" \
<< "\n"
template <typename T1> void print(vector<T1> arr) {
int l = (int)arr.size();
cerr << "[";
for (int i = 0; i < l; i++) {
(i == l - 1) ? cerr << arr[i] : cerr << arr[i] << ",";
}
cerr << "]"
<< "\n";
}
template <typename T1> void printArr(int arr[], int l) {
cerr << "[";
for (int i = 0; i < (int)l; i++) {
(i == l - 1) ? cerr << arr[i] : cerr << arr[i] << ",";
}
cerr << "]"
<< "\n";
}
template <typename T1> void console(vector<vector<T1>> arr) {
for (int i = 0; i < (int)arr.size(); ++i) {
cerr << "\n"
<< " [";
for (int j = 0; j < (int)arr[i].size(); ++j) {
(j == (int)arr[i].size() - 1) ? cerr << arr[i][j]
: cerr << arr[i][j] << ",";
}
cerr << "]";
}
cerr << "\n";
}
template <typename T1, typename T2> void mapped(map<T1, T2> m) {
for (auto ite = m.begin(); ite != m.end(); ++ite) {
cerr << "'" << ite->first << "'"
<< " : " << ite->second << "\n";
}
}
template <typename T1, typename T2> void mappedArr(map<T1, vector<T2>> m) {
for (auto ity = m.begin(); ity != m.end(); ++ity) {
cerr << "'" << ity->first << "'"
<< " : "
<< "[";
for (int i = 0; i < (int)ity->second.size(); ++i) {
(i == (int)ity->second.size() - 1) ? cerr << ity->second[i]
: cerr << ity->second[i] << ",";
}
cerr << "]"
<< "\n";
}
}
string int_to_string(int x) {
stringstream ss;
ss << x;
string ni = ss.str();
return ni;
}
int char_to_int(char c) {
int n = (int)c - 48;
return n;
}
int string_to_int(string x) {
int n;
stringstream s(x);
s >> n;
return n;
}
template <typename T1, typename T2> void vectPair(vector<pair<T1, T2>> vp) {
for (int arrp = 0; arrp < (int)vp.size(); ++arrp) {
cerr << "(" << vp[arrp].first << "," << vp[arrp].second << ")"
<< "\n";
}
}
// unordered_map<int,int> um;
// unordered_set<int> us;
// set<int> s;
// v.front() gives the first element of vector
// v.back() gives the last element of vector
// insert erase substr
// g++ -o Legendary-Grandmaster
// Legendary-Grandmaster.cpp&Legendary-Grandmaster.exe cd
// C:\Users\158si\Desktop\Algorithim\codeForces\elite
// for-bash cd C:/Users/158si/Desktop/Algorithim/codeForces/elite
// memset(arr,element,sizeofarray);//Converts the value ch to unsigned char and
// copies it
// into each of the first n characters of the object pointed to by str[].
// g++ -o impulse.exe impulse.cpp
// puts
typedef long long ll;
ll power(ll a, ll n) {
ll ans = 1;
for (ll i = 0; pow(2, i) <= n; ++i) {
if ((n >> i) & 1) {
ans *= a;
}
a = a * a;
}
return ans;
}
void inverse(vector<ll> &v, ll w, ll p) {
v[1] = 1;
for (ll i = 2; i < w; ++i) {
v[i] = (p - (p / i) * v[p % i] % p) % p;
}
}
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll ans = a * b / gcd(a, b);
return ans;
}
const ll INF = 1e18L + 5;
const int MOD = 1e9 + 7;
// vectPair<type>(v) //vector<pair>
// mappedArr<type,type>(m) //map<array>
// mapped<type,type>(m) // map
// printArr<type>(arr,len) //arry
// print<type>(vect) //1D vector
// console<type>(arr) //2D vector
/**************************/
// some usefull links
// https://csacademy.com/app/graph_editor/ //for visualization of graph and
// trees https://www.desmos.com/calculator //for lines and graphs in a
// plane https://www.wolframalpha.com/ //for maths scientific
// calculation https://oeis.org/ //another math
// scientific calculation webite https://codeforces.com/blog/entry/70330 //2d
// visualizer
/// things to look for
// * int overflow, array bounds
// * special cases (n=1?)
// * analyze the time complexity properly
// * read the question properly and check for constrains
// * while using global variable make sure to re-initialize it
int main() {
IOS;
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
int a, n;
cin >> a;
if (a < 6) {
cout << 0;
} else if (a > 12) {
cout << n;
} else {
cout << n / 2;
}
return 0;
}
| #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii, nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade, bde) __gcd(ade, bde)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define vc vector<char>
#define pb(ade) push_back(ade)
#define pp pop_back()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define type(ade) typeid(ade).name();
#define starting() auto start = high_resolution_clock::now()
#define ending() \
auto stop = high_resolution_clock::now(); \
auto duration = duration_cast<microseconds>(stop - start); \
cerr << "\n" \
<< "\n" \
<< "Execution Time : " << duration.count() / 1000 << " ms" \
<< "\n"
template <typename T1> void print(vector<T1> arr) {
int l = (int)arr.size();
cerr << "[";
for (int i = 0; i < l; i++) {
(i == l - 1) ? cerr << arr[i] : cerr << arr[i] << ",";
}
cerr << "]"
<< "\n";
}
template <typename T1> void printArr(int arr[], int l) {
cerr << "[";
for (int i = 0; i < (int)l; i++) {
(i == l - 1) ? cerr << arr[i] : cerr << arr[i] << ",";
}
cerr << "]"
<< "\n";
}
template <typename T1> void console(vector<vector<T1>> arr) {
for (int i = 0; i < (int)arr.size(); ++i) {
cerr << "\n"
<< " [";
for (int j = 0; j < (int)arr[i].size(); ++j) {
(j == (int)arr[i].size() - 1) ? cerr << arr[i][j]
: cerr << arr[i][j] << ",";
}
cerr << "]";
}
cerr << "\n";
}
template <typename T1, typename T2> void mapped(map<T1, T2> m) {
for (auto ite = m.begin(); ite != m.end(); ++ite) {
cerr << "'" << ite->first << "'"
<< " : " << ite->second << "\n";
}
}
template <typename T1, typename T2> void mappedArr(map<T1, vector<T2>> m) {
for (auto ity = m.begin(); ity != m.end(); ++ity) {
cerr << "'" << ity->first << "'"
<< " : "
<< "[";
for (int i = 0; i < (int)ity->second.size(); ++i) {
(i == (int)ity->second.size() - 1) ? cerr << ity->second[i]
: cerr << ity->second[i] << ",";
}
cerr << "]"
<< "\n";
}
}
string int_to_string(int x) {
stringstream ss;
ss << x;
string ni = ss.str();
return ni;
}
int char_to_int(char c) {
int n = (int)c - 48;
return n;
}
int string_to_int(string x) {
int n;
stringstream s(x);
s >> n;
return n;
}
template <typename T1, typename T2> void vectPair(vector<pair<T1, T2>> vp) {
for (int arrp = 0; arrp < (int)vp.size(); ++arrp) {
cerr << "(" << vp[arrp].first << "," << vp[arrp].second << ")"
<< "\n";
}
}
// unordered_map<int,int> um;
// unordered_set<int> us;
// set<int> s;
// v.front() gives the first element of vector
// v.back() gives the last element of vector
// insert erase substr
// g++ -o Legendary-Grandmaster
// Legendary-Grandmaster.cpp&Legendary-Grandmaster.exe cd
// C:\Users\158si\Desktop\Algorithim\codeForces\elite
// for-bash cd C:/Users/158si/Desktop/Algorithim/codeForces/elite
// memset(arr,element,sizeofarray);//Converts the value ch to unsigned char and
// copies it
// into each of the first n characters of the object pointed to by str[].
// g++ -o impulse.exe impulse.cpp
// puts
typedef long long ll;
ll power(ll a, ll n) {
ll ans = 1;
for (ll i = 0; pow(2, i) <= n; ++i) {
if ((n >> i) & 1) {
ans *= a;
}
a = a * a;
}
return ans;
}
void inverse(vector<ll> &v, ll w, ll p) {
v[1] = 1;
for (ll i = 2; i < w; ++i) {
v[i] = (p - (p / i) * v[p % i] % p) % p;
}
}
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll ans = a * b / gcd(a, b);
return ans;
}
const ll INF = 1e18L + 5;
const int MOD = 1e9 + 7;
// vectPair<type>(v) //vector<pair>
// mappedArr<type,type>(m) //map<array>
// mapped<type,type>(m) // map
// printArr<type>(arr,len) //arry
// print<type>(vect) //1D vector
// console<type>(arr) //2D vector
/**************************/
// some usefull links
// https://csacademy.com/app/graph_editor/ //for visualization of graph and
// trees https://www.desmos.com/calculator //for lines and graphs in a
// plane https://www.wolframalpha.com/ //for maths scientific
// calculation https://oeis.org/ //another math
// scientific calculation webite https://codeforces.com/blog/entry/70330 //2d
// visualizer
/// things to look for
// * int overflow, array bounds
// * special cases (n=1?)
// * analyze the time complexity properly
// * read the question properly and check for constrains
// * while using global variable make sure to re-initialize it
int main() {
IOS;
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
int a, n;
cin >> a >> n;
if (a < 6) {
cout << 0;
} else if (a > 12) {
cout << n;
} else {
cout << n / 2;
}
return 0;
}
| [
"expression.operation.binary.add"
] | 845,385 | 845,386 | u403668916 | cpp |
p03035 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a < 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,389 | 845,390 | u789673498 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
if (a <= 12 && a >= 6)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 12 && a >= 6)
cout << b / 2;
else
cout << 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,395 | 845,396 | u478705580 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 13)
cout << b;
if (a < 12 && a >= 6)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a <= 12 && a >= 6)
cout << b / 2;
else
cout << 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,397 | 845,396 | u478705580 | cpp |
p03035 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll a, b;
cin >> a >> b;
if (a < 7)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
int main() {
ll a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << endl;
else if (a < 13)
cout << b / 2 << endl;
else
cout << b << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,398 | 845,399 | u016987091 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using vll = vector<ll>;
using P = pair<int, int>;
const int inf = 1e9 + 7;
const ll INF = 1e18;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,408 | 845,409 | u531461815 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (5 >= A) {
cout << 0;
} else if (12 > A) {
cout << B / 2;
} else {
cout << B;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (5 >= A) {
cout << 0;
} else if (12 >= A) {
cout << B / 2;
} else {
cout << B;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,410 | 845,411 | u659267170 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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;
}
// name[i][j]-> vvl name(i,vl(j))
// map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
signed main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 >= a)
cout << b / 2;
else
cout << 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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;
}
// name[i][j]-> vvl name(i,vl(j))
// map<int,int>mp
//余りを切り上げる => (a + b - 1) / b
signed main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a)
cout << b / 2;
else
cout << 0;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,423 | 845,424 | u164181205 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0 << endl;
if (6 <= a && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b;
cin >> a >> b;
if (a <= 5)
cout << 0 << endl;
else if (6 <= a && a <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,425 | 845,426 | u442855610 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a > 12)
cout << b << endl;
else if (a <= 12 && a >= 6)
cout << b << endl;
else
cout << 0 << endl;
return (0);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 12 && a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return (0);
}
| [
"expression.operation.binary.add"
] | 845,438 | 845,439 | u025047544 | cpp |
p03033 | #include <algorithm>
#include <queue>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
int main() {
const int n = getInt();
const int q = getInt();
vector<int> s(n);
vector<int> t(n);
vector<int> x(n);
vector<pair<pair<int, int>, int>> v(n);
REP(i, n) {
s[i] = getInt();
t[i] = getInt();
x[i] = getInt();
// s <= d + x <= t - 1
// s - x <= d <= t - x - 1
v[i].first.first = s[i] - x[i];
v[i].first.second = t[i] - x[i] - 1;
v[i].second = x[i];
}
sort(v.begin(), v.end());
int idx = 0;
typedef pair<int, int> data;
priority_queue<data, vector<data>, greater<data>> pq;
set<int> xx;
REP(i, q) {
const int d = getInt();
while (idx < n) {
if (v[idx].first.first <= d) {
pq.push(data(v[idx].first.second, v[idx].second));
xx.insert(v[idx].second);
++idx;
} else {
break;
}
}
while (pq.size()) {
const data dt = pq.top();
if (dt.first < d) {
xx.erase(dt.second);
pq.pop();
} else {
break;
}
}
if (xx.size()) {
printf("%d\n", *xx.begin());
} else {
printf("%d\n", -1);
}
}
return 0;
} | #include <algorithm>
#include <queue>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#include <cstdio>
inline int getInt() {
int s;
scanf("%d", &s);
return s;
}
#include <set>
using namespace std;
int main() {
const int n = getInt();
const int q = getInt();
vector<int> s(n);
vector<int> t(n);
vector<int> x(n);
vector<pair<pair<int, int>, int>> v(n);
REP(i, n) {
s[i] = getInt();
t[i] = getInt();
x[i] = getInt();
// s <= d + x <= t - 1
// s - x <= d <= t - x - 1
v[i].first.first = s[i] - x[i];
v[i].first.second = t[i] - x[i] - 1;
v[i].second = x[i];
}
sort(v.begin(), v.end());
int idx = 0;
typedef pair<int, int> data;
priority_queue<data, vector<data>, greater<data>> pq;
multiset<int> xx;
REP(i, q) {
const int d = getInt();
while (idx < n) {
if (v[idx].first.first <= d) {
pq.push(data(v[idx].first.second, v[idx].second));
xx.insert(v[idx].second);
++idx;
} else {
break;
}
}
while (pq.size()) {
const data dt = pq.top();
if (dt.first < d) {
xx.erase(xx.find(dt.second));
pq.pop();
} else {
break;
}
}
if (xx.size()) {
printf("%d\n", *xx.begin());
} else {
printf("%d\n", -1);
}
}
return 0;
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 845,449 | 845,450 | u433133366 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) \
do { \
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, \
#__VA_ARGS__); \
_do(__VA_ARGS__); \
} while (0)
template <typename T> void _do(T &&_x) { cerr << _x << endl; }
template <typename T, typename... S> void _do(T &&_x, S &&..._t) {
cerr << _x << ", ";
_do(_t...);
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, const pair<_a, _b> &_p) {
return _s << "(" << _p.X << "," << _p.Y << ")";
}
template <typename It> ostream &_OUTC(ostream &_s, It _ita, It _itb) {
_s << "{";
for (It _it = _ita; _it != _itb; _it++) {
_s << (_it == _ita ? "" : ",") << *_it;
}
_s << "}";
return _s;
}
template <typename _a> ostream &operator<<(ostream &_s, vector<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a> ostream &operator<<(ostream &_s, set<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, map<_a, _b> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _t> void pary(_t _a, _t _b) {
_OUTC(cerr, _a, _b);
cerr << endl;
}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#endif // cold66
//}
template <class T> inline bool chkmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chkmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const ll MAXn = 1e6 + 5, MAXlg = __lg(MAXn) + 2;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f;
typedef pair<ii, ll> iii;
ll n, q, sz;
iii d[MAXn];
ll seg[MAXn << 1];
ll st[MAXn];
vector<ll> _;
void ins(ll l, ll r, ll v) {
for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
seg[l] = min(seg[l], v);
l++;
}
if (r & 1) {
r--;
seg[r] = min(seg[r], v);
}
}
}
ll qr(ll l) {
ll ret = INF;
for (l += sz; l > 0; l >>= 1)
ret = min(ret, seg[l]);
return ret;
}
int main() {
IOS();
cin >> n >> q;
RST(seg, INF);
REP(i, n) {
ll l, r, x;
cin >> l >> r >> x;
d[i] = iii(ii(l, r), x);
_.eb(max(0LL, l - x)), _.eb(max(0LL, r - x));
_.eb(max(0LL, l - x - 1)), _.eb(max(0LL, r - x + 1));
}
REP(i, q) {
cin >> st[i];
_.eb(st[i]);
}
sort(ALL(_));
_.resize(unique(ALL(_)) - _.begin());
sz = SZ(_);
REP(i, n) {
ll l = lower_bound(ALL(_), max(0LL, d[i].X.X - d[i].Y)) - _.begin();
ll r = lower_bound(ALL(_), max(0LL, d[i].X.Y - d[i].Y)) - _.begin();
ll v = d[i].Y;
ins(l, r + 1, v);
}
REP(i, q) {
ll cur = lower_bound(ALL(_), st[i]) - _.begin();
ll ans = qr(cur);
if (ans == INF)
cout << -1 << endl;
else
cout << qr(cur) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) \
do { \
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, \
#__VA_ARGS__); \
_do(__VA_ARGS__); \
} while (0)
template <typename T> void _do(T &&_x) { cerr << _x << endl; }
template <typename T, typename... S> void _do(T &&_x, S &&..._t) {
cerr << _x << ", ";
_do(_t...);
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, const pair<_a, _b> &_p) {
return _s << "(" << _p.X << "," << _p.Y << ")";
}
template <typename It> ostream &_OUTC(ostream &_s, It _ita, It _itb) {
_s << "{";
for (It _it = _ita; _it != _itb; _it++) {
_s << (_it == _ita ? "" : ",") << *_it;
}
_s << "}";
return _s;
}
template <typename _a> ostream &operator<<(ostream &_s, vector<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a> ostream &operator<<(ostream &_s, set<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, map<_a, _b> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _t> void pary(_t _a, _t _b) {
_OUTC(cerr, _a, _b);
cerr << endl;
}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#endif // cold66
//}
template <class T> inline bool chkmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chkmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const ll MAXn = 1e6 + 5, MAXlg = __lg(MAXn) + 2;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f;
typedef pair<ii, ll> iii;
ll n, q, sz;
iii d[MAXn];
ll seg[MAXn << 1];
ll st[MAXn];
vector<ll> _;
void ins(ll l, ll r, ll v) {
for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
seg[l] = min(seg[l], v);
l++;
}
if (r & 1) {
r--;
seg[r] = min(seg[r], v);
}
}
}
ll qr(ll l) {
ll ret = INF;
for (l += sz; l > 0; l >>= 1)
ret = min(ret, seg[l]);
return ret;
}
int main() {
IOS();
cin >> n >> q;
RST(seg, INF);
REP(i, n) {
ll l, r, x;
cin >> l >> r >> x;
d[i] = iii(ii(l, r), x);
_.eb(max(0LL, l - x)), _.eb(max(0LL, r - x));
_.eb(max(0LL, l - x - 1)), _.eb(max(0LL, r - x + 1));
}
REP(i, q) {
cin >> st[i];
_.eb(st[i]);
}
sort(ALL(_));
_.resize(unique(ALL(_)) - _.begin());
sz = SZ(_);
REP(i, n) {
ll l = lower_bound(ALL(_), max(0LL, d[i].X.X - d[i].Y)) - _.begin();
ll r = lower_bound(ALL(_), max(0LL, d[i].X.Y - d[i].Y)) - _.begin();
ll v = d[i].Y;
ins(l, r, v);
}
REP(i, q) {
ll cur = lower_bound(ALL(_), st[i]) - _.begin();
ll ans = qr(cur);
if (ans == INF)
cout << -1 << endl;
else
cout << qr(cur) << endl;
}
}
| [
"expression.operation.binary.remove"
] | 845,478 | 845,479 | u829484206 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
rep(i, Q) { shugo.insert(P(D[i], i)); }
vector<tuple<int, int, int>> a(N);
rep(i, N) { a[i] = tie(X[i], S[i], T[i]); }
sort(a.begin(), a.end());
vector<int> ans;
rep(i, Q) { ans[i] = -1; }
rep(i, N) {
int x, l, r;
tie(x, l, r) = a[i];
auto it = shugo.lower_bound(P(l - x, -1));
while (it != shugo.end()) {
if ((it->first) >= r - x) {
break;
}
ans[it->second] = x;
shugo.erase(it++);
}
}
rep(i, Q) { cout << ans[i] << endl; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
rep(i, Q) { shugo.insert(P(D[i], i)); }
vector<tuple<int, int, int>> a(N);
rep(i, N) { a[i] = tie(X[i], S[i], T[i]); }
sort(a.begin(), a.end());
vector<int> ans;
rep(i, Q) { ans.push_back(-1); }
rep(i, N) {
int x, l, r;
tie(x, l, r) = a[i];
auto it = shugo.lower_bound(P(l - x, -1));
while (it != shugo.end()) {
if ((it->first) >= r - x) {
break;
}
ans[it->second] = x;
shugo.erase(it++);
}
}
rep(i, Q) { cout << ans[i] << endl; }
} | [
"call.arguments.change"
] | 845,483 | 845,484 | u243122218 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
//設定
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
rep(i, Q) { shugo.insert(P(D[i], i)); }
// tieに代入して地点X[i]でソート
vector<tuple<int, int, int>> a(N);
rep(i, N) { a[i] = tie(X[i], S[i], T[i]); }
sort(a.begin(), a.end());
//答えを求める
vector<int> ans;
rep(i, Q) { ans[i] = -1; }
rep(i, N) {
int x, l, r;
tie(x, l, r) = a[i];
auto it = shugo.lower_bound(P(l - x, -1));
while (it != shugo.end()) {
if ((it->first) >= r - x) {
break;
}
ans[it->second] = x;
shugo.erase(it++);
}
}
//表示する
rep(i, Q) { cout << ans[i] << endl; }
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int N, Q, i, j;
typedef pair<int, int> P;
cin >> N >> Q;
vector<int> X(N), S(N), T(N), D(Q);
set<pair<int, int>> shugo;
rep(i, N) { cin >> S[i] >> T[i] >> X[i]; }
rep(i, Q) { cin >> D[i]; }
rep(i, Q) { shugo.insert(P(D[i], i)); }
vector<tuple<int, int, int>> a(N);
rep(i, N) { a[i] = tie(X[i], S[i], T[i]); }
sort(a.begin(), a.end());
vector<int> ans;
rep(i, Q) { ans.push_back(-1); }
rep(i, N) {
int x, l, r;
tie(x, l, r) = a[i];
auto it = shugo.lower_bound(P(l - x, -1));
while (it != shugo.end()) {
if ((it->first) >= r - x) {
break;
}
ans[it->second] = x;
shugo.erase(it++);
}
}
rep(i, Q) { cout << ans[i] << endl; }
} | [
"call.arguments.change"
] | 845,485 | 845,484 | u243122218 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
int ans[200010], nex[200010], dis[200010];
struct node {
int s, t, x;
friend bool operator<(const node &a, const node &b) { return a.x < b.x; }
} a[200010];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &a[i].s, &a[i].t, &a[i].x);
a[i].t--;
a[i].s -= a[i].x;
a[i].t -= a[i].x;
}
for (int i = 0; i < q; i++) {
scanf("%d", &dis[i]);
ans[i] = -1;
nex[i] = i + 1;
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
int l = a[i].s, r = a[i].t;
int ll = lower_bound(dis, dis + q, l) - dis;
int rr = upper_bound(dis, dis + q, r) - dis;
for (int j = ll; j < rr; j++) {
if (ans[j] == -1)
ans[j] = a[i].x;
int t = nex[j];
nex[j] = max(nex[j], rr);
j = t;
}
}
for (int i = 0; i < q; i++) {
printf("%d\n", ans[i]);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int inf = 0x3f3f3f3f;
int ans[200010], nex[200010], dis[200010];
struct node {
int s, t, x;
friend bool operator<(const node &a, const node &b) { return a.x < b.x; }
} a[200010];
int main() {
int n, q;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &a[i].s, &a[i].t, &a[i].x);
a[i].t--;
a[i].s -= a[i].x;
a[i].t -= a[i].x;
}
for (int i = 0; i < q; i++) {
scanf("%d", &dis[i]);
ans[i] = -1;
nex[i] = i + 1;
}
sort(a, a + n);
for (int i = 0; i < n; i++) {
int l = a[i].s, r = a[i].t;
int ll = lower_bound(dis, dis + q, l) - dis;
int rr = upper_bound(dis, dis + q, r) - dis;
for (int j = ll; j < rr;) {
if (ans[j] == -1)
ans[j] = a[i].x;
int t = nex[j];
nex[j] = max(nex[j], rr);
j = t;
}
}
for (int i = 0; i < q; i++) {
printf("%d\n", ans[i]);
}
return 0;
}
| [
"control_flow.loop.for.update.change"
] | 845,499 | 845,500 | u535623178 | cpp |
p03033 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
const pii INF = {numeric_limits<int>::max(), numeric_limits<int>::max()};
struct LazySegmentTree {
private:
int n;
vector<pii> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<pii> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, INF);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, pii x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = min(node[2 * k + 1], node[2 * k + 2]);
}
}
pii find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return INF;
if (a <= l && r <= b)
return node[k];
pii vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
pii vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
struct Interval {
pii I;
int x;
};
void solve() {
int N, Q;
cin >> N >> Q;
vector<Interval> I(N);
map<int, int> mp;
vector<int> ss;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
s -= x;
t -= x;
I[i].I = {s, t};
I[i].x = x;
ss.push_back(s);
ss.push_back(t);
mp[s] = 0;
mp[t] = 0;
}
sort(all(I), [](Interval a, Interval b) { return a.x < b.x; });
sort(all(ss));
ss.erase(unique(all(ss)), ss.end());
int num = 0;
for (auto e : mp) {
mp[e.first] = num;
num++;
}
vector<pii> v;
for (int i = 0; i < num + 1; i++) {
v.push_back(INF);
}
LazySegmentTree seg(v);
for (int i = N - 1; i >= 0; i--) {
seg.update(mp[I[i].I.first], mp[I[i].I.second], {i, I[i].x});
}
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
int k = lower_bound(all(ss), d) - ss.begin();
pii p = seg.find(k, k + 1);
if (p.second == numeric_limits<int>::max()) {
cout << -1 << endl;
} else {
cout << p.second << endl;
}
// cout << X[p.first] << endl;
}
}
int main() {
#ifdef LOCAL_ENV
cin.exceptions(ios::failbit);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
const pii INF = {numeric_limits<int>::max(), numeric_limits<int>::max()};
struct LazySegmentTree {
private:
int n;
vector<pii> node, lazy;
vector<bool> lazyFlag;
public:
LazySegmentTree(vector<pii> v) {
int sz = (int)v.size();
n = 1;
while (n < sz)
n *= 2;
node.resize(2 * n - 1);
lazy.resize(2 * n - 1, INF);
lazyFlag.resize(2 * n - 1, false);
for (int i = 0; i < sz; i++)
node[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
}
void lazyEvaluate(int k, int l, int r) {
if (lazyFlag[k]) {
node[k] = lazy[k];
if (r - l > 1) {
lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
}
lazyFlag[k] = false;
}
}
void update(int a, int b, pii x, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return;
if (a <= l && r <= b) {
lazy[k] = x;
lazyFlag[k] = true;
lazyEvaluate(k, l, r);
} else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = min(node[2 * k + 1], node[2 * k + 2]);
}
}
pii find(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r < 0)
r = n;
lazyEvaluate(k, l, r);
if (b <= l || r <= a)
return INF;
if (a <= l && r <= b)
return node[k];
pii vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
pii vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
struct Interval {
pii I;
int x;
};
void solve() {
int N, Q;
cin >> N >> Q;
vector<Interval> I(N);
map<int, int> mp;
vector<int> ss;
for (int i = 0; i < N; i++) {
int s, t, x;
cin >> s >> t >> x;
s -= x;
t -= x;
I[i].I = {s, t};
I[i].x = x;
ss.push_back(s);
ss.push_back(t);
mp[s] = 0;
mp[t] = 0;
}
sort(all(I), [](Interval a, Interval b) { return a.x < b.x; });
sort(all(ss));
ss.erase(unique(all(ss)), ss.end());
int num = 0;
for (auto e : mp) {
mp[e.first] = num;
num++;
}
vector<pii> v;
for (int i = 0; i < num + 1; i++) {
v.push_back(INF);
}
LazySegmentTree seg(v);
for (int i = N - 1; i >= 0; i--) {
seg.update(mp[I[i].I.first], mp[I[i].I.second], {i, I[i].x});
// for (int j = 0; j < num; j++) {
// cout << seg.find(j, j + 1).first << ":";
// }
// cout << endl;
}
// for (int i = 0; i < N; i++) {
// cout << I[i].I << endl;
// }
// cout << "---" << endl;
// cout << ss << endl;
for (int i = 0; i < Q; i++) {
int d;
cin >> d;
// cout << "d:" << d << endl;
int k = upper_bound(all(ss), d) - ss.begin() - 1;
// cout << "k:" << k << endl;
pii p = seg.find(k, k + 1);
// cout << p << endl;
if (p.second == numeric_limits<int>::max()) {
cout << -1 << endl;
} else {
cout << p.second << endl;
}
// cout << X[p.first] << endl;
}
}
int main() {
#ifdef LOCAL_ENV
cin.exceptions(ios::failbit);
#endif
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
} | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 845,518 | 845,519 | u745250049 | cpp |
p03033 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
const int N = 200005;
int d[N];
int s[N], t[N], x[N];
template <typename T> class SquareRootDecomposition {
int div;
vector<T> a, b;
function<T(T, T)> func;
public:
SquareRootDecomposition<T>(const int n, T def, function<T(T, T)> _func) {
LL ok = n;
LL ng = 1;
while (ok - ng > 1) {
LL mid = (ok + ng) / 2;
if (mid * mid >= n)
ok = mid;
else
ng = mid;
}
div = (int)ok;
a = vector<T>((n - div + 1) / div, def);
b = vector<T>(n, def);
func = _func;
}
void update(int l, int r, T v) { // update [l, r)
int as = (l + div - 1) / div;
int ae = r / div;
FOR(i, as, ae) a[i] = func(a[i], v);
FOR(i, l, min(as * div, r)) b[i] = func(b[i], v);
FOR(i, max(ae * div, l), r) b[i] = func(b[i], v);
}
T query(int idx) { return func(a[idx / div], b[idx]); }
};
int main() {
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d%d%d", &s[i], &t[i], &x[i]);
REP(i, q) scanf("%d", &d[i]);
SquareRootDecomposition<int> srd(q, 0x7f7f7f7f,
[](int a, int b) { return min(a, b); });
REP(i, n) {
int l = s[i] - x[i];
int r = t[i] - x[i];
int lidx = lower_bound(d, d + q, l) - d;
int ridx = upper_bound(d, d + q, r - 1) - d;
srd.update(lidx, ridx, x[i]);
}
REP(i, q) {
int ans = srd.query(i);
if (ans > 1e9 + 5)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
const int N = 200005;
int d[N];
int s[N], t[N], x[N];
template <typename T> class SquareRootDecomposition {
int div;
vector<T> a, b;
function<T(T, T)> func;
public:
SquareRootDecomposition<T>(const int n, T def, function<T(T, T)> _func) {
LL ok = n;
LL ng = 1;
while (ok - ng > 1) {
LL mid = (ok + ng) / 2;
if (mid * mid >= n)
ok = mid;
else
ng = mid;
}
div = (int)ok;
a = vector<T>((n + div - 1) / div, def);
b = vector<T>(n, def);
func = _func;
}
void update(int l, int r, T v) { // update [l, r)
int as = (l + div - 1) / div;
int ae = r / div;
FOR(i, as, ae) a[i] = func(a[i], v);
FOR(i, l, min(as * div, r)) b[i] = func(b[i], v);
FOR(i, max(ae * div, l), r) b[i] = func(b[i], v);
}
T query(int idx) { return func(a[idx / div], b[idx]); }
};
int main() {
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d%d%d", &s[i], &t[i], &x[i]);
REP(i, q) scanf("%d", &d[i]);
SquareRootDecomposition<int> srd(q, 0x7f7f7f7f,
[](int a, int b) { return min(a, b); });
REP(i, n) {
int l = s[i] - x[i];
int r = t[i] - x[i];
int lidx = lower_bound(d, d + q, l) - d;
int ridx = upper_bound(d, d + q, r - 1) - d;
srd.update(lidx, ridx, x[i]);
}
REP(i, q) {
int ans = srd.query(i);
if (ans > 1e9 + 5)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 845,549 | 845,550 | u614497125 | cpp |
p03033 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
const int N = 200005;
int d[N];
int s[N], t[N], x[N];
template <typename T> class SquareRootDecomposition {
int div;
vector<T> a, b;
function<T(T, T)> func;
public:
SquareRootDecomposition<T>(const int n, T def, function<T(T, T)> _func) {
LL ok = n;
LL ng = 1;
while (ok - ng > 1) {
LL mid = (ok + ng) / 2;
if (mid * mid >= n)
ok = mid;
else
ng = mid;
}
div = (int)ok;
a = vector<T>(n / div, def);
b = vector<T>(n, def);
func = _func;
}
void update(int l, int r, T v) { // update [l, r)
int as = (l + div - 1) / div;
int ae = r / div;
FOR(i, as, ae) a[i] = func(a[i], v);
FOR(i, l, min(as * div, r)) b[i] = func(b[i], v);
FOR(i, max(ae * div, l), r) b[i] = func(b[i], v);
}
T query(int idx) { return func(a[idx / div], b[idx]); }
};
int main() {
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d%d%d", &s[i], &t[i], &x[i]);
REP(i, q) scanf("%d", &d[i]);
SquareRootDecomposition<int> srd(q, 0x7f7f7f7f,
[](int a, int b) { return min(a, b); });
REP(i, n) {
int l = s[i] - x[i];
int r = t[i] - x[i];
int lidx = lower_bound(d, d + q, l) - d;
int ridx = upper_bound(d, d + q, r - 1) - d;
srd.update(lidx, ridx, x[i]);
}
REP(i, q) {
int ans = srd.query(i);
if (ans > 1e9 + 5)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
const int N = 200005;
int d[N];
int s[N], t[N], x[N];
template <typename T> class SquareRootDecomposition {
int div;
vector<T> a, b;
function<T(T, T)> func;
public:
SquareRootDecomposition<T>(const int n, T def, function<T(T, T)> _func) {
LL ok = n;
LL ng = 1;
while (ok - ng > 1) {
LL mid = (ok + ng) / 2;
if (mid * mid >= n)
ok = mid;
else
ng = mid;
}
div = (int)ok;
a = vector<T>((n + div - 1) / div, def);
b = vector<T>(n, def);
func = _func;
}
void update(int l, int r, T v) { // update [l, r)
int as = (l + div - 1) / div;
int ae = r / div;
FOR(i, as, ae) a[i] = func(a[i], v);
FOR(i, l, min(as * div, r)) b[i] = func(b[i], v);
FOR(i, max(ae * div, l), r) b[i] = func(b[i], v);
}
T query(int idx) { return func(a[idx / div], b[idx]); }
};
int main() {
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d%d%d", &s[i], &t[i], &x[i]);
REP(i, q) scanf("%d", &d[i]);
SquareRootDecomposition<int> srd(q, 0x7f7f7f7f,
[](int a, int b) { return min(a, b); });
REP(i, n) {
int l = s[i] - x[i];
int r = t[i] - x[i];
int lidx = lower_bound(d, d + q, l) - d;
int ridx = upper_bound(d, d + q, r - 1) - d;
srd.update(lidx, ridx, x[i]);
}
REP(i, q) {
int ans = srd.query(i);
if (ans > 1e9 + 5)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
| [
"call.arguments.change"
] | 845,551 | 845,550 | u614497125 | cpp |
p03033 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
set<pair<int, pii>> Set;
for (int n = 0; n < N; ++n) {
int s, t, x;
cin >> s >> t >> x;
Set.insert({x, {s - x, t - x}});
}
set<pii> D;
for (int q = 0; q < Q; ++q) {
int d;
cin >> d;
D.insert({d, q});
}
vector<int> Ans(Q, -1);
for (auto s : Set) {
int l = s.second.first;
int r = s.second.second;
auto it = D.lower_bound({l, -INF});
for (; it != D.end() && it->first < r; ++it) {
Ans[it->second] = s.first;
D.erase(it);
}
}
for (auto ans : Ans) {
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
set<pair<int, pii>> Set;
for (int n = 0; n < N; ++n) {
int s, t, x;
cin >> s >> t >> x;
Set.insert({x, {s - x, t - x}});
}
set<pii> D;
for (int q = 0; q < Q; ++q) {
int d;
cin >> d;
D.insert({d, q});
}
vector<int> Ans(Q, -1);
for (auto s : Set) {
int l = s.second.first;
int r = s.second.second;
auto it = D.lower_bound({l, -INF});
for (; it != D.end() && it->first < r;) {
Ans[it->second] = s.first;
D.erase(it++);
}
}
for (auto ans : Ans) {
cout << ans << endl;
}
return 0;
}
| [
"control_flow.loop.for.update.change",
"call.arguments.change"
] | 845,558 | 845,559 | u816910105 | cpp |
p03033 | #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int compare(string a, string b) {
int i;
for (i = 0; i < a[i] != '\0'; i++) {
if (b[i] == '\0')
return -1;
else if (a[i] < b[i])
return 1;
else if (a[i] > b[i])
return -1;
}
if (b[i] != '\0')
return 1;
else
return 0;
}
int main() {
int n, q, s[222222], t[222222], x[222222], d[222222], i, g[222222], l, r, c,
l2, r2[222222], j, w[222222];
cin >> n >> q;
vector<pair<int, pair<int, int>>> m(n);
for (i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
s[i] -= x[i];
t[i] -= x[i];
m[i] = make_pair(x[i], make_pair(s[i], t[i]));
}
sort(m.begin(), m.end());
for (i = 0; i < q; i++) {
cin >> d[i];
g[i] = -1;
}
for (i = 0; i < n; i++) {
s[i] = m[i].second.first;
t[i] = m[i].second.second;
if (s[i] <= d[q - 1] || t[i] > d[0]) {
l = 0;
r = q - 1;
while (l != r) {
c = (l + r) / 2;
if (s[i] <= d[c]) {
if (l + 1 == r) {
c = l;
if (s[i] <= d[c])
r--;
else
l++;
} else {
r = c;
}
} else {
if (l + 1 == r) {
c = l;
if (s[i] <= d[c])
r--;
else
l++;
} else {
l = c;
}
}
}
l2 = l;
l = 0;
r = q - 1;
while (l != r) {
c = (l + r) / 2;
if (t[i] > d[c]) {
if (l + 1 == r) {
c = r;
if (t[i] > d[c])
l++;
else
r--;
} else {
l = c;
}
} else {
if (l + 1 == r) {
c = r;
if (t[i] > d[c])
l++;
else
r--;
} else {
r = c;
}
}
}
r2[i] = l;
for (j = l2; j <= r2[i]; j++) {
if (g[j] != -1)
j = r2[w[j]];
else {
g[j] = m[i].first;
w[j] = i;
}
}
}
}
for (i = 0; i < q; i++)
cout << g[i] << endl;
}
| #include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int compare(string a, string b) {
int i;
for (i = 0; i < a[i] != '\0'; i++) {
if (b[i] == '\0')
return -1;
else if (a[i] < b[i])
return 1;
else if (a[i] > b[i])
return -1;
}
if (b[i] != '\0')
return 1;
else
return 0;
}
int main() {
int n, q, s[222222], t[222222], x[222222], d[222222], i, g[222222], l, r, c,
l2, r2[222222], j, w[222222];
cin >> n >> q;
vector<pair<int, pair<int, int>>> m(n);
for (i = 0; i < n; i++) {
cin >> s[i] >> t[i] >> x[i];
s[i] -= x[i];
t[i] -= x[i];
m[i] = make_pair(x[i], make_pair(s[i], t[i]));
}
sort(m.begin(), m.end());
for (i = 0; i < q; i++) {
cin >> d[i];
g[i] = -1;
}
for (i = 0; i < n; i++) {
s[i] = m[i].second.first;
t[i] = m[i].second.second;
if (s[i] <= d[q - 1] && t[i] > d[0]) {
l = 0;
r = q - 1;
while (l != r) {
c = (l + r) / 2;
if (s[i] <= d[c]) {
if (l + 1 == r) {
c = l;
if (s[i] <= d[c])
r--;
else
l++;
} else {
r = c;
}
} else {
if (l + 1 == r) {
c = l;
if (s[i] <= d[c])
r--;
else
l++;
} else {
l = c;
}
}
}
l2 = l;
l = 0;
r = q - 1;
while (l != r) {
c = (l + r) / 2;
if (t[i] > d[c]) {
if (l + 1 == r) {
c = r;
if (t[i] > d[c])
l++;
else
r--;
} else {
l = c;
}
} else {
if (l + 1 == r) {
c = r;
if (t[i] > d[c])
l++;
else
r--;
} else {
r = c;
}
}
}
r2[i] = l;
for (j = l2; j <= r2[i]; j++) {
if (g[j] != -1)
j = r2[w[j]];
else {
g[j] = m[i].first;
w[j] = i;
}
}
}
}
for (i = 0; i < q; i++)
cout << g[i] << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 845,561 | 845,562 | u933068010 | cpp |
p03033 | #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st + dr) / 2;
if (mij >= a)
update(a, b, x, st, mij, 2 * nod);
if (mij < b)
update(a, b, x, mij + 1, dr, 2 * nod + 1);
}
int build(int i, int st, int dr, int nod) {
arbint[nod] = min(arbint[nod], arbint[nod / 2]);
if (st == i && dr == i) {
return arbint[nod];
}
int mij = (st + dr) / 2;
if (mij >= i)
return build(i, st, mij, 2 * nod);
else
return build(i, mij + 1, dr, 2 * nod + 1);
}
int main() {
int n, m, i, pas, p1, p2;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &v[i].s, &v[i].t, &v[i].x);
for (i = 1; i <= m; i++)
scanf("%d", &d[i]);
for (i = 0; i <= 4 * m; i++)
arbint[i] = INT_MAX;
for (i = 1; i <= n; i++) {
pas = 1 << 20;
p1 = 0;
while (pas) {
if (p1 + pas <= m && v[i].s - v[i].x > d[p1 + pas])
p1 += pas;
pas /= 2;
}
p1++;
p2 = 0;
pas = 1 << 20;
while (pas) {
if (p2 + pas <= m && d[p2 + pas] < v[i].t - v[i].x)
p2 += pas;
pas /= 2;
}
if (p1 >= p2)
update(p1, p2, v[i].x, 1, m, 1);
}
for (i = 1; i <= m; i++) {
int z = build(i, 1, m, 1);
if (z == INT_MAX)
z = -1;
printf("%d\n", z);
}
return 0;
}
| #include <bits/stdc++.h>
/// TONI BO$$ was here
/// #MLC
using namespace std;
struct inter {
int s, t, x;
} v[200001];
int d[200001];
int arbint[800001];
void update(int a, int b, int x, int st, int dr, int nod) {
if (st >= a && dr <= b) {
arbint[nod] = min(arbint[nod], x);
return;
}
int mij = (st + dr) / 2;
if (mij >= a)
update(a, b, x, st, mij, 2 * nod);
if (mij < b)
update(a, b, x, mij + 1, dr, 2 * nod + 1);
}
int build(int i, int st, int dr, int nod) {
arbint[nod] = min(arbint[nod], arbint[nod / 2]);
if (st == i && dr == i) {
return arbint[nod];
}
int mij = (st + dr) / 2;
if (mij >= i)
return build(i, st, mij, 2 * nod);
else
return build(i, mij + 1, dr, 2 * nod + 1);
}
int main() {
int n, m, i, pas, p1, p2;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++)
scanf("%d%d%d", &v[i].s, &v[i].t, &v[i].x);
for (i = 1; i <= m; i++)
scanf("%d", &d[i]);
for (i = 0; i <= 4 * m; i++)
arbint[i] = INT_MAX;
for (i = 1; i <= n; i++) {
pas = 1 << 20;
p1 = 0;
while (pas) {
if (p1 + pas <= m && v[i].s - v[i].x > d[p1 + pas])
p1 += pas;
pas /= 2;
}
p1++;
p2 = 0;
pas = 1 << 20;
while (pas) {
if (p2 + pas <= m && d[p2 + pas] < v[i].t - v[i].x)
p2 += pas;
pas /= 2;
}
if (p1 <= p2)
update(p1, p2, v[i].x, 1, m, 1);
}
for (i = 1; i <= m; i++) {
int z = build(i, 1, m, 1);
if (z == INT_MAX)
z = -1;
printf("%d\n", z);
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,567 | 845,568 | u503211001 | cpp |
p03033 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#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"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
class Segment_Tree {
vector<long long int> v;
vector<long long int> add;
vector<long long int> modi;
vector<int> l;
vector<int> r;
int num;
long long int ret;
bool is_min;
void Left(int place) {
if (place >= v.size() / 2) {
l[place] = place - v.size() / 2;
return;
}
Left(place * 2);
Left(place * 2 + 1);
l[place] = l[place * 2];
return;
}
void Right(int place) {
if (place >= v.size() / 2) {
r[place] = place - v.size() / 2;
return;
}
Right(place * 2);
Right(place * 2 + 1);
r[place] = r[place * 2 + 1];
return;
}
long long int Update(int place) {
if (place >= v.size() / 2) {
return v[place];
}
if (is_min) {
v[place] = min(Update(place * 2), Update(place * 2 + 1));
return v[place];
}
v[place] = max(Update(place * 2), Update(place * 2 + 1));
return v[place];
}
void Modify(int a, int b, long long int num, int place) {
if (l[place] >= a && r[place] <= b) {
modi[place] = num;
v[place] = num;
add[place] = 0;
return;
}
if (l[place] > b || r[place] < a)
return;
if (modi[place] != LLONG_MAX) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
modi[place] = LLONG_MAX;
}
add[place * 2] += add[place];
add[place * 2 + 1] += add[place];
add[place] = 0;
Modify(a, b, num, place * 2);
Modify(a, b, num, place * 2 + 1);
if (is_min)
v[place] = min(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
else
v[place] = max(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
return;
}
void Add(int a, int b, long long int num, int place) {
if (l[place] >= a && r[place] <= b) {
if (modi[place] != LLONG_MAX) {
if (place * 2 < v.size()) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
}
modi[place] = LLONG_MAX;
}
add[place] += num;
return;
}
if (l[place] > b || r[place] < a)
return;
if (modi[place] != LLONG_MAX) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
modi[place] = LLONG_MAX;
}
add[place * 2] += add[place];
add[place * 2 + 1] += add[place];
add[place] = 0;
Add(a, b, num, place * 2);
Add(a, b, num, place * 2 + 1);
if (is_min)
v[place] = min(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
else
v[place] = max(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
return;
}
void RMQ(int a, int b, int place) {
if (l[place] >= a && r[place] <= b) {
if (modi[place] != LLONG_MAX) {
if (place * 2 < v.size()) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
}
modi[place] = LLONG_MAX;
}
if (is_min)
ret = min(ret, v[place] + add[place]);
else
ret = max(ret, v[place] + add[place]);
return;
}
if (l[place] > b || r[place] < a)
return;
if (modi[place] != LLONG_MAX) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
modi[place] = LLONG_MAX;
}
add[place * 2] += add[place];
add[place * 2 + 1] += add[place];
add[place] = 0;
RMQ(a, b, place * 2);
RMQ(a, b, place * 2 + 1);
if (is_min)
v[place] = min(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
else
v[place] = max(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
return;
}
public:
Segment_Tree(int n, bool min) {
n++;
num = 1;
while (num < n * 2) {
num *= 2;
}
l.resize(num);
r.resize(num);
is_min = min;
if (min) {
v.resize(num, MOD * MOD);
} else
v.resize(num, -MOD * MOD);
add.resize(num, 0);
modi.resize(num, MOD * MOD);
Left(1);
Right(1);
}
void Insert(int place, long long int num, bool update) {
place += v.size() / 2;
v[place] = num;
if (!update)
return;
place /= 2;
while (place) {
if (is_min)
v[place] = min(v[place * 2], v[place * 2 + 1]);
else
v[place] = max(v[place * 2], v[place * 2 + 1]);
place /= 2;
}
}
void Modify(int a, int b, long long int num) { Modify(a, b, num, 1); }
void Add(int a, int b, long long int num) { Add(a, b, num, 1); }
void Init() { Update(1); }
long long int RMQ(int a, int b) {
if (is_min)
ret = LLONG_MAX;
else
ret = LLONG_MIN;
RMQ(a, b, 1);
return ret;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
Segment_Tree sg(K, true);
vector<pair<long long int, pair<int, int>>> v(N);
for (int i = 0; i < N; i++) {
cin >> L >> R >> M;
v[i] = {M, {L - M, R - M - 1}};
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
vector<int> w(K);
for (auto &i : w)
cin >> i;
for (int i = 0; i < N; i++) {
// cout << v[i].second.first << " " << v[i].second.second << " " <<
// v[i].first << endl;
L = -1, R = N + 1;
while (R - L > 1) {
int mid = (R + L) / 2;
if (w[mid] < v[i].second.first)
L = mid;
else
R = mid;
}
int st = L + 1;
L = -1, R = N + 1;
while (R - L > 1) {
int mid = (R + L) / 2;
if (w[mid] <= v[i].second.second)
L = mid;
else
R = mid;
}
int ed = L;
// cout << st << " " << ed << endl;
sg.Modify(st, ed, v[i].first);
}
for (int i = 0; i < K; i++) {
long long int box = sg.RMQ(i, i);
if (box == MOD * MOD)
cout << -1 << endl;
else
cout << box << endl;
}
} | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#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"
using namespace std;
const long long int MOD = 1000000007;
// const int MOD = 1000000007;
// const int MOD = 998244353;
// const long long int MOD = 998244353;
long long int N, M, K, H, W, L, R;
// int N, M, K, H, W, L, R;
class Segment_Tree {
vector<long long int> v;
vector<long long int> add;
vector<long long int> modi;
vector<int> l;
vector<int> r;
int num;
long long int ret;
bool is_min;
void Left(int place) {
if (place >= v.size() / 2) {
l[place] = place - v.size() / 2;
return;
}
Left(place * 2);
Left(place * 2 + 1);
l[place] = l[place * 2];
return;
}
void Right(int place) {
if (place >= v.size() / 2) {
r[place] = place - v.size() / 2;
return;
}
Right(place * 2);
Right(place * 2 + 1);
r[place] = r[place * 2 + 1];
return;
}
long long int Update(int place) {
if (place >= v.size() / 2) {
return v[place];
}
if (is_min) {
v[place] = min(Update(place * 2), Update(place * 2 + 1));
return v[place];
}
v[place] = max(Update(place * 2), Update(place * 2 + 1));
return v[place];
}
void Modify(int a, int b, long long int num, int place) {
if (l[place] >= a && r[place] <= b) {
modi[place] = num;
v[place] = num;
add[place] = 0;
return;
}
if (l[place] > b || r[place] < a)
return;
if (modi[place] != LLONG_MAX) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
modi[place] = LLONG_MAX;
}
add[place * 2] += add[place];
add[place * 2 + 1] += add[place];
add[place] = 0;
Modify(a, b, num, place * 2);
Modify(a, b, num, place * 2 + 1);
if (is_min)
v[place] = min(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
else
v[place] = max(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
return;
}
void Add(int a, int b, long long int num, int place) {
if (l[place] >= a && r[place] <= b) {
if (modi[place] != LLONG_MAX) {
if (place * 2 < v.size()) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
}
modi[place] = LLONG_MAX;
}
add[place] += num;
return;
}
if (l[place] > b || r[place] < a)
return;
if (modi[place] != LLONG_MAX) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
modi[place] = LLONG_MAX;
}
add[place * 2] += add[place];
add[place * 2 + 1] += add[place];
add[place] = 0;
Add(a, b, num, place * 2);
Add(a, b, num, place * 2 + 1);
if (is_min)
v[place] = min(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
else
v[place] = max(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
return;
}
void RMQ(int a, int b, int place) {
if (l[place] >= a && r[place] <= b) {
if (modi[place] != LLONG_MAX) {
if (place * 2 < v.size()) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
}
modi[place] = LLONG_MAX;
}
if (is_min)
ret = min(ret, v[place] + add[place]);
else
ret = max(ret, v[place] + add[place]);
return;
}
if (l[place] > b || r[place] < a)
return;
if (modi[place] != LLONG_MAX) {
modi[place * 2] = modi[place * 2 + 1] = modi[place];
v[place * 2] = v[place * 2 + 1] = modi[place];
add[place * 2] = add[place * 2 + 1] = 0;
modi[place] = LLONG_MAX;
}
add[place * 2] += add[place];
add[place * 2 + 1] += add[place];
add[place] = 0;
RMQ(a, b, place * 2);
RMQ(a, b, place * 2 + 1);
if (is_min)
v[place] = min(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
else
v[place] = max(v[place * 2] + add[place * 2],
v[place * 2 + 1] + add[place * 2 + 1]);
return;
}
public:
Segment_Tree(int n, bool min) {
n++;
num = 1;
while (num < n * 2) {
num *= 2;
}
l.resize(num);
r.resize(num);
is_min = min;
if (min) {
v.resize(num, MOD * MOD);
} else
v.resize(num, -MOD * MOD);
add.resize(num, 0);
modi.resize(num, MOD * MOD);
Left(1);
Right(1);
}
void Insert(int place, long long int num, bool update) {
place += v.size() / 2;
v[place] = num;
if (!update)
return;
place /= 2;
while (place) {
if (is_min)
v[place] = min(v[place * 2], v[place * 2 + 1]);
else
v[place] = max(v[place * 2], v[place * 2 + 1]);
place /= 2;
}
}
void Modify(int a, int b, long long int num) { Modify(a, b, num, 1); }
void Add(int a, int b, long long int num) { Add(a, b, num, 1); }
void Init() { Update(1); }
long long int RMQ(int a, int b) {
if (is_min)
ret = LLONG_MAX;
else
ret = LLONG_MIN;
RMQ(a, b, 1);
return ret;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
Segment_Tree sg(K, true);
vector<pair<long long int, pair<int, int>>> v(N);
for (int i = 0; i < N; i++) {
cin >> L >> R >> M;
v[i] = {M, {L - M, R - M - 1}};
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
vector<int> w(K);
for (auto &i : w)
cin >> i;
for (int i = 0; i < N; i++) {
// cout << v[i].second.first << " " << v[i].second.second << " " <<
// v[i].first << endl;
L = -1, R = K + 1;
while (R - L > 1) {
int mid = (R + L) / 2;
if (w[mid] < v[i].second.first)
L = mid;
else
R = mid;
}
int st = L + 1;
L = -1, R = K + 1;
while (R - L > 1) {
int mid = (R + L) / 2;
if (w[mid] <= v[i].second.second)
L = mid;
else
R = mid;
}
int ed = L;
// cout << st << " " << ed << endl;
sg.Modify(st, ed, v[i].first);
}
for (int i = 0; i < K; i++) {
long long int box = sg.RMQ(i, i);
if (box == MOD * MOD)
cout << -1 << endl;
else
cout << box << endl;
}
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 845,569 | 845,570 | u468700753 | cpp |
p03035 | #include <cstdio>
using namespace std;
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (B >= 13)
printf("%d", B);
else if (B >= 6)
printf("%d", B / 2);
else
printf("0");
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int A, B;
scanf("%d %d", &A, &B);
if (A >= 13)
printf("%d", B);
else if (A >= 6)
printf("%d", B / 2);
else
printf("0");
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,580 | 845,581 | u316549668 | cpp |
p03035 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 5)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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, a) for (auto &(x) : (a))
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;
int main(int argc, char const *argv[]) {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6)
cout << b / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,582 | 845,583 | u102602414 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a <= 6)
cout << 0 << '\n';
else if (a < 13)
cout << b / 2 << '\n';
else
cout << b << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a < 6)
cout << 0 << '\n';
else if (a < 13)
cout << b / 2 << '\n';
else
cout << b << '\n';
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,584 | 845,585 | u855677173 | cpp |
p03035 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
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;
}
int INF = 1e10;
int MOD = 1e9 + 7;
signed main() {
int a, b;
cin >> a >> b;
if (13 <= a)
cout << b << endl;
else if (6 <= a < 13)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
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;
}
int INF = 1e10;
int MOD = 1e9 + 7;
signed main() {
int a, b;
cin >> a >> b;
if (13 <= a)
cout << b << endl;
else if (6 <= a && a < 13)
cout << b / 2 << endl;
else
cout << 0 << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 845,602 | 845,603 | u341447450 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a <= 12)
cout << b / 2 << endl;
else if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << 0 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (6 <= a && a <= 12)
cout << b / 2 << endl;
if (a >= 13)
cout << b << endl;
if (a <= 5)
cout << 0 << endl;
} | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 845,619 | 845,620 | u864785784 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a < 13) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 845,631 | 845,632 | u755918658 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a && a < 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,633 | 845,632 | u755918658 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a < 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a && a <= 12) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 845,634 | 845,632 | u755918658 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a <= 12)
cout << b / 2;
else
cout << 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"control_flow.branch.if.condition.change"
] | 845,635 | 845,636 | u330919736 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= b <= 12)
cout << b / 2;
else
cout << 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (6 <= a && a <= 12)
cout << b / 2;
else
cout << 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,637 | 845,636 | u330919736 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss, sss;
int ans = 0;
string anss = "";
cin >> a >> b;
int ab[] = {0, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1};
int result3 = std::max({a, b, c});
//--------------------------------------------------------------------------------
if (a <= 12)
ans = b;
else if (a >= 6)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss, sss;
int ans = 0;
string anss = "";
cin >> a >> b;
int ab[] = {0, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1};
int result3 = std::max({a, b, c});
//--------------------------------------------------------------------------------
if (a >= 13)
ans = b;
else if (a >= 6)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
} | [] | 845,640 | 845,641 | u392422101 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss, sss;
int ans = 0;
string anss = "";
cin >> a;
int ab[] = {0, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1};
int result3 = std::max({a, b, c});
//--------------------------------------------------------------------------------
if (a >= 13)
ans = b;
else if (a >= 6)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
int main() {
int a, b, c, d, x;
double da, db;
string s, ss, sss;
int ans = 0;
string anss = "";
cin >> a >> b;
int ab[] = {0, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1};
int result3 = std::max({a, b, c});
//--------------------------------------------------------------------------------
if (a >= 13)
ans = b;
else if (a >= 6)
ans = b / 2;
else
ans = 0;
cout << ans << endl;
} | [
"expression.operation.binary.add"
] | 845,642 | 845,641 | u392422101 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define imx INT_MAX
#define imn INT_MIN
#define llmx LLONG_MAX
#define llmn LLONG_MIN
#define fi first
#define se second
#define pb push_back
#define f_s(a) sort(a.begin(), a.end())
#define b_s(a) sort(a.rbegin(), a.rend())
#define p(a) cout << a << "\n"
// ll mod = 1000000007;
// #define l(i, )
// #define rl(i, a, b) for(int i = a; i < b; i++)
/////////////////////GCD//////////////////////
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extended_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = extended_gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
////////////////////SIEVE OF ERATOSTHENES//////////////////////
vector<int> sieveoferatosthenes(int n) {
vector<bool> prime(n + 1, true);
for (int i = 2; i <= sqrt(n); i++) {
if (prime[i]) {
for (int j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
}
vector<int> all_primes;
for (int i = 2; i <= n; i++) {
if (prime[i])
all_primes.pb(i);
}
return all_primes;
}
////////////////////BINARY EXPONENTIATION///////////////////////
ll bin_exp(ll a, ll b, ll mod) {
ll ans = 1;
while (b) {
if (b % 2) {
b--;
ans = (ans % mod * a % mod) % mod;
}
b /= 2;
a = (a % mod * a % mod) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, c;
cin >> n >> m;
if (n >= 13) {
c = m;
}
if (n >= 6 and n <= 12) {
c = m / 2;
} else {
c = 0;
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define imx INT_MAX
#define imn INT_MIN
#define llmx LLONG_MAX
#define llmn LLONG_MIN
#define fi first
#define se second
#define pb push_back
#define f_s(a) sort(a.begin(), a.end())
#define b_s(a) sort(a.rbegin(), a.rend())
#define p(a) cout << a << "\n"
// ll mod = 1000000007;
// #define l(i, )
// #define rl(i, a, b) for(int i = a; i < b; i++)
/////////////////////GCD//////////////////////
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extended_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll d = extended_gcd(b, a % b, x1, y1);
x = y1;
y = x1 - y1 * (a / b);
return d;
}
////////////////////SIEVE OF ERATOSTHENES//////////////////////
vector<int> sieveoferatosthenes(int n) {
vector<bool> prime(n + 1, true);
for (int i = 2; i <= sqrt(n); i++) {
if (prime[i]) {
for (int j = i * i; j <= n; j += i) {
prime[j] = false;
}
}
}
vector<int> all_primes;
for (int i = 2; i <= n; i++) {
if (prime[i])
all_primes.pb(i);
}
return all_primes;
}
////////////////////BINARY EXPONENTIATION///////////////////////
ll bin_exp(ll a, ll b, ll mod) {
ll ans = 1;
while (b) {
if (b % 2) {
b--;
ans = (ans % mod * a % mod) % mod;
}
b /= 2;
a = (a % mod * a % mod) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, c;
cin >> n >> m;
// cout<<n<<endl;
if (n >= 13) {
c = m;
} else if (n >= 6 and n <= 12) {
c = m / 2;
} else {
c = 0;
}
cout << c << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,643 | 845,644 | u644164234 | cpp |
p03035 | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main() {
int a, b, ans = 0;
cin >> a >> b;
if (a > 12)
ans = b;
else if (ans > 5)
ans = b / 2;
cout << ans << endl;
return 0;
}
| #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fceil(ll a, ll b) { return (a % b == 0 ? a / b : a / b + 1); }
int main() {
int a, b, ans = 0;
cin >> a >> b;
if (a > 12)
ans = b;
else if (a > 5)
ans = b / 2;
cout << ans << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,650 | 845,651 | u803173123 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (6 <= a <= 12) {
cout << int(b / 2) << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6 && a <= 12) {
cout << int(b / 2) << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 845,652 | 845,653 | u277868339 | cpp |
p03035 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && a < 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a >= 6 && a <= 12)
cout << b / 2 << endl;
else
cout << 0 << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,664 | 845,665 | u101048376 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A >= 13) {
cout << B << endl;
} else if (6 <= A && A <= 12) {
cout << B / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 845,673 | 845,674 | u046313635 | cpp |
p03035 | #include <iostream>
#include <list>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (b > 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | #include <iostream>
#include <list>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a > 5) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,711 | 845,712 | u947750088 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << a << endl;
} else if (a >= 6) {
cout << a / 2 << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
typedef long long ll;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// isPrime
// modpow modinv
// getDigit
int main() {
cout << fixed << setprecision(10);
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a >= 6) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
}
| [
"identifier.change",
"io.output.change"
] | 845,715 | 845,716 | u474760662 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a < 12 && 5 < a) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a > 12) {
cout << b << endl;
} else if (a <= 12 && 5 < a) {
cout << b / 2 << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 845,734 | 845,735 | u519899937 | cpp |
p03035 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (6 <= A && 12 <= A)
cout << B / 2 << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A >= 13)
cout << B << endl;
else if (6 <= A && A <= 12)
cout << B / 2 << endl;
else
cout << 0 << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 845,752 | 845,753 | u998349161 | cpp |
p03035 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 12)
cout << b << endl;
if (a >= 6 && a < 12)
cout << b / 2 << endl;
if (a < 6)
cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a >= 6 && a < 13)
cout << b / 2 << endl;
if (a < 6)
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 845,754 | 845,755 | u321168841 | cpp |
p03035 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/
// copy(v1.begin(), v1.end(), back_inserter(v2));
using namespace std;
ll gcd(ll a, ll b) {
ll c;
if (a < b) {
c = a;
a = b;
b = c;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
ll lcm(ll a, ll b) {
ll c;
c = a * b / gcd(a, b);
return c;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z() {
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i];
a[i] = a[minj];
a[minj] = t;
if (i != minj)
sw += 1;
}
return sw;
}
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
const ll mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
map<string, int> memo;
using P = pair<int, int>;
struct Clock {
int hour, minute, second;
void set(int h, int m, int s) {
hour = h;
minute = m;
second = s;
}
string to_str() {
string h, m, s;
h = to_string(hour);
m = to_string(minute);
s = to_string(second);
if (h.size() < 2)
h = "0" + h;
if (m.size() < 2)
m = "0" + m;
if (s.size() < 2)
s = "0" + s;
return h + ":" + m + ":" + s;
}
void shift(int diff_second) {
int h, m;
h = diff_second / 3600;
m = diff_second / 60;
diff_second %= 60;
second += diff_second;
}
};
/*void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}*/
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
if (a >= 6)
cout << b / 2;
else
cout << 0;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/
// copy(v1.begin(), v1.end(), back_inserter(v2));
using namespace std;
ll gcd(ll a, ll b) {
ll c;
if (a < b) {
c = a;
a = b;
b = c;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
ll lcm(ll a, ll b) {
ll c;
c = a * b / gcd(a, b);
return c;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z() {
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i];
a[i] = a[minj];
a[minj] = t;
if (i != minj)
sw += 1;
}
return sw;
}
bool is_prime(int x) {
if (x <= 1)
return false;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
const ll mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
map<string, int> memo;
using P = pair<int, int>;
struct Clock {
int hour, minute, second;
void set(int h, int m, int s) {
hour = h;
minute = m;
second = s;
}
string to_str() {
string h, m, s;
h = to_string(hour);
m = to_string(minute);
s = to_string(second);
if (h.size() < 2)
h = "0" + h;
if (m.size() < 2)
m = "0" + m;
if (s.size() < 2)
s = "0" + s;
return h + ":" + m + ":" + s;
}
void shift(int diff_second) {
int h, m;
h = diff_second / 3600;
m = diff_second / 60;
diff_second %= 60;
second += diff_second;
}
};
/*void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}*/
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b;
else if (a >= 6)
cout << b / 2;
else
cout << 0;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,756 | 845,757 | u545938555 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (b <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13) {
cout << b << endl;
} else if (a <= 5) {
cout << 0 << endl;
} else {
cout << b / 2 << endl;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 845,792 | 845,793 | u176218583 | cpp |
p03035 | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
if (a <= 5)
cout << "0" << endl;
else
cout << b / 2 << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a >= 13)
cout << b << endl;
else if (a <= 5)
cout << "0" << endl;
else
cout << b / 2 << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 845,797 | 845,798 | u027762862 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << a / 2 << endl;
else
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> b >> a;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << a / 2 << endl;
else
cout << a << endl;
}
| [
"expression.operation.binary.remove"
] | 845,799 | 845,800 | u233383925 | cpp |
p03035 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> a >> b;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << b / 2 << endl;
else
cout << b << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, ans;
cin >> b >> a;
if (b <= 5)
cout << 0 << endl;
else if (b >= 6 && b <= 12)
cout << a / 2 << endl;
else
cout << a << endl;
}
| [
"expression.operation.binary.remove",
"identifier.change",
"io.output.change"
] | 845,801 | 845,800 | u233383925 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.