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>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<long> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, 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;
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n;
long ans = 0;
cin >> n;
vector<long> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, 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;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 767,732 | 767,733 | u926025622 | cpp |
p02959 |
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vi a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, 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;
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define rep(i, x, n) for (int(i) = (x); (i) < (n); (i)++)
using namespace std;
int main() {
int n;
long ans = 0;
cin >> n;
vector<long> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, 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;
return 0;
}
| [
"variable_declaration.type.widen.change",
"variable_declaration.type.change"
] | 767,734 | 767,733 | u926025622 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define N 100001
using namespace std;
ll fact(ll n) {
ll res = 1;
for (int i = 1; i <= n; i++) {
res = res * i;
}
return res;
}
int main() {
IOS;
int n;
cin >> n;
vector<ll> A(n + 1, 0), B(n, 0);
ll a, b;
for (int i = 0; i <= n; i++) {
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
cin >> b;
B.push_back(b);
}
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
ll res = 0;
for (int i = 0; i < n; i++) {
if (B[i] >= A[i]) {
B[i] = B[i] - A[i];
res += A[i];
A[i] = 0;
} else if (B[i] < A[i]) {
res += B[i];
A[i] -= B[i];
B[i] = 0;
}
if (B[i] < A[i + 1]) {
res += B[i];
A[i + 1] = A[i + 1] - B[i];
}
else if (B[i] >= A[i + 1]) {
res += A[i + 1];
A[i] = 0;
}
}
cout << res;
cout.precision(30);
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vi vector<ll>
#define el printf("\n")
#define N 100001
using namespace std;
ll fact(ll n) {
ll res = 1;
for (int i = 1; i <= n; i++) {
res = res * i;
}
return res;
}
int main() {
IOS;
int n;
cin >> n;
vector<ll> A(n + 1, 0), B(n, 0);
ll a, b;
for (int i = 0; i <= n; i++) {
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
cin >> b;
B.push_back(b);
}
reverse(A.begin(), A.end());
reverse(B.begin(), B.end());
ll res = 0;
for (int i = 0; i < n; i++) {
if (B[i] >= A[i]) {
B[i] = B[i] - A[i];
res += A[i];
A[i] = 0;
} else if (B[i] < A[i]) {
res += B[i];
A[i] -= B[i];
B[i] = 0;
}
if (B[i] < A[i + 1]) {
res += B[i];
A[i + 1] = A[i + 1] - B[i];
}
else if (B[i] >= A[i + 1]) {
res += A[i + 1];
A[i + 1] = 0;
}
}
cout << res;
cout.precision(30);
return 0;
}
| [
"assignment.change"
] | 767,735 | 767,736 | u266346465 | cpp |
p02959 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
scanf("%d", &n);
int a[n + 1], b[n];
REP(i, n + 1) scanf("%d", &a[i]);
REP(i, n) scanf("%d", &b[i]);
int sub = min(a[0], b[0]);
int sub2 = min(a[1], b[0] - sub);
int res = sub + sub2;
FOR(i, 1, n) {
sub = min(a[i] - sub2, b[i]);
sub2 = min(a[i + 1], b[i] - sub);
res += sub + min(a[i + 1], b[i] - sub);
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
scanf("%d", &n);
int a[n + 1], b[n];
REP(i, n + 1) scanf("%d", &a[i]);
REP(i, n) scanf("%d", &b[i]);
int sub = min(a[0], b[0]);
int sub2 = min(a[1], b[0] - sub);
ll res = sub + sub2;
FOR(i, 1, n) {
sub = min(a[i] - sub2, b[i]);
sub2 = min(a[i + 1], b[i] - sub);
res += sub + min(a[i + 1], b[i] - sub);
}
cout << res << endl;
} | [
"variable_declaration.type.change"
] | 767,737 | 767,738 | u283907492 | cpp |
p02959 | #include <algorithm>
#include <assert.h>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility> // pair make_pair
#include <vector>
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
#define fill(x, y) memset(x, y, sizeof(x))
#define ll long long
//#define int ll
#define INF INT_MAX / 10
using namespace std;
using Pi = pair<int, int>;
using Graph = vector<vector<int>>;
using WeightGraph = vector<vector<Pi>>;
int Monsters[100100];
int Yusha[100100];
int main() {
int N;
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> Monsters[i];
}
reverse(Monsters, Monsters + N + 1);
for (int i = 0; i < N; i++) {
cin >> Yusha[i];
}
reverse(Yusha, Yusha + N);
int ans = 0;
int prev = 0;
for (int i = 0; i <= N; i++) {
if (Monsters[i] - prev <= 0) {
ans += Monsters[i];
prev = Yusha[i];
Monsters[i] = 0;
} else {
Monsters[i] -= prev;
if (Monsters[i] - Yusha[i] <= 0) {
ans += Monsters[i] + prev;
prev = Yusha[i] - Monsters[i];
Monsters[i] = 0;
} else {
ans += Yusha[i] + prev;
prev = 0;
Monsters[i] -= Yusha[i];
}
}
}
// for (int i = 0; i <= N; i++) {
// cout << Monsters[i] << endl;
// }
cout << ans << endl;
}
| #include <algorithm>
#include <assert.h>
#include <climits> // LLONG_MAX, LLONG_MIN, INT_MIN, INT_MAX
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility> // pair make_pair
#include <vector>
#define m0(x) memset(x, 0, sizeof(x))
#define m1(x) memset(x, 63, sizeof(x))
#define fill(x, y) memset(x, y, sizeof(x))
#define ll long long
#define int ll
#define INF INT_MAX / 10
using namespace std;
using Pi = pair<int, int>;
using Graph = vector<vector<int>>;
using WeightGraph = vector<vector<Pi>>;
int Monsters[100100];
int Yusha[100100];
signed main() {
int N;
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> Monsters[i];
}
reverse(Monsters, Monsters + N + 1);
for (int i = 0; i < N; i++) {
cin >> Yusha[i];
}
reverse(Yusha, Yusha + N);
int ans = 0;
int prev = 0;
for (int i = 0; i <= N; i++) {
if (Monsters[i] - prev <= 0) {
ans += Monsters[i];
prev = Yusha[i];
Monsters[i] = 0;
} else {
Monsters[i] -= prev;
if (Monsters[i] - Yusha[i] <= 0) {
ans += Monsters[i] + prev;
prev = Yusha[i] - Monsters[i];
Monsters[i] = 0;
} else {
ans += Yusha[i] + prev;
prev = 0;
Monsters[i] -= Yusha[i];
}
}
}
// for (int i = 0; i <= N; i++) {
// cout << Monsters[i] << endl;
// }
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,743 | 767,744 | u703205079 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int subToZero(int a, int b) { return max(0, a - b); }
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
int sum = 0;
for (int i = 0; i < N; ++i) {
int prevA = A[i];
int delta;
A[i] = subToZero(A[i], B[i]);
delta = prevA - A[i];
B[i] = B[i] - delta;
sum += delta;
prevA = A[i + 1];
A[i + 1] = subToZero(A[i + 1], B[i]);
delta = prevA - A[i + 1];
B[i] = B[i] - delta;
sum += delta;
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int subToZero(int a, int b) { return max(0, a - b); }
int main(int argc, const char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
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 sum = 0;
for (int i = 0; i < N; ++i) {
int prevA = A[i];
int delta;
A[i] = subToZero(A[i], B[i]);
delta = prevA - A[i];
B[i] = B[i] - delta;
sum += delta;
prevA = A[i + 1];
A[i + 1] = subToZero(A[i + 1], B[i]);
delta = prevA - A[i + 1];
B[i] = B[i] - delta;
sum += delta;
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,747 | 767,748 | u848433916 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
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 kill = 0;
for (int i = 0; i < n - 1; i++) {
if (b[i] > a[i] + a[i + 1]) {
kill += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
kill += b[i];
if (b[i] > a[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
}
}
}
if (b[n - 1] > (a[n - 1] + a[n])) {
kill += a[n - 1] + a[n];
} else {
kill += b[n - 1];
}
cout << kill << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long 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 int kill = 0;
for (int i = 0; i < n - 1; i++) {
if (b[i] > a[i] + a[i + 1]) {
kill += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
kill += b[i];
if (b[i] > a[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
}
}
}
if (b[n - 1] > (a[n - 1] + a[n])) {
kill += a[n - 1] + a[n];
} else {
kill += b[n - 1];
}
cout << kill << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,749 | 767,750 | u641659912 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int64_t sum_(vector<int> v) {
int64_t total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);
vector<int> bravery(N);
for (int n = 0; n < N; n++) {
cin >> bravery.at(n);
}
for (int i = 0; i < N; i++) {
int atk = bravery.at(i);
cities.at(i) -= atk;
if (cities.at(i) < 0) {
cities.at(i + 1) += cities.at(i);
cities.at(i) = 0;
if (cities.at(i + 1) < 0) {
cities.at(i + 1) = 0;
}
}
}
int64_t wins = sum_(cities);
cout << wins - enemies << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t sum_(vector<int> v) {
int64_t total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);
vector<int> bravery(N);
for (int n = 0; n < N; n++) {
cin >> bravery.at(n);
}
for (int i = 0; i < N; i++) {
int atk = bravery.at(i);
cities.at(i) -= atk;
if (cities.at(i) < 0) {
cities.at(i + 1) += cities.at(i);
cities.at(i) = 0;
if (cities.at(i + 1) < 0) {
cities.at(i + 1) = 0;
}
}
}
int64_t wins = sum_(cities);
cout << enemies - wins << endl;
} | [
"expression.operation.binary.remove"
] | 767,752 | 767,753 | u259585438 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int sum_(vector<int> v) {
int total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);
vector<int> bravery(N);
for (int n = 0; n < N; n++) {
cin >> bravery.at(n);
}
for (int i = 0; i < N; i++) {
int atk = bravery.at(i);
cities.at(i) -= atk;
if (cities.at(i) < 0) {
cities.at(i + 1) += cities.at(i);
cities.at(i) = 0;
if (cities.at(i + 1) < 0) {
cities.at(i + 1) = 0;
}
}
}
int64_t wins = sum_(cities);
cout << enemies - wins << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t sum_(vector<int> v) {
int64_t total = 0;
for (int v_ : v) {
total += v_;
}
return total;
}
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
for (int n = 0; n < N + 1; n++) {
cin >> cities.at(n);
}
int64_t enemies = sum_(cities);
vector<int> bravery(N);
for (int n = 0; n < N; n++) {
cin >> bravery.at(n);
}
for (int i = 0; i < N; i++) {
int atk = bravery.at(i);
cities.at(i) -= atk;
if (cities.at(i) < 0) {
cities.at(i + 1) += cities.at(i);
cities.at(i) = 0;
if (cities.at(i + 1) < 0) {
cities.at(i + 1) = 0;
}
}
}
int64_t wins = sum_(cities);
cout << enemies - wins << endl;
} | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 767,754 | 767,753 | u259585438 | 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[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
int tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
cnt += A[i];
tmp = min(B[i], B[i] + tmp - A[i]);
} else {
cnt += B[i] + tmp;
tmp = 0;
}
}
cout << cnt + min(A[N], tmp) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
long tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
cnt += A[i];
tmp = min(B[i], B[i] + tmp - A[i]);
} else {
cnt += B[i] + tmp;
tmp = 0;
}
}
cout << cnt + min(A[N], tmp) << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,762 | 767,763 | u883725898 | 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[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
int tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
cnt += A[i];
tmp = min(B[i], B[i] + tmp - A[i]);
} else {
cnt += cnt + B[i] + tmp;
tmp = 0;
}
}
cout << cnt + min(A[N], tmp) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
long tmp = 0, cnt = 0;
for (int i = 0; i < N; ++i) {
if (tmp + B[i] > A[i]) {
cnt += A[i];
tmp = min(B[i], B[i] + tmp - A[i]);
} else {
cnt += B[i] + tmp;
tmp = 0;
}
}
cout << cnt + min(A[N], tmp) << endl;
}
| [
"variable_declaration.type.primitive.change",
"expression.operation.binary.remove"
] | 767,764 | 767,763 | u883725898 | cpp |
p02959 | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
long long int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
scanf("%d", a[i]);
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", b[i]);
ans += min(temp, a[i]);
a[i] -= temp;
a[i] = max(a[i], 0);
ans += min(a[i], b[i]);
temp = max(0, b[i] - a[i]);
// cout<<i<<" : "<<temp<<" : "<<ans<<endl;
}
ans += min(temp, a[n]);
// cout<<min(temp,a[n]);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
long long int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
ans += min(temp, a[i]);
a[i] -= temp;
a[i] = max(a[i], 0);
ans += min(a[i], b[i]);
temp = max(0, b[i] - a[i]);
// cout<<i<<" : "<<temp<<" : "<<ans<<endl;
}
ans += min(temp, a[n]);
// cout<<min(temp,a[n]);
cout << ans << endl;
return 0;
} | [
"expression.operation.unary.reference.add"
] | 767,769 | 767,770 | u134181243 | cpp |
p02959 | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(temp, a[i]);
a[i] -= temp;
a[i] = max(a[i], 0);
ans += min(a[i], b[i]);
temp = max(0, b[i] - a[i]);
// cout<<i<<" : "<<temp<<" : "<<ans<<endl;
}
ans += min(temp, a[n]);
// cout<<min(temp,a[n]);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int n;
int a[100001], b[100000];
long long int ans;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int temp = 0;
ans = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(temp, a[i]);
a[i] -= temp;
a[i] = max(a[i], 0);
ans += min(a[i], b[i]);
temp = max(0, b[i] - a[i]);
// cout<<i<<" : "<<temp<<" : "<<ans<<endl;
}
ans += min(temp, a[n]);
// cout<<min(temp,a[n]);
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,771 | 767,772 | u309508171 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int tmp;
int num;
vector<int> a;
vector<int> b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
for (int i = 0; i < n; i++) {
tmp = min(a.at(i), b.at(i));
num += tmp;
a.at(i) -= tmp;
b.at(i) -= tmp;
tmp = min(a.at(i + 1), b.at(i));
num += tmp;
a.at(i + 1) -= tmp;
b.at(i) -= tmp;
}
cout << num << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int tmp;
long long int num = 0;
vector<int> a;
vector<int> b;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
for (int i = 0; i < n; i++) {
tmp = min(a.at(i), b.at(i));
num += tmp;
a.at(i) -= tmp;
b.at(i) -= tmp;
tmp = min(a.at(i + 1), b.at(i));
num += tmp;
a.at(i + 1) -= tmp;
b.at(i) -= tmp;
}
cout << num << endl;
} | [
"variable_declaration.value.change"
] | 767,775 | 767,776 | u755310927 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0, i_len = (int)n + 1; i < i_len; ++i)
cin >> a[i];
vector<int> b(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> b[i];
int ans{};
for (int i = 0, i_len = (int)n; i < i_len; ++i) {
int left = min(a[i], b[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(a[i + 1], b[i]);
ans += right;
a[i + 1] -= right;
b[i + 1] -= right;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define itn int
/*template*/
template <class T> inline bool amax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool amin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
/* func */
int32_t GCD(int32_t a, int32_t b) { return b ? GCD(b, a % b) : a; }
int64_t GCD(int64_t a, int64_t b) { return b ? GCD(b, a % b) : a; }
int32_t LCM(int32_t a, int32_t b) { return a * b / GCD(a, b); }
int64_t LCM(int64_t a, int64_t b) { return a * b / GCD(a, b); }
/*struct*/
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} aaaaaaa;
/* const */
constexpr int32_t INF = 1001001001;
constexpr int64_t LINF = 1001001001001001001ll;
constexpr int32_t MOD = 1e9 + 7; // 10^9
constexpr int64_t EPS = 1e-9;
constexpr int32_t dx[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// constexpr int32_t dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
// Counterclockwise from the 6o'clock direction
// Take the x-axis downward and the y-axis right
// g++ -std=c++14 -Wall --pedantic-errors -o template template.cpp
// g++ -std=c++14 -Wall --pedantic-errors template.cpp
// chcp 65001
/*global*/
#define int int64_t
signed main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0, i_len = (int)n + 1; i < i_len; ++i)
cin >> a[i];
vector<int> b(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> b[i];
int ans{};
for (int i = 0, i_len = (int)n; i < i_len; ++i) {
int left = min(a[i], b[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(a[i + 1], b[i]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 767,788 | 767,789 | u509680664 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> mons(N + 1);
vector<int> yusya(N);
for (int i = 0; i < N + 1; i++) {
cin >> mons.at(i);
}
int total = 0; //勇者が最大で倒せるモンスターの数
for (int i = 0; i < N; i++) {
cin >> yusya.at(i);
total += yusya.at(i);
}
int nokori = 0; // i番目の勇者がi番目の街のモンスターを倒したときの残り
int totalmins = 0; //あとで引くやつ
for (int i = 0; i < N; i++) {
nokori = yusya.at(i) - mons.at(i);
if (nokori < 0) { //もし勇者の倒せる数＜モンスターの数だったら
nokori = 0;
}
if (mons.at(i + 1) >= nokori) {
mons.at(i + 1) -= nokori;
} else {
totalmins += (nokori - mons.at(i + 1));
mons.at(i + 1) = 0;
}
}
cout << total - totalmins << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> mons(N + 1);
vector<int> yusya(N);
for (int i = 0; i < N + 1; i++) {
cin >> mons.at(i);
}
int64_t total = 0; //勇者が最大で倒せるモンスターの数
for (int i = 0; i < N; i++) {
cin >> yusya.at(i);
total += yusya.at(i);
}
int nokori = 0; // i番目の勇者がi番目の街のモンスターを倒したときの残り
int64_t totalmins = 0; //あとで引くやつ
for (int i = 0; i < N; i++) {
nokori = yusya.at(i) - mons.at(i);
if (nokori < 0) {
nokori = 0;
}
if (mons.at(i + 1) >= nokori) {
mons.at(i + 1) -= nokori;
} else {
totalmins += (nokori - mons.at(i + 1));
mons.at(i + 1) = 0;
}
}
cout << total - totalmins << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,790 | 767,791 | u521652313 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
int A[100100];
int B[100100];
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
int al, ar, b;
ar = A[i + 1];
al = A[i];
b = B[i];
if (b >= ar) {
ans += ar;
b -= ar;
if (b >= al) {
ans += al;
A[i] = 0;
} else {
ans += b;
A[i] -= b;
}
} else {
ans += b;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
int A[100100];
int B[100100];
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
ll ans = 0;
for (int i = n - 1; i >= 0; --i) {
int al, ar, b;
ar = A[i + 1];
al = A[i];
b = B[i];
if (b >= ar) {
ans += ar;
b -= ar;
if (b >= al) {
ans += al;
A[i] = 0;
} else {
ans += b;
A[i] -= b;
}
} else {
ans += b;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,792 | 767,793 | u655777757 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.at(i), b.at(i));
ans += k;
a.at(i) -= k;
b.at(i) -= k;
k = min(b.at(i), a.at(i + 1));
ans += k;
a.at(i) -= k;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.at(i), b.at(i));
ans += k;
a.at(i) -= k;
b.at(i) -= k;
k = min(b.at(i), a.at(i + 1));
ans += k;
a.at(i + 1) -= k;
}
cout << ans << endl;
} | [
"assignment.change"
] | 767,797 | 767,798 | u111600809 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.at(i), b.at(i));
ans += k;
a.at(i) -= k;
b.at(i) -= k;
k = min(b.at(i), a.at(i));
ans += k;
a.at(i) -= k;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> b(n);
for (int i = 0; i <= n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0, k;
for (int i = 0; i < n; i++) {
k = min(a.at(i), b.at(i));
ans += k;
a.at(i) -= k;
b.at(i) -= k;
k = min(b.at(i), a.at(i + 1));
ans += k;
a.at(i + 1) -= k;
}
cout << ans << endl;
} | [
"assignment.change"
] | 767,799 | 767,798 | u111600809 | cpp |
p02959 | #include <iostream>
#include <vector>
int main(int argc, char **argv) {
int N;
std::cin >> N;
std::vector<long long> A(N + 1);
std::vector<long long> B(N);
for (int i = 0; i <= N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
long long b1 = std::min(A[i], B[i]);
ans += b1;
A[i] -= b1;
B[i] -= b1;
long long b2 = std::min(A[i + 1], B[i]);
ans += b2;
A[i + 1] -= b2;
}
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main(int argc, char **argv) {
int N;
std::cin >> N;
std::vector<long long> A(N + 1);
std::vector<long long> B(N);
for (int i = 0; i <= N; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
long long b1 = std::min(A[i], B[i]);
ans += b1;
A[i] -= b1;
B[i] -= b1;
long long b2 = std::min(A[i + 1], B[i]);
ans += b2;
A[i + 1] -= b2;
}
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,800 | 767,801 | u922974720 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) for (long i = s; i < e; i++)
#define repeq(i, s, e) for (long i = s; i <= e; i++)
int main() {
ll n, ans = 0;
in(n);
vll a(n + 1);
vll b(n);
repeq(i, 0, n) { in(a[i]); }
rep(i, 0, n) { in(b[i]); }
rep(i, 0, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
a[i + 1] == 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
}
outn(ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long long>;
#define in(x) cin >> x
#define out(x) cout << x
#define outn(x) cout << x << '\n'
#define outs(x) cout << x << ' '
#define rep(i, s, e) for (long i = s; i < e; i++)
#define repeq(i, s, e) for (long i = s; i <= e; i++)
int main() {
ll n, ans = 0;
in(n);
vll a(n + 1);
vll b(n);
repeq(i, 0, n) { in(a[i]); }
rep(i, 0, n) { in(b[i]); }
rep(i, 0, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
}
outn(ans);
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 767,805 | 767,806 | u757628628 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
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];
}
int sum = 0;
for (int i = 0; i < n; i++) {
int c = min(a[i], b[i]);
a[i] -= c;
b[i] -= c;
sum += c;
int d = min(a[i + 1], b[i]);
a[i + 1] -= d;
b[i] -= d;
sum += d;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
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];
}
ll sum = 0;
for (int i = 0; i < n; i++) {
int c = min(a[i], b[i]);
a[i] -= c;
b[i] -= c;
sum += c;
int d = min(a[i + 1], b[i]);
a[i + 1] -= d;
b[i] -= d;
sum += d;
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 767,814 | 767,815 | u881599732 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long int lld;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
int n = 0;
cin >> n;
int ans = 0;
vector<int> vec(n + 1);
for (int i = 0; i <= n; i++)
cin >> vec[i];
for (int i = 0; i < n; i++) {
int x = 0;
cin >> x;
int t = min(x, vec[i]);
ans += t;
x -= t;
vec[i] -= t;
t = min(x, vec[i + 1]);
ans += t;
vec[i + 1] -= t;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
typedef long long int lld;
typedef pair<int, int> pii;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(15);
cout << fixed;
int n = 0;
cin >> n;
lld ans = 0;
vector<int> vec(n + 1);
for (int i = 0; i <= n; i++)
cin >> vec[i];
for (int i = 0; i < n; i++) {
int x = 0;
cin >> x;
int t = min(x, vec[i]);
ans += t;
x -= t;
vec[i] -= t;
t = min(x, vec[i + 1]);
ans += t;
vec[i + 1] -= t;
}
cout << ans << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 767,816 | 767,817 | u835820697 | 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[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];
if (A[i + 1] + A[i] - B[i] >= 0) {
A[i + 1] -= B[i] - A[i];
cnt += B[i] - A[i];
} else {
cnt += A[i + 1];
A[i + 1] = 0;
}
} else
cnt += B[i];
}
cout << cnt << endl;
}
| #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[i];
for (int i = 0; i < n; i++)
cin >> B[i];
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (A[i] <= B[i]) {
cnt += A[i];
if (A[i + 1] + A[i] - B[i] >= 0) {
A[i + 1] -= B[i] - A[i];
cnt += B[i] - A[i];
} else {
cnt += A[i + 1];
A[i + 1] = 0;
}
} else
cnt += B[i];
}
cout << cnt << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,818 | 767,819 | u747390421 | 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 sum = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
sum += a[i];
if (a[i + 1] < b[i] - a[i]) {
sum += a[i + 1];
a[i + 1] = 0;
} else {
sum += (b[i] - a[i]);
a[i + 1] -= (b[i] - a[i]);
}
} else {
sum += b[i];
}
}
cout << sum << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<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 sum = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
sum += a[i];
if (a[i + 1] < b[i] - a[i]) {
sum += a[i + 1];
a[i + 1] = 0;
} else {
sum += (b[i] - a[i]);
a[i + 1] -= (b[i] - a[i]);
}
} else {
sum += b[i];
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,822 | 767,823 | u541963880 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> cities(n + 1);
vector<long long> heros(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> cities[i];
}
for (int i = 0; i < n; i++) {
cin >> heros[i];
}
heros[n + 1] = 0;
long long acc = 0;
long long prev_hero = 0;
long long prev_hero_min = 0;
for (int i = 0; i < n + 1; i++) {
acc += min((prev_hero + heros[i]), cities[i]);
prev_hero = max(heros[i] - max((cities[i] - prev_hero), prev_hero_min),
prev_hero_min);
}
cout << acc << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> cities(n + 1);
vector<long long> heros(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> cities[i];
}
for (int i = 0; i < n; i++) {
cin >> heros[i];
}
heros[n] = 0;
long long acc = 0;
long long prev_hero = 0;
long long prev_hero_min = 0;
for (int i = 0; i < n + 1; i++) {
acc += min((prev_hero + heros[i]), cities[i]);
prev_hero = max(heros[i] - max((cities[i] - prev_hero), prev_hero_min),
prev_hero_min);
}
cout << acc << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 767,824 | 767,825 | u629133942 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
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 count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
} else {
count += A[i];
if ((B[i] - A[i]) < A[i + 1]) {
count += (B[i] - A[i]);
A[i + 1] -= (B[i] - A[i]);
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count << "\n";
} | #include <iostream>
using namespace std;
int main() {
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 count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
} else {
count += A[i];
if ((B[i] - A[i]) < A[i + 1]) {
count += (B[i] - A[i]);
A[i + 1] -= (B[i] - A[i]);
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count << "\n";
} | [
"variable_declaration.type.primitive.change"
] | 767,826 | 767,827 | u895409580 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a, b;
rep(i, n + 1) {
int aa;
cin >> aa;
a.push_back(aa);
}
rep(i, n) {
int bb;
cin >> bb;
b.push_back(bb);
}
int ans = 0;
rep(i, n) {
// i番目が倒せる数だけansに加算
if (b[i] >= a[i]) {
// i地点を倒す
ans += a[i];
// i+1地点も出来るだけ倒す
if (a[i + 1] < b[i] - a[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i] - a[i];
ans += b[i] - a[i];
}
} else {
// i地点を出来るだけ倒す
ans += b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a, b;
rep(i, n + 1) {
ll aa;
cin >> aa;
a.push_back(aa);
}
rep(i, n) {
ll bb;
cin >> bb;
b.push_back(bb);
}
ll ans = 0;
rep(i, n) {
// i番目が倒せる数だけansに加算
if (b[i] >= a[i]) {
// i地点を倒す
ans += a[i];
// i+1地点も出来るだけ倒す
if (a[i + 1] < b[i] - a[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i] - a[i];
ans += b[i] - a[i];
}
} else {
// i地点を出来るだけ倒す
ans += b[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 767,828 | 767,829 | u762183504 | cpp |
p02959 | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
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 ans = 0;
for (int i = 0; i < N; ++i) {
int temp = B[i];
if (temp <= A[i]) {
ans += temp;
A[i] -= temp;
} else {
ans += A[i];
temp -= A[i];
A[i] = 0;
if (temp <= A[i + 1]) {
ans += temp;
A[i + 1] -= temp;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
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 ans = 0;
for (int i = 0; i < N; ++i) {
int temp = B[i];
if (temp <= A[i]) {
ans += temp;
A[i] -= temp;
} else {
ans += A[i];
temp -= A[i];
A[i] = 0;
if (temp <= A[i + 1]) {
ans += temp;
A[i + 1] -= temp;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,840 | 767,841 | u352969025 | cpp |
p02959 | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
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 ans = 0;
for (int i = 0; i < N; ++i) {
int temp = B[i];
if (temp <= A[i]) {
ans += temp;
A[i] -= temp;
} else {
temp -= A[i];
ans += A[i];
A[i] = 0;
if (temp <= A[i + 1]) {
ans += temp;
A[i + 1] -= temp;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int A[100005];
int B[100005];
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 ans = 0;
for (int i = 0; i < N; ++i) {
int temp = B[i];
if (temp <= A[i]) {
ans += temp;
A[i] -= temp;
} else {
ans += A[i];
temp -= A[i];
A[i] = 0;
if (temp <= A[i + 1]) {
ans += temp;
A[i + 1] -= temp;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.add"
] | 767,842 | 767,841 | u352969025 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<ll> vec;
int main() {
int N;
cin >> N;
vec A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll cnt = 0;
if (B[0] >= A[0]) {
cnt += A[0];
B[0] -= A[0];
} else {
cnt += B[0];
B[0] = 0;
}
if (B[N - 1] >= A[N]) {
cnt += A[N];
B[N - 1] -= A[N];
} else {
cnt += B[N - 1];
B[N - 1] = 0;
}
for (int i = 0; i < N; i++) {
if (i != 0) {
if (B[i] >= A[i]) {
cnt += A[i];
B[i] -= A[i];
} else {
cnt += B[i];
B[i] = 0;
}
}
if (i != N - 1) {
if (B[i] >= A[i + 1]) {
cnt += A[i + 1];
A[i + 1] = 0;
} else {
cnt += B[i];
A[i] -= B[i];
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef vector<ll> vec;
int main() {
int N;
cin >> N;
vec A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll cnt = 0;
if (B[0] >= A[0]) {
cnt += A[0];
B[0] -= A[0];
} else {
cnt += B[0];
B[0] = 0;
}
if (B[N - 1] >= A[N]) {
cnt += A[N];
B[N - 1] -= A[N];
} else {
cnt += B[N - 1];
B[N - 1] = 0;
}
for (int i = 0; i < N; i++) {
if (i != 0) {
if (B[i] >= A[i]) {
cnt += A[i];
B[i] -= A[i];
} else {
cnt += B[i];
B[i] = 0;
}
}
if (i != N - 1) {
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;
}
| [
"assignment.change"
] | 767,853 | 767,854 | u782219335 | cpp |
p02959 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
long monsters[N];
rep(i, N + 1) cin >> monsters[i];
long heros[N];
rep(i, N) cin >> heros[i];
int ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
monsters[i] -= left;
heros[i] -= left;
int right = min(monsters[i + 1], heros[i]);
ans += right;
monsters[i + 1] -= right;
heros[i] -= right;
}
cout << ans << endl;
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int monsters[N];
rep(i, N + 1) cin >> monsters[i];
int heros[N];
rep(i, N) cin >> heros[i];
long ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
monsters[i] -= left;
heros[i] -= left;
int right = min(monsters[i + 1], heros[i]);
ans += right;
monsters[i + 1] -= right;
heros[i] -= right;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,855 | 767,856 | u323327162 | cpp |
p02959 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int monsters[N];
rep(i, N + 1) cin >> monsters[i];
int heros[N];
rep(i, N) cin >> heros[i];
int ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
monsters[i] -= left;
heros[i] -= left;
int right = min(monsters[i + 1], heros[i]);
ans += right;
monsters[i + 1] -= right;
heros[i] -= right;
}
cout << ans << endl;
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int monsters[N];
rep(i, N + 1) cin >> monsters[i];
int heros[N];
rep(i, N) cin >> heros[i];
long ans = 0;
rep(i, N) {
int left = min(monsters[i], heros[i]);
ans += left;
monsters[i] -= left;
heros[i] -= left;
int right = min(monsters[i + 1], heros[i]);
ans += right;
monsters[i + 1] -= right;
heros[i] -= right;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,857 | 767,856 | u323327162 | cpp |
p02959 | #include <algorithm>
#include <cstdio>
using namespace std;
int N, monster[100001];
int main() {
scanf("%d", &N);
for (int i = 0; i < N + 1; i++)
scanf("%d", &monster[i]);
int ret = 0;
int tmp = 0;
int x;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
tmp = min(monster[i], x);
ret += tmp;
x -= tmp;
if (x) {
tmp = min(monster[i + 1], x);
monster[i + 1] -= tmp;
ret += tmp;
}
}
printf("%d\n", ret);
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int N, monster[100001];
int main() {
scanf("%d", &N);
for (int i = 0; i < N + 1; i++)
scanf("%d", &monster[i]);
long long ret = 0;
int tmp = 0;
int x;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
tmp = min(monster[i], x);
ret += tmp;
x -= tmp;
if (x) {
tmp = min(monster[i + 1], x);
monster[i + 1] -= tmp;
ret += tmp;
}
}
printf("%lld\n", ret);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,858 | 767,859 | u962441451 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A, B;
cin >> N;
for (int i = 0; i <= N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; ++i) {
int b;
cin >> b;
B.push_back(b);
}
int ans = 0;
for (int i = N - 1; i >= 0; --i) {
int r = min(A[i + 1], B[i]);
int l = min(A[i], B[i] - r);
ans += r + l;
A[i] -= l;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> A, B;
cin >> N;
for (int i = 0; i <= N; ++i) {
int a;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < N; ++i) {
int b;
cin >> b;
B.push_back(b);
}
long long ans = 0;
for (int i = N - 1; i >= 0; --i) {
int r = min(A[i + 1], B[i]);
int l = min(A[i], B[i] - r);
ans += r + l;
A[i] -= l;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,862 | 767,863 | u128142352 | cpp |
p02959 | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, n, ans = 0;
scanf("%lld", &n);
ll a[n + 1], b[n];
for (i = 0; i <= n; ++i)
scanf("%lld", &a[i]);
for (i = 0; i < n; ++i)
scanf("%lld", &b[i]);
for (i = 0; i < n; ++i) {
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];
}
printf("%lld", ans);
return 0;
} | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, k, n, ans = 0;
scanf("%lld", &n);
ll a[n + 1], b[n];
for (i = 0; i <= n; ++i)
scanf("%lld", &a[i]);
for (i = 0; i < n; ++i)
scanf("%lld", &b[i]);
for (i = 0; i < n; ++i) {
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];
}
printf("%lld", ans);
return 0;
} | [
"assignment.value.change"
] | 767,864 | 767,865 | u440920318 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n;
cin >> n;
vector<ll> 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 + 1) {
ll x = min(b[i], a[i]);
ans += x, a[i] -= x, b[i] -= x;
ll y = min(b[i], a[i + 1]);
ans += y, a[i + 1] -= y;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
int main() {
ll n;
cin >> n;
vector<ll> 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 x = min(b[i], a[i]);
ans += x, a[i] -= x, b[i] -= x;
ll y = min(b[i], a[i + 1]);
ans += y, a[i + 1] -= y;
}
cout << ans << endl;
} | [
"expression.operation.binary.remove"
] | 767,869 | 767,870 | u318785595 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
int ans = 0;
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];
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
ans += b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
ans += a[i];
} else {
ans += b[i];
}
}
cout << ans;
}
| #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n + 1];
int b[n];
long long int ans = 0;
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];
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
ans += b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
ans += a[i];
} else {
ans += b[i];
}
}
cout << ans;
}
| [
"variable_declaration.type.widen.change"
] | 767,871 | 767,872 | u832158848 | cpp |
p02959 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int n;
int a[100005];
int b[100005];
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n - 1; i++)
cin >> b[i];
long long ans = 0;
for (int i = 1; i <= n; i++) {
if (i > 1) {
int kill = min(a[i], b[i - 1]);
a[i] -= kill;
b[i - 1] -= kill;
ans += kill;
}
int kill = min(a[i], b[i]);
a[i] -= kill;
b[i] -= kill;
ans += kill;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int n;
int a[100005];
int b[100005];
int main() {
ios_base::sync_with_stdio(false);
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 ans = 0;
for (int i = 1; i <= n + 1; i++) {
if (i > 1) {
int kill = min(a[i], b[i - 1]);
a[i] -= kill;
b[i - 1] -= kill;
ans += kill;
}
int kill = min(a[i], b[i]);
a[i] -= kill;
b[i] -= kill;
ans += kill;
}
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 767,878 | 767,879 | u450096124 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (auto &v : A) {
cin >> v;
}
vector<int> B(N);
for (auto &v : B) {
cin >> v;
}
int ans = 0;
int sub = 0;
for (int i = 0; i < N; ++i) {
ans += min(sub + B[i], A[i]);
sub = A[i] <= sub ? B[i] : B[i] - (A[i] - sub);
if (sub < 0)
sub = 0;
}
if (sub > 0) {
ans += min(sub, A[N]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (auto &v : A) {
cin >> v;
}
vector<ll> B(N);
for (auto &v : B) {
cin >> v;
}
ll ans = 0;
ll sub = 0;
for (int i = 0; i < N; ++i) {
ans += min(sub + B[i], A[i]);
sub = A[i] <= sub ? B[i] : B[i] - (A[i] - sub);
if (sub < 0)
sub = 0;
}
if (sub > 0) {
ans += min(sub, A[N]);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,880 | 767,881 | u489326854 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#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];
continue;
} else {
ans += A[i];
B[i] -= A[i];
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;
return 0;
}
| #include <algorithm>
#include <cmath>
#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];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
ans += B[i];
continue;
} else {
ans += A[i];
B[i] -= A[i];
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;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 767,891 | 767,892 | u537874719 | cpp |
p02959 | #include <bits/stdc++.h>
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 monster = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] <= b[i]) { //オーバーキル
monster += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
else if (a[i] <= b[i]) { // i番目のモンスターを全滅させる
monster += b[i];
a[i + 1] -= b[i] - a[i];
}
else {
monster += b[i];
}
}
cout << monster << endl;
return 0;
}
| #include <bits/stdc++.h>
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 monster = 0;
for (int i = 0; i < n; i++) {
if (a[i] + a[i + 1] <= b[i]) { //オーバーキル
monster += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
else if (a[i] <= b[i]) { // i番目のモンスターを全滅させる
monster += b[i];
a[i + 1] -= b[i] - a[i];
}
else {
monster += b[i];
}
}
cout << monster << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,893 | 767,894 | u460608786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
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 count = 0;
int k = a[0];
for (int i = 0; i < n; i++) {
if (k <= b[i]) {
if (a[i + 1] + k <= b[i]) {
count += (k + a[i + 1]);
k = 0;
} else {
count += b[i];
k = (a[i + 1] + k - b[i]);
}
} else {
count += b[i];
k = a[i + 1];
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e9 + 7;
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 count = 0;
int k = a[0];
for (int i = 0; i < n; i++) {
if (k <= b[i]) {
if (a[i + 1] + k <= b[i]) {
count += (k + a[i + 1]);
k = 0;
} else {
count += b[i];
k = (a[i + 1] + k - b[i]);
}
} else {
count += b[i];
k = a[i + 1];
}
}
cout << count << endl;
} | [
"variable_declaration.type.change"
] | 767,900 | 767,901 | u339937125 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define rep(i, x) for (int i = 0; i < x; i++)
#define re(i, x, y) for (int i = x; i < y; i++)
long long INF = 1e9;
const long long mod = 2019;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N), C(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
ans += B[i];
} else if (A[i] + A[i + 1] - B[i] > 0) {
ans += B[i];
A[i + 1] = A[i] + A[i + 1] - B[i];
} else {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define rep(i, x) for (int i = 0; i < x; i++)
#define re(i, x, y) for (int i = x; i < y; i++)
long long INF = 1e9;
const long long mod = 2019;
#define ll long long
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N), C(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
ans += B[i];
} else if (A[i] + A[i + 1] - B[i] > 0) {
ans += B[i];
A[i + 1] = A[i] + A[i + 1] - B[i];
} else {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 767,904 | 767,905 | u110653681 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
float A[100010];
float B[100010];
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
float ans = 0;
for (int i = 0; i < N; i++) {
bool flg = true;
int f = 0;
int life = 0;
while (flg) {
f = A[i] - B[i];
if (f < 0) {
flg = false;
ans += A[i];
life = B[i] - A[i];
f = A[i + 1] - life;
if (f < 0) {
ans += A[i + 1];
A[i + 1] = 0;
} else if (f == 0) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += life;
A[i + 1] = f;
}
} else if (f == 0) {
flg = false;
ans += A[i];
} else {
flg = false;
ans += B[i];
}
}
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
long A[100010];
long B[100010];
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long ans = 0;
for (int i = 0; i < N; i++) {
bool flg = true;
int f = 0;
int life = 0;
while (flg) {
f = A[i] - B[i];
if (f < 0) {
flg = false;
ans += A[i];
life = B[i] - A[i];
f = A[i + 1] - life;
if (f < 0) {
ans += A[i + 1];
A[i + 1] = 0;
} else if (f == 0) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += life;
A[i + 1] = f;
}
} else if (f == 0) {
flg = false;
ans += A[i];
} else {
flg = false;
ans += B[i];
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,909 | 767,910 | u907876524 | cpp |
p02959 | /*
* created : 2019-08-05 00:11:26
* accepted : 2019-08-05 00:17:42
* author : landcold7
*/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#ifndef LOCAL
#define trace(...)
#endif
typedef long long ll;
void solve() {
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;
for (int i = 0; i < n + 1; i++) {
int pr = 0;
if (i > 0) {
pr += b[i - 1];
}
int x = min(pr, a[i]);
ans += x;
a[i] -= x;
if (i < n) {
int y = min(b[i], a[i]);
ans += y;
b[i] -= y;
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| /*
* created : 2019-08-05 00:11:26
* accepted : 2019-08-05 00:17:42
* author : landcold7
*/
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#ifndef LOCAL
#define trace(...)
#endif
typedef long long ll;
void solve() {
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];
}
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
int pr = 0;
if (i > 0) {
pr += b[i - 1];
}
int x = min(pr, a[i]);
ans += x;
a[i] -= x;
if (i < n) {
int y = min(b[i], a[i]);
ans += y;
b[i] -= y;
}
}
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| [
"variable_declaration.type.change"
] | 767,912 | 767,913 | u161007542 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int monst[n + 1];
int defeat[n];
int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}
for (int i = 0; i < n; i++) {
cin >> defeat[i];
}
for (int i = 0; i < n; i++) {
if (monst[i] < defeat[i]) {
int pow = defeat[i] - monst[i];
def += monst[i];
if (monst[i + 1] < pow) {
def += monst[i + 1];
monst[i + 1] = 0;
} else {
monst[i + 1] -= pow;
def += pow;
}
} else {
monst[i] = monst[i] - defeat[i];
def += defeat[i];
}
}
cout << def << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int monst[n + 1];
int defeat[n];
long long int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}
for (int i = 0; i < n; i++) {
cin >> defeat[i];
}
for (int i = 0; i < n; i++) {
if (monst[i] < defeat[i]) {
int pow = defeat[i] - monst[i];
def += monst[i];
if (monst[i + 1] < pow) {
def += monst[i + 1];
monst[i + 1] = 0;
} else {
monst[i + 1] -= pow;
def += pow;
}
} else {
monst[i] = monst[i] - defeat[i];
def += defeat[i];
}
}
cout << def << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,914 | 767,915 | u219241981 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
int monst[n + 1];
int defeat[n];
int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}
for (int i = 0; i < n; i++) {
cin >> defeat[i];
}
for (int i = 0; i < n; i++) {
if (monst[i] < defeat[i]) {
int pow = defeat[i] - monst[i];
def += monst[i];
if (monst[i + 1] < pow) {
def += monst[i + 1];
monst[i + 1] = 0;
} else {
monst[i + 1] -= pow;
def += pow;
}
} else {
monst[i] = monst[i] - defeat[i];
def += defeat[i];
}
}
cout << def << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
using namespace std;
int main() {
int n;
cin >> n;
long long int monst[n + 1];
long long int defeat[n];
long long int def = 0;
for (int i = 0; i <= n; i++) {
cin >> monst[i];
}
for (int i = 0; i < n; i++) {
cin >> defeat[i];
}
for (int i = 0; i < n; i++) {
if (monst[i] < defeat[i]) {
int pow = defeat[i] - monst[i];
def += monst[i];
if (monst[i + 1] < pow) {
def += monst[i + 1];
monst[i + 1] = 0;
} else {
monst[i + 1] -= pow;
def += pow;
}
} else {
monst[i] = monst[i] - defeat[i];
def += defeat[i];
}
}
cout << def << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,914 | 767,917 | u219241981 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &i : a) {
cin >> i;
}
vector<int> b(n);
for (auto &i : b) {
cin >> i;
}
long long num = 0;
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
num += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
num += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i]) {
num += a[i];
b[i] -= a[i];
a[i + 1] = 0;
} else {
num += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << num << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &i : a) {
cin >> i;
}
vector<int> b(n);
for (auto &i : b) {
cin >> i;
}
long long num = 0;
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
num += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
num += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i]) {
num += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
num += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << num << endl;
} | [
"expression.operation.binary.remove"
] | 767,918 | 767,919 | u830782448 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[N + 1];
int B;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int ckill = 0;
for (int i = 0; i < N; i++) {
cin >> B;
if (A[i] - B >= 0) {
ckill += B;
} else {
ckill += A[i];
B -= A[i];
if (A[i + 1] <= B) {
ckill += A[i + 1];
A[i + 1] = 0;
} else {
ckill += B;
A[i + 1] -= B;
}
}
}
cout << ckill << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[N + 1];
int B;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
long long ckill = 0;
for (int i = 0; i < N; i++) {
cin >> B;
if (A[i] >= B) {
ckill += B;
} else {
ckill += A[i];
B -= A[i];
if (A[i + 1] <= B) {
ckill += A[i + 1];
A[i + 1] = 0;
} else {
ckill += B;
A[i + 1] -= B;
}
}
}
cout << ckill << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 767,922 | 767,923 | u236809838 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for (int i = (a); i < (n); i++)
int n;
int a[100010];
// int b[100010];
int main() {
cin >> n;
rep(i, n + 1) cin >> a[i];
int ans = 0;
rep(i, n) {
int b;
cin >> b;
int c1 = min(a[i], b);
int c2 = min(a[i + 1], b - c1);
ans += c1 + c2;
a[i] -= c1;
a[i + 1] -= c2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) REP(i, 0, n)
#define REP(i, a, n) for (int i = (a); i < (n); i++)
int n;
int a[100010];
// int b[100010];
int main() {
cin >> n;
rep(i, n + 1) cin >> a[i];
ll ans = 0;
rep(i, n) {
int b;
cin >> b;
int c1 = min(a[i], b);
int c2 = min(a[i + 1], b - c1);
ans += c1 + c2;
a[i] -= c1;
a[i + 1] -= c2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 767,924 | 767,925 | u227951688 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ll N;
cin >> N;
ll A[100010];
ll B[100010];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll count = 0;
rep(i, N) {
if ((A[i] + A[i + 1]) >= B[i] && B[i] > A[i]) {
count += B[i];
A[i + 1] = A[i + 1] + A[i] - B[i];
}
if (B[i] > (A[i] + A[i + 1])) {
count += A[i] + A[i + 1];
A[i + 1] = 0;
}
if (B[i] <= A[i]) {
count += B[i];
}
}
cout << count << endl;
}
| #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
void Yes() {
cout << "Yes" << endl;
exit(0);
}
void No() {
cout << "No" << endl;
exit(0);
}
int main() {
ll N;
cin >> N;
ll A[100010];
ll B[100010];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll count = 0;
rep(i, N) {
if ((A[i] + A[i + 1]) >= B[i] && B[i] > A[i]) {
count += B[i];
A[i + 1] = A[i + 1] + A[i] - B[i];
} else if (B[i] > (A[i] + A[i + 1])) {
count += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] <= A[i]) {
count += B[i];
}
}
cout << count << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 767,932 | 767,933 | u726501606 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n, mon = 0;
cin >> n;
vector<int> a(n + 1), b(n), f(n), g(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (i == 0) {
f[0] = min(a[0], b[0]);
g[0] = min(a[1], (b[0] - min(a[0], b[0])));
} else {
f[i] = min((a[i] - g[i - 1]), b[i]);
g[i] = min(a[i + 1], (b[i] - f[i]));
}
}
rep(i, n) mon = mon + f[i] + g[i];
cout << mon;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
long n, mon = 0;
cin >> n;
vector<long> a(n + 1), b(n), f(n), g(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (i == 0) {
f[0] = min(a[0], b[0]);
g[0] = min(a[1], (b[0] - min(a[0], b[0])));
} else {
f[i] = min((a[i] - g[i - 1]), b[i]);
g[i] = min(a[i + 1], (b[i] - f[i]));
}
}
rep(i, n) mon = mon + f[i] + g[i];
cout << mon;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,934 | 767,935 | u530358777 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, res = 0;
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];
}
for (int i = 0; i < N; i++) {
if (B[i] >= A[i]) {
res += A[i];
B[i] -= A[i];
A[i] = 0;
if (B[i] >= A[i + 1]) {
res += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
res += B[i];
A[i + 1] -= B[i];
}
} else {
res += B[i];
A[i] -= B[i];
}
}
cout << res << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, res = 0;
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 (B[i] >= A[i]) {
res += A[i];
B[i] -= A[i];
A[i] = 0;
if (B[i] >= A[i + 1]) {
res += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
res += B[i];
A[i + 1] -= B[i];
}
} else {
res += B[i];
A[i] -= B[i];
}
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,938 | 767,939 | u426506117 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, res = 0, minAB = 0;
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];
}
for (int i = 0; i < N; i++) {
minAB = min(A[i], B[i]);
A[i] -= minAB;
B[i] -= minAB;
res += minAB;
minAB = min(A[i + 1], B[i]);
A[i + 1] -= minAB;
B[i] -= minAB;
res += minAB;
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, res = 0, minAB = 0;
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++) {
minAB = min(A[i], B[i]);
A[i] -= minAB;
B[i] -= minAB;
res += minAB;
minAB = min(A[i + 1], B[i]);
A[i + 1] -= minAB;
B[i] -= minAB;
res += minAB;
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,940 | 767,941 | u426506117 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, d;
cin >> n;
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);
}
for (int i = 0; i < n; i++) {
if (b.at(i) - a.at(i) > 0) {
c += a.at(i);
d = b.at(i) - a.at(i);
if (d >= a.at(i + 1)) {
c += a.at(i + 1);
a.at(i + 1) = 0;
} else {
a.at(i + 1) -= d;
c += d;
}
} else
c += b.at(i);
}
cout << c << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n;
long long 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);
}
for (int i = 0; i < n; i++) {
if (b.at(i) - a.at(i) > 0) {
c += a.at(i);
d = b.at(i) - a.at(i);
if (d >= a.at(i + 1)) {
c += a.at(i + 1);
a.at(i + 1) = 0;
} else {
a.at(i + 1) -= d;
c += d;
}
} else
c += b.at(i);
}
cout << c << endl;
} | [
"variable_declaration.remove"
] | 767,942 | 767,943 | u222866518 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, count = 0, save;
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];
}
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i];
b[i] -= a[i];
if (a[i + 1] < b[i]) {
count += a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= b[i];
}
} else {
count += b[i];
}
}
cout << count;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, save;
ll count = 0;
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];
}
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
count += a[i];
b[i] -= a[i];
if (a[i + 1] < b[i]) {
count += a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= b[i];
}
} else {
count += b[i];
}
}
cout << count;
} | [
"variable_declaration.remove",
"variable_declaration.add"
] | 767,946 | 767,947 | u861337693 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, t;
int k = 0;
vector<long long> a;
vector<long long> b;
cin >> n;
for (i = 0; i < n + 1; i = i + 1) {
cin >> t;
a.push_back(t);
}
for (i = 0; i < n; i = i + 1) {
cin >> t;
b.push_back(t);
}
for (i = 0; i < n; i = i + 1) {
if (a.at(i) <= b.at(i)) {
b.at(i) -= a.at(i);
k += a.at(i);
if (a.at(i + 1) >= b.at(i)) {
a.at(i + 1) -= b.at(i);
k += b.at(i);
}
else {
k += a.at(i + 1);
a.at(i + 1) = 0;
}
}
else
k += b.at(i);
}
cout << k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, t;
long long k = 0;
vector<long long> a;
vector<long long> b;
cin >> n;
for (i = 0; i < n + 1; i = i + 1) {
cin >> t;
a.push_back(t);
}
for (i = 0; i < n; i = i + 1) {
cin >> t;
b.push_back(t);
}
for (i = 0; i < n; i = i + 1) {
if (a.at(i) <= b.at(i)) {
b.at(i) -= a.at(i);
k += a.at(i);
if (a.at(i + 1) >= b.at(i)) {
a.at(i + 1) -= b.at(i);
k += b.at(i);
}
else {
k += a.at(i + 1);
a.at(i + 1) = 0;
}
}
else
k += b.at(i);
}
cout << k << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,954 | 767,955 | u854243627 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) Rep(i, 0, b)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()
typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
/*
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}*/
int main() {
int 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 sum = accumulate(allof(a), 0);
// 後ろから貪欲でいい
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
a[i] = max(0LL, a[i] - (b[i] - a[i + 1]));
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
}
}
ll left = accumulate(allof(a), 0);
cout << sum - left << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) Rep(i, 0, b)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()
typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
/*
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}*/
int main() {
int 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 sum = accumulate(allof(a), 0LL);
// 後ろから貪欲でいい
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
a[i] = max(0LL, a[i] - (b[i] - a[i + 1]));
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
}
}
ll left = accumulate(allof(a), 0LL);
cout << sum - left << endl;
return 0;
}
| [
"literal.number.type.widen.change"
] | 767,956 | 767,957 | u725458677 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) Rep(i, 0, b)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()
typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
/*
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}*/
int main() {
int 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];
int sum = accumulate(allof(a), 0);
// 後ろから貪欲でいい
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
a[i] = max(0LL, a[i] - (b[i] - a[i + 1]));
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
}
}
int left = accumulate(allof(a), 0);
cout << sum - left << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define rep(i, b) Rep(i, 0, b)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define allof(a) (a).begin(), (a).end()
typedef long long ll;
const int inf = 1e9 + 7;
const ll infll = 1ll << 60ll;
const ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
/*
// 最大公約数
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
// 最小公倍数
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}*/
int main() {
int 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 sum = accumulate(allof(a), 0LL);
// 後ろから貪欲でいい
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
a[i] = max(0LL, a[i] - (b[i] - a[i + 1]));
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
}
}
ll left = accumulate(allof(a), 0LL);
cout << sum - left << endl;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.type.widen.change"
] | 767,958 | 767,957 | u725458677 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define INF 1e9
typedef long long LL;
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 answer = 0;
rep(i, N + 1) {
LL rest = min(A[i], B[i]);
answer += rest;
LL rest2 = min(A[i + 1], B[i] - rest);
answer += rest2;
A[i + 1] -= rest2;
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
#define INF 1e9
typedef long long LL;
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 answer = 0;
rep(i, N) {
LL rest = min(A[i], B[i]);
answer += rest;
LL rest2 = min(A[i + 1], B[i] - rest);
answer += rest2;
A[i + 1] -= rest2;
}
cout << answer << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 767,963 | 767,964 | u293072892 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
vector<long long> A(n + 1);
vector<long long> B(n);
for (i = 0; i < n + 1; i++)
cin >> A[i];
for (i = 0; i < n; i++)
cin >> B[i];
int num = 0; //"num" is the number of killed monsters
for (i = 0; i < n; i++) {
if (B[i] <= A[i]) {
num = num + B[i];
} else {
num = num + A[i];
if (B[i] - A[i] < A[i + 1]) {
num = num + B[i] - A[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
num = num + A[i + 1];
A[i + 1] = 0;
}
}
}
cout << num << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
vector<long long> A(n + 1);
vector<long long> B(n);
for (i = 0; i < n + 1; i++)
cin >> A[i];
for (i = 0; i < n; i++)
cin >> B[i];
long long num = 0; //"num" is the number of killed monsters
for (i = 0; i < n; i++) {
if (B[i] <= A[i]) {
num = num + B[i];
} else {
num = num + A[i];
if (B[i] - A[i] < A[i + 1]) {
num = num + B[i] - A[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
num = num + A[i + 1];
A[i + 1] = 0;
}
}
}
cout << num << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,965 | 767,966 | u632637990 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n + 1];
int *b = new int[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int z = b[0];
int ans = 0;
for (int i = 0; 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;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n + 1];
int *b = new int[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int z = b[0];
long long ans = 0;
for (int i = 0; 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;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,967 | 767,968 | u769569814 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100000], b[100000], ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i + 1] + a[i] > b[i]) {
ans += b[i];
a[i + 1] = a[i + 1] + a[i] - b[i];
} else {
ans += a[i + 1] + a[i];
a[i + 1] = 0;
}
}
std::cout << ans << std::endl;
} | #include <algorithm>
#include <iostream>
#include <string>
int n = 0, a[100001], b[100000];
long long ans = 0;
int main() {
std::cin >> n;
for (int i = 0; i <= n; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i + 1] + a[i] > b[i]) {
ans += b[i];
a[i + 1] = a[i + 1] + a[i] - b[i];
} else {
ans += a[i + 1] + a[i];
a[i + 1] = 0;
}
}
std::cout << ans << std::endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,969 | 767,970 | u058498493 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
long long A[100010], B[100010];
cin >> N;
int count = 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 (A[i] < B[i]) {
if (B[i] > A[i] + A[i + 1]) {
count += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
count += B[i];
A[i + 1] -= B[i] - A[i];
}
} else {
count += B[i];
}
}
cout << count << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
long long A[100010], B[100010];
cin >> N;
long long count = 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 (A[i] < B[i]) {
if (B[i] > A[i] + A[i + 1]) {
count += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
count += B[i];
A[i + 1] -= B[i] - A[i];
}
} else {
count += B[i];
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,973 | 767,974 | u879436400 | cpp |
p02959 | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
int N, A[100001], B[100000];
ll res;
int main() {
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) {
res += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
res += min(A[i + 1], B[i]);
B[i] -= min(A[i + 1], B[i]);
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define mod998 998244353
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
int N, A[100001], B[100000];
ll res;
int main() {
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) {
res += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
res += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
}
cout << res << endl;
} | [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 767,975 | 767,976 | u015514760 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<ll> b(n);
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]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
ll num = min(a[i + 1], b[i]);
ans += num;
b[i] -= num;
a[i] -= num;
} else {
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<ll> b(n);
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]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
ll num = min(a[i + 1], b[i]);
ans += num;
b[i] -= num;
a[i + 1] -= num;
} else {
ans += b[i];
b[i] = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.change"
] | 767,977 | 767,978 | u677421794 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll res = 0;
rep(i, n) {
ll tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
res += tmp;
tmp = min(b[i], a[i + 1]);
a[i - 1] -= tmp;
res += tmp;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
ll LCM(ll x, ll y) { return x * y / GCD(x, y); }
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll res = 0;
rep(i, n) {
ll tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
res += tmp;
tmp = min(b[i], a[i + 1]);
a[i + 1] -= tmp;
res += tmp;
}
cout << res << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 767,979 | 767,980 | u560381579 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
sum += min(arr[i], v);
v -= arr[i];
if (v > 0) {
sum += min(arr[i + 1], v);
arr[i + 1] -= v;
if (arr[i + 1] < 0)
arr[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> arr[i];
}
long sum = 0;
for (int i = 0; i < N; i++) {
int v;
cin >> v;
sum += min(arr[i], v);
v -= arr[i];
if (v > 0) {
sum += min(arr[i + 1], v);
arr[i + 1] -= v;
if (arr[i + 1] < 0)
arr[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,981 | 767,982 | u965336480 | cpp |
p02959 | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebug) { \
cout << "debug (" #a "):" << endl << (a) << endl; \
}
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
lint n, k;
lint h, w;
bool flagdebug = false;
int main() {
//////////////////////////////////////////////////////
// flagdebug = true; ///本番時削除！！！！！
cin >> n;
vector<lint> a(n + 1);
vector<lint> b(n);
debug("aaa");
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
debug("aaaa");
lint sum = 0;
rep(i, n) {
if (b[i] <= a[i]) {
sum += b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
if (b[i] <= a[i + i]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
// vector<lint> s(n);
// fpair<lint,lint> p = make_pair(1,2);
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
//昇順ソート
// sort(all(a));
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
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;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << "\t";
}
return s;
}
// //合計
// template<class T> lint sum(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0);
// }
// //平均
// template<class T> double ave(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0.0) / a.size();
// }
| #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define debug(a) \
if (flagdebug) { \
cout << "debug (" #a "):" << endl << (a) << endl; \
}
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
lint n, k;
lint h, w;
bool flagdebug = false;
int main() {
//////////////////////////////////////////////////////
// flagdebug = true; ///本番時削除！！！！！
cin >> n;
vector<lint> a(n + 1);
vector<lint> b(n);
debug("aaa");
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
debug("aaaa");
lint sum = 0;
rep(i, n) {
if (b[i] <= a[i]) {
sum += b[i];
b[i] = 0;
} else {
sum += a[i]; //全員倒す
b[i] -= a[i]; //勇者の倒せる数も減る
if (b[i] <= a[i + 1]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
// vector<lint> s(n);
// fpair<lint,lint> p = make_pair(1,2);
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
//昇順ソート
// sort(all(a));
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
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;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << "\t";
}
return s;
}
// //合計
// template<class T> lint sum(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0);
// }
// //平均
// template<class T> double ave(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0.0) / a.size();
// }
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 767,985 | 767,986 | u561976793 | cpp |
p02959 | #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
//#define debug(a) if(flagdebug){cout << "debug (" #a "):" << endl << (a) <<
//endl;}
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
lint n, k;
lint h, w;
bool flagdebug = false;
int main() {
//////////////////////////////////////////////////////
// flagdebug = true; ///本番時削除！！！！！
cin >> n;
vector<lint> a(n + 1);
vector<lint> b(n);
// debug("aaa");
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
// debug("aaaa");
lint sum = 0;
rep(i, n) {
if (b[i] <= a[i]) {
sum += b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
if (b[i] <= a[i + i]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
// vector<lint> s(n);
// fpair<lint,lint> p = make_pair(1,2);
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
//昇順ソート
// sort(all(a));
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
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;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << "\t";
}
return s;
}
// //合計
// template<class T> lint sum(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0);
// }
// //平均
// template<class T> double ave(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0.0) / a.size();
// }
| #include <algorithm> //sort()
#include <iostream>
#include <numeric>
#include <stdlib.h>
#include <tuple>
#include <vector> //vector
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
//#define debug(a) if(flagdebug){cout << "debug (" #a "):" << endl << (a) <<
//endl;}
typedef uint64_t ulint;
typedef int64_t lint;
using namespace std;
template <class T> inline bool chmin(T &a, T b);
template <class T> inline bool chmax(T &a, T b);
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v);
template <class T> lint sum(vector<T> a);
template <class T> double ave(vector<T> a);
lint n, k;
lint h, w;
bool flagdebug = false;
int main() {
//////////////////////////////////////////////////////
// flagdebug = true; ///本番時削除！！！！！
cin >> n;
vector<lint> a(n + 1);
vector<lint> b(n);
// debug("aaa");
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
// debug("aaaa");
lint sum = 0;
rep(i, n) {
if (b[i] <= a[i]) {
sum += b[i];
b[i] = 0;
} else {
sum += a[i]; //全員倒す
b[i] -= a[i]; //勇者の倒せる数も減る
if (b[i] <= a[i + 1]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
// vector<lint> s(n);
// fpair<lint,lint> p = make_pair(1,2);
// tuple<lint,lint,lint> t = make_tuple(1,2,3);
//昇順ソート
// sort(all(a));
// sort(input.begin() , input.end());
// uint64_t max = numeric_limits<uint64_t>::max();
//////////////////////////////////////////////////////
// DP
// // 無限大の値
// const uint64_t INF = (uint64_t)1 << 60;
// //const int64_t NINF = -1 * ((int64_t)1 << 60 );
// // DP テーブル
// uint64_t dp[100010];
// //DPテーブル初期化（最小化用）
// for (int i = 0; i < 100010; ++i)
// {
// //dp[i] = INF;
// dp[i] = 0;
// }
// // 初期条件
// dp[0] = 0;
// // ループ
// for (int i = 1; i <= n; ++i) {
// //chmin( dp[i], dp[i - 1] + abs( input[i] - input[i - 1] ));
// //if (i < 2)continue;
// //chmin( dp[i], dp[i - 2] + abs( input[i] - input[i - 2] ));
// // chmax ( dp [i] , dp[i - 1]);
// // chmax ( dp [i] , dp[i - 1] + input[i]);
// // cout << "dp[" << i <<"] = " << dp[i] << endl;
// }
// //////////////////////////////////////////////////////
// cout << dp[n] << endl;
//////////////////////////////////////////////////////
// Ctrl + Opt + N to make
return 0;
}
//最小化用関数
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;
}
// vectorprint用
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << "\t";
}
return s;
}
// //合計
// template<class T> lint sum(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0);
// }
// //平均
// template<class T> double ave(vector<T> a)
// {
// return std::accumulate(a.begin(), a.end(), 0.0) / a.size();
// }
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 767,987 | 767,988 | u561976793 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll MAX_N = 100000;
int main(void) {
ll N;
ll A[MAX_N + 1], B[MAX_N];
ll answer = 0;
cin >> N;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
if (B[i] >= A[i + 1] + A[i]) {
answer += A[i + 1] + A[i];
A[i + 1] = 0;
}
if (B[i] >= A[i]) {
answer += B[i];
A[i + 1] -= B[i] - A[i];
} else
answer += B[i];
}
cout << answer << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const long double EPS = 1e-9;
const ll mod = 1e9 + 7;
const ll INF = 1e9;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const ll MAX_N = 100000;
int main(void) {
ll N;
ll A[MAX_N + 1], B[MAX_N];
ll answer = 0;
cin >> N;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
if (B[i] >= A[i + 1] + A[i]) {
answer += A[i + 1] + A[i];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
answer += B[i];
A[i + 1] -= B[i] - A[i];
} else
answer += B[i];
}
cout << answer << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 767,991 | 767,992 | u767543103 | cpp |
p02959 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define i64 long long
#define vi32 vector<int>
#define vi64 vector<long long>
#define ii pair<int, int>
const long long mod = 1e9 + 7, inf = 1e9,
linf = 1 << 30; // linf = 9223372036854775807;
const long long hashmod[4] = {(int)1e9 + 2277, (int)1e9 + 5277, (int)1e9 + 8277,
(int)1e9 + 9277};
const long double EPS = 0.000000001L, pi = acos(-1);
using namespace std;
#define pb push_back
#define mp make_pair
#define N 100006
// i64 base = 311;
int dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
int dy[] = {-1, -1, 0, 1, 1, 1, 0, -1};
// God of debug OPP
#define debugg assert
using namespace std;
int main() {
int n;
cin >> n;
vi32 mons(n + 1), hero(n);
for (auto &z : mons)
cin >> z;
for (auto &z : hero)
cin >> z;
int cnt = 0;
for (int i = 0; i < n; i++) {
int l = mons[i];
int r = mons[i + 1];
cnt += min(l, hero[i]);
hero[i] -= min(l, hero[i]);
cnt += min(r, hero[i]);
mons[i + 1] -= min(r, hero[i]);
}
cout << cnt;
}
| #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define i64 long long
#define vi32 vector<int>
#define vi64 vector<long long>
#define ii pair<int, int>
const long long mod = 1e9 + 7, inf = 1e9,
linf = 1 << 30; // linf = 9223372036854775807;
const long long hashmod[4] = {(int)1e9 + 2277, (int)1e9 + 5277, (int)1e9 + 8277,
(int)1e9 + 9277};
const long double EPS = 0.000000001L, pi = acos(-1);
using namespace std;
#define pb push_back
#define mp make_pair
#define N 100006
// i64 base = 311;
int dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
int dy[] = {-1, -1, 0, 1, 1, 1, 0, -1};
// God of debug OPP
#define debugg assert
using namespace std;
int main() {
int n;
cin >> n;
vi32 mons(n + 1), hero(n);
for (auto &z : mons)
cin >> z;
for (auto &z : hero)
cin >> z;
i64 cnt = 0;
for (int i = 0; i < n; i++) {
int l = mons[i];
int r = mons[i + 1];
cnt += min(l, hero[i]);
hero[i] -= min(l, hero[i]);
cnt += min(r, hero[i]);
mons[i + 1] -= min(r, hero[i]);
}
cout << cnt;
}
| [
"variable_declaration.type.change"
] | 768,005 | 768,006 | u215146318 | cpp |
p02959 | #include <bits/stdc++.h>
#define S second
#define F first
#define ld I64d
#include <cstdio>
#ifdef DEBUG
#define D(X) X
#else
#define D(X)
#endif
#define mehh \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define sz(v) (int)v.size()
#define loop(i, v) for (int i = 0; i < sz(v); ++i)
#define PrimeRange(n) (n / log(n))
#define NumOfDigits(n) 1 + (int)log10(n)
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const int N = 2e4, M = 1e6 + 6, OO = 0x3f3f3f3f;
using namespace std;
// int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
// int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int main() {
mehh int n;
cin >> n;
int monsters[n + 1], heros[n];
for (int i = 0; i <= n; ++i)
cin >> monsters[i];
for (int i = 0; i < n; ++i)
cin >> heros[i];
int defeat = 0;
for (int i = 0; i < n; ++i) {
defeat += min(heros[i], monsters[i]);
heros[i] -= min(heros[i], monsters[i]);
defeat += min(heros[i], monsters[i + 1]);
monsters[i + 1] -= min(heros[i], monsters[i + 1]);
}
cout << defeat;
}
| #include <bits/stdc++.h>
#define S second
#define F first
#define ld I64d
#include <cstdio>
#ifdef DEBUG
#define D(X) X
#else
#define D(X)
#endif
#define mehh \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define sz(v) (int)v.size()
#define loop(i, v) for (int i = 0; i < sz(v); ++i)
#define PrimeRange(n) (n / log(n))
#define NumOfDigits(n) 1 + (int)log10(n)
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const int N = 2e4, M = 1e6 + 6, OO = 0x3f3f3f3f;
using namespace std;
// int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
// int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int main() {
mehh ll n;
cin >> n;
ll monsters[n + 1], heros[n];
for (int i = 0; i <= n; ++i)
cin >> monsters[i];
for (int i = 0; i < n; ++i)
cin >> heros[i];
ll defeat = 0;
for (int i = 0; i < n; ++i) {
defeat += min(heros[i], monsters[i]);
heros[i] -= min(heros[i], monsters[i]);
defeat += min(heros[i], monsters[i + 1]);
monsters[i + 1] -= min(heros[i], monsters[i + 1]);
}
cout << defeat;
}
| [
"identifier.change",
"variable_declaration.type.change"
] | 768,007 | 768,008 | u620252570 | cpp |
p02959 | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 100000;
int main() {
int N;
int A[MAX_N + 1];
int B;
std::cin >> N;
for (int i = 0; i < N + 1; ++i) {
std::cin >> A[i];
}
long long max_attack = 0;
for (int i = 0; i < N; ++i) {
std::cin >> B;
int attack1 = std::max(A[i], B);
B -= attack1;
int attack2 = std::max(A[i + 1], B);
A[i + 1] -= attack2;
max_attack += attack1 + attack2;
}
std::cout << max_attack << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 100000;
int main() {
int N;
int A[MAX_N + 1];
int B;
std::cin >> N;
for (int i = 0; i < N + 1; ++i) {
std::cin >> A[i];
}
long long max_attack = 0;
for (int i = 0; i < N; ++i) {
std::cin >> B;
int attack1 = std::min(A[i], B);
B -= attack1;
int attack2 = std::min(A[i + 1], B);
A[i + 1] -= attack2;
max_attack += attack1 + attack2;
}
std::cout << max_attack << std::endl;
return 0;
} | [
"misc.opposites",
"identifier.change"
] | 768,009 | 768,010 | u123023461 | cpp |
p02959 | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else if (a[i + 1] + a[i] >= b) {
s = b;
a[i + 1] -= (b - a[i]);
a[i] = 0;
} else {
s = a[i + 1] + a[i];
a[i + 1] = 0;
a[i] = 0;
}
cnt += s;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else if (a[i + 1] + a[i] >= b) {
s = b;
a[i + 1] -= (b - a[i]);
a[i] = 0;
} else {
s = a[i + 1] + a[i];
a[i + 1] = 0;
a[i] = 0;
}
cnt += s;
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,014 | 768,015 | u422831867 | cpp |
p02959 | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else {
if (a[i + 1] + a[i] >= b) {
s = b;
a[i + 1] -= (b - a[i]);
a[i] = 0;
} else {
s = a[i + 1] + a[i];
a[i + 1] = 0;
a[i] = 0;
}
}
cnt += s;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
int a[100000];
int b, c;
int main(void) {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
cin >> b;
int s = 0;
if (a[i] >= b) {
s = b;
a[i] -= b;
} else if (a[i + 1] + a[i] >= b) {
s = b;
a[i + 1] -= (b - a[i]);
a[i] = 0;
} else {
s = a[i + 1] + a[i];
a[i + 1] = 0;
a[i] = 0;
}
cnt += s;
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,016 | 768,015 | u422831867 | 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 (auto i = 0; i < N + 1; i++)
cin >> A[i];
for (auto i = 0; i < N; i++)
cin >> B[i];
int m = 0;
for (auto i = 0; i < N; i++) {
if (A[i] <= B[i]) {
m += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] < B[i]) {
m += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
m += B[i];
A[i + 1] -= B[i];
B[i] = 0;
}
} else {
m += B[i];
A[i] -= B[i];
B[i] = 0;
}
}
cout << m << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (auto i = 0; i < N + 1; i++)
cin >> A[i];
for (auto i = 0; i < N; i++)
cin >> B[i];
long long m = 0;
for (auto i = 0; i < N; i++) {
if (A[i] <= B[i]) {
m += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] < B[i]) {
m += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
m += B[i];
A[i + 1] -= B[i];
B[i] = 0;
}
} else {
m += B[i];
A[i] -= B[i];
B[i] = 0;
}
}
cout << m << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,017 | 768,018 | u407539638 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#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[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
// 1番目の村での処理
//モンスター＞勇者の許容量なら
if (a[0] <= b[0]) {
ans += a[0];
//勇者の許容量を減らす
b[0] -= a[0];
}
//モンスター＜勇者の許容量なら
else {
ans += b[0];
//勇者の許容量を次に引き継がせない
b[0] = 0;
}
// 2～n-1番目の処理
for (int i = 1; i < n; i++) {
//
if (a[i] <= b[i] + b[i - 1]) {
ans += a[i];
if (a[i] >= b[i - 1]) {
b[i] = b[i] - a[i] + b[i - 1];
}
} else {
ans += b[i] + b[i - 1];
b[i] = 0;
}
}
// n番目の処理
if (a[n] <= b[n - 1]) {
ans += a[n];
} else {
ans += b[n - 1];
}
cout << ans;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
signed 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;
// 1村での処理
//モンスター＞勇者の許容量なら
if (a[0] <= b[0]) {
ans += a[0];
//勇者の許容量を減らす
b[0] -= a[0];
}
//モンスター＜勇者の許容量なら
else {
ans += b[0];
//勇者の許容量を次に引き継がせない
b[0] = 0;
}
// 2～n村目の処理
for (int i = 1; i < n; i++) {
//モンスター＜i-1とiの勇者の許容量のときモンスター数を答えに足す
if (a[i] <= b[i] + b[i - 1]) {
ans += a[i];
//モンスター数がi-1番目の勇者が倒しきれないときi番目の勇者の許容量を減らす
if (a[i] >= b[i - 1]) {
b[i] = b[i] - a[i] + b[i - 1];
}
}
//モンスター＞i-1とi番目の勇者の時勇者の許容量を足す
else {
ans += b[i] + b[i - 1];
b[i] = 0;
}
}
// n+1村の処理
if (a[n] <= b[n - 1]) {
ans += a[n];
} else {
ans += b[n - 1];
}
cout << ans;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,021 | 768,022 | u107555502 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i = 0;
std::cin >> n;
int a[n + 1] = {}, b[n] = {};
long ans = 0;
for (i; i <= n; i++)
cin >> a[i];
for (i; i < n; i++)
cin >> b[i];
for (i; i < n; i++) {
int left = min(a[i], b[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(a[i + 1], b[i]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i = 0;
std::cin >> n;
int a[n + 1] = {}, b[n] = {};
long ans = 0;
for (i = 0; i <= n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
int left = min(a[i], b[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(a[i + 1], b[i]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
cout << ans;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 768,025 | 768,026 | u332153950 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 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];
int beat1 = min(a[i], b[i]);
cnt += beat1;
b[i] -= beat1;
a[i] -= beat1;
int beat2 = min(a[i + 1], b[i]);
cnt += beat2;
b[i] -= beat2;
a[i + 1] -= beat2;
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, cnt = 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];
int beat1 = min(a[i], b[i]);
cnt += beat1;
b[i] -= beat1;
a[i] -= beat1;
int beat2 = min(a[i + 1], b[i]);
cnt += beat2;
b[i] -= beat2;
a[i + 1] -= beat2;
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,027 | 768,028 | u803893892 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long 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];
}
int ans = 0;
for (int i = 0; i < n; i++) {
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;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (i == n - 1) {
if (a[n] > b[i]) {
ans += b[i];
} else {
ans += a[n];
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long 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 ans = 0;
for (int i = 0; i < n; i++) {
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;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (i == n - 1) {
if (a[n] > b[i]) {
ans += b[i];
} else {
ans += a[n];
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,031 | 768,032 | u745852541 | 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 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];
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;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (i == n - 1) {
if (a[n] > b[i]) {
ans += b[i];
} else {
ans += a[n];
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long 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 ans = 0;
for (int i = 0; i < n; i++) {
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;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (i == n - 1) {
if (a[n] > b[i]) {
ans += b[i];
} else {
ans += a[n];
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,033 | 768,032 | u745852541 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long ans = 0;
cin >> n;
vector<long long> a(n + 1), b(n);
for (long long i = 0; i <= n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n; i++) {
cin >> b[i];
}
for (long long i = 0; i < n; i++) {
long long tmp = min(b[i], a[i]);
ans += tmp;
a[i] -= tmp;
b[i] -= tmp;
tmp = min(b[i], a[i + 1]);
ans += tmp;
a[i] -= tmp;
b[i] -= tmp;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
long long ans = 0;
cin >> n;
vector<long long> a(n + 1), b(n);
for (long long i = 0; i <= n; i++) {
cin >> a[i];
}
for (long long i = 0; i < n; i++) {
cin >> b[i];
}
for (long long i = 0; i < n; i++) {
long long tmp = min(b[i], a[i]);
ans += tmp;
a[i] -= tmp;
b[i] -= tmp;
tmp = min(b[i], a[i + 1]);
ans += tmp;
a[i + 1] -= tmp;
b[i] -= tmp;
}
cout << ans << endl;
} | [
"assignment.change"
] | 768,034 | 768,035 | u460426711 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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 sum = 0;
for (int i = 0; i < n; ++i) {
auto tmp = min(a[i], b[i]);
sum += tmp;
a[i] -= tmp;
b[i] -= tmp;
tmp = min(a[i + 1], b[i]);
sum += tmp;
a[i + 1] -= tmp;
b[i] -= tmp;
}
cout << sum << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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 sum = 0;
for (int i = 0; i < n; ++i) {
auto tmp = min(a[i], b[i]);
sum += tmp;
a[i] -= tmp;
b[i] -= tmp;
tmp = min(a[i + 1], b[i]);
sum += tmp;
a[i + 1] -= tmp;
b[i] -= tmp;
}
cout << sum << "\n";
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,038 | 768,039 | u089207262 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)((n)-1)); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 4545
#endif
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> heapq;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// #define int long long int
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
signed main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (auto &&a : A)
cin >> a;
vector<int> B(N);
for (auto &&b : B)
cin >> b;
int ans = 0;
rep(i, SZ(B)) {
int attack = min(A[i], B[i]);
A[i] -= attack;
B[i] -= attack;
ans += attack;
attack = min(A[i + 1], B[i]);
A[i + 1] -= attack;
B[i] -= attack;
ans += attack;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)((n)-1)); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 4545
#endif
typedef long long int lli;
using namespace std;
typedef pair<int, int> ii;
typedef priority_queue<int, vector<int>, greater<int>> heapq;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define int long long int
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
signed main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (auto &&a : A)
cin >> a;
vector<int> B(N);
for (auto &&b : B)
cin >> b;
int ans = 0;
rep(i, SZ(B)) {
int attack = min(A[i], B[i]);
A[i] -= attack;
B[i] -= attack;
ans += attack;
attack = min(A[i + 1], B[i]);
A[i + 1] -= attack;
B[i] -= attack;
ans += attack;
}
cout << ans << endl;
return 0;
}
| [] | 768,040 | 768,041 | u576106056 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int n;
int a[100001];
int b[100001];
int ans;
int main() {
cin >> n;
for (int i = 0; i < (n + 1); i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ans = 0;
int diff = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i] + diff);
int c = a[i] - diff;
if (c < 0) {
c = 0;
}
diff = b[i] - c;
if (diff < 0) {
diff = 0;
}
}
ans += min(a[n], diff);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int n;
int a[1000000];
int b[1000000];
long long ans;
int main() {
cin >> n;
for (int i = 0; i < (n + 1); i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ans = 0;
int diff = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i] + diff);
int c = a[i] - diff;
if (c < 0) {
c = 0;
}
diff = b[i] - c;
if (diff < 0) {
diff = 0;
}
}
ans += min(a[n], diff);
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,057 | 768,058 | u160754729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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 count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
count += B[i];
continue;
} else {
count += A[i];
B[i] -= A[i];
}
if (A[i + 1] >= B[i]) {
count += B[i];
A[i + 1] -= B[i];
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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];
}
long long count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
count += B[i];
continue;
} else {
count += A[i];
B[i] -= A[i];
}
if (A[i + 1] >= B[i]) {
count += B[i];
A[i + 1] -= B[i];
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,059 | 768,060 | u833272463 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &ai : a)
cin >> ai;
for (int &bi : b)
cin >> bi;
int ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
a[i] -= left;
ans += left;
b[i] -= left;
int right = min(a[i + 1], b[i]);
a[i + 1] -= right;
ans += right;
b[i] -= right;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int &ai : a)
cin >> ai;
for (int &bi : b)
cin >> bi;
long long ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
a[i] -= left;
ans += left;
b[i] -= left;
int right = min(a[i + 1], b[i]);
a[i + 1] -= right;
ans += right;
b[i] -= right;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,063 | 768,064 | u624475441 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i <= n; i++) {
if (A[i] <= nokori)
nokori = A[i];
if (B[i] + nokori > A[i]) {
sum += A[i];
nokori = B[i] - (A[i] - nokori);
} else {
sum += B[i] + nokori;
nokori = 0;
}
}
cout << sum;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i <= n; i++) {
if (A[i] <= nokori)
nokori = A[i];
if (B[i] + nokori > A[i]) {
sum += A[i];
nokori = B[i] - (A[i] - nokori);
} else {
sum += B[i] + nokori;
nokori = 0;
}
}
cout << sum;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,065 | 768,066 | u593778400 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
int nokori = 0;
for (int i = 0; i <= n; i++) {
if (A[i] <= nokori)
nokori = A[i];
if (B[i] + nokori > A[i]) {
sum += A[i];
nokori = B[i] - (A[i] - nokori);
} else {
sum += B[i] + nokori;
nokori = 0;
}
}
cout << sum;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i <= n; i++) {
if (A[i] <= nokori)
nokori = A[i];
if (B[i] + nokori > A[i]) {
sum += A[i];
nokori = B[i] - (A[i] - nokori);
} else {
sum += B[i] + nokori;
nokori = 0;
}
}
cout << sum;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,067 | 768,066 | u593778400 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i < n; i++) {
long long hiku = min(A[i], nokori);
sum += min(A[i], nokori + B[i]);
nokori = max(B[i] - (A[i] - hiku), (long long)0);
}
sum += min(A[n], nokori);
cout << sum;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i < n; i++) {
long long hiku = min(A[i], nokori);
sum += min(A[i], nokori + B[i]);
nokori = max(B[i] - (A[i] - hiku), (long long)0);
}
sum += min(A[n], nokori);
cout << sum;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,068 | 768,069 | u593778400 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
int sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i < n; i++) {
long long hiku = min(A[i], nokori);
sum += min(A[i], nokori + B[i]);
nokori = max(B[i] - (A[i] - nokori), (long long)0);
}
sum += min(A[n], nokori);
cout << sum;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 0;
long long sum = 0;
cin >> n;
vector<long long> A;
vector<long long> B;
for (int i = 0; i <= n; i++) {
int a = 0;
cin >> a;
A.push_back(a);
}
for (int i = 0; i < n; i++) {
int a = 0;
cin >> a;
B.push_back(a);
}
long long nokori = 0;
for (int i = 0; i < n; i++) {
long long hiku = min(A[i], nokori);
sum += min(A[i], nokori + B[i]);
nokori = max(B[i] - (A[i] - hiku), (long long)0);
}
sum += min(A[n], nokori);
cout << sum;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 768,071 | 768,069 | u593778400 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
int B;
int res = 0;
for (int i = 0; i < N; ++i) {
cin >> B;
if (A[i] < B) {
if (A[i] + A[i + 1] < B) {
res += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B - A[i];
res += B;
}
} else {
res += B;
}
}
cout << res << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
int B;
long long res = 0;
for (int i = 0; i < N; ++i) {
cin >> B;
if (A[i] < B) {
if (A[i] + A[i + 1] < B) {
res += A[i] + A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B - A[i];
res += B;
}
} else {
res += B;
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,072 | 768,073 | u979452668 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int mon[n + 5];
for (int i = 1; i <= n; i++) {
cin >> mon[i];
}
int hero[n + 1];
for (int i = 1; i < n; i++) {
cin >> hero[i];
}
long long ans = 0;
for (int i = 1; i < n; i++) {
int temp = min(mon[i], hero[i]);
hero[i] -= temp;
mon[i] -= temp;
ans += temp;
temp = min(mon[i + 1], hero[i]);
hero[i] -= temp;
mon[i + 1] -= temp;
ans += temp;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
n++;
int mon[n + 5];
for (int i = 1; i <= n; i++) {
cin >> mon[i];
}
int hero[n + 1];
for (int i = 1; i < n; i++) {
cin >> hero[i];
}
long long ans = 0;
for (int i = 1; i < n; i++) {
int temp = min(mon[i], hero[i]);
hero[i] -= temp;
mon[i] -= temp;
ans += temp;
temp = min(mon[i + 1], hero[i]);
hero[i] -= temp;
mon[i + 1] -= temp;
ans += temp;
}
cout << ans << '\n';
} | [
"expression.unary.arithmetic.add"
] | 768,080 | 768,081 | u422827820 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i < n; i++)
#define fin << '\n'
#define __ << " " <<
#define ___ << " "
#define bash push_back
#define ALL(x) x.begin(), x.end()
#define SWAP(a, b) ((a != b) && (a += b, b = a - b, a -= b))
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vit;
typedef map<string, int> mstit;
typedef vector<pii> vpi;
typedef greater<pii> gpi;
typedef priority_queue<pii, vpi, gpi> dijk;
static const signed int INF = 0x3f3f3f3f;
static const signed long long LINF = 0x3f3f3f3f3f3f3f3fLL;
static const signed int SMOD = 1000000007;
static const signed int NMOD = 1000000009;
static const signed int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
static const signed int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
bool inside(int x, int y, int w, int h) {
return (x >= 0 && y >= 0 && x < w && y < h);
}
template <class T> T abs(T &x) { return x < 0 ? -x : x; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline void solve() {
int n, a[100005], b[100005] = {};
int tmp;
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
cnt += tmp = min(a[i], b[i]);
b[i] -= tmp;
a[i] -= tmp;
cnt += tmp = min(a[i + 1], b[i]);
b[i] -= tmp;
a[i] -= tmp;
}
cout << cnt fin;
}
struct xyz {
xyz() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
};
} xyzzy;
signed main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
#define why(n, x) \
int n; \
while (cin >> n, n != x)
#define iFOR(i, x, n) for (int i = x; i < n; i++)
#define fin << '\n'
#define __ << " " <<
#define ___ << " "
#define bash push_back
#define ALL(x) x.begin(), x.end()
#define SWAP(a, b) ((a != b) && (a += b, b = a - b, a -= b))
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vit;
typedef map<string, int> mstit;
typedef vector<pii> vpi;
typedef greater<pii> gpi;
typedef priority_queue<pii, vpi, gpi> dijk;
static const signed int INF = 0x3f3f3f3f;
static const signed long long LINF = 0x3f3f3f3f3f3f3f3fLL;
static const signed int SMOD = 1000000007;
static const signed int NMOD = 1000000009;
static const signed int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
static const signed int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
bool inside(int x, int y, int w, int h) {
return (x >= 0 && y >= 0 && x < w && y < h);
}
template <class T> T abs(T &x) { return x < 0 ? -x : x; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int qp(int a, ll b, int mo) {
int ans = 1;
do {
if (b & 1)
ans = 1ll * ans * a % mo;
a = 1ll * a * a % mo;
} while (b >>= 1);
return ans;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline void solve() {
int n, a[100005], b[100005] = {};
int tmp;
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
cnt += tmp = min(a[i], b[i]);
b[i] -= tmp;
a[i] -= tmp;
cnt += tmp = min(a[i + 1], b[i]);
b[i] -= tmp;
a[i + 1] -= tmp;
}
cout << cnt fin;
}
struct xyz {
xyz() {
cin.tie(0), ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
};
} xyzzy;
signed main() {
solve();
return 0;
}
| [
"assignment.change"
] | 768,082 | 768,083 | u678146855 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
int A[10001], B[10000];
int sum = 0;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= 1; ++j) {
if (B[i] > A[i + j]) {
B[i] -= A[i + j];
A[i + j] = 0;
} else {
A[i + j] -= B[i];
B[i] = 0;
}
}
}
for (int i = 0; i <= N; ++i) {
sum -= A[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
long long A[100001], B[100000];
long long sum = 0;
cin >> N;
for (int i = 0; i <= N; ++i) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; ++i)
cin >> B[i];
for (int i = 0; i < N; ++i) {
for (int j = 0; j <= 1; ++j) {
if (B[i] > A[i + j]) {
B[i] -= A[i + j];
A[i + j] = 0;
} else {
A[i + j] -= B[i];
B[i] = 0;
}
}
}
for (int i = 0; i <= N; ++i) {
sum -= A[i];
}
cout << sum << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,091 | 768,092 | u599857640 | cpp |
p02959 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[105];
int b[105];
int n;
main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
int sum = 0;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 1; i <= n; ++i)
cin >> b[i];
for (int i = 1; i <= n; ++i) {
int l = max(0ll, b[i] - a[i]);
a[i] = max(0ll, a[i] - b[i]);
a[i + 1] = max(0ll, a[i + 1] - l);
}
for (int i = 1; i <= n + 1; ++i) {
sum -= a[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[100005];
int b[100005];
int n;
main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
int sum = 0;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
sum += a[i];
}
for (int i = 1; i <= n; ++i)
cin >> b[i];
for (int i = 1; i <= n; ++i) {
int l = max(0ll, b[i] - a[i]);
a[i] = max(0ll, a[i] - b[i]);
a[i + 1] = max(0ll, a[i + 1] - l);
}
for (int i = 1; i <= n + 1; ++i) {
sum -= a[i];
}
cout << sum << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,093 | 768,094 | u976418120 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int MOD = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
#define int long long
#define vint vector<int>
#define pint pair<int, int>
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "NO") << endl
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vint 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 = N - 1; i >= 0; i--) {
// B[i]はA[i+1]をぶった雄
dbg(A[i + 1]);
dbg(B[i]);
int tmp = min(A[i + 1], B[i]);
A[i + 1] -= tmp;
B[i] -= tmp;
ans += tmp;
tmp = min(A[i], B[i]);
A[i + 1] -= tmp;
B[i] -= tmp;
ans += tmp;
dbg(tmp);
}
// ans += min(A[0], B[0]);
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const int MOD = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
#define int long long
#define vint vector<int>
#define pint pair<int, int>
#define pb(a) push_back(a)
#define all(v) v.begin(), v.end()
#define dbg(x) cerr << #x << " = " << (x) << endl
#define yn(b) cout << ((b) ? "Yes" : "No") << endl
#define YN(b) cout << ((b) ? "YES" : "NO") << endl
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vint 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 = N - 1; i >= 0; i--) {
// B[i]はA[i+1]をぶった雄
dbg(A[i + 1]);
dbg(B[i]);
int tmp = min(A[i + 1], B[i]);
A[i + 1] -= tmp;
B[i] -= tmp;
ans += tmp;
tmp = min(A[i], B[i]);
A[i] -= tmp;
B[i] -= tmp;
ans += tmp;
dbg(tmp);
}
// ans += min(A[0], B[0]);
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 768,095 | 768,096 | u461044076 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = min(A[0], B[0]);
B[0] = max(0LL, B[0] - A[0]);
for (int i = 1; i <= N; ++i) {
if (i == N) {
//
ans += min(A[i], B[i - 1]);
} else {
ll tmp = B[i - 1] + B[i];
ans += min(A[i], tmp);
B[i] = max(0LL, B[i] - (A[i] - B[i - 1]));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = min(A[0], B[0]);
B[0] = max(0LL, B[0] - A[0]);
for (int i = 1; i <= N; ++i) {
if (i == N) {
ans += min(A[i], B[i - 1]);
} else {
ll tmp = B[i - 1] + B[i];
ans += min(A[i], tmp);
B[i] = max(0LL, B[i] - max(0LL, A[i] - B[i - 1]));
}
}
cout << ans << endl;
}
| [
"call.add",
"call.arguments.change",
"call.arguments.add"
] | 768,099 | 768,100 | u482544950 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.