problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0);
vector<ll> B(N, 0);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (ll i = 0; i < N; i++) {
cin >> B.at(i);
}
ll ans = 0;
ll sum = A.at(0);
for (ll i = 0; i < N; i++) {
if (sum >= B.at(i)) {
if (i == 0) {
ans += B.at(i);
sum = A.at(1);
continue;
}
ans += sum - A.at(i) + B.at(i);
sum = A.at(i + 1);
} else {
ans += A.at(i);
if (A.at(i + 1) - (B.at(i) - sum) > 0) {
if (i == N - 1) {
// cout << B.at(i) - sum << " " << sum << endl;
ans += B.at(i) - sum;
}
sum = A.at(i + 1) - (B.at(i) - sum);
} else if (A.at(i + 1) - (B.at(i) - sum) <= 0) {
sum = 0;
if (i == N - 1) {
ans += A.at(i + 1);
}
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1, 0);
vector<ll> B(N, 0);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (ll i = 0; i < N; i++) {
cin >> B.at(i);
}
ll ans = 0;
ll sum = A.at(0);
for (ll i = 0; i < N; i++) {
if (sum >= B.at(i)) {
if (i == 0) {
ans += B.at(i);
sum = A.at(1);
continue;
}
ans += A.at(i) + B.at(i) - sum;
sum = A.at(i + 1);
} else {
ans += A.at(i);
if (A.at(i + 1) - (B.at(i) - sum) > 0) {
if (i == N - 1) {
// cout << B.at(i) - sum << " " << sum << endl;
ans += B.at(i) - sum;
}
sum = A.at(i + 1) - (B.at(i) - sum);
} else if (A.at(i + 1) - (B.at(i) - sum) <= 0) {
sum = 0;
if (i == N - 1) {
ans += A.at(i + 1);
}
}
}
}
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 767,107 | 767,108 | u343935874 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int32_t N;
cin >> N;
vector<int32_t> A(N + 1), B(N);
for (int32_t i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int32_t i = 0; i < N; i++) {
cin >> B[i];
}
int32_t total = 0;
for (int32_t i = 0; i < N; i++) {
int32_t _min = min(A[i], B[i]);
A[i] -= _min;
B[i] -= _min;
total += _min;
_min = min(A[i + 1], B[i]);
A[i + 1] -= _min;
B[i] -= _min;
total += _min;
}
cout << total << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int32_t N;
cin >> N;
vector<int64_t> A(N + 1), B(N);
for (int32_t i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int32_t i = 0; i < N; i++) {
cin >> B[i];
}
int64_t total = 0;
for (int32_t i = 0; i < N; i++) {
int64_t _min = min(A[i], B[i]);
A[i] -= _min;
B[i] -= _min;
total += _min;
_min = min(A[i + 1], B[i]);
A[i + 1] -= _min;
B[i] -= _min;
total += _min;
}
cout << total << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,113 | 767,114 | u519382463 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
// main
int rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0];
} else {
rem += b[0];
b[0] = 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] < b[i]) {
rem += a[i + 1];
a[i + 1] = 0;
} else {
rem += b[i];
a[i + 1] -= b[i];
}
if (a[i + 1] < b[i + 1]) {
rem += a[i + 1];
b[i + 1] -= a[i + 1];
} else {
rem += b[i + 1];
b[i + 1] = 0;
}
}
if (a[n] < b[n - 1]) {
rem += a[n];
} else {
rem += b[n - 1];
}
cout << rem << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
// main
long long rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0];
} else {
rem += b[0];
b[0] = 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] < b[i]) {
rem += a[i + 1];
a[i + 1] = 0;
} else {
rem += b[i];
a[i + 1] -= b[i];
}
if (a[i + 1] < b[i + 1]) {
rem += a[i + 1];
b[i + 1] -= a[i + 1];
} else {
rem += b[i + 1];
b[i + 1] = 0;
}
}
if (a[n] < b[n - 1]) {
rem += a[n];
} else {
rem += b[n - 1];
}
cout << rem << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,119 | 767,120 | u498066729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
// main
int rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0];
} else {
rem += b[0];
b[0] = 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] < b[i]) {
rem += a[i + 1];
a[i + 1] = 0;
} else {
rem += b[i];
a[i + 1] -= b[i];
}
if (a[i + 1] < b[i + 1]) {
rem += a[i + 1];
b[i + 1] -= a[i + 1];
} else {
rem += b[i];
b[i + 1] = 0;
}
}
if (a[n] < b[n - 1]) {
rem += a[n];
} else {
rem += b[n - 1];
}
cout << rem << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// data loader
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int b[n];
for (int i = 0; i < n; i++) {
cin >> b[i];
}
// main
long long rem = 0;
if (a[0] < b[0]) {
rem += a[0];
b[0] -= a[0];
} else {
rem += b[0];
b[0] = 0;
}
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] < b[i]) {
rem += a[i + 1];
a[i + 1] = 0;
} else {
rem += b[i];
a[i + 1] -= b[i];
}
if (a[i + 1] < b[i + 1]) {
rem += a[i + 1];
b[i + 1] -= a[i + 1];
} else {
rem += b[i + 1];
b[i + 1] = 0;
}
}
if (a[n] < b[n - 1]) {
rem += a[n];
} else {
rem += b[n - 1];
}
cout << rem << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 767,121 | 767,120 | u498066729 | 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 sum = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
sum += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
sum += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
if (B[i] < A[i + 1]) {
sum += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
sum += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
}
cout << sum << endl;
} | #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];
long sum = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
sum += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
sum += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
if (B[i] < A[i + 1]) {
sum += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
sum += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,122 | 767,123 | u423656246 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
ll n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = n; i > 0; i--) {
if (a[i + 1] > b[i]) {
ans += b[i + 1];
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;
return 0;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
ll n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = n; i > 0; i--) {
if (a[i + 1] > b[i]) {
ans += 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;
return 0;
} | [
"expression.operation.binary.remove"
] | 767,128 | 767,129 | u522566752 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
int n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = n; i > 0; i--) {
if (a[i + 1] > b[i]) {
ans += b[i + 1];
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;
return 0;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int INF = 100000000;
ll n;
ll a[100010];
ll b[100010];
int main() {
cin >> n;
for (int i = 1; i <= n + 1; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = n; i > 0; i--) {
if (a[i + 1] > b[i]) {
ans += 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;
return 0;
} | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 767,130 | 767,129 | u522566752 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n;
cin >> n;
ll a[n + 1], b[n];
for (i = 0; i < n + 1; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
ll sum = 0;
for (i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
else if (b[i] - a[i] <= a[i + 1]) {
a[i + 1] -= (a[i] - b[i]);
sum += b[i];
} else {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int i, j, cnt;
int n;
cin >> n;
ll a[n + 1], b[n];
for (i = 0; i < n + 1; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
ll sum = 0;
for (i = 0; i < n; i++) {
if (a[i] >= b[i])
sum += b[i];
else if (b[i] - a[i] <= a[i + 1]) {
a[i + 1] -= (b[i] - a[i]);
sum += b[i];
} else {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << sum;
} | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 767,131 | 767,132 | u952130512 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int p = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) < b.at(i)) {
p += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else {
p += b.at(i);
a.at(i + 1) = min(a.at(i + 1), a.at(i) + a.at(i + 1) - b.at(i));
}
}
cout << p << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int64_t p = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) + a.at(i + 1) < b.at(i)) {
p += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else {
p += b.at(i);
a.at(i + 1) = min(a.at(i + 1), a.at(i) + a.at(i + 1) - b.at(i));
}
}
cout << p << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,133 | 767,134 | u356701928 | cpp |
p02959 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MAX = 100001;
int main() {
int N, A[MAX], B[MAX];
cin >> N;
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
int monster = 0;
for (int i = 0; i < N; ++i) {
int now = min(A[i], B[i]);
monster += now;
B[i] -= now;
int next = min(A[i + 1], B[i]);
monster += next;
A[i + 1] -= next;
}
cout << monster;
return 0;
}
| #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
static const int MAX = 100001;
int main() {
ll N, A[MAX], B[MAX];
cin >> N;
for (int i = 0; i < N + 1; ++i)
cin >> A[i];
for (int i = 0; i < N; ++i)
cin >> B[i];
ll monster = 0;
for (int i = 0; i < N; ++i) {
ll now = min(A[i], B[i]);
monster += now;
B[i] -= now;
ll next = min(A[i + 1], B[i]);
monster += next;
A[i + 1] -= next;
}
cout << monster;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,135 | 767,136 | u616461826 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(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;
int ans = 0;
int nokori = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i] < nokori) {
ans += a[i];
nokori = b[i];
}
else {
if (a[i] - nokori >= b[i]) {
ans += b[i] + nokori;
nokori = 0;
} else {
ans += a[i];
nokori = b[i] + nokori - a[i];
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long int> a(n + 1), b(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;
long int ans = 0;
long int nokori = 0;
for (int i = 0; i < n + 1; i++) {
if (a[i] < nokori) {
ans += a[i];
nokori = b[i];
}
else {
if (a[i] - nokori >= b[i]) {
ans += b[i] + nokori;
nokori = 0;
} else {
ans += a[i];
nokori = b[i] + nokori - a[i];
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,137 | 767,138 | u332946309 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> 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);
}
int sum = 0;
for (int i = 0; i < n; i++) {
// cout << sum << endl;
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
continue;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
} else {
sum += a.at(i + 1);
a.at(i + 1) = 0;
b.at(i) -= a.at(i + 1);
}
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> 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);
}
long long int sum = 0;
for (int i = 0; i < n; i++) {
// cout << sum << endl;
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
continue;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
} else {
sum += a.at(i + 1);
a.at(i + 1) = 0;
b.at(i) -= a.at(i + 1);
}
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,140 | 767,141 | u053227023 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> 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);
}
int sum = 0;
for (int i = 0; i < n; i++) {
// cout << sum << endl;
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
continue;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
} else {
sum += a.at(i + 1);
a.at(i + 1) = 0;
b.at(i) -= a.at(i + 1);
}
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long int n;
cin >> n;
vector<long long> 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);
}
long long int sum = 0;
for (int i = 0; i < n; i++) {
// cout << sum << endl;
if (a.at(i) > b.at(i)) {
sum += b.at(i);
a.at(i) -= b.at(i);
continue;
} else {
sum += a.at(i);
b.at(i) -= a.at(i);
a.at(i) = 0;
if (a.at(i + 1) > b.at(i)) {
sum += b.at(i);
a.at(i + 1) -= b.at(i);
} else {
sum += a.at(i + 1);
a.at(i + 1) = 0;
b.at(i) -= a.at(i + 1);
}
}
}
cout << sum << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 767,142 | 767,141 | u053227023 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
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 res = 0;
for (int i = 0; i < n; ++i) {
if ((a[i] + a[i + 1]) < b[i]) {
res += b[i];
if (b[i] <= a[i]) {
a[i] -= b[i];
} else {
a[i + 1] -= (b[i] - a[i]);
a[i] = 0;
}
} else {
res += (a[i] + a[i + 1]);
a[i] = 0;
a[i + 1] = 0;
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
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 res = 0;
for (int i = 0; i < n; ++i) {
if ((a[i] + a[i + 1]) > b[i]) {
res += b[i];
if (b[i] <= a[i]) {
a[i] -= b[i];
} else {
a[i + 1] -= (b[i] - a[i]);
a[i] = 0;
}
} else {
res += (a[i] + a[i + 1]);
a[i] = 0;
a[i + 1] = 0;
}
}
cout << res << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,143 | 767,144 | u294683729 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
a[i + 1] = 0;
b[i] -= a[i + 1];
}
} else {
ans += b[i];
b[i] = 0;
}
}
if (a[n] > b[n - 1]) {
ans += b[n - 1];
} else {
ans += a[n];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
a[i + 1] = 0;
b[i] -= a[i + 1];
}
} else {
ans += b[i];
b[i] = 0;
}
}
if (a[n] > b[n - 1]) {
ans += b[n - 1];
} else {
ans += a[n];
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,145 | 767,146 | u006721330 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
a[i + 1] = 0;
b[i] -= a[i + 1];
}
} else {
ans += b[i];
b[i] = 0;
}
}
if (a[n] > b[n - 1]) {
ans += b[n - 1];
} else {
ans += a[n];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; ++i) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
ans += a[i + 1];
a[i + 1] = 0;
b[i] -= a[i + 1];
}
} else {
ans += b[i];
b[i] = 0;
}
}
if (a[n] > b[n - 1]) {
ans += b[n - 1];
} else {
ans += a[n];
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,145 | 767,147 | u006721330 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<long long> A(N + 1, 0);
vector<long long> B(N + 1, 0);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
int ans = 0;
rep(i, N) {
ans += min(A[i], B[i]);
if (B[i] - min(A[i], B[i]) >= 0) { //体力が残ってる
ans += min(A[i + 1], B[i] - min(A[i], B[i]));
A[i + 1] = A[i + 1] - min(A[i + 1], B[i] - min(A[i], B[i]));
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long N;
cin >> N;
vector<long long> A(N + 1, 0);
vector<long long> B(N + 1, 0);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
long long ans = 0;
rep(i, N) {
ans += min(A[i], B[i]);
if (B[i] - min(A[i], B[i]) > 0) { //体力が残ってる
ans += min(A[i + 1], B[i] - min(A[i], B[i]));
A[i + 1] = A[i + 1] - min(A[i + 1], B[i] - min(A[i], B[i]));
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,150 | 767,151 | u789101777 | cpp |
p02959 | #ifdef LOCAL111
#else
#pragma GCC optimize("O3")
#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ' ' << p.second << ')';
return os;
}
#define endl '\n'
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#ifdef LOCAL111
#define DEBUG(x) cout << #x << ": " << (x) << endl
template <typename T> void dpite(T a, T b) {
for (T ite = a; ite != b; ite++)
cout << (ite == a ? "" : " ") << *ite;
cout << endl;
}
#else
#define DEBUG(x) true
template <typename T> void dpite(T a, T b) { return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge) + 1 << ": "
template <typename T> void pite(T a, T b) {
for (T ite = a; ite != b; ite++)
cout << (ite == a ? "" : " ") << *ite;
cout << endl;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
void ios_init() {
// cout.setf(ios::fixed);
// cout.precision(12);
#ifdef LOCAL111
return;
#endif
ios::sync_with_stdio(false);
cin.tie(0);
}
int main() {
ios_init();
int n;
while (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;
RREP(i, n) {
LL t = min(a[i + 1], b[i]);
b[i] -= t;
a[i + 1] -= t;
ans += t;
t = min(a[i], b[i]);
b[i] -= t;
a[i + 1] -= t;
ans += t;
}
cout << ans << endl;
}
return 0;
}
| #ifdef LOCAL111
#else
#pragma GCC optimize("O3")
#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ' ' << p.second << ')';
return os;
}
#define endl '\n'
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#ifdef LOCAL111
#define DEBUG(x) cout << #x << ": " << (x) << endl
template <typename T> void dpite(T a, T b) {
for (T ite = a; ite != b; ite++)
cout << (ite == a ? "" : " ") << *ite;
cout << endl;
}
#else
#define DEBUG(x) true
template <typename T> void dpite(T a, T b) { return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge) + 1 << ": "
template <typename T> void pite(T a, T b) {
for (T ite = a; ite != b; ite++)
cout << (ite == a ? "" : " ") << *ite;
cout << endl;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
void ios_init() {
// cout.setf(ios::fixed);
// cout.precision(12);
#ifdef LOCAL111
return;
#endif
ios::sync_with_stdio(false);
cin.tie(0);
}
int main() {
ios_init();
int n;
while (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;
RREP(i, n) {
LL t = min(a[i + 1], b[i]);
b[i] -= t;
a[i + 1] -= t;
ans += t;
t = min(a[i], b[i]);
b[i] -= t;
a[i] -= t;
ans += t;
}
cout << ans << endl;
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 767,152 | 767,153 | u412820911 | cpp |
p02959 |
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define endl '\n'
const int MX = 1e5 + 5;
int n;
int a[MX];
signed main() {
IOS;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int x, ans = 0;
for (int i = 0; i < n; i++) {
cin >> x;
int mn = min(a[i], x);
ans += mn;
x -= mn;
mn = min(a[i + 1], x);
a[i + 1] -= mn;
ans += mn;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define endl '\n'
#define int long long
const int MX = 1e5 + 5;
int n;
int a[MX];
signed main() {
IOS;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int x, ans = 0;
for (int i = 0; i < n; i++) {
cin >> x;
int mn = min(a[i], x);
ans += mn;
x -= mn;
mn = min(a[i + 1], x);
a[i + 1] -= mn;
ans += mn;
}
cout << ans << endl;
return 0;
}
| [] | 767,154 | 767,155 | u155985376 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int cnt = 0;
rep(i, n) {
if (b[i] < a[i]) {
cnt += b[i];
a[i] -= b[i];
} else {
if (b[i] < a[i] + a[i + 1]) {
cnt += b[i];
a[i + 1] -= b[i] - a[i];
} else {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << cnt << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
long long int mod = 1e9 + 7;
bool debug = false;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long long int cnt = 0;
rep(i, n) {
if (b[i] < a[i]) {
cnt += b[i];
a[i] -= b[i];
} else {
if (b[i] < a[i] + a[i + 1]) {
cnt += b[i];
a[i + 1] -= b[i] - a[i];
} else {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,158 | 767,159 | u732502311 | cpp |
p02959 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lli N;
cin >> N;
vector<lli> a(N + 1);
vector<lli> b(N);
REP(i, N + 1) { cin >> a[i]; }
REP(i, N) { cin >> b[i]; }
lli sum = 0;
REP(i, N) {
REP(j, 2) {
lli minab = min(a[i + j], b[i]);
a[i] -= minab;
b[i] -= minab;
sum += minab;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lli N;
cin >> N;
vector<lli> a(N + 1);
vector<lli> b(N);
REP(i, N + 1) { cin >> a[i]; }
REP(i, N) { cin >> b[i]; }
lli sum = 0;
REP(i, N) {
REP(j, 2) {
lli minab = min(a[i + j], b[i]);
a[i + j] -= minab;
b[i] -= minab;
sum += minab;
}
}
cout << sum << endl;
}
| [
"assignment.change"
] | 767,166 | 767,167 | u468262978 | cpp |
p02959 | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N);
REP(i, N + 1) { cin >> a[i]; }
REP(i, N) { cin >> b[i]; }
int sum = 0;
REP(i, N) {
int minab = min(a[i], b[i]);
a[i] -= minab;
b[i] -= minab;
sum += minab;
if (b[i] != 0) {
minab = min(a[i + 1], b[i]);
a[i + 1] -= minab;
b[i] -= minab;
sum += minab;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPB(i, n) for (int i = 0; i < BIT(n); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORA(i, n) for (auto &&i : n)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define INF 2e9
#define MOD (1000000007)
#define EPS 1e-9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lli N;
cin >> N;
vector<lli> a(N + 1);
vector<lli> b(N);
REP(i, N + 1) { cin >> a[i]; }
REP(i, N) { cin >> b[i]; }
lli sum = 0;
REP(i, N) {
lli minab = min(a[i], b[i]);
a[i] -= minab;
b[i] -= minab;
sum += minab;
if (b[i] != 0) {
minab = min(a[i + 1], b[i]);
a[i + 1] -= minab;
b[i] -= minab;
sum += minab;
}
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 767,168 | 767,169 | u468262978 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<int> a(N + 1), b(N);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
int cnt = 0;
rep(i, N) {
cnt += min(a[i], b[i]);
tie(a[i], b[i]) =
make_tuple(a[i] - min(a[i], b[i]), b[i] - min(a[i], b[i]));
cnt += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<int> a(N + 1), b(N);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
ll cnt = 0;
rep(i, N) {
cnt += min(a[i], b[i]);
tie(a[i], b[i]) =
make_tuple(a[i] - min(a[i], b[i]), b[i] - min(a[i], b[i]));
cnt += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << cnt << endl;
} | [
"variable_declaration.type.change"
] | 767,174 | 767,175 | u502389123 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,180 | 767,181 | u582357587 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 1; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 767,182 | 767,181 | u582357587 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i <= N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
int A[100010], B[100010];
cin >> N;
long long ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 767,183 | 767,181 | u582357587 | cpp |
p02959 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell1 1e9 + 7
#define hell2 1e9 + 9
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ll long long
#define ld long double
#define no_of_digits(n) floor(log10(n)) + 1
#define see(x) cout << (#x) << " is " << (x) << endl
#define INF 1e9
using namespace std;
ll mult(ll a, ll b, ll p = hell1) { return ((a % p) * (b % p)) % p; }
ll multbig(ll a, ll b, ll mod = hell1) {
if (a == 0 or b == 0)
return 0;
if (a == 1 or b == 1)
return (a * b) % mod;
ll cur = multbig(a, b / 2, mod);
cur = (2 * cur) % mod;
if (b % 2)
cur = (cur + a) % mod;
return cur;
}
ll add(ll a, ll b, ll p = hell1) {
if (a >= p)
a %= p;
if (b >= p)
b %= p;
if (a + b > p)
return (a + b) % p;
else
return a + b;
}
ll sub(ll a, ll b, ll p = hell1) { return (a % p - b % p + p) % p; }
ll fpow(ll n, ll k, ll p = hell1) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = mult(r, n, p);
n = mult(n, n, p);
}
return r;
}
ll inv(ll a, ll p = hell1) { return fpow(a, p - 2, p); }
ll inv_euclid(ll a, ll m = hell1) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int isPowerof2(ll x) { return (x && !(x & x - 1)); }
ll log2(ll x) {
ll res = 0;
while (x >>= 1)
res++;
return res;
}
// max({a, b, c, d})
vector<ll> adj[200005];
ll update[200005];
ll ans[200005];
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
// Initializing base value to 1, i.e 2^0
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
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 ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell1 1e9 + 7
#define hell2 1e9 + 9
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ll long long
#define ld long double
#define no_of_digits(n) floor(log10(n)) + 1
#define see(x) cout << (#x) << " is " << (x) << endl
#define INF 1e9
using namespace std;
ll mult(ll a, ll b, ll p = hell1) { return ((a % p) * (b % p)) % p; }
ll multbig(ll a, ll b, ll mod = hell1) {
if (a == 0 or b == 0)
return 0;
if (a == 1 or b == 1)
return (a * b) % mod;
ll cur = multbig(a, b / 2, mod);
cur = (2 * cur) % mod;
if (b % 2)
cur = (cur + a) % mod;
return cur;
}
ll add(ll a, ll b, ll p = hell1) {
if (a >= p)
a %= p;
if (b >= p)
b %= p;
if (a + b > p)
return (a + b) % p;
else
return a + b;
}
ll sub(ll a, ll b, ll p = hell1) { return (a % p - b % p + p) % p; }
ll fpow(ll n, ll k, ll p = hell1) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = mult(r, n, p);
n = mult(n, n, p);
}
return r;
}
ll inv(ll a, ll p = hell1) { return fpow(a, p - 2, p); }
ll inv_euclid(ll a, ll m = hell1) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int isPowerof2(ll x) { return (x && !(x & x - 1)); }
ll log2(ll x) {
ll res = 0;
while (x >>= 1)
res++;
return res;
}
// max({a, b, c, d})
vector<ll> adj[200005];
ll update[200005];
ll ans[200005];
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
// Initializing base value to 1, i.e 2^0
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
}
cout << ans << "\n";
}
| [
"variable_declaration.type.change"
] | 767,187 | 767,188 | u962241803 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vii = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n + 2), b(n + 1);
rep(i, n + 1) cin >> a[i + 1];
rep(i, n) cin >> b[i + 1];
// rep(i, n + 2) cout << a[i];
// rep(i, n + 1) cout << b[i];
int ans = 0;
for (int i = 1; i <= n + 1; i++) {
if (a[i] >= b[i - 1]) {
a[i] -= b[i - 1];
ans += b[i - 1];
} else {
ans += a[i];
b[i - 1] -= a[i];
a[i] = 0;
}
if (i == n + 1)
break;
if (a[i] >= b[i]) {
ans += b[i];
b[i] = 0;
} else {
ans += a[i];
b[i] -= a[i];
}
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>;
using vii = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n + 2), b(n + 1);
rep(i, n + 1) cin >> a[i + 1];
rep(i, n) cin >> b[i + 1];
// rep(i, n + 2) cout << a[i];
// rep(i, n + 1) cout << b[i];
long long int ans = 0;
for (int i = 1; i <= n + 1; i++) {
if (a[i] >= b[i - 1]) {
a[i] -= b[i - 1];
ans += b[i - 1];
} else {
ans += a[i];
b[i - 1] -= a[i];
a[i] = 0;
}
if (i == n + 1)
break;
if (a[i] >= b[i]) {
ans += b[i];
b[i] = 0;
} else {
ans += a[i];
b[i] -= a[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,189 | 767,190 | u654115433 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iomanip>
#include <unordered_map>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) { cin >> a.at(i); }
vector<ll> b(n);
rep(i, n) { cin >> b.at(i); }
int count = 0;
rep(i, n) {
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>
#include <iomanip>
#include <unordered_map>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) { cin >> a.at(i); }
vector<ll> b(n);
rep(i, n) { cin >> b.at(i); }
ll count = 0;
rep(i, n) {
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.change"
] | 767,194 | 767,195 | u295618957 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
long long ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,196 | 767,197 | u510383220 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
int ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= B[i] - A[i];
} else {
ans += B[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> A(n), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
rep(i, n) cin >> B[i];
long long ans = 0;
rep(i, n) {
if (B[i] >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] >= A[i]) {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
} else {
ans += B[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,198 | 767,197 | u510383220 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
#define max_3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
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 += min(a[i], b[i]) + min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
#define min_3(a, b, c) min(a, min(b, c))
#define max_3(a, b, c) max(a, max(b, c))
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1);
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 += min(a[i], b[i]) + min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 767,201 | 767,202 | u170650966 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int answer = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
b.at(i) -= a.at(i);
answer += a.at(i);
if (b.at(i) > a.at(i + 1)) {
answer += a.at(i + 1);
a.at(i + 1) = 0;
} else {
a.at(i + 1) -= b.at(i);
answer += b.at(i);
}
} else {
answer += b.at(i);
}
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long answer = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
b.at(i) -= a.at(i);
answer += a.at(i);
if (b.at(i) > a.at(i + 1)) {
answer += a.at(i + 1);
a.at(i + 1) = 0;
} else {
a.at(i + 1) -= b.at(i);
answer += b.at(i);
}
} else {
answer += b.at(i);
}
}
cout << answer << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,203 | 767,204 | u752904037 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum;
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 (B[i] <= A[i]) {
sum += B[i];
} else {
B[i] -= A[i];
sum += A[i];
if (B[i] <= A[i + 1]) {
sum += B[i];
A[i + 1] -= B[i];
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum = 0;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum += B[i];
} else {
B[i] -= A[i];
sum += A[i];
if (B[i] <= A[i + 1]) {
sum += B[i];
A[i + 1] -= B[i];
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"variable_declaration.value.change"
] | 767,205 | 767,206 | u247407965 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum += B[i];
} else {
B[i] -= A[i];
sum += A[i];
if (B[i] <= A[i + 1]) {
sum += B[i];
A[i + 1] -= B[i];
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
long sum = 0;
cin >> n;
vector<int> A(n + 1), B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
sum += B[i];
} else {
B[i] -= A[i];
sum += A[i];
if (B[i] <= A[i + 1]) {
sum += B[i];
A[i + 1] -= B[i];
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,207 | 767,206 | u247407965 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int hoge;
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]) {
ans += min(a[i], b[i]);
hoge = min(b[i] - a[i], a[i + 1]);
a[i + 1] -= hoge;
ans += hoge;
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
int hoge;
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]) {
ans += min(a[i], b[i]);
hoge = min(b[i] - a[i], a[i + 1]);
a[i + 1] -= hoge;
ans += hoge;
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,208 | 767,209 | u728894486 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
int hoge;
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]){
ans += min(a[i], b[i]);
hoge = min(b[i] - a[i], a[i + 1]);
a[i + 1] -= hoge;
ans += hoge;
}
else {
ans += b[i];
}*/
int d = min(a[i], b[i]);
ans += d;
a[i] -= d;
b[i] -= d;
d = min(a[i + 1], b[i]);
ans += d;
a[i + 1] -= d;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
int hoge;
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]){
ans += min(a[i], b[i]);
hoge = min(b[i] - a[i], a[i + 1]);
a[i + 1] -= hoge;
ans += hoge;
}
else {
ans += b[i];
}*/
int d = min(a[i], b[i]);
ans += d;
a[i] -= d;
b[i] -= d;
d = min(a[i + 1], b[i]);
ans += d;
a[i + 1] -= d;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,210 | 767,211 | u728894486 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a.at(i), b.at(i));
b.at(i) -= min(a.at(i), b.at(i));
ans += min(a.at(i + 1), b.at(i));
a.at(i + 1) -= min(a.at(i + 1), b.at(i));
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long long ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a.at(i), b.at(i));
b.at(i) -= min(a.at(i), b.at(i));
ans += min(a.at(i + 1), b.at(i));
a.at(i + 1) -= min(a.at(i + 1), b.at(i));
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,212 | 767,213 | u522993719 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monsters, savers;
for (int i = 0; i < N + 1; i++) {
int monsterNum;
cin >> monsterNum;
monsters.push_back(monsterNum);
}
for (int i = 0; i < N; i++) {
int saverNum;
cin >> saverNum;
savers.push_back(saverNum);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (monsters[i] >= savers[i]) {
ans += savers[i];
} else {
savers[i] = savers[i] - monsters[i];
ans += monsters[i];
if (monsters[i + 1] >= savers[i]) {
ans += savers[i];
monsters[i + 1] = monsters[i + 1] - savers[i];
} else {
ans += monsters[i + 1];
monsters[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monsters, savers;
for (int i = 0; i < N + 1; i++) {
int monsterNum;
cin >> monsterNum;
monsters.push_back(monsterNum);
}
for (int i = 0; i < N; i++) {
int saverNum;
cin >> saverNum;
savers.push_back(saverNum);
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (monsters[i] >= savers[i]) {
ans += savers[i];
} else {
savers[i] = savers[i] - monsters[i];
ans += monsters[i];
if (monsters[i + 1] >= savers[i]) {
ans += savers[i];
monsters[i + 1] = monsters[i + 1] - savers[i];
} else {
ans += monsters[i + 1];
monsters[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,216 | 767,217 | u694725414 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define FORall(it, a) \
for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed << setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const ld PI = acos((ld)-1);
const ld EPS = 1e-9;
void TimeExecution() {
cout << "\n\n===>> Time Execution: " << clock() / (double)1000 << " sec(s).";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
/*
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
*/
int n;
cin >> n;
int a[n + 2];
int b[n + 1];
FOR(i, 1, n + 1) cin >> a[i];
FOR(i, 1, n) cin >> b[i];
int res = 0;
FOR(i, 1, n) {
res += min(a[i] + a[i + 1], b[i]);
if (b[i] >= a[i])
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define FORall(it, a) \
for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed << setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const ld PI = acos((ld)-1);
const ld EPS = 1e-9;
void TimeExecution() {
cout << "\n\n===>> Time Execution: " << clock() / (double)1000 << " sec(s).";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
/*
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
*/
int n;
cin >> n;
int a[n + 2];
int b[n + 1];
FOR(i, 1, n + 1) cin >> a[i];
FOR(i, 1, n) cin >> b[i];
ll res = 0;
FOR(i, 1, n) {
res += min(a[i] + a[i + 1], b[i]);
if (b[i] >= a[i])
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
}
cout << res;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,222 | 767,223 | u871436624 | cpp |
p02959 | #include <bits/stdc++.h>
#include <vector>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main(void) {
int N, cnt = 0;
cin >> N;
V<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
if (A[i] <= B[i]) {
cnt += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <vector>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int main(void) {
int N;
long long cnt = 0;
cin >> N;
V<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
rep(i, N) {
if (A[i] <= B[i]) {
cnt += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
cnt += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 767,224 | 767,225 | u144980750 | cpp |
p02959 | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i]; }
int enemy = 0;
rep(i, n) {
if (city[i] >= yusya[i]) {
enemy += yusya[i];
}
if (city[i] < yusya[i]) {
int temp;
enemy += city[i];
temp = yusya[i] - city[i];
if (temp <= city[i + 1]) {
city[i + 1] -= temp;
enemy += temp;
} else if (temp > city[i + 1]) {
enemy += city[i + 1];
city[i + 1] = 0;
}
}
}
cout << enemy << endl;
}
| #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
long n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i]; }
long enemy = 0;
rep(i, n) {
if (city[i] >= yusya[i]) {
enemy += yusya[i];
}
if (city[i] < yusya[i]) {
int temp;
enemy += city[i];
temp = yusya[i] - city[i];
if (temp <= city[i + 1]) {
city[i + 1] -= temp;
enemy += temp;
} else if (temp > city[i + 1]) {
enemy += city[i + 1];
city[i + 1] = 0;
}
}
}
cout << enemy << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,226 | 767,227 | u259590403 | cpp |
p02959 | #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i]; }
// 3
// // 5 6 3 8
// 5 100 8
// ans = 22
// int n = 3;
// int city[4] = {5,6,3,8};
// int yusya[3] = {5,100,8};
int enemy = 0;
rep(i, n) {
if (city[i] >= yusya[i]) {
enemy += yusya[i];
}
if (city[i] < yusya[i]) {
int temp;
enemy += city[i];
temp = yusya[i] - city[i];
if (temp <= city[i + 1]) {
city[i + 1] -= temp;
enemy += temp;
} else if (temp > city[i + 1]) {
enemy += city[i + 1];
city[i + 1] = 0;
}
}
}
cout << enemy << endl;
}
| #include <iostream>
#include <math.h> // double fmod(double x, double y);
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
int main() {
long n;
cin >> n;
int city[n + 1];
int yusya[n];
rep(i, n + 1) { cin >> city[i]; }
rep(i, n) { cin >> yusya[i]; }
long enemy = 0;
rep(i, n) {
if (city[i] >= yusya[i]) {
enemy += yusya[i];
}
if (city[i] < yusya[i]) {
int temp;
enemy += city[i];
temp = yusya[i] - city[i];
if (temp <= city[i + 1]) {
city[i + 1] -= temp;
enemy += temp;
} else if (temp > city[i + 1]) {
enemy += city[i + 1];
city[i + 1] = 0;
}
}
}
cout << enemy << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,230 | 767,227 | u259590403 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == st.size() - 1)
os << st[i];
else
os << st[i] << " ";
}
return os;
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
cin >> A;
cin >> B;
int ans = 0;
for (int i = 0; i < N; i++) {
int diff = B[i] - A[i];
if (diff < 0) {
ans += B[i];
continue;
}
ans += A[i];
int diff1 = A[i + 1] - diff;
if (diff1 < 0) {
ans += A[i + 1];
A[i + 1] = 0;
continue;
}
A[i + 1] = diff1;
ans += diff;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == st.size() - 1)
os << st[i];
else
os << st[i] << " ";
}
return os;
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
cin >> A;
cin >> B;
int ans = 0;
for (int i = 0; i < N; i++) {
int diff = B[i] - A[i];
if (diff < 0) {
ans += B[i];
continue;
}
ans += A[i];
int diff1 = A[i + 1] - diff;
if (diff1 < 0) {
ans += A[i + 1];
A[i + 1] = 0;
continue;
}
A[i + 1] = diff1;
ans += diff;
}
cout << ans << endl;
return 0;
}
| [] | 767,232 | 767,233 | u904833081 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> A(N + 1), B(N);
// A monster
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) >= B.at(i)) {
sum += B.at(i);
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
sum += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i) + A.at(i + 1) > B.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
sum += B.at(i);
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long sum = 0;
cin >> N;
vector<int> A(N + 1), B(N);
// A monster
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) >= B.at(i)) {
sum += B.at(i);
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
sum += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i) + A.at(i + 1) > B.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
sum += B.at(i);
}
}
cout << sum << endl;
}
| [
"variable_declaration.type.widen.change"
] | 767,234 | 767,235 | u028572059 | cpp |
p02959 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// cout << N << endl;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
ans += A[i];
B[i] -= A[i];
if (A[i + 1] > B[i]) {
A[i + 1] -= B[i];
ans += B[i];
} else { // A[i+1]<B[i]
ans += A[i + 1];
A[i + 1] = 0;
}
} else {
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// cout << N << endl;
vector<long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
ans += A[i];
B[i] -= A[i];
if (A[i + 1] > B[i]) {
A[i + 1] -= B[i];
ans += B[i];
} else { // A[i+1]<B[i]
ans += A[i + 1];
A[i + 1] = 0;
}
} else {
ans += B[i];
B[i] = 0;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 767,241 | 767,242 | u942160358 | cpp |
p02959 | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
repeat(i, N + 1) cin >> A[i];
vector<int> B(N);
repeat(i, N) cin >> B[i];
int ans = 0;
repeat(i, N) {
int e1 = min(A[i], B[i]);
ans += e1;
B[i] -= e1;
int e2 = min(A[i + 1], B[i]);
ans += e2;
A[i + 1] -= e2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
repeat(i, N + 1) cin >> A[i];
vector<int> B(N);
repeat(i, N) cin >> B[i];
long long ans = 0;
repeat(i, N) {
int e1 = min(A[i], B[i]);
ans += e1;
B[i] -= e1;
int e2 = min(A[i + 1], B[i]);
ans += e2;
A[i + 1] -= e2;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,249 | 767,250 | u726060136 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void solve() {
int ans = 0;
LL next = 0;
int N;
cin >> N;
vector<LL> A;
A.reserve(N + 1);
REP0(i, N + 1) cin >> A[i];
vector<LL> B;
B.reserve(N);
REP0(i, N) {
cin >> B[i];
if (A[i] < B[i]) {
ans += A[i];
next = min(A[i + 1], B[i] - A[i]);
A[i + 1] -= next;
ans += next;
} else {
ans += B[i];
next = 0;
}
}
cout << ans << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP0(i, n) for (int i = n - 1; i >= 0; --i)
#define RREP1(i, n) for (int i = n; i >= 1; --i)
#define SORT(c) sort((c).begin(), (c).end())
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define CLR(a) memset((a), 0, sizeof(a))
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long LL;
const int INTINF = 2147483647;
const LL LLINF = 9223372036854775807;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void solve() {
LL ans = 0;
LL next = 0;
int N;
cin >> N;
vector<LL> A;
A.reserve(N + 1);
REP0(i, N + 1) cin >> A[i];
vector<LL> B;
B.reserve(N);
REP0(i, N) {
cin >> B[i];
if (A[i] < B[i]) {
ans += A[i];
next = min(A[i + 1], B[i] - A[i]);
A[i + 1] -= next;
ans += next;
} else {
ans += B[i];
next = 0;
}
}
cout << ans << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"variable_declaration.type.change"
] | 767,251 | 767,252 | u938389536 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; ++i)
cin >> a[i];
int ans = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
int x = min(a[i], b);
ans += x;
b -= x;
x = min(a[i + 1], b);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 0; i < n + 1; ++i)
cin >> a[i];
long long ans = 0;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
int x = min(a[i], b);
ans += x;
b -= x;
x = min(a[i + 1], b);
ans += x;
a[i + 1] -= x;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,253 | 767,254 | u301109982 | 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);
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 (int i = 0; i < n + 1; i++) {
for (int j = -1; j <= 0; j++) {
if ((i == 0 && j == -1) || (i == n && j == 0))
continue;
int num = min(a.at(i), b.at(i + j));
a.at(i) -= num;
b.at(i + j) -= num;
ans += num;
}
}
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), 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);
}
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
for (int j = -1; j <= 0; j++) {
if ((i == 0 && j == -1) || (i == n && j == 0))
continue;
ll num = min(a.at(i), b.at(i + j));
a.at(i) -= num;
b.at(i + j) -= num;
ans += num;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,257 | 767,258 | u194421002 | cpp |
p02959 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ans = 0;
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];
}
for (int i = 0; i < n; i++) {
int mini = min(a[i], b[i]);
a[i] -= mini;
b[i] -= mini;
ans += mini;
mini = min(a[i + 1], b[i]);
a[i + 1] -= mini;
b[i] -= mini;
ans += mini;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll ans = 0;
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];
}
for (int i = 0; i < n; i++) {
ll mini = min(a[i], b[i]);
a[i] -= mini;
b[i] -= mini;
ans += mini;
mini = min(a[i + 1], b[i]);
a[i + 1] -= mini;
b[i] -= mini;
ans += mini;
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,263 | 767,264 | u117615163 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ans += min(b[i], a[i]);
b[i] -= min(b[i], a[i]);
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long int ans = 0;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
ans += min(b[i], a[i]);
b[i] -= min(b[i], a[i]);
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,267 | 767,268 | u045575753 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int ans[100001];
int main() {
int n;
cin >> n;
int a[100001], b[100001];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int f = min(a[i], b[i]);
ans += f;
b[i] -= f;
f = min(a[i + 1], b[i]);
ans += f;
a[i + 1] -= f;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int ans[100001];
int main() {
int n;
cin >> n;
int a[100001], b[100001];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int f = min(a[i], b[i]);
ans += f;
b[i] -= f;
f = min(a[i + 1], b[i]);
ans += f;
a[i + 1] -= f;
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,271 | 767,272 | u812475404 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
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++) {
int t = min(a[i], b[i]);
ans += t;
b[i] -= t;
t = min(a[i + 1], b[i]);
ans += t;
a[i + 1] -= t;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
ll a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ll t = min(a[i], b[i]);
ans += t;
b[i] -= t;
t = min(a[i + 1], b[i]);
ans += t;
a[i + 1] -= t;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 767,273 | 767,274 | u708258059 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int cnt = 0, dis = 0;
for (int i = 0; i < N; i++) {
dis = A.at(i) - B.at(i);
if (dis >= 0) {
cnt += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
} else {
cnt += A.at(i);
A.at(i) = 0;
B.at(i) = -dis;
}
dis = A.at(i + 1) - B.at(i);
if (dis >= 0) {
cnt += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0;
} else {
cnt += A.at(i + 1);
A.at(i + 1) = 0;
B.at(i) = -dis;
}
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int64_t cnt = 0, dis = 0;
for (int i = 0; i < N; i++) {
dis = A.at(i) - B.at(i);
if (dis >= 0) {
cnt += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
} else {
cnt += A.at(i);
A.at(i) = 0;
B.at(i) = -dis;
}
dis = A.at(i + 1) - B.at(i);
if (dis >= 0) {
cnt += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0;
} else {
cnt += A.at(i + 1);
A.at(i + 1) = 0;
B.at(i) = -dis;
}
}
cout << cnt << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,282 | 767,283 | u564185267 | cpp |
p02959 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int mx4[] = {0, 1, 0, -1};
const int my4[] = {1, 0, -1, 0};
const int mx8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int my8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int main() {
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0, num;
for (int i = 0; i < n; i++) {
num = min(a[i], b[i]);
a[i] -= num;
b[i] -= num;
ans += num;
if (b[i] > 0) {
num = min(a[i + 1], b[i]);
a[i + 1] -= num;
b[i] -= num;
ans += num;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
struct edge {
int to, cost;
};
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> P;
const int INF = 1e9;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int mx4[] = {0, 1, 0, -1};
const int my4[] = {1, 0, -1, 0};
const int mx8[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int my8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int main() {
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0, num;
for (int i = 0; i < n; i++) {
num = min(a[i], b[i]);
a[i] -= num;
b[i] -= num;
ans += num;
if (b[i] > 0) {
num = min(a[i + 1], b[i]);
a[i + 1] -= num;
b[i] -= num;
ans += num;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,286 | 767,287 | u216772548 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> m(N + 1);
vector<int> h(N);
int r = 0;
for (int i = 0; i < N + 1; i++) {
cin >> m.at(i);
}
for (int n = 0; n < N; n++) {
cin >> h.at(n);
}
for (int i = 0; i < N; i++) {
if (m.at(i) - h.at(i) >= 0) {
r += h.at(i);
} else if (m.at(i) + m.at(i + 1) - h.at(i) >= 0) {
m.at(i + 1) = m.at(i) + m.at(i + 1) - h.at(i);
r += h.at(i);
} else if (m.at(i) + m.at(i + 1) - h.at(i) <= 0) {
r += m.at(i) + m.at(i + 1);
m.at(i + 1) = 0;
}
}
cout << r << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> m(N + 1);
vector<int> h(N);
long long r = 0;
for (int i = 0; i < N + 1; i++) {
cin >> m.at(i);
}
for (int n = 0; n < N; n++) {
cin >> h.at(n);
}
for (int i = 0; i < N; i++) {
if (m.at(i) - h.at(i) >= 0) {
r += h.at(i);
} else if (m.at(i) + m.at(i + 1) - h.at(i) >= 0) {
m.at(i + 1) = m.at(i) + m.at(i + 1) - h.at(i);
r += h.at(i);
} else if (m.at(i) + m.at(i + 1) - h.at(i) <= 0) {
r += m.at(i) + m.at(i + 1);
m.at(i + 1) = 0;
}
}
cout << r << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,292 | 767,293 | u066647962 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
count += B.at(i);
}
// A<B
else if (A.at(i) + A.at(i + 1) > B.at(i)) {
count += B.at(i);
A.at(i + 1) = A.at(i) + A.at(i + 1) - B.at(i);
} else {
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long count = 0;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
count += B.at(i);
}
// A<B
else if (A.at(i) + A.at(i + 1) > B.at(i)) {
count += B.at(i);
A.at(i + 1) = A.at(i) + A.at(i + 1) - B.at(i);
} else {
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,303 | 767,304 | u438592861 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int count = 0;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
count += B.at(i);
}
// A<B
else if (A.at(i) + A.at(i + 1) > B.at(i)) {
count += B.at(i);
A.at(i + 1) = A.at(i) + A.at(i + 1) - B.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;
long count = 0;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
count += B.at(i);
}
// A<B
else if (A.at(i) + A.at(i + 1) > B.at(i)) {
count += B.at(i);
A.at(i + 1) = A.at(i) + A.at(i + 1) - B.at(i);
} else {
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,305 | 767,304 | u438592861 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
vector<int> A;
int main() {
int N, mon, yu, count = 0;
cin >> N;
for (int i = 0; i <= N; i++) {
cin >> mon;
A.push_back(mon);
}
for (int i = 0; i < N; i++) {
cin >> yu;
if (A[i] >= yu) {
count += yu;
} else {
count += A[i];
yu = yu - A[i];
if (A[i + 1] >= yu) {
count += yu;
A[i + 1] -= yu;
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> A;
int main() {
int N, mon, yu;
long count = 0;
cin >> N;
for (int i = 0; i <= N; i++) {
cin >> mon;
A.push_back(mon);
}
for (int i = 0; i < N; i++) {
cin >> yu;
if (A[i] >= yu) {
count += yu;
} else {
count += A[i];
yu = yu - A[i];
if (A[i + 1] >= yu) {
count += yu;
A[i + 1] -= yu;
} else {
count += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,306 | 767,307 | u522200796 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll ans = 0;
int n;
scanf("%d", &n);
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
for (int i = 0, j = 0; i < n + 1 && j < n;) {
if (a[i] <= b[j]) {
ans += a[i];
b[j] -= a[i];
j += (j - i == 1);
++i;
} else {
ans += b[j];
a[i] -= b[j];
i += (i - j == 0);
++j;
}
}
printf("%lld\n", ans);
return 0;
} | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll ans = 0;
int n;
scanf("%d", &n);
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
for (int i = 0, j = 0; i < n + 1 && j < n;) {
if (a[i] <= b[j]) {
ans += a[i];
b[j] -= a[i];
j += (i - j == 1);
++i;
} else {
ans += b[j];
a[i] -= b[j];
i += (i - j == 0);
++j;
}
}
printf("%lld\n", ans);
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 767,308 | 767,309 | u625436307 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
int kill = 0;
// i番目の街について考える
for (int kaori = 0; kaori < n; kaori++) {
if (a[kaori] >= b[kaori]) { // i街のモンスターを倒しきれない(=余力0)場合
kill += b[kaori];
} else if (a[kaori] + a[kaori + 1] >= b[kaori]) {
kill += b[kaori];
a[kaori + 1] -= (b[kaori] - a[kaori]);
} else {
kill += (a[kaori] + a[kaori + 1]);
a[kaori + 1] = 0;
}
}
cout << kill << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
long kill = 0;
// i番目の街について考える
for (int kaori = 0; kaori < n; kaori++) {
if (a[kaori] >= b[kaori]) { // i街のモンスターを倒しきれない(=余力0)場合
kill += b[kaori];
} else if (a[kaori] + a[kaori + 1] >= b[kaori]) {
kill += b[kaori];
a[kaori + 1] -= (b[kaori] - a[kaori]);
} else {
kill += (a[kaori] + a[kaori + 1]);
a[kaori + 1] = 0;
}
}
cout << kill << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,310 | 767,311 | u229213815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
int ans = 0;
// i番目の街について考える
for (int kaori = 0; kaori < n; kaori++) {
ans += min(a[kaori], b[kaori]);
if (b[kaori] > a[kaori]) {
b[kaori] -= a[kaori];
ans += min(a[kaori + 1], b[kaori]);
if (a[kaori + 1] > b[kaori]) {
a[kaori + 1] -= b[kaori];
} else {
a[kaori + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
long long ans = 0;
// i番目の街について考える
for (int kaori = 0; kaori < n; kaori++) {
ans += min(a[kaori], b[kaori]);
if (b[kaori] > a[kaori]) {
b[kaori] -= a[kaori];
ans += min(a[kaori + 1], b[kaori]);
if (a[kaori + 1] > b[kaori]) {
a[kaori + 1] -= b[kaori];
} else {
a[kaori + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,312 | 767,313 | u229213815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
int ans = 0;
// i番目の街について考える
for (int kaori = 0; kaori < n; kaori++) {
ans += min(a[kaori], b[kaori]);
if (b[kaori] > a[kaori]) {
b[kaori] -= a[kaori];
ans += min(a[kaori + 1], b[kaori]);
if (a[kaori + 1] > b[kaori]) {
a[kaori + 1] -= b[kaori];
} else {
a[kaori + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1), b(n);
for (int tsumugi = 0; tsumugi < n + 1; tsumugi++) {
cin >> a[tsumugi];
}
for (int matsuri = 0; matsuri < n; matsuri++) {
cin >> b[matsuri];
}
long long ans = 0;
// i番目の街について考える
for (int kaori = 0; kaori < n; kaori++) {
ans += min(a[kaori], b[kaori]);
if (b[kaori] > a[kaori]) {
b[kaori] -= a[kaori];
ans += min(a[kaori + 1], b[kaori]);
if (a[kaori + 1] > b[kaori]) {
a[kaori + 1] -= b[kaori];
} else {
a[kaori + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,314 | 767,313 | u229213815 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, ans, a[100000], b[100000], x;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(b[i], a[i]);
if (b[i] - a[i] > 0) {
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
if (a[i + 1] > b[i])
a[i + 1] -= b[i];
else
a[i + 1] = 0;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
long long n, ans, a[1000000], b[1000000], x;
int main() {
cin >> n;
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> b[i];
ans += min(b[i], a[i]);
if (b[i] - a[i] > 0) {
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
if (a[i + 1] > b[i])
a[i + 1] -= b[i];
else
a[i + 1] = 0;
}
}
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,317 | 767,316 | u087818812 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int a[110000], b[110000];
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
sum += a[i];
} else {
sum += b[i];
continue;
}
if (b[i] > a[i + 1]) {
sum += a[i + 1];
a[i + 1] = 0;
} else {
sum += b[i];
a[i + 1] -= b[i];
}
}
cout << sum;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
long a[110000], b[110000];
for (int i = 0; i <= N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
long sum = 0;
for (int i = 0; i < N; i++) {
if (b[i] > a[i]) {
b[i] -= a[i];
sum += a[i];
} else {
sum += b[i];
continue;
}
if (b[i] > a[i + 1]) {
sum += a[i + 1];
a[i + 1] = 0;
} else {
sum += b[i];
a[i + 1] -= b[i];
}
}
cout << sum;
} | [
"variable_declaration.type.primitive.change"
] | 767,320 | 767,321 | u126833093 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> m(n + 1), h(n);
for (int i = 0; i <= n; i++)
cin >> m[i];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] <= m[i]) {
ans += h[i];
m[i] -= h[i];
} else {
ans += m[i];
h[i] -= m[i];
m[i] = 0;
if (h[i] > m[i + 1]) {
ans += m[i + 1];
m[i + 1] = 0;
} else {
ans += h[i];
m[i + 1] -= h[i];
}
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vc vector<char>
#define vt vector<string>
#define si set<int>
#define sc set<char>
#define st set<string>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back;
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> m(n + 1), h(n);
for (int i = 0; i <= n; i++)
cin >> m[i];
for (int i = 0; i < n; i++)
cin >> h[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] <= m[i]) {
ans += h[i];
m[i] -= h[i];
} else {
ans += m[i];
h[i] -= m[i];
m[i] = 0;
if (h[i] > m[i + 1]) {
ans += m[i + 1];
m[i + 1] = 0;
} else {
ans += h[i];
m[i + 1] -= h[i];
}
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.change",
"variable_declaration.type.narrow.change"
] | 767,322 | 767,323 | u453071216 | cpp |
p02959 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
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++) {
ans += max(b[i], a[i]);
b[i] -= max(b[i], a[i]);
ans += max(a[i + 1], b[i]);
a[i + 1] -= max(a[i + 1], b[i]);
}
cout << ans << endl;
return 0;
} |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
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++) {
ans += min(b[i], a[i]);
b[i] -= min(b[i], a[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 767,324 | 767,325 | u874996917 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
ans += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
if (A[i + 1] - B[i] > 0) {
ans += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long int A[N + 1], B[N];
long int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
ans += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
if (A[i + 1] - B[i] > 0) {
ans += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
}
cout << ans;
}
| [
"variable_declaration.type.widen.change"
] | 767,330 | 767,331 | u447604786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] - B[i] >= 0) {
ans += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
if (A[i + 1] - B[i] >= 0) {
ans += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long int A[N + 1], B[N];
long int ans = 0;
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
ans += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
ans += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
if (A[i + 1] - B[i] > 0) {
ans += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
}
cout << ans;
}
| [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,332 | 767,331 | u447604786 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> heroes(n);
for (int i = 0; i <= n; i++) {
cin >> monsters[i];
}
for (int i = 0; i < n; i++) {
cin >> heroes[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] == heroes[i]) {
ans += monsters[i];
} else if (monsters[i] < heroes[i]) {
ans += monsters[i];
heroes[i] -= monsters[i];
if (heroes[i] < monsters[i + 1]) {
ans += heroes[i];
monsters[i + 1] -= heroes[i];
} else if (heroes[i] >= monsters[i + 1]) {
ans += monsters[i + 1];
monsters[i + 1] = 0;
}
} else {
ans += heroes[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monsters(n + 1);
vector<int> heroes(n);
for (int i = 0; i <= n; i++) {
cin >> monsters[i];
}
for (int i = 0; i < n; i++) {
cin >> heroes[i];
}
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (monsters[i] == heroes[i]) {
ans += monsters[i];
} else if (monsters[i] < heroes[i]) {
ans += monsters[i];
heroes[i] -= monsters[i];
if (heroes[i] < monsters[i + 1]) {
ans += heroes[i];
monsters[i + 1] -= heroes[i];
} else if (heroes[i] >= monsters[i + 1]) {
ans += monsters[i + 1];
monsters[i + 1] = 0;
}
} else {
ans += heroes[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,333 | 767,334 | u658234551 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
int ans = 0;
rep(i, n + 1) {
if ((a[i] - b[i]) < 0) {
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];
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
ll ans = 0;
rep(i, n + 1) {
if ((a[i] - b[i]) < 0) {
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];
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,335 | 767,336 | u341388158 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
int ans = 0;
rep(i, n + 1) {
if (a[i] - b[i] < 0) {
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];
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
ll ans = 0;
rep(i, n + 1) {
if ((a[i] - b[i]) < 0) {
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];
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.branch.if.condition.change"
] | 767,337 | 767,336 | u341388158 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef long double ld;
int main() {
int N;
cin >> N;
ll A[N], B[N];
for (int i = 0; i <= N; 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 c;
c = min(A[i], B[i]);
count += c;
A[i] -= c;
B[i] -= c;
c = min(A[i + 1], B[i]);
count += c;
A[i + 1] -= c;
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef long double ld;
int main() {
int N;
cin >> N;
ll A[N], B[N];
for (int i = 0; i <= N; 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 c;
c = min(A[i], B[i]);
count += c;
A[i] -= c;
B[i] -= c;
c = min(A[i + 1], B[i]);
count += c;
A[i + 1] -= c;
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,338 | 767,339 | u520791604 | cpp |
p02959 | #include "iostream"
#include "vector"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
int cnt = 0;
rep(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
if (B[i] == 0) {
continue;
}
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
}
cout << cnt << endl;
} | #include "iostream"
#include "vector"
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
long long N;
cin >> N;
vector<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
long long cnt = 0;
rep(i, N) {
if (B[i] >= A[i]) {
B[i] -= A[i];
cnt += A[i];
A[i] = 0;
} else {
A[i] -= B[i];
cnt += B[i];
B[i] = 0;
}
if (B[i] == 0) {
continue;
}
if (B[i] >= A[i + 1]) {
B[i] -= A[i + 1];
cnt += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= B[i];
cnt += B[i];
B[i] = 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,340 | 767,341 | u887207211 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
//---functions---//
int gcd(int a, int b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
int s2i(string num) {
stringstream ss;
ss << num << flush;
int n;
ss >> n;
return n;
}
string i2s(int n) {
stringstream ss;
ss << n << flush;
return ss.str();
}
bool firstCompare(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
bool secondCompare(const P &firstElof, const P &secondElof) {
return firstElof.second < secondElof.second;
}
//---------------//
int N;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> N;
int A[N + 1], B[N];
REP(i, 0, N + 1) cin >> A[i];
REP(i, 0, N) cin >> B[i];
int ans = 0;
REP(i, 0, N) {
if (A[i] >= B[i]) {
ans += B[i];
} else {
ans += A[i];
if (A[i + 1] < B[i] - A[i]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += (B[i] - A[i]);
A[i + 1] -= (B[i] - A[i]);
}
}
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n, m) for (int i = n; i < m; i++)
#define REPR(i, n, m) for (int i = n; i >= m; i--)
#define LREP(i, n, m) for (ll i = n; i < m; i++)
#define LREPR(i, n, m) for (ll i = n; i >= m; i--)
#define P pair<int, int>
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
//---functions---//
int gcd(int a, int b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
int s2i(string num) {
stringstream ss;
ss << num << flush;
int n;
ss >> n;
return n;
}
string i2s(int n) {
stringstream ss;
ss << n << flush;
return ss.str();
}
bool firstCompare(const P &firstElof, const P &secondElof) {
return firstElof.first < secondElof.first;
}
bool secondCompare(const P &firstElof, const P &secondElof) {
return firstElof.second < secondElof.second;
}
//---------------//
ll N;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> N;
ll A[N + 1], B[N];
LREP(i, 0, N + 1) cin >> A[i];
LREP(i, 0, N) cin >> B[i];
ll ans = 0;
LREP(i, 0, N) {
if (A[i] >= B[i]) {
ans += B[i];
} else {
ans += A[i];
if (A[i + 1] < B[i] - A[i]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += (B[i] - A[i]);
A[i + 1] -= (B[i] - A[i]);
}
}
}
cout << ans << '\n';
}
| [
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 767,342 | 767,343 | u052746401 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 1.0e5 + 100;
int A[MAX_N + 1], B[MAX_N];
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];
A[i] -= B[i];
} else {
int tmp = max(A[i + 1] - B[i] + A[i], 0);
ans += min(B[i], A[i] + A[i + 1]);
A[i] = 0;
A[i + 1] = tmp;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
const int MAX_N = 1.0e5 + 100;
int A[MAX_N + 1], B[MAX_N];
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];
A[i] -= B[i];
} else {
int tmp = max(A[i + 1] - B[i] + A[i], 0);
ans += min(B[i], A[i] + A[i + 1]);
A[i] = 0;
A[i + 1] = tmp;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,344 | 767,345 | u488352661 | cpp |
p02959 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \
P(v[i]);
#define printt(a, b) cout << a << " " << b << endl;
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
vi a(n + 1), b(n + 1);
rep(i, n + 1) {
int nn;
cin >> nn;
a[i] = nn;
}
rep(i, n) {
int nn;
cin >> nn;
b[i + 1] = nn;
}
int count = 0;
for (int i = 1; i <= n; i++) {
count += min(a[i - 1], b[i]);
b[i] -= min(a[i - 1], b[i]);
count += min(a[i], b[i]);
a[i] -= min(a[i], b[i]);
}
cout << count << endl;
}
int main() {
solve();
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n, k) for (int i = n; i < k; i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) \
for (int i = 0; i < v.size(); i++) \
P(v[i]);
#define printt(a, b) cout << a << " " << b << endl;
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int MOD = 1e9 + 7;
void solve() {
ll n;
cin >> n;
vi a(n + 1), b(n + 1);
rep(i, n + 1) {
ll nn;
cin >> nn;
a[i] = nn;
}
rep(i, n) {
ll nn;
cin >> nn;
b[i + 1] = nn;
}
ll count = 0;
for (int i = 1; i <= n; i++) {
count += min(a[i - 1], b[i]);
b[i] -= min(a[i - 1], b[i]);
count += min(a[i], b[i]);
a[i] -= min(a[i], b[i]);
}
cout << count << endl;
}
int main() {
solve();
return 0;
}
| [
"variable_declaration.type.change"
] | 767,346 | 767,347 | u687470137 | 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 += b[i];
} else if (a[i] + a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
} else {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i] + a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
} else {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,350 | 767,351 | u289709148 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define Cerr(x) cerr << (x) << endl
#define fi first
#define se second
#define P pair<ll, ll>
#define m_p make_pair
#define V vector<ll>
#define U_MAP unordered_map<ll, ll>
ll n, cnt, ans, a[ohara], b[ohara], c, d, tmp, tmpp, m, h, w, x, y, sum, pos, k;
ld doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};
// int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge {
int to, cost;
};
//-------------------------↓↓↓↓↓↓------------------------
//------ 自分を天才だと信じる ------
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
ans += tmp;
tmp = min(a[i + 1], b[i]);
a[i] -= tmp;
b[i] -= tmp;
ans += tmp;
}
Cout(ans);
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define Cerr(x) cerr << (x) << endl
#define fi first
#define se second
#define P pair<ll, ll>
#define m_p make_pair
#define V vector<ll>
#define U_MAP unordered_map<ll, ll>
ll n, cnt, ans, a[ohara], b[ohara], c, d, tmp, tmpp, m, h, w, x, y, sum, pos, k;
ld doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};
// int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge {
int to, cost;
};
//-------------------------↓↓↓↓↓↓------------------------
//------ 自分を天才だと信じる ------
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
ans += tmp;
tmp = min(a[i + 1], b[i]);
a[i + 1] -= tmp;
b[i] -= tmp;
ans += tmp;
}
Cout(ans);
return 0;
}
| [
"assignment.change"
] | 767,362 | 767,363 | u876335718 | cpp |
p02959 | #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 ans = 0;
for (int i = 0; i < n; i++) {
long n = min(a[i], b[i]);
a[i] -= n;
b[i] -= n;
ans += n;
n = min(a[i + 1], b[i]);
a[i] -= n;
b[i] -= n;
ans += n;
}
cout << ans << endl;
return 0;
} | #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 ans = 0;
for (int i = 0; i < n; i++) {
long n = min(a[i], b[i]);
a[i] -= n;
b[i] -= n;
ans += n;
n = min(a[i + 1], b[i]);
a[i + 1] -= n;
b[i] -= n;
ans += n;
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 767,364 | 767,365 | u033627628 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mnst(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> mnst.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (mnst.at(i) >= hero.at(i)) {
ans += hero.at(i);
} else {
ans += mnst.at(i);
int amari;
amari = hero.at(i) - mnst.at(i);
if (mnst.at(i + 1) <= amari) {
ans += mnst.at(i + 1);
mnst.at(i + 1) = 0;
} else {
ans += amari;
mnst.at(i + 1) = mnst.at(i + 1) - amari;
}
}
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mnst(n + 1);
vector<int> hero(n);
for (int i = 0; i < n + 1; i++) {
cin >> mnst.at(i);
}
for (int i = 0; i < n; i++) {
cin >> hero.at(i);
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (mnst.at(i) >= hero.at(i)) {
ans += hero.at(i);
} else {
ans += mnst.at(i);
int amari;
amari = hero.at(i) - mnst.at(i);
if (mnst.at(i + 1) <= amari) {
ans += mnst.at(i + 1);
mnst.at(i + 1) = 0;
} else {
ans += amari;
mnst.at(i + 1) = mnst.at(i + 1) - amari;
}
}
// cout << ans << endl;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,366 | 767,367 | u091552241 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define INF 1e9
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> m(n + 1);
vector<int> y(n);
rep(i, n + 1) { cin >> m[i]; }
rep(i, n) { cin >> y[i]; }
int ans = 0;
rep(i, n) {
if (m[i] >= y[i]) {
ans += y[i];
} else {
ans += m[i];
int a = y[i] - m[i];
if (a >= m[i + 1]) {
ans += m[i + 1];
m[i + 1] = 0;
} else {
ans += a;
m[i + 1] = m[i + 1] - a;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define INF 1e9
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> m(n + 1);
vector<ll> y(n);
rep(i, n + 1) { cin >> m[i]; }
rep(i, n) { cin >> y[i]; }
ll ans = 0;
rep(i, n) {
if (m[i] >= y[i]) {
ans += y[i];
} else {
ans += m[i];
ll a = y[i] - m[i];
if (a >= m[i + 1]) {
ans += m[i + 1];
m[i + 1] = 0;
} else {
ans += a;
m[i + 1] = m[i + 1] - a;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,368 | 767,369 | u008582165 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n, a[100001], b[100000], sum = 0;
cin >> 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]) {
sum += b[i];
} else {
sum += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
long long int a[100001], b[100000], sum = 0;
cin >> 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]) {
sum += b[i];
} else {
sum += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 767,370 | 767,371 | u522506260 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (i)++)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> ms(N + 1), hero(N);
rep(i, N + 1) cin >> ms[i];
rep(i, N) cin >> hero[i];
ll res = 0;
rep(i, N) {
int a = min(ms[i], hero[i]);
ms[i] -= a;
hero[i] -= a;
int b = min(ms[i + 1], hero[i]);
ms[i] -= b;
hero[i] -= b;
res += a + b;
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (i)++)
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> ms(N + 1), hero(N);
rep(i, N + 1) cin >> ms[i];
rep(i, N) cin >> hero[i];
ll res = 0;
rep(i, N) {
ll a = min(ms[i], hero[i]);
ms[i] -= a;
hero[i] -= a;
ll b = min(ms[i + 1], hero[i]);
ms[i + 1] -= b;
hero[i] -= b;
res += a + b;
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.change",
"assignment.change"
] | 767,372 | 767,373 | u917282863 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
if (a[i] < b[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
if (a[i] < b[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,374 | 767,375 | u734857533 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
if (a[i] < b[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, (n + 1)) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if ((a[i] + a[i + 1]) < b[i]) {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
if (a[i] < b[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
}
}
}
cout << ans << endl;
return 0;
} | [
"call.arguments.change",
"variable_declaration.type.change"
] | 767,376 | 767,375 | u734857533 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main() {
ll N;
cin >> N;
ll A[MAX], B[MAX];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 1; 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;
system("PAUSE");
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main() {
int N;
cin >> N;
ll A[MAX], B[MAX];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
cin >> B[i];
}
ll ans = 0;
for (int i = 1; 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;
system("PAUSE");
} | [
"variable_declaration.type.change"
] | 767,377 | 767,378 | u004411048 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main() {
int N;
cin >> N;
int A[MAX], B[MAX];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 1; 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;
system("PAUSE");
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 400000;
int main() {
int N;
cin >> N;
ll A[MAX], B[MAX];
for (int i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
cin >> B[i];
}
ll ans = 0;
for (int i = 1; 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;
system("PAUSE");
} | [
"variable_declaration.type.change"
] | 767,379 | 767,378 | u004411048 | cpp |
p02959 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
void func(int &a, int &b, int &ans) {
int big = max(a, b);
int small = min(a, b);
ans += small;
a -= small;
b -= small;
}
int main() {
int N;
int ans = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
func(A.at(i), B.at(i), ans);
func(A.at(i + 1), B.at(i), ans);
}
cout << ans << endl;
return 0;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
void func(int &a, int &b, long int &ans) {
int big = max(a, b);
int small = min(a, b);
ans += small;
a -= small;
b -= small;
}
int main() {
int N;
long int ans = 0;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
func(A.at(i), B.at(i), ans);
func(A.at(i + 1), B.at(i), ans);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,384 | 767,385 | u491330513 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, num, cnt = 0;
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];
for (int i = 0; i < n; i++) {
num = min(a[i], b[i]);
a[i] -= num;
b[i] -= num;
cnt += num;
num = min(a[i + 1], b[i]);
a[i] -= num;
b[i] -= num;
cnt += num;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, num, cnt = 0;
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];
for (int i = 0; i < n; i++) {
num = min(a[i], b[i]);
a[i] -= num;
b[i] -= num;
cnt += num;
num = min(a[i + 1], b[i]);
a[i + 1] -= num;
b[i] -= num;
cnt += num;
}
cout << cnt << endl;
return 0;
}
| [
"assignment.change"
] | 767,391 | 767,392 | u086249395 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main() {
int i, n, m, count = 0;
cin >> n;
vector<int> mon(n + 1), yu(n);
for (i = 0; i < n + 1; i++)
cin >> mon[i];
for (i = 0; i < n; i++)
cin >> yu[i];
for (i = 0; i < n; i++) {
m = min(mon[i], yu[i]);
mon[i] -= m;
yu[i] -= m;
count += m;
m = min(mon[i + 1], yu[i]);
mon[i + 1] -= m;
yu[i] -= m;
count += m;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
main() {
ll i, n, m, count = 0;
cin >> n;
vector<ll> mon(n + 1), yu(n);
for (i = 0; i < n + 1; i++)
cin >> mon[i];
for (i = 0; i < n; i++)
cin >> yu[i];
for (i = 0; i < n; i++) {
m = min(mon[i], yu[i]);
mon[i] -= m;
yu[i] -= m;
count += m;
m = min(mon[i + 1], yu[i]);
mon[i + 1] -= m;
yu[i] -= m;
count += m;
}
cout << count << endl;
}
| [
"variable_declaration.type.change"
] | 767,395 | 767,396 | u703537155 | cpp |
p02959 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define FOR(x, to) for (int x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define long long long
inline int rei() {
int x;
cin >> x;
return x;
}
inline long rel() {
long x;
cin >> x;
return x;
}
inline string res() {
string x;
cin >> x;
return x;
}
//-------------------------------------------------------
long A[100001];
long B[100000];
void Calc() {
int N = rei();
for (int i = 0; i <= N; i++) {
A[i] = rei();
}
for (int i = 0; i < N; i++) {
B[i] = rei();
}
long ans = 0;
for (int i = 0; i < N; i++) {
long v = min(A[i], B[i]);
ans += v;
A[i] -= v;
B[i] -= v;
v = min(A[i + 1], B[i]);
ans += v;
A[i] -= v;
B[i] -= v;
}
cout << ans << endl;
}
int main(int argc, char **argv) {
ios::sync_with_stdio(false), cin.tie(0);
cout.tie(0);
Calc();
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define FOR(x, to) for (int x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define long long long
inline int rei() {
int x;
cin >> x;
return x;
}
inline long rel() {
long x;
cin >> x;
return x;
}
inline string res() {
string x;
cin >> x;
return x;
}
//-------------------------------------------------------
long A[100001];
long B[100000];
void Calc() {
int N = rei();
for (int i = 0; i <= N; i++) {
A[i] = rei();
}
for (int i = 0; i < N; i++) {
B[i] = rei();
}
long ans = 0;
for (int i = 0; i < N; i++) {
long v = min(A[i], B[i]);
ans += v;
A[i] -= v;
B[i] -= v;
v = min(A[i + 1], B[i]);
ans += v;
A[i + 1] -= v;
B[i] -= v;
}
cout << ans << endl;
}
int main(int argc, char **argv) {
ios::sync_with_stdio(false), cin.tie(0);
cout.tie(0);
Calc();
return 0;
} | [
"assignment.change"
] | 767,399 | 767,400 | u387013436 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int N, A[100001], B[100001], i, count = 0;
cin >> N;
for (i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (i = 1; i <= N; i++) {
cin >> B[i];
}
for (i = 1; i <= N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
count += A[i];
} else {
count += B[i];
B[i] -= B[i];
}
if (A[i + 1] < B[i]) {
count += A[i + 1];
A[i + 1] -= A[i + 1];
} else {
count += B[i];
A[i + 1] -= B[i];
}
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long long N, A[100001], B[100001], i, count = 0;
cin >> N;
for (i = 1; i <= N + 1; i++) {
cin >> A[i];
}
for (i = 1; i <= N; i++) {
cin >> B[i];
}
for (i = 1; i <= N; i++) {
if (A[i] < B[i]) {
B[i] -= A[i];
count += A[i];
} else {
count += B[i];
B[i] -= B[i];
}
if (A[i + 1] < B[i]) {
count += A[i + 1];
A[i + 1] -= A[i + 1];
} else {
count += B[i];
A[i + 1] -= B[i];
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,405 | 767,406 | u246639932 | cpp |
p02959 | #include <iostream>
int main() {
int N, A[100001], B[100000], i;
int sum1 = 0;
int sum2 = 0;
scanf("%d", &N);
for (i = 0; i <= N; i++) {
scanf("%d", &A[i]);
sum1 = sum1 + A[i];
}
for (i = 0; i <= N - 1; i++) {
scanf("%d", &B[i]);
if (A[i] < B[i]) {
if (A[i] + A[i + 1] <= B[i]) {
A[i] = 0;
A[i + 1] = 0;
} else {
A[i + 1] = A[i + 1] - (B[i] - A[i]);
A[i] = 0;
}
} else {
A[i] = A[i] - B[i];
}
sum2 = sum2 + A[i];
}
sum2 = sum2 + A[N];
printf("%d", sum1 - sum2);
} | #include <iostream>
int main() {
int N, A[100001], B[100000], i;
long sum1 = 0;
long sum2 = 0;
scanf("%d", &N);
for (i = 0; i <= N; i++) {
scanf("%d", &A[i]);
sum1 = sum1 + A[i];
}
for (i = 0; i <= N - 1; i++) {
scanf("%d", &B[i]);
if (A[i] < B[i]) {
if (A[i] + A[i + 1] <= B[i]) {
A[i] = 0;
A[i + 1] = 0;
} else {
A[i + 1] = A[i + 1] - (B[i] - A[i]);
A[i] = 0;
}
} else {
A[i] = A[i] - B[i];
}
sum2 = sum2 + A[i];
}
sum2 = sum2 + A[N];
printf("%ld", sum1 - sum2);
} | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,407 | 767,408 | u392164874 | cpp |
p02959 | #include <stdio.h>
int main() {
int n, b, ans = 0;
scanf("%d", &n);
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b);
if (a[i] > b) {
ans = ans + b;
} else {
if (a[i + 1] > b - a[i]) {
ans = ans + b;
a[i + 1] = a[i + 1] + a[i] - b;
} else {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
printf("%d", ans);
} | #include <stdio.h>
int main() {
int n, b;
long ans = 0;
scanf("%d", &n);
int a[n + 1];
for (int i = 0; i < n + 1; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b);
if (a[i] > b) {
ans = ans + b;
} else {
if (a[i + 1] > b - a[i]) {
ans = ans + b;
a[i + 1] = a[i + 1] + a[i] - b;
} else {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
printf("%ld", ans);
} | [
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,409 | 767,410 | u451804224 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N = 0, ans = 0;
std::cin >> N;
std::vector<int> A(N + 1);
std::vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
for (int i = 0; i < N; i++) {
int c = std::min(A[i], B[i]);
B[i] -= c;
A[i] -= c;
ans += c;
c = std::min(A[i + 1], B[i]);
B[i] -= c;
A[i + 1] -= c;
ans += c;
}
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
long long N = 0, ans = 0;
std::cin >> N;
std::vector<long long> A(N + 1);
std::vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
for (int i = 0; i < N; i++) {
int c = std::min(A[i], B[i]);
B[i] -= c;
A[i] -= c;
ans += c;
c = std::min(A[i + 1], B[i]);
B[i] -= c;
A[i + 1] -= c;
ans += c;
}
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,411 | 767,412 | u659222664 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, res = 0;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int a, b;
for (int i = 0; i < N; i++) {
a = min(A[i], B[i]);
res += a;
A[i] -= a;
B[i] -= a;
b = min(A[i + 1], B[i]);
res += b;
A[i + 1] -= b;
B[i] -= b;
}
cout << res << '\n';
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, res = 0;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int a, b;
for (int i = 0; i < N; i++) {
a = min(A[i], B[i]);
res += a;
A[i] -= a;
B[i] -= a;
b = min(A[i + 1], B[i]);
res += b;
A[i + 1] -= b;
B[i] -= b;
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.change",
"io.output.change"
] | 767,419 | 767,420 | u337850788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
count += a.at(i);
if (a.at(i + 1) > (b.at(i) - a.at(i))) {
count += (b.at(i) - a.at(i));
a.at(i + 1) -= (b.at(i) - a.at(i));
} else if (a.at(i + 1) <= (b.at(i) - a.at(i))) {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
else if (b.at(i) <= a.at(i)) {
count += b.at(i);
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long count = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) >= a.at(i)) {
count += a.at(i);
if (a.at(i + 1) >= (b.at(i) - a.at(i))) {
count += (b.at(i) - a.at(i));
a.at(i + 1) -= (b.at(i) - a.at(i));
} else if (a.at(i + 1) < (b.at(i) - a.at(i))) {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
else if (b.at(i) < a.at(i)) {
count += b.at(i);
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,421 | 767,422 | u955282280 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) >= a.at(i)) {
count += a.at(i);
if (a.at(i + 1) >= (b.at(i) - a.at(i))) {
count += (b.at(i) - a.at(i));
a.at(i + 1) -= (b.at(i) - a.at(i));
} else if (a.at(i + 1) < (b.at(i) - a.at(i))) {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
else if (b.at(i) < a.at(i)) {
count += b.at(i);
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long count = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) >= a.at(i)) {
count += a.at(i);
if (a.at(i + 1) >= (b.at(i) - a.at(i))) {
count += (b.at(i) - a.at(i));
a.at(i + 1) -= (b.at(i) - a.at(i));
} else if (a.at(i + 1) < (b.at(i) - a.at(i))) {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
else if (b.at(i) < a.at(i)) {
count += b.at(i);
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,424 | 767,422 | u955282280 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.