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 <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
#define mod 998244353
#define ll long long int
#define pb(x) push_back(x)
#define MP(x, y) make_pair(x, y)
using namespace std;
ll power(ll a, ll b, ll m) {
if (b == 0)
return (1);
ll sol = power(a, b / 2, m);
sol = (sol * sol) % m;
if (b % 2 == 1)
sol = (sol * a) % m;
return (sol);
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else {
return gcd(b, a % b);
}
}
ll a[100002], b[100002];
void solve() {
int n, sum = 0, cnt = 0;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum = sum + a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
a[i] = a[i] - b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
a[i] = 0;
}
if (a[i + 1] >= b[i]) {
a[i + 1] = a[i + 1] - b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i + 1];
a[i + 1] = 0;
}
}
for (int i = 0; i < n + 1; i++) {
cnt = cnt + a[i];
}
cout << sum - cnt;
}
int main() {
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
#define mod 998244353
#define ll long long int
#define pb(x) push_back(x)
#define MP(x, y) make_pair(x, y)
using namespace std;
ll power(ll a, ll b, ll m) {
if (b == 0)
return (1);
ll sol = power(a, b / 2, m);
sol = (sol * sol) % m;
if (b % 2 == 1)
sol = (sol * a) % m;
return (sol);
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else {
return gcd(b, a % b);
}
}
ll a[100002], b[100002];
void solve() {
ll n, sum = 0, cnt = 0;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum = sum + a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
a[i] = a[i] - b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
a[i] = 0;
}
if (a[i + 1] >= b[i]) {
a[i + 1] = a[i + 1] - b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i + 1];
a[i + 1] = 0;
}
}
for (int i = 0; i < n + 1; i++) {
cnt = cnt + a[i];
}
cout << sum - cnt;
}
int main() {
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | [
"variable_declaration.type.change"
] | 768,467 | 768,468 | u773115096 | 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> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n + 1) cin >> b[i];
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a[i];
count += a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count += b[i];
} else {
count += a[i + 1];
a[i + 1] = 0;
}
} else {
count += b[i];
}
}
cout << count << 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<long long> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<long long> b(n);
rep(i, n + 1) cin >> b[i];
long long count = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a[i];
count += a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count += b[i];
} else {
count += a[i + 1];
a[i + 1] = 0;
}
} else {
count += b[i];
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,469 | 768,470 | u895393304 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
LL ahako[100010];
LL bhako[100010];
int main() {
LL n;
LL a = 0;
LL res = 0;
cin >> n;
rep(i, 0, n + 1) { cin >> ahako[i]; }
rep(i, 0, n) { cin >> bhako[i]; }
rep(i, 0, n) {
if (a > ahako[i]) {
res += ahako[i];
a = bhako[i];
} else {
if ((ahako[i] - a) > bhako[i]) {
res += bhako[i] + a;
a = 0;
} else {
res += ahako[i] + a;
a = bhako[i] - ahako[i];
}
}
}
res += min(a, ahako[n]);
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define rep(i, j, k) for (int i = j; i < k; i++)
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
LL ahako[100010];
LL bhako[100010];
int main() {
LL n;
LL a = 0;
LL res = 0;
cin >> n;
rep(i, 0, n + 1) { cin >> ahako[i]; }
rep(i, 0, n) { cin >> bhako[i]; }
rep(i, 0, n) {
if (a > ahako[i]) {
res += ahako[i];
a = bhako[i];
} else {
if ((ahako[i] - a) > bhako[i]) {
res += bhako[i] + a;
a = 0;
} else {
res += ahako[i];
a = bhako[i] + a - ahako[i];
}
}
}
res += min(a, ahako[n]);
cout << res << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 768,471 | 768,472 | u400497478 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int savers_count;
vector<int> monsters_counts;
vector<int> capacities;
cin >> savers_count;
for (int i = 0; i < savers_count + 1; i++) {
int m;
cin >> m;
monsters_counts.push_back(m);
}
for (int i = 0; i < savers_count; i++) {
int c;
cin >> c;
capacities.push_back(c);
}
int defeats_count = 0;
for (int i = 0; i < savers_count + 1; i++) {
defeats_count += min(monsters_counts[i], capacities[i]);
const int exceed = capacities[i] - monsters_counts[i];
if (exceed > 0) {
const int extra_defeats = min(monsters_counts[i + 1], exceed);
monsters_counts[i + 1] -= extra_defeats;
defeats_count += extra_defeats;
}
}
cout << defeats_count << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int savers_count;
vector<int> monsters_counts;
vector<int> capacities;
cin >> savers_count;
for (int i = 0; i < savers_count + 1; i++) {
int m;
cin >> m;
monsters_counts.push_back(m);
}
for (int i = 0; i < savers_count; i++) {
int c;
cin >> c;
capacities.push_back(c);
}
long long defeats_count = 0;
for (int i = 0; i < savers_count; i++) {
defeats_count += min(monsters_counts[i], capacities[i]);
const int exceed = capacities[i] - monsters_counts[i];
if (exceed > 0) {
const int extra_defeats = min(monsters_counts[i + 1], exceed);
monsters_counts[i + 1] -= extra_defeats;
defeats_count += extra_defeats;
}
}
cout << defeats_count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 768,473 | 768,474 | u674347990 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (size_t i = 0; i < n; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else {
ans += a.at(i);
b.at(i) -= a.at(i);
if (b.at(i) >= a.at(i + 1)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
} else {
ans += b.at(i);
a.at(i + 1) -= b.at(i);
}
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t ans = 0;
for (size_t i = 0; i < n; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else {
ans += a.at(i);
b.at(i) -= a.at(i);
if (b.at(i) >= a.at(i + 1)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
} else {
ans += b.at(i);
a.at(i + 1) -= b.at(i);
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,475 | 768,476 | u229148215 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
std::vector<int> a(n + 1);
std::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 beat = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
beat += tmp;
tmp = min(a[i + 1], b[i]);
a[i + 1] -= tmp;
beat += tmp;
}
cout << beat << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
std::vector<int> a(n + 1);
std::vector<int> b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll beat = 0;
for (int i = 0; i < n; i++) {
int tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
beat += tmp;
tmp = min(a[i + 1], b[i]);
a[i + 1] -= tmp;
beat += tmp;
}
cout << beat << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,481 | 768,482 | u255172538 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
ans += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 768,483 | 768,484 | u366677622 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int b[100005];
int main() {
scanf("%d", &n);
int ans = 0;
for (int i = 0; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
ans += a[i];
if (b[i] > a[i] + a[i + 1]) {
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];
}
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int b[100005];
int main() {
scanf("%d", &n);
long long ans = 0;
for (int i = 0; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
ans += a[i];
if (b[i] > a[i] + a[i + 1]) {
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];
}
}
printf("%lld\n", ans);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,489 | 768,490 | u623136228 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long n, a[10001], b[10001], ans, zero = 0;
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];
if (b[i] > a[i]) {
ans += min(a[i] + a[i + 1], b[i]);
a[i + 1] = max(zero, a[i] + a[i + 1] - b[i]);
} else
ans += b[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, a[100005], b[100001], ans, zero = 0;
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];
if (b[i] > a[i]) {
ans += min(a[i] + a[i + 1], b[i]);
a[i + 1] = max(zero, a[i] + a[i + 1] - b[i]);
} else
ans += b[i];
}
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,495 | 768,494 | u768879181 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
ans += B[i];
} else {
ans += A[i];
B[i] = B[i] - A[i];
if (A[i + 1] > B[i]) {
ans += B[i];
A[i + 1] = A[i + 1] - B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t 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];
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] > B[i]) {
ans += B[i];
} else {
ans += A[i];
B[i] = B[i] - A[i];
if (A[i + 1] > B[i]) {
ans += B[i];
A[i + 1] = A[i + 1] - B[i];
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,498 | 768,499 | u415916075 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] -= 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
for (int i = 0; i <= n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change"
] | 768,504 | 768,505 | u559765551 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef vector<pii> vp;
typedef vector<pci> vpc;
typedef pair<int, pii> piii;
int OO = 2e9;
const double eps = 1e-9;
const int N = 500000;
int mx = -1e9, mn = 1e9;
ll arr[N], arr2[N];
int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x > y ? -1 : 1; }
int main() {
int n;
cin >> n;
lp(i, n + 1) cin >> arr[i];
lp(i, n) cin >> arr2[i];
ll a = 0;
lp(i, n) {
int x = min(arr[i], arr2[i]);
// cout << i << ' ' << arr[i] << ' '<<arr2[i]<<endl;
a += x;
arr[i] -= x;
arr2[i] -= x;
if (arr2[i]) {
// cout <<arr2[i] << ' ' << i << endl;
int y = min(arr[i + 1], arr2[i]);
a += y;
arr[i] -= y;
arr2[i] -= y;
}
// cout << a << endl;
}
cout << a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef vector<pii> vp;
typedef vector<pci> vpc;
typedef pair<int, pii> piii;
int OO = 2e9;
const double eps = 1e-9;
const int N = 500000;
int mx = -1e9, mn = 1e9;
ll arr[N], arr2[N];
int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x > y ? -1 : 1; }
int main() {
int n;
cin >> n;
lp(i, n + 1) cin >> arr[i];
lp(i, n) cin >> arr2[i];
ll a = 0;
lp(i, n) {
int x = min(arr[i], arr2[i]);
// cout << i << ' ' << arr[i] << ' '<<arr2[i]<<endl;
a += x;
arr[i] -= x;
arr2[i] -= x;
if (arr2[i]) {
// cout <<arr2[i] << ' ' << i << endl;
int y = min(arr[i + 1], arr2[i]);
a += y;
arr[i + 1] -= y;
arr2[i] -= y;
}
// cout << a << endl;
}
cout << a << endl;
return 0;
}
| [
"assignment.change"
] | 768,508 | 768,509 | u026389788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef vector<pii> vp;
typedef vector<pci> vpc;
typedef pair<int, pii> piii;
int OO = 2e9;
const double eps = 1e-9;
const int N = 500000;
int mx = -1e9, mn = 1e9;
ll arr[N], arr2[N];
int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x > y ? -1 : 1; }
int main() {
int n;
cin >> n;
lp(i, n + 1) cin >> arr[i];
lp(i, n) cin >> arr2[i];
int a = 0;
lp(i, n) {
int x = min(arr[i], arr2[i]);
// cout << i << ' ' << arr[i] << ' '<<arr2[i]<<endl;
a += x;
arr[i] -= x;
arr2[i] -= x;
if (arr2[i]) {
// cout <<arr2[i] << ' ' << i << endl;
int y = min(arr[i + 1], arr2[i]);
a += y;
arr[i] -= y;
arr2[i] -= y;
}
// cout << a << endl;
}
cout << a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef vector<pii> vp;
typedef vector<pci> vpc;
typedef pair<int, pii> piii;
int OO = 2e9;
const double eps = 1e-9;
const int N = 500000;
int mx = -1e9, mn = 1e9;
ll arr[N], arr2[N];
int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x > y ? -1 : 1; }
int main() {
int n;
cin >> n;
lp(i, n + 1) cin >> arr[i];
lp(i, n) cin >> arr2[i];
ll a = 0;
lp(i, n) {
int x = min(arr[i], arr2[i]);
// cout << i << ' ' << arr[i] << ' '<<arr2[i]<<endl;
a += x;
arr[i] -= x;
arr2[i] -= x;
if (arr2[i]) {
// cout <<arr2[i] << ' ' << i << endl;
int y = min(arr[i + 1], arr2[i]);
a += y;
arr[i + 1] -= y;
arr2[i] -= y;
}
// cout << a << endl;
}
cout << a << endl;
return 0;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 768,510 | 768,509 | u026389788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef vector<pii> vp;
typedef vector<pci> vpc;
typedef pair<int, pii> piii;
int OO = 2e9;
const double eps = 1e-9;
const int N = 500000;
int mx = -1e9, mn = 1e9;
int arr[N], arr2[N];
int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x > y ? -1 : 1; }
int main() {
int n;
cin >> n;
lp(i, n + 1) cin >> arr[i];
lp(i, n) cin >> arr2[i];
int a = 0;
lp(i, n) {
int x = min(arr[i], arr2[i]);
// cout << i << ' ' << arr[i] << ' '<<arr2[i]<<endl;
a += x;
arr[i] -= x;
arr2[i] -= x;
if (arr2[i]) {
// cout <<arr2[i] << ' ' << i << endl;
int y = min(arr[i + 1], arr2[i]);
a += y;
arr[i] -= y;
arr2[i] -= y;
}
// cout << a << endl;
}
cout << a << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; ++i)
#define lpx(i, x, n) for (int i = x; i < n; ++i)
#define all(v) v.begin(), v.end()
#define sz(v) (int(v.size()))
typedef unsigned long long ul;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<int>> vii;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef vector<pii> vp;
typedef vector<pci> vpc;
typedef pair<int, pii> piii;
int OO = 2e9;
const double eps = 1e-9;
const int N = 500000;
int mx = -1e9, mn = 1e9;
ll arr[N], arr2[N];
int dcmp(double x, double y) { return fabs(x - y) <= eps ? 0 : x > y ? -1 : 1; }
int main() {
int n;
cin >> n;
lp(i, n + 1) cin >> arr[i];
lp(i, n) cin >> arr2[i];
ll a = 0;
lp(i, n) {
int x = min(arr[i], arr2[i]);
// cout << i << ' ' << arr[i] << ' '<<arr2[i]<<endl;
a += x;
arr[i] -= x;
arr2[i] -= x;
if (arr2[i]) {
// cout <<arr2[i] << ' ' << i << endl;
int y = min(arr[i + 1], arr2[i]);
a += y;
arr[i + 1] -= y;
arr2[i] -= y;
}
// cout << a << endl;
}
cout << a << endl;
return 0;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 768,511 | 768,509 | u026389788 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) {
b[i] -= a[i + 1];
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
}
} else {
a[i] -= b[i];
ans += b[i];
b[i] = 0;
}
// cout << a[0] << " " << a[1] << " " << a[2] << endl;
}
cout << ans;
return 0;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) {
b[i] -= a[i + 1];
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
}
} else {
a[i] -= b[i];
ans += b[i];
b[i] = 0;
}
// cout << a[0] << " " << a[1] << " " << a[2] << endl;
}
cout << ans;
return 0;
} | [
"variable_declaration.type.change"
] | 768,518 | 768,519 | u947304300 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 2, 0), b(n + 1, 0);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long crr = 0;
long long sum = 0;
for (int i = 0; i < n + 1; i++) {
sum += min(a[i], b[i]);
crr = max(0LL, b[i] - a[i]);
if (crr > 0) {
long long del = min(a[i + 1], crr);
a[i] -= del;
sum += del;
}
}
cout << sum << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 2, 0), b(n + 1, 0);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long crr = 0;
long long sum = 0;
for (int i = 0; i < n + 1; i++) {
sum += min(a[i], b[i]);
crr = max(0LL, b[i] - a[i]);
if (crr > 0) {
long long del = min(a[i + 1], crr);
a[i + 1] -= del;
sum += del;
}
}
cout << sum << endl;
}
| [
"assignment.change"
] | 768,521 | 768,522 | u770509135 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#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 a[51], sum, n, flag = 0, m, count = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> m;
if (a[i] >= m) {
count = count + m;
continue;
} else {
if (m >= a[i] + a[i + 1]) {
count = count + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] = a[i + 1] - (m - a[i]);
count = count + m;
}
}
}
cout << count << endl;
return 0;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#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() {
long a[100002], sum, n, flag = 0, m, count = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> m;
if (a[i] >= m) {
count = count + m;
continue;
} else {
if (m >= a[i] + a[i + 1]) {
count = count + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] = a[i + 1] - (m - a[i]);
count = count + m;
}
}
}
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,525 | 768,526 | u384161668 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
#define SZ(x) ((int)(x).size())
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int mons = min(A[i], B[i]);
B[i] -= mons;
ans += mons;
mons = min(A[i + 1], B[i]);
A[i + 1] -= mons;
ans += mons;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define SZ(x) ((int)(x).size())
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 ans = 0;
for (int i = 0; i < N; i++) {
// B[i]ใงA[i]ใฎใขใณในใฟใผใๅใ
ll mons = min(A[i], B[i]);
B[i] -= mons; //ๅใใใขใณในใฟใผใฎๆฐใๆธใ
ans += mons;
// B[i]ใงA[i+1]ใฎใขใณในใฟใผใๅใ
mons = min(A[i + 1], B[i]);
A[i + 1] -= mons; //ๆฎใใฎใขใณในใฟใผใฎๆฐใๆธใ
ans += mons;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 768,527 | 768,528 | u725069695 | cpp |
p02959 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int N;
bool check(int p[]) {
for (int i = 0; i < N - 1; i++) {
if (p[i] <= p[i + 1]) {
continue;
} else {
return false;
}
}
return true;
}
int main(void) {
int i, j;
cin >> N;
int A[N + 2];
int tmp;
for (i = 0; i < N + 1; i++) {
cin >> A[i + 1];
}
int B[N + 1];
rep(i, N) { cin >> B[i + 1]; }
int sum = 0;
for (i = N; i >= 1; i--) {
tmp = min(A[i + 1], B[i]);
B[i] -= tmp;
sum += tmp;
// cout << tmp << endl;
tmp = min(A[i], B[i]);
// cout << tmp << endl;
sum += tmp;
A[i] -= tmp;
}
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int N;
bool check(int p[]) {
for (int i = 0; i < N - 1; i++) {
if (p[i] <= p[i + 1]) {
continue;
} else {
return false;
}
}
return true;
}
int main(void) {
int i, j;
cin >> N;
int A[N + 2];
int tmp;
for (i = 0; i < N + 1; i++) {
cin >> A[i + 1];
}
int B[N + 1];
rep(i, N) { cin >> B[i + 1]; }
ll sum = 0;
for (i = N; i >= 1; i--) {
tmp = min(A[i + 1], B[i]);
B[i] -= tmp;
sum += tmp;
// cout << tmp << endl;
tmp = min(A[i], B[i]);
// cout << tmp << endl;
sum += tmp;
A[i] -= tmp;
}
cout << sum;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,531 | 768,532 | u894950682 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (r - 1); i >= l; i--)
#define P pair<int, int>
#define ll long long
using namespace std;
int a[100005], b[100005];
int main() {
int n;
cin >> n;
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
int s = 0;
rep(i, 0, n) {
if (b[i] >= a[i])
s += a[i], b[i] -= a[i], a[i] = 0;
else
a[i] -= b[i], s += b[i], b[i] = 0;
if (b[i] >= a[i + 1])
s += a[i + 1], b[i] -= a[i + 1], a[i + 1] = 0;
else
a[i + 1] -= b[i], s += b[i];
}
cout << s;
// while(1);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (r - 1); i >= l; i--)
#define P pair<int, int>
#define ll long long
using namespace std;
ll a[100005], b[100005];
int main() {
int n;
cin >> n;
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
ll s = 0;
rep(i, 0, n) {
if (b[i] >= a[i])
s += a[i], b[i] -= a[i], a[i] = 0;
else
a[i] -= b[i], s += b[i], b[i] = 0;
if (b[i] >= a[i + 1])
s += a[i + 1], b[i] -= a[i + 1], a[i + 1] = 0;
else
a[i + 1] -= b[i], s += b[i];
}
cout << s;
// while(1);
return 0;
} | [
"variable_declaration.type.change"
] | 768,537 | 768,538 | u425780319 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n], c = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
c += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int d = a[n];
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
a[i] = 0;
a[i + 1] -= b[i];
if (a[i + 1] < 0) {
a[i + 1] = 0;
}
} else {
a[i] -= b[i];
}
c -= a[i];
}
c -= a[n];
cout << c << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
int long long c = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
c += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int d = a[n];
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
a[i] = 0;
a[i + 1] -= b[i];
if (a[i + 1] < 0) {
a[i + 1] = 0;
}
} else {
a[i] -= b[i];
}
c -= a[i];
}
c -= a[n];
cout << c << endl;
return 0;
} | [
"variable_declaration.add"
] | 768,553 | 768,554 | u568787962 | cpp |
p02959 | #include <bits/stdc++.h>
#include <ctime>
#include <fstream>
#include <stdlib.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int inf = 1e9;
vector<int> a;
vector<int> b;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(100);
// freopen("input.txt","r",stdin);
int n;
cin >> n;
int ans = 0;
int tek = 0;
a.resize(n + 1);
b.resize(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
b[n] = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#include <ctime>
#include <fstream>
#include <stdlib.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int inf = 1e9;
vector<ll> a;
vector<ll> b;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(100);
// freopen("input.txt","r",stdin);
int n;
cin >> n;
ll ans = 0;
ll tek = 0;
a.resize(n + 1);
b.resize(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
b[n] = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,557 | 768,558 | u279130306 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
int s = 0;
for (int i = 0; i < m; i++) {
if (a[i] >= b[i]) {
s += b[i];
continue;
}
if (a[i] + a[i + 1] > b[i]) {
s += b[i];
a[i + 1] = a[i] + a[i + 1] - b[i];
continue;
}
if (a[i] + a[i + 1] <= b[i]) {
s += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
printf("%d\n", s);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
long long s = 0;
for (int i = 0; i < m; i++) {
if (a[i] >= b[i]) {
s += b[i];
continue;
}
if (a[i] + a[i + 1] > b[i]) {
s += b[i];
a[i + 1] = a[i] + a[i + 1] - b[i];
continue;
}
if (a[i] + a[i + 1] <= b[i]) {
s += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
printf("%lld\n", s);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,559 | 768,560 | u064085255 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
int s = 0;
for (int i = 0; i < m; i++) {
if (a[i] > b[i]) {
s += b[i];
continue;
}
if (a[i] + a[i + 1] > b[i]) {
s += b[i];
a[i + 1] = a[i] + a[i + 1] - b[i];
continue;
}
if (a[i] + a[i + 1] <= b[i]) {
s += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
printf("%d\n", s);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m;
scanf("%d", &m);
int a[m + 1], b[m];
for (int i = 0; i < m + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
long long s = 0;
for (int i = 0; i < m; i++) {
if (a[i] >= b[i]) {
s += b[i];
continue;
}
if (a[i] + a[i + 1] > b[i]) {
s += b[i];
a[i + 1] = a[i] + a[i + 1] - b[i];
continue;
}
if (a[i] + a[i + 1] <= b[i]) {
s += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
printf("%lld\n", s);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,561 | 768,560 | u064085255 | cpp |
p02959 | #include <iostream>
#include <math.h>
using namespace std;
int n, m, a[100100], ans, b[100100];
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];
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] <= a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << ans << endl;
} | #include <iostream>
#include <math.h>
using namespace std;
long long n, m, a[100100], ans, b[100100];
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];
for (int i = 1; i <= n; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] <= a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,562 | 768,563 | u019229278 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
// cout <<"A:" << A[i] << endl;
}
for (int i = 0; i < N; i++) {
cin >> B[i];
// cout << B[i] << endl;
}
int count = 0;
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
A[i] -= m;
B[i] -= m;
count += m;
// cout <<"sub1" <<count << endl;
m = min(A[i + 1], B[i]);
A[i + 1] -= m;
B[i] -= m;
count += m;
// cout <<"sub2" <<count << endl;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long count = 0;
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
A[i] -= m;
B[i] -= m;
count += m;
m = min(A[i + 1], B[i]);
A[i + 1] -= m;
B[i] -= m;
count += m;
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 768,564 | 768,565 | u223172354 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
A[i] -= m;
B[i] -= m;
count += m;
m = min(A[i + 1], B[i]);
A[i + 1] -= m;
B[i] -= m;
count += m;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long count = 0;
for (int i = 0; i < N; i++) {
int m = min(A[i], B[i]);
A[i] -= m;
B[i] -= m;
count += m;
m = min(A[i + 1], B[i]);
A[i + 1] -= m;
B[i] -= m;
count += m;
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 768,566 | 768,565 | u223172354 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
int mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i] && r <= mon[i]) {
r = he[i] - mon[i] + r;
sumn += mon[i];
} else if (r > mon[i]) {
r = he[i];
sumn += mon[i];
} else if (r + he[i] < mon[i]) {
sumn += r + he[i];
r = 0;
}
}
r = min(r, mon[n + 1]);
cout << sumn + r;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
ll mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i] && r <= mon[i]) {
r = he[i] - mon[i] + r;
sumn += mon[i];
} else if (r > mon[i]) {
r = he[i];
sumn += mon[i];
} else if (r + he[i] < mon[i]) {
sumn += r + he[i];
r = 0;
}
}
r = min(r, mon[n + 1]);
cout << sumn + r;
return 0;
} | [
"variable_declaration.type.change"
] | 768,569 | 768,570 | u730153732 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 10010;
int n;
int mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i] && r <= mon[i]) {
r = he[i] - mon[i] + r;
sumn += mon[i];
} else if (r > mon[i]) {
r = he[i];
sumn += mon[i];
} else if (r + he[i] < mon[i]) {
sumn += r + he[i];
r = 0;
}
}
r = min(r, mon[n + 1]);
cout << sumn + r;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
int n;
ll mon[N + 1], he[N], sumn, r = 0;
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> mon[i];
for (int i = 1; i <= n; i++)
cin >> he[i];
for (int i = 1; i <= n; i++) {
if (he[i] + r >= mon[i] && r <= mon[i]) {
r = he[i] - mon[i] + r;
sumn += mon[i];
} else if (r > mon[i]) {
r = he[i];
sumn += mon[i];
} else if (r + he[i] < mon[i]) {
sumn += r + he[i];
r = 0;
}
}
r = min(r, mon[n + 1]);
cout << sumn + r;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 768,571 | 768,570 | u730153732 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) < b.at(i)) {
b.at(i) -= a.at(i);
m += a.at(i);
if (a.at(i + 1) < b.at(i)) {
m += a.at(i + 1);
a.at(i + 1) = 0;
} else {
m += b.at(i);
a.at(i + 1) -= b.at(i);
}
} else {
m += b.at(i);
b.at(i) = 0;
}
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long int m = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) < b.at(i)) {
b.at(i) -= a.at(i);
m += a.at(i);
if (a.at(i + 1) < b.at(i)) {
m += a.at(i + 1);
a.at(i + 1) = 0;
} else {
m += b.at(i);
a.at(i + 1) -= b.at(i);
}
} else {
m += b.at(i);
b.at(i) = 0;
}
}
cout << m << endl;
}
| [
"variable_declaration.type.widen.change"
] | 768,574 | 768,575 | u072080927 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
} else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, ans = 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++) {
if (A[i] <= B[i]) {
B[i] -= A[i];
ans += A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
B[i] -= A[i + 1];
ans += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
ans += B[i];
B[i] = 0;
}
} else {
A[i] -= B[i];
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 768,589 | 768,590 | u122034453 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] > b[i]) {
ans += b[i];
continue;
} else {
ans += a[i + 1];
b[i] -= a[i + 1];
if (a[i] > b[i]) {
ans += b[i];
a[i] -= b[i];
continue;
} else {
ans += a[i];
a[i] = 0;
continue;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1];
long long int b[n];
long long int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = n - 1; i >= 0; i--) {
if (a[i + 1] > b[i]) {
ans += b[i];
continue;
} else {
ans += a[i + 1];
b[i] -= a[i + 1];
if (a[i] > b[i]) {
ans += b[i];
a[i] -= b[i];
continue;
} else {
ans += a[i];
a[i] = 0;
continue;
}
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change"
] | 768,591 | 768,592 | u578806044 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> An(N + 2, 0);
for (int i = 1; i <= N + 1; i++) {
cin >> An[i];
}
vector<ll> Bn(N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> Bn[i];
}
int sum = 0;
for (int i = 1; i <= N + 1; i++) {
if (An[i] <= Bn[i - 1]) {
sum += An[i];
int sub = Bn[i - 1] - An[i];
An[i] = 0;
Bn[i - 1] = sub;
} else {
sum += Bn[i - 1];
int sub = An[i] - Bn[i - 1];
An[i] = sub;
Bn[i - 1] = 0;
}
if (An[i] <= Bn[i]) {
sum += An[i];
int sub = Bn[i] - An[i];
An[i] = 0;
Bn[i] = sub;
} else {
sum += Bn[i];
int sub = An[i] - Bn[i];
An[i] = sub;
Bn[i] = 0;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> An(N + 2, 0);
for (int i = 1; i <= N + 1; i++) {
cin >> An[i];
}
vector<ll> Bn(N + 2, 0);
for (int i = 1; i <= N; i++) {
cin >> Bn[i];
}
ll sum = 0;
for (int i = 1; i <= N + 1; i++) {
if (An[i] <= Bn[i - 1]) {
sum += An[i];
int sub = Bn[i - 1] - An[i];
An[i] = 0;
Bn[i - 1] = sub;
} else {
sum += Bn[i - 1];
int sub = An[i] - Bn[i - 1];
An[i] = sub;
Bn[i - 1] = 0;
}
if (An[i] <= Bn[i]) {
sum += An[i];
int sub = Bn[i] - An[i];
An[i] = 0;
Bn[i] = sub;
} else {
sum += Bn[i];
int sub = An[i] - Bn[i];
An[i] = sub;
Bn[i] = 0;
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 768,597 | 768,598 | u146779775 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n + 1);
vector<long long int> c(n + 1, 0);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
long long int x;
cin >> x;
long long int next = max(x - a[i], (long long int)0);
c[i] += min(x, a[i]);
a[i] = max(a[i] - x, (long long int)0);
c[i + 1] += min(next, a[i + 1]);
a[i + 1] = max(a[i + 1] - next, (long long int)0);
}
cout << accumulate(c.begin(), c.end(), 0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n + 1);
vector<long long int> c(n + 1, 0);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
long long int x;
cin >> x;
long long int next = max(x - a[i], (long long int)0);
c[i] += min(x, a[i]);
a[i] = max(a[i] - x, (long long int)0);
c[i + 1] += min(next, a[i + 1]);
a[i + 1] = max(a[i + 1] - next, (long long int)0);
}
cout << accumulate(c.begin(), c.end(), (long long int)0) << endl;
return 0;
} | [
"type_conversion.add"
] | 768,599 | 768,600 | u323492289 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
long int monsters[n + 1];
long int heroes[n];
for (int i = 0; i <= n; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> heroes[i];
int i = 0, k = 0;
while (k < n && i <= n) {
if (k == i || k + 1 == i) {
if (monsters[i] > heroes[k]) {
cnt += heroes[k];
monsters[i] -= heroes[k];
heroes[k] -= heroes[k];
k++;
} else if (heroes[k] > monsters[i]) {
cnt += monsters[i];
heroes[k] -= monsters[i];
monsters[i] -= monsters[i];
i++;
} else if (heroes[k] == monsters[i]) {
cnt += heroes[k];
heroes[k] = monsters[i] = 0;
k++;
i++;
}
} else {
if (i > k)
k++;
else
i++;
}
}
cout << cnt;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long int n, cnt = 0;
cin >> n;
long int monsters[n + 1];
long int heroes[n];
for (long int i = 0; i <= n; i++)
cin >> monsters[i];
for (long int i = 0; i < n; i++)
cin >> heroes[i];
long int i = 0, k = 0;
while (k < n && i <= n) {
if (k == i || k + 1 == i) {
if (monsters[i] > heroes[k]) {
cnt += heroes[k];
monsters[i] -= heroes[k];
heroes[k] -= heroes[k];
k++;
} else if (heroes[k] > monsters[i]) {
cnt += monsters[i];
heroes[k] -= monsters[i];
monsters[i] -= monsters[i];
i++;
} else if (heroes[k] == monsters[i]) {
cnt += heroes[k];
heroes[k] = monsters[i] = 0;
k++;
i++;
}
} else {
if (i > k)
k++;
else
i++;
}
}
cout << cnt;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,601 | 768,602 | u010732047 | cpp |
p02959 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i + 1]);
a[i + 1] = b[i] - a[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
} else
sum += b[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i + 1]);
a[i + 1] -= b[i] - a[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
} else
sum += b[i];
}
cout << sum << endl;
}
| [
"assignment.value.change"
] | 768,605 | 768,606 | u601344838 | cpp |
p02959 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
int a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i + 1]);
a[i + 1] = b[i] - a[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
} else
sum += b[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define LL long long
using namespace std;
int n;
LL a[100000 + 5], b[100000 + 5];
LL sum = 0;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++) {
scanf("%lld", &b[i]);
if (b[i] > a[i]) {
sum += min(b[i], a[i] + a[i + 1]);
a[i + 1] -= b[i] - a[i];
if (a[i + 1] < 0)
a[i + 1] = 0;
} else
sum += b[i];
}
cout << sum << endl;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"assignment.value.change"
] | 768,607 | 768,606 | u601344838 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long long total = 0;
for (int i = 0; i < N; i++) {
hit = min(monster.at(N - i), hero.at(N - 1 - i));
monster.at(N - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
hit = min(monster.at(N - 1 - i), hero.at(N - 1 - i));
monster.at(N - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
}
cout << total << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long long total = 0;
for (int i = 0; i < N; i++) {
hit = min(monster.at(N - i), hero.at(N - 1 - i));
monster.at(N - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
hit = min(monster.at(N - 1 - i), hero.at(N - 1 - i));
monster.at(N - 1 - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
}
cout << total << endl;
return 0;
}
| [
"assignment.change"
] | 768,608 | 768,609 | u578276786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long total = 0;
for (int i = 0; i < N; i++) {
hit = min(monster.at(N - i), hero.at(N - 1 - i));
monster.at(N - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
hit = min(monster.at(N - 1 - i), hero.at(N - 1 - i));
monster.at(N - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
}
cout << total << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<long> monster(N + 1);
std::vector<long> hero(N);
for (int i = 0; i < N + 1; i++) {
cin >> monster.at(i);
}
for (int i = 0; i < N; i++) {
cin >> hero.at(i);
}
int cnt = 0;
long hit;
long long total = 0;
for (int i = 0; i < N; i++) {
hit = min(monster.at(N - i), hero.at(N - 1 - i));
monster.at(N - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
hit = min(monster.at(N - 1 - i), hero.at(N - 1 - i));
monster.at(N - 1 - i) -= hit;
hero.at(N - 1 - i) -= hit;
total += hit;
}
cout << total << endl;
return 0;
}
| [
"variable_declaration.type.widen.change",
"assignment.change"
] | 768,610 | 768,609 | u578276786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int d, r, i, n, ar[100009], cnt = 0;
int main() {
cin >> n;
r = n + 1;
for (i = 1; i <= r; i++)
cin >> ar[i];
for (i = 1; i <= n; i++) {
cin >> d;
if (ar[i] >= d) {
cnt += d;
continue;
}
cnt += ar[i];
r = d - ar[i];
if (r >= ar[i + 1]) {
cnt += ar[i + 1];
ar[i + 1] = 0;
continue;
}
cnt += r;
ar[i + 1] -= r;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int d, r, i, n, ar[100009];
ll cnt = 0;
int main() {
cin >> n;
r = n + 1;
for (i = 1; i <= r; i++)
cin >> ar[i];
for (i = 1; i <= n; i++) {
cin >> d;
if (ar[i] >= d) {
cnt += d;
continue;
}
cnt += ar[i];
r = d - ar[i];
if (r >= ar[i + 1]) {
cnt += ar[i + 1];
ar[i + 1] = 0;
continue;
}
cnt += r;
ar[i + 1] -= r;
}
cout << cnt << endl;
return 0;
} | [] | 768,611 | 768,612 | u269219846 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, d;
cin >> n;
int a[n + 2], b[n + 2];
d = 0;
a[0] = 0;
b[0] = 0;
b[n + 1] = 0;
for (int i = 1; i < n + 2; i++)
cin >> a[i];
for (int i = 1; i < n + 1; i++)
cin >> b[i];
for (int i = 1; i < n + 2; i++) {
int e, f;
e = min(a[i], b[i - 1]);
a[i] -= e;
b[i - 1] -= e;
d += e;
f = min(a[i], b[i]);
a[i] -= f;
b[i] -= f;
d += f;
}
cout << d;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, d;
cin >> n;
long long a[n + 2], b[n + 2];
d = 0;
a[0] = 0;
b[0] = 0;
b[n + 1] = 0;
for (int i = 1; i < n + 2; i++)
cin >> a[i];
for (int i = 1; i < n + 1; i++)
cin >> b[i];
for (int i = 1; i < n + 2; i++) {
int e, f;
e = min(a[i], b[i - 1]);
a[i] -= e;
b[i - 1] -= e;
d += e;
f = min(a[i], b[i]);
a[i] -= f;
b[i] -= f;
d += f;
}
cout << d;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,621 | 768,622 | u670773128 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] > a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else
ans += b[i];
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] > a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else
ans += b[i];
}
printf("%lld\n", ans);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,626 | 768,627 | u433665020 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
int ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else
ans += b[i];
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int a[100002];
int b[100002];
long long ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n + 1; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &b[i]);
b[n + 1] = 0;
for (int i = 1; i <= n + 1; i++) {
if (b[i] > a[i]) {
ans += a[i];
b[i] -= a[i];
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else
ans += b[i];
}
printf("%lld\n", ans);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,628 | 768,627 | u433665020 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, tmp, i;
int knockNum;
vector<int> A, B;
// ๅ
ฅๅ --------------------------
cin >> N;
for (i = 0; i < N + 1; i++) {
cin >> tmp;
A.push_back(tmp);
}
for (i = 0; i < N; i++) {
cin >> tmp;
B.push_back(tmp);
}
// ๅใใๆฐใฎใซใฆใณใ --------------------
knockNum = 0;
for (i = 0; i < N; i++) {
// A[i]ใๅใ
if (B[i] > A[i]) {
knockNum += A[i];
B[i] -= A[i];
} else {
knockNum += B[i];
continue;
}
// A[i+1]ใๅใ
if (B[i] > A[i + 1]) {
knockNum += A[i + 1];
A[i + 1] = 0;
} else {
knockNum += B[i];
A[i + 1] -= B[i];
}
}
cout << knockNum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, tmp, i;
long int knockNum;
vector<int> A, B;
// ๅ
ฅๅ --------------------------
cin >> N;
for (i = 0; i < N + 1; i++) {
cin >> tmp;
A.push_back(tmp);
}
for (i = 0; i < N; i++) {
cin >> tmp;
B.push_back(tmp);
}
// ๅใใๆฐใฎใซใฆใณใ --------------------
knockNum = 0;
for (i = 0; i < N; i++) {
// A[i]ใๅใ
if (B[i] > A[i]) {
knockNum += A[i];
B[i] -= A[i];
} else {
knockNum += B[i];
continue;
}
// A[i+1]ใๅใ
if (B[i] > A[i + 1]) {
knockNum += A[i + 1];
A[i + 1] = 0;
} else {
knockNum += B[i];
A[i + 1] -= B[i];
}
}
cout << knockNum << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,631 | 768,632 | u989110852 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100];
long long ans = 0;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1, b; i <= n; ++i) {
cin >> b;
int x = max(0, a[i] - b);
ans += a[i] - x;
b -= a[i] - x;
a[i] = x;
if (b > 0) {
int x = max(0, a[i + 1] - b);
ans += a[i + 1] - x;
b -= a[i + 1] - x;
a[i + 1] = x;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[100005];
long long ans = 0;
for (int i = 1; i <= n + 1; ++i)
cin >> a[i];
for (int i = 1, b; i <= n; ++i) {
cin >> b;
int x = max(0, a[i] - b);
ans += a[i] - x;
b -= a[i] - x;
a[i] = x;
if (b > 0) {
int x = max(0, a[i + 1] - b);
ans += a[i + 1] - x;
b -= a[i + 1] - x;
a[i + 1] = x;
}
}
cout << ans;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 768,640 | 768,638 | u779387275 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
// int in() { int x; scanf("%d", &x); return x; }
// ll lin() { ll x; scanf("%lld", &x); return x; }
void printfv(VI a) {
int n = a.size();
FOR(i, n) cout << a[i] << " ";
}
int main(void) {
int n;
cin >> n;
int a[n + 1], b[n];
FOR(i, n + 1) { cin >> a[i]; }
FOR(i, n) { cin >> b[i]; }
int ans = 0;
FOR(i, n) {
if (b[i] - a[i] > 0) {
if ((b[i] - a[i]) - a[i + 1] >= 0) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
}
} else {
ans += b[i];
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORR(i, a, n) for (int i = a; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
// int in() { int x; scanf("%d", &x); return x; }
// ll lin() { ll x; scanf("%lld", &x); return x; }
void printfv(VI a) {
int n = a.size();
FOR(i, n) cout << a[i] << " ";
}
int main(void) {
ll n;
cin >> n;
ll a[n + 1], b[n];
FOR(i, n + 1) { cin >> a[i]; }
FOR(i, n) { cin >> b[i]; }
ll ans = 0;
FOR(i, n) {
if (b[i] - a[i] > 0) {
if ((b[i] - a[i]) - a[i + 1] >= 0) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
}
} else {
ans += b[i];
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,641 | 768,642 | u522598953 | cpp |
p02959 | #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long int res = 0;
int n, a[100002], b[100001], last;
int i;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
a[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
last = 0;
for (i = n; i > 0; i--) {
// printf(":a[%d]=%d,last=%d,res = %d:\n",i,a[i],last,res);
if (a[i] <= last) {
res = res + a[i];
last = b[i - 1];
} else {
a[i] = a[i] - last;
res = res + last;
if (b[i - 1] <= a[i]) {
res = res + b[i - 1];
last = 0;
} else {
res = res + a[i];
last = b[i - 1] - a[i];
}
}
}
// printf(":res = %d:",res);
// printf("\n a[%d]=%d,last=%d\n",i,a[i],last);
if (a[i] <= last) {
res = res + a[i];
} else {
res = res + last;
}
printf("%d", res);
return 0;
}
| #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
long int res = 0;
int n, a[100002], b[100001], last;
int i;
scanf("%d", &n);
for (i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
a[i] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
last = 0;
for (i = n; i > 0; i--) {
// printf(":a[%d]=%d,last=%d,res = %d:\n",i,a[i],last,res);
if (a[i] <= last) {
res = res + a[i];
last = b[i - 1];
} else {
a[i] = a[i] - last;
res = res + last;
if (b[i - 1] <= a[i]) {
res = res + b[i - 1];
last = 0;
} else {
res = res + a[i];
last = b[i - 1] - a[i];
}
}
}
// printf(":res = %d:",res);
// printf("\n a[%d]=%d,last=%d\n",i,a[i],last);
if (a[i] <= last) {
res = res + a[i];
} else {
res = res + last;
}
printf("%ld", res);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,643 | 768,644 | u917198146 | cpp |
p02959 | #include <bits/stdc++.h>
// LIFE IS NOT A PROBLEM TO BE SOLVED
#define rep(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define F first
#define S second
#define pb push_back
#define debug(a) cout << #a << " = " << a << endl;
#define debug2(a, b) \
cout << #a << " = " << a << " --- " << #b << " = " << b << endl;
#define debugP(a) cout << a.F << " " << a.S << endl;
#define debugM(mat, n, m) \
rep(i, 0, n) { \
rep(j, 0, m) cout << mat[i][j] << " "; \
cout << endl; \
}
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, 0, N + 1) cin >> A[i];
rep(i, 0, N) cin >> B[i];
int tt = 0;
rep(i, 0, N) {
int t = min(B[i], A[i]);
tt += t;
A[i] -= t, B[i] -= t;
t = min(B[i], A[i + 1]);
tt += t;
A[i + 1] -= t, B[i] -= t;
}
cout << tt << '\n';
return 0;
} | #include <bits/stdc++.h>
// LIFE IS NOT A PROBLEM TO BE SOLVED
#define rep(i, a, b) for (int i = (int)a; i < (int)b; i++)
#define F first
#define S second
#define pb push_back
#define debug(a) cout << #a << " = " << a << endl;
#define debug2(a, b) \
cout << #a << " = " << a << " --- " << #b << " = " << b << endl;
#define debugP(a) cout << a.F << " " << a.S << endl;
#define debugM(mat, n, m) \
rep(i, 0, n) { \
rep(j, 0, m) cout << mat[i][j] << " "; \
cout << endl; \
}
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
int main() {
ll N;
cin >> N;
ll A[N + 1], B[N];
rep(i, 0, N + 1) cin >> A[i];
rep(i, 0, N) cin >> B[i];
ll tt = 0;
rep(i, 0, N) {
ll t = min(B[i], A[i]);
tt += t;
A[i] -= t, B[i] -= t;
t = min(B[i], A[i + 1]);
tt += t;
A[i + 1] -= t, B[i] -= t;
}
cout << tt << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 768,645 | 768,646 | u387251466 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> m(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (h[i] <= m[i] + m[i + 1]) {
cnt += h[i];
if (h[i] >= m[i]) {
h[i] -= m[i];
m[i] = 0;
m[i + 1] -= h[i];
} else {
m[i] -= h[i];
}
} else {
cnt += m[i] + m[i + 1];
m[i] = 0;
m[i + 1] = 0;
}
}
cout << cnt << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> m(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> m[i];
}
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long cnt = 0;
for (int i = 0; i < n; i++) {
if (h[i] <= m[i] + m[i + 1]) {
cnt += h[i];
if (h[i] >= m[i]) {
h[i] -= m[i];
m[i] = 0;
m[i + 1] -= h[i];
} else {
m[i] -= h[i];
}
} else {
cnt += m[i] + m[i + 1];
m[i] = 0;
m[i + 1] = 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,654 | 768,655 | u527806673 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> a(n + 2);
std::vector<int> b(n + 1);
int sum = 0;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
cin >> b[i];
}
for (int i = 1; i <= n; ++i) {
//ใขใณในใฟใผใฎๆฐใๅใใๆฐใใๅคงใใใใฐ
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i] = b[i] - a[i]; //ๆฎใๅใใๆฐ
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] = a[i + 1] - b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<long> a(n + 2);
std::vector<long> b(n + 1);
long sum = 0;
for (int i = 1; i <= n + 1; ++i) {
cin >> a[i];
}
for (int i = 1; i <= n; ++i) {
cin >> b[i];
}
for (int i = 1; i <= n; ++i) {
//ใขใณในใฟใผใฎๆฐใๅใใๆฐใใๅคงใใใใฐ
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i] = b[i] - a[i]; //ๆฎใๅใใๆฐ
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] = a[i + 1] - b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,656 | 768,657 | u197699574 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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 + 1; i++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d = min(A[i], B[i]);
A[i] = A[i] - d;
B[i] = B[i] - d;
if (B[i] > 0)
A[i + 1] = A[i + 1] - min(A[i + 1], B[i]);
}
int b = 0;
for (int i = 0; i < N + 1; i++)
b += (C[i] - A[i]);
cout << b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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 + 1; i++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d = min(A[i], B[i]);
A[i] = A[i] - d;
B[i] = B[i] - d;
if (B[i] > 0)
A[i + 1] = A[i + 1] - min(A[i + 1], B[i]);
}
int64_t b = 0;
for (int i = 0; i < N + 1; i++)
b += (C[i] - A[i]);
cout << b;
} | [
"variable_declaration.type.primitive.change"
] | 768,658 | 768,659 | u330919736 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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 + 1; i++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d = min(A[i], B[i]);
A[i] = A[i] - d;
B[i] = B[i] - d;
if (B[i] > 0)
A[i + 1] = A[i + 1] - min(A[i + 1], B[i]);
}
int b = 0;
for (int i = 0; i < N + 1; i++)
b = b + (C[i] - A[i]);
cout << b;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N), C(N + 1);
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 + 1; i++)
C[i] = A[i];
int d = 0;
for (int i = 0; i < N; i++) {
d = min(A[i], B[i]);
A[i] = A[i] - d;
B[i] = B[i] - d;
if (B[i] > 0)
A[i + 1] = A[i + 1] - min(A[i + 1], B[i]);
}
int64_t b = 0;
for (int i = 0; i < N + 1; i++)
b += (C[i] - A[i]);
cout << b;
} | [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 768,660 | 768,659 | u330919736 | cpp |
p02959 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, kill = 0;
cin >> n;
long a[n + 1], b[n];
int i = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (b[i] >= a[i]) //ๅ่
ใๅผทใใจใ
{
kill += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] > 0) //ใพใ ไฝๅใใใใจใ
{
if (b[i] >= a[i + 1]) {
kill += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else //ๅ่
่ฒ ใ
{
a[i + 1] -= b[i];
kill += b[i];
b[i] = 0;
}
}
} else {
a[i] -= b[i];
kill += b[i];
b[i] = 0;
}
}
cout << kill << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
long kill = 0;
cin >> n;
long a[n + 1], b[n];
int i = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (b[i] >= a[i]) //ๅ่
ใๅผทใใจใ
{
kill += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] > 0) //ใพใ ไฝๅใใใใจใ
{
if (b[i] >= a[i + 1]) {
kill += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else //ๅ่
่ฒ ใ
{
a[i + 1] -= b[i];
kill += b[i];
b[i] = 0;
}
}
} else //ๅ่
ใๅผฑใใจใ
{
a[i] -= b[i];
kill += b[i];
b[i] = 0;
}
}
cout << kill << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 768,663 | 768,664 | u503906942 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
ll A[100000];
ll B[100000];
int main(void) {
// Your code here!
int N;
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
ll total = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i] && (A[i] + A[i + 1]) > B[i]) {
total += B[i];
A[i + 1] -= (A[i] - B[i]);
} else if (A[i] < B[i] && (A[i] + A[i + 1]) <= B[i]) {
total += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (A[i] >= B[i]) {
total += B[i];
}
}
cout << total << endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
ll A[100000];
ll B[100000];
int main(void) {
// Your code here!
int N;
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
ll total = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i] && (A[i] + A[i + 1]) > B[i]) {
total += B[i];
A[i + 1] -= (B[i] - A[i]);
} else if (A[i] < B[i] && (A[i] + A[i + 1]) <= B[i]) {
total += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (A[i] >= B[i]) {
total += B[i];
}
}
cout << total << endl;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 768,667 | 768,668 | u279137361 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
int m = min(b[i], a[i + 1]);
b[i] -= m;
a[i + 1] -= m;
ans += m;
m = min(b[i], a[i]);
b[i] -= m;
a[i] -= m;
ans += m;
}
cout << ans << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
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 ans = 0;
for (ll i = n - 1; i >= 0; --i) {
ll m = min(b[i], a[i + 1]);
b[i] -= m;
a[i + 1] -= m;
ans += m;
m = min(b[i], a[i]);
b[i] -= m;
a[i] -= m;
ans += m;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 768,675 | 768,676 | u239409893 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
if (a[i + 1] >= b[i] - a[i]) {
a[i + 1] -= b[i] - a[i];
ans += b[i] - a[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
} else {
ans += b[i];
}
}
// if(a[n+1] <= b[n]) ans += a[n+1];
// else ans += b[n];
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
if (a[i + 1] >= b[i] - a[i]) {
a[i + 1] -= b[i] - a[i];
ans += b[i] - a[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
} else {
ans += b[i];
}
}
// if(a[n+1] <= b[n]) ans += a[n+1];
// else ans += b[n];
cout << ans << endl;
}
| [
"variable_declaration.type.widen.change"
] | 768,679 | 768,680 | u927804708 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1); // ใขใณในใฟใผใฎๆฐ
vector<int> b(n); // ๅใใๆฐ
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
int nokori = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) { // ใขใณในใฟใผ๏ผๅใใๆฐ
sum += b[i];
} else { // ๅใใ๏ผใขใณในใฟใผ
sum += a[i];
nokori = b[i] - a[i];
if (a[i + 1] > nokori) { //ๆฌกใฎ่กใฎใขใณในใฟใผ๏ผๆฎใใฎๅใใๆฐ
sum += nokori;
a[i + 1] -= nokori;
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n + 1); // ใขใณในใฟใผใฎๆฐ
vector<long> b(n); // ๅใใๆฐ
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long sum = 0;
long nokori = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) { // ใขใณในใฟใผ๏ผๅใใๆฐ
sum += b[i];
} else { // ๅใใ๏ผใขใณในใฟใผ
sum += a[i];
nokori = b[i] - a[i];
if (a[i + 1] > nokori) { //ๆฌกใฎ่กใฎใขใณในใฟใผ๏ผๆฎใใฎๅใใๆฐ
sum += nokori;
a[i + 1] -= nokori;
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 768,681 | 768,682 | u272156237 | cpp |
p02959 | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int fight(int m[], int h[], int i, int j) {
int kill = 0;
if (m[i] >= h[j]) {
kill = h[j];
} else {
kill = m[i];
}
m[i] -= kill;
h[j] -= kill;
return kill;
}
int main() {
int num, m[100001] = {}, h[100000] = {};
int ans = 0;
cin >> num;
for (int i = 0; i < num + 1; i++) {
cin >> m[i];
}
for (int i = 0; i < num; i++) {
cin >> h[i];
}
for (int i = 0; i < num; i++) {
ans += fight(m, h, i, i);
ans += fight(m, h, i + 1, i);
}
cout << ans;
return 0;
}
| #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int fight(int m[], int h[], int i, int j) {
int kill = 0;
if (m[i] >= h[j]) {
kill = h[j];
} else {
kill = m[i];
}
m[i] -= kill;
h[j] -= kill;
return kill;
}
int main() {
int num, m[100001] = {}, h[100000] = {};
long ans = 0;
cin >> num;
for (int i = 0; i < num + 1; i++) {
cin >> m[i];
}
for (int i = 0; i < num; i++) {
cin >> h[i];
}
for (int i = 0; i < num; i++) {
ans += fight(m, h, i, i);
ans += fight(m, h, i + 1, i);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"io.output.newline.add"
] | 768,683 | 768,684 | u145483532 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int N, A[100004], B[100004], save, count = 0;
cin >> N;
for (int i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
if (B[i] <= A[i])
count += B[i];
else if ((B[i] - A[i]) <= A[i + 1]) {
// cout << "@" << endl;
count += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
// cout << "#" << endl;
count += (A[i] + A[i + 1]);
A[i + 1] = 0;
}
// cout << count << endl;
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
long long N, A[100004], B[100004], count = 0;
cin >> N;
for (long long i = 0; i < (N + 1); i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
if (B[i] <= A[i])
count += B[i];
else if ((B[i] - A[i]) <= A[i + 1]) {
// cout << "@" << endl;
count += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
// cout << "#" << endl;
count += (A[i] + A[i + 1]);
A[i + 1] = 0;
}
// cout << count << endl;
}
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.remove",
"control_flow.loop.for.initializer.change"
] | 768,687 | 768,688 | u563743611 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
long long mon[100000 + 5], hero[100000 + 5];
cin >> n;
m = n + 1;
for (int i = 0; i < m; i++) {
scanf("%lld", &mon[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
int sum = 0;
for (int i = 0; i < n; i++) {
int temp = mon[i];
sum += mon[i];
mon[i] -= hero[i];
if (mon[i] < 0) {
if (abs(mon[i]) < mon[i + 1]) {
sum += abs(mon[i]);
mon[i + 1] += mon[i];
} else {
sum += mon[i + 1];
mon[i + 1] = 0;
}
} else {
sum -= temp;
sum += hero[i];
}
}
printf("%d\n", sum);
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, m;
long long mon[100000 + 5], hero[100000 + 5];
cin >> n;
m = n + 1;
for (int i = 0; i < m; i++) {
scanf("%lld", &mon[i]);
}
for (int i = 0; i < n; i++) {
scanf("%lld", &hero[i]);
}
long long sum = 0;
for (int i = 0; i < n; i++) {
long long temp = mon[i];
sum += mon[i];
mon[i] -= hero[i];
if (mon[i] < 0) {
if (abs(mon[i]) < mon[i + 1]) {
sum += abs(mon[i]);
mon[i + 1] += mon[i];
} else {
sum += mon[i + 1];
mon[i + 1] = 0;
}
} else {
sum -= temp;
sum += hero[i];
}
}
printf("%lld\n", sum);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 768,689 | 768,690 | u333542501 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
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];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else if (A[i] == B[i]) {
cnt += A[i];
A[i] = 0;
B[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i] > 0) {
// A[i]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
if (B[i] != 0) {
if (A[i + 1] < B[i]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
} else if (A[i + 1] == B[i]) {
cnt += A[i + 1];
A[i + 1] = 0;
B[i] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i+1] > 0) {
// A[i+1]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
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 cnt = 0;
for (ll i = 0; i < N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else if (A[i] == B[i]) {
cnt += A[i];
A[i] = 0;
B[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i] > 0) {
// A[i]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
if (B[i] != 0) {
if (A[i + 1] < B[i]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
} else if (A[i + 1] == B[i]) {
cnt += A[i + 1];
A[i + 1] = 0;
B[i] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i+1] > 0) {
// A[i+1]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
}
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 768,691 | 768,692 | u911222357 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
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];
int cnt = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else if (A[i] == B[i]) {
cnt += A[i];
A[i] = 0;
B[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i] > 0) {
// A[i]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
if (B[i] != 0) {
if (A[i + 1] <= B[i]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
} else if (A[i + 1] == B[i]) {
cnt += A[i + 1];
A[i + 1] = 0;
B[i] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i+1] > 0) {
// A[i+1]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
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 cnt = 0;
for (ll i = 0; i < N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else if (A[i] == B[i]) {
cnt += A[i];
A[i] = 0;
B[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i] > 0) {
// A[i]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
if (B[i] != 0) {
if (A[i + 1] < B[i]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
} else if (A[i + 1] == B[i]) {
cnt += A[i + 1];
A[i + 1] = 0;
B[i] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
// while(A[i+1] > 0) {
// A[i+1]--;
// B[i]--;
// cnt++;
// if(B[i] == 0) break;
// }
}
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 768,693 | 768,692 | u911222357 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define NMAX 100000
#define MOD 1000000007
#define INF 2000000000
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
using namespace std;
int n;
int monsters[NMAX + 1];
int heroes[NMAX];
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> heroes[i];
int totalMonstersKilled = 0;
for (int i = 0; i < n; i++) {
int monstersKilledInCurr = MIN(monsters[i], heroes[i]);
monsters[i] -= monstersKilledInCurr;
heroes[i] -= monstersKilledInCurr;
if (heroes[i]) {
int monstersKilledInNext = MIN(monsters[i + 1], heroes[i]);
heroes[i] -= monstersKilledInNext;
monsters[i + 1] -= monstersKilledInNext;
totalMonstersKilled += monstersKilledInNext;
}
totalMonstersKilled += monstersKilledInCurr;
}
cout << totalMonstersKilled << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define NMAX 100000
#define MOD 1000000007
#define INF 2000000000
#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
using namespace std;
int n;
int monsters[NMAX + 1];
int heroes[NMAX];
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> monsters[i];
for (int i = 0; i < n; i++)
cin >> heroes[i];
long long totalMonstersKilled = 0;
for (int i = 0; i < n; i++) {
int monstersKilledInCurr = MIN(monsters[i], heroes[i]);
monsters[i] -= monstersKilledInCurr;
heroes[i] -= monstersKilledInCurr;
if (heroes[i]) {
int monstersKilledInNext = MIN(monsters[i + 1], heroes[i]);
heroes[i] -= monstersKilledInNext;
monsters[i + 1] -= monstersKilledInNext;
totalMonstersKilled += monstersKilledInNext;
}
totalMonstersKilled += monstersKilledInCurr;
}
cout << totalMonstersKilled << '\n';
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,694 | 768,695 | u885932660 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N + 1], B[N];
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
int total = 0;
for (int i = 0; i < N; ++i) {
cin >> B[i];
long m = min(A[i], B[i]);
total += m;
if (A[i] < B[i]) {
long nm = min(A[i + 1], B[i] - m);
A[i + 1] -= nm;
total += nm;
}
}
cout << total << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N + 1], B[N];
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
long long total = 0;
for (int i = 0; i < N; ++i) {
cin >> B[i];
long long m = min(A[i], B[i]);
total += m;
if (A[i] < B[i]) {
long long nm = min(A[i + 1], B[i] - m);
A[i + 1] -= nm;
total += nm;
}
}
cout << total << endl;
}
| [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 768,696 | 768,697 | u889423178 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1], b[N], ans = 0, k = 0;
for (int i = 0; i < N + 1; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
for (int i = 0; i < N; i++) {
k = min(a[i], b[i]);
ans += k;
if (k < b[i]) {
b[i] -= k;
k = min(a[i + 1], b[i]);
ans += k;
a[i + 1] -= k;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a[N + 1], b[N], k = 0;
long long ans = 0;
for (int i = 0; i < N + 1; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
for (int i = 0; i < N; i++) {
k = min(a[i], b[i]);
ans += k;
if (k < b[i]) {
b[i] -= k;
k = min(a[i + 1], b[i]);
ans += k;
a[i + 1] -= k;
}
}
cout << ans << endl;
}
| [
"variable_declaration.remove",
"variable_declaration.add"
] | 768,698 | 768,699 | u548163222 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
count = 0;
cin >> N;
vector<long int> A(N + 1);
vector<long int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int yoryoku;
int total = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i)) {
yoryoku = B.at(i) - A.at(i);
total += A.at(i);
} else {
yoryoku = 0;
total += B.at(i);
}
if (yoryoku >= A.at(i + 1)) {
total += A.at(i + 1);
A.at(i + 1) = 0;
} else {
total += yoryoku;
A.at(i + 1) -= yoryoku;
}
}
cout << total << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, count;
count = 0;
cin >> N;
vector<long int> A(N + 1);
vector<long int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long int yoryoku;
long int total = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i)) {
yoryoku = B.at(i) - A.at(i);
total += A.at(i);
} else {
yoryoku = 0;
total += B.at(i);
}
if (yoryoku >= A.at(i + 1)) {
total += A.at(i + 1);
A.at(i + 1) = 0;
} else {
total += yoryoku;
A.at(i + 1) -= yoryoku;
}
}
cout << total << endl;
}
| [
"variable_declaration.type.widen.change"
] | 768,702 | 768,703 | u906250335 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int n;
int *a, *b;
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];
}
int sum = 0;
int dif = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
a[i] -= dif;
if (a[i] < 0)
a[i] = 0;
dif = b[i] - a[i];
if (dif < 0) {
sum += dif;
dif = 0;
}
}
int last = a[n] - dif;
if (last < 0)
sum += a[n];
else
sum += dif;
cout << sum << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
using namespace std;
const long long mod = 1e9 + 7;
int main() {
int n;
ll *a, *b;
cin >> n;
a = new ll[n + 1];
b = new ll[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll sum = 0;
ll dif = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
a[i] -= dif;
if (a[i] < 0)
a[i] = 0;
dif = b[i] - a[i];
if (dif < 0) {
sum += dif;
dif = 0;
}
}
ll last = a[n] - dif;
if (last < 0)
sum += a[n];
else
sum += dif;
cout << sum << endl;
} | [
"variable_declaration.type.change",
"assignment.value.change"
] | 768,718 | 768,719 | u020230257 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
int killcnt = 0;
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++) {
int kill = min(A.at(i), B.at(i));
A.at(i) -= kill;
B.at(i) -= kill;
killcnt += kill;
kill = min(A.at(i + 1), B.at(i));
A.at(i + 1) -= kill;
B.at(i) -= kill;
killcnt += kill;
}
cout << killcnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
ll killcnt = 0;
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++) {
ll kill = min(A.at(i), B.at(i));
A.at(i) -= kill;
B.at(i) -= kill;
killcnt += kill;
kill = min(A.at(i + 1), B.at(i));
A.at(i + 1) -= kill;
B.at(i) -= kill;
killcnt += kill;
}
cout << killcnt << endl;
} | [
"variable_declaration.type.change"
] | 768,720 | 768,721 | u779857052 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N + 1);
for (long long &a : A) {
cin >> a;
}
vector<long long> B(N);
for (long long &b : B) {
cin >> b;
}
long long ans = 0;
long long kill;
for (long long i = 0; i < N; i++) {
kill = min(A[i], B[i]);
A[i] -= kill;
B[i] -= kill;
ans += kill;
kill = min(A[i + 1], B[i]);
A[i] -= kill;
B[i] -= kill;
ans += kill;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<long long> A(N + 1);
for (long long &a : A) {
cin >> a;
}
vector<long long> B(N);
for (long long &b : B) {
cin >> b;
}
long long ans = 0;
long long kill;
for (long long i = 0; i < N; i++) {
kill = min(A[i], B[i]);
A[i] -= kill;
B[i] -= kill;
ans += kill;
kill = min(A[i + 1], B[i]);
A[i + 1] -= kill;
B[i] -= kill;
ans += kill;
}
cout << ans << endl;
}
| [
"assignment.change"
] | 768,726 | 768,727 | u618697411 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
vector<long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) <= b.at(i)) {
ans += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else if (a.at(i) <= b.at(i) && b.at(i) < a.at(i) + a.at(i + 1)) {
ans += b.at(i);
a.at(i + 1) = a.at(i + 1) + a.at(i) - b.at(i);
} else if (b.at(i) <= a.at(i)) {
ans = b.at(i);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long ans = 0;
vector<long> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) <= b.at(i)) {
ans += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else if (a.at(i) <= b.at(i) && b.at(i) < a.at(i) + a.at(i + 1)) {
ans += b.at(i);
a.at(i + 1) = a.at(i + 1) + a.at(i) - b.at(i);
} else if (b.at(i) <= a.at(i)) {
ans += b.at(i);
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.value.change"
] | 768,732 | 768,733 | u646051775 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev :oyhhhhhhyo:
#define next .sdNNNmNNNNNNNmds.
#define y0 -hNNNNy`yNNNNNN`/ Nh -
#define y1 mNNNNNd + dNNNNNN + sNNm
#define yn mNNNNNNNNy-- : smNNNms
#define tm .+ oooooosyysooooo + -
#define read :yhy/
#define rank :mNmo
#define index ...
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i, a, b) for (int i = (b); i >= (a); i--)
#define rall(x, a) for (auto x : a)
#define MOD 1000000007
#define endl "\n"
typedef long long ll;
using namespace std;
const int N = 111111;
int a[N], b[N];
int n;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
n++;
rep(i, 1, n) { cin >> a[i]; }
rep(i, 1, n - 1) { cin >> b[i]; }
int ans = 0;
rep(i, 1, n - 1) {
int x = min(a[i], b[i]);
a[i] -= x;
b[i] -= x;
ans += x;
x = min(a[i + 1], b[i]);
a[i + 1] -= x;
b[i] -= x;
ans += x;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev :oyhhhhhhyo:
#define next .sdNNNmNNNNNNNmds.
#define y0 -hNNNNy`yNNNNNN`/ Nh -
#define y1 mNNNNNd + dNNNNNN + sNNm
#define yn mNNNNNNNNy-- : smNNNms
#define tm .+ oooooosyysooooo + -
#define read :yhy/
#define rank :mNmo
#define index ...
#define pb push_back
#define pcnt __builtin_popcountll
#define rrep(i, a, b) for (int i = (b); i >= (a); i--)
#define rall(x, a) for (auto x : a)
#define MOD 1000000007
#define endl "\n"
#define int long long
typedef long long ll;
using namespace std;
const int N = 111111;
int a[N], b[N];
int n;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
n++;
rep(i, 1, n) { cin >> a[i]; }
rep(i, 1, n - 1) { cin >> b[i]; }
int ans = 0;
rep(i, 1, n - 1) {
int x = min(a[i], b[i]);
a[i] -= x;
b[i] -= x;
ans += x;
x = min(a[i + 1], b[i]);
a[i + 1] -= x;
b[i] -= x;
ans += x;
}
cout << ans << endl;
return 0;
}
| [] | 768,746 | 768,747 | u907194047 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
ll min(ll a, ll b) { return (a < b) ? a : b; }
int main(void) {
ll N;
cin >> N;
ll A[N + 1], B[N];
ll cnt = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
ll defeat = min(A[i], B[i]);
cnt += defeat;
B[i] -= defeat;
defeat = min(A[i + 1], B[i]);
cnt += defeat;
A[i + 1] - defeat;
}
cout << cnt << endl;
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
ll min(ll a, ll b) { return (a < b) ? a : b; }
int main(void) {
ll N;
cin >> N;
ll A[N + 1], B[N];
ll cnt = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
ll defeat = min(A[i], B[i]);
cnt += defeat;
B[i] -= defeat;
defeat = min(A[i + 1], B[i]);
cnt += defeat;
A[i + 1] -= defeat;
}
cout << cnt << endl;
return 0;
} | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 768,750 | 768,751 | u810075828 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll n, a[114514], b[114514];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i + 1 < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll x = min(a[i], b[i]);
ans += x;
b[i] -= x;
if (i + 1 < n) {
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
ll n, a[114514], b[114514];
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i <= n; i++) {
ll x = min(a[i], b[i]);
ans += x;
b[i] -= x;
if (i < n) {
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 768,770 | 768,771 | u628262476 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fi first
#define se second
#define de(x) cout << #x << "=" << x << endl;
#define dd(x) cout << #x << "=" << x << " ";
#define pb(x) push_back(x)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
const int N = 2e6 + 5;
int n;
int a[N], b[N];
int main() {
cin >> n;
rep(i, 1, n + 2) cin >> b[i];
rep(i, 1, n + 1) cin >> a[i];
ll ans = 0;
rep(i, 1, n + 1) {
ans += min(b[i], a[i]);
a[i] -= min(b[i], a[i]);
ans += min(b[i + 1], a[i]);
b[i] -= min(b[i + 1], a[i]);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fi first
#define se second
#define de(x) cout << #x << "=" << x << endl;
#define dd(x) cout << #x << "=" << x << " ";
#define pb(x) push_back(x)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
const int N = 2e6 + 5;
int n;
ll a[N], b[N];
int main() {
cin >> n;
rep(i, 1, n + 2) cin >> b[i];
rep(i, 1, n + 1) cin >> a[i];
ll ans = 0;
rep(i, 1, n + 1) {
ans += min(b[i], a[i]);
a[i] -= min(b[i], a[i]);
ans += min(b[i + 1], a[i]);
b[i + 1] -= min(b[i + 1], a[i]);
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 768,774 | 768,775 | u518554680 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int monster[1000010];
int cnt;
int main() {
int n;
cin >> n;
int x;
for (x = 1; x <= n + 1; x++) {
cin >> monster[x];
}
int cnt = 0;
for (x = 1; x <= n; x++) {
int a;
cin >> a;
int kurang = min(a, monster[x]);
a -= kurang;
cnt += kurang;
monster[x] -= kurang;
if (a > 0) {
kurang = min(a, monster[x + 1]);
a -= kurang;
cnt += kurang;
monster[x + 1] -= kurang;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
int monster[1000010];
int cnt;
int main() {
int n;
cin >> n;
int x;
for (x = 1; x <= n + 1; x++) {
cin >> monster[x];
}
long long cnt = 0;
for (x = 1; x <= n; x++) {
int a;
cin >> a;
int kurang = min(a, monster[x]);
a -= kurang;
cnt += kurang;
monster[x] -= kurang;
if (a > 0) {
kurang = min(a, monster[x + 1]);
a -= kurang;
cnt += kurang;
monster[x + 1] -= kurang;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,776 | 768,777 | u737838293 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> enemy(N + 1), 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 += hero.at(i);
else {
if (enemy.at(i) + enemy.at(i + 1) > hero.at(i)) {
count += hero.at(i);
enemy.at(i + 1) -= hero.at(i) - enemy.at(i);
} else {
count += enemy.at(i) + enemy.at(i + 1);
enemy.at(i + 1) = 0;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> enemy(N + 1), 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 += hero.at(i);
else {
if (enemy.at(i) + enemy.at(i + 1) > hero.at(i)) {
count += hero.at(i);
enemy.at(i + 1) -= hero.at(i) - enemy.at(i);
} else {
count += enemy.at(i) + enemy.at(i + 1);
enemy.at(i + 1) = 0;
}
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 768,778 | 768,779 | u936602931 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans = 0, t;
vector<int> a;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> t;
a.push_back(t);
}
int b;
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
ans += b;
} else {
ans += min(b, a[i] + a[i + 1]);
a[i + 1] = max(0, a[i + 1] - (b - a[i]));
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long n, ans = 0, t;
vector<int> a;
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> t;
a.push_back(t);
}
int b;
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
ans += b;
} else {
ans += min(b, a[i] + a[i + 1]);
a[i + 1] = max(0, a[i + 1] - (b - a[i]));
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,780 | 768,781 | u819402602 | cpp |
p02959 | #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //ไธบ0่กจ็คบๆไปถ็ปๅฐพ
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
: *p1++;
}
template <class _T> inline bool read(_T &num) {
char c = nc(), f = 1;
num = 0;
while (c < '0' || c > '9')
c == '-' && (f = -1), c = nc();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = nc();
return (bool)(num *= f);
}
inline bool need(char &c) {
return c >= 'a' && c <= 'z' || c >= '0' && c <= '9' || c >= 'A' && c <= 'Z';
} //่ฏปๅ
ฅ็ๅญ็ฌฆ่ๅด
inline bool read_str(char *a) {
while ((*a = nc()) && need(*a) && rEOF)
++a;
*a = '\0';
return rEOF;
}
} // namespace _
using namespace _;
int n;
int a[100000 + 5];
int b[100000 + 5];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
int ans = 0;
for (int i = 1; i <= n; i++) {
cin >> b[i];
if (a[i] <= b[i])
ans += a[i], b[i] -= a[i], a[i] = 0;
else
ans += b[i], a[i] -= b[i], b[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;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <random>
using namespace std;
namespace _ {
bool rEOF = 1; //ไธบ0่กจ็คบๆไปถ็ปๅฐพ
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && rEOF &&
(p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? (rEOF = 0, EOF)
: *p1++;
}
template <class _T> inline bool read(_T &num) {
char c = nc(), f = 1;
num = 0;
while (c < '0' || c > '9')
c == '-' && (f = -1), c = nc();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = nc();
return (bool)(num *= f);
}
inline bool need(char &c) {
return c >= 'a' && c <= 'z' || c >= '0' && c <= '9' || c >= 'A' && c <= 'Z';
} //่ฏปๅ
ฅ็ๅญ็ฌฆ่ๅด
inline bool read_str(char *a) {
while ((*a = nc()) && need(*a) && rEOF)
++a;
*a = '\0';
return rEOF;
}
} // namespace _
using namespace _;
int n;
long long a[100000 + 5];
long long b[100000 + 5];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> a[i];
long long ans = 0;
for (int i = 1; i <= n; i++) {
cin >> b[i];
if (a[i] <= b[i])
ans += a[i], b[i] -= a[i], a[i] = 0;
else
ans += b[i], a[i] -= b[i], b[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;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,782 | 768,783 | u066917439 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, a[100010], b[100010], last, ans;
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
last = b[0] - min(b[0], a[0]);
ans += min(a[0], b[0]);
for (int i = 1; i <= n; i++) {
ans += min(a[i], last);
a[i] -= min(a[i], last);
last = b[i] - min(b[i], a[i]);
ans += min(a[i], b[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], b[100010], last, ans;
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
last = b[0] - min(b[0], a[0]);
ans += min(a[0], b[0]);
for (int i = 1; i <= n; i++) {
ans += min(a[i], last);
a[i] -= min(a[i], last);
last = b[i] - min(b[i], a[i]);
ans += min(a[i], b[i]);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 768,784 | 768,785 | u966582222 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
ll median(ll a, ll b, ll c) {
return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
void ans(bool x, ll y, ll z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void ans(bool x, string y, string z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void debug(vector<vector<ll>> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
cout << v[i][0];
for (ll j = 1; j < w; j++)
cout spa v[i][j];
cout << endl;
}
};
void debug(vector<string> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++)
cout << v[i][j];
cout << endl;
}
};
void debug(vector<ll> v, ll n) {
cout << v[0];
for (ll i = 1; i < n; i++)
cout spa v[i];
cout << endl;
};
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
// m.emplace(x,0).fi->second++;
int main() {
ll res = 0, res1 = INF, res2 = -INF, buf = 0;
bool judge = true;
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (a[i] >= b[i])
res += b[i];
else {
res += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
res += a[i + 1];
a[i] = 0;
} else {
res += b[i];
a[i + 1] -= b[i];
}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
ll median(ll a, ll b, ll c) {
return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
void ans(bool x, ll y, ll z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void ans(bool x, string y, string z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void debug(vector<vector<ll>> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
cout << v[i][0];
for (ll j = 1; j < w; j++)
cout spa v[i][j];
cout << endl;
}
};
void debug(vector<string> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++)
cout << v[i][j];
cout << endl;
}
};
void debug(vector<ll> v, ll n) {
cout << v[0];
for (ll i = 1; i < n; i++)
cout spa v[i];
cout << endl;
};
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
// m.emplace(x,0).fi->second++;
int main() {
ll res = 0, res1 = INF, res2 = -INF, buf = 0;
bool judge = true;
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (a[i] >= b[i])
res += b[i];
else {
res += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i];
a[i + 1] -= b[i];
}
}
}
cout << res << endl;
return 0;
} | [
"assignment.change"
] | 768,786 | 768,787 | u898167769 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
ll median(ll a, ll b, ll c) {
return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
void ans(bool x, ll y, ll z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void ans(bool x, string y, string z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void debug(vector<vector<ll>> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
cout << v[i][0];
for (ll j = 1; j < w; j++)
cout spa v[i][j];
cout << endl;
}
};
void debug(vector<string> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++)
cout << v[i][j];
cout << endl;
}
};
void debug(vector<ll> v, ll n) {
cout << v[0];
for (ll i = 1; i < n; i++)
cout spa v[i];
cout << endl;
};
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
// m.emplace(x,0).fi->second++;
int main() {
ll res = 0, res1 = INF, res2 = -INF, buf = 0;
bool judge = true;
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (a[i] >= b[i])
res += b[i];
else {
res += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
res += a[i + 1];
a[i] = 0;
} else {
res += b[i];
a[i] -= b[i];
}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define test cout << "test" << endl;
#define fi first
#define se second
#define rep(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = n; i < (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void pmod(ll &a, ll b) { a = (a + b) % MOD; }
void pmod(ll &a, ll b, ll c) { a = (b + c) % MOD; }
void qmod(ll &a, ll b) { a = (a * b) % MOD; }
void qmod(ll &a, ll b, ll c) { a = (b * c) % MOD; }
ll median(ll a, ll b, ll c) {
return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
if (x)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void ans2(bool x) {
if (x)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void ans3(bool x) {
if (x)
cout << "Yay!" << endl;
else
cout << ":(" << endl;
}
void ans(bool x, ll y, ll z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void ans(bool x, string y, string z) {
if (x)
cout << y << endl;
else
cout << z << endl;
}
void debug(vector<vector<ll>> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
cout << v[i][0];
for (ll j = 1; j < w; j++)
cout spa v[i][j];
cout << endl;
}
};
void debug(vector<string> v, ll h, ll w) {
for (ll i = 0; i < h; i++) {
for (ll j = 0; j < w; j++)
cout << v[i][j];
cout << endl;
}
};
void debug(vector<ll> v, ll n) {
cout << v[0];
for (ll i = 1; i < n; i++)
cout spa v[i];
cout << endl;
};
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
// m.emplace(x,0).fi->second++;
int main() {
ll res = 0, res1 = INF, res2 = -INF, buf = 0;
bool judge = true;
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
rep(i, 0, n) {
if (a[i] >= b[i])
res += b[i];
else {
res += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i];
a[i + 1] -= b[i];
}
}
}
cout << res << endl;
return 0;
} | [
"assignment.change"
] | 768,788 | 768,787 | u898167769 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
void Say(bool say, string a = "Yes", string b = "No") {
cout << (say ? a : b) << endl;
};
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0), B(N, 0);
for (ll i = 0; i < N + 1; i++)
cin >> A[i];
for (ll i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (ll i = 0; i < N; i++) {
ll tmp = min(A[i], B[i]);
ans += tmp;
A[i] -= tmp;
B[i] -= tmp;
tmp = min(A[i + 1], B[i]);
ans += tmp;
A[i] -= tmp;
B[i] -= tmp;
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
void Say(bool say, string a = "Yes", string b = "No") {
cout << (say ? a : b) << endl;
};
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0), B(N, 0);
for (ll i = 0; i < N + 1; i++)
cin >> A[i];
for (ll i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (ll i = 0; i < N; i++) {
ll tmp = min(A[i], B[i]);
ans += tmp;
A[i] -= tmp;
B[i] -= tmp;
tmp = min(A[i + 1], B[i]);
ans += tmp;
A[i + 1] -= tmp;
B[i] -= tmp;
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 768,789 | 768,790 | u480892088 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long long res = 0;
for (int i = 0; i < N; ++i) {
int cntl = min(A[i], B[i]);
res += cntl;
A[i] -= cntl;
B[i] -= cntl;
int cntr = min(A[i + 1], B[i]);
res += cntr;
A[i] -= cntr;
B[i] -= cntr;
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; ++i) {
cin >> A[i];
}
for (int i = 0; i < N; ++i) {
cin >> B[i];
}
long long res = 0;
for (int i = 0; i < N; ++i) {
int cntl = min(A[i], B[i]);
res += cntl;
A[i] -= cntl;
B[i] -= cntl;
int cntr = min(A[i + 1], B[i]);
res += cntr;
A[i + 1] -= cntr;
B[i] -= cntr;
}
cout << res << "\n";
return 0;
} | [
"assignment.change"
] | 768,791 | 768,792 | u959960486 | cpp |
p02959 | #include <bits/stdc++.h>
#define task "C"
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define pb push_back
#define F first
#define S second
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
// Variables
int n, a[100004];
ll res;
//
// Function
//
int main() {
// freopen(task".in","r",stdin);
// freopen(task".out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
rep(i, 1, n + 1) cin >> a[i];
rep(i, 1, n) {
int x;
cin >> x;
if (x >= a[i]) {
x -= a[i];
res += a[i];
a[i] = 0;
} else {
res += x;
a[i] -= x;
}
if (x >= a[i + 1]) {
x -= a[i + 1];
res += a[i + 1];
a[i + 1] = 0;
} else {
res += x;
a[i + 1] -= x;
}
}
cout << res;
}
| #include <bits/stdc++.h>
#define task "C"
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define pb push_back
#define F first
#define S second
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
// Variables
int n, a[100004];
ll res;
//
// Function
//
int main() {
// freopen(task".in","r",stdin);
// freopen(task".out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
rep(i, 1, n + 1) cin >> a[i];
rep(i, 1, n) {
int x;
cin >> x;
if (x >= a[i]) {
x -= a[i];
res += a[i];
a[i] = 0;
} else {
res += x;
a[i] -= x;
x = 0;
}
if (x >= a[i + 1]) {
x -= a[i + 1];
res += a[i + 1];
a[i + 1] = 0;
} else {
res += x;
a[i + 1] -= x;
}
}
cout << res;
}
| [
"assignment.add"
] | 768,797 | 768,798 | u792559418 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 1000000007
#define mod1 998244353
#define timepass 1073741824
#define MAXN 200000 + 5
#define LOGN 20
#define over ((1ll << 32))
using namespace std;
#define N 2005
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>;*/
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define int ll
#define all(arr) arr.begin(), arr.end()
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, n, a) for (int i = n - 1; i >= a; i--)
#define ms(arr, val) memset(arr, val, sizeof(arr))
#define sp(a, x) cout << fixed << setprecision(a) << x << endl;
#define siz(temp) (ll) temp.size()
#define len(temp) (ll) temp.length()
#define s(arr) sort(all(arr))
#define r(arr) reverse(all(arr))
#define rs(arr) \
s(arr); \
r(arr)
#define pi acos(-1)
#define con continue
#define endl "\n"
#define w(q) while (q--)
// debug
#define trace1(x) cout << #x << ": " << x << endl
#define trace2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define trace7(a, b, c, d, e, f, g) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << " | " << #g << ": " << g << endl
#define trace8(a, b, c, d, e, f, g, h) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << " | " << #g << ": " << g << " | " << #h << ": " \
<< h << endl
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<piii> vpiii;
signed main() {
int n;
cin >> n;
vector<int> mo(n + 1);
vector<int> he(n);
for (int i = 0; i <= n; i++)
cin >> mo[i];
for (int i = 0; i < n; i++)
cin >> he[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int temp = min(he[i], mo[i]);
he[i] -= temp;
ans += temp;
mo[i] -= temp;
temp = min(he[i], mo[i + 1]);
he[i] -= temp;
ans += temp;
mo[i] -= temp;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 1000000007
#define mod1 998244353
#define timepass 1073741824
#define MAXN 200000 + 5
#define LOGN 20
#define over ((1ll << 32))
using namespace std;
#define N 2005
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>;*/
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define int ll
#define all(arr) arr.begin(), arr.end()
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, n, a) for (int i = n - 1; i >= a; i--)
#define ms(arr, val) memset(arr, val, sizeof(arr))
#define sp(a, x) cout << fixed << setprecision(a) << x << endl;
#define siz(temp) (ll) temp.size()
#define len(temp) (ll) temp.length()
#define s(arr) sort(all(arr))
#define r(arr) reverse(all(arr))
#define rs(arr) \
s(arr); \
r(arr)
#define pi acos(-1)
#define con continue
#define endl "\n"
#define w(q) while (q--)
// debug
#define trace1(x) cout << #x << ": " << x << endl
#define trace2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cout << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define trace7(a, b, c, d, e, f, g) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << " | " << #g << ": " << g << endl
#define trace8(a, b, c, d, e, f, g, h) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << " | " << #g << ": " << g << " | " << #h << ": " \
<< h << endl
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<piii> vpiii;
signed main() {
int n;
cin >> n;
vector<int> mo(n + 1);
vector<int> he(n);
for (int i = 0; i <= n; i++)
cin >> mo[i];
for (int i = 0; i < n; i++)
cin >> he[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int temp = min(he[i], mo[i]);
he[i] -= temp;
ans += temp;
mo[i] -= temp;
temp = min(he[i], mo[i + 1]);
he[i] -= temp;
ans += temp;
mo[i + 1] -= temp;
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 768,801 | 768,802 | u043151323 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<int, pi> trp;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
// int ab (int x ) { return (x>0?x:-x); }
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll take = min(b[i], a[i]);
ans += take;
b[i] -= take;
a[i] -= take;
take = min(b[i], a[i + 1]);
b[i] -= take;
a[i] -= take;
ans += take;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define allarr(a) a, a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef pair<int, pi> trp;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
// int ab (int x ) { return (x>0?x:-x); }
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll take = min(b[i], a[i]);
ans += take;
b[i] -= take;
a[i] -= take;
take = min(b[i], a[i + 1]);
b[i] -= take;
a[i + 1] -= take;
ans += take;
}
cout << ans << endl;
} | [
"assignment.change"
] | 768,803 | 768,804 | u179395482 | cpp |
p02959 | // atcoder/abc135/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename P, typename Q>
istream &operator>>(istream &is, pair<P, Q> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
os << "(";
each(i, v) os << i << ",";
os << ")";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(i, v) is >> i;
return is;
}
template <typename T> inline T setmax(T &a, T b) { return a = std::max(a, b); }
template <typename T> inline T setmin(T &a, T b) { return a = std::min(a, b); }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
while (cin >> n) {
vector<lli> a(n + 1);
cin >> a;
vector<lli> b(n);
cin >> b;
lli sum = 0;
for (int i = 0; i < b.size(); ++i) {
{
lli mn = min(a[i], b[i]);
a[i] -= mn;
b[i] -= mn;
sum += mn;
}
{
lli mn = min(a[i + 1], b[i]);
a[i] -= mn;
b[i] -= mn;
sum += mn;
}
}
cout << sum << endl;
}
return 0;
}
| // atcoder/abc135/C/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typename P, typename Q>
ostream &operator<<(ostream &os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename P, typename Q>
istream &operator>>(istream &is, pair<P, Q> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> v) {
os << "(";
each(i, v) os << i << ",";
os << ")";
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(i, v) is >> i;
return is;
}
template <typename T> inline T setmax(T &a, T b) { return a = std::max(a, b); }
template <typename T> inline T setmin(T &a, T b) { return a = std::min(a, b); }
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
while (cin >> n) {
vector<lli> a(n + 1);
cin >> a;
vector<lli> b(n);
cin >> b;
lli sum = 0;
for (int i = 0; i < b.size(); ++i) {
{
lli mn = min(a[i], b[i]);
a[i] -= mn;
b[i] -= mn;
sum += mn;
}
{
lli mn = min(a[i + 1], b[i]);
a[i + 1] -= mn;
b[i] -= mn;
sum += mn;
}
}
cout << sum << endl;
}
return 0;
}
| [
"assignment.change"
] | 768,805 | 768,806 | u768334187 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
//#define int ll
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, int>
#define vi vector<int>
const ll nmax = 1e5 + 2;
const ll mod = 998244353;
int n, m, t[100005], b[100005], ans;
;
int32_t main() {
ios_base ::sync_with_stdio(0);
cin.tie();
cout.tie();
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> t[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--) {
int xd = min(b[i], t[i + 1]);
b[i] -= xd;
ans += xd;
xd = min(b[i], t[i]);
t[i] -= xd;
b[i] -= xd;
ans += xd;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define int ll
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, int>
#define vi vector<int>
const ll nmax = 1e5 + 2;
const ll mod = 998244353;
int n, m, t[100005], b[100005], ans;
;
int32_t main() {
ios_base ::sync_with_stdio(0);
cin.tie();
cout.tie();
cin >> n;
for (int i = 1; i <= n + 1; i++)
cin >> t[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = n; i >= 1; i--) {
int xd = min(b[i], t[i + 1]);
b[i] -= xd;
ans += xd;
xd = min(b[i], t[i]);
t[i] -= xd;
b[i] -= xd;
ans += xd;
}
cout << ans;
} | [] | 768,807 | 768,808 | u392848063 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#define key pair<ld, ld>
#define ii pair<int, int>
#define si set<int>
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define nu 100001
#define mul(x, y) ((ll)(x) * (y)) % mod
#define tr(c, i) for (auto i = (c).begin(); i != (c).end(); i++)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define forn(i, n) for (int i = 0; i < int(n); i++)
#include <fstream>
const ll INF = 9223372036854775807;
const ll mod = 998244353;
int MOD(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
ll max3(ll a, ll b, ll c) { return max(c, max(a, b)); }
ll min3(ll a, ll b, ll c) { return min(a, min(b, c)); }
ll power(ll x, ll y, ll mod1) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % mod1;
y = y >> 1;
x = (x * x) % mod1;
}
return res;
}
ll logg(ll a) {
ll x = 0;
while (a > 1) {
x++;
a /= 2;
}
return x;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll abso(ll x) {
if (x < 0) {
return -x;
}
return x;
}
ll ceiling(ll a, ll b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
ll modinv(ll x, ll p) { return power(x, p - 2, p); }
int main() {
int n;
cin >> n;
vll a(n + 1);
ll sum = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
vll b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ll x = min(b[i], a[i]);
a[i] -= x;
b[i] -= x;
ll y = min(b[i], a[i + 1]);
a[i] -= y;
b[i] -= y;
}
for (int i = 0; i < n + 1; i++) {
sum -= a[i];
}
cout << sum << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
#define ll long long int
#define ld long double
#define key pair<ld, ld>
#define ii pair<int, int>
#define si set<int>
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vll vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define nu 100001
#define mul(x, y) ((ll)(x) * (y)) % mod
#define tr(c, i) for (auto i = (c).begin(); i != (c).end(); i++)
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define forn(i, n) for (int i = 0; i < int(n); i++)
#include <fstream>
const ll INF = 9223372036854775807;
const ll mod = 998244353;
int MOD(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
ll max3(ll a, ll b, ll c) { return max(c, max(a, b)); }
ll min3(ll a, ll b, ll c) { return min(a, min(b, c)); }
ll power(ll x, ll y, ll mod1) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = (res * x) % mod1;
y = y >> 1;
x = (x * x) % mod1;
}
return res;
}
ll logg(ll a) {
ll x = 0;
while (a > 1) {
x++;
a /= 2;
}
return x;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll abso(ll x) {
if (x < 0) {
return -x;
}
return x;
}
ll ceiling(ll a, ll b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
ll modinv(ll x, ll p) { return power(x, p - 2, p); }
int main() {
int n;
cin >> n;
vll a(n + 1);
ll sum = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
vll b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ll x = min(b[i], a[i]);
a[i] -= x;
b[i] -= x;
ll y = min(b[i], a[i + 1]);
a[i + 1] -= y;
b[i] -= y;
}
for (int i = 0; i < n + 1; i++) {
sum -= a[i];
}
cout << sum << endl;
}
| [
"assignment.change"
] | 768,809 | 768,810 | u920844524 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int ac = 1e6 + 6;
int A[ac];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> A[i];
long long s = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
s += min(x, A[i]);
x -= min(x, A[i]);
s += min(x, A[i + 1]);
x -= min(x, A[i + 1]);
}
cout << s << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
const int ac = 1e6 + 6;
int A[ac];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> A[i];
long long s = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
s += min(x, A[i]);
x -= min(x, A[i]);
s += min(x, A[i + 1]);
A[i + 1] -= min(x, A[i + 1]);
}
cout << s << '\n';
}
| [
"assignment.variable.change"
] | 768,811 | 768,812 | u856010815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
ans += a[i];
if (b[i] - a[i] <= a[i + 1]) {
a[i + 1] -= b[i] - a[i];
ans += b[i] - a[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
} else {
ans += b[i];
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] > a[i]) {
ans += a[i];
if (b[i] - a[i] <= a[i + 1]) {
a[i + 1] -= b[i] - a[i];
ans += b[i] - a[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
} else {
ans += b[i];
}
}
cout << ans;
} | [
"variable_declaration.type.change"
] | 768,813 | 768,814 | u849073847 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i))
count += b.at(i);
else if (a.at(i) + a.at(i + 1) >= b.at(i)) {
count += b.at(i);
a.at(i + 1) -= (b.at(i) - a.at(i));
} else {
count += (a.at(i) + a.at(i + 1));
a.at(i + 1) = 0;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int long> a(n + 1);
vector<int 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 long count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i))
count += b.at(i);
else if (a.at(i) + a.at(i + 1) >= b.at(i)) {
count += b.at(i);
a.at(i + 1) -= (b.at(i) - a.at(i));
} else {
count += (a.at(i) + a.at(i + 1));
a.at(i + 1) = 0;
}
}
cout << count << endl;
}
| [
"variable_declaration.type.widen.change"
] | 768,819 | 768,820 | u366974105 | cpp |
p02959 | #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned __int64;
#else
using ll = long long int;
using ull = unsigned long long int;
#endif
// ไบไนใ่จ็ฎใใใ
ll sq(ll x) { return x * x; }
// ้ ๅๅ
ใซใใใใ
bool within(ll x, ll min, ll max) { return min <= x && x <= max; }
// container ใฎไธญใใ key ใใๅฐใใๅคใ่ฆใคใใใ
// ่ฆใคใใใชใๅ ดๅใฏ container.end() ใ่ฟใใ
template <typename T>
typename T::iterator less_than(T &container, typename T::key_type &key) {
typename T::iterator prev = container.lower_bound(key);
if (prev == container.begin())
prev = container.end();
else
prev--;
return prev;
}
// container ใฎไธญใใ key ใใๅคงใใๅคใ่ฆใคใใใ
// ่ฆใคใใใชใๅ ดๅใฏ container.end() ใ่ฟใใ
template <typename T>
typename T::iterator greater_than(T &container, typename T::key_type &key) {
return container.upper_bound(key);
}
// b^e (mod m) ใๆฑใใ
ll modpow(ll b, ll e, ll m) {
ll result = 1;
while (e > 0) {
if ((e & 1) == 1)
result = (result * b) % m;
e >>= 1;
b = (b * b) % m;
}
return result;
}
// ใใใใ่งฃๆณ
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 count = 0;
for (int i = 0; i < N; ++i) {
int beat = min(A[i], B[i]);
A[i] -= beat;
B[i] -= beat;
count += beat;
int beat_next = min(A[i + 1], B[i]);
A[i + 1] -= beat_next;
B[i] -= beat_next;
count += beat_next;
}
cout << count << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef _MSC_VER
using ll = __int64;
using ull = unsigned __int64;
#else
using ll = long long int;
using ull = unsigned long long int;
#endif
// ไบไนใ่จ็ฎใใใ
ll sq(ll x) { return x * x; }
// ้ ๅๅ
ใซใใใใ
bool within(ll x, ll min, ll max) { return min <= x && x <= max; }
// container ใฎไธญใใ key ใใๅฐใใๅคใ่ฆใคใใใ
// ่ฆใคใใใชใๅ ดๅใฏ container.end() ใ่ฟใใ
template <typename T>
typename T::iterator less_than(T &container, typename T::key_type &key) {
typename T::iterator prev = container.lower_bound(key);
if (prev == container.begin())
prev = container.end();
else
prev--;
return prev;
}
// container ใฎไธญใใ key ใใๅคงใใๅคใ่ฆใคใใใ
// ่ฆใคใใใชใๅ ดๅใฏ container.end() ใ่ฟใใ
template <typename T>
typename T::iterator greater_than(T &container, typename T::key_type &key) {
return container.upper_bound(key);
}
// b^e (mod m) ใๆฑใใ
ll modpow(ll b, ll e, ll m) {
ll result = 1;
while (e > 0) {
if ((e & 1) == 1)
result = (result * b) % m;
e >>= 1;
b = (b * b) % m;
}
return result;
}
// ใใใใ่งฃๆณ
int main(void) {
int N;
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];
ll count = 0;
for (int i = 0; i < N; ++i) {
ll beat = min(A[i], B[i]);
A[i] -= beat;
B[i] -= beat;
count += beat;
ll beat_next = min(A[i + 1], B[i]);
A[i + 1] -= beat_next;
B[i] -= beat_next;
count += beat_next;
}
cout << count << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,821 | 768,822 | u609688888 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define INF 1LL << 62
#define FLT_INF pow(10.0, 16)
using ll = long long;
using vll = vector<ll>;
using ull = unsigned long long;
using int2 = pair<int, int>;
using int3 = tuple<ll, ll, ll>;
template <typename A> string to_string(const A &v);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(const pair<A, B> &p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(const tuple<A, B, C> &p) {
return "(" + to_string(std::get<0>(p)) + ", " + to_string(std::get<1>(p)) +
", " + to_string(std::get<2>(p)) + ")";
}
template <typename A> string to_string(const A &v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename T> void sort(vector<T> &val) {
sort(val.begin(), val.end());
}
template <typename T> void sort_b(vector<T> &val) {
sort(val.begin(), val.end(), greater<T>());
}
template <typename T> T mul_mod(T a, T b, T mod) {
T res = 0;
a %= mod;
while (b) {
if (b & 1) {
res = (res + a) % mod;
}
a = (2 * a) % mod;
b >>= 1;
}
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) ;
#endif
#define COMMON_MOD pow(10, 9) + 7
#define PI 3.14159265
// sort(a.begin(), a.end(), less<ll>()); greater<ll>()
// cout<<fixed<<setprecision(20)<<(s/kl)*2;
/* printf("%lld %lld \n", cur_n, m / 2 + 1);
*/
class mytask {
public:
mytask() {}
int solve() {
ll n;
cin >> n;
vll a(n + 1);
vll b(n);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll def_monsters = 0;
for (int i = 0; i < n; i++) {
ll def_monsters_step = min(a[i], b[i]);
a[i] -= def_monsters_step;
b[i] -= def_monsters_step;
def_monsters += def_monsters_step;
def_monsters_step = min(a[i + 1], b[i]);
a[i] -= def_monsters_step;
b[i] -= def_monsters_step;
def_monsters += def_monsters_step;
}
cout << def_monsters;
return 0;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
auto task = mytask();
task.solve();
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define pb push_back
#define INF 1LL << 62
#define FLT_INF pow(10.0, 16)
using ll = long long;
using vll = vector<ll>;
using ull = unsigned long long;
using int2 = pair<int, int>;
using int3 = tuple<ll, ll, ll>;
template <typename A> string to_string(const A &v);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(const pair<A, B> &p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(const tuple<A, B, C> &p) {
return "(" + to_string(std::get<0>(p)) + ", " + to_string(std::get<1>(p)) +
", " + to_string(std::get<2>(p)) + ")";
}
template <typename A> string to_string(const A &v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename T> void sort(vector<T> &val) {
sort(val.begin(), val.end());
}
template <typename T> void sort_b(vector<T> &val) {
sort(val.begin(), val.end(), greater<T>());
}
template <typename T> T mul_mod(T a, T b, T mod) {
T res = 0;
a %= mod;
while (b) {
if (b & 1) {
res = (res + a) % mod;
}
a = (2 * a) % mod;
b >>= 1;
}
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) ;
#endif
#define COMMON_MOD pow(10, 9) + 7
#define PI 3.14159265
// sort(a.begin(), a.end(), less<ll>()); greater<ll>()
// cout<<fixed<<setprecision(20)<<(s/kl)*2;
/* printf("%lld %lld \n", cur_n, m / 2 + 1);
*/
class mytask {
public:
mytask() {}
int solve() {
ll n;
cin >> n;
vll a(n + 1);
vll b(n);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll def_monsters = 0;
for (int i = 0; i < n; i++) {
ll def_monsters_step = min(a[i], b[i]);
a[i] -= def_monsters_step;
b[i] -= def_monsters_step;
def_monsters += def_monsters_step;
def_monsters_step = min(a[i + 1], b[i]);
a[i + 1] -= def_monsters_step;
b[i] -= def_monsters_step;
def_monsters += def_monsters_step;
}
cout << def_monsters;
return 0;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
auto task = mytask();
task.solve();
cout << endl;
return 0;
}
| [
"assignment.change"
] | 768,823 | 768,824 | u037182465 | cpp |
p02959 | #include <iostream>
using namespace std;
int n, ans;
int main() {
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
} else if (b[i] >= a[i]) {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
long n, ans;
int main() {
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0L;
} else if (b[i] >= a[i]) {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
a[i] = 0L;
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.type.widen.change"
] | 768,827 | 768,828 | u612175324 | cpp |
p02959 | #include <iostream>
using namespace std;
int n, ans;
int main() {
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0;
} else if (b[i] >= a[i]) {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
long n, ans;
int main() {
cin >> n;
long a[n + 1], b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
for (int i = 0; i < n; i++) {
if (b[i] >= a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i] = a[i + 1] = 0L;
} else if (b[i] >= a[i]) {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
a[i] = 0L;
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.type.widen.change"
] | 768,830 | 768,828 | u612175324 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7, INF = 1e17;
const int iINF = 1e9;
bool comp(int a, int b) { return a < b; }
int main() {
int n, ans = 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 = n - 1; i >= 0; i--) {
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
b[i] -= a[i + 1];
}
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i];
a[i] = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7, INF = 1e17;
const int iINF = 1e9;
bool comp(int a, int b) { return a < b; }
int main() {
ll n, ans = 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 = n - 1; i >= 0; i--) {
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
b[i] -= a[i + 1];
}
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i];
a[i] = 0;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 768,831 | 768,832 | u952437626 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int MOD = 1000000007;
const ll INF = 1e18;
int main() {
int n;
cin >> n;
vi a, b;
int t;
forn(i, n + 1) {
cin >> t;
a.pb(t);
}
forn(i, n) {
cin >> t;
b.pb(t);
}
int ans = 0;
forn(i, n) {
if (b[i] < a[i])
ans += b[i];
else {
ans += a[i] + min(b[i] - a[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - (b[i] - a[i]));
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int MOD = 1000000007;
const ll INF = 1e18;
int main() {
int n;
cin >> n;
vi a, b;
int t;
forn(i, n + 1) {
cin >> t;
a.pb(t);
}
forn(i, n) {
cin >> t;
b.pb(t);
}
ll ans = 0;
forn(i, n) {
if (b[i] < a[i])
ans += b[i];
else {
ans += a[i] + min(b[i] - a[i], a[i + 1]);
a[i + 1] = max(0, a[i + 1] - (b[i] - a[i]));
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,835 | 768,836 | u403647978 | cpp |
p02959 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define pint pair<int, int>
#define mp make_pair
using namespace std;
typedef long long ll;
int N;
ll a[100005], b[100005];
int main() {
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] > b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define pint pair<int, int>
#define mp make_pair
using namespace std;
typedef long long ll;
int N;
ll a[100005], b[100005];
int main() {
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] > b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 768,837 | 768,838 | u220922076 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#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() {
long n;
cin >> n;
vector<long> b(n + 1);
vector<long> a(n);
for (int i = 0; i < n + 1; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
ans += b[i];
a[i] -= b[i];
b[i] == 0;
} else {
ans += a[i];
continue;
}
if (b[i + 1] <= a[i]) {
ans += b[i + 1];
b[i + 1] = 0;
} else {
ans += a[i];
b[i + 1] -= a[i];
}
}
cout << ans << endl;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#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() {
long n;
cin >> n;
vector<long> b(n + 1);
vector<long> a(n);
for (int i = 0; i < n + 1; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
ans += b[i];
a[i] -= b[i];
b[i] == 0;
} else {
ans += a[i];
continue;
}
if (b[i + 1] <= a[i]) {
ans += b[i + 1];
b[i + 1] = 0;
} else {
ans += a[i];
b[i + 1] -= a[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 768,839 | 768,840 | u637284188 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.