problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
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,424 | 767,425 | u955282280 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (mati.at(i) <= yusya.at(i)) {
yusya.at(i) -= mati.at(i);
count += mati.at(i);
if (mati.at(i + 1) <= yusya.at(i)) {
count += mati.at(i + 1);
mati.at(i + 1) = 0;
} else {
count += yusya.at(i);
mati.at(i + 1) -= yusya.at(i);
}
} else {
count += yusya.at(i);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (mati.at(i) <= yusya.at(i)) {
yusya.at(i) -= mati.at(i);
count += mati.at(i);
if (mati.at(i + 1) <= yusya.at(i)) {
count += mati.at(i + 1);
mati.at(i + 1) = 0;
} else {
count += yusya.at(i);
mati.at(i + 1) -= yusya.at(i);
}
} else {
count += yusya.at(i);
}
}
cout << count << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,426 | 767,427 | u442754977 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
int count = 0;
for (int i = 0; i < n; i++) {
if (mati.at(i) < yusya.at(i)) {
yusya.at(i) -= mati.at(i);
count += mati.at(i);
if (mati.at(i + 1) <= yusya.at(i)) {
count += mati.at(i + 1);
mati.at(i + 1) = 0;
} else {
count += yusya.at(i);
mati.at(i + 1) -= yusya.at(i);
}
} else {
count += yusya.at(i);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> mati(n + 1);
vector<int> yusya(n);
for (int i = 0; i < n + 1; i++) {
cin >> mati.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yusya.at(i);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (mati.at(i) <= yusya.at(i)) {
yusya.at(i) -= mati.at(i);
count += mati.at(i);
if (mati.at(i + 1) <= yusya.at(i)) {
count += mati.at(i + 1);
mati.at(i + 1) = 0;
} else {
count += yusya.at(i);
mati.at(i + 1) -= yusya.at(i);
}
} else {
count += yusya.at(i);
}
}
cout << count << endl;
} | [
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,428 | 767,427 | u442754977 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
// debug func
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template <typename T> void vecvecprint(vector<vector<T>> v) {
for (auto x : v) {
REP(i, x.size() - 1) { cerr << x[i] << " "; }
cerr << x[x.size() - 1] << endl;
}
}
template <typename T> void pqprint(priority_queue<T> q) {
while (!q.empty()) {
cerr << q.top() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void qprint(queue<T> q) {
while (!q.empty()) {
cerr << q.front() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void vecqprint(vector<queue<T>> v) {
for (int i = 0; i < v.size(); i++) {
qprint(v[i]);
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
/* Credits: Thomas Draper */
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1) {
if (*--itr1 < *itr2) {
Iterator j = k;
while (!(*itr1 < *j))
++j;
iter_swap(itr1, j);
++itr1;
++j;
itr2 = k;
rotate(itr1, j, last);
while (last != j) {
++j;
++itr2;
}
rotate(k, itr2, last);
return true;
}
}
rotate(first, k, last);
return false;
}
inline double get_time_sec(void) {
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count()) /
1000000000;
}
int n;
VLL va, vb;
int main(void) {
cin >> n;
va = VLL(n + 1, 0);
vb = VLL(n, 0);
REP(i, n + 1) cin >> va[i];
REP(i, n) cin >> vb[i];
int res = 0;
REP(i, n) {
LL damage = min(va[i], vb[i]);
res += damage;
vb[i] -= damage;
if (vb[i] > 0) {
damage = min(va[i + 1], vb[i]);
res += damage;
va[i + 1] -= damage;
}
}
cout << res << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
// debug func
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template <typename T> void vecvecprint(vector<vector<T>> v) {
for (auto x : v) {
REP(i, x.size() - 1) { cerr << x[i] << " "; }
cerr << x[x.size() - 1] << endl;
}
}
template <typename T> void pqprint(priority_queue<T> q) {
while (!q.empty()) {
cerr << q.top() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void qprint(queue<T> q) {
while (!q.empty()) {
cerr << q.front() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void vecqprint(vector<queue<T>> v) {
for (int i = 0; i < v.size(); i++) {
qprint(v[i]);
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
/* Credits: Thomas Draper */
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1) {
if (*--itr1 < *itr2) {
Iterator j = k;
while (!(*itr1 < *j))
++j;
iter_swap(itr1, j);
++itr1;
++j;
itr2 = k;
rotate(itr1, j, last);
while (last != j) {
++j;
++itr2;
}
rotate(k, itr2, last);
return true;
}
}
rotate(first, k, last);
return false;
}
inline double get_time_sec(void) {
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count()) /
1000000000;
}
int n;
VLL va, vb;
int main(void) {
cin >> n;
va = VLL(n + 1, 0);
vb = VLL(n, 0);
REP(i, n + 1) cin >> va[i];
REP(i, n) cin >> vb[i];
LL res = 0;
REP(i, n) {
LL damage = min(va[i], vb[i]);
res += damage;
vb[i] -= damage;
if (vb[i] > 0) {
damage = min(va[i + 1], vb[i]);
res += damage;
va[i + 1] -= damage;
}
}
cout << res << endl;
} | [
"variable_declaration.type.change"
] | 767,429 | 767,430 | u637983859 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
// debug func
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template <typename T> void vecvecprint(vector<vector<T>> v) {
for (auto x : v) {
REP(i, x.size() - 1) { cerr << x[i] << " "; }
cerr << x[x.size() - 1] << endl;
}
}
template <typename T> void pqprint(priority_queue<T> q) {
while (!q.empty()) {
cerr << q.top() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void qprint(queue<T> q) {
while (!q.empty()) {
cerr << q.front() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void vecqprint(vector<queue<T>> v) {
for (int i = 0; i < v.size(); i++) {
qprint(v[i]);
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
/* Credits: Thomas Draper */
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1) {
if (*--itr1 < *itr2) {
Iterator j = k;
while (!(*itr1 < *j))
++j;
iter_swap(itr1, j);
++itr1;
++j;
itr2 = k;
rotate(itr1, j, last);
while (last != j) {
++j;
++itr2;
}
rotate(k, itr2, last);
return true;
}
}
rotate(first, k, last);
return false;
}
inline double get_time_sec(void) {
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count()) /
1000000000;
}
int n;
VI va, vb;
int main(void) {
cin >> n;
va = VI(n + 1, 0);
vb = VI(n, 0);
REP(i, n + 1) cin >> va[i];
REP(i, n) cin >> vb[i];
int res = 0;
REP(i, n) {
int damage = min(va[i], vb[i]);
res += damage;
vb[i] -= damage;
if (vb[i] > 0) {
damage = min(va[i + 1], vb[i]);
res += damage;
va[i + 1] -= damage;
}
}
cout << res << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INT_LARGE = 1000000100;
// debug func
template <typename T> void vecprint(vector<T> v) {
for (auto x : v) {
cerr << x << " ";
}
cerr << endl;
}
template <typename T> void vecvecprint(vector<vector<T>> v) {
for (auto x : v) {
REP(i, x.size() - 1) { cerr << x[i] << " "; }
cerr << x[x.size() - 1] << endl;
}
}
template <typename T> void pqprint(priority_queue<T> q) {
while (!q.empty()) {
cerr << q.top() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void qprint(queue<T> q) {
while (!q.empty()) {
cerr << q.front() << " ";
q.pop();
}
cerr << endl;
}
template <typename T> void vecqprint(vector<queue<T>> v) {
for (int i = 0; i < v.size(); i++) {
qprint(v[i]);
}
}
template <typename Iterator>
inline bool next_combination(const Iterator first, Iterator k,
const Iterator last) {
/* Credits: Thomas Draper */
if ((first == last) || (first == k) || (last == k))
return false;
Iterator itr1 = first;
Iterator itr2 = last;
++itr1;
if (last == itr1)
return false;
itr1 = last;
--itr1;
itr1 = k;
--itr2;
while (first != itr1) {
if (*--itr1 < *itr2) {
Iterator j = k;
while (!(*itr1 < *j))
++j;
iter_swap(itr1, j);
++itr1;
++j;
itr2 = k;
rotate(itr1, j, last);
while (last != j) {
++j;
++itr2;
}
rotate(k, itr2, last);
return true;
}
}
rotate(first, k, last);
return false;
}
inline double get_time_sec(void) {
return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(
chrono::steady_clock::now().time_since_epoch())
.count()) /
1000000000;
}
int n;
VLL va, vb;
int main(void) {
cin >> n;
va = VLL(n + 1, 0);
vb = VLL(n, 0);
REP(i, n + 1) cin >> va[i];
REP(i, n) cin >> vb[i];
LL res = 0;
REP(i, n) {
LL damage = min(va[i], vb[i]);
res += damage;
vb[i] -= damage;
if (vb[i] > 0) {
damage = min(va[i + 1], vb[i]);
res += damage;
va[i + 1] -= damage;
}
}
cout << res << endl;
} | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 767,431 | 767,430 | u637983859 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, yuusya;
cin >> n;
k = 0;
vector<int> vec(n + 1);
vector<int> yuu(n);
for (int i = 0; i < n + 1; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < n; i++) {
cin >> yuu.at(i);
}
for (int i = 0; i < n; i++) {
if (yuu.at(i) < vec.at(i)) {
k = k + yuu.at(i);
} else if (yuu.at(i) < vec.at(i) + vec.at(i + 1)) {
k = k + yuu.at(i);
vec.at(i + 1) = vec.at(i + 1) + vec.at(i) - yuu.at(i);
} else {
k = k + vec.at(i + 1) + vec.at(i);
vec.at(i + 1) = 0;
}
}
cout << k;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, k, yuusya;
cin >> n;
k = 0;
vector<long> vec(n + 1);
vector<long> yuu(n);
for (long i = 0; i < n + 1; i++) {
cin >> vec.at(i);
}
for (long i = 0; i < n; i++) {
cin >> yuu.at(i);
}
for (long i = 0; i < n; i++) {
if (yuu.at(i) < vec.at(i)) {
k = k + yuu.at(i);
} else if (yuu.at(i) < vec.at(i) + vec.at(i + 1)) {
k = k + yuu.at(i);
vec.at(i + 1) = vec.at(i + 1) + vec.at(i) - yuu.at(i);
} else {
k = k + vec.at(i + 1) + vec.at(i);
vec.at(i + 1) = 0;
}
}
cout << k;
} | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 767,432 | 767,433 | u325573017 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vi 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++) {
int t = min(a[i], b[i]);
sum += t;
b[i] -= t;
int next = min(a[i + 1], b[i]);
sum += next;
a[i + 1] -= next;
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main() {
int n;
cin >> n;
vi 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 sum = 0;
for (int i = 0; i < n; i++) {
int t = min(a[i], b[i]);
sum += t;
b[i] -= t;
int next = min(a[i + 1], b[i]);
sum += next;
a[i + 1] -= next;
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,434 | 767,435 | u876386943 | cpp |
p02959 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
// typedef pair<int, int> P;
const int INF = 111111111;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const int DIV = 1000000007; // 10^9 + 7
const double PI = 3.14159265358979323846264338327950288;
int main() {
//==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
//==================================
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
// 倒せるだけ倒す
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
ans += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B[i];
A[i + 1] -= B[i];
}
} else {
ans += B[i];
A[i] -= B[i];
}
}
cout << ans;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
// typedef pair<int, int> P;
const int INF = 111111111;
const ll LLINF = 1e17 + 1;
const int DX[9] = {0, 0, 1, -1, 1, 1, -1, -1, 0}; // 4;４近傍
const int DY[9] = {1, -1, 0, 0, 1, -1, 1, -1, 0}; // 8:８近傍 9:(0,0)を含む
const int DIV = 1000000007; // 10^9 + 7
const double PI = 3.14159265358979323846264338327950288;
int main() {
//==================================
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
//==================================
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
ll ans = 0;
// 倒せるだけ倒す
for (int i = 0; i < N; i++) {
if (A[i] < B[i]) {
ans += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] <= B[i]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B[i];
A[i + 1] -= B[i];
}
} else {
ans += B[i];
A[i] -= B[i];
}
}
cout << ans;
}
| [
"variable_declaration.type.change"
] | 767,436 | 767,437 | u433195318 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
long long a[100001], b[100010], c, d = 0, e = 0;
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
if (a[i] < b[i]) {
d += a[i];
b[i] -= a[i];
} else {
e += b[i];
b[i] = 0;
}
if (a[i + 1] < b[i]) {
d += a[i + 1];
a[i] = 0;
} else {
e += b[i];
a[i + 1] -= b[i];
}
}
cout << d + e << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
long long a[100001], b[100010], c, d = 0, e = 0;
int main() {
int n;
cin >> n;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i <= n; i++) {
if (a[i] < b[i]) {
d += a[i];
b[i] -= a[i];
} else {
e += b[i];
b[i] = 0;
}
if (a[i + 1] < b[i]) {
d += a[i + 1];
a[i + 1] = 0;
} else {
e += b[i];
a[i + 1] -= b[i];
}
}
cout << d + e << endl;
return 0;
} | [
"assignment.change"
] | 767,438 | 767,439 | u225094817 | cpp |
p02959 | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100000], c[10000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (f = 0; f < a; f++) {
scanf("%lld", &c[i]);
f += c[i];
}
for (i = 0; i < a; i++) {
if (c[i] <= b[i]) {
cnt += c[i];
c[i] = 0;
} else {
cnt += b[i];
c[i] -= b[i];
}
if (c[i] <= b[i + 1]) {
cnt += c[i];
b[i + 1] -= c[i];
} else {
cnt += b[i + 1];
b[i + 1] = 0;
}
}
printf("%lld\n", cnt);
return 0;
}
| #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100001], c[100000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld", &c[i]);
f += c[i];
}
for (i = 0; i < a; i++) {
if (c[i] <= b[i]) {
cnt += c[i];
c[i] = 0;
} else {
cnt += b[i];
c[i] -= b[i];
}
if (c[i] <= b[i + 1]) {
cnt += c[i];
b[i + 1] -= c[i];
} else {
cnt += b[i + 1];
b[i + 1] = 0;
}
}
printf("%lld\n", cnt);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 767,445 | 767,444 | u373916583 | cpp |
p02959 | #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[2000], c[2000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld", &c[i]);
f += c[i];
}
for (i = 0; i < a; i++) {
if (c[i] <= b[i]) {
cnt += c[i];
c[i] = 0;
} else {
cnt += b[i];
c[i] -= b[i];
}
if (c[i] <= b[i + 1]) {
cnt += c[i];
b[i + 1] -= c[i];
} else {
cnt += b[i + 1];
b[i + 1] = 0;
}
}
printf("%lld\n", cnt);
return 0;
}
| #include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdlib.h>
#include <time.h>
int main() {
long long a, b[100001], c[100000], d, e, f = 0, g = 0, i, cnt = 0;
scanf("%lld", &a);
for (i = 0; i < a + 1; i++) {
scanf("%lld", &b[i]);
g += b[i];
}
for (i = 0; i < a; i++) {
scanf("%lld", &c[i]);
f += c[i];
}
for (i = 0; i < a; i++) {
if (c[i] <= b[i]) {
cnt += c[i];
c[i] = 0;
} else {
cnt += b[i];
c[i] -= b[i];
}
if (c[i] <= b[i + 1]) {
cnt += c[i];
b[i + 1] -= c[i];
} else {
cnt += b[i + 1];
b[i + 1] = 0;
}
}
printf("%lld\n", cnt);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,447 | 767,444 | u373916583 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int n;
int a[N], b[N];
int main() {
IOS
// freopen("input.txt", "r", stdin);
cin >>
n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
b[i] -= left;
int right = min(b[i], a[i + 1]);
a[i + 1] -= right;
ans += left + right;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define what_is(x) cerr << #x << " is " << x << endl;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int n;
int a[N], b[N];
int main() {
IOS
// freopen("input.txt", "r", stdin);
cin >>
n;
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
b[i] -= left;
int right = min(b[i], a[i + 1]);
a[i + 1] -= right;
ans += left + right;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,450 | 767,451 | u411771230 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
int n, a[100001], b;
int i, c, f, sum = 0;
cin >> n;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b;
c = a[i] + a[i + 1];
f = c - b;
if (f <= 0) {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] >= b) {
sum += b;
} else {
sum += b;
a[i + 1] = f;
}
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
int main(void) {
long long int n, a[200000], b;
long long int i, c, f, sum = 0;
cin >> n;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b;
c = a[i] + a[i + 1];
f = c - b;
if (f <= 0) {
sum += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] >= b) {
sum += b;
} else {
sum += b;
a[i + 1] = f;
}
}
cout << sum << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 767,459 | 767,458 | u660656075 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, start, end) for (i64 i = start; i < end; i++)
#define newline std::cout << '\n';
#define newlinedx(num) \
for (int i = 0; i < num; i++) \
std::cout << '\n';
using namespace std;
typedef long long ll;
typedef unsigned long ul;
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
using ui = uint64_t;
//----------------library in this time--------------------------------
template <class T> T gcd(const T a, const T b) {
return (b == 0) ? a : gcd(b, a % b);
}
template <class T> T lcm(const T a, const T b) { return a * b / gcd(a, b); }
template <class T> inline T ave(const T a, const T b) { return (a + b) / 2.0f; }
long long squareTwo(const long long a, const long long b) {
return (b == 1) ? a : squareTwo(a * 2, b - 1);
}
template <class T> inline T Max(const T a, const T b) {
return (a >= b) ? a : b;
}
template <class T> inline T Min(const T a, const T b) {
return (a <= b) ? a : b;
}
//------------------------main function-------------------------------
// sum of 5n+2 5n+4 (1 <= n <= 19)
//
void Main() {
int n, ans = 0;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = n - 1; i >= 0; i--) {
int temp = min(a[i + 1], b[i]);
ans += temp;
a[i + 1] -= temp;
b[i] -= temp;
int temp2 = min(a[i], b[i]);
ans += temp2;
a[i] -= temp2;
b[i] -= temp2;
}
cout << ans << endl;
}
//--------------------------------------------------------------------
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
Main();
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, start, end) for (i64 i = start; i < end; i++)
#define newline std::cout << '\n';
#define newlinedx(num) \
for (int i = 0; i < num; i++) \
std::cout << '\n';
using namespace std;
typedef long long ll;
typedef unsigned long ul;
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
using ui = uint64_t;
//----------------library in this time--------------------------------
template <class T> T gcd(const T a, const T b) {
return (b == 0) ? a : gcd(b, a % b);
}
template <class T> T lcm(const T a, const T b) { return a * b / gcd(a, b); }
template <class T> inline T ave(const T a, const T b) { return (a + b) / 2.0f; }
long long squareTwo(const long long a, const long long b) {
return (b == 1) ? a : squareTwo(a * 2, b - 1);
}
template <class T> inline T Max(const T a, const T b) {
return (a >= b) ? a : b;
}
template <class T> inline T Min(const T a, const T b) {
return (a <= b) ? a : b;
}
//------------------------main function-------------------------------
// sum of 5n+2 5n+4 (1 <= n <= 19)
//
void Main() {
ll n, ans = 0;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (ll i = n - 1; i >= 0; i--) {
ll temp = min(a[i + 1], b[i]);
ans += temp;
a[i + 1] -= temp;
b[i] -= temp;
ll temp2 = min(a[i], b[i]);
ans += temp2;
a[i] -= temp2;
b[i] -= temp2;
}
cout << ans << endl;
}
//--------------------------------------------------------------------
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
Main();
return 0;
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 767,462 | 767,463 | u127063317 | cpp |
p02959 | #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
#define EPS 1e-9
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const int MINF = -1e9;
;
int main() {
int n;
vector<int> a;
vector<int> b;
cin >> n;
a.resize(n + 1);
b.resize(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int sum = 0;
for (int i = 0; i < n; ++i) {
sum += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << sum << endl;
return 0;
}
| #define _USE_NATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
#define EPS 1e-9
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const int MINF = -1e9;
;
int main() {
int n;
vector<ll> a;
vector<ll> b;
cin >> n;
a.resize(n + 1);
b.resize(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll sum = 0;
for (int i = 0; i < n; ++i) {
sum += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,464 | 767,465 | u419390395 | cpp |
p02959 | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define MODA 1000000007
int main() {
int ans = 0;
int n, a[100001] = {}, b;
cin >> n;
REP(i, n + 1) cin >> a[i];
REP(i, n) {
cin >> b;
REP(j, 2) {
int kill = min(a[i + j], b);
a[i + j] -= kill;
b -= kill;
ans += kill;
}
}
cout << ans << endl;
} | //自称高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define MODA 1000000007
int main() {
ll ans = 0;
ll n, a[100001] = {}, b;
cin >> n;
REP(i, n + 1) cin >> a[i];
REP(i, n) {
cin >> b;
REP(j, 2) {
int kill = min(a[i + j], b);
a[i + j] -= kill;
b -= kill;
ans += kill;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 767,468 | 767,469 | u450007962 | cpp |
p02959 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n + 1) cin >> a[i];
int b[n];
rep(i, n) cin >> b[i];
int ans = 0;
int kill;
for (int i = 0; i < n; i++) {
kill = min(a[i], b[i]);
b[i] -= kill;
ans += kill;
if (b[i] > 0) {
kill = min(a[i + 1], b[i]);
a[i + 1] -= kill;
ans += kill;
}
}
cout << ans << endl;
} | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
rep(i, n + 1) cin >> a[i];
int b[n];
rep(i, n) cin >> b[i];
long long ans = 0;
int kill;
for (int i = 0; i < n; i++) {
kill = min(a[i], b[i]);
b[i] -= kill;
ans += kill;
if (b[i] > 0) {
kill = min(a[i + 1], b[i]);
a[i + 1] -= kill;
ans += kill;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,470 | 767,471 | u288147331 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
A[i] -= B[i];
ans += B[i];
}
else {
ans += min(B[i], A[i] + A[i + 1]);
A[i + 1] -= min(B[i] - A[i], A[i + 1]);
A[i] = 0;
}
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
A[i] -= B[i];
ans += B[i];
}
else {
ans += min(B[i], A[i] + A[i + 1]);
A[i + 1] -= min(B[i] - A[i], A[i + 1]);
A[i] = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,472 | 767,473 | u267265758 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int cnt = 0;
rep(i, N) {
cnt += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
if (B[i] > 0) {
cnt += min(B[i], A[i + 1]);
A[i + 1] -= min(B[i], A[i + 1]);
}
}
cout << cnt << endl;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
int N;
cin >> N;
ll 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]);
B[i] -= min(A[i], B[i]);
if (B[i] > 0) {
cnt += min(B[i], A[i + 1]);
A[i + 1] -= min(B[i], A[i + 1]);
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.change"
] | 767,474 | 767,475 | u841131859 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
//#include <bits/stdc++.h>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, i0, n) for (int(i) = (i0); (i) < (n); (i)++)
#define FORR(i, i0, n) for (int(i) = (n)-1; (i) >= (i0); (i)--)
#define SORT(x) sort(x.begin(), x.end())
#define rn return
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
typedef std::pair<int, int> P;
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
int 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] = 0;
} else {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
}
}
cout << ans;
rn 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
//#include <bits/stdc++.h>
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, i0, n) for (int(i) = (i0); (i) < (n); (i)++)
#define FORR(i, i0, n) for (int(i) = (n)-1; (i) >= (i0); (i)--)
#define SORT(x) sort(x.begin(), x.end())
#define rn return
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
typedef std::pair<int, int> P;
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
ll ans = 0;
rep(i, N) {
if (B[i] > A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] <= A[i]) {
ans += B[i];
A[i] = 0;
} else {
ans += B[i];
A[i + 1] -= (B[i] - A[i]);
}
}
cout << ans;
rn 0;
} | [
"variable_declaration.type.change"
] | 767,476 | 767,477 | u358748139 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a.at(i);
}
for (int i = 0; i < n; ++i) {
cin >> b.at(i);
}
int ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (b.at(i) >= a.at(i + 1)) {
b.at(i) -= a.at(i + 1);
ans += a.at(i + 1);
a.at(i + 1) = 0;
if (b.at(i) >= a.at(i)) {
b.at(i) -= a.at(i);
ans += a.at(i);
a.at(i) = 0;
} else {
a.at(i) -= b.at(i);
ans += b.at(i);
}
} else {
a.at(i + 1) -= b.at(i);
ans += b.at(i);
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i <= n; ++i) {
cin >> a.at(i);
}
for (int i = 0; i < n; ++i) {
cin >> b.at(i);
}
long ans = 0;
for (int i = n - 1; i >= 0; --i) {
if (b.at(i) >= a.at(i + 1)) {
b.at(i) -= a.at(i + 1);
ans += a.at(i + 1);
a.at(i + 1) = 0;
if (b.at(i) >= a.at(i)) {
b.at(i) -= a.at(i);
ans += a.at(i);
a.at(i) = 0;
} else {
a.at(i) -= b.at(i);
ans += b.at(i);
}
} else {
a.at(i + 1) -= b.at(i);
ans += b.at(i);
}
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 767,478 | 767,479 | u473403559 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
//#define int long long
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
vector<int> B(N, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int num = 0;
for (int i = 0; i < N; i++) {
int num_i = min(A[i], B[i]);
num += num_i;
B[i] -= num_i;
int num_i1 = min(A[i + 1], B[i]);
num += num_i1;
A[i + 1] -= num_i1;
}
cout << num << endl;
}
int32_t main() {
Main();
return 0;
}
/*
void sample()
{
vector<int> v;
sort(v.begin(), v.end());
sort(v.begin(), v.end(), greater<int>());
}
*/
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
using namespace std;
void Main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
vector<int> B(N, 0);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int num = 0;
for (int i = 0; i < N; i++) {
int num_i = min(A[i], B[i]);
num += num_i;
B[i] -= num_i;
int num_i1 = min(A[i + 1], B[i]);
num += num_i1;
A[i + 1] -= num_i1;
}
cout << num << endl;
}
int32_t main() {
Main();
return 0;
}
/*
void sample()
{
vector<int> v;
sort(v.begin(), v.end());
sort(v.begin(), v.end(), greater<int>());
}
*/
| [] | 767,480 | 767,481 | u790502959 | cpp |
p02959 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i]) {
// printf("case1\n");
A[i] = A[i] - B[i];
counter += B[i];
B[i] = 0;
} else {
// printf("case2\n");
B[i] = B[i] - A[i];
counter += A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
A[i + 1] = A[i + 1] - B[i];
counter += B[i];
B[i] = 0;
} else {
B[i] = B[i] - A[i + 1];
counter += A[i + 1];
A[i + 1] = 0;
}
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}
printf("counter=%d\n",counter);
*/
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}*/
printf("%d\n", counter);
return 0;
}
| #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i]) {
// printf("case1\n");
A[i] = A[i] - B[i];
counter += B[i];
B[i] = 0;
} else {
// printf("case2\n");
B[i] = B[i] - A[i];
counter += A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
A[i + 1] = A[i + 1] - B[i];
counter += B[i];
B[i] = 0;
} else {
B[i] = B[i] - A[i + 1];
counter += A[i + 1];
A[i + 1] = 0;
}
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}
printf("counter=%d\n",counter);
*/
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}*/
printf("%ld\n", counter);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,488 | 767,489 | u339419997 | cpp |
p02959 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
int counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i]) {
// printf("case1\n");
A[i] = A[i] - B[i];
counter += B[i];
B[i] = 0;
} else {
// printf("case2\n");
B[i] = B[i] - A[i];
counter += A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
A[i + 1] = A[i + 1] - B[i];
counter += B[i];
B[i] = 0;
} else {
B[i] = B[i] - A[i + 1];
counter += A[i + 1];
A[i + 1] = 0;
}
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}
printf("counter=%d\n",counter);
*/
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}*/
printf("%d\n", counter);
return 0;
}
| #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i]) {
// printf("case1\n");
A[i] = A[i] - B[i];
counter += B[i];
B[i] = 0;
} else {
// printf("case2\n");
B[i] = B[i] - A[i];
counter += A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
A[i + 1] = A[i + 1] - B[i];
counter += B[i];
B[i] = 0;
} else {
B[i] = B[i] - A[i + 1];
counter += A[i + 1];
A[i + 1] = 0;
}
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}
printf("counter=%d\n",counter);
*/
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}*/
printf("%ld\n", counter);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,490 | 767,489 | u339419997 | cpp |
p02959 | #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
int counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i]) {
// printf("case1\n");
A[i] = A[i] - B[i];
counter += B[i];
B[i] = 0;
} else {
// printf("case2\n");
B[i] = B[i] - A[i];
counter += A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
A[i + 1] = A[i + 1] - B[i];
counter += B[i];
B[i] = 0;
} else {
B[i] = B[i] - A[i + 1];
counter += A[i + 1];
A[i + 1] = 0;
}
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}
printf("counter=%d\n",counter);
*/
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}*/
printf("counter=%d\n", counter);
return 0;
}
| #include "stdio.h"
#include <stdlib.h>
int main() {
int N;
int a, b, c;
scanf("%d", &N);
int A[N + 2];
int B[N + 1];
long counter = 0;
for (int i = 1; i <= N + 1; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= N; i++) {
scanf("%d", &B[i]);
}
for (int i = 1; i <= N; i++) {
if (A[i] >= B[i]) {
// printf("case1\n");
A[i] = A[i] - B[i];
counter += B[i];
B[i] = 0;
} else {
// printf("case2\n");
B[i] = B[i] - A[i];
counter += A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
A[i + 1] = A[i + 1] - B[i];
counter += B[i];
B[i] = 0;
} else {
B[i] = B[i] - A[i + 1];
counter += A[i + 1];
A[i + 1] = 0;
}
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}
printf("counter=%d\n",counter);
*/
}
/* for (int i=1; i<=N+1; i++){
printf("A[%d]=%d\n",i,A[i]);
}
for (int i=1; i<=N; i++){
printf("B[%d]=%d\n",i,B[i]);
}*/
printf("%ld\n", counter);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,491 | 767,489 | u339419997 | cpp |
p02959 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
int cnt = 0;
forn(i, N - 1) {
if (B[i] <= A[i]) {
cnt += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
cnt += B[i];
A[i + 1] = A[i] + A[i + 1] - B[i];
} else {
cnt += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
ll cnt = 0;
forn(i, N) {
if (B[i] <= A[i]) {
cnt += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
cnt += B[i];
A[i + 1] = A[i] + A[i + 1] - B[i];
} else {
cnt += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 767,496 | 767,497 | u934402094 | cpp |
p02959 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
int cnt = 0;
forn(i, N) {
if (B[i] <= A[i]) {
cnt += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
cnt += B[i];
A[i + 1] = A[i] + A[i + 1] - B[i];
} else {
cnt += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
forn(i, N + 1) cin >> A[i];
forn(i, N) cin >> B[i];
ll cnt = 0;
forn(i, N) {
if (B[i] <= A[i]) {
cnt += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
cnt += B[i];
A[i + 1] = A[i] + A[i + 1] - B[i];
} else {
cnt += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.change"
] | 767,498 | 767,497 | u934402094 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N], i, f, s;
for (i = 0; i < N + 1; i++)
cin >> A[i];
for (i = 0; i < N; i++)
cin >> B[i];
s = 0;
for (i = 0; i < N; i++) {
if (B[i] > A[i]) {
s = s + A[i];
f = B[i] - A[i];
if (f >= A[i + 1]) {
s = s + A[i + 1];
A[i + 1] = 0;
} else {
s = s + f;
A[i + 1] = A[i + 1] - f;
}
} else {
s = s + B[i];
}
}
cout << s;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long A[N + 1], B[N], i, f, s;
for (i = 0; i < N + 1; i++)
cin >> A[i];
for (i = 0; i < N; i++)
cin >> B[i];
s = 0;
for (i = 0; i < N; i++) {
if (B[i] > A[i]) {
s = s + A[i];
f = B[i] - A[i];
if (f >= A[i + 1]) {
s = s + A[i + 1];
A[i + 1] = 0;
} else {
s = s + f;
A[i + 1] = A[i + 1] - f;
}
} else {
s = s + B[i];
}
}
cout << s;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,501 | 767,502 | u834488582 | cpp |
p02959 | #include <iostream>
using namespace std;
long long a[100005];
long long b[100005];
int main() {
int sum = 0;
int remain;
int N;
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
sum += b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] = b[i] - a[i];
}
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];
a[i + 1] = 0;
}
}
cout << sum;
} | #include <iostream>
using namespace std;
long long a[100005];
long long b[100005];
int main() {
long long sum = 0;
long long remain;
int N;
cin >> N;
for (int i = 0; i < N + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
cin >> b[i];
}
for (int i = 0; i < N; i++) {
if (b[i] <= a[i]) {
sum += b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] = b[i] - a[i];
}
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];
a[i + 1] = 0;
}
}
cout << sum;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,505 | 767,506 | u834488582 | cpp |
p02959 | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, 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 monster = A.at(0), slay = 0, reserve = 0;
for (int i = 0; i < N; i++) {
if (monster >= B.at(i)) {
slay += B.at(i);
reserve = 0;
} else {
slay += monster;
reserve = B.at(i) - monster;
}
if (A.at(i + 1) > reserve) {
slay += reserve;
monster = A.at(i + 1) - reserve;
} else {
slay += A.at(i + 1);
monster = 0;
}
}
cout << slay << endl;
return 0;
} | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
ll 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 monster = A.at(0), slay = 0, reserve = 0;
for (int i = 0; i < N; i++) {
if (monster >= B.at(i)) {
slay += B.at(i);
reserve = 0;
} else {
slay += monster;
reserve = B.at(i) - monster;
}
if (A.at(i + 1) > reserve) {
slay += reserve;
monster = A.at(i + 1) - reserve;
} else {
slay += A.at(i + 1);
monster = 0;
}
}
cout << slay << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,511 | 767,512 | u982721693 | cpp |
p02959 | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
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 monster = A.at(0), slay = 0, reserve = 0;
for (int i = 0; i < N; i++) {
if (monster >= B.at(i)) {
slay += B.at(i);
reserve = 0;
} else {
slay += monster;
reserve = B.at(i) - monster;
}
if (A.at(i + 1) > reserve) {
slay += reserve;
monster = A.at(i + 1) - reserve;
} else {
slay += A.at(i + 1);
monster = 0;
}
}
cout << slay << endl;
return 0;
} | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
ll 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 monster = A.at(0), slay = 0, reserve = 0;
for (int i = 0; i < N; i++) {
if (monster >= B.at(i)) {
slay += B.at(i);
reserve = 0;
} else {
slay += monster;
reserve = B.at(i) - monster;
}
if (A.at(i + 1) > reserve) {
slay += reserve;
monster = A.at(i + 1) - reserve;
} else {
slay += A.at(i + 1);
monster = 0;
}
}
cout << slay << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,513 | 767,512 | u982721693 | cpp |
p02959 | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
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 monster = A.at(0), slay = 0, reserve = 0;
for (int i = 0; i < N; i++) {
if (monster >= B.at(i)) {
slay += B.at(i);
reserve = 0;
} else {
slay += monster;
reserve = B.at(i) - monster;
}
if (A.at(i + 1) > reserve) {
slay += reserve;
monster = A.at(i + 1) - reserve;
} else {
slay += A.at(i + 1);
monster = 0;
}
}
cout << slay;
return 0;
} | #define _GLIBCXX_DEBUG //空コンテナ操作禁止 Clang環境では#define _LIBCPP_DEBUG
//0
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
ll 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 monster = A.at(0), slay = 0, reserve = 0;
for (int i = 0; i < N; i++) {
if (monster >= B.at(i)) {
slay += B.at(i);
reserve = 0;
} else {
slay += monster;
reserve = B.at(i) - monster;
}
if (A.at(i + 1) > reserve) {
slay += reserve;
monster = A.at(i + 1) - reserve;
} else {
slay += A.at(i + 1);
monster = 0;
}
}
cout << slay << endl;
return 0;
} | [
"variable_declaration.type.change",
"io.output.newline.add"
] | 767,514 | 767,512 | u982721693 | 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 Sum = 0;
if (A.at(0) > B.at(0)) {
Sum += B.at(0);
B.at(0) = 0;
} else {
Sum += A.at(0);
B.at(0) -= A.at(0);
}
for (int i = 1; i < N + 1; i++) {
if (A.at(i) > B.at(i - 1)) {
Sum += B.at(i - 1);
A.at(i) -= B.at(i - 1);
} else {
Sum += A.at(i);
A.at(i) = 0;
}
if (i < N) {
if (A.at(i) > B.at(i)) {
Sum += B.at(i);
B.at(i) = 0;
} else {
Sum += A.at(i);
B.at(i) -= A.at(i);
}
}
}
cout << Sum << 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 Sum = 0;
if (A.at(0) > B.at(0)) {
Sum += B.at(0);
B.at(0) = 0;
} else {
Sum += A.at(0);
B.at(0) -= A.at(0);
}
for (int i = 1; i < N + 1; i++) {
if (A.at(i) > B.at(i - 1)) {
Sum += B.at(i - 1);
A.at(i) -= B.at(i - 1);
} else {
Sum += A.at(i);
A.at(i) = 0;
}
if (i < N) {
if (A.at(i) > B.at(i)) {
Sum += B.at(i);
B.at(i) = 0;
} else {
Sum += A.at(i);
B.at(i) -= A.at(i);
}
}
}
cout << Sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,515 | 767,516 | u196629968 | cpp |
p02959 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), end((c)))
int main() {
int N;
cin >> N;
vector<int> A, B;
rep(i, 0, N + 1) {
int a;
cin >> a;
A.push_back(a);
}
rep(i, 0, N) {
int b;
cin >> b;
B.push_back(b);
}
int ans = 0;
rep(i, 0, N) {
ans += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
A[i] -= min(A[i], B[i]);
ans += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i <= b; i++)
#define all(a) begin((a)), end((a))
#define uniq(c) (c).erase(unique(all((c))), end((c)))
int main() {
int N;
cin >> N;
vector<int> A, B;
rep(i, 0, N + 1) {
int a;
cin >> a;
A.push_back(a);
}
rep(i, 0, N) {
int b;
cin >> b;
B.push_back(b);
}
long long ans = 0;
rep(i, 0, N) {
ans += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
A[i] -= min(A[i], B[i]);
ans += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,517 | 767,518 | u729217226 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res;
cin >> n;
int a[n + 2], b[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
res = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
b[i] = b[i] - a[i];
res += a[i];
} else {
res += a[i] - (a[i] - b[i]);
b[i] = 0;
}
if (b[i] != 0) {
if (b[i] >= a[i + 1]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i];
a[i + 1] = a[i + 1] - b[i];
}
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 2], b[n + 1];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long int res = 0;
for (int i = 0; i < n; i++) {
if (b[i] >= a[i]) {
b[i] = b[i] - a[i];
res += a[i];
// a[i]=0;
} else {
res += a[i] - (a[i] - b[i]);
b[i] = 0;
}
if (b[i] != 0) {
if (b[i] >= a[i + 1]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i];
a[i + 1] = a[i + 1] - b[i];
}
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.remove"
] | 767,519 | 767,520 | u391465737 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
int ans = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
ans += A.at(i);
}
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
if (B.at(i) <= A.at(i)) {
A.at(i) -= B.at(i);
} else {
A.at(i + 1) -= min(A.at(i + 1), (B.at(i) - A.at(i)));
A.at(i) = 0;
}
}
for (int i = 0; i < N + 1; i++) {
ans -= A.at(i);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
long long ans = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
ans += A.at(i);
}
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
if (B.at(i) <= A.at(i)) {
A.at(i) -= B.at(i);
} else {
A.at(i + 1) -= min(A.at(i + 1), (B.at(i) - A.at(i)));
A.at(i) = 0;
}
}
for (int i = 0; i < N + 1; i++) {
ans -= A.at(i);
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,521 | 767,522 | u127314985 | cpp |
p02959 | #include <bits/stdc++.h>
#define FOR(i, n) for (i = 0; i < n; i++)
#define FORE(i, a, b) for (i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, sum = 0;
cin >> n;
long long int T[n + 2], B[n + 1];
FORE(i, 1, n + 1) { cin >> T[i]; }
FORE(i, 1, n) { cin >> B[i]; }
for (i = 1; i <= n; i++) {
if (B[i] > T[i]) {
sum += T[i];
B[i] -= T[i];
T[i] = 0;
if (B[i] > T[i + 1]) {
sum += T[i + 1];
B[i] -= T[i + 1];
T[i + 1] = 0;
} else {
sum += B[i];
T[i + 1] -= B[i];
B[i] = 0;
}
} else {
sum += B[i];
T[i] -= B[i];
}
}
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, n) for (i = 0; i < n; i++)
#define FORE(i, a, b) for (i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
long long int sum = 0;
cin >> n;
long long int T[n + 2], B[n + 1];
FORE(i, 1, n + 1) { cin >> T[i]; }
FORE(i, 1, n) { cin >> B[i]; }
for (i = 1; i <= n; i++) {
if (B[i] > T[i]) {
sum += T[i];
B[i] -= T[i];
T[i] = 0;
if (B[i] > T[i + 1]) {
sum += T[i + 1];
B[i] -= T[i + 1];
T[i + 1] = 0;
} else {
sum += B[i];
T[i + 1] -= B[i];
B[i] = 0;
}
} else {
sum += B[i];
T[i] -= B[i];
}
}
cout << sum;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 767,525 | 767,526 | u759696332 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
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;
}
} else {
sum += b[i];
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
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;
}
} else {
sum += b[i];
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,527 | 767,528 | u550014122 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, int> P;
using ll = long long;
using VI = vector<int>;
int main() {
int n;
cin >> n;
int ans = 0;
vector<int> a(n + 1), b(n);
for (auto &i : a)
cin >> i;
for (auto &i : b)
cin >> i;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
} else {
ans += a[i + 1];
a[i + 1] = 0;
b[i] = 0;
}
}
}
cout << ans << endl;
/*cout << ans << endl;
for(auto &i:a) cout << i;
cout << endl;
for(auto &i:b) cout << i;
cout << endl;*/
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, int> P;
using ll = long long;
using VI = vector<int>;
int main() {
Int n;
cin >> n;
Int ans = 0;
vector<Int> a(n + 1), b(n);
for (auto &i : a)
cin >> i;
for (auto &i : b)
cin >> i;
for (Int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
} else {
ans += a[i + 1];
a[i + 1] = 0;
b[i] = 0;
}
}
}
cout << ans << endl;
/*cout << ans << endl;
for(auto &i:a) cout << i;
cout << endl;
for(auto &i:b) cout << i;
cout << endl;*/
}
| [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 767,531 | 767,532 | u902149880 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans(0);
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + i];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans(0);
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 767,533 | 767,534 | u244832678 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
B -= A[i];
if (B >= A[i + 1]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B;
A[i + 1] -= B;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N + 1; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
B -= A[i];
if (B >= A[i + 1]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B;
A[i + 1] -= B;
}
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 767,535 | 767,536 | u244832678 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N + 1; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
B -= A[i];
if (B >= A[i + 1]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B;
A[i + 1] -= B;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i(0); i < N + 1; ++i)
cin >> A[i];
ll B, prev_B, ans(0);
for (int i(0); i < N; ++i) {
cin >> B;
if (A[i] >= B) {
ans += B;
} else {
ans += A[i];
B -= A[i];
if (B >= A[i + 1]) {
ans += A[i + 1];
A[i + 1] = 0;
} else {
ans += B;
A[i + 1] -= B;
}
}
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 767,537 | 767,536 | u244832678 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T In() {
T t;
cin >> t;
return t;
}
template <typename T> vector<vector<T>> Vec2(int i, int j, T ini = 0) {
vector<vector<T>> vec(i, vector<T>(i, ini));
return move(vec);
}
template <typename T>
vector<vector<vector<T>>> Vec3(int i, int j, int k, T ini = 0) {
vector<vector<vector<T>>> vec(i, vector<vector<T>>(j, vector<T>(k, ini)));
return move(vec);
}
int main() {
int N = In<int>();
vector<int> As(N + 1), Bs(N);
for (int i = 0; i < N + 1; i++) {
As[i] = In<int>();
}
for (int i = 0; i < N; i++) {
Bs[i] = In<int>();
}
ll ans = 0;
for (int i = N - 1; i >= 0; i--) {
int K1 = min(As[i + 1], Bs[i]);
Bs[i] -= K1;
As[i] -= K1;
ans += K1;
int K0 = min(As[i], Bs[i]);
Bs[i] -= K0;
As[i] -= K0;
ans += K0;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
template <typename T> T In() {
T t;
cin >> t;
return t;
}
template <typename T> vector<vector<T>> Vec2(int i, int j, T ini = 0) {
vector<vector<T>> vec(i, vector<T>(i, ini));
return move(vec);
}
template <typename T>
vector<vector<vector<T>>> Vec3(int i, int j, int k, T ini = 0) {
vector<vector<vector<T>>> vec(i, vector<vector<T>>(j, vector<T>(k, ini)));
return move(vec);
}
int main() {
int N = In<int>();
vector<int> As(N + 1), Bs(N);
for (int i = 0; i < N + 1; i++) {
As[i] = In<int>();
}
for (int i = 0; i < N; i++) {
Bs[i] = In<int>();
}
ll ans = 0;
for (int i = N - 1; i >= 0; i--) {
int K1 = min(As[i + 1], Bs[i]);
Bs[i] -= K1;
As[i + 1] -= K1;
ans += K1;
int K0 = min(As[i], Bs[i]);
Bs[i] -= K0;
As[i] -= K0;
ans += K0;
}
cout << ans << endl;
}
| [
"assignment.change"
] | 767,538 | 767,539 | u991692050 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100001;
int main() {
int N = in(), A[MAX], b, ans = 0;
rep(i, N + 1) A[i] = in();
rep(i, N) {
b = in();
if (b >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (b > A[i]) {
ans += b;
A[i + 1] = A[i + 1] - (b - A[i]);
} else {
ans += b;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int in() {
int x;
scanf("%d", &x);
return x;
}
static const int MAX = 100001;
int main() {
int N = in(), A[MAX], b;
long ans = 0;
rep(i, N + 1) A[i] = in();
rep(i, N) {
b = in();
if (b >= A[i] + A[i + 1]) {
ans += A[i] + A[i + 1];
A[i + 1] = 0;
} else if (b > A[i]) {
ans += b;
A[i + 1] = A[i + 1] - (b - A[i]);
} else {
ans += b;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,540 | 767,541 | u378125390 | cpp |
p02959 | // ROAD TO GREEN
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define speedhack() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const ll MAXN = 2e9 + 2;
const ll SIZE = 1e6 + 2;
const ll mod = 1e9 + 7;
int main() {
speedhack() int n;
cin >> n;
vector<int> v;
for (int i = 1; i <= n + 1; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<int> h;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
h.push_back(x);
}
int sum = 0;
int curs = 0;
for (int i = 0; i < h.size(); i++) {
curs = min(v[i], h[i]);
sum += curs;
h[i] -= curs;
curs = min(v[i + 1], h[i]);
sum += curs;
v[i + 1] -= curs;
}
cout << sum << endl;
return 0;
}
| // ROAD TO GREEN
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long
#define uint unsigned int
#define ull unsigned ll
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define speedhack() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const ll MAXN = 2e9 + 2;
const ll SIZE = 1e6 + 2;
const ll mod = 1e9 + 7;
int main() {
speedhack() int n;
cin >> n;
vector<ll> v;
for (int i = 1; i <= n + 1; i++) {
ll x;
cin >> x;
v.push_back(x);
}
vector<ll> h;
for (int i = 1; i <= n; i++) {
ll x;
cin >> x;
h.push_back(x);
}
ll sum = 0;
ll curs = 0;
for (int i = 0; i < h.size(); i++) {
curs = min(v[i], h[i]);
sum += curs;
h[i] -= curs;
curs = min(v[i + 1], h[i]);
sum += curs;
v[i + 1] -= curs;
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,547 | 767,548 | u519336948 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) { return f ? "YES" : "NO"; }
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
int sum = 0;
vector<int> A, B;
cin >> N;
A.resize(N + 1);
B.resize(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
int x = min(A[i], B[i]);
B[i] -= x;
sum += x;
x = min(A[i + 1], B[i]);
A[i] -= x;
sum += x;
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define endl "\n"
const long long INF = (long long)1e18;
const long long MOD = 1'000'000'007;
string yn(bool f) { return f ? "Yes" : "No"; }
string YN(bool f) { return f ? "YES" : "NO"; }
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int N;
int sum = 0;
vector<int> A, B;
cin >> N;
A.resize(N + 1);
B.resize(N);
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
int x = min(A[i], B[i]);
B[i] -= x;
sum += x;
x = min(A[i + 1], B[i]);
A[i + 1] -= x;
sum += x;
}
cout << sum << endl;
return 0;
} | [
"assignment.change"
] | 767,549 | 767,550 | u233393801 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[100010], b[100010], ans = 0;
cin >> n;
for (i = 0; i <= n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
ans += min(a[i] + a[i + 1], b[i]);
if (b[i] > a[i] + a[i + 1])
a[i + 1] = 0;
else if (b[i] > a[i])
a[i + 1] -= b[i] - a[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, i, a[100010], b[100010];
long ans = 0;
cin >> n;
for (i = 0; i <= n; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
for (i = 0; i < n; i++) {
ans += min(a[i] + a[i + 1], b[i]);
if (b[i] > a[i] + a[i + 1])
a[i + 1] = 0;
else if (b[i] > a[i])
a[i + 1] -= b[i] - a[i];
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 767,551 | 767,552 | u088895504 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
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 v = 0;
REP(i, n - i) {
if (a[i] >= b[i]) {
v += b[i];
b[i] = 0;
} else {
v += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
v += b[i];
a[i + 1] -= b[i];
} else {
v += a[i + 1];
a[i + 1] = 0;
}
}
if (i != n - 1 - i) {
if (a[n - i] >= b[n - 1 - i]) {
v += b[n - 1 - i];
b[n - 1 - i] = 0;
} else {
v += a[n - i];
b[n - 1 - i] -= a[n - i];
if (a[n - i - 1] >= b[n - 1 - i]) {
v += b[n - 1 - i];
a[n - i - 1] -= b[n - 1 - i];
} else {
v += a[n - i - 1];
a[n - i - 1] = 0;
}
}
}
}
cout << v << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
REP(i, n + 1) cin >> a[i];
REP(i, n) cin >> b[i];
ll v = 0;
REP(i, n - i) {
if (a[i] >= b[i]) {
v += b[i];
b[i] = 0;
} else {
v += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
v += b[i];
a[i + 1] -= b[i];
} else {
v += a[i + 1];
a[i + 1] = 0;
}
}
if (i != n - 1 - i) {
if (a[n - i] >= b[n - 1 - i]) {
v += b[n - 1 - i];
b[n - 1 - i] = 0;
} else {
v += a[n - i];
b[n - 1 - i] -= a[n - i];
if (a[n - i - 1] >= b[n - 1 - i]) {
v += b[n - 1 - i];
a[n - i - 1] -= b[n - 1 - i];
} else {
v += a[n - i - 1];
a[n - i - 1] = 0;
}
}
}
}
cout << v << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,555 | 767,556 | u291873788 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, ans = 0, r = 0;
cin >> n;
vector<int> a(n + 1, 0), b(n + 1, 0);
REP(i, n) cin >> a.at(i);
cin >> a.at(n);
REP(i, n) cin >> b.at(i);
b.at(n) = 0;
REP(i, n + 1) {
if (b.at(i) + r > a.at(i)) {
ans += a.at(i);
if (r >= a.at(i))
r = b.at(i);
else
r = b.at(i) - a.at(i) + r;
} else {
ans += (b.at(i) + r);
r = 0;
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
long long n, ans = 0, r = 0;
cin >> n;
vector<long long> a(n + 1, 0), b(n + 1, 0);
REP(i, n) cin >> a.at(i);
cin >> a.at(n);
REP(i, n) cin >> b.at(i);
b.at(n) = 0;
REP(i, n + 1) {
if (b.at(i) + r > a.at(i)) {
ans += a.at(i);
if (r >= a.at(i))
r = b.at(i);
else
r = b.at(i) - a.at(i) + r;
} else {
ans += (b.at(i) + r);
r = 0;
}
}
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,557 | 767,558 | u082801599 | cpp |
p02959 | #include <bits/stdc++.h>
// #include <iomanip>
#include <iostream>
using namespace std;
int main() {
// 2
// 6 5 2
// 7 6
int n;
// scanf("%d", &n);
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
// scanf("%d", &a[i]);
cin >> a[i];
}
vector<int> b(n + 1);
for (int i = 0; i < n; i++) {
// scanf("%d", &b[i]);
cin >> b[i];
}
b[n] = 0;
int r = 0;
for (int i = 0; i < n; i++) {
int m1 = min(a[i], b[i]);
int m2 = min(a[i + 1], b[i] - m1);
r += (m1 + m2);
a[i + 1] -= m2;
}
cout << r;
}
| #include <bits/stdc++.h>
// #include <iomanip>
#include <iostream>
using namespace std;
int main() {
// 2
// 6 5 2
// 7 6
int n;
// scanf("%d", &n);
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
// scanf("%d", &a[i]);
cin >> a[i];
}
vector<int> b(n + 1);
for (int i = 0; i < n; i++) {
// scanf("%d", &b[i]);
cin >> b[i];
}
b[n] = 0;
long r = 0;
for (int i = 0; i < n; i++) {
int m1 = min(a[i], b[i]);
int m2 = min(a[i + 1], b[i] - m1);
r += (m1 + m2);
a[i + 1] -= m2;
}
cout << r;
}
| [
"variable_declaration.type.primitive.change"
] | 767,559 | 767,560 | u006576567 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n, a[123456], b[123456], c;
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];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
c += b[i];
else if ((a[i] + a[(i + 1)]) <= b[i]) {
c += (a[i] + a[(i + 1)]);
a[(i + 1)] = 0;
} else {
c += b[i];
a[(i + 1)] = ((a[i] + a[(i + 1)]) - b[i]);
}
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, a[123456], b[123456], c;
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];
for (int i = 0; i < n; i++) {
if (a[i] >= b[i])
c += b[i];
else if ((a[i] + a[(i + 1)]) <= b[i]) {
c += (a[i] + a[(i + 1)]);
a[(i + 1)] = 0;
} else {
c += b[i];
a[(i + 1)] = ((a[i] + a[(i + 1)]) - b[i]);
}
}
cout << c << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,563 | 767,564 | u477516105 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
int m, n, o = 0, i, j, k, sum = 0;
// long long int m,n,o,i,j,k,len=0;
// vector <int> v;
// float f,g,h;
// char c,d;
// string a;
cin >> n;
int *na = new int[n + 1];
int *nb = new int[n];
for (i = 0; i < n + 1; i++)
cin >> na[i];
for (i = 0; i < n; i++)
cin >> nb[i];
for (i = 0; i < n; i++) {
if (nb[i] <= na[i])
sum += nb[i];
else {
sum += na[i];
nb[i] -= na[i];
if (nb[i] <= na[i + 1]) {
sum += nb[i];
na[i + 1] -= nb[i];
} else {
sum += na[i + 1];
na[i + 1] = 0;
}
}
}
cout << sum;
// cin>>m>>c>>n>>d>>i;
// cin>>f>>g;
// cin>>c;
delete[] na;
delete[] nb;
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
// int m,n,o=0,i,j,k,sum=0;
long long int m, n, o, i, j, k, sum = 0;
// vector <int> v;
// float f,g,h;
// char c,d;
// string a;
cin >> n;
int *na = new int[n + 1];
int *nb = new int[n];
for (i = 0; i < n + 1; i++)
cin >> na[i];
for (i = 0; i < n; i++)
cin >> nb[i];
for (i = 0; i < n; i++) {
if (nb[i] <= na[i])
sum += nb[i];
else {
sum += na[i];
nb[i] -= na[i];
if (nb[i] <= na[i + 1]) {
sum += nb[i];
na[i + 1] -= nb[i];
} else {
sum += na[i + 1];
na[i + 1] = 0;
}
}
}
cout << sum;
// cin>>m>>c>>n>>d>>i;
// cin>>f>>g;
// cin>>c;
delete[] na;
delete[] nb;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 767,565 | 767,566 | u763410402 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
if((A+B)%2==1){
std::cout << "IMPOSSIBLE" <<std::endl;
}
else{
std::cout << (A+B)/2 << std::endl;
}
return 0;
}
*/
/*
int main(){
int N;
std::cin >> N;
int a[N];
int flg=0;
for(int i=0; i<N; i++){
std::cin >> a[i];
}
for(int i=0; i<N; i++){
if(a[i]!=i+1){
flg++;
}
if(flg==3){
std::cout << "NO" << std::endl;
return 0;
}
}
std::cout << "YES" << std::endl;
return 0;
}
*/
int main() {
int N;
int defeat = 0;
std::cin >> N;
long int mons[N + 1];
long int brave[N];
for (int i = 0; i < N + 1; i++) {
std::cin >> mons[i];
}
for (int i = 0; i < N; i++) {
std::cin >> brave[i];
}
for (int i = 0; i < N; i++) {
if (brave[i] > mons[i]) {
defeat += mons[i];
defeat += min(brave[i] - mons[i], mons[i + 1]);
mons[i + 1] -= min(brave[i] - mons[i], mons[i + 1]);
} else {
defeat += brave[i];
}
}
std::cout << defeat << std::endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
if((A+B)%2==1){
std::cout << "IMPOSSIBLE" <<std::endl;
}
else{
std::cout << (A+B)/2 << std::endl;
}
return 0;
}
*/
/*
int main(){
int N;
std::cin >> N;
int a[N];
int flg=0;
for(int i=0; i<N; i++){
std::cin >> a[i];
}
for(int i=0; i<N; i++){
if(a[i]!=i+1){
flg++;
}
if(flg==3){
std::cout << "NO" << std::endl;
return 0;
}
}
std::cout << "YES" << std::endl;
return 0;
}
*/
int main() {
int N;
long int defeat = 0;
std::cin >> N;
long int mons[N + 1];
long int brave[N];
for (int i = 0; i < N + 1; i++) {
std::cin >> mons[i];
}
for (int i = 0; i < N; i++) {
std::cin >> brave[i];
}
for (int i = 0; i < N; i++) {
if (brave[i] > mons[i]) {
defeat += mons[i];
defeat += min(brave[i] - mons[i], mons[i + 1]);
mons[i + 1] -= min(brave[i] - mons[i], mons[i + 1]);
} else {
defeat += brave[i];
}
}
std::cout << defeat << std::endl;
}
| [
"variable_declaration.type.widen.change"
] | 767,567 | 767,568 | u786283792 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
if((A+B)%2==1){
std::cout << "IMPOSSIBLE" <<std::endl;
}
else{
std::cout << (A+B)/2 << std::endl;
}
return 0;
}
*/
/*
int main(){
int N;
std::cin >> N;
int a[N];
int flg=0;
for(int i=0; i<N; i++){
std::cin >> a[i];
}
for(int i=0; i<N; i++){
if(a[i]!=i+1){
flg++;
}
if(flg==3){
std::cout << "NO" << std::endl;
return 0;
}
}
std::cout << "YES" << std::endl;
return 0;
}
*/
int main() {
int N;
int defeat = 0;
std::cin >> N;
int mons[N + 1];
int brave[N];
for (int i = 0; i < N + 1; i++) {
std::cin >> mons[i];
}
for (int i = 0; i < N; i++) {
std::cin >> brave[i];
}
for (int i = 0; i < N; i++) {
if (brave[i] > mons[i]) {
defeat += mons[i];
defeat += min(brave[i] - mons[i], mons[i + 1]);
mons[i + 1] -= min(brave[i] - mons[i], mons[i + 1]);
} else {
defeat += brave[i];
}
}
std::cout << defeat << std::endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
using std::swap;
// priceをキーに降順でソート
// sort(fruits.begin(), fruits.end(),
// [](const fruit& x, const fruit& y) { return x.price > y.price;});
/*
int main() {
int A,B;
std:cin >> A >> B;
if((A+B)%2==1){
std::cout << "IMPOSSIBLE" <<std::endl;
}
else{
std::cout << (A+B)/2 << std::endl;
}
return 0;
}
*/
/*
int main(){
int N;
std::cin >> N;
int a[N];
int flg=0;
for(int i=0; i<N; i++){
std::cin >> a[i];
}
for(int i=0; i<N; i++){
if(a[i]!=i+1){
flg++;
}
if(flg==3){
std::cout << "NO" << std::endl;
return 0;
}
}
std::cout << "YES" << std::endl;
return 0;
}
*/
int main() {
int N;
long int defeat = 0;
std::cin >> N;
long int mons[N + 1];
long int brave[N];
for (int i = 0; i < N + 1; i++) {
std::cin >> mons[i];
}
for (int i = 0; i < N; i++) {
std::cin >> brave[i];
}
for (int i = 0; i < N; i++) {
if (brave[i] > mons[i]) {
defeat += mons[i];
defeat += min(brave[i] - mons[i], mons[i + 1]);
mons[i + 1] -= min(brave[i] - mons[i], mons[i + 1]);
} else {
defeat += brave[i];
}
}
std::cout << defeat << std::endl;
}
| [
"variable_declaration.type.widen.change"
] | 767,569 | 767,568 | u786283792 | cpp |
p02959 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<pair<int, int>> vpi;
typedef vector<tuple<int, int, int>> vti;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vi 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 prev = 0, ans = 0;
for (int i = 0; i < n + 1; i++) {
int now = b[i] + prev;
ans += min(a[i], now);
if (now > a[i])
prev = min(b[i], now - a[i]);
else
prev = 0;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<pair<int, int>> vpi;
typedef vector<tuple<int, int, int>> vti;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vl 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 prev = 0, ans = 0;
for (int i = 0; i < n + 1; i++) {
ll now = b[i] + prev;
ans += min(a[i], now);
if (now > a[i])
prev = min(b[i], now - a[i]);
else
prev = 0;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 767,582 | 767,583 | u977925575 | cpp |
p02959 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), 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];
}
int k = 0;
for (int i = 0; i < n; i++) {
int d = b[i] - a[i];
if (d <= 0) {
k += b[i];
} else {
k += a[i] + std::min(d, a[i + 1]);
a[i + 1] = std::max(0, a[i + 1] - d);
}
}
std::cout << k << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::vector<int> a(n + 1), 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];
}
long long k = 0;
for (int i = 0; i < n; i++) {
int d = b[i] - a[i];
if (d <= 0) {
k += b[i];
} else {
k += a[i] + std::min(d, a[i + 1]);
a[i + 1] = std::max(0, a[i + 1] - d);
}
}
std::cout << k << std::endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,593 | 767,594 | u274139177 | cpp |
p02959 | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
//
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count += b[i];
// a[i] -= b[i];
} else {
count += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
count += b[i];
a[i + 1] -= b[i];
} else {
count += a[i + 1];
a[i + 1] = 0;
// b[i] -= a[i+1];
}
}
}
cout << count;
// std::cout << ans << std::endl;
// for (int i=0;i<n;i++){
// std::cout << vec.at(i) << std::endl;
//}
return 0;
} | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
//
long long count = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count += b[i];
// a[i] -= b[i];
} else {
count += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
count += b[i];
a[i + 1] -= b[i];
} else {
count += a[i + 1];
a[i + 1] = 0;
// b[i] -= a[i+1];
}
}
}
cout << count;
// std::cout << ans << std::endl;
// for (int i=0;i<n;i++){
// std::cout << vec.at(i) << std::endl;
//}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,595 | 767,596 | u625741705 | cpp |
p02959 | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
//
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count += b[i];
} else if (b[i] <= a[i] + a[i + 1]) {
count += b[i];
a[i + 1] -= b[i] - a[i];
} else {
count += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << count;
// std::cout << ans << std::endl;
// for (int i=0;i<n;i++){
// std::cout << vec.at(i) << std::endl;
//}
return 0;
} | #include <bits/stdc++.h>
#include <map>
using namespace std;
int main() {
// input
int n;
std::cin >> n;
string str;
int a[n], b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
//
long long count = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count += b[i];
} else if (b[i] <= a[i] + a[i + 1]) {
count += b[i];
a[i + 1] -= b[i] - a[i];
} else {
count += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << count;
// std::cout << ans << std::endl;
// for (int i=0;i<n;i++){
// std::cout << vec.at(i) << std::endl;
//}
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,597 | 767,598 | u625741705 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll A[N + 1], B[N];
ll count;
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 left = min(A[i], B[i]);
count += left;
B[i] -= left;
ll right = min(A[i + 1], B[i]);
A[i + 1] -= right;
count += right;
}
cout << count << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
ll A[N + 1], B[N];
ll count = 0;
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
for (int i = 0; i < N; i++) {
ll left = min(A[i], B[i]);
count += left;
B[i] -= left;
ll right = min(A[i + 1], B[i]);
A[i + 1] -= right;
count += right;
}
cout << count << endl;
}
| [
"variable_declaration.value.change"
] | 767,599 | 767,600 | u355371431 | cpp |
p02959 | #include <cstdio>
int main() {
int N;
scanf("%d", &N);
long long int a[N + 1];
for (int i = 0; i < N + 1; i++) {
scanf("%lld", &a[i]);
}
long long int b[N];
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
}
long long int bonus = 0;
long long int count = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= b[i] + bonus) {
count += b[i] + bonus;
bonus = 0;
} else if (a[i] <= bonus) {
count += a[i];
bonus = b[i];
} else {
count += a[i];
bonus += b[i] - a[i];
}
}
if (a[N] > bonus)
count += bonus;
else
count += a[N];
printf("%d", count);
} | #include <cstdio>
int main() {
int N;
scanf("%d", &N);
long long int a[N + 1];
for (int i = 0; i < N + 1; i++) {
scanf("%lld", &a[i]);
}
long long int b[N];
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
}
long long int bonus = 0;
long long int count = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= b[i] + bonus) {
count += b[i] + bonus;
bonus = 0;
} else if (a[i] <= bonus) {
count += a[i];
bonus = b[i];
} else {
count += a[i];
bonus += b[i] - a[i];
}
}
if (a[N] > bonus)
count += bonus;
else
count += a[N];
printf("%lld", count);
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,601 | 767,602 | u568501780 | cpp |
p02959 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
void Main() {
int n;
cin >> n;
vector<int> a(n + 1);
REP(i, n + 1) cin >> a[i];
vector<int> b(n);
REP(i, n) cin >> b[i];
int sum = 0;
REP(i, n) {
sum += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
cout << sum << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define SORT_ASC(c) sort((c).begin(), (c).end())
#define SORT_DESC(c) \
sort((c).begin(), (c).end(), greater<typeof((c).begin())>())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
void Main() {
int n;
cin >> n;
vector<int> a(n + 1);
REP(i, n + 1) cin >> a[i];
vector<int> b(n);
REP(i, n) cin >> b[i];
LL sum = 0;
REP(i, n) {
sum += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
sum += min(a[i + 1], b[i]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
cout << sum << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | [
"variable_declaration.type.change"
] | 767,605 | 767,606 | u987591601 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int N;
int ans = 0;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N);
REP(i, N + 1)
cin >> a[i];
REP(i, N)
cin >> b[i];
REP(i, N) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] > 0) {
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int N;
long long ans = 0;
cin >> N;
vector<long long> a(N + 1);
vector<long long> b(N);
REP(i, N + 1)
cin >> a[i];
REP(i, N)
cin >> b[i];
REP(i, N) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (b[i] > 0) {
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
} else {
ans += b[i];
a[i] -= b[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,611 | 767,612 | u882037708 | cpp |
p02959 | #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> m;
vector<int> h;
for (int i = 0; i < n + 1; i++) {
int t;
cin >> t;
m.push_back(t);
}
for (int i = 0; i < n; i++) {
int t;
cin >> t;
h.push_back(t);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= m[i]) {
ans += m[i];
int nm = m[i + 1];
m[i + 1] = max(0, m[i + 1] - (h[i] - m[i]));
ans += (m[i + 1] == 0) ? nm : (h[i] - m[i]);
m[i] = 0;
} else {
ans += h[i];
m[i] -= h[i];
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
/**
||||||||||||| ||||| ||||| ||||||||||
|||||||||||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| |||||
|||||||||||||||| ||||||||||||||| ||||||||||
||||||||||||||||| ||||||||||||||| |||||
||||| ||||| ||||| ||||| |||||
||||| ||||| ||||| ||||| ||||||||||
AHMED;HASSAN;SAEED;
*/
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> m;
vector<int> h;
for (int i = 0; i < n + 1; i++) {
int t;
cin >> t;
m.push_back(t);
}
for (int i = 0; i < n; i++) {
int t;
cin >> t;
h.push_back(t);
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (h[i] >= m[i]) {
ans += m[i];
int nm = m[i + 1];
m[i + 1] = max(0, m[i + 1] - (h[i] - m[i]));
ans += (m[i + 1] == 0) ? nm : (h[i] - m[i]);
m[i] = 0;
} else {
ans += h[i];
m[i] -= h[i];
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,613 | 767,614 | u129611452 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int tmp;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
int yoryoku = 0; //勇者が次の街で倒せる数
double taoshita = 0; //倒したモンスターの数
int nokori = 0; //その街の残りモンスター数
for (int i = 0; i < n; i++) {
nokori = a[i]; //街iのモンスター数をセット
taoshita += min(nokori, yoryoku); //勇者i-1の余力で倒せるだけ倒す
nokori =
nokori -
min(nokori, yoryoku); //余力で倒した街iの残りモンスター数を残りにセット
taoshita += min(nokori, b[i]); //勇者iで倒せるだけ倒す
yoryoku = b[i] - min(nokori, b[i]); //勇者iの余力をセット
}
//最後の街n+1のモンスターを余力で倒す
taoshita += min(a[n], yoryoku);
cout << taoshita << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long tmp;
vector<long> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
long yoryoku = 0; //勇者が次の街で倒せる数
long taoshita = 0; //倒したモンスターの数
long nokori = 0; //その街の残りモンスター数
for (int i = 0; i < n; i++) {
nokori = a[i]; //街iのモンスター数をセット
taoshita += min(nokori, yoryoku); //勇者i-1の余力で倒せるだけ倒す
nokori =
nokori -
min(nokori, yoryoku); //余力で倒した街iの残りモンスター数を残りにセット
taoshita += min(nokori, b[i]); //勇者iで倒せるだけ倒す
yoryoku = b[i] - min(nokori, b[i]); //勇者iの余力をセット
}
//最後の街n+1のモンスターを余力で倒す
taoshita += min(a[n], yoryoku);
cout << taoshita << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,615 | 767,616 | u145078207 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int tmp;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
int yoryoku = 0; //勇者が次の街で倒せる数
int taoshita = 0; //倒したモンスターの数
int nokori = 0; //その街の残りモンスター数
for (int i = 0; i < n; i++) {
nokori = a[i]; //街iのモンスター数をセット
taoshita += min(nokori, yoryoku); //勇者i-1の余力で倒せるだけ倒す
nokori =
nokori -
min(nokori, yoryoku); //余力で倒した街iの残りモンスター数を残りにセット
taoshita += min(nokori, b[i]); //勇者iで倒せるだけ倒す
yoryoku = b[i] - min(nokori, b[i]); //勇者iの余力をセット
}
//最後の街n+1のモンスターを余力で倒す
taoshita += min(a[n], yoryoku);
cout << taoshita << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long tmp;
vector<long> a, b;
for (int i = 0; i < n + 1; i++) {
cin >> tmp;
a.push_back(tmp);
}
for (int i = 0; i < n; i++) {
cin >> tmp;
b.push_back(tmp);
}
long yoryoku = 0; //勇者が次の街で倒せる数
long taoshita = 0; //倒したモンスターの数
long nokori = 0; //その街の残りモンスター数
for (int i = 0; i < n; i++) {
nokori = a[i]; //街iのモンスター数をセット
taoshita += min(nokori, yoryoku); //勇者i-1の余力で倒せるだけ倒す
nokori =
nokori -
min(nokori, yoryoku); //余力で倒した街iの残りモンスター数を残りにセット
taoshita += min(nokori, b[i]); //勇者iで倒せるだけ倒す
yoryoku = b[i] - min(nokori, b[i]); //勇者iの余力をセット
}
//最後の街n+1のモンスターを余力で倒す
taoshita += min(a[n], yoryoku);
cout << taoshita << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,617 | 767,616 | u145078207 | cpp |
p02959 | #include <cmath>
#include <iostream>
using namespace std;
static const int MAX_N = 1000100;
int main(void) {
// 入力
int n;
cin >> n;
int A[MAX_N + 1];
int B[MAX_N];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
// i番目を倒せるだけ倒してi+1へ(左から右へ)
int counter_l = 0;
for (int i = 0; i < n; i++) {
if (A[i] >= B[i]) {
A[i] = 0;
counter_l += B[i];
} else {
counter_l += A[i];
B[i] = B[i] - A[i];
// 余力で隣町を守りに行ける
if (A[i + 1] >= B[i]) {
A[i + 1] -= B[i];
counter_l += B[i];
} else {
counter_l += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << counter_l;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
static const int MAX_N = 1000100;
int main(void) {
// 入力
int n;
cin >> n;
int A[MAX_N + 1];
int B[MAX_N];
for (int i = 0; i < n + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
// i番目を倒せるだけ倒してi+1へ(左から右へ)
long long counter_l = 0;
for (int i = 0; i < n; i++) {
if (A[i] >= B[i]) {
A[i] = 0;
counter_l += B[i];
} else {
counter_l += A[i];
B[i] = B[i] - A[i];
// 余力で隣町を守りに行ける
if (A[i + 1] >= B[i]) {
A[i + 1] -= B[i];
counter_l += B[i];
} else {
counter_l += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << counter_l;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,618 | 767,619 | u900688325 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
ll memory = 0;
memory = accumulate(A.begin(), A.end(), 0);
for (ll i = 0; i < N; i++) {
cin >> B.at(i);
}
for (ll i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
A.at(i) -= B.at(i);
} else if (A.at(i + 1) >= B.at(i) - A.at(i)) {
A.at(i + 1) = A.at(i + 1) - B.at(i) + A.at(i);
A.at(i) = 0;
} else {
A.at(i + 1) = 0;
A.at(i) = 0;
}
}
cout << memory - accumulate(A.begin(), A.end(), 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N + 1);
vector<ll> B(N);
for (ll i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
ll memory = 0;
memory = accumulate(A.begin(), A.end(), 0LL);
for (ll i = 0; i < N; i++) {
cin >> B.at(i);
}
for (ll i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
A.at(i) -= B.at(i);
} else if (A.at(i + 1) >= B.at(i) - A.at(i)) {
A.at(i + 1) = A.at(i + 1) - B.at(i) + A.at(i);
A.at(i) = 0;
} else {
A.at(i + 1) = 0;
A.at(i) = 0;
}
}
cout << memory - accumulate(A.begin(), A.end(), 0LL) << endl;
} | [
"literal.number.type.widen.change"
] | 767,620 | 767,621 | u508077444 | cpp |
p02959 | #include <bits/stdc++.h>
#include <vector>
using namespace std;
template <typename T> void readElems(vector<T> &vec, int n) {
int tmp;
vec.reserve(n);
for (int i = 0; i < n; ++i) {
cin >> tmp;
vec.push_back(tmp);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> va, vb;
readElems(va, n + 1);
readElems(vb, n);
int cnt = 0;
for (int i = 0; i < n; ++i) {
int left = min(va[i], vb[i]);
cnt += left;
va[i] -= left;
vb[i] -= left;
int right = min(va[i + 1], vb[i]);
cnt += right;
va[i + 1] -= right;
vb[i] -= right;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#include <vector>
using namespace std;
template <typename T> void readElems(vector<T> &vec, int n) {
int tmp;
vec.reserve(n);
for (int i = 0; i < n; ++i) {
cin >> tmp;
vec.push_back(tmp);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> va, vb;
readElems(va, n + 1);
readElems(vb, n);
long cnt = 0;
for (int i = 0; i < n; ++i) {
int left = min(va[i], vb[i]);
cnt += left;
va[i] -= left;
vb[i] -= left;
int right = min(va[i + 1], vb[i]);
cnt += right;
va[i + 1] -= right;
vb[i] -= right;
}
cout << cnt << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,622 | 767,623 | u325943907 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0;
if (A.at(i + 1) < B.at(i)) {
ans += A.at(i + 1);
B.at(i) -= A.at(i + 1);
A.at(i) = 0;
} else {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0;
}
} else {
ans += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0;
if (A.at(i + 1) < B.at(i)) {
ans += A.at(i + 1);
B.at(i) -= A.at(i + 1);
A.at(i + 1) = 0;
} else {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
B.at(i) = 0;
}
} else {
ans += B.at(i);
A.at(i) -= B.at(i);
B.at(i) = 0;
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 767,624 | 767,625 | u152315108 | cpp |
p02959 | #include <cstdio>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
int main() {
int n;
int a[100001];
int b[100000];
scanf("%d", &n);
for (int i = 0; i <= n; ++i) {
scanf("%d", a + i);
}
for (int i = 0; i < n; ++i) {
scanf("%d", b + i);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
if (b[i] > 0) {
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
printf("%d\n", ans);
return 0;
} | #include <cstdio>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
int main() {
int n;
int a[100001];
int b[100000];
scanf("%d", &n);
for (int i = 0; i <= n; ++i) {
scanf("%d", a + i);
}
for (int i = 0; i < n; ++i) {
scanf("%d", b + i);
}
long long ans = 0;
for (int i = 0; i < n; ++i) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
if (b[i] > 0) {
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
printf("%lld\n", ans);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 767,626 | 767,627 | u931819817 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
long long ans = 0;
rep(i, n) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
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]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
} | [
"assignment.change"
] | 767,638 | 767,639 | u440217234 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
int main(void) {
ll N;
ll ans;
cin >> N;
vector<ll> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<ll> B(N);
rep(i, N) cin >> B[i];
ans = 0;
if (A[0] - B[0] > 0) {
ans += B[0];
A[0] -= B[0];
B[0] = 0;
} else {
ans += A[0];
B[0] -= A[0];
A[0] = 0;
}
if (A[1] - B[0] > 0) {
ans += B[0];
A[1] -= B[0];
B[0] = 0;
} else {
ans += A[1];
B[0] -= A[1];
A[1] = 0;
}
rep2(i, 1, N + 1) {
if (A[i] - B[i] > 0) {
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] > 0) {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
#define ALL(obj) (obj).begin(), (obj).end()
int main(void) {
ll N;
ll ans;
cin >> N;
vector<ll> A(N + 1);
rep(i, N + 1) cin >> A[i];
vector<ll> B(N);
rep(i, N) cin >> B[i];
ans = 0;
if (A[0] - B[0] > 0) {
ans += B[0];
A[0] -= B[0];
B[0] = 0;
} else {
ans += A[0];
B[0] -= A[0];
A[0] = 0;
}
if (A[1] - B[0] > 0) {
ans += B[0];
A[1] -= B[0];
B[0] = 0;
} else {
ans += A[1];
B[0] -= A[1];
A[1] = 0;
}
rep2(i, 1, N) {
if (A[i] - B[i] > 0) {
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] > 0) {
ans += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
ans += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 767,643 | 767,644 | u145179061 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
int count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count1 += b[i];
} else {
count1 += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count1 += b[i];
} else {
count1 += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << count1;
}
| #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
long long count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count1 += b[i];
} else {
count1 += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count1 += b[i];
} else {
count1 += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << count1;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,645 | 767,646 | u266105150 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
int count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) {
count1 += b[i];
} else {
count1 += a[i];
b[i] -= a[i];
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
count1 += b[i];
} else {
count1 += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << count1;
}
| #include <bits/stdc++.h>
using namespace std;
long long n;
long long k;
long long a[2000006];
long long b[2000006];
long long count1 = 0;
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
count1 += b[i];
} else {
count1 += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count1 += b[i];
} else {
count1 += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << count1;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,647 | 767,646 | u266105150 | 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;
int sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, n) {
if (a[i] - b[i] > 0) {
a[i] = a[i] - b[i];
sum += b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
sum += a[i];
a[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] > 0) {
a[i + 1] = a[i + 1] - b[i];
sum += b[i];
b[i] = 0;
} else if (b[i] > 0 && a[i + 1] - b[i] <= 0) {
b[i] = b[i] - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << 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;
ll sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, n) {
if (a[i] - b[i] > 0) {
a[i] = a[i] - b[i];
sum += b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
sum += a[i];
a[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] > 0) {
a[i + 1] = a[i + 1] - b[i];
sum += b[i];
b[i] = 0;
} else if (b[i] > 0 && a[i + 1] - b[i] <= 0) {
b[i] = b[i] - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,650 | 767,651 | u905170328 | 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;
int sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, n) {
if (a[i] - b[i] > 0) {
a[i] = a[i] - b[i];
sum += b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
sum += a[i];
a[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] > 0) {
a[i + 1] = a[i + 1] - b[i];
sum += b[i];
b[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] <= 0) {
b[i] = b[i] - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << 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;
ll sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, n) {
if (a[i] - b[i] > 0) {
a[i] = a[i] - b[i];
sum += b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
sum += a[i];
a[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] > 0) {
a[i + 1] = a[i + 1] - b[i];
sum += b[i];
b[i] = 0;
} else if (b[i] > 0 && a[i + 1] - b[i] <= 0) {
b[i] = b[i] - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 767,653 | 767,651 | u905170328 | 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;
int sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, n) {
if (a[i] - b[i] > 0) {
a[i] = a[i] - b[i];
sum += b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
sum += a[i];
a[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] > 0) {
a[i + 1] = a[i + 1] - b[i];
sum += b[i];
b[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] <= 0) {
b[i] = b[i] - a[i + 1];
sum += a[i + 1];
a[i] = 0;
}
}
cout << sum << 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;
ll sum = 0;
int a[n + 1];
int b[n];
rep(i, n + 1) {
int x;
cin >> x;
a[i] = x;
}
rep(i, n) {
int x;
cin >> x;
b[i] = x;
}
rep(i, n) {
if (a[i] - b[i] > 0) {
a[i] = a[i] - b[i];
sum += b[i];
b[i] = 0;
} else {
b[i] = b[i] - a[i];
sum += a[i];
a[i] = 0;
}
if (b[i] > 0 && a[i + 1] - b[i] > 0) {
a[i + 1] = a[i + 1] - b[i];
sum += b[i];
b[i] = 0;
} else if (b[i] > 0 && a[i + 1] - b[i] <= 0) {
b[i] = b[i] - a[i + 1];
sum += a[i + 1];
a[i + 1] = 0;
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.change"
] | 767,654 | 767,651 | u905170328 | cpp |
p02959 | #include <bits/stdc++.h>
#define INF 1e9
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++) {
int v;
v = min(A[i], B[i]);
ans += v;
B[i] = max(0, B[i] - A[i]);
v = min(A[i + 1], B[i]);
ans += v;
A[i + 1] = max(0, A[i + 1] - B[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define INF 1e9
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++) {
long v;
v = min(A[i], B[i]);
ans += v;
B[i] = max(0, B[i] - A[i]);
v = min(A[i + 1], B[i]);
ans += v;
A[i + 1] = max(0, A[i + 1] - B[i]);
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,664 | 767,665 | u116002573 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
vector<int> v(N + 1);
rep(i, N + 1) cin >> v[i];
vector<int> v2(N);
rep(i, N) cin >> v2[i];
int ans = 0;
for (int i = 0; i < N; i++) {
if (v[i] <= v2[i]) {
ans += v[i];
v2[i] -= v[i];
if (v[i + 1] >= v2[i]) {
ans += v2[i];
v[i + 1] -= v2[i];
} else {
ans += v[i + 1];
v[i + 1] = 0;
}
} else {
ans += v2[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
// ifstream in("data1.txt");
// cin.rdbuf(in.rdbuf());
int N;
cin >> N;
vector<ll> v(N + 1);
rep(i, N + 1) cin >> v[i];
vector<ll> v2(N);
rep(i, N) cin >> v2[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
if (v[i] <= v2[i]) {
ans += v[i];
v2[i] -= v[i];
if (v[i + 1] >= v2[i]) {
ans += v2[i];
v[i + 1] -= v2[i];
} else {
ans += v[i + 1];
v[i + 1] = 0;
}
} else {
ans += v2[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 767,666 | 767,667 | u154650168 | cpp |
p02959 | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
int A[N + 2] = {0};
for (int i = 1; i <= N + 1; ++i) {
std::cin >> A[i];
}
int B, sum = 0;
for (int i = 1; i <= N; ++i) {
std::cin >> B;
if (B <= A[i]) {
A[i] -= B;
sum += B;
} else {
sum += A[i];
B -= A[i];
A[i] = 0;
if (B <= A[i + 1]) {
A[i + 1] -= B;
sum += B;
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
std::cout << sum << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
int A[N + 2] = {0};
for (int i = 1; i <= N + 1; ++i) {
std::cin >> A[i];
}
int64_t B, sum = 0;
for (int i = 1; i <= N; ++i) {
std::cin >> B;
if (B <= A[i]) {
A[i] -= B;
sum += B;
} else {
sum += A[i];
B -= A[i];
A[i] = 0;
if (B <= A[i + 1]) {
A[i + 1] -= B;
sum += B;
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
std::cout << sum << std::endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,670 | 767,671 | u042751985 | cpp |
p02959 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
vector<int> B(N);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
int result = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
result += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
result += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
result += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
result += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << result << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
#define int long long
using namespace std;
signed main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
vector<int> B(N);
for (auto &a : A) {
cin >> a;
}
for (auto &b : B) {
cin >> b;
}
int result = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
result += B[i];
A[i] -= B[i];
B[i] = 0;
} else {
result += A[i];
B[i] -= A[i];
A[i] = 0;
if (A[i + 1] >= B[i]) {
result += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
result += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << result << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 767,672 | 767,673 | u707760575 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int INF = 1e9;
const ll LLINF = 1e16;
int main(void) {
int n;
int sum = 0;
cin >> n;
vector<int> a(n + 1);
REP(i, n + 1) {
cin >> a[i];
sum += a[i];
}
vector<int> b(n);
REP(i, n) cin >> b[i];
REP(i, n) {
if (a[i] < b[i]) {
a[i + 1] -= min(b[i] - a[i], a[i + 1]);
}
a[i] -= min(a[i], b[i]);
}
int rest = 0;
REP(i, a.size()) { rest += a[i]; }
cout << sum - rest << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int INF = 1e9;
const ll LLINF = 1e16;
int main(void) {
int n;
ll sum = 0;
cin >> n;
vector<int> a(n + 1);
REP(i, n + 1) {
cin >> a[i];
sum += a[i];
}
vector<int> b(n);
REP(i, n) cin >> b[i];
REP(i, n) {
if (a[i] < b[i]) {
a[i + 1] -= min(b[i] - a[i], a[i + 1]);
}
a[i] -= min(a[i], b[i]);
}
ll rest = 0;
REP(i, a.size()) { rest += a[i]; }
cout << sum - rest << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 767,674 | 767,675 | u272997285 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int mn = min(A[i], B[i]);
A[i] -= mn;
B[i] -= mn;
ans += mn;
mn = min(A[i + 1], B[i]);
A[i + 1] -= mn;
B[i] -= mn;
ans += mn;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long long ans = 0;
for (int i = 0; i < N; i++) {
long long mn = min(A[i], B[i]);
A[i] -= mn;
B[i] -= mn;
ans += mn;
mn = min(A[i + 1], B[i]);
A[i + 1] -= mn;
B[i] -= mn;
ans += mn;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,676 | 767,677 | u261886891 | cpp |
p02959 | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << x << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 30;
constexpr lint INFL = 1LL << 62;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
lint sum1 = 0;
vector<int> ac = a, bc = b;
rrep(i, n) {
sum1 += min(ac[i], bc[i]);
bc[i] = max(0, bc[i] - ac[i]);
sum1 += min(bc[i], ac[i + 1]);
ac[i + 1] = max(0, ac[i + 1] - bc[i]);
}
ac = a, bc = b;
reverse(all(ac));
reverse(all(bc));
lint sum2 = 0;
rrep(i, n) {
sum2 += min(ac[i], bc[i]);
bc[i] = max(0, bc[i] - ac[i]);
sum2 += min(bc[i], ac[i + 1]);
ac[i + 1] = max(0, ac[i + 1] - bc[i]);
}
cout << max(sum1, sum2) << endl;
return 0;
} | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++i)
#define irep1(i, a, n) for (int i = a; i <= (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i >= 1; --i)
#define allrep(X, x) for (auto &&X : x)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "../../Lib/cout_container.hpp"
#define debug(x) cerr << #x " => " << x << endl
#else
#define debug(x) 0
#endif
using lint = long long;
constexpr int INF = 1 << 30;
constexpr lint INFL = 1LL << 62;
constexpr int MOD = (int)1e9 + 7;
constexpr double EPS = 1e-9;
using namespace std;
namespace {
struct INIT {
INIT() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} INIT;
} // namespace
int main(void) {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
lint sum1 = 0;
vector<int> ac = a, bc = b;
rep(i, n) {
sum1 += min(ac[i], bc[i]);
bc[i] = max(0, bc[i] - ac[i]);
sum1 += min(bc[i], ac[i + 1]);
ac[i + 1] = max(0, ac[i + 1] - bc[i]);
}
ac = a, bc = b;
reverse(all(ac));
reverse(all(bc));
lint sum2 = 0;
rep(i, n) {
sum2 += min(ac[i], bc[i]);
bc[i] = max(0, bc[i] - ac[i]);
sum2 += min(bc[i], ac[i + 1]);
ac[i + 1] = max(0, ac[i + 1] - bc[i]);
}
cout << max(sum1, sum2) << endl;
return 0;
} | [
"identifier.change"
] | 767,681 | 767,682 | u020746846 | 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.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i + 1) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 767,683 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long int> a(n + 1);
vector<long int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i + 1) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | [
"variable_declaration.type.narrow.change",
"expression.operation.binary.remove",
"assignment.change"
] | 767,685 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i + 1) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 767,687 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
long int max = 0;
for (int i = 0; i < n; i++) {
if (b.at(i) > a.at(i)) {
max += a.at(i);
b.at(i) = b.at(i) - a.at(i);
if (b.at(i) > a.at(i + 1)) {
max += a.at(i + 1);
a.at(i + 1) = 0;
} else {
max += b.at(i);
a.at(i + 1) -= b.at(i);
}
} else {
max += b.at(i);
a.at(i) -= b.at(i);
}
}
cout << max << endl;
return 0;
} | [
"expression.operation.binary.remove",
"variable_declaration.type.widen.change",
"assignment.change"
] | 767,688 | 767,684 | u720447689 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
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));
/*
if (A.at(i) < B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
if (A.at(i+1) < B.at(i)) {
ans += A.at(i+1);
A.at(i+1) = 0;
}
else {
ans += B.at(i);
A.at(i+1) -= B.at(i);
}
}
else {
ans += B.at(i);
A.at(i) -= B.at(i);
}
*/
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long ans = 0;
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));
/*
if (A.at(i) < B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
if (A.at(i+1) < B.at(i)) {
ans += A.at(i+1);
A.at(i+1) = 0;
}
else {
ans += B.at(i);
A.at(i+1) -= B.at(i);
}
}
else {
ans += B.at(i);
A.at(i) -= B.at(i);
}
*/
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,690 | 767,691 | u425019904 | 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;
int ability, kill1, kill2;
for (int i = 0; i < n; i++) {
ability = b.at(i);
kill1 = min(a.at(i), ability);
kill2 = min(a.at(i + 1), ability - kill1);
ans += kill1 + kill2;
a.at(i + 1) -= kill2;
}
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);
int64_t ans = 0; // int型だと桁が足りない？
int ability, kill1, kill2;
for (int i = 0; i < n; i++) {
ability = b.at(i);
kill1 = min(a.at(i), ability);
kill2 = min(a.at(i + 1), ability - kill1);
ans += kill1 + kill2;
a.at(i + 1) -= kill2;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,692 | 767,693 | u661308718 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
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, f1, f2 = 0;
for (int i = 0; i < n; i++) {
f1 = min(a[i] - f2, b[i]);
f2 = min(a[i + 1], b[i] - f1);
ans += (f1 + f2);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
long long a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0, f1, f2 = 0;
for (int i = 0; i < n; i++) {
f1 = min(a[i] - f2, b[i]);
f2 = min(a[i + 1], b[i] - f1);
ans += (f1 + f2);
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,694 | 767,695 | u760628894 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A.at(i);
}
for (int j = 0; j < n; j++) {
cin >> B.at(j);
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (A.at(i) > B.at(i)) {
ans += B.at(i);
continue;
} else if (A.at(i) < B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
if (A.at(i + 1) > B.at(i)) {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
} else if (A.at(i + 1) < B.at(i)) {
ans += A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i + 1) == B.at(i)) {
ans += A.at(i + 1);
A.at(i + 1) = 0;
}
continue;
} else if (A.at(i) == B.at(i)) {
ans += A.at(i);
continue;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
for (int i = 0; i < n + 1; i++) {
cin >> A.at(i);
}
for (int j = 0; j < n; j++) {
cin >> B.at(j);
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if (A.at(i) > B.at(i)) {
ans += B.at(i);
continue;
} else if (A.at(i) < B.at(i)) {
ans += A.at(i);
B.at(i) -= A.at(i);
if (A.at(i + 1) > B.at(i)) {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
} else if (A.at(i + 1) < B.at(i)) {
ans += A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i + 1) == B.at(i)) {
ans += A.at(i + 1);
A.at(i + 1) = 0;
}
continue;
} else if (A.at(i) == B.at(i)) {
ans += A.at(i);
continue;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,696 | 767,697 | u690326065 | cpp |
p02959 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
static const int MAX = 100002;
int main(int argc, const char *argv[]) {
// input from txt
/////////
// write//
/////////
int n;
ll *a, *b;
a = new ll[MAX];
b = new ll[MAX];
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n + 1] = 0;
int res = 0;
rep(i, n) {
if (b[i] > a[i]) {
res += a[i];
b[i] -= a[i];
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
res += b[i];
} else {
res += a[i + 1];
a[i + 1] = 0;
}
} else {
res += b[i];
}
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define sz(x) int(x.size())
typedef long long ll;
using namespace std;
static const int MAX = 100002;
int main(int argc, const char *argv[]) {
// input from txt
/////////
// write//
/////////
int n;
ll *a, *b;
a = new ll[MAX];
b = new ll[MAX];
cin >> n;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n + 1] = 0;
ll res = 0;
rep(i, n) {
if (b[i] > a[i]) {
res += a[i];
b[i] -= a[i];
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
res += b[i];
} else {
res += a[i + 1];
a[i + 1] = 0;
}
} else {
res += b[i];
}
}
cout << res << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 767,698 | 767,699 | u895382169 | cpp |
p02959 | #include <iostream>
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 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]) { // a[i]を倒した時
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) { // a[i]とa[i+1]を倒した時
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else { // a[i]は倒せたがa[i+1]は倒せなかった時
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
} else { // a[i]が倒せなかった時
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
// 出力
cout << ans << endl;
return 0;
} | #include <iostream>
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 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]) { // a[i]を倒した時
ans += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] <= b[i]) { // a[i]とa[i+1]を倒した時
ans += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else { // a[i]は倒せたがa[i+1]は倒せなかった時
ans += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
} else { // a[i]が倒せなかった時
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
// 出力
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 767,700 | 767,701 | u135358384 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
vector<int64_t> b(n);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int ans = 0;
for (int i = 0; i < n; i++) {
int p = min(a.at(i), b.at(i));
ans += p;
a.at(i) -= p;
b.at(i) -= p;
int q = min(a.at(i + 1), b.at(i));
ans += q;
a.at(i + 1) -= q;
b.at(i) -= q;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int64_t> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
vector<int64_t> b(n);
for (int i = 0; i < n; i++)
cin >> b.at(i);
int64_t ans = 0;
for (int i = 0; i < n; i++) {
int p = min(a.at(i), b.at(i));
ans += p;
a.at(i) -= p;
b.at(i) -= p;
int q = min(a.at(i + 1), b.at(i));
ans += q;
a.at(i + 1) -= q;
b.at(i) -= q;
}
cout << ans;
} | [
"variable_declaration.type.primitive.change"
] | 767,710 | 767,711 | u009870106 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int c = 0;
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &vec : a)
cin >> vec;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (a[i] - b < 0) {
c += a[i];
b -= a[i];
if (a[i + 1] - b < 0) {
c += a[i + 1];
a[i + 1] = 0;
continue;
}
a[i + 1] -= b;
c += b;
continue;
}
c += b;
}
cout << c << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long int c = 0;
int n;
cin >> n;
vector<int> a(n + 1);
for (auto &vec : a)
cin >> vec;
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
if (a[i] - b < 0) {
c += a[i];
b -= a[i];
if (a[i + 1] - b < 0) {
c += a[i + 1];
a[i + 1] = 0;
continue;
}
a[i + 1] -= b;
c += b;
continue;
}
c += b;
}
cout << c << endl;
} | [
"variable_declaration.type.widen.change"
] | 767,714 | 767,715 | u967915578 | cpp |
p02959 | //============================================================================
// Name : abc135c.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
int countm = 0;
for (int i = 0; i < N; ++i) {
int b;
cin >> b;
if (A[i] < b) {
if (A[i + 1] < (b - A[i])) {
countm += A[i + 1] + A[i];
A[i + 1] = 0;
} else {
countm += b;
A[i + 1] -= (b - A[i]);
}
A[i] = 0;
} else {
countm += b;
}
}
cout << countm << endl;
return 0;
}
| //============================================================================
// Name : abc135c.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
for (int i = 0; i <= N; ++i) {
cin >> A[i];
}
long long countm = 0;
for (int i = 0; i < N; ++i) {
long long b;
cin >> b;
if (A[i] < b) {
if (A[i + 1] < (b - A[i])) {
countm += A[i + 1] + A[i];
A[i + 1] = 0;
} else {
countm += b;
A[i + 1] -= (b - A[i]);
}
A[i] = 0;
} else {
countm += b;
}
}
cout << countm << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,721 | 767,722 | u055685044 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] >= b[i]) {
ans += b[i];
} else {
a[i + 1] -= b[i] - a[i];
ans += b[i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
if ((a[i] + a[i + 1]) <= b[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else if (a[i] >= b[i]) {
ans += b[i];
} else {
a[i + 1] -= b[i] - a[i];
ans += b[i];
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,725 | 767,726 | u103850114 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
int m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i], b[i]);
ans += m;
a[i] -= m;
b[i] -= m;
m = min(a[i + 1], b[i]);
ans += m;
a[i + 1] -= m;
b[i] -= m;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int64_t ans = 0;
int64_t m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i], b[i]);
ans += m;
a[i] -= m;
b[i] -= m;
m = min(a[i + 1], b[i]);
ans += m;
a[i + 1] -= m;
b[i] -= m;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,727 | 767,728 | u103850114 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
int m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i], b[i]);
ans += m;
a[i] -= m;
b[i] -= m;
m = min(a[i + 1], b[i]);
ans += m;
a[i + 1] -= m;
b[i] -= m;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
long long m = 0;
for (int i = 0; i < n; i++) {
m = min(a[i], b[i]);
ans += m;
a[i] -= m;
b[i] -= m;
m = min(a[i + 1], b[i]);
ans += m;
a[i + 1] -= m;
b[i] -= m;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,727 | 767,729 | u103850114 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.