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 int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int cnt = 0;
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] <= b[i]) {
cnt += a[i];
/* cout << a[i] << " "; */
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
cnt += b[i];
} else {
cnt += a[i + 1];
a[i + 1] = 0;
}
} else {
cnt += b[i];
/* cout << b[i] << " "; */
b[i] = 0;
}
}
/* cout << "\n"; */
cout << cnt << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
int cnt = 0;
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] <= b[i]) {
cnt += a[i];
/* cout << a[i] << " "; */
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
cnt += b[i];
} else {
cnt += a[i + 1];
a[i + 1] = 0;
}
} else {
cnt += b[i];
/* cout << b[i] << " "; */
b[i] = 0;
}
}
/* cout << "\n"; */
cout << cnt << endl;
} | [] | 766,091 | 766,092 | u510749912 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 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++) {
int c = min(a[i], b[i]);
cnt += c;
a[i] -= c;
b[i] -= c;
int d = min(a[i + 1], b[i]);
cnt += d;
a[i + 1] -= d;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long cnt = 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) {
int c = min(a[i], b[i]);
cnt += c;
a[i] -= c;
b[i] -= c;
int d = min(a[i + 1], b[i]);
cnt += d;
a[i + 1] -= d;
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 766,095 | 766,096 | u110859855 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int t = min(a[i], b[i]);
ans += t;
b[i] -= t;
t = min(a[i + 1], b[i]);
ans += t;
a[i + 1] -= t;
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
long 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 ans = 0;
for (int i = 0; i < n; i++) {
int t = min(a[i], b[i]);
ans += t;
b[i] -= t;
t = min(a[i + 1], b[i]);
ans += t;
a[i + 1] -= t;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,104 | 766,105 | u359856428 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
long int A[100010];
int B[100010];
cin >> N;
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long int ans = 0;
for (int i = 0; i < N; ++i) {
long int v1 = A[i];
long int v2 = A[i + 1];
A[i] += A[i + 1];
A[i + 1] = 0;
if (A[i] > B[i]) {
if (v1 >= B[i]) {
ans += B[i];
A[i + 1] = v2;
}
if (v1 < B[i]) {
ans += B[1];
A[i + 1] = A[i] - B[i];
}
}
else if (A[i] == B[i]) {
ans += B[i];
A[i] = 0;
}
else if (A[i] < B[i]) {
ans += A[i];
}
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <new>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
long int A[100010];
long int B[100010];
cin >> N;
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long int ans = 0;
for (int i = 0; i < N; ++i) {
long int v1 = A[i];
long int v2 = A[i + 1];
A[i] += A[i + 1];
A[i + 1] = 0;
if (A[i] > B[i]) {
if (v1 >= B[i]) {
ans += B[i];
A[i + 1] = v2;
} else if (v1 < B[i]) {
ans += B[i];
A[i + 1] = A[i] - B[i];
}
}
else if (A[i] == B[i]) {
ans += B[i];
A[i] = 0;
}
else if (A[i] < B[i]) {
ans += A[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 766,106 | 766,107 | u638221831 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
ans += a[i];
if (a[i + 1] > b[i] - a[i]) {
ans += b[i] - a[i];
a[i + 1] -= (b[i] - a[i]);
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
ll ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
ans += a[i];
if (a[i + 1] > b[i] - a[i]) {
ans += b[i] - a[i];
a[i + 1] -= (b[i] - a[i]);
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [] | 766,110 | 766,111 | u681323954 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N;
cin >> N;
vector<int> mon(N + 1);
rep(i, N + 1) { cin >> mon[i]; }
vector<int> hero(N);
rep(i, N) { cin >> hero[i]; }
int defeat = 0;
rep(i, N) {
if (hero[i] > mon[i]) {
defeat += mon[i];
int diff = hero[i] - mon[i];
defeat += std::min(diff, mon[i + 1]);
mon[i + 1] = std::max(0, mon[i + 1] - diff);
} else {
defeat += hero[i];
}
}
cout << defeat << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
int N;
cin >> N;
vector<int> mon(N + 1);
rep(i, N + 1) { cin >> mon[i]; }
vector<int> hero(N);
rep(i, N) { cin >> hero[i]; }
long long defeat = 0;
rep(i, N) {
if (hero[i] > mon[i]) {
defeat += mon[i];
int diff = hero[i] - mon[i];
defeat += std::min(diff, mon[i + 1]);
mon[i + 1] = std::max(0, mon[i + 1] - diff);
} else {
defeat += hero[i];
}
}
cout << defeat << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,120 | 766,121 | u320027541 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
// ๅฐๆฐ็นไปฅไธๆกๆฐ
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, ans = 0, tmp;
vector<int> a(100001), b(100000);
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int j = 0; j < n; j++)
cin >> b[j];
for (int i = 0; i < n; i++) {
tmp = min(b[i], a[i]);
b[i] -= tmp;
ans += tmp;
tmp = min(b[i], a[i + 1]);
a[i + 1] -= tmp;
ans += tmp;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// ๅฐๆฐ็นไปฅไธๆกๆฐ
// fixed << setprecision(i)
int gcd(int a, int b) { return (a % b == 0 ? b : gcd(b, a % b)); }
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int64_t n, ans = 0, tmp;
vector<int> a(100001), b(100000);
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int j = 0; j < n; j++)
cin >> b[j];
for (int i = 0; i < n; i++) {
tmp = min(b[i], a[i]);
b[i] -= tmp;
ans += tmp;
tmp = min(b[i], a[i + 1]);
a[i + 1] -= tmp;
ans += tmp;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,122 | 766,123 | u652660628 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
int k = min(a[i], b[i]);
a[i] -= k;
ans += k;
int s = min(a[i + 1], b[i] - k);
a[i + 1] -= s;
ans += s;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int k = min(a[i], b[i]);
a[i] -= k;
ans += k;
int s = min(a[i + 1], b[i] - k);
a[i + 1] -= s;
ans += s;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,126 | 766,127 | u075775814 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
else if ((a[i] + a[i + 1]) >= b[i]) {
sum += b[i];
a[i + 1] -= b[i] - a[i];
} else {
sum += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum = 0;
cin >> n;
vector<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];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
else if ((a[i] + a[i + 1]) >= b[i]) {
sum += b[i];
a[i + 1] -= b[i] - a[i];
} else {
sum += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << sum << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,128 | 766,129 | u210555114 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, monster = 0, sum = 0;
cin >> n;
vector<int> city(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
for (int i = 0; i < n; i++) {
if (city.at(i) <= hero.at(i)) {
hero.at(i) -= city.at(i);
city.at(i) = 0;
} else {
city.at(i) -= hero.at(i);
hero.at(i) = 0;
continue;
}
if (city.at(i + 1) <= hero.at(i)) {
hero.at(i) -= city.at(i + 1);
city.at(i + 1) = 0;
} else {
city.at(i + 1) -= hero.at(i);
hero.at(i) = 0;
continue;
}
}
for (int i = 0; i < n + 1; i++) {
sum += city.at(i);
}
cout << monster - sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, monster = 0, sum = 0;
cin >> n;
vector<int> city(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> city.at(i);
monster += city.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
for (int i = 0; i < n; i++) {
if (city.at(i) <= hero.at(i)) {
hero.at(i) -= city.at(i);
city.at(i) = 0;
} else {
city.at(i) -= hero.at(i);
hero.at(i) = 0;
continue;
}
if (city.at(i + 1) <= hero.at(i)) {
hero.at(i) -= city.at(i + 1);
city.at(i + 1) = 0;
} else {
city.at(i + 1) -= hero.at(i);
hero.at(i) = 0;
continue;
}
}
for (int i = 0; i < n + 1; i++) {
sum += city.at(i);
}
cout << monster - sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,132 | 766,133 | u451954557 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mon(n + 1, 0), hero(n, 0);
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++)
cin >> hero[i];
int num = 0;
for (int i = 0, change; i < n; i++) {
change = min(mon[i], hero[i]);
num += change;
change = min(mon[i + 1], hero[i] - change);
num += change;
mon[i + 1] -= change;
}
cout << num;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mon(n + 1, 0), hero(n, 0);
for (int i = 0; i < n + 1; i++) {
cin >> mon[i];
}
for (int i = 0; i < n; i++)
cin >> hero[i];
long long num = 0;
for (int i = 0, change; i < n; i++) {
change = min(mon[i], hero[i]);
num += change;
change = min(mon[i + 1], hero[i] - change);
num += change;
mon[i + 1] -= change;
}
cout << num;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,134 | 766,135 | u004676431 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
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;
int sum = 0;
for (int i = 0; i < n; ++i) {
int mn = min(a.at(i), b.at(i));
a.at(i) -= mn, b.at(i) -= mn;
int mnn = min(a.at(i + 1), b.at(i));
a.at(i + 1) -= mnn;
sum += mn + mnn;
}
cout << sum << "\n"s;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0), ios::sync_with_stdio(false);
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;
int64_t sum = 0;
for (int i = 0; i < n; ++i) {
int mn = min(a.at(i), b.at(i));
a.at(i) -= mn, b.at(i) -= mn;
int mnn = min(a.at(i + 1), b.at(i));
a.at(i + 1) -= mnn;
sum += mn + mnn;
}
cout << sum << "\n"s;
} | [
"variable_declaration.type.primitive.change"
] | 766,140 | 766,141 | u104613587 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (ll i = 0; i < n; ++i) {
cin >> b[i];
}
int beat = 0;
for (ll i = 0; i < n; ++i) {
// ไธๅใ
if (a[i] >= b[i]) { // Aใๅใใใใชใใฎใงๅฏ่ฝใช้ใๅใ
beat += b[i];
a[i] -= b[i];
b[i] -= b[i];
} else { // Aใๅใใใ
beat += a[i];
b[i] -= a[i];
a[i] -= a[i];
}
// ๆใๅใ
if (a[i + 1] >= b[i]) { // ๅใใใใชใ
beat += b[i];
a[i + 1] -= b[i];
b[i] -= b[i];
} else { // ๅใใใ
beat += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] -= a[i + 1];
}
}
/*
cout << endl;
rep(i, n + 1) { cout << a[i] << " "; }
cout << endl;
rep(i, n) { cout << b[i] << " "; }
cout << endl;
*/
cout << beat << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (ll i = 0; i < n; ++i) {
cin >> b[i];
}
ll beat = 0;
for (ll i = 0; i < n; ++i) {
// ไธๅใ
if (a[i] >= b[i]) { // Aใๅใใใใชใใฎใงๅฏ่ฝใช้ใๅใ
beat += b[i];
a[i] -= b[i];
b[i] -= b[i];
} else { // Aใๅใใใ
beat += a[i];
b[i] -= a[i];
a[i] -= a[i];
}
// ๆใๅใ
if (a[i + 1] >= b[i]) { // ๅใใใใชใ
beat += b[i];
a[i + 1] -= b[i];
b[i] -= b[i];
} else { // ๅใใใ
beat += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] -= a[i + 1];
}
}
/*
cout << endl;
rep(i, n + 1) { cout << a[i] << " "; }
cout << endl;
rep(i, n) { cout << b[i] << " "; }
cout << endl;
*/
cout << beat << endl;
} | [
"variable_declaration.type.change"
] | 766,142 | 766,143 | u789673498 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (ll i = 0; i < n; ++i) {
cin >> b[i];
}
int beat = 0;
for (ll i = 0; i < n; ++i) {
// ไธๅใ
ll up = min(a[i], b[i]);
beat += up;
a[i] -= up;
b[i] -= up;
// ๆใๅใ
ll slant = min(a[i + 1], b[i]);
beat += slant;
a[i + 1] -= slant;
b[i] -= slant;
}
/*
cout << endl;
rep(i, n + 1) { cout << a[i] << " "; }
cout << endl;
rep(i, n) { cout << b[i] << " "; }
cout << endl;
*/
cout << beat << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for (ll i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (ll i = 0; i < n; ++i) {
cin >> b[i];
}
ll beat = 0;
for (ll i = 0; i < n; ++i) {
// ไธๅใ
ll up = min(a[i], b[i]);
beat += up;
a[i] -= up;
b[i] -= up;
// ๆใๅใ
ll slant = min(a[i + 1], b[i]);
beat += slant;
a[i + 1] -= slant;
b[i] -= slant;
}
/*
cout << endl;
rep(i, n + 1) { cout << a[i] << " "; }
cout << endl;
rep(i, n) { cout << b[i] << " "; }
cout << endl;
*/
cout << beat << endl;
} | [
"variable_declaration.type.change"
] | 766,144 | 766,145 | u789673498 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int left = min(b[i], a[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(b[i], a[i + 1]);
ans += right;
a[i] -= right;
b[i] -= right;
}
cout << ans;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int left = min(b[i], a[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(b[i], a[i + 1]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
cout << ans;
} | [
"assignment.change"
] | 766,146 | 766,147 | u854685063 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
int left = min(b[i], a[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(b[i], a[i + 1]);
ans += right;
a[i] -= right;
b[i] -= right;
}
cout << ans;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int left = min(b[i], a[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(b[i], a[i + 1]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
cout << ans;
} | [
"variable_declaration.type.change",
"assignment.change"
] | 766,148 | 766,147 | u854685063 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n + 1) {
int left = min(b[i], a[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(b[i], a[i + 1]);
ans += right;
a[i] -= right;
b[i] -= right;
}
cout << ans;
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void p(vector<int> A) {
rep(i, A.size()) { cout << A[i]; }
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int left = min(b[i], a[i]);
ans += left;
a[i] -= left;
b[i] -= left;
int right = min(b[i], a[i + 1]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
cout << ans;
} | [
"variable_declaration.type.change",
"expression.operation.binary.remove",
"assignment.change"
] | 766,149 | 766,147 | u854685063 | cpp |
p02959 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, ans = 0;
cin >> N;
vector<int> avec(N + 1), bvec(N);
for (ll i = 0; i < N + 1; i++)
cin >> avec[i];
for (ll i = 0; i < N; i++)
cin >> bvec[i];
for (ll i = 0; i < N; i++) {
if (avec[i] < bvec[i]) {
ans += min(avec[i] + avec[i + 1], bvec[i]);
avec[i + 1] = max(0, avec[i] + avec[i + 1] - bvec[i]);
} else
ans += bvec[i];
}
cout << ans << endl;
return 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, ans = 0;
cin >> N;
vector<int> avec(N + 1), bvec(N);
for (ll i = 0; i < N + 1; i++)
cin >> avec[i];
for (ll i = 0; i < N; i++)
cin >> bvec[i];
for (ll i = 0; i < N; i++) {
if (avec[i] < bvec[i]) {
ans += min(avec[i] + avec[i + 1], bvec[i]);
avec[i + 1] = max(0, avec[i] + avec[i + 1] - bvec[i]);
} else
ans += bvec[i];
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,152 | 766,153 | u894339989 | cpp |
p02959 | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
rep(i, A.size()) { cin >> A[i]; }
rep(i, B.size()) { cin >> B[i]; }
int ans = 0;
rep(i, N) {
int defeat = min(B[i], A[i]);
ans += defeat;
B[i] -= defeat;
defeat = min(B[i], A[i + 1]);
ans += defeat;
A[i + 1] -= defeat;
}
cout << ans << endl;
return 0;
} | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(void) {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
rep(i, A.size()) { cin >> A[i]; }
rep(i, B.size()) { cin >> B[i]; }
ll ans = 0;
rep(i, N) {
int defeat = min(B[i], A[i]);
ans += defeat;
B[i] -= defeat;
defeat = min(B[i], A[i + 1]);
ans += defeat;
A[i + 1] -= defeat;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,155 | 766,156 | u552058878 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 c = 0;
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
c += b[i];
} else if (b[i] <= a[i] + a[i + 1]) {
c += b[i];
a[i + 1] -= (b[i] - a[i]);
} else if (b[i] > a[i] + a[i + 1]) {
c += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << c;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 long c = 0;
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
c += b[i];
} else if (b[i] <= a[i] + a[i + 1]) {
c += b[i];
a[i + 1] -= (b[i] - a[i]);
} else if (b[i] > a[i] + a[i + 1]) {
c += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << c;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,157 | 766,158 | u891945807 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 c = 0;
for (int i = 0; i < n + 1; i++) {
if (b[i] <= a[i]) {
c += b[i];
} else if (b[i] <= a[i] + a[i + 1]) {
c += b[i];
a[i + 1] -= (b[i] - a[i]);
} else if (b[i] > a[i] + a[i + 1]) {
c += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << c;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
long long dp[100005];
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 long c = 0;
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
c += b[i];
} else if (b[i] <= a[i] + a[i + 1]) {
c += b[i];
a[i + 1] -= (b[i] - a[i]);
} else if (b[i] > a[i] + a[i + 1]) {
c += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << c;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,159 | 766,158 | u891945807 | cpp |
p02959 | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
int n;
cin >> n;
vector<int> city(n + 1);
rep(i, n + 1) {
cin >> city[i];
// cerr<<city[i]<<" ";
}
int x, ans = 0;
rep(i, n) {
cin >> x;
if (x > city[i]) {
//ๆฌกใฎ่กใๅใๅใฃใฆใใพใใใฟใผใณ
if (x >= city[i] + city[i + 1]) {
ans += city[i] + city[i + 1];
city[i] = 0;
city[i + 1] = 0;
} else {
ans += x;
city[i + 1] -= x - city[i];
city[i] = 0;
}
} else {
ans += x;
city[i] -= x;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point {
int x;
int y;
};
int i, j, k, count1 = 0, count2 = 0;
int main() {
long long int n;
cin >> n;
vector<long long int> city(n + 1);
rep(i, n + 1) {
cin >> city[i];
// cerr<<city[i]<<" ";
}
long long int x, ans = 0;
rep(i, n) {
cin >> x;
if (x > city[i]) {
//ๆฌกใฎ่กใๅใๅใฃใฆใใพใใใฟใผใณ
if (x >= city[i] + city[i + 1]) {
ans += city[i] + city[i + 1];
city[i] = 0;
city[i + 1] = 0;
} else {
ans += x;
city[i + 1] -= x - city[i];
city[i] = 0;
}
} else {
ans += x;
city[i] -= x;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 766,160 | 766,161 | u225660136 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n), b(n);
ll sum1 = 0;
rep(i, n + 1) {
cin >> a[i];
sum1 += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] <= a[i])
a[i] -= b[i];
else if (b[i] <= a[i] + a[i + 1]) {
a[i + 1] -= b[i] - a[i];
a[i] = 0;
} else {
a[i] = 0;
a[i + 1] = 0;
}
}
ll sum2 = 0;
rep(i, n + 1) sum2 += a[i];
cout << sum1 - sum2;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
ll sum1 = 0;
rep(i, n + 1) {
cin >> a[i];
sum1 += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (b[i] <= a[i])
a[i] -= b[i];
else if (b[i] <= a[i] + a[i + 1]) {
a[i + 1] -= b[i] - a[i];
a[i] = 0;
} else {
a[i] = 0;
a[i + 1] = 0;
}
}
ll sum2 = 0;
rep(i, n + 1) sum2 += a[i];
cout << sum1 - sum2;
}
| [
"assignment.change"
] | 766,162 | 766,163 | u826608257 | cpp |
p02959 | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
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 sum = 0;
for (int i = 0; i < N; i++) {
sum += min(A[i], B[i]);
A[i] -= min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
sum += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
// if (A[i] <= B[i])
// {
// sum += A[i];
// B[i] -= A[i];
// if (A[i + 1] <= B[i] && B[i] > 0)
// {
// sum += A[i + 1];
// B[i] -= A[i + 1];
// }
// else if (A[i + 1] >= B[i] && B[i] > 0)
// {
// sum += B[i];
// A[i + 1] -= B[i];
// }
// }
// else
// {
// sum += B[i];
// A[i] -= B[i];
// }
}
cout << sum << endl;
return (0);
} | #include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const double EPS = 1e-10;
int main(void) {
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 sum = 0;
for (int i = 0; i < N; i++) {
sum += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
A[i] -= min(A[i], B[i]);
sum += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
// if (A[i] <= B[i])
// {
// sum += A[i];
// B[i] -= A[i];
// if (A[i + 1] <= B[i] && B[i] > 0)
// {
// sum += A[i + 1];
// B[i] -= A[i + 1];
// }
// else if (A[i + 1] >= B[i] && B[i] > 0)
// {
// sum += B[i];
// A[i + 1] -= B[i];
// }
// }
// else
// {
// sum += B[i];
// A[i] -= B[i];
// }
}
cout << sum << endl;
return (0);
} | [
"assignment.add"
] | 766,165 | 766,166 | u027946359 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n) {
for (int i = 0; i <= n; i++) {
if (i * i == n) {
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (size_t i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (size_t i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (size_t i = 0; i < n; i++) {
if (a[i] < b[i]) {
ans += a[i];
if (a[i + 1] < b[i] - a[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n) {
for (int i = 0; i <= n; i++) {
if (i * i == n) {
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (size_t i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (size_t i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (size_t i = 0; i < n; i++) {
if (a[i] < b[i]) {
ans += a[i];
if (a[i + 1] < b[i] - a[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,167 | 766,168 | u319279308 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
int num = 0;
for (int k = 0; k < n; k++) {
if (a[k] >= b[k]) {
num = num + b[k];
a[k] = a[k] - b[k];
} else if (a[k] < b[k] && b[k] - a[k] <= a[k + 1]) {
num = num + b[k];
a[k + 1] = a[k + 1] - (b[k] - a[k]);
a[k] = 0;
} else if (a[k] < b[k] && b[k] - a[k] > a[k + 1]) {
num = num + a[k] + a[k + 1];
a[k] = 0;
a[k + 1] = 0;
}
}
cout << num << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int j = 0; j < n; j++) {
cin >> b[j];
}
long long num = 0;
for (int k = 0; k < n; k++) {
if (a[k] >= b[k]) {
num = num + b[k];
a[k] = a[k] - b[k];
} else if (a[k] < b[k] && b[k] - a[k] <= a[k + 1]) {
num = num + b[k];
a[k + 1] = a[k + 1] - (b[k] - a[k]);
a[k] = 0;
} else if (a[k] < b[k] && b[k] - a[k] > a[k + 1]) {
num = num + a[k] + a[k + 1];
a[k] = 0;
a[k + 1] = 0;
}
}
cout << num << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,169 | 766,170 | u298272335 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
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;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
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;
} | [
"variable_declaration.type.change"
] | 766,173 | 766,174 | u711193305 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, *A, *B, ans = 0, M;
cin >> N;
A = new int[N + 1];
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];
}
M = A[N];
for (int i = N - 1; 0 <= i; i--) {
M += A[i];
if (B[i] >= M) {
ans += M;
M = 0;
} else {
ans += B[i];
M = min(A[i], M - B[i]);
}
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, *A, *B, ans = 0, M;
cin >> N;
A = new long long int[N + 1];
B = new long long int[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
M = A[N];
for (int i = N - 1; 0 <= i; i--) {
M += A[i];
if (B[i] >= M) {
ans += M;
M = 0;
} else {
ans += B[i];
M = min(A[i], M - B[i]);
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 766,175 | 766,176 | u401139594 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
ll dis;
ll roop;
};
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
//ๅพใใใๅใในใใงใใ
ll ans = 0;
for (ll i = N - 1; i >= 0; --i) {
if (B[i] - A[i + 1] >= 0) //ใพใ ไฝๅใใใๅ ดๅ
{
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
A[i + 1] = 0;
} else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
} else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
ll dis;
ll roop;
};
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
//ๅพใใใๅใในใใงใใ
ll ans = 0;
for (ll i = N - 1; i >= 0; --i) {
if (B[i] - A[i + 1] >= 0) //ใพใ ไฝๅใใใๅ ดๅ
{
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
} else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 766,177 | 766,178 | u110044127 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
ll dis;
ll roop;
};
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N) cin >> A[i];
rep(i, N) cin >> B[i];
//ๅพใใใๅใในใใงใใ
ll ans = 0;
for (ll i = N - 1; i >= 0; --i) {
if (B[i] - A[i + 1] >= 0) //ใพใ ไฝๅใใใๅ ดๅ
{
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
A[i + 1] = 0;
} else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
} else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll(i) = 0; i < (ll)(n); ++i)
#define MD 998244353
using namespace std;
struct str {
ll dis;
ll roop;
};
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
//ๅพใใใๅใในใใงใใ
ll ans = 0;
for (ll i = N - 1; i >= 0; --i) {
if (B[i] - A[i + 1] >= 0) //ใพใ ไฝๅใใใๅ ดๅ
{
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
} else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove"
] | 766,179 | 766,178 | u110044127 | cpp |
p02959 | #include <iostream>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], b[N], ans = 0;
int main() {
scanf("%d", &n);
n++;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n - 1; i++)
scanf("%d", &b[i]);
for (int i = 0; i < n - 1; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
printf("%d", ans);
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 10;
int n, a[N], b[N];
long long ans = 0;
int main() {
scanf("%d", &n);
n++;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n - 1; i++)
scanf("%d", &b[i]);
for (int i = 0; i < n - 1; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
printf("%lld", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,180 | 766,181 | u158034688 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N;
cin >> N;
vector<ll> monsters(N + 1);
rep(i, N + 1) { cin >> monsters[i]; }
ll helpFromPrev, ans;
helpFromPrev = 0;
ans = 0;
rep(i, N) {
ll b;
cin >> b;
if (helpFromPrev + b > monsters[i]) {
ans += monsters[i];
helpFromPrev = helpFromPrev + b - monsters[i];
} else {
ans += helpFromPrev + b;
helpFromPrev = 0;
}
}
ans += min(helpFromPrev, monsters[N]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N;
cin >> N;
vector<ll> monsters(N + 1);
rep(i, N + 1) { cin >> monsters[i]; }
ll helpFromPrev, ans;
helpFromPrev = 0;
ans = 0;
rep(i, N) {
ll b;
cin >> b;
if (helpFromPrev + b > monsters[i]) {
ans += monsters[i];
helpFromPrev = min(b, helpFromPrev + b - monsters[i]);
} else {
ans += helpFromPrev + b;
helpFromPrev = 0;
}
}
ans += min(helpFromPrev, monsters[N]);
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 766,182 | 766,183 | u225642513 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100001];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 1; i <= n; i++) {
int now = min(b[i], a[i]);
a[i] -= now;
b[i] -= now;
ans += now;
now = min(b[i], a[i + 1]);
a[i] -= now;
b[i] -= now;
ans += now;
}
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100001];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 1; i <= n; i++) {
int now = min(b[i], a[i]);
a[i] -= now;
b[i] -= now;
ans += now;
now = min(b[i], a[i + 1]);
a[i + 1] -= now;
b[i] -= now;
ans += now;
}
cout << ans << '\n';
} | [
"assignment.change"
] | 766,184 | 766,185 | u216283258 | cpp |
p02959 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int gcd(int a, int b) {
if (a == b) {
return a;
} else if (a > b) {
return gcd(a - b, b);
} else {
return gcd(a, b - a);
}
}
int main() {
std::cout << std::setprecision(9);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int first = min(a.at(i), b.at(i));
ans += first;
b.at(i) -= first;
int second = min(a.at(i + 1), b.at(i));
ans += second;
a.at(i + 1) -= second;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear();
} else {
item += ch;
}
}
if (!item.empty()) {
elems.push_back(item);
}
return elems;
}
string to_str_with_zero(int i, int w) {
ostringstream sout;
sout << std::setfill('0') << std::setw(w) << i;
string s = sout.str();
return s;
}
int gcd(int a, int b) {
if (a == b) {
return a;
} else if (a > b) {
return gcd(a - b, b);
} else {
return gcd(a, b - a);
}
}
int main() {
std::cout << std::setprecision(9);
int n;
cin >> n;
vector<long> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<long> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long ans = 0;
for (int i = 0; i < n; i++) {
long first = min(a.at(i), b.at(i));
ans += first;
b.at(i) -= first;
long second = min(a.at(i + 1), b.at(i));
ans += second;
a.at(i + 1) -= second;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,189 | 766,190 | u572622695 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> enemy(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> enemy.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (hero.at(i) > enemy.at(i)) {
count += enemy.at(i);
hero.at(i) -= enemy.at(i);
enemy.at(i) = 0;
if (hero.at(i) > enemy.at(i + 1)) {
count += enemy.at(i + 1);
hero.at(i) -= enemy.at(i + 1);
enemy.at(i + 1) = 0;
} else {
count += hero.at(i);
enemy.at(i + 1) -= hero.at(i);
hero.at(i) = 0;
}
} else {
count += hero.at(i);
enemy.at(i) -= hero.at(i);
hero.at(i) = 0;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> enemy(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> enemy.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
long count = 0;
for (int i = 0; i < n; i++) {
if (hero.at(i) > enemy.at(i)) {
count += enemy.at(i);
hero.at(i) -= enemy.at(i);
enemy.at(i) = 0;
if (hero.at(i) > enemy.at(i + 1)) {
count += enemy.at(i + 1);
hero.at(i) -= enemy.at(i + 1);
enemy.at(i + 1) = 0;
} else {
count += hero.at(i);
enemy.at(i + 1) -= hero.at(i);
hero.at(i) = 0;
}
} else {
count += hero.at(i);
enemy.at(i) -= hero.at(i);
hero.at(i) = 0;
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,193 | 766,194 | u650603304 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
const int c = max(0, b[i] - a[i + 1]);
ans += b[i] - c;
ans += min(a[i], c);
a[i] = max(0, a[i] - c);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long long int ans = 0;
/*
for (int i = 0; i < n; ++i) {
const int c = min(a[i], b[i]);
b[i] -= c;
ans += c;
const int d = min(a[i+1], b[i]);
a[i+1] -= d;
ans += d;
}
/*/
for (int i = n - 1; i >= 0; --i) {
const int c = max(0, b[i] - a[i + 1]);
ans += b[i] - c;
ans += min(a[i], c);
a[i] = max(0, a[i] - c);
}
//*/
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 766,200 | 766,201 | u928627615 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
const int c = min(a[i], b[i]);
b[i] -= c;
ans += c;
const int d = min(a[i + 1], b[i]);
a[i + 1] -= d;
ans += d;
}
/*
for (int i = n-1; i >= 0; --i) {
const int c = max(0, b[i] - a[i+1]);
ans += b[i] - c;
ans += min(a[i], c);
a[i] = max(0, a[i] - c);
}
*/
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long long int ans = 0;
for (int i = 0; i < n; ++i) {
const int c = min(a[i], b[i]);
b[i] -= c;
ans += c;
const int d = min(a[i + 1], b[i]);
a[i + 1] -= d;
ans += d;
}
/*
for (int i = n-1; i >= 0; --i) {
const int c = max(0, b[i] - a[i+1]);
ans += b[i] - c;
ans += min(a[i], c);
a[i] = max(0, a[i] - c);
}
*/
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 766,202 | 766,203 | u928627615 | cpp |
p02959 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; i++)
#define out(s) cout << s << endl
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int x = 0;
ll ans = 0;
rep(i, n) {
x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
return 0;
}
| //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; i++)
#define out(s) cout << s << endl
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
vector<int> b(n + 1);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int x = 0;
ll ans = 0;
rep(i, n) {
x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,204 | 766,205 | u332253305 | cpp |
p02959 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; i++)
#define out(s) cout << s << endl
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int x = 0;
int ans = 0;
rep(i, n) {
x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
return 0;
}
| //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; i++)
#define out(s) cout << s << endl
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
vector<int> b(n + 1);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int x = 0;
ll ans = 0;
rep(i, n) {
x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 766,206 | 766,205 | u332253305 | cpp |
p02959 | //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define out(s) cout << s << endl
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int x = 0;
int ans = 0;
rep(i, n) {
x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
return 0;
}
| //
// main.cpp
// AC
//
// Created by makinofuya on 2019/07/08.
// Copyright ยฉ 2019 makinofuya. All rights reserved.
//
#include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define mod 1000000007
#define rep(i, n) for (int i = 1; i <= n; i++)
#define out(s) cout << s << endl
int main() {
int n;
cin >> n;
vector<int> a(n + 2);
vector<int> b(n + 1);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int x = 0;
ll ans = 0;
rep(i, n) {
x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
return 0;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 766,207 | 766,205 | u332253305 | cpp |
p02959 | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
const double pi = 2 * acos(0);
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define sq(a) (a) * (a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z, x) cout << "Case " << z << ": " << x << "\n"
int main() {
int i, n, x, s = 0;
cin >> n;
vi a(n + 1), b(n);
for0(i, n + 1) cin >> a[i];
for0(i, n) cin >> b[i];
for0(i, n) {
x = min(b[i], a[i]);
s += x;
b[i] -= x;
if (b[i]) {
x = min(b[i], a[i + 1]);
a[i + 1] -= x;
s += x;
}
}
cout << s << nw;
return 0;
} | //#include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vii;
const double pi = 2 * acos(0);
#define pf printf
#define sf scanf
#define pb(a) push_back(a)
#define mp make_pair
#define fi first
#define se second
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (ll i = 1; i <= n; i++)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define sq(a) (a) * (a)
#define nw "\n"
#define abs(x) fabs(x)
#define pcase(z, x) cout << "Case " << z << ": " << x << "\n"
int main() {
ll i, n, x, s = 0;
cin >> n;
vi a(n + 1), b(n);
for0(i, n + 1) cin >> a[i];
for0(i, n) cin >> b[i];
for0(i, n) {
x = min(b[i], a[i]);
s += x;
b[i] -= x;
if (b[i]) {
x = min(b[i], a[i + 1]);
a[i + 1] -= x;
s += x;
}
}
cout << s << nw;
return 0;
} | [
"preprocessor.define.value.change",
"variable_declaration.type.change"
] | 766,208 | 766,209 | u339430228 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, y, counter = 0;
cin >> n;
long 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];
}
for (int i = 0; i < n; i++) {
m = a[i] - b[i];
if (m > 0) {
counter = counter + m;
b[i] = 0;
} else {
counter = counter + a[i];
b[i] = b[i] - a[i];
a[i] = 0;
}
if (b[i] > 0) {
y = a[i + 1] - b[i];
if (y > 0) {
counter = counter + b[i];
a[i + 1] = a[i + 1] - b[i];
} else {
counter = counter + a[i + 1];
a[i + 1] = 0;
}
}
}
// for (int i = 0; i < n+1; i++)
// {
// cout << a[i];
// }
cout << counter;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, y, counter = 0;
cin >> n;
long 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];
}
for (int i = 0; i < n; i++) {
m = a[i] - b[i];
if (m > 0) {
counter = counter + b[i];
b[i] = 0;
} else {
counter = counter + a[i];
b[i] = b[i] - a[i];
a[i] = 0;
}
if (b[i] > 0) {
y = a[i + 1] - b[i];
if (y > 0) {
counter = counter + b[i];
a[i + 1] = a[i + 1] - b[i];
} else {
counter = counter + a[i + 1];
a[i + 1] = 0;
}
}
}
// for (int i = 0; i < n+1; i++)
// {
// cout << a[i];
// }
cout << counter;
return 0;
} | [
"assignment.value.change",
"expression.operation.binary.change"
] | 766,214 | 766,215 | u094861294 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
vector<int> yushas(N);
for (int i = 0; i < N + 1; i++) {
cin >> cities.at(i);
}
for (int i = 0; i < N; i++) {
cin >> yushas.at(i);
}
int64_t sum = 0;
int tmp = 0;
for (int i = 0; i < N + 1; i++) {
int yusha = 0;
if (i < N) {
yusha = yushas[i];
}
int city = cities[i];
sum += min(city, yusha + tmp);
if (yusha > city - tmp) {
tmp = yusha - (city - tmp);
} else {
tmp = 0;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> cities(N + 1);
vector<int> yushas(N);
for (int i = 0; i < N + 1; i++) {
cin >> cities.at(i);
}
for (int i = 0; i < N; i++) {
cin >> yushas.at(i);
}
int64_t sum = 0;
int tmp = 0;
for (int i = 0; i < N + 1; i++) {
int yusha = 0;
if (i < N) {
yusha = yushas[i];
}
int city = cities[i];
sum += min(city, yusha + tmp);
if (yusha > city - tmp) {
tmp = yusha - max((city - tmp), 0);
} else {
tmp = 0;
}
}
cout << sum << endl;
return 0;
} | [
"call.add",
"call.arguments.add"
] | 766,216 | 766,217 | u651314218 | cpp |
p02959 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
using namespace std;
int main() {
int n = 2;
cin >> n;
int a[n + 1], b[n];
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
int val;
int ans = 0;
REP(i, n) {
// i็ช็ฎใฎๅ่
ใi็ช็ฎใฎ่กใฎๆต
val = min(b[i], a[i]);
ans += val;
b[i] -= val;
// i็ช็ฎใฎๅ่
ใฎๆฎใKillๆฐใi+1็ช็ฎใฎ่กใฎๆต
val = min(b[i], a[i + 1]);
ans += val;
a[i + 1] -= val;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
using namespace std;
int main() {
int n = 2;
cin >> n;
int a[n + 1], b[n];
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
int val;
long long ans = 0;
REP(i, n) {
// i็ช็ฎใฎๅ่
ใi็ช็ฎใฎ่กใฎๆต
val = min(b[i], a[i]);
ans += val;
b[i] -= val;
// i็ช็ฎใฎๅ่
ใฎๆฎใKillๆฐใi+1็ช็ฎใฎ่กใฎๆต
val = min(b[i], a[i + 1]);
ans += val;
a[i + 1] -= val;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,218 | 766,219 | u748795013 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A.at(i);
for (int i = 0; i < N; ++i)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i))
cnt += B.at(i);
else {
if (A.at(i) + A.at(i + 1) <= B.at(i)) {
cnt += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else {
cnt += B.at(i);
A.at(i + 1) -= (B.at(i) - A.at(i));
}
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i)
cin >> A.at(i);
for (int i = 0; i < N; ++i)
cin >> B.at(i);
long long int cnt = 0;
for (int i = 0; i < N; ++i) {
if (A.at(i) >= B.at(i))
cnt += B.at(i);
else {
if (A.at(i) + A.at(i + 1) <= B.at(i)) {
cnt += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else {
cnt += B.at(i);
A.at(i + 1) -= (B.at(i) - A.at(i));
}
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.widen.change"
] | 766,220 | 766,221 | u107338145 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) {
sum += min(a[i], b[i]);
b[i] -= a[i];
if (b[i] > 0) {
sum += min(b[i], a[i + 1]);
a[i + 1] -= b[i];
if (a[i + 1 < 0])
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) {
sum += min(a[i], b[i]);
b[i] -= a[i];
if (b[i] > 0) {
sum += min(b[i], a[i + 1]);
a[i + 1] -= b[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 766,224 | 766,225 | u077104253 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
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];
}
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
count += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
count += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (a[i + 1] <= b[i]) {
count += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
cout << count << '\n';
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, count = 0;
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];
}
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
count += a[i];
b[i] -= a[i];
a[i] = 0;
} else {
count += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (a[i + 1] <= b[i]) {
count += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
count += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
cout << count << '\n';
}
| [
"variable_declaration.type.widen.change"
] | 766,226 | 766,227 | u021083776 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
int main() {
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 ans = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - b[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e17;
const int INF = 1e9;
const double PI = acos(-1);
const double EPS = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
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 = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] = max(0ll, a[i + 1] - b[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 766,228 | 766,229 | u340010271 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
cin >> n;
vector<int> a(n + 1, 0);
vector<int> b(n, 0);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
int copy;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
// cout<<"a"<<endl;
sum += a[i];
copy = a[i];
a[i] = 0;
b[i] -= copy;
if (b[i] > 0) {
if (b[i] > a[i + 1]) {
sum += a[i + 1];
copy = a[i + 1];
a[i + 1] = 0;
// b[i]-=copy;
} else if (b[i] <= a[i + 1]) {
sum += b[i];
a[i + 1] -= b[i];
// b[i]=0;
}
}
/*
rep(i,n+1) cout<<a[i]<<" ";
cout<<endl;
rep(i,n) cout<<b[i]<<" ";
cout<<endl;
cout<<"sum"<<sum<<endl;
*/
} else if (b[i] <= a[i]) {
// cout<<"b"<<endl;
sum += b[i];
a[i] -= b[i];
b[i] = 0;
/*
rep(i,n+1) cout<<a[i]<<" ";
cout<<endl;
rep(i,n) cout<<b[i]<<" ";
cout<<endl;
cout<<sum<<endl;
*/
}
// cout<<endl;
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
ll n;
int main() {
cin >> n;
vector<int> a(n + 1, 0);
vector<int> b(n, 0);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll sum = 0;
int copy;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
// cout<<"a"<<endl;
sum += a[i];
copy = a[i];
a[i] = 0;
b[i] -= copy;
if (b[i] > 0) {
if (b[i] > a[i + 1]) {
sum += a[i + 1];
copy = a[i + 1];
a[i + 1] = 0;
// b[i]-=copy;
} else if (b[i] <= a[i + 1]) {
sum += b[i];
a[i + 1] -= b[i];
// b[i]=0;
}
}
/*
rep(i,n+1) cout<<a[i]<<" ";
cout<<endl;
rep(i,n) cout<<b[i]<<" ";
cout<<endl;
cout<<"sum"<<sum<<endl;
*/
} else if (b[i] <= a[i]) {
// cout<<"b"<<endl;
sum += b[i];
a[i] -= b[i];
b[i] = 0;
/*
rep(i,n+1) cout<<a[i]<<" ";
cout<<endl;
rep(i,n) cout<<b[i]<<" ";
cout<<endl;
cout<<sum<<endl;
*/
}
// cout<<endl;
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,239 | 766,240 | u418810472 | cpp |
p02959 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n;
std::cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) std::cin >> a[i];
rep(i, n) std::cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
ans += a[i];
ans += min(a[i + 1], b[i] - a[i]);
b[i] = max(0, a[i + 1] - (b[i] - a[i]));
} else
ans += b[i];
}
std::cout << ans << "\n";
}
| #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) for (int i = s; i <= t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
using pi = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using ld = long double;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
rep(i, (int)v.size()) {
if (i)
os << ",";
os << v[i];
}
os << "}";
return os;
}
template <typename T, size_t S> void printArray(const T (&array)[S]) {
for (auto val : array)
std::cout << val << ", ";
std::cout << "\n";
}
const int mod = 1e9 + 7;
const int inf = 1e9 + 5;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
int n;
std::cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) std::cin >> a[i];
rep(i, n) std::cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
ans += a[i];
ans += min(a[i + 1], b[i] - a[i]);
a[i + 1] = max(0, a[i + 1] - (b[i] - a[i]));
} else
ans += b[i];
}
std::cout << ans << "\n";
}
| [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 766,241 | 766,242 | u700484101 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define pi pair<int, int>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
int sum = 0;
cinf(n + 1, a);
cinf(n, b);
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
if (b[i] - a[i] < a[i + 1]) {
sum += b[i];
a[i + 1] -= (b[i] - a[i]);
} else {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
}
} else {
sum += b[i];
}
}
cout << sum;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define pi pair<int, int>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
ll sum = 0;
cinf(n + 1, a);
cinf(n, b);
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
if (b[i] - a[i] < a[i + 1]) {
sum += b[i];
a[i + 1] -= (b[i] - a[i]);
} else {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
}
} else {
sum += b[i];
}
}
cout << sum;
return 0;
} | [
"variable_declaration.type.change"
] | 766,245 | 766,246 | u139300044 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
ans += 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];
}
} else {
ans += B[i];
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
ans += 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];
}
} else {
ans += B[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,247 | 766,248 | u813559924 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll a, const ll b) { return ((a) + (b)-1) / b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vl a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
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] -= b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl "\n"
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 62) - 1;
ll ceil(const ll a, const ll b) { return ((a) + (b)-1) / b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vl a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
} | [
"assignment.change"
] | 766,249 | 766,250 | u363936720 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// i ไบบ็ฎใฎๅ่
ใ i ็ช็ฎใฎ่กใง่จไผ
int i_attack = min(b[i], a[i]);
ans += i_attack;
a[i] - i_attack;
b[i] = max(0, b[i] - i_attack);
// i ไบบ็ฎใฎๅ่
ใ i+1 ็ช็ฎใฎ่กใง่จไผ
int ii_attack = min(b[i], a[i + 1]);
ans += ii_attack;
a[i + 1] - ii_attack;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
// i ไบบ็ฎใฎๅ่
ใ i ็ช็ฎใฎ่กใง่จไผ
int i_attack = min(b[i], a[i]);
ans += i_attack;
a[i] -= i_attack;
b[i] = max(0, b[i] - i_attack);
// i ไบบ็ฎใฎๅ่
ใ i+1 ็ช็ฎใฎ่กใง่จไผ
int ii_attack = min(b[i], a[i + 1]);
ans += ii_attack;
a[i + 1] -= ii_attack;
}
cout << ans << endl;
}
| [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 766,254 | 766,255 | u902387200 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> y(n + 1);
vector<int> u(n);
int ans = 0;
rep(i, n + 1) cin >> y.at(i);
rep(i, n) cin >> u.at(i);
rep(i, n) {
if (y.at(i) + y.at(i + 1) < u.at(i)) {
ans += y.at(i) + y.at(i + 1);
y.at(i) = 0;
y.at(i + 1) = 0;
} else if (y.at(i) < u.at(i)) {
y.at(i + 1) = y.at(i + 1) - u.at(i) + y.at(i);
y.at(i) = 0;
ans += u.at(i);
} else {
ans += u.at(i);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> y(n + 1);
vector<int> u(n);
int64_t ans = 0;
rep(i, n + 1) cin >> y.at(i);
rep(i, n) cin >> u.at(i);
rep(i, n) {
if (y.at(i) + y.at(i + 1) < u.at(i)) {
ans += y.at(i) + y.at(i + 1);
y.at(i) = 0;
y.at(i + 1) = 0;
} else if (y.at(i) < u.at(i)) {
y.at(i + 1) = y.at(i + 1) - u.at(i) + y.at(i);
y.at(i) = 0;
ans += u.at(i);
} else {
ans += u.at(i);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,260 | 766,261 | u999477518 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int cnt = 0, k;
rep(i, n) {
int k1 = min(b[i], a[i]);
int k2 = min(a[i + 1], b[i] - k1);
a[i + 1] -= k2;
cnt += k1 + k2;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
rep(i, n) {
int k1 = min(b[i], a[i]);
int k2 = min(a[i + 1], b[i] - k1);
a[i + 1] -= k2;
cnt += k1 + k2;
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.change",
"variable_declaration.remove"
] | 766,262 | 766,263 | u237022500 | cpp |
p02959 | //ใใใใผ
#include <bits/stdc++.h>
using namespace std;
//ๅๅฎ็พฉ
typedef long long ll;
//ๅฎๆฐ
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i, a, b) for (ll i = a; i > (ll)(b); i--)
// vectorใฎๆฑใ
#define ALL(x) (x).begin(), (x).end() // sortใชใฉใฎๅผๆฐ็็ฅ
#define SIZE(x) ((ll)(x).size()) // size
#define MAX(x) *max_element(ALL(x)) //ๆๅคงๅค
#define MIN(x) *min_element(ALL(x)) //ๆๅฐๅค
//ใฐใญใผใใซๅคๆฐ
//ใฉใคใใฉใชๆฟๅ
ฅ
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
REP(i, N + 1) cin >> A[i];
REP(i, N) cin >> B[i];
int sum = 0;
int cnt, tmp;
REP(i, N) {
cnt = B[i] - A[i];
if (cnt >= 0) {
sum += A[i];
tmp = A[i + 1];
A[i + 1] = max(0, A[i + 1] - cnt);
sum += (tmp - A[i + 1]);
} else {
sum += B[i];
}
}
cout << sum << endl;
} | //ใใใใผ
#include <bits/stdc++.h>
using namespace std;
//ๅๅฎ็พฉ
typedef long long ll;
//ๅฎๆฐ
const int INF = 1e+9;
const int MOD = 1e+9 + 7;
// REPใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define REPD2(i, a, b) for (ll i = a; i > (ll)(b); i--)
// vectorใฎๆฑใ
#define ALL(x) (x).begin(), (x).end() // sortใชใฉใฎๅผๆฐ็็ฅ
#define SIZE(x) ((ll)(x).size()) // size
#define MAX(x) *max_element(ALL(x)) //ๆๅคงๅค
#define MIN(x) *min_element(ALL(x)) //ๆๅฐๅค
//ใฐใญใผใใซๅคๆฐ
//ใฉใคใใฉใชๆฟๅ
ฅ
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 sum = 0;
ll cnt, tmp;
REP(i, N) {
cnt = B[i] - A[i];
if (cnt >= 0) {
sum += A[i];
tmp = A[i + 1];
A[i + 1] = max((ll)0, A[i + 1] - cnt);
sum += (tmp - A[i + 1]);
} else {
sum += B[i];
}
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 766,266 | 766,267 | u115927976 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) <= a.at(i)) {
a.at(i) -= b.at(i);
ans += b.at(i);
} else if ((a.at(i) < b.at(i)) && (b.at(i) <= a.at(i) + a.at(i + 1))) {
a.at(i + 1) -= (b.at(i) - a.at(i));
a.at(i) = 0;
ans += b.at(i);
} else {
ans += a.at(i) + a.at(i + 1);
a.at(i) = 0;
a.at(i + 1) = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) <= a.at(i)) {
a.at(i) -= b.at(i);
ans += b.at(i);
} else if ((a.at(i) < b.at(i)) && (b.at(i) <= a.at(i) + a.at(i + 1))) {
a.at(i + 1) -= (b.at(i) - a.at(i));
a.at(i) = 0;
ans += b.at(i);
} else {
ans += a.at(i) + a.at(i + 1);
a.at(i) = 0;
a.at(i + 1) = 0;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,268 | 766,269 | u582684800 | cpp |
p02959 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int n;
vector<int> a, b;
int main() {
cin >> n;
a = vector<int>(n + 1);
b = vector<int>(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
rep(i, n) {
if (a[i] <= b[i]) {
sum += a[i];
int rest = 0;
if (a[i + 1] - (b[i] - a[i]) < 0)
rest = a[i + 1];
else
rest = b[i] - a[i];
a[i + 1] -= rest;
sum += rest;
} else
sum += b[i];
}
cout << sum << endl;
return 0;
}
| #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int n;
vector<long> a, b;
int main() {
cin >> n;
a = vector<long>(n + 1);
b = vector<long>(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long sum = 0;
rep(i, n) {
if (a[i] <= b[i]) {
sum += a[i];
long rest = 0;
if (a[i + 1] - (b[i] - a[i]) < 0)
rest = a[i + 1];
else
rest = b[i] - a[i];
a[i + 1] -= rest;
sum += rest;
} else
sum += b[i];
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"assignment.value.change"
] | 766,276 | 766,277 | u649421008 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
vector<int> city(N + 1);
vector<int> hero(N);
for (int i = 0; i < N + 1; i++)
cin >> city[i];
for (int i = 0; i < N; i++)
cin >> hero[i];
for (int i = 0; i < N; i++) {
if (hero[i] >= (city[i] + city[i + 1])) {
ans += (city[i] + city[i + 1]);
city[i + 1] = 0;
city[i] = 0;
} else if (hero[i] > city[i] && hero[i] < (city[i] + city[i + 1])) {
ans += hero[i];
city[i + 1] -= hero[i] - city[i];
city[i] = 0;
} else {
ans += hero[i];
city[i] -= hero[i];
}
}
cout << ans << endl;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
int ans = 0;
vector<int> city(N + 1);
vector<int> hero(N);
for (int i = 0; i < N + 1; i++)
cin >> city[i];
for (int i = 0; i < N; i++)
cin >> hero[i];
for (int i = 0; i < N; i++) {
if (hero[i] >= (city[i] + city[i + 1])) {
ans += (city[i] + city[i + 1]);
city[i + 1] = 0;
city[i] = 0;
} else if (hero[i] > city[i] && hero[i] < (city[i] + city[i + 1])) {
ans += hero[i];
city[i + 1] -= hero[i] - city[i];
city[i] = 0;
} else {
ans += hero[i];
city[i] -= hero[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,278 | 766,279 | u527652459 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = acos(-1);
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = 0;
rep(i, N) {
if (A[i] + A[i + 1] <= B[i]) {
ans += A[i] + A[i + 1];
A[i + 1] -= 0;
} else if (A[i] <= B[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else
ans += B[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = acos(-1);
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = 0;
rep(i, N) {
if (A[i] + A[i + 1] <= B[i]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (A[i] <= B[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else
ans += B[i];
}
cout << ans << endl;
}
| [
"assignment.value.change"
] | 766,281 | 766,282 | u711381986 | 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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
REP(i, N + 1) cin >> A[i];
vector<int> B(N);
REP(i, N) cin >> B[i];
int cnt = 0;
REPR(i, N - 1) {
if (B.at(i) >= A.at(i + 1)) {
B.at(i) -= A.at(i + 1);
cnt += A.at(i + 1);
cnt += min(B.at(i), A.at(i));
A.at(i) -= min(B.at(i), A.at(i));
} else {
cnt += B.at(i);
}
}
cout << cnt << 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 INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
REP(i, N + 1) cin >> A[i];
vector<int> B(N);
REP(i, N) cin >> B[i];
ll cnt = 0;
REPR(i, N - 1) {
if (B.at(i) >= A.at(i + 1)) {
B.at(i) -= A.at(i + 1);
cnt += A.at(i + 1);
cnt += min(B.at(i), A.at(i));
A.at(i) -= min(B.at(i), A.at(i));
} else {
cnt += B.at(i);
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.change"
] | 766,285 | 766,286 | u135626132 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, s, e) for (int i = (s); i < (e); i++)
#define all(obj) (obj).begin(), (obj).end()
/*ๅๅๅ #define int long long ๅๅๅ*/
signed main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n + 1) cin >> a[i];
vector<int> b(n, 0);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] += a[i] - b[i];
ans += b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, s, e) for (int i = (s); i < (e); i++)
#define all(obj) (obj).begin(), (obj).end()
#define int long long
signed main() {
int n;
cin >> n;
vector<int> a(n + 1, 0);
rep(i, n + 1) cin >> a[i];
vector<int> b(n, 0);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] += a[i] - b[i];
ans += b[i];
}
}
cout << ans << endl;
} | [] | 766,287 | 766,288 | u443151804 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> list(N);
for (int i = 0; i < N + 1; i++)
cin >> monster[i];
for (int i = 0; i < N; i++)
cin >> list[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int tmp;
tmp = min(list[i], monster[i]);
ans += tmp;
list[i] -= tmp;
monster[i] -= tmp;
tmp = min(list[i], monster[i + 1]);
ans += tmp;
list[i] -= tmp;
monster[i + 1] -= tmp;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> list(N);
for (int i = 0; i < N + 1; i++)
cin >> monster[i];
for (int i = 0; i < N; i++)
cin >> list[i];
int64_t ans = 0;
for (int i = 0; i < N; i++) {
int tmp;
tmp = min(list[i], monster[i]);
ans += tmp;
list[i] -= tmp;
monster[i] -= tmp;
tmp = min(list[i], monster[i + 1]);
ans += tmp;
list[i] -= tmp;
monster[i + 1] -= tmp;
}
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 766,289 | 766,290 | u058742919 | cpp |
p02959 | //#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i += 1)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i -= 1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define C 1000000001
#define M 998244353
#define all(x) x.begin(), x.end()
using namespace std;
// From Geeksforgeeks
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// Power function took from geeksforgeeks
ll power(ll x, ll y) {
ll res = 1;
x = x;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
double dist(ll x1, ll y1, ll x2, ll y2) {
double ans = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
return ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n + 1, 0);
vector<ll> b(n, 0);
f(i, 0, n + 1) cin >> a[i];
f(i, 0, n) cin >> b[i];
ll ans = 0;
f(i, 0, n) {
ans += min(b[i], a[i]);
b[i] -= min(b[i], a[i]);
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i]);
}
cout << ans;
return 0;
}
| //#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i += 1)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i -= 1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define C 1000000001
#define M 998244353
#define all(x) x.begin(), x.end()
using namespace std;
// From Geeksforgeeks
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// Power function took from geeksforgeeks
ll power(ll x, ll y) {
ll res = 1;
x = x;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
double dist(ll x1, ll y1, ll x2, ll y2) {
double ans = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
return ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n;
cin >> n;
vector<ll> a(n + 1, 0);
vector<ll> b(n, 0);
f(i, 0, n + 1) cin >> a[i];
f(i, 0, n) cin >> b[i];
ll ans = 0;
f(i, 0, n) {
ans += min(b[i], a[i]);
b[i] -= min(b[i], a[i]);
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
cout << ans;
return 0;
}
| [
"assignment.change"
] | 766,294 | 766,295 | u662613350 | cpp |
p02959 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin >> N;
vector<int> teki(N + 1);
vector<int> taoseru(N);
for (int i = 0; i < N + 1; i++) {
cin >> teki[i];
}
for (int i = 0; i < N; i++) {
cin >> taoseru[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (taoseru[i] >= teki[i]) {
ans += teki[i];
ans += min(teki[i + 1], taoseru[i] - teki[i]);
teki[i + 1] = teki[i + 1] - min(teki[i + 1], taoseru[i] - teki[i]);
teki[i] = 0;
} else {
ans += taoseru[i];
teki[i] -= taoseru[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N;
cin >> N;
vector<int> teki(N + 1);
vector<int> taoseru(N);
for (int i = 0; i < N + 1; i++) {
cin >> teki[i];
}
for (int i = 0; i < N; i++) {
cin >> taoseru[i];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (taoseru[i] >= teki[i]) {
ans += teki[i];
ans += min(teki[i + 1], taoseru[i] - teki[i]);
teki[i + 1] = teki[i + 1] - min(teki[i + 1], taoseru[i] - teki[i]);
teki[i] = 0;
} else {
ans += taoseru[i];
teki[i] -= taoseru[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change"
] | 766,296 | 766,297 | u262451272 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//ใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortใชใฉใฎๅผๆฐใ็็ฅใใใ
#define SIZE(x) ((ll)(x).size()) // sizeใsize_tใใllใซ็ดใใฆใใ
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
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 ans = 0;
REP(i, n) {
ans += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
ans += min(b[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
//ใใฏใญ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortใชใฉใฎๅผๆฐใ็็ฅใใใ
#define SIZE(x) ((ll)(x).size()) // sizeใsize_tใใllใซ็ดใใฆใใ
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
ll ans = 0;
REP(i, n) {
ans += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
ans += min(b[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
cout << ans << "\n";
return 0;
}
| [
"variable_declaration.type.change"
] | 766,300 | 766,301 | u053035261 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> A(n + 1), B(n);
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (A[i] >= B[i])
ans += B[i];
else {
ans += A[i];
ans += min(B[i] - A[i], A[i + 1]);
A[i + 1] = max(A[i + 1] - (B[i] - A[i]), 0);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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 = 0;
rep(i, n) {
if (A[i] >= B[i])
ans += B[i];
else {
ans += A[i];
ans += min(B[i] - A[i], A[i + 1]);
A[i + 1] = max(A[i + 1] - (B[i] - A[i]), (ll)0);
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,307 | 766,308 | u650236619 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
vector<ll> f_1(n), f_2(n);
ll ans = 0;
rep(i, n) {
if (i == 0) {
f_1[i] = min(a[i], b[i]);
} else {
f_1[i] = min(a[i] - f_2[i - 1], b[i]);
}
f_2[i] = min(a[i + 1], b[i] - f_1[i]);
ans = ans + f_1[i] + f_2[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
int main() {
int 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];
vector<ll> f_1(n), f_2(n);
ll ans = 0;
rep(i, n) {
if (i == 0) {
f_1[i] = min(a[i], b[i]);
} else {
f_1[i] = min(a[i] - f_2[i - 1], b[i]);
}
f_2[i] = min(a[i + 1], b[i] - f_1[i]);
ans = ans + f_1[i] + f_2[i];
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 766,318 | 766,319 | u975472502 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int c, count = 0;
rep(i, N) {
c = min(A[i], B[i]);
count += c;
A[i] -= c;
B[i] -= c;
c = min(A[i + 1], B[i]);
count += c;
A[i + 1] -= c;
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N;
cin >> N;
long long A[N + 1], B[N];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long c, count = 0;
rep(i, N) {
c = min(A[i], B[i]);
count += c;
A[i] -= c;
B[i] -= c;
c = min(A[i + 1], B[i]);
count += c;
A[i + 1] -= c;
}
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,321 | 766,322 | u975472502 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int llint;
int main() {
int N;
cin >> N;
int A[N + 1 + 1];
int B[N + 1];
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++) {
if (A[i] > B[i]) {
cnt += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
cnt += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] > B[i]) {
cnt += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long int llint;
int main() {
int N;
cin >> N;
llint A[N + 1 + 1];
llint B[N + 1];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
cin >> B[i];
}
llint cnt = 0;
for (int i = 1; i <= N; i++) {
if (A[i] > B[i]) {
cnt += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
cnt += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] > B[i]) {
cnt += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,330 | 766,331 | u309780279 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
int bcopy = b[i];
int temp = min(a[i], b[i]);
a[i] -= temp;
b[i] -= temp;
int temp1 = min(a[i + 1], b[i]);
a[i + 1] -= temp1;
b[i] -= temp1;
sum += bcopy - b[i];
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {
int bcopy = b[i];
int temp = min(a[i], b[i]);
a[i] -= temp;
b[i] -= temp;
int temp1 = min(a[i + 1], b[i]);
a[i + 1] -= temp1;
b[i] -= temp1;
sum += bcopy - b[i];
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,334 | 766,335 | u476027087 | 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;
#define _GLIBCXX_DEBUG
int main() {
int n, ans = 0;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] + a[i + 1] >= b[i]) {
a[i + 1] -= b[i] - a[i] >= 0 ? b[i] - a[i] : 0;
ans += b[i];
} else {
ans += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
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;
#define _GLIBCXX_DEBUG
int main() {
ll n, ans = 0;
cin >> n;
int a[n + 1];
int b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] + a[i + 1] >= b[i]) {
a[i + 1] -= b[i] - a[i] > 0 ? b[i] - a[i] : 0;
ans += b[i];
} else {
ans += (a[i] + a[i + 1]);
a[i + 1] = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 766,337 | 766,338 | u652294457 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
bool isPrime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n;
int ans = 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])
ans += B[i];
else {
ans += A[i] + min(A[i + 1], B[i] - A[i]);
;
A[i + 1] -= min(A[i + 1], B[i] - A[i]);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
bool isPrime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
ll n;
ll ans = 0;
cin >> n;
vector<ll> A(n + 1);
vector<ll> 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])
ans += B[i];
else {
ans += A[i] + min(A[i + 1], B[i] - A[i]);
;
A[i + 1] -= min(A[i + 1], B[i] - A[i]);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,339 | 766,340 | u229427161 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int A[n + 1];
int B[n];
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
} else {
ans += B[i];
B[i] = 0;
}
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
}
// cout << B[i] << A[i] << ans << endl;
}
cout << ans << endl;
return (0);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
long n;
cin >> n;
long A[n + 1];
long B[n];
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
long ans = 0;
rep(i, n) {
if (B[i] >= A[i]) {
B[i] -= A[i];
ans += A[i];
} else {
ans += B[i];
B[i] = 0;
}
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
}
// cout << B[i] << A[i] << ans << endl;
}
cout << ans << endl;
return (0);
}
| [
"variable_declaration.type.primitive.change"
] | 766,341 | 766,342 | u025047544 | cpp |
p02959 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
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];
ll ans = 0;
for (int i = 0; i < n; i++) {
int temp = min(b[i], a[i]);
ans += temp;
if (temp = a[i]) {
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
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];
ll ans = 0;
for (int i = 0; i < n; i++) {
int temp = min(b[i], a[i]);
ans += temp;
if (temp == a[i]) {
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 766,347 | 766,348 | u201553784 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n;
cin >> n;
int m[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += min(m[i], b[i]);
b[i] -= min(m[i], b[i]);
m[i] -= min(m[i], b[i]);
ans += min(m[i + 1], b[i]);
m[i + 1] -= min(m[i + 1], b[i]);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x, ll y) {
if (y == 0)
return x;
else
return GCD(y, x % y);
}
int main() {
int n;
cin >> n;
int m[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += min(m[i], b[i]);
b[i] -= min(m[i], b[i]);
m[i] -= min(m[i], b[i]);
ans += min(m[i + 1], b[i]);
m[i + 1] -= min(m[i + 1], b[i]);
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,349 | 766,350 | u010415482 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 2, 0), B(N + 1, 0);
for (int i = 1; i <= N + 1; i++) {
cin >> A.at(i);
}
for (int i = 1; i <= N; i++) {
cin >> B.at(i);
}
int kill = 0, killtot = 0;
// cout << "i=" << 1 << " A.at(1)=" << A.at(1) << " B.at(i)=" << B.at(1) <<
// " A.at(1+1)=" << A.at(1+1) << endl;
for (int i = 1; i <= N; i++) {
kill = min(A.at(i), B.at(i));
A.at(i) -= kill;
B.at(i) -= kill;
killtot += kill;
// cout << "i=" << i << " A.at(i)=" << A.at(i) << " B.at(i)=" << B.at(i)
// << " A.at(i+1)=" << A.at(i+1) << endl;
kill = min(B.at(i), A.at(i + 1));
B.at(i) -= kill;
A.at(i + 1) -= kill;
killtot += kill;
// cout << "i=" << i << " A.at(i)=" << A.at(i) << " B.at(i)=" << B.at(i)
// << " A.at(i+1)=" << A.at(i+1) << endl;
}
cout << killtot << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> A(N + 2, 0), B(N + 1, 0);
for (long i = 1; i <= N + 1; i++) {
cin >> A.at(i);
}
for (long i = 1; i <= N; i++) {
cin >> B.at(i);
}
long kill = 0, killtot = 0;
// cout << "i=" << 1 << " A.at(1)=" << A.at(1) << " B.at(i)=" << B.at(1) <<
// " A.at(1+1)=" << A.at(1+1) << endl;
for (long i = 1; i <= N; i++) {
kill = min(A.at(i), B.at(i));
A.at(i) -= kill;
B.at(i) -= kill;
killtot += kill;
// cout << "i=" << i << " A.at(i)=" << A.at(i) << " B.at(i)=" << B.at(i)
// << " A.at(i+1)=" << A.at(i+1) << endl;
kill = min(B.at(i), A.at(i + 1));
B.at(i) -= kill;
A.at(i + 1) -= kill;
killtot += kill;
// cout << "i=" << i << " A.at(i)=" << A.at(i) << " B.at(i)=" << B.at(i)
// << " A.at(i+1)=" << A.at(i+1) << endl;
}
cout << killtot << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 766,351 | 766,352 | u964376215 | cpp |
p02959 | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const double PI = acos(-1);
int main() {
int n, sum = 0;
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];
for (int i = 0; i < n; i++) {
sum += min(a[i] + a[i + 1], b[i]);
if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const double PI = acos(-1);
int main() {
long n, sum = 0;
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];
for (int i = 0; i < n; i++) {
sum += min(a[i] + a[i + 1], b[i]);
if (a[i] < b[i]) {
a[i + 1] -= b[i] - a[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 766,356 | 766,357 | u470123394 | cpp |
p02959 | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++) {
std::cin >> a[i];
}
std::vector<long> b(n);
for (long i = 0; i < n; i++) {
std::cin >> b[i];
}
long count = 0;
for (long i = 0; i < n; i++) {
long tmp = b[i] - a[i];
if (tmp < 0) {
count += b[i];
a[i] -= b[i];
b[i] = 0;
if (b[i] - a[i + 1] < 0) {
count += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
count += a[i + 1];
b[i] -= a[i + 1];
a[i] = 0;
}
} else {
count += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] - a[i + 1] < 0) {
count += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
count += a[i + 1];
b[i] -= a[i + 1];
a[i] = 0;
}
}
}
std::cout << count << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<long> a(n + 1);
for (long i = 0; i < n + 1; i++) {
std::cin >> a[i];
}
std::vector<long> b(n);
for (long i = 0; i < n; i++) {
std::cin >> b[i];
}
long count = 0;
for (long i = 0; i < n; i++) {
long tmp = b[i] - a[i];
if (tmp < 0) {
count += b[i];
a[i] -= b[i];
b[i] = 0;
if (b[i] - a[i + 1] < 0) {
count += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
count += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
} else {
count += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] - a[i + 1] < 0) {
count += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
count += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
std::cout << count << std::endl;
return 0;
} | [
"assignment.change"
] | 766,358 | 766,359 | u083254278 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1001001001;
const int mod = 1000000007;
ll pow(ll base, ll order) {
ll ans = 1;
rep(i, order - 1) ans *= base;
return ans;
}
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
b = c;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
ll sum(ll x) { // sum of subsequent numbers from 0 to x
return x * (x + 1) / 2;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ll ans = 0;
vector<int> rest(n);
rep(i, n) {
int beat_prev = 0, beat;
if (i >= 1) {
beat_prev = min(rest.at(i - 1), a.at(i));
}
beat = min(a.at(i) - beat_prev, b.at(i));
rest.at(i) = b.at(i) - beat;
ans += beat;
}
ans += min(rest.at(n - 1), a.at(n));
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;
const int INF = 1001001001;
const int mod = 1000000007;
ll pow(ll base, ll order) {
ll ans = 1;
rep(i, order - 1) ans *= base;
return ans;
}
int gcd(int a, int b) {
if (a < b) {
int c = a;
a = b;
b = c;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
ll sum(ll x) { // sum of subsequent numbers from 0 to x
return x * (x + 1) / 2;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ll ans = 0;
vector<int> rest(n);
rep(i, n) {
int beat_prev = 0, beat;
if (i >= 1) {
beat_prev = min(rest.at(i - 1), a.at(i));
}
beat = min(a.at(i) - beat_prev, b.at(i));
rest.at(i) = b.at(i) - beat;
ans += beat + beat_prev;
// cout << beat << endl;
}
ans += min(rest.at(n - 1), a.at(n));
cout << ans << endl;
}
| [
"assignment.change"
] | 766,360 | 766,361 | u596952207 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (b.at(i) <= a.at(i)) {
sum += b.at(i);
} else if (b.at(i) < a.at(i) + a.at(i + 1)) {
sum += a.at(i);
a.at(i + 1) -= b.at(i) - a.at(i);
sum += b.at(i) - a.at(i);
} else {
sum += a.at(i);
sum += a.at(i + 1);
a.at(i + 1) = 0;
}
}
cout << sum << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long int n, sum = 0;
cin >> n;
vector<long> a(n + 1);
vector<long> 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)) {
sum += b.at(i);
} else if (b.at(i) < a.at(i) + a.at(i + 1)) {
sum += a.at(i);
a.at(i + 1) -= b.at(i) - a.at(i);
sum += b.at(i) - a.at(i);
} else {
sum += a.at(i);
sum += a.at(i + 1);
a.at(i + 1) = 0;
}
}
cout << sum << endl;
} | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 766,362 | 766,363 | u553461888 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define eb(x) emplace_back(x)
#define mp(a, b) make_pair(a, b)
#define sz(a) int((a).size())
#define mod 1000000007
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define inf LLONG_MAX
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void seethis(vector<ll> vect) {
for (ll x : vect)
cout << x << " ";
cout << "\n";
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
// LCM
int lcm(int a, int b) { return a * (b / __gcd(a, b)); }
// For sort by second
bool cmp(const pair<int, int> &a) { return a.first < a.second; }
// Tree
/* const int MAXN = 1e5 + 5;
vector<ll> adj[MAXN];*/
// ModPower
ll modpower(ll a, ll b, ll c) {
ll res = 1;
while (b) {
if (b & 1LL)
res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
int main() {
FASTIO;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
int n;
cin >> n;
vector<int> vect(n + 1);
vector<int> hero(n);
f(i, 0, n + 1) cin >> vect[i];
f(i, 0, n) cin >> hero[i];
int ans = 0;
for (int i = 0; i < n; i++) {
ans += min(vect[i], hero[i]);
hero[i] = max(hero[i] - vect[i], 0);
int x = min(hero[i], vect[i + 1]);
ans += x;
vect[i + 1] -= x;
/// error(ans);
}
cout << ans << "\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define f(i, x, n) for (int i = x; i < n; i++)
#define FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define eb(x) emplace_back(x)
#define mp(a, b) make_pair(a, b)
#define sz(a) int((a).size())
#define mod 1000000007
#define tr(c, i) for (typeof((c)).begin() i = (c).begin(); i != (c).end(); i++)
#define inf LLONG_MAX
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void seethis(vector<ll> vect) {
for (ll x : vect)
cout << x << " ";
cout << "\n";
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
// LCM
int lcm(int a, int b) { return a * (b / __gcd(a, b)); }
// For sort by second
bool cmp(const pair<int, int> &a) { return a.first < a.second; }
// Tree
/* const int MAXN = 1e5 + 5;
vector<ll> adj[MAXN];*/
// ModPower
ll modpower(ll a, ll b, ll c) {
ll res = 1;
while (b) {
if (b & 1LL)
res = (res * a) % c;
a = (a * a) % c;
b >>= 1;
}
return res;
}
int main() {
FASTIO;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ll n;
cin >> n;
vector<ll> vect(n + 1);
vector<ll> hero(n);
f(i, 0, n + 1) cin >> vect[i];
f(i, 0, n) cin >> hero[i];
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += min(vect[i], hero[i]);
hero[i] = max(hero[i] - vect[i], 0ll);
int x = min(hero[i], vect[i + 1]);
ans += x;
vect[i + 1] -= x;
/// error(ans);
}
cout << ans << "\n";
return 0;
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 766,364 | 766,365 | u824880220 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int monstar[n + 2];
int yusya[n + 1];
int sum = 0;
monstar[0] = -1;
yusya[0] = -1;
rep(i, n + 1) cin >> monstar[i + 1];
rep(i, n) cin >> yusya[i + 1];
for (int i = n; i >= 1; i--) {
sum += min(monstar[i + 1], yusya[i]);
yusya[i] -= min(monstar[i + 1], yusya[i]);
sum += min(monstar[i], yusya[i]);
monstar[i] -= min(monstar[i], yusya[i]);
// cout<<yusya[i]<<" "<<monstar[i]<<endl;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
ll monstar[n + 2];
ll yusya[n + 1];
ll sum = 0;
monstar[0] = -1;
yusya[0] = -1;
rep(i, n + 1) cin >> monstar[i + 1];
rep(i, n) cin >> yusya[i + 1];
for (int i = n; i >= 1; i--) {
sum += min(monstar[i + 1], yusya[i]);
yusya[i] -= min(monstar[i + 1], yusya[i]);
sum += min(monstar[i], yusya[i]);
monstar[i] -= min(monstar[i], yusya[i]);
// cout<<yusya[i]<<" "<<monstar[i]<<endl;
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 766,368 | 766,369 | u070779615 | cpp |
p02959 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(10);
int N;
cin >> N;
vector<ll> 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++) {
if (b[i] - a[i] <= 0) {
sum += b[i];
} else {
if (b[i] - a[i] - a[i + 1] >= 0) {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
sum += b[i];
a[i + 1] -= b[i] - a[i];
}
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(10);
ll N;
cin >> N;
vector<ll> 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++) {
if (b[i] - a[i] <= 0) {
sum += b[i];
} else {
if (b[i] - a[i] - a[i + 1] >= 0) {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
sum += b[i];
a[i + 1] -= b[i] - a[i];
}
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,373 | 766,374 | u705990127 | cpp |
p02959 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(10);
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++) {
if (b[i] - a[i] <= 0) {
sum += b[i];
} else {
if (b[i] - a[i] - a[i + 1] >= 0) {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
sum += b[i];
a[i + 1] -= b[i] - a[i];
}
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int main() {
cout << fixed << setprecision(10);
ll N;
cin >> N;
vector<ll> 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++) {
if (b[i] - a[i] <= 0) {
sum += b[i];
} else {
if (b[i] - a[i] - a[i + 1] >= 0) {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
sum += b[i];
a[i + 1] -= b[i] - a[i];
}
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,375 | 766,374 | u705990127 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int cnt = 0;
for (int i = 0; i < n; i++) {
// b[i]ใa[i]ใฎใขใณในใฟใผใๅ
จๅใงๅใ
cnt += min(a[i], b[i]);
// a[i] = max(a[i]-b[i], 0);
b[i] = max(b[i] - a[i], 0);
if (a[i + 1] <= b[i]) {
cnt += a[i + 1];
b[i] -= a[i];
a[i + 1] = 0;
} else if (a[i + 1] > b[i]) {
cnt += b[i];
// b[i] = 0;
a[i + 1] -= b[i];
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
for (int i = 0; i < n; i++) {
// b[i]ใa[i]ใฎใขใณในใฟใผใๅ
จๅใงๅใ
cnt += min(a[i], b[i]);
// a[i] = max(a[i]-b[i], 0);
b[i] = max(b[i] - a[i], 0);
if (a[i + 1] <= b[i]) {
cnt += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else if (a[i + 1] > b[i]) {
cnt += b[i];
// b[i] = 0;
a[i + 1] -= b[i];
}
}
cout << cnt << endl;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 766,377 | 766,378 | u641900703 | cpp |
p02959 | #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 ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] + a[i] <= b[i]) {
ans += a[i + 1] + a[i];
a[i + 1] = 0;
a[i] = 0;
} else if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
ans += b[i];
} else {
a[i] = b[i] - a[i + 1];
a[i + 1] = 0;
ans += b[i];
}
}
cout << ans << endl;
} | #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 ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] + a[i] <= b[i]) {
ans += a[i + 1] + a[i];
a[i + 1] = 0;
a[i] = 0;
} else if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
ans += b[i];
} else {
a[i] -= b[i] - a[i + 1];
a[i + 1] = 0;
ans += b[i];
}
}
cout << ans << endl;
} | [
"assignment.value.change"
] | 766,383 | 766,384 | u244626757 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100010];
int b[100010];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
ans += tmp;
b[i] -= tmp;
tmp = min(a[i + 1], b[i]);
ans += tmp;
a[i + 1] -= tmp;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
cin >> n;
int a[100010];
int b[100010];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
ans += tmp;
b[i] -= tmp;
tmp = min(a[i + 1], b[i]);
ans += tmp;
a[i + 1] -= tmp;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 766,387 | 766,388 | u221119670 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) <= (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using vi = vector<int>;
using unit = unsigned;
using vl = vector<ll>;
using ull = unsigned long long;
using vvi = vector<vi>;
using P = pair<int, int>;
using vvl = vector<vl>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> string join(const v(T) & v) {
stringstream s;
rep(i, 0, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <class T> istream &operator>>(istream &i, v(T) & v) {
fore(x, v) { i >> v; }
return i;
}
template <class T> ostream &operator<<(ostream &o, const v(T) & v) {
o << "[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << "deq[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const unordered_set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T1, class T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
o << "(" << p.fi << "," << p.se << ")";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const unordered_map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class T> void YES(T c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T c) {
if (c)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T c) {
if (c)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> T gcd(T a, T b) { return (b == 0) ? a : gcd(b, a % b); }
template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const ll INFL = 1LL << 60;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
void _main() {
int N;
cin >> N;
vi A(N + 1), B(N);
fore(x, A) cin >> x;
fore(x, B) cin >> x;
int ans = 0;
rrep(i, N - 1, 0) {
int atk1 = min(A[i + 1], B[i]);
ans += atk1;
B[i] -= atk1;
int atk2 = min(A[i], B[i]);
ans += atk2;
A[i] -= atk2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define fore(i, a) for (auto &i : a)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) <= (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define fi first
#define se second
#define pb push_back
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using vi = vector<int>;
using unit = unsigned;
using vl = vector<ll>;
using ull = unsigned long long;
using vvi = vector<vi>;
using P = pair<int, int>;
using vvl = vector<vl>;
using vp = vector<P>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> string join(const v(T) & v) {
stringstream s;
rep(i, 0, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <class T> istream &operator>>(istream &i, v(T) & v) {
fore(x, v) { i >> v; }
return i;
}
template <class T> ostream &operator<<(ostream &o, const v(T) & v) {
o << "[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << "deq[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const unordered_set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T1, class T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
o << "(" << p.fi << "," << p.se << ")";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const unordered_map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class T> void YES(T c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T c) {
if (c)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T c) {
if (c)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> T gcd(T a, T b) { return (b == 0) ? a : gcd(b, a % b); }
template <class T> T lcm(T a, T b) { return a * (b / gcd(a, b)); }
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const ll INFL = 1LL << 60;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
void _main() {
int N;
cin >> N;
vi A(N + 1), B(N);
fore(x, A) cin >> x;
fore(x, B) cin >> x;
ll ans = 0;
rrep(i, N - 1, 0) {
int atk1 = min(A[i + 1], B[i]);
ans += atk1;
B[i] -= atk1;
int atk2 = min(A[i], B[i]);
ans += atk2;
A[i] -= atk2;
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,391 | 766,392 | u430494842 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
ll N;
vll A, B;
int solve(int i, int prevkill) {
int kill = min(A[i], B[i]) - prevkill;
int nextkill = min(B[i] - kill, A[i + 1]);
if (i >= N - 1) {
return kill + nextkill;
}
return (solve(i + 1, nextkill) + kill + nextkill);
}
int main() {
cin >> N;
vll kill(N), overkill(N);
ll ans = 0;
A.resize(N + 1);
B.resize(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
// cout<<solve(0,0);
kill[0] = min(A[0], B[0]);
overkill[0] = min(B[0] - A[0], A[1]);
ans += kill[0] + overkill[0];
for (int i = 1; i < N; i++) {
ll res1 = A[i] - (overkill[i - 1]);
kill[i] = min(B[i], res1);
overkill[i] = min(B[i] - kill[i], A[i + 1]);
ans += kill[i] + overkill[i];
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
ll N;
vll A, B;
int solve(int i, int prevkill) {
int kill = min(A[i], B[i]) - prevkill;
int nextkill = min(B[i] - kill, A[i + 1]);
if (i >= N - 1) {
return kill + nextkill;
}
return (solve(i + 1, nextkill) + kill + nextkill);
}
int main() {
cin >> N;
vll kill(N), overkill(N);
ll ans = 0;
A.resize(N + 1);
B.resize(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
// cout<<solve(0,0);
kill[0] = min(A[0], B[0]);
overkill[0] = min(B[0] - kill[0], A[1]);
ans += kill[0] + overkill[0];
for (int i = 1; i < N; i++) {
ll res1 = A[i] - (overkill[i - 1]);
kill[i] = min(B[i], res1);
overkill[i] = min(B[i] - kill[i], A[i + 1]);
ans += kill[i] + overkill[i];
}
cout << ans;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,395 | 766,396 | u987913144 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
ll N;
vll A, B;
int solve(int i, int prevkill) {
int kill = min(A[i], B[i]) - prevkill;
int nextkill = min(B[i] - kill, A[i + 1]);
if (i >= N - 1) {
return kill + nextkill;
}
return (solve(i + 1, nextkill) + kill + nextkill);
}
int main() {
cin >> N;
vll kill(N), overkill(N);
ll ans = 0;
A.resize(N);
B.resize(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
// cout<<solve(0,0);
kill[0] = min(A[0], B[0]);
overkill[0] = min(B[0] - A[0], A[1]);
ans += kill[0] + overkill[0];
for (int i = 1; i < N; i++) {
ll res1 = A[i] - (overkill[i - 1]);
kill[i] = min(B[i], res1);
overkill[i] = min(B[i] - kill[i], A[i + 1]);
ans += kill[i] + overkill[i];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
ll N;
vll A, B;
int solve(int i, int prevkill) {
int kill = min(A[i], B[i]) - prevkill;
int nextkill = min(B[i] - kill, A[i + 1]);
if (i >= N - 1) {
return kill + nextkill;
}
return (solve(i + 1, nextkill) + kill + nextkill);
}
int main() {
cin >> N;
vll kill(N), overkill(N);
ll ans = 0;
A.resize(N + 1);
B.resize(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
// cout<<solve(0,0);
kill[0] = min(A[0], B[0]);
overkill[0] = min(B[0] - kill[0], A[1]);
ans += kill[0] + overkill[0];
for (int i = 1; i < N; i++) {
ll res1 = A[i] - (overkill[i - 1]);
kill[i] = min(B[i], res1);
overkill[i] = min(B[i] - kill[i], A[i + 1]);
ans += kill[i] + overkill[i];
}
cout << ans;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,397 | 766,396 | u987913144 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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 c = 0;
for (int i = 0; i < N; i++) {
c += min(A[i], B[i]);
c += min(B[i] - min(A[i], B[i]), A[i + 1]);
A[i + 1] = max(A[i + 1] - (B[i] - min(A[i], B[i])), 0);
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define int ll
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
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 c = 0;
for (int i = 0; i < N; i++) {
c += min(A[i], B[i]);
c += min(B[i] - min(A[i], B[i]), A[i + 1]);
A[i + 1] = max(A[i + 1] - (B[i] - min(A[i], B[i])), 0ll);
}
cout << c << endl;
return 0;
}
| [
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 766,398 | 766,399 | u864171425 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int A[100010], B[100010];
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++) {
ans += min(B[i], A[i]);
B[i] = max(B[i] - A[i], 0);
ans += min(B[i], A[i + 1]);
A[i + 1] = max(0, A[i + 1] - B[i]);
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int A[100010], B[100010];
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];
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += min(B[i], A[i]);
B[i] = max(B[i] - A[i], 0);
ans += min(B[i], A[i + 1]);
A[i + 1] = max(0, A[i + 1] - B[i]);
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,405 | 766,406 | u475843109 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
// combination com(200010);
int n;
cin >> n;
VE a(n + 1);
rep(i, n + 1) cin >> a[i];
VE b(n);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i] <= b[i]) {
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;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
COUT(ans);
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-14)
#define pb push_back
long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
struct edge {
ll to, cost;
};
typedef long double ld;
using Graph = vector<VE>;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(15);
// combination com(200010);
int n;
cin >> n;
VE a(n + 1);
rep(i, n + 1) cin >> a[i];
VE b(n);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) {
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;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
COUT(ans);
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 766,407 | 766,408 | u809967037 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
void zero(long long &a) {
if (a < 0)
a = 0;
}
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[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A[i], B[i]);
B[i] -= A[i];
zero(B[i]);
ans += min(A[i + 1], B[i]);
A[i + 1] -= B[i];
zero(A[i + 1]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void zero(long long &a) {
if (a < 0)
a = 0;
}
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[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += min(A[i], B[i]);
B[i] -= A[i];
zero(B[i]);
ans += min(A[i + 1], B[i]);
A[i + 1] -= B[i];
zero(A[i + 1]);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,409 | 766,410 | u615258936 | 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 + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int cnt = 0;
for (int i = 0; i < N; i++) {
long long ii = A.at(i) + A.at(i + 1);
int attack = min(ii, B.at(i));
if (ii < B.at(i))
A.at(i + 1) = 0;
else if (A.at(i) < B.at(i)) {
long long dis = B.at(i) - A.at(i);
A.at(i + 1) -= dis;
}
cnt += attack;
}
cout << cnt << 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 + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long cnt = 0;
for (int i = 0; i < N; i++) {
long long ii = A.at(i) + A.at(i + 1);
int attack = min(ii, B.at(i));
if (ii < B.at(i))
A.at(i + 1) = 0;
else if (A.at(i) < B.at(i)) {
long long dis = B.at(i) - A.at(i);
A.at(i + 1) -= dis;
}
cnt += attack;
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,411 | 766,412 | u615258936 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint n;
cin >> n;
vector<lint> 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];
}
lint ret = 0;
for (int i = 0; i < n; ++i) {
lint t = min(a[i], b[i]);
b[i] -= t;
ret += t;
lint u = min(a[i + 1], b[i]);
a[i] -= u;
ret += u;
}
cout << ret << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
lint n;
cin >> n;
vector<lint> 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];
}
lint ret = 0;
for (int i = 0; i < n; ++i) {
lint t = min(a[i], b[i]);
b[i] -= t;
ret += t;
lint u = min(a[i + 1], b[i]);
a[i + 1] -= u;
ret += u;
}
cout << ret << "\n";
return 0;
} | [
"assignment.change"
] | 766,415 | 766,416 | u756088996 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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];
b[i] = 0;
} else {
count += a[i];
b[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;
using ll = long long;
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];
ll count = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
count += b[i];
b[i] = 0;
} else {
count += a[i];
b[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.change"
] | 766,421 | 766,422 | u180257813 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
using namespace std;
#define N 10000000000000
int main() {
int n;
cin >> n;
int monster[n + 1];
int people[n];
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
for (int i = 0; i < n; i++) {
cin >> people[i];
}
int count = 0;
for (int i = 0; i < n; i++) {
if (monster[i] >= people[i]) {
monster[i] -= people[i];
count += people[i];
} else {
if (monster[i] + monster[i + 1] <= people[i]) {
count += monster[i];
count += monster[i + 1];
monster[i] = 0;
monster[i + 1] = 0;
} else {
count += people[i];
monster[i + 1] = monster[i + 1] + monster[i] - people[i];
monster[i] = 0;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
using namespace std;
#define N 10000000000000
int main() {
long n;
cin >> n;
long monster[n + 1];
long people[n];
for (int i = 0; i <= n; i++) {
cin >> monster[i];
}
for (int i = 0; i < n; i++) {
cin >> people[i];
}
long count = 0;
for (int i = 0; i < n; i++) {
if (monster[i] >= people[i]) {
monster[i] -= people[i];
count += people[i];
} else {
if (monster[i] + monster[i + 1] <= people[i]) {
count += monster[i];
count += monster[i + 1];
monster[i] = 0;
monster[i + 1] = 0;
} else {
count += people[i];
monster[i + 1] = monster[i + 1] + monster[i] - people[i];
monster[i] = 0;
}
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,423 | 766,424 | u616017354 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.