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 |
|---|---|---|---|---|---|---|---|
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int A[n + 1], B[n];
for (int i = 0; i <= n; i++)
cin >> A[i];
for (int j = 0; j < n; j++)
cin >> B[j];
int count = 0;
for (int i = 0; i < n; i++) {
if (A[i] >= B[i])
count += B[i];
else {
int rem = B[i] - A[i];
count += A[i];
if (A[i + 1] >= rem) {
count += rem;
A[i + 1] -= rem;
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int A[n + 1], B[n];
for (int i = 0; i <= n; i++)
cin >> A[i];
for (int j = 0; j < n; j++)
cin >> B[j];
long long count = 0;
for (int i = 0; i < n; i++) {
if (A[i] >= B[i])
count += B[i];
else {
int rem = B[i] - A[i];
count += A[i];
if (A[i + 1] >= rem) {
count += rem;
A[i + 1] -= rem;
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,101 | 768,102 | u122897704 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int A[n + 1], B[n];
for (int i = 0; i <= n; i++)
cin >> A[i];
for (int j = 0; j < n; j++)
cin >> B[j];
int count = 0;
for (int i = 0; i < n; i++) {
int m1 = min(A[i], B[i]);
A[i] -= m1, B[i] -= m1, count += m1;
int m2 = min(A[i + 1], B[i]);
A[i + 1] -= m2, B[i] -= m2, count += m2;
}
cout << count;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int A[n + 1], B[n];
for (int i = 0; i <= n; i++)
cin >> A[i];
for (int j = 0; j < n; j++)
cin >> B[j];
long long count = 0;
for (int i = 0; i < n; i++) {
int m1 = min(A[i], B[i]);
A[i] -= m1, B[i] -= m1, count += m1;
int m2 = min(A[i + 1], B[i]);
A[i + 1] -= m2, B[i] -= m2, count += m2;
}
cout << count;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,103 | 768,104 | u122897704 | cpp |
p02959 | // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0], sKills = 0;
//杀怪数，前英雄留下的怪物数，总杀怪数
for (int i = 0; i < n; ++i) {
if (nokills + a[i + 1] <= b[i]) { // 英雄很牛
//前英雄留下的怪物数+当前城市怪物数 不够杀
kills = nokills + a[i + 1];
nokills = 0;
} else {
kills = b[i];
if (nokills > b[i]) //英雄太弱
//前英雄留下的怪物数都杀不完；
//只能将当前城市怪物留给下个英雄
nokills = a[i + 1];
else
nokills = nokills + a[i + 1] - b[i];
}
sKills += kills;
}
cout << sKills;
return 0;
}
| // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0];
long long sKills = 0;
//杀怪数，前英雄留下的怪物数，总杀怪数
for (int i = 0; i < n; ++i) {
if (nokills + a[i + 1] <= b[i]) { // 英雄很牛
//前英雄留下的怪物数+当前城市怪物数 不够杀
kills = nokills + a[i + 1];
nokills = 0;
} else {
kills = b[i];
if (nokills > b[i]) //英雄太弱
//前英雄留下的怪物数都杀不完；
//只能将当前城市怪物留给下个英雄
nokills = a[i + 1];
else
nokills = nokills + a[i + 1] - b[i];
}
sKills += kills;
}
cout << sKills;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 768,105 | 768,106 | u956214843 | cpp |
p02959 | // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0], sKills = 0;
for (int i = 0; i < n; ++i) {
if (nokills + a[i + 1] <= b[i]) {
kills = nokills + a[i + 1];
nokills = 0;
} else {
kills = b[i];
if (nokills > b[i])
nokills = a[i + 1];
else
nokills = nokills + a[i + 1] - b[i];
}
sKills += kills;
}
cout << sKills;
return 0;
}
| // atcode abc135_c
#include <iostream>
using namespace std;
int main() {
int n, b[100002], a[100002];
cin >> n;
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
int kills, nokills = a[0];
long long sKills = 0;
//杀怪数，前英雄留下的怪物数，总杀怪数
for (int i = 0; i < n; ++i) {
if (nokills + a[i + 1] <= b[i]) { // 英雄很牛
//前英雄留下的怪物数+当前城市怪物数 不够杀
kills = nokills + a[i + 1];
nokills = 0;
} else {
kills = b[i];
if (nokills > b[i]) //英雄太弱
//前英雄留下的怪物数都杀不完；
//只能将当前城市怪物留给下个英雄
nokills = a[i + 1];
else
nokills = nokills + a[i + 1] - b[i];
}
sKills += kills;
}
cout << sKills;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 768,107 | 768,106 | u956214843 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int a[10010], b[10010];
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
cnt += a[i];
cnt += min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int a[100010], b[100010];
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
cnt += a[i];
cnt += min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
cnt += b[i];
}
}
cout << cnt << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,108 | 768,109 | u218759384 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (ll i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (ll i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define print(d, arr) \
REP(i, d) cout << arr[i] << " "; \
cout << endl;
#define print2D(h, w, arr) \
REP(i, h) { \
REP(j, w) cout << arr[i][j] << " "; \
cout << endl; \
}
ll N;
vector<ll> A, B;
int main() {
cin >> N;
ll tmp;
REP(i, N + 1) {
cin >> tmp;
A.emplace_back(tmp);
}
REP(i, N) {
cin >> tmp;
B.emplace_back(tmp);
}
ll count = 0;
REP(i, N) {
if (B[i] - A[i] > 0) {
count += A[i];
if (B[i + 1] - (B[i] - A[i]) >= 0) {
A[i + 1] -= B[i] - A[i];
count += B[i] - A[i];
} else {
count += A[i + 1];
A[i + 1] = 0;
}
} else {
count += B[i];
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (ll i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (ll i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define print(d, arr) \
REP(i, d) cout << arr[i] << " "; \
cout << endl;
#define print2D(h, w, arr) \
REP(i, h) { \
REP(j, w) cout << arr[i][j] << " "; \
cout << endl; \
}
ll N;
vector<ll> A, B;
int main() {
cin >> N;
ll tmp;
REP(i, N + 1) {
cin >> tmp;
A.emplace_back(tmp);
}
REP(i, N) {
cin >> tmp;
B.emplace_back(tmp);
}
ll count = 0;
REP(i, N) {
if (B[i] - A[i] > 0) {
count += A[i];
if (A[i + 1] - (B[i] - A[i]) >= 0) {
A[i + 1] -= B[i] - A[i];
count += B[i] - A[i];
} else {
count += A[i + 1];
A[i + 1] = 0;
}
} else {
count += B[i];
}
}
cout << count << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 768,110 | 768,111 | u193035537 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int sum = 0;
rep(i, n) {
int k = min(a[i], b[i]);
sum += k;
a[i] -= k;
b[i] -= k;
int l = min(a[i + 1], b[i]);
sum += l;
a[i + 1] -= l;
}
/*
if(a[i] >= b[i]){
sum += b[i];
}else{
sum += a[i];
b[i] -= a[i];
if(a[i + 1] >= b[i]){
a[i + 1] -= b[i];
sum += b[i];
}else{
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
*/
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll sum = 0;
rep(i, n) {
int k = min(a[i], b[i]);
sum += k;
a[i] -= k;
b[i] -= k;
int l = min(a[i + 1], b[i]);
sum += l;
a[i + 1] -= l;
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,112 | 768,113 | u358859892 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int sum = 0;
rep(i, n) {
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
sum += b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b) for (int i = a; i < b; i++)
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll sum = 0;
rep(i, n) {
/*
int k = min(a[i], b[i]);
sum += k;
// a[i] -= k;
b[i] -= k;
int l = min(a[i + 1], b[i]);
sum += l;
a[i + 1] -= l;
}
*/
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
sum += b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,114 | 768,115 | u358859892 | cpp |
p02959 | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
int result = 0;
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int t = A[i + 1] - (B[i] - A[i]);
if (t < 0) {
result += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
result += B[i];
A[i + 1] = t;
}
}
}
cout << result;
return 0;
}
| #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
long long result = 0; //这里要设置成long long 因为可能会很大
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int t = A[i + 1] - (B[i] - A[i]);
if (t < 0) {
result += (A[i] + A[i + 1]);
A[i + 1] = 0;
} else {
result += B[i];
A[i + 1] = t;
}
}
}
cout << result;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,116 | 768,117 | u346312771 | cpp |
p02959 | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
int result = 0;
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int t = A[i + 1] - (B[i] - A[i]);
if (t < 0) {
result += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
result += B[i];
A[i + 1] = t;
}
}
}
cout << result;
return 0;
} | #include <iostream>
using namespace std;
int N, A[100010], B[100010];
int main() {
cin >> N;
for (int i = 1; i <= N + 1; i++)
cin >> A[i];
for (int i = 1; i <= N; i++)
cin >> B[i];
long long result = 0;
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i])
result += B[i];
else {
int t = A[i + 1] - (B[i] - A[i]);
if (t < 0) {
result += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
result += B[i];
A[i + 1] = t;
}
}
}
cout << result;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,118 | 768,119 | u427202024 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int count = 0;
int tmp;
for (int i = 0; i < N; i++) {
if (B.at(i) - A.at(i) <= 0) {
count += B.at(i);
} else {
tmp = B.at(i) - A.at(i);
if (tmp - A.at(i + 1) <= 0) {
count += B.at(i);
A.at(i + 1) -= tmp;
} else {
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long count = 0;
long long tmp;
for (int i = 0; i < N; i++) {
if (B.at(i) - A.at(i) <= 0) {
count += B.at(i);
} else {
tmp = B.at(i) - A.at(i);
if (tmp - A.at(i + 1) <= 0) {
count += B.at(i);
A.at(i + 1) -= tmp;
} else {
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,120 | 768,121 | u109139674 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a << " -> " << a << "\n"
const int N = 2e5;
int n, a[N], b[N];
ll ans;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
cin >> b[i];
}
for (int i = 1; i <= n; ++i) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
b[i] -= min(a[i + 1], b[i]);
}
cout << ans;
return 0;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a << " -> " << a << "\n"
const int N = 2e5;
int n, a[N], b[N];
ll ans;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
cin >> b[i];
}
for (int i = 1; i <= n; ++i) {
ans += min(a[i], b[i]);
// a[i] -= min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans;
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 768,122 | 768,123 | u206925914 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
int cnt = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
A.at(i + 1) =
A.at(i + 1) - min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, cnt = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
A.at(i + 1) =
A.at(i + 1) - min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
}
cout << cnt << endl;
}
| [] | 768,129 | 768,130 | u984247484 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cnt = 0;
cin >> N;
vector<int64_t> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
A.at(i + 1) =
A.at(i + 1) - min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, cnt = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
cnt = cnt + min(A.at(i), B.at(i));
cnt = cnt + min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
A.at(i + 1) =
A.at(i + 1) - min(A.at(i + 1), B.at(i) - min(A.at(i), B.at(i)));
}
cout << cnt << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 768,131 | 768,130 | u984247484 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int f1, f2;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
f1 = min(a[0], b[0]), f2 = min(a[1], b[0] - f1);
int sum = 0;
sum += f1 + f2;
for (int i = 1; i < n; i++) {
f1 = min(a[i] - f2, b[i]);
f2 = min(a[i + 1], b[i] - f1);
sum += f1 + f2;
}
cout << sum << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int f1, f2;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
f1 = min(a[0], b[0]), f2 = min(a[1], b[0] - f1);
long long sum = 0;
sum += f1 + f2;
for (int i = 1; i < n; i++) {
f1 = min(a[i] - f2, b[i]);
f2 = min(a[i + 1], b[i] - f1);
sum += f1 + f2;
}
cout << sum << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,135 | 768,136 | u115106582 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++)
scanf("%d", &b[i]);
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else {
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long a[100010], b[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
long long ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else {
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change"
] | 768,137 | 768,138 | u465698810 | cpp |
p02959 | #include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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;
}
///////////////////////////////////////////////
/*(._.)*/
int main() {
int N;
cin >> N;
static int A[100002];
static int B[100002];
int ans = 0;
FORq(i, 1, N + 1) { cin >> A[i]; }
FORq(i, 1, N) { cin >> B[i]; }
FORq(i, 1, N) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
ans += min(A[i + 1], B[i]);
A[i + 1] = max(0, A[i + 1] - B[i]);
}
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
#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)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define SCD3(m, n, k) scanf("%d%d%d", &m, &n, &k)
#define SCLLD(n) scanf("%lld", &n)
#define SCLLD2(m, n) scanf("%lld%lld", &m, &n)
#define SCLLD3(m, n, k) scanf("%lld%lld%lld", &m, &n, &k)
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
const ll MOD = 1e9 + 7;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
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;
}
///////////////////////////////////////////////
/*(._.)*/
int main() {
int N;
cin >> N;
static ll A[100002];
static ll B[100002];
ll ans = 0;
FORq(i, 1, N + 1) { cin >> A[i]; }
FORq(i, 1, N) { cin >> B[i]; }
FORq(i, 1, N) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
ans += min(A[i + 1], B[i]);
A[i + 1] = max(0LL, A[i + 1] - B[i]);
}
}
cout << ans << "\n";
}
| [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 768,139 | 768,140 | u236433947 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1), vv(n);
for (int i = 0; i < n + 1; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> vv[i];
}
int res = 0;
for (int i = 0; i < n; i++) {
if (v[i] < vv[i]) {
res += v[i];
vv[i] -= v[i];
if (vv[i] > v[i + 1]) {
res += v[i + 1];
v[i + 1] = 0;
} else {
res += vv[i];
v[i + 1] -= vv[i];
}
}
else {
res += vv[i];
v[i] -= vv[i];
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> v(n + 1), vv(n);
for (int i = 0; i < n + 1; i++) {
cin >> v[i];
}
for (int i = 0; i < n; i++) {
cin >> vv[i];
}
long long res = 0;
for (int i = 0; i < n; i++) {
if (v[i] < vv[i]) {
res += v[i];
vv[i] -= v[i];
if (vv[i] > v[i + 1]) {
res += v[i + 1];
v[i + 1] = 0;
} else {
res += vv[i];
v[i + 1] -= vv[i];
}
}
else {
res += vv[i];
v[i] -= vv[i];
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,141 | 768,142 | u615763347 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
ll ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll zero = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i] + a[i + 1], b[i]);
if (b[i] >= a[i] + a[i + 1]) {
a[i] = 0;
a[i + 1] = 0;
} else {
b[i] = min(zero, b[i] - a[i]);
a[i + 1] -= b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
ll ans = 0;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll zero = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i] + a[i + 1], b[i]);
if (b[i] >= a[i] + a[i + 1]) {
a[i] = 0;
a[i + 1] = 0;
} else {
b[i] = max(zero, (b[i] - a[i]));
a[i + 1] -= b[i];
}
}
cout << ans << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 768,143 | 768,144 | u280114218 | cpp |
p02959 | #/*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(v) v.begin(), v.end()
#define rep(i, k, n) for (int i = k; i < n; i++)
#define hs \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const ll mod = 1e9 + 7;
const ll MAX = 401;
//
//
ll solve() {
ll n;
cin >> n;
vll a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll k = min(a[i], b[i]);
a[i] -= k;
b[i] -= k;
ans += k;
// cout<<k;
ans += min(a[i + 1], b[i] - k);
a[i + 1] -= min(a[i + 1], b[i] - k);
}
cout << ans;
}
int main() {
hs;
ll t;
// cin>>t;
t = 1;
while (t--)
solve();
return 0;
} | #/*
AUTHOR:shivam51
IIESTS
*/
#include <bits/stdc++.h>
using namespace std;
//
#define add accumulate
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define vpll vector<pll>
#define all(v) v.begin(), v.end()
#define rep(i, k, n) for (int i = k; i < n; i++)
#define hs \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const ll mod = 1e9 + 7;
const ll MAX = 401;
//
//
ll solve() {
ll n;
cin >> n;
vll a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
ll ans = 0;
rep(i, 0, n) {
ll k = min(a[i], b[i]);
a[i] -= k;
b[i] -= k;
ans += k;
// cout<<k;
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans;
}
int main() {
hs;
ll t;
// cin>>t;
t = 1;
while (t--)
solve();
return 0;
} | [
"expression.operation.binary.remove"
] | 768,155 | 768,156 | u216557283 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int count = 0;
vector<int> cities;
vector<int> heroes;
int city;
int hero;
for (int i = 0; i <= N; i++) {
cin >> city;
cities.push_back(city);
}
for (int i = 0; i < N; i++) {
cin >> hero;
heroes.push_back(hero);
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (cities.at(i) >= heroes.at(i)) {
sum += heroes.at(i);
}
if (cities.at(i) < heroes.at(i)) {
sum += cities.at(i);
heroes.at(i) -= cities.at(i);
if (cities.at(i + 1) <= heroes.at(i)) {
sum += cities.at(i + 1);
cities.at(i + 1) = 0;
} else {
cities.at(i + 1) -= heroes.at(i);
sum += heroes.at(i);
}
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int count = 0;
vector<int> cities;
vector<int> heroes;
int city;
int hero;
for (int i = 0; i <= N; i++) {
cin >> city;
cities.push_back(city);
}
for (int i = 0; i < N; i++) {
cin >> hero;
heroes.push_back(hero);
}
long long sum = 0;
for (int i = 0; i < N; i++) {
if (cities.at(i) >= heroes.at(i)) {
sum += heroes.at(i);
}
if (cities.at(i) < heroes.at(i)) {
sum += cities.at(i);
heroes.at(i) -= cities.at(i);
if (cities.at(i + 1) <= heroes.at(i)) {
sum += cities.at(i + 1);
cities.at(i + 1) = 0;
} else {
cities.at(i + 1) -= heroes.at(i);
sum += heroes.at(i);
}
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,157 | 768,158 | u991462056 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b;
int p;
for (int i = 0; i < n + 1; i++) {
cin >> p;
a.push_back(p);
}
for (int i = 0; i < n; i++) {
cin >> p;
b.push_back(p);
}
long long cnt = 0;
int m;
for (int i = n - 1; i >= 0; i--) {
m = min(b[i], a[i + 1]);
b[i] -= m;
cnt += m;
a[i + 1] -= m;
m = min(b[i], a[i]);
b[i] -= m;
cnt += m;
a[i + 1] -= m;
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b;
int p;
for (int i = 0; i < n + 1; i++) {
cin >> p;
a.push_back(p);
}
for (int i = 0; i < n; i++) {
cin >> p;
b.push_back(p);
}
long long cnt = 0;
int m;
for (int i = n - 1; i >= 0; i--) {
m = min(b[i], a[i + 1]);
b[i] -= m;
cnt += m;
a[i + 1] -= m;
m = min(b[i], a[i]);
b[i] -= m;
cnt += m;
a[i] -= m;
}
cout << cnt << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 768,167 | 768,168 | u054798759 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
int ii = 0;
int ip = 0;
for (int i = 0; i < n; i++) {
if (i >= 1) {
ii = min(a[i] - ip, b[i]);
} else {
ii = min(a[i], b[i]);
}
ip = min(a[i + 1], b[i] - ii);
// cout << "ii = " << ii << ", ip = " << ip << endl;
ans += ii + ip;
// cout << i << ":合計" << ans << "体倒した" << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long ans = 0;
int ii = 0;
int ip = 0;
for (int i = 0; i < n; i++) {
if (i >= 1) {
ii = min(a[i] - ip, b[i]);
} else {
ii = min(a[i], b[i]);
}
ip = min(a[i + 1], b[i] - ii);
// cout << "ii = " << ii << ", ip = " << ip << endl;
ans += ii + ip;
// cout << i << ":合計" << ans << "体倒した" << endl;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,179 | 768,180 | u680087927 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {}, sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] > a[i]) {
sum += a[i];
if (b[i] - a[i] < a[i + 1]) {
sum += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
} else {
sum += b[i];
}
}
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {};
ll sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] > a[i]) {
sum += a[i];
if (b[i] - a[i] < a[i + 1]) {
sum += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
} else {
sum += b[i];
}
}
cout << sum << endl;
} | [] | 768,181 | 768,182 | u098652914 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {}, sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] >= a[i]) {
sum += a[i];
if (b[i] - a[i] < a[i + 1]) {
sum += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
} else {
sum += b[i];
}
}
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, a[100005] = {}, b[100005] = {};
ll sum = 0;
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] > a[i]) {
sum += a[i];
if (b[i] - a[i] < a[i + 1]) {
sum += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
} else {
sum += b[i];
}
}
cout << sum << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,183 | 768,182 | u098652914 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%lld", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) {
d += b[i];
if (a[i] < b[i]) {
a[i] = a[i] + a[i + 1] - b[i];
}
} else if (a[i] + a[i + 1] < b[i]) {
d += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
printf("%lld\n", d);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%lld", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) {
d += b[i];
if (a[i] < b[i]) {
a[i + 1] = a[i] + a[i + 1] - b[i];
}
} else if (a[i] + a[i + 1] < b[i]) {
d += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
printf("%lld\n", d);
}
| [
"assignment.change"
] | 768,186 | 768,187 | u422818846 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%d", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++)
scanf("%d", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) {
d += b[i];
if (a[i] < b[i]) {
a[i] = a[i] + a[i + 1] - b[i];
}
} else if (a[i] + a[i + 1] < b[i]) {
d += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
printf("%lld\n", d);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, d = 0;
scanf("%lld", &n);
long long int a[n + 3], b[n + 3];
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] >= b[i]) {
d += b[i];
if (a[i] < b[i]) {
a[i + 1] = a[i] + a[i + 1] - b[i];
}
} else if (a[i] + a[i + 1] < b[i]) {
d += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
printf("%lld\n", d);
}
| [
"literal.string.change",
"call.arguments.change",
"assignment.change"
] | 768,188 | 768,187 | u422818846 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int num = min(a[i], b[i]);
ans += num;
b[i] -= num;
a[i] -= num;
num = min(a[i + 1], b[i]);
ans += num;
b[i] -= num;
a[i + 1] -= num;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
int num = min(a[i], b[i]);
ans += num;
b[i] -= num;
a[i] -= num;
num = min(a[i + 1], b[i]);
ans += num;
b[i] -= num;
a[i + 1] -= num;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 768,191 | 768,192 | u291178324 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
int brr[n];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
cin >> brr[i];
int take = 0;
for (int i = 0; i < n; i++) {
int can = min(arr[i], brr[i]);
take += can;
arr[i] -= can;
brr[i] -= can;
int can2 = min(arr[i + 1], brr[i]);
take += can2;
arr[i + 1] -= can2;
brr[i] -= can2;
}
cout << take << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
int brr[n];
for (int i = 0; i < n + 1; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
cin >> brr[i];
long long take = 0;
for (int i = 0; i < n; i++) {
int can = min(arr[i], brr[i]);
take += can;
arr[i] -= can;
brr[i] -= can;
int can2 = min(arr[i + 1], brr[i]);
take += can2;
arr[i + 1] -= can2;
brr[i] -= can2;
}
cout << take << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,200 | 768,201 | u839270538 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int X[N + 1];
int Y[N];
int cnt = 0;
for (int i = 0; i < N + 1; ++i)
cin >> X[i];
for (int i = 0; i < N; ++i)
cin >> Y[i];
for (int i = 0; i < N; ++i) {
cnt += fmin(Y[i], X[i]);
cnt += fmin(Y[i] - fmin(Y[i], X[i]), X[i + 1]);
X[i + 1] -= fmin(Y[i] - fmin(Y[i], X[i]), X[i + 1]);
}
cout << cnt << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long X[N + 1];
long Y[N];
long cnt = 0;
for (int i = 0; i < N + 1; ++i)
cin >> X[i];
for (int i = 0; i < N; ++i)
cin >> Y[i];
for (int i = 0; i < N; ++i) {
cnt += fmin(Y[i], X[i]);
cnt += fmin(Y[i] - fmin(Y[i], X[i]), X[i + 1]);
X[i + 1] -= fmin(Y[i] - fmin(Y[i], X[i]), X[i + 1]);
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,202 | 768,203 | u431929942 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = N - 1; i >= 0; i--) {
if (B[i] >= A[i + 1]) {
ans += A[i + 1];
B[i] -= A[i + 1];
if (B[i] >= A[i]) {
ans += A[i];
A[i] = 0;
} else {
ans += B[i];
A[i] -= B[i];
}
} else {
ans += B[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = N - 1; i >= 0; i--) {
if (B[i] >= A[i + 1]) {
ans += A[i + 1];
B[i] -= A[i + 1];
if (B[i] >= A[i]) {
ans += A[i];
A[i] = 0;
} else {
ans += B[i];
A[i] -= B[i];
}
} else {
ans += B[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,204 | 768,205 | u109497000 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] = b[i] - a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] = a[i + 1] - b[i];
;
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] = b[i] - a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] = a[i + 1] - b[i];
;
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,206 | 768,207 | u057810841 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0, lest = A[0];
for (int i = 0; i < N; i++) {
if (lest >= B[i]) {
ans += B[i];
lest = A[i + 1];
} else {
ans += lest;
B[i] -= lest;
ans += min(B[i], A[i + 1]);
lest = max(A[i + 1] - B[i], 0);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
long long ans = 0, lest = A[0];
for (int i = 0; i < N; i++) {
if (lest >= B[i]) {
ans += B[i];
lest = A[i + 1];
} else {
ans += lest;
B[i] -= lest;
ans += min(B[i], A[i + 1]);
lest = max(A[i + 1] - B[i], 0);
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,209 | 768,210 | u544437817 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
int n;
cin >> n;
A[i] = n;
}
for (int i = 0; i < N; i++) {
int n;
cin >> n;
B[i] = n;
}
int total_kill = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
total_kill += B[i];
continue;
} else {
total_kill += A[i];
B[i] -= A[i];
}
if (A[i + 1] > B[i]) {
total_kill += B[i];
A[i + 1] -= B[i];
} else {
total_kill += A[i + 1];
A[i + 1] = 0;
}
}
cout << total_kill << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
int n;
cin >> n;
A[i] = n;
}
for (int i = 0; i < N; i++) {
int n;
cin >> n;
B[i] = n;
}
long total_kill = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
total_kill += B[i];
continue;
} else {
total_kill += A[i];
B[i] -= A[i];
}
if (A[i + 1] > B[i]) {
total_kill += B[i];
A[i + 1] -= B[i];
} else {
total_kill += A[i + 1];
A[i + 1] = 0;
}
}
cout << total_kill << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 768,213 | 768,214 | u513365687 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, kotae = 0;
cin >> n;
int a[n + 1], b[n];
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
if (a[i] <= b[i]) {
b[i] -= a[i];
kotae += a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) {
kotae += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
kotae += b[i];
}
} else {
kotae += b[i];
}
}
cout << kotae;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long int n, i, kotae = 0;
cin >> n;
long int a[n + 1], b[n];
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
if (a[i] <= b[i]) {
b[i] -= a[i];
kotae += a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) {
kotae += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
kotae += b[i];
}
} else {
kotae += b[i];
}
}
cout << kotae;
}
| [
"variable_declaration.type.widen.change"
] | 768,215 | 768,216 | u016726316 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, c;
cin >> N;
A = 0;
B = 0;
c = 0;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
cin >> b.at(i);
A = min(a.at(i) - B, b.at(i));
B = min(a.at(i + 1), b.at(i) - A);
c = c + (A + B);
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, A, B, c;
cin >> N;
A = 0;
B = 0;
c = 0;
vector<long int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
cin >> b.at(i);
A = min(a.at(i) - B, b.at(i));
B = min(a.at(i + 1), b.at(i) - A);
c = c + (A + B);
}
cout << c << endl;
} | [
"variable_declaration.type.widen.change"
] | 768,219 | 768,220 | u072774815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, c;
cin >> N;
A = 0;
B = 0;
c = 0;
vector<int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
cin >> b.at(i);
A = min(a.at(i), b.at(i));
B = min(a.at(i + 1), b.at(i) - A);
c = c + (A + B);
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long int N, A, B, c;
cin >> N;
A = 0;
B = 0;
c = 0;
vector<long int> a(N + 1), b(N);
for (int i = 0; i < N + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < N; i++) {
cin >> b.at(i);
A = min(a.at(i) - B, b.at(i));
B = min(a.at(i + 1), b.at(i) - A);
c = c + (A + B);
}
cout << c << endl;
} | [
"variable_declaration.type.widen.change",
"assignment.change"
] | 768,221 | 768,220 | u072774815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
using Tree = vector<pair<int, int>>;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
ans += tmp;
b[i] -= tmp;
a[i] -= tmp;
if (b[i] > 0) {
int hoge = min(a[i + 1], b[i]);
ans += hoge;
b[i] -= hoge;
a[i + 1] -= hoge;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
using Tree = vector<pair<int, int>>;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ll tmp = min(a[i], b[i]);
ans += tmp;
b[i] -= tmp;
a[i] -= tmp;
if (b[i] > 0) {
ll hoge = min(a[i + 1], b[i]);
ans += hoge;
b[i] -= hoge;
a[i + 1] -= hoge;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 768,222 | 768,223 | u850894780 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int N;
cin >> N;
vector<long> enemies;
vector<long> heroes;
for (int i = 0; i < N + 1; i++) {
long A;
cin >> A;
enemies.push_back(A);
}
for (int i = 0; i < N; i++) {
long B;
cin >> B;
heroes.push_back(B);
}
int defeatTotalCount = 0;
for (int i = 0; i < N; i++) {
long defeatCount = min(enemies[i], heroes[i]);
long defeatCountOfNextCity =
(heroes[i] > enemies[i]) ? min(heroes[i] - enemies[i], enemies[i + 1])
: 0;
defeatTotalCount += defeatCount + defeatCountOfNextCity;
enemies[i + 1] -= defeatCountOfNextCity;
}
cout << defeatTotalCount << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int N;
cin >> N;
vector<long> enemies;
vector<long> heroes;
for (int i = 0; i < N + 1; i++) {
long A;
cin >> A;
enemies.push_back(A);
}
for (int i = 0; i < N; i++) {
long B;
cin >> B;
heroes.push_back(B);
}
long defeatTotalCount = 0;
for (int i = 0; i < N; i++) {
long defeatCount = min(enemies[i], heroes[i]);
long defeatCountOfNextCity =
(heroes[i] > enemies[i]) ? min(heroes[i] - enemies[i], enemies[i + 1])
: 0;
defeatTotalCount += defeatCount + defeatCountOfNextCity;
enemies[i + 1] -= defeatCountOfNextCity;
}
cout << defeatTotalCount << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,230 | 768,231 | u598710706 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i <= N; i++) {
if (i == 0) {
ans += min(A[i], B[i]);
} else if (i == N) {
int tmp = min(A[i], B[i - 1] - min(A[i - 1], B[i - 1]));
ans += tmp;
} else {
int tmp = min(A[i], B[i - 1] - min(A[i - 1], B[i - 1]));
ans += tmp;
A[i] = A[i] - tmp;
ans += min(A[i], B[i]);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i <= N; i++) {
if (i == 0) {
ans += min(A[i], B[i]);
} else if (i == N) {
int tmp = min(A[i], B[i - 1] - min(A[i - 1], B[i - 1]));
ans += tmp;
} else {
int tmp = min(A[i], B[i - 1] - min(A[i - 1], B[i - 1]));
ans += tmp;
A[i] = A[i] - tmp;
ans += min(A[i], B[i]);
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,233 | 768,234 | u134857688 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int res1 = min(A[i], B[i]);
ans += res1;
B[i] -= res1;
int res2 = min(A[i + 1], B[i]);
ans += res2;
A[i + 1] -= res2;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
int res1 = min(A[i], B[i]);
ans += res1;
B[i] -= res1;
int res2 = min(A[i + 1], B[i]);
ans += res2;
A[i + 1] -= res2;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,235 | 768,236 | u134857688 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int cur = min(a[i], b[i]);
ans += cur;
b[i] -= cur;
int next = min(a[i + 1], b[i]);
ans += next;
a[i + 1] -= next;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
int cur = min(a[i], b[i]);
ans += cur;
b[i] -= cur;
int next = min(a[i + 1], b[i]);
ans += next;
a[i + 1] -= next;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,237 | 768,238 | u272481916 | cpp |
p02959 | #include <iostream>
int main() {
int n;
std ::cin >> n;
long long monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
long long heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
int d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i]) {
d += heroes[i];
continue;
} else {
d += monsters[i];
heroes[i] -= monsters[i];
if (monsters[i + 1] >= heroes[i]) {
d += heroes[i];
monsters[i + 1] -= heroes[i];
continue;
} else {
d += monsters[i + 1];
monsters[i + 1] = 0;
}
}
}
std ::cout << d << '\n';
}
| #include <iostream>
int main() {
int n;
std ::cin >> n;
long long monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
long long heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
long long d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i]) {
d += heroes[i];
continue;
} else {
d += monsters[i];
heroes[i] -= monsters[i];
if (monsters[i + 1] >= heroes[i]) {
d += heroes[i];
monsters[i + 1] -= heroes[i];
continue;
} else {
d += monsters[i + 1];
monsters[i + 1] = 0;
}
}
}
std ::cout << d << '\n';
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,239 | 768,240 | u683788379 | cpp |
p02959 | #include <iostream>
int main() {
int n;
std ::cin >> n;
int monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
int heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
int d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i]) {
d += heroes[i];
continue;
} else {
d += monsters[i];
heroes[i] -= monsters[i];
if (monsters[i + 1] >= heroes[i]) {
d += heroes[i];
monsters[i + 1] -= heroes[i];
continue;
} else {
d += monsters[i + 1];
monsters[i + 1] = 0;
}
}
}
std ::cout << d << '\n';
}
| #include <iostream>
int main() {
int n;
std ::cin >> n;
long long monsters[n + 1];
for (int i = 0; i <= n; i++)
std ::cin >> monsters[i];
long long heroes[n];
for (int i = 0; i < n; i++)
std ::cin >> heroes[i];
long long d = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] >= heroes[i]) {
d += heroes[i];
continue;
} else {
d += monsters[i];
heroes[i] -= monsters[i];
if (monsters[i + 1] >= heroes[i]) {
d += heroes[i];
monsters[i + 1] -= heroes[i];
continue;
} else {
d += monsters[i + 1];
monsters[i + 1] = 0;
}
}
}
std ::cout << d << '\n';
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,241 | 768,240 | u683788379 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], b[1000], an = 0;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
an += b[i];
else {
an += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
an += b[i];
a[i + 1] -= b[i];
} else {
an += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << an << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100001], b[100001], an = 0;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
an += b[i];
else {
an += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
an += b[i];
a[i + 1] -= b[i];
} else {
an += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << an << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,242 | 768,243 | u314209309 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int A;
cin >> A;
vector<int> data(A + 1);
vector<int> gekitui(A);
for (int i = 0; i < A + 1; i++) {
cin >> data[i];
}
for (int i = 0; i < A; i++) {
cin >> gekitui[i];
}
int sougekituisuu = 0;
for (int i = 0; i < A; i++) {
int sitai = min(data[i], gekitui[i]);
sougekituisuu += sitai;
data[i] -= sitai;
gekitui[i] -= sitai;
sitai = min(data[i + 1], gekitui[i]);
sougekituisuu += sitai;
data[i + 1] -= sitai;
}
cout << sougekituisuu << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
long A;
cin >> A;
vector<long> data(A + 1);
vector<long> gekitui(A);
for (int i = 0; i < A + 1; i++) {
cin >> data[i];
}
for (int i = 0; i < A; i++) {
cin >> gekitui[i];
}
long sougekituisuu = 0;
for (int i = 0; i < A; i++) {
long sitai = min(data[i], gekitui[i]);
sougekituisuu += sitai;
data[i] -= sitai;
gekitui[i] -= sitai;
sitai = min(data[i + 1], gekitui[i]);
sougekituisuu += sitai;
data[i + 1] -= sitai;
}
cout << sougekituisuu << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,246 | 768,247 | u983547593 | cpp |
p02959 | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
int ans = 0;
for (int i = 0; i < N; ++i) {
if (A[i] <= B[i]) {
ans += A[i];
B[i] -= A[i];
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
} else {
ans += B[i];
A[i] -= B[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; ++i) {
if (A[i] <= B[i]) {
ans += A[i];
B[i] -= A[i];
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
} else {
ans += B[i];
A[i] -= B[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 768,250 | 768,251 | u142878260 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long sum = 0;
cin >> n;
int mon[n + 10], he[n + 9];
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++) {
cin >> he[i];
}
for (int i = 0; i < n; i++) {
if (mon[i] >= he[i]) {
sum += he[i];
}
if (mon[i] < he[i]) {
sum += mon[i];
he[i] = he[i] - mon[i];
if (mon[i + 1] >= he[i]) {
sum += he[i];
mon[i + 1] = mon[i + 1] - he[i];
}
if (mon[i + 1] < he[i]) {
sum += mon[i + 1];
mon[i + 1] = 0;
}
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long sum = 0;
cin >> n;
int mon[n + 10], he[n + 9];
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++) {
cin >> he[i];
}
for (int i = 0; i < n; i++) {
if (mon[i] >= he[i]) {
sum += he[i];
} else {
if (mon[i] < he[i]) {
sum += mon[i];
he[i] = he[i] - mon[i];
if (mon[i + 1] >= he[i]) {
sum += he[i];
mon[i + 1] = mon[i + 1] - he[i];
} else {
if (mon[i + 1] < he[i]) {
sum += mon[i + 1];
mon[i + 1] = 0;
}
}
}
}
}
cout << sum;
} | [
"control_flow.branch.else.add"
] | 768,252 | 768,253 | u957558006 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define For(i, m, n) for (int i = m; i < n; i++)
#define Fors(i, m, n) for (int i = m; i <= n; i++)
#define Inf 2e9
#define F first
#define S second
#define pb push_back
#define mp make_pair
struct speed {
speed() {
cin.tie();
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
} speed;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
Rep(i, n + 1) { cin >> a[i]; }
Rep(i, n) { cin >> b[i]; }
ll ans = 0;
Rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (b[i] <= a[i + 1]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef unsigned long ul;
typedef unsigned int ui;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define All(v) (v).begin(), (v).end()
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
#define Reps(i, n) for (int i = 1; i <= (int)n; i++)
#define For(i, m, n) for (int i = m; i < n; i++)
#define Fors(i, m, n) for (int i = m; i <= n; i++)
#define Inf 2e9
#define F first
#define S second
#define pb push_back
#define mp make_pair
struct speed {
speed() {
cin.tie();
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
} speed;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
Rep(i, n + 1) { cin >> a[i]; }
Rep(i, n) { cin >> b[i]; }
ll ans = 0;
Rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (b[i] <= a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 768,256 | 768,257 | u658899890 | cpp |
p02959 | ///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
/// email:ashrafulhaquetoni@gmail.com///
///*******contact:01640690531*******///
///*********************************///
#include <bits/stdc++.h>
using namespace std;
#define ash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define I1(n) cin >> n
#define I2(m, n) cin >> m >> n;
#define I3(m, n, o) cin >> m >> n >> o;
#define sc(n) scanf("%d", &n);
#define scl(n) scanf("%I64d", &n);
#define sc2(m, n) scanf("%d%d", &m, &n);
#define sc2l(m, n) scanf("%I64d%I64d", &m, &n);
#define pf printf
#define f(i, n) for (ll i = 0; i < (n); i++)
#define f1(i, n) for (ll i = 1; i <= (n); i++)
#define ar_input(a, n) f(i, n) cin >> a[i];
#define ve_input(v, n) \
f(i, n) { \
ll m; \
cin >> m, v.pb(m); \
}
#define Max INT_MAX
#define Min INT_MIN
#define pi acos(-1.0)
#define Mem(a, val) memset(a, val, sizeof(a));
#define asort(a, n) sort(a, a + n)
#define vsort(v) sort(v.begin(), v.end())
#define fr(i, s, e) for (ll i = s; i <= e; i++)
#define ff first
#define ss second
#define vec vector<ll>
#define pai pair<ll, ll>
#define Map map<ll, ll>
#define mod 1000000007
#define ll long long
#define PC(i) cout << "Case " << i << ": ";
/// template function///
/// ll GCD(ll a,ll b){if(a<0) a*=-1;if(b<0) b*=-1;if(a<b)swap(a,b);if(b==1)
/// return 1;if(!b) return a;if(!(a%b)) return b;else return GCD(b,a%b);} ll
/// LCM(ll a,ll b){ll x=GCD(a,b);return (a/x)*b;} ll bigmod(ll n,ll p){if(p==0)
/// return 1;if(p==1)return (n+mod)%mod;if(p%2)return
/// (bigmod(n,p-1)*n+mod)%mod;else{ll x=bigmod(n,p/2);return (x*x+mod)%mod;}} ll
/// modinverse(ll n){return bigmod(n,mod-2)%mod;} ll num_coprime(ll n){ll
/// ans=n;for(ll i=2;i*i<=n;
/// i++){if(n%i==0){while(n%i==0)n/=i;ans-=ans/i;}}if(n>1)ans-=ans/n;return ans;}
/// set<ll>s;void divisors(ll
/// n){f1(i,sqrt(n))if(n%i==0){s.insert(i);s.insert(n/i);}} ll mod_inverse(ll
/// a,ll m){ll mm=m,y=0,x=1;while(a>1){ll q=a/m;ll
/// t=m;m=a%m;a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=mm;return x;}
///*********************************************start***********************************************///
int main() {
// freopen("1014.txt","r",stdin);
ash;
int n;
I1(n);
ll a[n + 1], b[n];
f(i, n + 1) { cin >> a[i]; }
f(i, n) cin >> b[i];
int re = 0;
f(i, n) {
if (b[i] > a[i]) {
re += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
re += a[i + 1];
a[i + 1] = 0;
} else {
re += b[i];
a[i + 1] -= b[i];
}
} else {
re += b[i];
}
}
cout << re << endl;
return 0;
}
///**********************************************end*************************************************///
| ///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
/// email:ashrafulhaquetoni@gmail.com///
///*******contact:01640690531*******///
///*********************************///
#include <bits/stdc++.h>
using namespace std;
#define ash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define I1(n) cin >> n
#define I2(m, n) cin >> m >> n;
#define I3(m, n, o) cin >> m >> n >> o;
#define sc(n) scanf("%d", &n);
#define scl(n) scanf("%I64d", &n);
#define sc2(m, n) scanf("%d%d", &m, &n);
#define sc2l(m, n) scanf("%I64d%I64d", &m, &n);
#define pf printf
#define f(i, n) for (ll i = 0; i < (n); i++)
#define f1(i, n) for (ll i = 1; i <= (n); i++)
#define ar_input(a, n) f(i, n) cin >> a[i];
#define ve_input(v, n) \
f(i, n) { \
ll m; \
cin >> m, v.pb(m); \
}
#define Max INT_MAX
#define Min INT_MIN
#define pi acos(-1.0)
#define Mem(a, val) memset(a, val, sizeof(a));
#define asort(a, n) sort(a, a + n)
#define vsort(v) sort(v.begin(), v.end())
#define fr(i, s, e) for (ll i = s; i <= e; i++)
#define ff first
#define ss second
#define vec vector<ll>
#define pai pair<ll, ll>
#define Map map<ll, ll>
#define mod 1000000007
#define ll long long
#define PC(i) cout << "Case " << i << ": ";
/// template function///
/// ll GCD(ll a,ll b){if(a<0) a*=-1;if(b<0) b*=-1;if(a<b)swap(a,b);if(b==1)
/// return 1;if(!b) return a;if(!(a%b)) return b;else return GCD(b,a%b);} ll
/// LCM(ll a,ll b){ll x=GCD(a,b);return (a/x)*b;} ll bigmod(ll n,ll p){if(p==0)
/// return 1;if(p==1)return (n+mod)%mod;if(p%2)return
/// (bigmod(n,p-1)*n+mod)%mod;else{ll x=bigmod(n,p/2);return (x*x+mod)%mod;}} ll
/// modinverse(ll n){return bigmod(n,mod-2)%mod;} ll num_coprime(ll n){ll
/// ans=n;for(ll i=2;i*i<=n;
/// i++){if(n%i==0){while(n%i==0)n/=i;ans-=ans/i;}}if(n>1)ans-=ans/n;return ans;}
/// set<ll>s;void divisors(ll
/// n){f1(i,sqrt(n))if(n%i==0){s.insert(i);s.insert(n/i);}} ll mod_inverse(ll
/// a,ll m){ll mm=m,y=0,x=1;while(a>1){ll q=a/m;ll
/// t=m;m=a%m;a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=mm;return x;}
///*********************************************start***********************************************///
int main() {
// freopen("1014.txt","r",stdin);
ash;
int n;
I1(n);
ll a[n + 1], b[n];
f(i, n + 1) { cin >> a[i]; }
f(i, n) cin >> b[i];
ll re = 0;
f(i, n) {
if (b[i] > a[i]) {
re += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
re += a[i + 1];
a[i + 1] = 0;
} else {
re += b[i];
a[i + 1] -= b[i];
}
} else {
re += b[i];
}
}
// ll re2=0;
// f(i,n)
// {
// if(b[i]>a[i])
// {
// re+=a[i];
// b[i]-=a[i];
//
// if(b[i]>=a[i+1])
// {
// re+=a[i+1];
// a[i+1]=0;
//
// }
// else{
// re+=b[i];
// a[i+1]-=b[i];
// }
// }
// else{
// re+=b[i];
// }
// }
cout << re << endl;
return 0;
}
///**********************************************end*************************************************///
| [
"variable_declaration.type.change"
] | 768,270 | 768,271 | u802094864 | cpp |
p02959 | #include <stdio.h>
int main(void) {
int n;
int a[100002];
int b[100000];
int i;
int c;
c = 0;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
a[n + 2] = 0;
for (i = 0; i < n; i++) {
if (b[i] <= a[i]) {
c += b[i];
} else if (b[i] > a[i]) {
c += a[i];
b[i] -= a[i];
if (b[i] <= a[i + 1]) {
c += b[i];
a[i + 1] -= b[i];
} else {
c += a[i + 1];
a[i + 1] = 0;
}
}
}
printf("%d\n", c);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
int a[100002];
int b[100000];
int i;
double c;
c = 0;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
a[n + 2] = 0;
for (i = 0; i < n; i++) {
if (b[i] <= a[i]) {
c += b[i];
} else if (b[i] > a[i]) {
c += a[i];
b[i] -= a[i];
// 次の町の計算
if (b[i] <= a[i + 1]) {
c += b[i];
a[i + 1] -= b[i];
} else {
c += a[i + 1];
a[i + 1] = 0;
}
}
}
printf("%1.0lf\n", c);
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,272 | 768,273 | u966052848 | cpp |
p02959 | /*Stay true to yourself, yet always be open to learn. Work hard, and never give
up on your dreams, even when nobody else believes they can come true but you.
These are not cliches but real tools you need no matter what you do in life to
stay focused on your path.
*/
/*Pppppppp UU UU CCCCCCCC CCCCCCCC HH HH UU UU
pp pp UU UU CC CC HH HH UU UU
pp pp UU UU CC CC HHHHHHHHH UU UU
pppppppp UU UU CC CC HHHHHHHHH UU UU
pp UU UU CC CC HH HH UU UU
pp UUUUUUUUUU CCCCCCCC CCCCCCCC HH HH UUUUUUUUUU
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int s = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] > b[i]) {
s += b[i];
if (b[i] > a[i])
a[i + 1] = a[i + 1] - b[i] + a[i];
} else {
s += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << s << endl;
return 0;
} | /*Stay true to yourself, yet always be open to learn. Work hard, and never give
up on your dreams, even when nobody else believes they can come true but you.
These are not cliches but real tools you need no matter what you do in life to
stay focused on your path.
*/
/*Pppppppp UU UU CCCCCCCC CCCCCCCC HH HH UU UU
pp pp UU UU CC CC HH HH UU UU
pp pp UU UU CC CC HHHHHHHHH UU UU
pppppppp UU UU CC CC HHHHHHHHH UU UU
pp UU UU CC CC HH HH UU UU
pp UUUUUUUUUU CCCCCCCC CCCCCCCC HH HH UUUUUUUUUU
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long s = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] > b[i]) {
s += b[i];
if (b[i] > a[i])
a[i + 1] = a[i + 1] - b[i] + a[i];
} else {
s += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << s << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,280 | 768,281 | u985702351 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vi as(n + 1);
vi bs(n + 1);
for (int i = 0; i < n + 1; ++i)
cin >> as[i];
for (int i = 0; i < n; ++i)
cin >> bs[i];
bs[n] = 0;
int def = 0;
int carry = 0;
for (int i = 0; i < n + 1; ++i) {
int last = min(carry, as[i]);
def += last;
int here = min(as[i] - last, bs[i]);
def += here;
carry = bs[i] - here;
}
cout << def << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int ll
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vi as(n + 1);
vi bs(n + 1);
for (int i = 0; i < n + 1; ++i)
cin >> as[i];
for (int i = 0; i < n; ++i)
cin >> bs[i];
bs[n] = 0;
int def = 0;
int carry = 0;
for (int i = 0; i < n + 1; ++i) {
int last = min(carry, as[i]);
def += last;
int here = min(as[i] - last, bs[i]);
def += here;
carry = bs[i] - here;
}
cout << def << "\n";
}
| [
"variable_declaration.type.primitive.change"
] | 768,288 | 768,289 | u839511400 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N, i, sum;
sum = 0;
cin >> N;
int A[N + 1];
int B[N];
for (i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
cin >> B[i];
}
for (i = 0; i < N; i++) {
if (B[i] <= A[i]) {
sum = sum + B[i];
} else {
sum = sum + A[i];
B[i] = B[i] - A[i];
if (B[i] <= A[i + 1]) {
A[i + 1] = A[i + 1] - B[i];
sum = sum + B[i];
} else {
sum = sum + A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
int main() {
int N, i;
long sum;
sum = 0;
cin >> N;
int A[N + 1];
int B[N];
for (i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
cin >> B[i];
}
for (i = 0; i < N; i++) {
if (B[i] <= A[i]) {
sum = sum + B[i];
} else {
sum = sum + A[i];
B[i] = B[i] - A[i];
if (B[i] <= A[i + 1]) {
A[i + 1] = A[i + 1] - B[i];
sum = sum + B[i];
} else {
sum = sum + A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"variable_declaration.type.widen.change"
] | 768,292 | 768,293 | u499729664 | cpp |
p02959 | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// container util
//------------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define PRINT(V) \
for (auto v : (V)) \
cout << v << " "
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// math
//------------------------------------------
int QP(int a, int b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % MOD;
a = 1ll * a * a % MOD;
} while (b >>= 1);
return ans;
}
int QP(int a, int b, int MOD) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % MOD;
a = 1ll * a * a % MOD;
} while (b >>= 1);
return ans;
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
// debug
//------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
//動的計画法で役に立つ関数
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;
}
//最大公約数と最小公倍数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
vector<vector<long long>> comb(int n) {
vector<vector<long long>> v(n + 1, vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k < j; k++) {
v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]);
}
}
return v;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
VI A(N + 1), B(N);
REP(i, N + 1) { cin >> A[i]; }
REP(i, N) { cin >> B[i]; }
// 1人ずつ見ていく
int ans = 0;
REP(i, N) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// container util
//------------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define PRINT(V) \
for (auto v : (V)) \
cout << v << " "
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// math
//------------------------------------------
int QP(int a, int b) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % MOD;
a = 1ll * a * a % MOD;
} while (b >>= 1);
return ans;
}
int QP(int a, int b, int MOD) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % MOD;
a = 1ll * a * a % MOD;
} while (b >>= 1);
return ans;
}
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
// debug
//------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
//動的計画法で役に立つ関数
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;
}
//最大公約数と最小公倍数
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
vector<vector<long long>> comb(int n) {
vector<vector<long long>> v(n + 1, vector<long long>(n + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int j = 1; j < v.size(); j++) {
for (int k = 1; k < j; k++) {
v[j][k] = (v[j - 1][k - 1] + v[j - 1][k]);
}
}
return v;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
VI A(N + 1), B(N);
REP(i, N + 1) { cin >> A[i]; }
REP(i, N) { cin >> B[i]; }
// 1人ずつ見ていく
ll ans = 0;
REP(i, N) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,298 | 768,299 | u850266651 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
#define ll long long
const int maxn = 200000 + 5;
int a[maxn];
int b[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
// system("pause");
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
#define ll long long
const int maxn = 100000 + 5;
ll a[maxn];
ll b[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
// system("pause");
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 768,300 | 768,301 | u205361627 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int cnt = 0;
for (int i = 0; i < n; i++) {
int mons = 0;
if (a.at(i) >= b.at(i))
mons = b.at(i);
else {
if (a.at(i) + a.at(i + 1) >= b.at(i)) {
mons = b.at(i);
a.at(i + 1) = a.at(i) + a.at(i + 1) - b.at(i);
} else {
mons = a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
}
}
cnt += mons;
}
cout << cnt << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t cnt = 0;
for (int i = 0; i < n; i++) {
int mons = 0;
if (a.at(i) >= b.at(i))
mons = b.at(i);
else {
if (a.at(i) + a.at(i + 1) >= b.at(i)) {
mons = b.at(i);
a.at(i + 1) = a.at(i) + a.at(i + 1) - b.at(i);
} else {
mons = a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
}
}
cnt += mons;
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,302 | 768,303 | u581832318 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int p = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
p += b[i];
continue;
} else {
p += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
p += b[i];
a[i + 1] -= b[i];
} else {
p += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << p;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long p = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
p += b[i];
continue;
} else {
p += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
p += b[i];
a[i + 1] -= b[i];
} else {
p += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << p;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,304 | 768,305 | u675509234 | cpp |
p02959 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// typedef
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// conversion
inline LL toLong(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// 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 SZ(a) LL((a).size())
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define UNTIL(p) while (!(p))
// constant
const double EPS = 1e-5;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PUTS(x) cout << (x) << endl;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
LL n;
cin >> n;
VL a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
LL ans = 0;
REP(i, n) {
LL x = min(a[i], b[i]);
ans += x;
b[i] -= x;
a[i] -= x;
if (b[i] > 0) {
LL y = min(a[i + 1], b[i]);
b[i] -= y;
a[i] -= y;
ans += y;
}
}
PUTS(ans);
} | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// typedef
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// conversion
inline LL toLong(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// 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 SZ(a) LL((a).size())
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define UNTIL(p) while (!(p))
// constant
const double EPS = 1e-5;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PUTS(x) cout << (x) << endl;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
LL n;
cin >> n;
VL a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
LL ans = 0;
REP(i, n) {
LL x = min(a[i], b[i]);
ans += x;
b[i] -= x;
a[i] -= x;
if (b[i] > 0) {
LL y = min(a[i + 1], b[i]);
b[i] -= y;
a[i + 1] -= y;
ans += y;
}
}
PUTS(ans);
} | [
"assignment.change"
] | 768,306 | 768,307 | u752498851 | cpp |
p02959 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// typedef
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// conversion
inline LL toLong(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// 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 SZ(a) LL((a).size())
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define UNTIL(p) while (!(p))
// constant
const double EPS = 1e-5;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PUTS(x) cout << (x) << endl;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
LL n;
cin >> n;
VL a(n), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
LL ans = 0;
REP(i, n) {
LL x = min(a[i], b[i]);
ans += x;
b[i] -= x;
a[i] -= x;
if (b[i] > 0) {
LL y = min(a[i + 1], b[i]);
b[i] -= y;
a[i] -= y;
ans += y;
}
}
PUTS(ans);
} | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// typedef
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<LL, LL> PLL;
// conversion
inline LL toLong(string s) {
LL v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// 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 SZ(a) LL((a).size())
#define EACH(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define UNTIL(p) while (!(p))
// constant
const double EPS = 1e-5;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define PUTS(x) cout << (x) << endl;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
LL n;
cin >> n;
VL a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
LL ans = 0;
REP(i, n) {
LL x = min(a[i], b[i]);
ans += x;
b[i] -= x;
a[i] -= x;
if (b[i] > 0) {
LL y = min(a[i + 1], b[i]);
b[i] -= y;
a[i + 1] -= y;
ans += y;
}
}
PUTS(ans);
} | [
"assignment.change"
] | 768,308 | 768,307 | u752498851 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n];
int c[n + 1];
for (i = 0; i < n + 1; i++) {
cin >> a[i];
c[i] = a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (i = 0; i < n; i++) {
int tmp = a[i];
a[i] = max(0, a[i] - b[i]);
if (a[i] == 0) {
a[i + 1] = max(0, a[i + 1] - (b[i] - tmp));
}
// cout<<a[i]<<" "<<a[i+1]<<endl;
}
for (i = 0; i < n + 1; i++) {
ans += c[i] - a[i];
// cout<<a[i]<<endl;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ll long long
int main() {
int n, i, j;
cin >> n;
int a[n + 1];
int b[n];
int c[n + 1];
for (i = 0; i < n + 1; i++) {
cin >> a[i];
c[i] = a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (i = 0; i < n; i++) {
int tmp = a[i];
a[i] = max(0, a[i] - b[i]);
if (a[i] == 0) {
a[i + 1] = max(0, a[i + 1] - (b[i] - tmp));
}
// cout<<a[i]<<" "<<a[i+1]<<endl;
}
for (i = 0; i < n + 1; i++) {
ans += c[i] - a[i];
// cout<<a[i]<<endl;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 768,309 | 768,310 | u127768253 | cpp |
p02959 | #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
for (int i = 0; i < n + 1; i++) {
int x;
cin >> x;
A[i] = x;
}
// cout<<A[2]<<endl;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
B[i] = x;
}
int Count1 = 0;
for (int i = 0; i < n; i++) {
if (B[i] > A[i]) {
Count1 += A[i];
// cout<<"ここまで普通"<<A[i]<<endl;
B[i] = B[i] - A[i];
A[i] = 0;
if (A[i + 1] < B[i]) {
Count1 += A[i + 1];
// cout<<"最強"<<A[i+1]<<endl;
A[i + 1] = 0;
} else {
A[i + 1] = A[i + 1] - B[i];
Count1 += B[i];
// cout<<"普通"<<B[i]<<endl;
}
} else {
Count1 += B[i];
// cout<<"役立たず"<<endl;
}
}
cout << Count1 << endl;
}
| #include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
for (int i = 0; i < n + 1; i++) {
int x;
cin >> x;
A[i] = x;
}
// cout<<A[2]<<endl;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
B[i] = x;
}
long long Count1 = 0;
for (int i = 0; i < n; i++) {
if (B[i] > A[i]) {
Count1 += A[i];
// cout<<"ここまで普通"<<A[i]<<endl;
B[i] = B[i] - A[i];
A[i] = 0;
if (A[i + 1] < B[i]) {
Count1 += A[i + 1];
// cout<<"最強"<<A[i+1]<<endl;
A[i + 1] = 0;
} else {
A[i + 1] = A[i + 1] - B[i];
Count1 += B[i];
// cout<<"普通"<<B[i]<<endl;
}
} else {
Count1 += B[i];
// cout<<"役立たず"<<endl;
}
}
cout << Count1 << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,311 | 768,312 | u759162415 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll const INF = 1000000000000000000;
int const I_MAX = 2147483647;
ll const MOD = 1e9 + 7;
int const POW_MAX = 1e5;
int const N_MAX = 1e5;
// nCr
ll po[POW_MAX + 2];
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return mod_pow(x, MOD - 2) % MOD; }
ll comb(int n, int r) {
if (!po[n]) {
po[0] = 1;
FOR(i, 1, n + 1) po[i] = po[i - 1] * i % MOD;
}
return (((po[n] * mod_inv(po[r])) % MOD) * mod_inv(po[n - r])) % MOD;
}
// greatest common divisor
ll gcd(ll a, ll b) {
while (a % b != 0) {
ll tmp = a;
a = b;
b = tmp % b;
}
return b;
}
// least common multiple
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int N;
ll A[N_MAX + 2], B[N_MAX + 1];
int main() {
scanf("%d", &N);
rep(i, N + 1) scanf("%lld", &A[i]);
rep(i, N) scanf("%lld", &B[i]);
ll sum = 0;
ll more = 0;
rep(i, N + 1) {
ll a = A[i];
ll k = B[i];
if (more > a) {
more = k;
sum += a;
} else {
sum += more;
a -= more;
}
if (k >= a) {
sum += a;
more = k - a;
} else {
sum += k;
more = 0;
}
}
printf("%lld\n", sum);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
ll const INF = 1000000000000000000;
int const I_MAX = 2147483647;
ll const MOD = 1e9 + 7;
int const POW_MAX = 1e5;
int const N_MAX = 1e5;
// nCr
ll po[POW_MAX + 2];
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
ll mod_inv(ll x) { return mod_pow(x, MOD - 2) % MOD; }
ll comb(int n, int r) {
if (!po[n]) {
po[0] = 1;
FOR(i, 1, n + 1) po[i] = po[i - 1] * i % MOD;
}
return (((po[n] * mod_inv(po[r])) % MOD) * mod_inv(po[n - r])) % MOD;
}
// greatest common divisor
ll gcd(ll a, ll b) {
while (a % b != 0) {
ll tmp = a;
a = b;
b = tmp % b;
}
return b;
}
// least common multiple
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int N;
ll A[N_MAX + 2], B[N_MAX + 1];
int main() {
scanf("%d", &N);
rep(i, N + 1) scanf("%lld", &A[i]);
rep(i, N) scanf("%lld", &B[i]);
ll sum = 0;
ll more = 0;
rep(i, N + 1) {
ll a = A[i];
ll k = B[i];
if (more > a) {
more = k;
sum += a;
continue;
} else {
sum += more;
a -= more;
}
if (k > a) {
sum += a;
more = k - a;
} else {
sum += k;
more = 0;
}
}
printf("%lld\n", sum);
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,313 | 768,314 | u823451365 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if ((A[i] + A[i + 1]) <= B[i]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
}
if (A[i] <= B[i] && (A[i] + A[i + 1]) > B[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
}
if (B[i] < A[i]) {
ans += B[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long int ans = 0;
cin >> N;
vector<long long int> A(N + 1), B(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if ((A[i] + A[i + 1]) <= B[i]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
}
if (A[i] <= B[i] && (A[i] + A[i + 1]) > B[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
}
if (B[i] < A[i]) {
ans += B[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 768,315 | 768,316 | u926416331 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const ll INFLL = 1001001001001001001; // > 10^18
const int MOD = (int)1e9 + 7;
const ll MODLL = (ll)1e9 + 7;
const double EPS = 1e-9;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
REP(i, n + 1) cin >> a[i];
vector<ll> b(n);
REP(i, n) cin >> b[i];
ll res = 0;
vector<ll> ac = a;
vector<ll> bc = b;
for (ll i = 0; i < n; i++) {
ll res1 = min(ac[i], bc[i]);
res += res1;
bc[i] -= res1;
ll res2 = min(ac[i + 1], bc[i]);
res += res2;
ac[i + 1] -= res2;
}
ll resr = 0;
for (ll i = n - 1; i >= 0; i--) {
ll res1 = min(a[i + 1], b[i]);
resr += res1;
b[i] -= res1;
ll res2 = min(a[i], b[i]);
resr += res2;
ac[i] -= res2;
}
cout << max(res, resr) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const ll INFLL = 1001001001001001001; // > 10^18
const int MOD = (int)1e9 + 7;
const ll MODLL = (ll)1e9 + 7;
const double EPS = 1e-9;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
REP(i, n + 1) cin >> a[i];
vector<ll> b(n);
REP(i, n) cin >> b[i];
ll res = 0;
vector<ll> ac = a;
vector<ll> bc = b;
for (ll i = 0; i < n; i++) {
ll res1 = min(ac[i], bc[i]);
res += res1;
bc[i] -= res1;
ll res2 = min(ac[i + 1], bc[i]);
res += res2;
ac[i + 1] -= res2;
}
ll resr = 0;
for (ll i = n - 1; i >= 0; i--) {
ll res1 = min(a[i + 1], b[i]);
resr += res1;
b[i] -= res1;
ll res2 = min(a[i], b[i]);
resr += res2;
a[i] -= res2;
}
cout << max(res, resr) << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 768,325 | 768,326 | u656679572 | cpp |
p02959 | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define vll vector<ll>
vll a;
vll b;
ll n;
int main() {
IOS
#ifdef SHAN
freopen("input.txt", "r", stdin);
#endif
cin >> n;
a.resize(n + 1);
b.resize(n);
for (ll i = 0; i <= n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (ll i = 0; i < n; i++) {
ll tt = min(a[i], b[i]);
ans += tt;
b[i] -= tt;
a[i] -= tt;
tt = min(a[i + 1], b[i]);
ans += tt;
b[i] -= tt;
a[i] -= tt;
}
cout << ans << endl;
return 0;
} // good night. | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define vll vector<ll>
vll a;
vll b;
ll n;
int main() {
IOS
#ifdef SHAN
freopen("input.txt", "r", stdin);
#endif
cin >> n;
a.resize(n + 1);
b.resize(n);
for (ll i = 0; i <= n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (ll i = 0; i < n; i++) {
ll tt = min(a[i], b[i]);
ans += tt;
b[i] -= tt;
a[i] -= tt;
tt = min(a[i + 1], b[i]);
ans += tt;
b[i] -= tt;
a[i + 1] -= tt;
}
cout << ans << endl;
return 0;
} // good night. | [
"assignment.change"
] | 768,329 | 768,330 | u032226420 | cpp |
p02959 | #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
long long int A[100005];
long long int B[100005];
int main(void) {
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int M = A[0];
int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= M) {
ans = ans + M;
B[i] = B[i] - M;
} else {
ans = ans + B[i];
B[i] = 0;
}
if (B[i] >= A[i + 1]) {
ans = ans + A[i + 1];
M = 0;
} else {
ans = ans + B[i];
M = A[i + 1] - B[i];
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>/*toupperとかが入っている*/
#include <cmath>
#include <iostream>
#include <string>
#include <vector>/*可変長配列vectorのインクルード*/
const int MOD =
1000000007; /* 1,000,000,007 で割った余りを出力する のとき使う*/
using namespace std; /*標準名前空間を利用する。cinやcoutはこれによって利用可能になる*/
int N;
long long int A[100005];
long long int B[100005];
int main(void) {
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int M = A[0];
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= M) {
ans = ans + M;
B[i] = B[i] - M;
} else {
ans = ans + B[i];
B[i] = 0;
}
if (B[i] >= A[i + 1]) {
ans = ans + A[i + 1];
M = 0;
} else {
ans = ans + B[i];
M = A[i + 1] - B[i];
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 768,331 | 768,332 | u607444339 | cpp |
p02959 | #include <algorithm>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int n;
vector<ll> a, b;
ll ret = 0;
ll min(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
int main(void) {
cin >> n;
for (int i = 0; i <= n; i++) {
int ai;
cin >> ai;
a.push_back(ai);
}
for (int i = 0; i < n; i++) {
ll bi;
cin >> bi;
ll tmp = min(a[i], bi);
ret += tmp;
bi -= tmp;
tmp = min(a[i + 1], bi);
ret += tmp;
a[i] -= tmp;
}
cout << ret << endl;
return 0;
} | #include <algorithm>
#include <ctype.h>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
int n;
vector<ll> a, b;
ll ret = 0;
ll min(ll a, ll b) {
if (a >= b)
return b;
else
return a;
}
int main(void) {
cin >> n;
for (int i = 0; i <= n; i++) {
int ai;
cin >> ai;
a.push_back(ai);
}
for (int i = 0; i < n; i++) {
ll bi;
cin >> bi;
ll tmp = min(a[i], bi);
ret += tmp;
bi -= tmp;
tmp = min(a[i + 1], bi);
ret += tmp;
a[i + 1] -= tmp;
}
cout << ret << endl;
return 0;
} | [
"assignment.change"
] | 768,333 | 768,334 | u728082661 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#if defined(_MSC_VER)
#pragma warning(disable : 4996) // VSでscanfを使う．
#endif
signed main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int p = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int t = min(a[i], p);
a[i] -= t;
int x = a[i];
int u = min(x, b[i]);
p = max(0, b[i] - x);
ans += t + u;
}
ans += min(p, a[n]);
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cinttypes>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#if defined(_MSC_VER)
#pragma warning(disable : 4996) // VSでscanfを使う．
#endif
signed main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int p = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
int t = min(a[i], p);
a[i] -= t;
int x = a[i];
int u = min(x, b[i]);
p = max(0ll, b[i] - x);
ans += t + u;
}
ans += min(p, a[n]);
cout << ans << endl;
return 0;
}
| [
"call.arguments.change"
] | 768,335 | 768,336 | u345432788 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
typedef std::pair<int, int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define MAX(X, Y) (*max_element(X, Y))
#define MIN(X, Y) (*min_element(X, Y))
#define NP(X, Y) next_permutation(X, Y)
#define setp(X, Y) cout << fixed << setprecision(Y) << X;
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int N;
int A[100010];
int B[100010];
P p[100010];
signed main() {
cin >> N;
REP(i, N + 1) { cin >> A[i]; }
REP(i, N) { cin >> B[i]; }
int ans = 0;
REP(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
ans += B[i];
}
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
ans += B[i];
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
typedef std::pair<int, int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define MAX(X, Y) (*max_element(X, Y))
#define MIN(X, Y) (*min_element(X, Y))
#define NP(X, Y) next_permutation(X, Y)
#define setp(X, Y) cout << fixed << setprecision(Y) << X;
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int N;
int A[100010];
int B[100010];
P p[100010];
signed main() {
cin >> N;
REP(i, N + 1) { cin >> A[i]; }
REP(i, N) { cin >> B[i]; }
int ans = 0;
REP(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
ans += B[i];
continue;
}
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
ans += B[i];
}
}
cout << ans << endl;
return 0;
}
| [] | 768,337 | 768,338 | u848736574 | cpp |
p02959 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
struct MyStruct {
int a, b;
};
bool comp(const MyStruct &s, const MyStruct &t) {
if (s.b != t.b)
return s.b < t.b; // syoujunn
return s.a > t.a;
}
int main() {
int n;
cin >> n;
VI a(n + 1);
REP(i, n + 1) { cin >> a[i]; }
VI b(n);
REP(i, n) { cin >> b[i]; }
int ans = 0;
REP(i, n) {
int defeated = min(b[i], a[i]);
a[i] -= defeated;
b[i] -= defeated;
ans += defeated;
if (b[i] > 0) {
int d = min(b[i], a[i + 1]);
a[i + 1] -= d;
ans += d;
}
}
ANS(ans);
return 0;
}
| // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
struct MyStruct {
int a, b;
};
bool comp(const MyStruct &s, const MyStruct &t) {
if (s.b != t.b)
return s.b < t.b; // syoujunn
return s.a > t.a;
}
int main() {
int n;
cin >> n;
VI a(n + 1);
REP(i, n + 1) { cin >> a[i]; }
VI b(n);
REP(i, n) { cin >> b[i]; }
long long ans = 0;
REP(i, n) {
int defeated = min(b[i], a[i]);
a[i] -= defeated;
b[i] -= defeated;
ans += defeated;
if (b[i] > 0) {
int d = min(b[i], a[i + 1]);
a[i + 1] -= d;
ans += d;
}
}
ANS(ans);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,339 | 768,340 | u922018373 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a[10005], b[10005], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; cin >> a[i++])
;
for (int i = 1; i <= n; cin >> b[i++])
;
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += min(b[i], a[i] + a[i + 1]);
a[i + 1] = max(a[0], a[i + 1] - b[i] + a[i]);
} else
ans += b[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a[100005], b[100005], ans = 0;
signed main() {
cin >> n;
for (int i = 1; i <= n + 1; cin >> a[i++])
;
for (int i = 1; i <= n; cin >> b[i++])
;
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += min(b[i], a[i] + a[i + 1]);
a[i + 1] = max(a[0], a[i + 1] - b[i] + a[i]);
} else
ans += b[i];
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,351 | 768,352 | u723494462 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vi a(n + 1);
vi b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
int ans = 0;
REP(i, n) {
if (a[i] < b[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (a[i + 1] < b[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define pii pair<int, int>
#define INF (int)1e9
#define MOD (int)1e9 + 7
typedef long long llong;
using namespace std;
int main() {
int n;
cin >> n;
vi a(n + 1);
vi b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
llong ans = 0;
REP(i, n) {
if (a[i] < b[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (a[i + 1] < b[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 768,356 | 768,357 | u209767598 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ll long long
#define re register
using namespace std;
struct ios {
inline char fchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
// #define getchar fchar
template <typename ty> inline ios &operator>>(ty &x) {
register int f = 1;
x = 0;
register char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f = -1;
for (; c >= '0' && c <= '9'; c = getchar())
x = (x << 1) + (x << 3) + (c ^ 48);
x *= f;
return *this;
}
template <typename ty> inline ios &operator<<(ty x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
*this << x / 10;
putchar(x % 10 + 48);
return *this;
}
inline ios &operator<<(char x) {
putchar(x);
return *this;
}
} io;
const int N = 1e5 + 5;
int n;
ll a[N], b[N];
int main() {
io >> n;
for (int i = 1; i <= n + 1; i++)
io >> a[i];
for (int i = 1; i <= n; i++)
io >> b[i];
int ans = 0;
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
io << ans;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ll long long
#define re register
using namespace std;
struct ios {
inline char fchar() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
// #define getchar fchar
template <typename ty> inline ios &operator>>(ty &x) {
register int f = 1;
x = 0;
register char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-')
f = -1;
for (; c >= '0' && c <= '9'; c = getchar())
x = (x << 1) + (x << 3) + (c ^ 48);
x *= f;
return *this;
}
template <typename ty> inline ios &operator<<(ty x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
*this << x / 10;
putchar(x % 10 + 48);
return *this;
}
inline ios &operator<<(char x) {
putchar(x);
return *this;
}
} io;
const int N = 1e5 + 5;
int n;
ll a[N], b[N];
int main() {
io >> n;
for (int i = 1; i <= n + 1; i++)
io >> a[i];
for (int i = 1; i <= n; i++)
io >> b[i];
ll ans = 0;
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
io << ans;
return 0;
} | [
"variable_declaration.type.change"
] | 768,360 | 768,361 | u100442348 | cpp |
p02959 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
LL read() {
LL k = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
k = k * 10 + c - 48, c = getchar();
return k * f;
}
int a[100010], b[100010], c[100010];
int main() {
int n = read();
for (int i = 1; i <= n + 1; ++i)
a[i] = read();
for (int i = 1; i <= n; ++i)
b[i] = read();
int tot = 0;
for (int i = 1; i <= n + 1; ++i) {
if (a[i] <= b[i] + b[i - 1]) {
tot += a[i];
b[i] -= max(a[i] - b[i - 1], 0);
} else {
tot += b[i] + b[i - 1];
b[i] = b[i - 1] = 0;
}
}
cout << tot << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
LL read() {
LL k = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
k = k * 10 + c - 48, c = getchar();
return k * f;
}
LL a[100010], b[100010], c[100010];
int main() {
int n = read();
for (int i = 1; i <= n + 1; ++i)
a[i] = read();
for (int i = 1; i <= n; ++i)
b[i] = read();
LL tot = 0;
for (int i = 1; i <= n + 1; ++i) {
if (a[i] <= b[i] + b[i - 1]) {
tot += a[i];
b[i] -= max(a[i] - b[i - 1], 0ll);
} else {
tot += b[i] + b[i - 1];
b[i] = b[i - 1] = 0;
}
}
cout << tot << endl;
return 0;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 768,362 | 768,363 | u753702868 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
long long town[maxn], hero[maxn];
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n + 1; i++) {
scanf("%lld", &town[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
for (int i = 0; i < n; i++) {
for (int j = i; j <= i + 1; j++) {
int num = min(hero[i], town[j]);
sum += num;
town[j] -= num;
hero[i] -= num;
}
// printf("%d ",sum);
}
printf("%lld", sum);
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
long long town[maxn], hero[maxn];
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 0; i < n + 1; i++) {
scanf("%lld", &town[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
for (int i = 0; i < n; i++) {
for (int j = i; j <= i + 1; j++) {
int num = min(hero[i], town[j]);
sum += num;
town[j] -= num;
hero[i] -= num;
}
// printf("%d ",sum);
}
printf("%lld", sum);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 768,376 | 768,377 | u333991119 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
long long int n, s1 = 0;
cin >> n;
long long int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a[i + 1]) {
b[i] -= a[i + 1];
a[i + 1] = 0;
if (b[i] >= a[i]) {
b[i] -= a[i];
a[i] = 0;
} else {
a[i] -= b[i];
b[i] = 0;
}
} else {
a[i + 1] -= b[i];
b[i] = 0;
}
if (a[1] <= b[1]) {
b[1] -= a[1];
a[1] = 0;
} else {
a[1] -= b[1];
b[1] = 0;
}
int s = 0;
for (int i = 1; i <= n + 1; i++)
s += a[i];
cout << s1 - s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
long long int n, s1 = 0;
cin >> n;
long long int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a[i + 1]) {
b[i] -= a[i + 1];
a[i + 1] = 0;
if (b[i] >= a[i]) {
b[i] -= a[i];
a[i] = 0;
} else {
a[i] -= b[i];
b[i] = 0;
}
} else {
a[i + 1] -= b[i];
b[i] = 0;
}
if (a[1] <= b[1]) {
b[1] -= a[1];
a[1] = 0;
} else {
a[1] -= b[1];
b[1] = 0;
}
long long int s = 0;
for (int i = 1; i <= n + 1; i++)
s += a[i];
cout << s1 - s;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,381 | 768,382 | u249899624 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
int n, s1 = 0;
cin >> n;
int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a[i + 1]) {
b[i] -= a[i + 1];
a[i + 1] = 0;
if (b[i] >= a[i]) {
b[i] -= a[i];
a[i] = 0;
} else {
a[i] -= b[i];
b[i] = 0;
}
} else {
a[i + 1] -= b[i];
b[i] = 0;
}
if (a[1] <= b[1]) {
b[1] -= a[1];
a[1] = 0;
} else {
a[1] -= b[1];
b[1] = 0;
}
int s = 0;
for (int i = 1; i <= n + 1; i++)
s += a[i];
cout << s1 - s;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int counti = 0;
int main() {
long long int n, s1 = 0;
cin >> n;
long long int a[n + 5], b[n + 5];
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
s1 += a[i];
}
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--)
if (b[i] >= a[i + 1]) {
b[i] -= a[i + 1];
a[i + 1] = 0;
if (b[i] >= a[i]) {
b[i] -= a[i];
a[i] = 0;
} else {
a[i] -= b[i];
b[i] = 0;
}
} else {
a[i + 1] -= b[i];
b[i] = 0;
}
if (a[1] <= b[1]) {
b[1] -= a[1];
a[1] = 0;
} else {
a[1] -= b[1];
b[1] = 0;
}
long long int s = 0;
for (int i = 1; i <= n + 1; i++)
s += a[i];
cout << s1 - s;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,383 | 768,382 | u249899624 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using pint = pair<int, int>;
#define repi(n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repv(itr) for (auto &&v : itr)
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
template <typename T> T minptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i < *re)
re = i;
}
return re;
}
template <typename T> T maxptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i > *re)
re = i;
}
return re;
}
int __vmax(int x) { return INT_MAX; }
double __vmax(double x) { return 1e+300; }
ll __vmax(ll x) { return LLONG_MAX; }
int __vmin(int x) { return INT_MIN; }
double __vmin(double x) { return -1e+300; }
ll __vmin(ll x) { return LLONG_MIN; }
template <typename T>
vector<T> lis(T begin, T end, bool allowequal = false, bool lds = false) {
using V = typename iterator_traits<T>::value_type;
int n = end - begin;
vector<V> a(n, lds ? __vmin(*begin) : __vmax(*begin));
vector<int> id(n);
if (lds && allowequal) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(lower_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (lds) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(upper_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (allowequal) {
for (int i = 0; i < n; i++) {
id[i] = upper_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
} else {
for (int i = 0; i < n; i++) {
id[i] = lower_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
}
int m = *maxptr(id.begin(), id.end());
vector<T> re(m + 1);
for (int i = n - 1; i >= 0; i--) {
if (id[i] == m)
re[m--] = begin + i;
}
return re;
}
// class segtree {
// private:
// int n;
// bool maxmode;
// vint* data;
// void update(int i) {
// (*data)[i] = maxmode ? max((*data)[i * 2 + 1], (*data)[i * 2 + 2])
// : min((*data)[i * 2 + 1], (*data)[i * 2 + 2]);
// if (i) update((i - 1) / 2);
// }
// public:
// segtree(int n_, bool maxmode_ = false) {
// n = pow(2, ceil(log2(n_)));
// cout << n << endl;
// maxmode = maxmode_;
// data = new vint(n * 2 - 1, maxmode ? INT_MIN : INT_MAX);
// }
// ~segtree() { delete data; }
// void set(int i, int v) {
// (*data)[n - 1 + i] = v;
// if (n) update((n + i - 2) / 2);
// }
// int calc(int a, int b) {
// // TODO
// return 0;
// }
// };
int a[100001], b[100000];
int main() {
int n;
cin >> n;
repi(n + 1) cin >> a[i];
repi(n) cin >> b[i];
int re = 0;
repi(n) {
int x = min(a[i], b[i]);
re += x;
a[i] -= x;
b[i] -= x;
x = min(a[i + 1], b[i]);
re += x;
a[i + 1] -= x;
b[i] -= x;
}
cout << re << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using pint = pair<int, int>;
#define repi(n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define repv(itr) for (auto &&v : itr)
const int dx[] = {-1, 0, 0, 1, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
template <typename T> T minptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i < *re)
re = i;
}
return re;
}
template <typename T> T maxptr(T begin, T end) {
T re = begin;
for (T i = begin + 1; i != end; i++) {
if (*i > *re)
re = i;
}
return re;
}
int __vmax(int x) { return INT_MAX; }
double __vmax(double x) { return 1e+300; }
ll __vmax(ll x) { return LLONG_MAX; }
int __vmin(int x) { return INT_MIN; }
double __vmin(double x) { return -1e+300; }
ll __vmin(ll x) { return LLONG_MIN; }
template <typename T>
vector<T> lis(T begin, T end, bool allowequal = false, bool lds = false) {
using V = typename iterator_traits<T>::value_type;
int n = end - begin;
vector<V> a(n, lds ? __vmin(*begin) : __vmax(*begin));
vector<int> id(n);
if (lds && allowequal) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(lower_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (lds) {
for (int i = 0; i < n; i++) {
id[i] = n - 1 -
(upper_bound(a.rbegin(), a.rend(), begin[i]) - 1 - a.rbegin());
a[id[i]] = begin[i];
}
} else if (allowequal) {
for (int i = 0; i < n; i++) {
id[i] = upper_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
} else {
for (int i = 0; i < n; i++) {
id[i] = lower_bound(a.begin(), a.end(), begin[i]) - a.begin();
a[id[i]] = begin[i];
}
}
int m = *maxptr(id.begin(), id.end());
vector<T> re(m + 1);
for (int i = n - 1; i >= 0; i--) {
if (id[i] == m)
re[m--] = begin + i;
}
return re;
}
// class segtree {
// private:
// int n;
// bool maxmode;
// vint* data;
// void update(int i) {
// (*data)[i] = maxmode ? max((*data)[i * 2 + 1], (*data)[i * 2 + 2])
// : min((*data)[i * 2 + 1], (*data)[i * 2 + 2]);
// if (i) update((i - 1) / 2);
// }
// public:
// segtree(int n_, bool maxmode_ = false) {
// n = pow(2, ceil(log2(n_)));
// cout << n << endl;
// maxmode = maxmode_;
// data = new vint(n * 2 - 1, maxmode ? INT_MIN : INT_MAX);
// }
// ~segtree() { delete data; }
// void set(int i, int v) {
// (*data)[n - 1 + i] = v;
// if (n) update((n + i - 2) / 2);
// }
// int calc(int a, int b) {
// // TODO
// return 0;
// }
// };
ll a[100001], b[100000];
int main() {
int n;
cin >> n;
repi(n + 1) cin >> a[i];
repi(n) cin >> b[i];
ll re = 0;
repi(n) {
ll x = min(a[i], b[i]);
re += x;
a[i] -= x;
b[i] -= x;
x = min(a[i + 1], b[i]);
re += x;
a[i + 1] -= x;
b[i] -= x;
}
cout << re << endl;
}
| [
"variable_declaration.type.change"
] | 768,387 | 768,388 | u600091079 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 100005;
int main() {
int n, a[N], b[N], ans;
scanf("%d", &n);
for (int i = 0; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = 0; i < n; ++i)
scanf("%d", &b[i]);
ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] > b[i]) {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
}
if (a[i + 1] > b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int N = 100005;
int main() {
int n, a[N], b[N];
long long ans;
scanf("%d", &n);
for (int i = 0; i <= n; ++i)
scanf("%d", &a[i]);
for (int i = 0; i < n; ++i)
scanf("%d", &b[i]);
ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] > b[i]) {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
}
if (a[i + 1] > b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,395 | 768,396 | u812942729 | cpp |
p02959 | #include <iostream>
using namespace std;
int a[100009], b[100009];
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int k, cnt = 0;
int i = 0, j = n - 1;
while (i < j) {
k = min(b[i], a[i]);
a[i] -= k;
b[i] -= k;
cnt += k;
k = min(b[i], a[i + 1]);
b[i] -= k;
a[i + 1] -= k;
cnt += k;
k = min(b[j], a[j + 1]);
b[j] -= k;
a[j + 1] -= k;
cnt += k;
k = min(b[j], a[j]);
a[j] -= k;
b[j] -= k;
cnt += k;
i++, j--;
}
if (i == j) {
cnt += min(a[i] + a[i + 1], b[i]);
}
cout << cnt << endl;
}
| #include <iostream>
using namespace std;
int a[100009], b[100009];
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long k, cnt = 0;
int i = 0, j = n - 1;
while (i < j) {
k = min(b[i], a[i]);
a[i] -= k;
b[i] -= k;
cnt += k;
k = min(b[i], a[i + 1]);
b[i] -= k;
a[i + 1] -= k;
cnt += k;
k = min(b[j], a[j + 1]);
b[j] -= k;
a[j + 1] -= k;
cnt += k;
k = min(b[j], a[j]);
a[j] -= k;
b[j] -= k;
cnt += k;
i++, j--;
}
if (i == j) {
cnt += min(a[i] + a[i + 1], b[i]);
}
cout << cnt << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,399 | 768,400 | u290423616 | cpp |
p02959 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
const int maxn = 100005;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i])
ans += b[i];
else {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
cout << ans << endl;
;
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int a[maxn], b[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i])
ans += b[i];
else {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
cout << ans << endl;
;
return 0;
} | [
"variable_declaration.type.change"
] | 768,406 | 768,407 | u451010951 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define inf 1e+9
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k, ans = 0;
cin >> n;
int a[n], b[n];
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] < b[i]) {
// b[i] -= a[i];
if ((b[i] - a[i]) < a[i + 1]) {
a[i + 1] -= (b[i] - a[i]);
ans += b[i];
// cout << ans << endl;
} else {
ans += a[i];
ans += a[i + 1];
a[i + 1] = 0;
// cout << "aaa" << endl;
}
} else {
ans += b[i];
// cout << a[i] << b[i] << endl;
}
// cout << ans << endl;
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define inf 1e+9
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
template <class T, class C> void chmax(T &a, C b) { a > b ?: a = b; }
template <class T, class C> void chmin(T &a, C b) { a < b ?: a = b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, ans = 0;
cin >> n;
ll a[n + 1], b[n];
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] < b[i]) {
// b[i] -= a[i];
if ((b[i] - a[i]) < a[i + 1]) {
a[i + 1] -= (b[i] - a[i]);
ans += b[i];
// cout << ans << endl;
} else {
ans += a[i];
ans += a[i + 1];
a[i + 1] = 0;
// cout << "aaa" << endl;
}
} else {
ans += b[i];
// cout << a[i] << b[i] << endl;
}
// cout << ans << endl;
}
// rep(i,n){
// ans += min(a[i],b[i]);
// }
// ans += a[n];
// for(int i=n;i>=1;i--){
// if(a[i]<b[i-1]){
// //b[i] -= a[i];
// if((b[i-1]-a[i])<a[i-1]){
// a[i-1] -= (b[i-1]-a[i]);
// ans += b[i-1];
// //cout << ans << endl;
// }
// else{
// ans += a[i];
// ans += a[i-1];
// a[i-1] = 0;
// //cout << "aaa" << endl;
// }
// }
// else{
// ans += b[i-1];
// //cout << a[i] << b[i] << endl;
// }
// //cout << ans << endl;
// }
cout << ans << endl;
// int dp[n+2];
// dp[0]=0;
// dp[1]=abs(s[0]-s[1]);
// rep(i,n){
// dp[i+2] = min(dp[i+1]+abs(s[i+2]-s[i+1]),dp[i]+abs(s[i+2]-s[i]));
// }
// cout << dp[n-1] << endl;
} | [
"variable_declaration.type.change"
] | 768,410 | 768,411 | u629341543 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
vector<int> barr(N);
for (int j = 0; j < N; j++) {
cin >> barr[j];
}
int ans = 0;
for (int k = 0; k < N; k++) {
int curb = barr[k];
int first = min(barr[k], arr[k]);
curb -= first;
arr[k] -= first;
ans += first;
int second = min(curb, arr[k + 1]);
arr[k + 1] -= second;
ans += second;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
vector<int> barr(N);
for (int j = 0; j < N; j++) {
cin >> barr[j];
}
int64_t ans = 0;
for (int k = 0; k < N; k++) {
int curb = barr[k];
int first = min(barr[k], arr[k]);
curb -= first;
arr[k] -= first;
ans += first;
int second = min(curb, arr[k + 1]);
arr[k + 1] -= second;
ans += second;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 768,412 | 768,413 | u725109307 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, sum = 0;
vector<int> a, b;
cin >> n;
a.resize(n + 1);
b.resize(n);
for (auto &x : a) {
cin >> x;
}
for (auto &x : b) {
cin >> x;
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
a[i + 1] = 0;
b[i] -= a[i + 1];
}
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n, sum = 0;
vector<int> a, b;
cin >> n;
a.resize(n + 1);
b.resize(n);
for (auto &x : a) {
cin >> x;
}
for (auto &x : b) {
cin >> x;
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
a[i + 1] = 0;
b[i] -= a[i + 1];
}
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 768,417 | 768,418 | u688509741 | cpp |
p02959 | /*#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")*/
//#pragma GCC optimize("fast-math")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops") #define _CRT_SECURE_NO_WARNINGS #pragma GCC
//optimize("unroll-loops") #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef int ll;
typedef pair<ll, ll> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
#define all(a) a.begin(), a.end()
#define lb(a, x) lower_bound(a.begin(), a.end(), x)
#define pb(x) push_back(x)
#define fr(i, n) for (int i = 0; i < n; ++i)
// typedef cc_hash_table<int, int, hash<int>> hst2;
// typedef cc_hash_table<int, hst2, hash<int>> hst;
typedef pii ord_set_t;
#ifdef ABCD
typedef map<ord_set_t, vi> ordered_set;
int __builtin_popcount(int x) {
int cnt = 0;
for (; x > 0; x >>= 1)
cnt += x & 1;
return cnt;
}
#else
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
mt19937 rnd(239);
using namespace __gnu_pbds;
typedef tree<ord_set_t, vi, less_equal<ord_set_t>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#endif
const int N = 300001;
ll a[N], b[N];
ll dp[N][2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ABCD
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
int n;
cin >> n;
fr(i, n + 1) cin >> a[i];
fr(i, n) cin >> b[i];
ll sum = 0;
fr(i, n) {
ll t = min(a[i], b[i]);
a[i] -= t;
b[i] -= t;
sum += t;
t = min(a[i + 1], b[i]);
sum += t;
a[i + 1] -= t;
b[i] -= t;
}
cout << sum;
}
| /*#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")*/
//#pragma GCC optimize("fast-math")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("unroll-loops") #define _CRT_SECURE_NO_WARNINGS #pragma GCC
//optimize("unroll-loops") #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
//GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
#define all(a) a.begin(), a.end()
#define lb(a, x) lower_bound(a.begin(), a.end(), x)
#define pb(x) push_back(x)
#define fr(i, n) for (int i = 0; i < n; ++i)
// typedef cc_hash_table<int, int, hash<int>> hst2;
// typedef cc_hash_table<int, hst2, hash<int>> hst;
typedef pii ord_set_t;
#ifdef ABCD
typedef map<ord_set_t, vi> ordered_set;
int __builtin_popcount(int x) {
int cnt = 0;
for (; x > 0; x >>= 1)
cnt += x & 1;
return cnt;
}
#else
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
mt19937 rnd(239);
using namespace __gnu_pbds;
typedef tree<ord_set_t, vi, less_equal<ord_set_t>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#endif
const int N = 300001;
ll a[N], b[N];
ll dp[N][2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ABCD
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
int n;
cin >> n;
fr(i, n + 1) cin >> a[i];
fr(i, n) cin >> b[i];
ll sum = 0;
fr(i, n) {
ll t = min(a[i], b[i]);
a[i] -= t;
b[i] -= t;
sum += t;
t = min(a[i + 1], b[i]);
sum += t;
a[i + 1] -= t;
b[i] -= t;
}
cout << sum;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,419 | 768,420 | u841694668 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#endif //
#define next asdnext
#define prev asdprev
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define vrep(i, v) for (auto &i : v)
#define all(x) (x).begin(), (x).end()
#define vout(v) \
for (auto &i : v) { \
cout << i << " "; \
} \
cout << "\n"; //配列出力
#define vin(v) \
for (auto &i : v) \
cin >> i; //配列入力
#define vec(v, n) vector<int> v(n, 0);
typedef long long ll;
typedef unsigned long long ull;
void Main() {
int N;
cin >> N;
vec(A, N + 1);
vec(B, N);
vin(A);
vin(B);
int ans = 0;
rep(i, N) {
if (B[i] > A[i]) {
ans += A[i];
B[i] -= A[i];
if (B[i] > A[i + 1]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B[i];
A[i + 1] -= B[i];
}
} else {
ans += B[i];
}
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef _IS_LOCAL //
#define dout cout
#define debug() if (true)
#else
#define dout \
if (false) \
cout
#define debug() if (false)
#endif //
#define next asdnext
#define prev asdprev
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define vrep(i, v) for (auto &i : v)
#define all(x) (x).begin(), (x).end()
#define vout(v) \
for (auto &i : v) { \
cout << i << " "; \
} \
cout << "\n"; //配列出力
#define vin(v) \
for (auto &i : v) \
cin >> i; //配列入力
#define vec(v, n) vector<int> v(n, 0);
typedef long long ll;
typedef unsigned long long ull;
void Main() {
int N;
cin >> N;
vec(A, N + 1);
vec(B, N);
vin(A);
vin(B);
ll ans = 0;
rep(i, N) {
if (B[i] > A[i]) {
ans += A[i];
B[i] -= A[i];
if (B[i] > A[i + 1]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B[i];
A[i + 1] -= B[i];
}
} else {
ans += B[i];
}
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | [
"variable_declaration.type.change"
] | 768,425 | 768,426 | u111937495 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
vector<int> a, b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int temp;
cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
b.push_back(temp);
}
for (int i = 0; i < n; i++) {
count += min(a[i], b[i]);
if (a[i] < b[i]) {
int temp = b[i] - a[i];
if (a[i + 1] > temp)
count += temp;
else
count += a[i + 1];
a[i + 1] = max(0, a[i + 1] - temp);
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, count = 0;
vector<long long> a, b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
int temp;
cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
b.push_back(temp);
}
for (int i = 0; i < n; i++) {
count += min(a[i], b[i]);
if (a[i] < b[i]) {
int temp = b[i] - a[i];
if (a[i + 1] > temp)
count += temp;
else
count += a[i + 1];
a[i + 1] = max(0LL, a[i + 1] - temp);
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.type.widen.change"
] | 768,431 | 768,432 | u754489932 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A.at(i);
}
for (int i = 0; i < N; ++i) {
cin >> B.at(i);
}
int count = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i)) {
A.at(i) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i);
count += A.at(i);
A.at(i) = 0;
}
if (A.at(i + 1) >= B.at(i)) {
A.at(i + 1) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i + 1);
count += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A.at(i);
}
for (int i = 0; i < N; ++i) {
cin >> B.at(i);
}
long long count = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i)) {
A.at(i) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i);
count += A.at(i);
A.at(i) = 0;
}
if (A.at(i + 1) >= B.at(i)) {
A.at(i + 1) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i + 1);
count += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,433 | 768,434 | u785773061 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A.at(i);
}
for (int i = 0; i < N; ++i) {
cin >> B.at(i);
}
int count = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i)) {
A.at(i) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i);
count += A.at(i);
A.at(i) = 0;
}
if (A.at(i + 1) >= B.at(i)) {
A.at(i + 1) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i + 1);
count += A.at(i + 1);
A.at(i) = 0;
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A.at(i);
}
for (int i = 0; i < N; ++i) {
cin >> B.at(i);
}
long long count = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i)) {
A.at(i) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i);
count += A.at(i);
A.at(i) = 0;
}
if (A.at(i + 1) >= B.at(i)) {
A.at(i + 1) -= B.at(i);
count += B.at(i);
B.at(i) = 0;
} else {
B.at(i) -= A.at(i + 1);
count += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 768,435 | 768,434 | u785773061 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 50;
ll monster[MAX], hero[MAX] = {0};
int main() {
memset(hero, 0, sizeof(hero));
int n;
cin >> n;
ll ans = 0;
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
ll pre = 0;
for (int i = 0; i < n; i++) {
cin >> hero[i];
if (hero[i] + pre >= monster[i]) {
ans += monster[i];
if (pre < monster[i])
pre = hero[i] - (monster[i] - pre);
else
pre = hero[i];
} else {
ans += hero[i];
pre = 0;
}
}
ans += min(pre + hero[n], monster[n]);
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 50;
ll monster[MAX], hero[MAX] = {0};
int main() {
memset(hero, 0, sizeof(hero));
int n;
cin >> n;
ll ans = 0;
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
ll pre = 0;
for (int i = 0; i < n; i++) {
cin >> hero[i];
if (hero[i] + pre >= monster[i]) {
ans += monster[i];
if (pre < monster[i])
pre = hero[i] - (monster[i] - pre);
else
pre = hero[i];
} else {
ans += hero[i] + pre;
pre = 0;
}
}
ans += min(pre + hero[n], monster[n]);
cout << ans << "\n";
return 0;
}
| [
"assignment.change"
] | 768,436 | 768,437 | u045531009 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, x, tot, ans, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
cin >> x;
if (a[i] >= x)
ans += x;
else {
x -= a[i];
ans += a[i];
tot = min(x, a[i + 1]);
ans += tot;
a[i + 1] -= tot;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, x, tot, ans, a[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
cin >> x;
if (a[i] >= x)
ans += x;
else {
x -= a[i];
ans += a[i];
tot = min(x, a[i + 1]);
ans += tot;
a[i + 1] -= tot;
}
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,438 | 768,439 | u960852022 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define maxn 200100
using namespace std;
long long a[maxn], b[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
long long ans = 0;
ans += min(a[0], b[0]);
b[0] = (b[0] >= a[0] ? b[0] - a[0] : 0);
for (int i = 1; i <= n; i++) {
if (b[i - 1]) {
ans += min(b[i - 1], a[i]);
a[i] = (b[i] <= a[i] ? a[i] - b[i - 1] : 0);
}
if (a[i] && i != n) {
ans += min(a[i], b[i]);
b[i] = (b[i] >= a[i] ? b[i] - a[i] : 0);
}
}
printf("%lld\n", ans);
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#define maxn 200100
using namespace std;
long long a[maxn], b[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i <= n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
scanf("%lld", &b[i]);
long long ans = 0;
ans += min(a[0], b[0]);
b[0] = (b[0] >= a[0] ? b[0] - a[0] : 0);
for (int i = 1; i <= n; i++) {
if (b[i - 1]) {
ans += min(b[i - 1], a[i]);
a[i] = (b[i - 1] <= a[i] ? a[i] - b[i - 1] : 0);
}
if (a[i] && i != n) {
ans += min(a[i], b[i]);
b[i] = (b[i] >= a[i] ? b[i] - a[i] : 0);
}
}
printf("%lld\n", ans);
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 768,440 | 768,441 | u335768052 | cpp |
p02959 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
int main(void) {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll sum = 0;
REP(i, N) {
if (B[i] - A[i + 1] - A[i] <= 0) {
sum += B[i];
if (A[i + 1] - B[i] < 0) {
A[i] -= A[i + 1] - B[i];
}
} else {
sum += A[i + 1] + A[i];
A[i] = 0;
}
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
int main(void) {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll sum = 0;
REP(i, N) {
if (B[i] - A[i + 1] - A[i] <= 0) {
sum += B[i];
if (A[i + 1] - B[i] < 0) {
A[i] -= -(A[i + 1] - B[i]);
}
} else {
sum += A[i + 1] + A[i];
A[i] = 0;
}
}
cout << sum << endl;
return 0;
}
| [] | 768,443 | 768,444 | u127344197 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
cnt += a[i];
b[i] -= a[i];
} else {
cnt += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
cnt += a[i + 1];
a[i + 1] = 0;
} else {
cnt += b[i];
a[i + 1] -= b[i];
}
}
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
long cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
cnt += a[i];
b[i] -= a[i];
} else {
cnt += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
cnt += a[i + 1];
a[i + 1] = 0;
} else {
cnt += b[i];
a[i + 1] -= b[i];
}
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 768,447 | 768,448 | u535297532 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.end(), target)
#define pb(x) push_back(x)
#define output(x) cout << x << endl
#define ERASE(x, n) x.erase(x.begin(), x.begin() + n)
// #define int long long
#define P pair<int, int>
typedef long long ll;
const long long int MOD = 1e9 + 7;
const int INF = -1;
signed main(void) {
int N;
cin >> N;
vector<int> A;
vector<int> B;
int ans = 0;
rep(i, N + 1) {
int tmp;
cin >> tmp;
A.pb(tmp);
}
rep(i, N) {
int tmp;
cin >> tmp;
B.pb(tmp);
}
rep(i, N) {
if (A[i] >= B[i]) {
ans += B[i];
} else {
ans += A[i];
B[i] -= A[i];
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define FIND(x, target) find(x.begin(), x.end(), target)
#define pb(x) push_back(x)
#define output(x) cout << x << endl
#define ERASE(x, n) x.erase(x.begin(), x.begin() + n)
// #define int long long
#define P pair<int, int>
typedef long long ll;
const long long int MOD = 1e9 + 7;
const int INF = -1;
signed main(void) {
int N;
cin >> N;
vector<ll> A;
vector<ll> B;
ll ans = 0;
rep(i, N + 1) {
ll tmp;
cin >> tmp;
A.pb(tmp);
}
rep(i, N) {
ll tmp;
cin >> tmp;
B.pb(tmp);
}
rep(i, N) {
if (A[i] >= B[i]) {
ans += B[i];
} else {
ans += A[i];
B[i] -= A[i];
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,451 | 768,452 | u785975381 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int A[100010];
int B[100010];
int main() {
int N;
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
if (B[i] >= A[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
}
cout << cnt << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long A[100010];
long long B[100010];
int main() {
int N;
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
if (B[i] >= A[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
// cout << cnt << "a\n";
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,453 | 768,454 | u601256797 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, a, b;
vector<int> A, B;
cin >> N;
for (int i = 1; i <= N + 1; i++) {
cin >> a;
A.push_back(a);
}
int cnt = 0;
int b2 = 0;
for (int i = 0; i < N + 1; i++) {
if (i < N) {
cin >> b;
} else {
b = 0;
}
cnt += min(A[i], b + b2);
// cout << cnt << endl;
if (b + b2 > A[i]) {
b2 = min(b, b + b2 - A[i]);
} else {
b2 = 0;
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, a, b;
vector<int> A, B;
cin >> N;
for (int i = 1; i <= N + 1; i++) {
cin >> a;
A.push_back(a);
}
long long cnt = 0;
int b2 = 0;
for (int i = 0; i < N + 1; i++) {
if (i < N) {
cin >> b;
} else {
b = 0;
}
cnt += min(A[i], b + b2);
// cout << cnt << endl;
if (b + b2 > A[i]) {
b2 = min(b, b + b2 - A[i]);
} else {
b2 = 0;
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,457 | 768,458 | u237044327 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M;
long long ans = 0;
string s;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
ans += A[i];
if (B[i] <= A[i + 1]) {
A[i + 1] -= -B[i];
ans += B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
} else {
ans += B[i];
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M;
long long ans = 0;
string s;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
ans += A[i];
if (B[i] <= A[i + 1]) {
A[i + 1] -= B[i];
ans += B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
} else {
ans += B[i];
}
}
cout << ans << endl;
}
| [
"expression.operation.unary.arithmetic.remove"
] | 768,461 | 768,462 | u699835930 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
signed main() {
Int n;
vector<Int> a, b;
cin >> n;
for (Int i = 0; i < n + 1; i++) {
Int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (Int i = 0; i < n; i++) {
Int tmp;
cin >> tmp;
b.push_back(tmp);
}
Int l = 0;
Int r = n - 1;
Int cnt = 0;
while (l <= r) {
// left
if (a[l] + a[l + 1] < b[l]) {
cnt += a[l] + a[l + 1];
b[l] -= a[l] + a[l + 1];
a[l] = 0;
a[l + 1] = 0;
} else {
cnt += b[l];
if (a[l] < b[l]) {
b[l] -= a[l];
a[l] = 0;
a[l + 1] -= b[l];
b[l] = 0;
} else {
a[l] -= b[l];
b[l] = 0;
}
}
l++;
if (l > r)
break;
// right
if (a[r] + a[r + 1] < b[r]) {
cnt += a[r] + a[r + 1];
b[r] -= a[r] + a[r + 1];
a[r] = 0;
a[r + 1] = 0;
} else {
cnt += b[r];
if (a[r + 1] < b[r]) {
b[r] -= a[r + 1];
a[r] = 0;
a[r] -= b[r];
b[r] = 0;
} else {
a[r + 1] -= b[r];
b[r] = 0;
}
}
r--;
if (l > r)
break;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
signed main() {
Int n;
vector<Int> a, b;
cin >> n;
for (Int i = 0; i < n + 1; i++) {
Int tmp;
cin >> tmp;
a.push_back(tmp);
}
for (Int i = 0; i < n; i++) {
Int tmp;
cin >> tmp;
b.push_back(tmp);
}
Int l = 0;
Int r = n - 1;
Int cnt = 0;
while (l <= r) {
// left
if (a[l] + a[l + 1] < b[l]) {
cnt += a[l] + a[l + 1];
b[l] -= a[l] + a[l + 1];
a[l] = 0;
a[l + 1] = 0;
} else {
cnt += b[l];
if (a[l] < b[l]) {
b[l] -= a[l];
a[l] = 0;
a[l + 1] -= b[l];
b[l] = 0;
} else {
a[l] -= b[l];
b[l] = 0;
}
}
l++;
if (l > r)
break;
// right
if (a[r] + a[r + 1] < b[r]) {
cnt += a[r] + a[r + 1];
b[r] -= a[r] + a[r + 1];
a[r] = 0;
a[r + 1] = 0;
} else {
cnt += b[r];
if (a[r + 1] < b[r]) {
b[r] -= a[r + 1];
a[r + 1] = 0;
a[r] -= b[r];
b[r] = 0;
} else {
a[r + 1] -= b[r];
b[r] = 0;
}
}
r--;
if (l > r)
break;
}
cout << cnt << endl;
return 0;
} | [
"assignment.change"
] | 768,465 | 768,466 | u148215098 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.