problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n + 1) {
int min1 = min(a[i], b[i]);
a[i] -= min1;
b[i] -= min1;
ans += min1;
int min2 = min(a[i + 1], b[i]);
a[i + 1] -= min2;
b[i] -= min2;
ans += min2;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
rep(i, n) {
ll min1 = min(a[i], b[i]);
a[i] -= min1;
b[i] -= min1;
ans += min1;
ll min2 = min(a[i + 1], b[i]);
a[i + 1] -= min2;
b[i] -= min2;
ans += min2;
}
cout << ans << endl;
} | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 766,794 | 766,793 | u233586402 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
int max_mon = 0;
rep(i, N) {
if (B.at(i) <= A.at(i))
max_mon += B.at(i);
else if (B.at(i) >= A.at(i) + A.at(i + 1)) {
max_mon += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else {
max_mon += B.at(i);
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
}
}
cout << max_mon << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<ll> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
ll max_mon = 0;
rep(i, N) {
if (B.at(i) <= A.at(i))
max_mon += B.at(i);
else if (B.at(i) >= A.at(i) + A.at(i + 1)) {
max_mon += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else {
max_mon += B.at(i);
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
}
}
cout << max_mon << endl;
}
| [
"variable_declaration.type.change"
] | 766,798 | 766,799 | u433189059 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, i, m = 0;
cin >> N;
vector<int> tHero(N);
vector<int> tEnemy(N + 1);
for (i = 0; i < N + 1; ++i)
cin >> tEnemy.at(i);
for (i = 0; i < N; ++i)
cin >> tHero.at(i);
for (i = 0; i < N; ++i) {
if (tEnemy.at(i) >= tHero.at(i))
m += tHero.at(i);
else {
m += tEnemy.at(i);
tHero.at(i) -= tEnemy.at(i);
if (tEnemy.at(i + 1) >= tHero.at(i)) {
m += tHero.at(i);
tEnemy.at(i + 1) -= tHero.at(i);
} else {
m += tEnemy.at(i + 1);
tEnemy.at(i + 1) = 0;
}
}
}
cout << m;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, i, m = 0;
cin >> N;
vector<long> tHero(N);
vector<long> tEnemy(N + 1);
for (i = 0; i < N + 1; ++i)
cin >> tEnemy.at(i);
for (i = 0; i < N; ++i)
cin >> tHero.at(i);
for (i = 0; i < N; ++i) {
if (tEnemy.at(i) >= tHero.at(i))
m += tHero.at(i);
else {
m += tEnemy.at(i);
tHero.at(i) -= tEnemy.at(i);
if (tEnemy.at(i + 1) >= tHero.at(i)) {
m += tHero.at(i);
tEnemy.at(i + 1) -= tHero.at(i);
} else {
m += tEnemy.at(i + 1);
tEnemy.at(i + 1) = 0;
}
}
}
cout << m;
}
| [
"variable_declaration.type.primitive.change"
] | 766,800 | 766,801 | u089241640 | cpp |
p02959 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back(k, v)
#define ct(res) cout << res << "\n";
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
const int INF = 1e9;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pow_kai(ll a, ll n) {
ll x = 1;
while (n > 0) {
if (n & 1) {
x = x * a;
}
a = a * a;
n >>= 1;
}
return x;
}
using Graph = vector<vector<int>>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> A(n + 1);
vector<int> B(n);
rep(i, n + 1) cin >> A[i];
rep(i, n) cin >> B[i];
int sum = 0;
rep(i, n) {
if (A[i] >= B[i]) {
sum += B[i];
continue;
} else {
sum += A[i];
B[i] -= A[i];
}
if (A[i + 1] >= B[i]) {
sum += B[i];
A[i + 1] -= B[i];
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
cout << sum << "\n";
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
#define eb(k, v) emplace_back(k, v)
#define ct(res) cout << res << "\n";
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
const int INF = 1e9;
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pow_kai(ll a, ll n) {
ll x = 1;
while (n > 0) {
if (n & 1) {
x = x * a;
}
a = a * a;
n >>= 1;
}
return x;
}
using Graph = vector<vector<int>>;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
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 sum = 0;
rep(i, n) {
if (A[i] >= B[i]) {
sum += B[i];
continue;
} else {
sum += A[i];
B[i] -= A[i];
}
if (A[i + 1] >= B[i]) {
sum += B[i];
A[i + 1] -= B[i];
} else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
cout << sum << "\n";
} | [
"variable_declaration.type.change"
] | 766,802 | 766,803 | u673981655 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> A(n + 1), B(n);
rep(i, n + 1) cin >> A.at(i);
rep(i, n) cin >> B.at(i);
int ans = 0;
rep(i, n) {
if (B.at(i) >= A.at(i)) {
if (A.at(i + 1) >= B.at(i) - A.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
ans += B.at(i);
} else {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
} else {
ans += B.at(i);
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<intll> A(n + 1), B(n);
rep(i, n + 1) cin >> A.at(i);
rep(i, n) cin >> B.at(i);
intll ans = 0;
rep(i, n) {
if (B.at(i) >= A.at(i)) {
if (A.at(i + 1) >= B.at(i) - A.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
ans += B.at(i);
} else {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
}
} else {
ans += B.at(i);
}
}
cout << ans;
}
| [
"variable_declaration.type.change"
] | 766,804 | 766,805 | u260907804 | cpp |
p02959 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dlog(x) cerr << #x << '=' << x << endl
#define f first
#define s second
#define endl '\n'
#define sq(x) (x) * (x)*1ll
// typedef tree<int,null_type,less_equal<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_multiset;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("test_input.txt", "r", stdin);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dlog(x) cerr << #x << '=' << x << endl
#define f first
#define s second
#define endl '\n'
#define sq(x) (x) * (x)*1ll
// typedef tree<int,null_type,less_equal<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_multiset;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("test_input.txt", "r", stdin);
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans;
return 0;
} | [
"variable_declaration.remove",
"variable_declaration.type.change"
] | 766,806 | 766,807 | u093681822 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (B.at(i) <= A.at(i)) {
ans += B.at(i);
A.at(i) -= B.at(i);
} else if (A.at(i) < B.at(i) && B.at(i) < A.at(i) + A.at(i + 1)) {
ans += B.at(i);
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
A.at(i) = 0;
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
ans += A.at(i) + A.at(i + 1);
A.at(i) = 0;
A.at(i + 1) = 0;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long ans = 0;
cin >> N;
vector<long long> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
for (int i = 0; i < N; i++) {
if (B.at(i) <= A.at(i)) {
ans += B.at(i);
A.at(i) -= B.at(i);
} else if (A.at(i) < B.at(i) && B.at(i) < A.at(i) + A.at(i + 1)) {
ans += B.at(i);
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
A.at(i) = 0;
} else if (A.at(i) + A.at(i + 1) <= B.at(i)) {
ans += A.at(i) + A.at(i + 1);
A.at(i) = 0;
A.at(i + 1) = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 766,809 | 766,810 | u407814609 | cpp |
p02959 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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);
}
int m = 0;
for (int i = 0; i < N; i++) {
cin >> B.at(i);
m += B.at(i);
}
for (int i = 0; i < N; i++) {
B.at(i) -= min(B.at(i), A.at(i));
int n = min(B.at(i), A.at(i + 1));
B.at(i) -= n;
A.at(i + 1) -= n;
}
int x = 0;
for (int i = 0; i < N; i++) {
x += B.at(i);
}
cout << m - x << endl;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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);
}
ll m = 0;
for (int i = 0; i < N; i++) {
cin >> B.at(i);
m += B.at(i);
}
for (int i = 0; i < N; i++) {
B.at(i) -= min(B.at(i), A.at(i));
ll n = min(B.at(i), A.at(i + 1));
B.at(i) -= n;
A.at(i + 1) -= n;
}
ll x = 0;
for (int i = 0; i < N; i++) {
x += B.at(i);
}
cout << m - x << endl;
} | [
"variable_declaration.type.change"
] | 766,816 | 766,817 | u455266724 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, n) \
; \
for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define f(i, a, b) for (int i = a; i < b; i++)
#define MOD 1000000007
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd_ll(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int abs(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
ll fiv(ll n) {
if (n == 0) {
return 1;
} else if (n == 1) {
return 1;
}
return fiv(n - 1) + fiv(n - 2);
}
ll conbi(int n, int m) {
cin >> n >> m;
vector<ll> a(100);
a[0] = 1;
for (int i = 0; i < 14; i++) {
a[i + 1] = a[i] * (i + 1);
}
return a[n] / (a[m] * a[n - m]);
}
int main() {
int n;
cin >> n;
vl a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
vl c(n);
c[0] = 0;
rep(i, n) {
c[i + 1] = min(a[i + 1], b[i] - min(a[i] - c[i], b[i]));
ans += min(a[i] - c[i], b[i]) + c[i + 1];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, n) \
; \
for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define f(i, a, b) for (int i = a; i < b; i++)
#define MOD 1000000007
bool is_int_lround(double x) { return std::lround(x) == x; }
int ketasuu(int x) {
int n = 0;
while (x > 0) {
x /= 10;
n++;
}
return n;
}
ll gcd_ll(ll x, ll y) {
long long a = max(x, y), b = min(x, y), c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
int abs(int x, int y) {
if (x >= y) {
return x - y;
} else if (y > x) {
return y - x;
}
}
ll fiv(ll n) {
if (n == 0) {
return 1;
} else if (n == 1) {
return 1;
}
return fiv(n - 1) + fiv(n - 2);
}
ll conbi(int n, int m) {
cin >> n >> m;
vector<ll> a(100);
a[0] = 1;
for (int i = 0; i < 14; i++) {
a[i + 1] = a[i] * (i + 1);
}
return a[n] / (a[m] * a[n - m]);
}
int main() {
int n;
cin >> n;
vl a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
vl c(n + 1);
c[0] = 0;
rep(i, n) {
c[i + 1] = min(a[i + 1], b[i] - min(a[i] - c[i], b[i]));
ans += min(a[i] - c[i], b[i]) + c[i + 1];
}
cout << ans << endl;
}
| [
"assignment.change"
] | 766,818 | 766,819 | u776056110 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i])
count += 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;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i])
count += 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;
}
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,820 | 766,821 | u584520839 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i])
count += 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;
}
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1] = {};
int B[N] = {};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i])
count += 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;
}
}
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 766,822 | 766,821 | u584520839 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
cnt += A.at(i);
if (A.at(i + 1) >= B.at(i) - A.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
cnt += B.at(i) - A.at(i);
} else {
cnt += A.at(i + 1);
A.at(i + 1) = 0;
}
} else {
cnt += B.at(i);
A.at(i) -= B.at(i);
}
}
cout << cnt << 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 cnt = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
cnt += A.at(i);
if (A.at(i + 1) >= B.at(i) - A.at(i)) {
A.at(i + 1) -= B.at(i) - A.at(i);
cnt += B.at(i) - A.at(i);
} else {
cnt += A.at(i + 1);
A.at(i + 1) = 0;
}
} else {
cnt += B.at(i);
A.at(i) -= B.at(i);
}
}
cout << cnt << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,825 | 766,826 | u454330046 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
vector<long> a(n + 1);
vector<long> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) <= b.at(i)) {
b.at(i) -= a.at(i);
ans += 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 + i) -= b.at(i);
};
} else {
ans += b.at(i);
};
};
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
vector<long> a(n + 1);
vector<long> b(n);
for (int i = 0; i < n + 1; i++)
cin >> a.at(i);
for (int i = 0; i < n; i++)
cin >> b.at(i);
for (int i = 0; i < n; i++) {
if (a.at(i) <= b.at(i)) {
b.at(i) -= a.at(i);
ans += 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);
};
};
cout << ans << endl;
} | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,831 | 766,832 | u966257731 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
sum += B[i];
} else {
sum += A[i];
if (A[i + 1] >= B[i] - A[i]) {
sum += B[i] - A[i];
A[i + 1] -= B[i] - A[i];
}
else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
ll A[N + 1], B[N];
for (int i = 0; i <= N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
ll sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
sum += B[i];
} else {
sum += A[i];
if (A[i + 1] >= B[i] - A[i]) {
sum += B[i] - A[i];
A[i + 1] -= B[i] - A[i];
}
else {
sum += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,833 | 766,834 | u241312295 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int result = 0;
for (int i = (n - 1); i >= 0; i--) {
int diff = min(a[i + 1], b[i]);
a[i + 1] -= diff;
b[i] -= diff;
result += diff;
int diff2 = min(a[i], b[i]);
a[i] -= diff2;
b[i] -= diff2;
result += diff2;
}
cout << result << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll result = 0;
for (int i = (n - 1); i >= 0; i--) {
int diff = min(a[i + 1], b[i]);
a[i + 1] -= diff;
b[i] -= diff;
result += diff;
int diff2 = min(a[i], b[i]);
a[i] -= diff2;
b[i] -= diff2;
result += diff2;
}
cout << result << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,836 | 766,837 | u011438316 | cpp |
p02959 | #include <cmath>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; ++i)
std::cin >> A.at(i);
std::vector<int> B(N + 1, 0);
for (int i = 0; i < N; ++i)
std::cin >> B.at(i);
int answer = 0, carry = 0;
for (int i = 0; i < N + 1; ++i) {
answer += std::min(A.at(i), carry);
A.at(i) = A.at(i) >= carry ? A.at(i) - carry : 0;
answer += std::min(A.at(i), B.at(i));
carry = B.at(i) >= A.at(i) ? B.at(i) - A.at(i) : 0;
}
std::cout << answer << "\n";
} | #include <cmath>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<long long> A(N + 1, 0);
for (int i = 0; i < N + 1; ++i)
std::cin >> A.at(i);
std::vector<long long> B(N + 1, 0);
for (int i = 0; i < N; ++i)
std::cin >> B.at(i);
long long answer = 0, carry = 0;
for (int i = 0; i < N + 1; ++i) {
answer += std::min(A.at(i), carry);
A.at(i) = A.at(i) >= carry ? A.at(i) - carry : 0;
answer += std::min(A.at(i), B.at(i));
carry = B.at(i) >= A.at(i) ? B.at(i) - A.at(i) : 0;
}
std::cout << answer << "\n";
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,838 | 766,839 | u930737792 | cpp |
p02959 | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int ans = 0;
rep(i, n) {
ans += min(a[i] + a[i + 1], b[i]);
if (a[i] < b[i]) {
a[i + 1] -= (b[i] - a[i]);
if (a[i + 1] < 0) {
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<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) {
ans += min(a[i] + a[i + 1], b[i]);
if (a[i] < b[i]) {
a[i + 1] -= (b[i] - a[i]);
if (a[i + 1] < 0) {
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,844 | 766,845 | u602267597 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans = ans + A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] > A[i]) {
ans = ans + B[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
ans = ans + B[i];
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
long long int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans = ans + A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] > A[i]) {
ans = ans + B[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
ans = ans + B[i];
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 766,846 | 766,847 | u231455327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i]) {
ans = ans + A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] > A[i]) {
ans = ans + B[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
ans = ans + B[i];
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
long long int wa = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
wa = wa + A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans = ans + A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] > A[i]) {
ans = ans + B[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
ans = ans + B[i];
}
}
cout << ans;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 766,848 | 766,847 | u231455327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans = ans + A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] > A[i]) {
ans = ans + B[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
ans = ans + B[i];
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<long long int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i] + A[i + 1]) {
ans = ans + A[i] + A[i + 1];
A[i + 1] = 0;
} else if (B[i] > A[i]) {
ans = ans + B[i];
A[i + 1] = A[i + 1] - (B[i] - A[i]);
} else {
ans = ans + B[i];
}
}
cout << ans;
return 0;
}
| [
"variable_declaration.type.widen.change"
] | 766,849 | 766,850 | u231455327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i) - K.at(i) >= 0) { // １体も頃せない
B += K.at(i);
} else if (T.at(i + 1) + (T.at(i) - K.at(i)) <= 0) { // ２たいともころせる
B += T.at(i) + T.at(i + 1);
T.at(i + 1) = 0;
} else { // 1たいしかころせない
B += K.at(i);
T.at(i + 1) += (T.at(i) - K.at(i));
}
}
cout << B << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
long long int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i) - K.at(i) >= 0) { // １体も頃せない
B += K.at(i);
} else if (T.at(i + 1) + (T.at(i) - K.at(i)) <= 0) { // ２たいともころせる
B += T.at(i) + T.at(i + 1);
T.at(i + 1) = 0;
} else { // 1たいしかころせない
B += K.at(i);
T.at(i + 1) += (T.at(i) - K.at(i));
}
}
cout << B << endl;
} | [
"variable_declaration.type.widen.change"
] | 766,851 | 766,852 | u697858600 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i) - K.at(i) >= 0) { // １体も頃せない
B += K.at(i);
} else if (T.at(i + 1) + (T.at(i) - K.at(i)) <= 0) { // ２たいともころせる
B = B + T.at(i) + T.at(i + 1);
T.at(i + 1) = 0;
} else { // 1たいしかころせない
B += K.at(i);
T.at(i + 1) += (T.at(i) - K.at(i));
}
}
cout << B << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
long long int B = 0;
cin >> A;
vector<long long int> T(A + 1);
vector<int> K(A);
for (int i = 0; i < A + 1; i++) {
cin >> T.at(i);
}
for (int i = 0; i < A; i++) {
cin >> K.at(i);
}
for (int i = 0; i < A; i++) {
if (T.at(i) - K.at(i) >= 0) { // １体も頃せない
B += K.at(i);
} else if (T.at(i + 1) + (T.at(i) - K.at(i)) <= 0) { // ２たいともころせる
B += T.at(i) + T.at(i + 1);
T.at(i + 1) = 0;
} else { // 1たいしかころせない
B += K.at(i);
T.at(i + 1) += (T.at(i) - K.at(i));
}
}
cout << B << endl;
} | [
"assignment.value.change",
"expression.operation.binary.remove"
] | 766,853 | 766,852 | u697858600 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) { //一つも殺せない
count += B.at(i);
} else if (B.at(i) - A.at(i) + A.at(i + 1) <= 0) { //二つとも殺せる
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else { //一つ目は殺せるが二つ目が殺せない
count += B.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) { //一つも殺せない
count += B.at(i);
} else if (B.at(i) - A.at(i) - A.at(i + 1) >= 0) { //二つとも殺せる
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else { //一つ目は殺せるが二つ目が殺せない
count += B.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
}
}
cout << count << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 766,854 | 766,855 | u288432959 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) { //一つも殺せない or ちょうど殺せる
count += B.at(i);
} else if (B.at(i) - A.at(i) + A.at(i + 1) <= 0) { //二つとも殺せる
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else { //一つ目は殺せるが二つ目が殺せない
count -= B.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long int count = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) - B.at(i) >= 0) { //一つも殺せない
count += B.at(i);
} else if (B.at(i) - A.at(i) - A.at(i + 1) >= 0) { //二つとも殺せる
count += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else { //一つ目は殺せるが二つ目が殺せない
count += B.at(i);
A.at(i + 1) -= B.at(i) - A.at(i);
}
}
cout << count << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"expression.operator.change"
] | 766,856 | 766,855 | u288432959 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS 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;
ll prev = 0;
REP(i, n) {
ans += min(a[i], b[i] + prev);
prev = b[i] - max(0LL, a[i] - prev);
}
ans += min(a[n], prev);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS 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;
ll prev = 0;
REP(i, n) {
ans += min(a[i], b[i] + prev);
prev = max(0LL, b[i] - max(0LL, a[i] - prev));
}
ans += min(a[n], prev);
cout << ans << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 766,859 | 766,860 | u330661451 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int res = 0;
rep(i, n) {
if (a[i] >= b[i])
res += b[i];
else {
res += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
res += b[i];
a[i + 1] -= b[i];
} else {
res += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll res = 0;
rep(i, n) {
if (a[i] >= b[i])
res += b[i];
else {
res += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
res += b[i];
a[i + 1] -= b[i];
} else {
res += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,863 | 766,864 | u374051158 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
if (a[i] + a[i + 1] < b[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
}
} else {
ans += b[i];
}
// cout<<ans<<endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
if (a[i] + a[i + 1] < b[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
}
} else {
ans += b[i];
}
// cout<<ans<<endl;
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,865 | 766,866 | u720321944 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
if (a[i] + a[i + 1] < b[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i] - a[i];
}
} else {
ans += b[i];
}
// cout<<ans<<endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, b) for (int i = a; i < b; i++)
#define each(it, v) for (auto it : v)
#define mod 1000000007
#define all(v) (v).begin(), (v).end()
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int, int>>
#define vv vector<vector<int>>
using namespace std;
main() {
int n;
cin >> n;
int a[n + 1], b[n];
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] < b[i]) {
if (a[i] + a[i + 1] < b[i]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= (b[i] - a[i]);
}
} else {
ans += b[i];
}
// cout<<ans<<endl;
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,867 | 766,866 | u720321944 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N, 0);
for (int i = 0; i < N; i++)
cin >> B[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int beat1 = min(A[i], B[i]);
A[i] -= beat1;
B[i] -= beat1;
int beat2 = min(A[i + 1], B[i]);
A[i + 1] -= beat2;
B[i] -= beat2;
ans += beat1 + beat2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N, 0);
for (int i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll beat1 = min(A[i], B[i]);
A[i] -= beat1;
B[i] -= beat1;
ll beat2 = min(A[i + 1], B[i]);
A[i + 1] -= beat2;
B[i] -= beat2;
ans += beat1 + beat2;
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,868 | 766,869 | u119098168 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mem(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) {
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a * b) % MOD;
}
inline ll modAdd(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a + b) % MOD;
}
inline ll modSub(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
}
inline ll modInverse(ll a) { return modPow(a, MOD - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vi a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int cnt = 0;
rep(i, n) {
if (a[i] < b[i]) {
cnt += a[i];
if (a[i + 1] - (b[i] - a[i]) > 0) {
a[i + 1] = a[i + 1] - (b[i] - a[i]);
cnt += b[i] - a[i];
} else {
cnt += a[i + 1];
a[i + 1] = 0;
}
} else {
cnt += b[i];
}
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mem(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) {
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a * b) % MOD;
}
inline ll modAdd(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a + b) % MOD;
}
inline ll modSub(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
}
inline ll modInverse(ll a) { return modPow(a, MOD - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int main() {
int n;
cin >> n;
vl a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
rep(i, n) {
if (a[i] < b[i]) {
cnt += a[i];
if (a[i + 1] - (b[i] - a[i]) > 0) {
a[i + 1] = a[i + 1] - (b[i] - a[i]);
cnt += b[i] - a[i];
} else {
cnt += a[i + 1];
a[i + 1] = 0;
}
} else {
cnt += b[i];
}
}
cout << cnt;
} | [
"variable_declaration.type.change"
] | 766,872 | 766,873 | u789323170 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<ll> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
A[i] -= B[i];
B[i] = 0;
} else // B[i]>=A[i]
{
count += A[i];
B[i] -= A[i];
A[i] = 0;
if (B[i] < A[i + 1]) {
count += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
count += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
}
cout << count << endl;
return 0;
}
// cout << setprecision(13);
// next_permutation(v.begin(), v.end());
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<ll> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
ll count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
A[i] -= B[i];
B[i] = 0;
} else // B[i]>=A[i]
{
count += A[i];
B[i] -= A[i];
A[i] = 0;
}
if (B[i] < A[i + 1]) {
count += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
count += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
return 0;
}
// cout << setprecision(13);
// next_permutation(v.begin(), v.end());
| [
"variable_declaration.type.change"
] | 766,878 | 766,879 | u005906204 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<ll> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
A[i] -= B[i];
B[i] = 0;
} else // B[i]>=A[i]
{
count += A[i];
B[i] -= A[i];
A[i] = 0;
}
if (B[i] < A[i + 1]) {
count += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
count += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
return 0;
}
// cout << setprecision(13);
// next_permutation(v.begin(), v.end());
| #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N;
cin >> N;
vector<ll> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<ll> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
ll count = 0;
for (int i = 0; i < N; i++) {
if (B[i] < A[i]) {
count += B[i];
A[i] -= B[i];
B[i] = 0;
} else // B[i]>=A[i]
{
count += A[i];
B[i] -= A[i];
A[i] = 0;
}
if (B[i] < A[i + 1]) {
count += B[i];
A[i + 1] -= B[i];
B[i] = 0;
} else {
count += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
return 0;
}
// cout << setprecision(13);
// next_permutation(v.begin(), v.end());
| [
"variable_declaration.type.change"
] | 766,880 | 766,879 | u005906204 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vvvd = vector<vector<vector<double>>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pint = pair<int, int>;
using Graph = vvi;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vll a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
ll dmg = 0;
for (int j = i; j <= i + 1; j++) {
dmg = min(a[j], b[i]);
a[i] -= dmg;
b[i] -= dmg;
ans += dmg;
if (b[i] == 0)
break;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vvvll = vector<vector<vector<ll>>>;
using vd = vector<double>;
using vvd = vector<vector<double>>;
using vvvd = vector<vector<vector<double>>>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vs = vector<string>;
using pint = pair<int, int>;
using Graph = vvi;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vll a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
ll dmg = 0;
for (int j = i; j <= i + 1; j++) {
dmg = min(a[j], b[i]);
a[j] -= dmg;
b[i] -= dmg;
ans += dmg;
if (b[i] == 0)
break;
}
}
cout << ans << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 766,883 | 766,884 | u682395093 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
rep0(i, n) cin >> a[i];
int ans = 0;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] - b[i] <= 0) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] - b[i] <= 0) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
rep0(i, n) cin >> a[i];
ll ans = 0;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] - b[i] <= 0) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] - b[i] <= 0) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,887 | 766,888 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
rep0(i, n) cin >> a[i];
int ans = 0;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] - b[i] <= 0) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] - b[i] <= 0) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep0(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
rep0(i, n) cin >> a[i];
ll ans = 0;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] - b[i] <= 0) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] - b[i] <= 0) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
ans += b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,889 | 766,888 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i];
} else {
co += A[i];
B[i] -= A[i];
if (B[i] <= A[i + 1]) {
co += B[i];
A[i + 1] -= B[i];
} else {
co += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << co << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long long co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i];
} else {
co += A[i];
B[i] -= A[i];
if (B[i] <= A[i + 1]) {
co += B[i];
A[i + 1] -= B[i];
} else {
co += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << co << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,892 | 766,893 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
int co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i];
} else {
co += A[i];
B[i] -= A[i];
if (B[i] <= A[i]) {
co += B[i];
A[i + 1] -= B[i];
} else {
co += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << co << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long A[n + 1];
long long B[n];
for (int i = 0; i <= n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
cin >> B[i];
}
long long co = 0;
for (int i = 0; i < n; i++) {
if (B[i] <= A[i]) {
co += B[i];
} else {
co += A[i];
B[i] -= A[i];
if (B[i] <= A[i + 1]) {
co += B[i];
A[i + 1] -= B[i];
} else {
co += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << co << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 766,894 | 766,893 | u338193317 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n, res = 0;
cin >> n;
int a[n + 1], b;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] < b) {
res += a[i];
b -= a[i];
if (a[i + 1] < b) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b;
a[i + 1] -= b;
}
} else {
res += b;
}
}
cout << res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long n, res = 0;
cin >> n;
long long a[n + 1], b;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] < b) {
res += a[i];
b -= a[i];
if (a[i + 1] < b) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b;
a[i + 1] -= b;
}
} else {
res += b;
}
}
cout << res;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,895 | 766,896 | u058348416 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
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];
int res = 0;
rep(i, N) {
if (A[i] >= B[i]) {
res += B[i];
} else {
res += A[i];
B[i] -= A[i];
ll attack = min(B[i], A[i + 1]);
A[i + 1] -= attack;
res += attack;
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
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 res = 0;
rep(i, N) {
if (A[i] >= B[i]) {
res += B[i];
} else {
res += A[i];
B[i] -= A[i];
ll attack = min(B[i], A[i + 1]);
A[i + 1] -= attack;
res += attack;
}
}
cout << res << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,897 | 766,898 | u468440139 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<long> b(n);
rep(i, n + 1) cin >> b[i];
b[n] = 0;
long c;
c = 0;
rep(i, n + 1) {
long l = min(a[i], b[i]);
c += l;
long r = min(a[i + 1], b[i] - l);
c += r;
a[i + 1] -= r;
b[i] -= r;
}
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<long> b(n + 1);
rep(i, n) cin >> b[i];
b[n] = 0;
long c;
c = 0;
rep(i, n + 1) {
long l = min(a[i], b[i]);
c += l;
long r = min(a[i + 1], b[i] - l);
c += r;
a[i + 1] -= r;
b[i] -= r;
}
cout << c << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 766,899 | 766,900 | u468440139 | cpp |
p02959 | #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
int sum = 0;
rep(i, n) {
if (b.at(i) > a.at(i) + a.at(i + 1)) {
sum += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else {
sum += b.at(i);
if (a.at(i) < b.at(i))
a.at(i + 1) = a.at(i) + a.at(i + 1) - b.at(i);
}
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
int a = 0, b = 0, c, d, n, k;
string s, t;
int main() {
cin >> n;
vector<int64_t> a(n + 1), b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
int64_t sum = 0;
rep(i, n) {
if (b.at(i) > a.at(i) + a.at(i + 1)) {
sum += a.at(i) + a.at(i + 1);
a.at(i + 1) = 0;
} else {
sum += b.at(i);
if (a.at(i) < b.at(i))
a.at(i + 1) = a.at(i) + a.at(i + 1) - b.at(i);
}
}
cout << sum << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 766,901 | 766,902 | u465760322 | cpp |
p02959 | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define LL long long
#define DS pair<int, int>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
// template<typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
int a[N], b[N];
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
int n;
scanf("%d", &n);
for (int i = 0; i < n + 1; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
LL ans = 0;
for (int i = 0; i < n; i++) {
int m = min(a[i], b[i]);
b[i] -= m;
ans += m;
m = min(a[i + 1], b[i]);
b[i] -= m;
ans += m;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define LL long long
#define DS pair<int, int>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
// template<typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
int a[N], b[N];
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
int n;
scanf("%d", &n);
for (int i = 0; i < n + 1; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < n; i++) {
scanf("%d", b + i);
}
LL ans = 0;
for (int i = 0; i < n; i++) {
int m = min(a[i], b[i]);
b[i] -= m;
ans += m;
m = min(a[i + 1], b[i]);
a[i + 1] -= m;
ans += m;
}
printf("%lld\n", ans);
return 0;
}
| [
"assignment.variable.change",
"identifier.change",
"assignment.change"
] | 766,903 | 766,904 | u382773334 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), 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);
}
b.at(n) = 0;
int ans = 0;
for (int i = 0; i < n + 1; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else if (a.at(i) < b.at(i)) {
ans += a.at(i);
if (i == n)
break;
if (a.at(i + 1) > b.at(i) - a.at(i)) {
a.at(i + 1) -= b.at(i) - a.at(i);
ans += b.at(i) - a.at(i);
} else if (a.at(i + 1) <= b.at(i) - a.at(i)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), 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);
}
b.at(n) = 0;
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else if (a.at(i) < b.at(i)) {
ans += a.at(i);
if (i == n)
break;
if (a.at(i + 1) > b.at(i) - a.at(i)) {
a.at(i + 1) -= b.at(i) - a.at(i);
ans += b.at(i) - a.at(i);
} else if (a.at(i + 1) <= b.at(i) - a.at(i)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,905 | 766,906 | u548778623 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), 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);
}
b.at(n) = 0;
int ans = 0;
for (int i = 0; i < n + 1; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else if (a.at(i) < b.at(i)) {
ans += a.at(i);
if (i == n)
break;
if (a.at(i + 1) > b.at(i) - a.at(i)) {
a.at(i + 1) -= b.at(i) - a.at(i);
ans += b.at(i) - a.at(i);
} else if (a.at(i + 1) <= b.at(i) - a.at(i)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), 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);
}
b.at(n) = 0;
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
if (a.at(i) >= b.at(i)) {
ans += b.at(i);
} else if (a.at(i) < b.at(i)) {
ans += a.at(i);
if (i == n)
break;
if (a.at(i + 1) > b.at(i) - a.at(i)) {
a.at(i + 1) -= b.at(i) - a.at(i);
ans += b.at(i) - a.at(i);
} else if (a.at(i + 1) <= b.at(i) - a.at(i)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,907 | 766,906 | u548778623 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int dec = min(b[i], a[i]);
b[i] -= dec;
ans += dec;
dec = min(b[i], a[i + 1]);
a[i] -= dec;
ans += dec;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i <= n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
int dec = min(b[i], a[i]);
b[i] -= dec;
ans += dec;
dec = min(b[i], a[i + 1]);
a[i + 1] -= dec;
ans += dec;
}
cout << ans << endl;
} | [
"assignment.change"
] | 766,912 | 766,913 | u804999113 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N;
cin >> N;
vector<int> A, B;
rep(i, N + 1) {
int a;
cin >> a;
A.push_back(a);
}
rep(i, N) {
int b;
cin >> b;
B.push_back(b);
}
ll ret = 0;
rep(i, N) {
int b = B[i];
int mn = min(b, A[i]);
ret += mn;
A[i] -= mn;
b -= mn;
int mn2 = min(b, A[i + 1]);
ret += mn2;
A[i] -= mn2;
b -= mn2;
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N;
cin >> N;
vector<int> A, B;
rep(i, N + 1) {
int a;
cin >> a;
A.push_back(a);
}
rep(i, N) {
int b;
cin >> b;
B.push_back(b);
}
ll ret = 0;
rep(i, N) {
int b = B[i];
int mn = min(b, A[i]);
ret += mn;
A[i] -= mn;
b -= mn;
int mn2 = min(b, A[i + 1]);
ret += mn2;
A[i + 1] -= mn2;
b -= mn2;
}
cout << ret << endl;
return 0;
} | [
"assignment.change"
] | 766,914 | 766,915 | u624678037 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
//#include <tuple>
//#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define pb push_back
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) {
// 近くの敵をまず倒す
int t = min(a[i], b[i]);
ans += t;
b[i] -= t;
// 残りの力で倒す
if (i < N) {
t = min(a[i + 1], b[i]);
ans += t;
a[i + 1] -= t;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
//#include <tuple>
//#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define pb push_back
int main() {
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> b(N);
rep(i, N + 1) { cin >> a[i]; }
rep(i, N) { cin >> b[i]; }
ll ans = 0;
rep(i, N) {
// 近くの敵をまず倒す
int t = min(a[i], b[i]);
ans += t;
b[i] -= t;
// 残りの力で倒す
if (i < N) {
t = min(a[i + 1], b[i]);
ans += t;
a[i + 1] -= t;
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.change"
] | 766,916 | 766,917 | u662852612 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
ll ans = 0;
ll rem = 0;
rep(i, n + 1) {
ans += min(a[i], (rem + b[i]));
rem = max(0LL, b[i] - (a[i] - rem)); // b[i] + rem - a[i]);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n + 1);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
b[n] = 0;
ll ans = 0;
ll rem = 0;
rep(i, n + 1) {
ans += min(a[i], (rem + b[i]));
rem = max(0LL, b[i] - max(0LL, (a[i] - rem)));
}
cout << ans << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 766,918 | 766,919 | u213006031 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int a[100050], b;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int tmp = 0, flg = 0;
tmp = a[0];
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] - b < 0) {
if (a[i + 1] - (b - a[i]) < 0) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt += a[i] + (b - a[i]);
a[i + 1] -= (b - a[i]);
}
} else {
cnt += b;
}
}
cout << cnt << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a[100050], b;
int main() {
int n;
cin >> n;
long long cnt = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int tmp = 0, flg = 0;
tmp = a[0];
for (int i = 0; i < n; i++) {
cin >> b;
if (a[i] - b < 0) {
if (a[i + 1] - (b - a[i]) < 0) {
cnt += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
cnt += a[i] + (b - a[i]);
a[i + 1] -= (b - a[i]);
}
} else {
cnt += b;
}
}
cout << cnt << '\n';
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,920 | 766,921 | u803754262 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<long long> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
auto ans = 0L;
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];
}
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i * 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
vector<long long> b(n);
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
auto ans = 0L;
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];
}
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;
}
| [
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 766,924 | 766,925 | u519194615 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
map<string, int> mp;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
int left = min(a[i], b[i]);
a[i] = max(0, a[i] - left);
b[i] = max(0, b[i] - left);
int right = min(a[i + 1], b[i]);
a[i + 1] = max(0, a[i + 1] - right);
b[i] = max(0, b[i] - right);
ans += left + right;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
map<string, int> mp;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<int> b(n);
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
int left = min(a[i], b[i]);
a[i] = max(0, a[i] - left);
b[i] = max(0, b[i] - left);
int right = min(a[i + 1], b[i]);
a[i + 1] = max(0, a[i + 1] - right);
b[i] = max(0, b[i] - right);
ans += left + right;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,928 | 766,929 | u139255323 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (long long i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (long long i = 0; i < N; i++) {
cin >> B[i];
}
long long count = 0;
for (long long i = N; i > 0; i--) {
if (A[i] > B[i - 1]) {
count += A[i] - B[i - 1];
} else {
count += A[i];
if (A[i - 1] > (B[i - 1] - A[i])) {
count += B[i - 1] - A[i];
A[i - 1] = A[i - 1] - B[i - 1] + A[i];
} else {
count += A[i - 1];
A[i - 1] = 0;
}
}
}
cout << count;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N;
cin >> N;
vector<long long> A(N + 1);
vector<long long> B(N);
for (long long i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (long long i = 0; i < N; i++) {
cin >> B[i];
}
long long count = 0;
for (long long i = N; i > 0; i--) {
if (A[i] > B[i - 1]) {
count += B[i - 1];
// cout << count << endl;
} else {
count += A[i];
// cout << count << ",";
if (A[i - 1] > (B[i - 1] - A[i])) {
count += B[i - 1] - A[i];
A[i - 1] = A[i - 1] - B[i - 1] + A[i];
} else {
count += A[i - 1];
A[i - 1] = 0;
}
// cout << count << endl;
}
}
cout << count;
return 0;
} | [
"expression.operation.binary.remove"
] | 766,932 | 766,933 | u316491370 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> s(n);
int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= s[i]) {
ans += s[i];
} else if (a[i] + a[i + 1] >= s[i]) {
a[i + 1] = a[i + 1] - (s[i] - a[i]);
ans += s[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << "\n";
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> s(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= s[i]) {
ans += s[i];
} else if (a[i] + a[i + 1] >= s[i]) {
a[i + 1] = a[i + 1] - (s[i] - a[i]);
ans += s[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << "\n";
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,934 | 766,935 | u762182313 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> s(n);
int ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= s[i]) {
ans += s[i];
} else if (a[i] + a[i + 1] >= s[i]) {
a[i + 1] = a[i + 1] - (s[i] - a[i]);
ans += s[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << "\n";
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1);
vector<long long> s(n);
long long ans = 0;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < n; i++) {
if (a[i] >= s[i]) {
ans += s[i];
} else if (a[i] + a[i + 1] >= s[i]) {
a[i + 1] = a[i + 1] - (s[i] - a[i]);
ans += s[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans << "\n";
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,936 | 766,935 | u762182313 | cpp |
p02959 | /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ '.
* / _ _ | \
* | a a / |
* \ .-. ;
* '-('' ).-' ,' ;
* '-; | .'
* \ \ /
* | 7 .__ _.-\ \
* | | | ``/ /` /
* /,_| | /,_/ /
* /,_/ '`-'
*/
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
if (y == 0)
return 1;
long long ret = power(x, y >> 1) % 1000000007;
if (y % 2 == 0)
return (ret * ret) % 1000000007;
else
return (x * (ret * ret % 1000000007)) % 1000000007;
}
pair<int, int> norm(pair<int, int> p) {
if (p.first < 0) {
p.first *= -1;
p.second *= -1;
} else if (p.first == 0 && p.second < 0) {
p.second *= -1;
}
int d = __gcd(abs(p.first), abs(p.second));
p.first /= d;
p.second /= d;
return p;
}
/*
void dikstra(){
for (int i=1;i<=n;i++)dst[i]=oo;
clr(vis,0);
clr(parent,-1);
dst[1]=0;
parent[1]=-1;
s.insert( mp(0,1 ) );
while(!s.empty()){
pair<ll,ll> x=*s.begin();
s.erase(s.begin());
ll u=x.sc;
ll d=x.fr;
if (vis[u])continue;
vis[u]=1;
for (int i=0;i<v[u].size();i++){
ll to=v[u][i].fr;
ll cost=v[u][i].sc;
if (vis[to]||d+cost>=dst[to])continue;
dst[to]=d+cost;
parent[to]=u;
s.insert(mp(d+cost,to));
}
}
vi v;
if (dst[n]==oo)return cout<< -1,0;
int nn=n;
while(parent[nn]!=-1){
v.push_back(nn);
nn=parent[nn];
}
reverse(all(v));
}
int parent[N], sz[N];
int n, m, components;
void init(){
iota(parent, parent+n, 0);
fill(sz, sz+n, 1);
components = n;
}
int find(int u){
if(parent[u] == u) return u;
return parent[u] = find(parent[u]);
}
void join(int u, int v){
u = find(u), v = find(v);
if(u == v) return;
if(sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
--components;
}
*/
const double Eps = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= Eps ? 0 : x < y ? -1 : 1; }
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define mii map<int, int>
#define mll map<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define sll set<ll>
#define spii set<pii>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vvi vector<vector<int>>
#define vvpii vector<vector<pii>>
#define sfi1(v) scanf("%d", &v)
#define sfi2(v1, v2) scanf("%d %d", &v1, &v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d", &v1, &v2, &v3)
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define el '\n'
#define lp(i, n) for (int i = 0; i < int(n); i++)
#define lp1(i, n) for (int i = 1; i <= int(n); i++)
#define rlp(i, n) for (int i = (n)-1; i >= 0; i--)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define mp(x, y) make_pair((x), (y))
#define pb(x) push_back((x))
#define all(v) ((v).begin()), ((v).end())
#define sz(x) ((int)(x).size())
#define bits(a) __builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(), v.rend())
#define sortaa(a, n) sort(a, a + n)
#define sortad(a, n) sort(a, a + n), reverse(a, a + n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define read freopen("input.in", "rt", stdin);
#define write freopen("output.in", "wt", stdout);
#define fastIO \
cout << fixed << setprecision(0), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr);
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int kx[] = {2, 2, 1, -1, -2, -2, 1, -1};
int ky[] = {1, -1, 2, 2, 1, -1, -2, -2};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int const N = 5e5 + 9, mod = 1e9 + 7, oo = 1e9 + 7;
//------------------------------------------------------------------------------------
ll hero[N];
ll monster[N];
ll n, sum;
int main() {
cin >> n;
lp(i, n + 1) cin >> monster[i];
lp(i, n) cin >> hero[i];
lp(i, n) {
int x = min(hero[i], monster[i]);
hero[i] -= x;
monster[i] -= x;
sum += x;
x = min(hero[i], monster[i + 1]);
sum += x;
hero[i] -= x;
monster[i] -= x;
}
cout << sum;
/*
*/
return 0;
}
| /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ '.
* / _ _ | \
* | a a / |
* \ .-. ;
* '-('' ).-' ,' ;
* '-; | .'
* \ \ /
* | 7 .__ _.-\ \
* | | | ``/ /` /
* /,_| | /,_/ /
* /,_/ '`-'
*/
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
if (y == 0)
return 1;
long long ret = power(x, y >> 1) % 1000000007;
if (y % 2 == 0)
return (ret * ret) % 1000000007;
else
return (x * (ret * ret % 1000000007)) % 1000000007;
}
pair<int, int> norm(pair<int, int> p) {
if (p.first < 0) {
p.first *= -1;
p.second *= -1;
} else if (p.first == 0 && p.second < 0) {
p.second *= -1;
}
int d = __gcd(abs(p.first), abs(p.second));
p.first /= d;
p.second /= d;
return p;
}
/*
void dikstra(){
for (int i=1;i<=n;i++)dst[i]=oo;
clr(vis,0);
clr(parent,-1);
dst[1]=0;
parent[1]=-1;
s.insert( mp(0,1 ) );
while(!s.empty()){
pair<ll,ll> x=*s.begin();
s.erase(s.begin());
ll u=x.sc;
ll d=x.fr;
if (vis[u])continue;
vis[u]=1;
for (int i=0;i<v[u].size();i++){
ll to=v[u][i].fr;
ll cost=v[u][i].sc;
if (vis[to]||d+cost>=dst[to])continue;
dst[to]=d+cost;
parent[to]=u;
s.insert(mp(d+cost,to));
}
}
vi v;
if (dst[n]==oo)return cout<< -1,0;
int nn=n;
while(parent[nn]!=-1){
v.push_back(nn);
nn=parent[nn];
}
reverse(all(v));
}
int parent[N], sz[N];
int n, m, components;
void init(){
iota(parent, parent+n, 0);
fill(sz, sz+n, 1);
components = n;
}
int find(int u){
if(parent[u] == u) return u;
return parent[u] = find(parent[u]);
}
void join(int u, int v){
u = find(u), v = find(v);
if(u == v) return;
if(sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
--components;
}
*/
const double Eps = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= Eps ? 0 : x < y ? -1 : 1; }
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define mii map<int, int>
#define mll map<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define sll set<ll>
#define spii set<pii>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vvi vector<vector<int>>
#define vvpii vector<vector<pii>>
#define sfi1(v) scanf("%d", &v)
#define sfi2(v1, v2) scanf("%d %d", &v1, &v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d", &v1, &v2, &v3)
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define el '\n'
#define lp(i, n) for (int i = 0; i < int(n); i++)
#define lp1(i, n) for (int i = 1; i <= int(n); i++)
#define rlp(i, n) for (int i = (n)-1; i >= 0; i--)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define mp(x, y) make_pair((x), (y))
#define pb(x) push_back((x))
#define all(v) ((v).begin()), ((v).end())
#define sz(x) ((int)(x).size())
#define bits(a) __builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(), v.rend())
#define sortaa(a, n) sort(a, a + n)
#define sortad(a, n) sort(a, a + n), reverse(a, a + n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define read freopen("input.in", "rt", stdin);
#define write freopen("output.in", "wt", stdout);
#define fastIO \
cout << fixed << setprecision(0), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr);
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int kx[] = {2, 2, 1, -1, -2, -2, 1, -1};
int ky[] = {1, -1, 2, 2, 1, -1, -2, -2};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int const N = 5e5 + 9, mod = 1e9 + 7, oo = 1e9 + 7;
//------------------------------------------------------------------------------------
ll hero[N];
ll monster[N];
ll n, sum;
int main() {
cin >> n;
lp(i, n + 1) cin >> monster[i];
lp(i, n) cin >> hero[i];
lp(i, n) {
int x = min(hero[i], monster[i]);
hero[i] -= x;
monster[i] -= x;
sum += x;
x = min(hero[i], monster[i + 1]);
sum += x;
hero[i] -= x;
monster[i + 1] -= x;
}
cout << sum;
/*
*/
return 0;
}
| [
"assignment.change"
] | 766,937 | 766,938 | u960507774 | cpp |
p02959 | /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ '.
* / _ _ | \
* | a a / |
* \ .-. ;
* '-('' ).-' ,' ;
* '-; | .'
* \ \ /
* | 7 .__ _.-\ \
* | | | ``/ /` /
* /,_| | /,_/ /
* /,_/ '`-'
*/
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
if (y == 0)
return 1;
long long ret = power(x, y >> 1) % 1000000007;
if (y % 2 == 0)
return (ret * ret) % 1000000007;
else
return (x * (ret * ret % 1000000007)) % 1000000007;
}
pair<int, int> norm(pair<int, int> p) {
if (p.first < 0) {
p.first *= -1;
p.second *= -1;
} else if (p.first == 0 && p.second < 0) {
p.second *= -1;
}
int d = __gcd(abs(p.first), abs(p.second));
p.first /= d;
p.second /= d;
return p;
}
/*
void dikstra(){
for (int i=1;i<=n;i++)dst[i]=oo;
clr(vis,0);
clr(parent,-1);
dst[1]=0;
parent[1]=-1;
s.insert( mp(0,1 ) );
while(!s.empty()){
pair<ll,ll> x=*s.begin();
s.erase(s.begin());
ll u=x.sc;
ll d=x.fr;
if (vis[u])continue;
vis[u]=1;
for (int i=0;i<v[u].size();i++){
ll to=v[u][i].fr;
ll cost=v[u][i].sc;
if (vis[to]||d+cost>=dst[to])continue;
dst[to]=d+cost;
parent[to]=u;
s.insert(mp(d+cost,to));
}
}
vi v;
if (dst[n]==oo)return cout<< -1,0;
int nn=n;
while(parent[nn]!=-1){
v.push_back(nn);
nn=parent[nn];
}
reverse(all(v));
}
int parent[N], sz[N];
int n, m, components;
void init(){
iota(parent, parent+n, 0);
fill(sz, sz+n, 1);
components = n;
}
int find(int u){
if(parent[u] == u) return u;
return parent[u] = find(parent[u]);
}
void join(int u, int v){
u = find(u), v = find(v);
if(u == v) return;
if(sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
--components;
}
*/
const double Eps = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= Eps ? 0 : x < y ? -1 : 1; }
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define mii map<int, int>
#define mll map<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define sll set<ll>
#define spii set<pii>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vvi vector<vector<int>>
#define vvpii vector<vector<pii>>
#define sfi1(v) scanf("%d", &v)
#define sfi2(v1, v2) scanf("%d %d", &v1, &v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d", &v1, &v2, &v3)
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define el '\n'
#define lp(i, n) for (int i = 0; i < int(n); i++)
#define lp1(i, n) for (int i = 1; i <= int(n); i++)
#define rlp(i, n) for (int i = (n)-1; i >= 0; i--)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define mp(x, y) make_pair((x), (y))
#define pb(x) push_back((x))
#define all(v) ((v).begin()), ((v).end())
#define sz(x) ((int)(x).size())
#define bits(a) __builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(), v.rend())
#define sortaa(a, n) sort(a, a + n)
#define sortad(a, n) sort(a, a + n), reverse(a, a + n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define read freopen("input.in", "rt", stdin);
#define write freopen("output.in", "wt", stdout);
#define fastIO \
cout << fixed << setprecision(0), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr);
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int kx[] = {2, 2, 1, -1, -2, -2, 1, -1};
int ky[] = {1, -1, 2, 2, 1, -1, -2, -2};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int const N = 5e5 + 9, mod = 1e9 + 7, oo = 1e9 + 7;
//------------------------------------------------------------------------------------
int hero[N];
int monster[N];
int n, sum;
int main() {
cin >> n;
lp(i, n + 1) cin >> monster[i];
lp(i, n) cin >> hero[i];
lp(i, n) {
int x = min(hero[i], monster[i]);
hero[i] -= x;
monster[i] -= x;
sum += x;
x = min(hero[i], monster[i + 1]);
sum += x;
hero[i] -= x;
monster[i] -= x;
}
cout << sum;
/*
*/
return 0;
}
| /*|In The Name of Allah|*/
/* Dear GCC compiler:
*
* If my code doesn't compile, this doesn't mean it's wrong.
* It just mean that you don't understand what I want.
* Here's my safety pig, I hope my code compile and get accepted.
* _._ _..._ .-', _.._(`))
*'-. ` ' /-._.-' ',/
* ) \ '.
* / _ _ | \
* | a a / |
* \ .-. ;
* '-('' ).-' ,' ;
* '-; | .'
* \ \ /
* | 7 .__ _.-\ \
* | | | ``/ /` /
* /,_| | /,_/ /
* /,_/ '`-'
*/
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
if (y == 0)
return 1;
long long ret = power(x, y >> 1) % 1000000007;
if (y % 2 == 0)
return (ret * ret) % 1000000007;
else
return (x * (ret * ret % 1000000007)) % 1000000007;
}
pair<int, int> norm(pair<int, int> p) {
if (p.first < 0) {
p.first *= -1;
p.second *= -1;
} else if (p.first == 0 && p.second < 0) {
p.second *= -1;
}
int d = __gcd(abs(p.first), abs(p.second));
p.first /= d;
p.second /= d;
return p;
}
/*
void dikstra(){
for (int i=1;i<=n;i++)dst[i]=oo;
clr(vis,0);
clr(parent,-1);
dst[1]=0;
parent[1]=-1;
s.insert( mp(0,1 ) );
while(!s.empty()){
pair<ll,ll> x=*s.begin();
s.erase(s.begin());
ll u=x.sc;
ll d=x.fr;
if (vis[u])continue;
vis[u]=1;
for (int i=0;i<v[u].size();i++){
ll to=v[u][i].fr;
ll cost=v[u][i].sc;
if (vis[to]||d+cost>=dst[to])continue;
dst[to]=d+cost;
parent[to]=u;
s.insert(mp(d+cost,to));
}
}
vi v;
if (dst[n]==oo)return cout<< -1,0;
int nn=n;
while(parent[nn]!=-1){
v.push_back(nn);
nn=parent[nn];
}
reverse(all(v));
}
int parent[N], sz[N];
int n, m, components;
void init(){
iota(parent, parent+n, 0);
fill(sz, sz+n, 1);
components = n;
}
int find(int u){
if(parent[u] == u) return u;
return parent[u] = find(parent[u]);
}
void join(int u, int v){
u = find(u), v = find(v);
if(u == v) return;
if(sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
--components;
}
*/
const double Eps = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= Eps ? 0 : x < y ? -1 : 1; }
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define mii map<int, int>
#define mll map<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define sll set<ll>
#define spii set<pii>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vvi vector<vector<int>>
#define vvpii vector<vector<pii>>
#define sfi1(v) scanf("%d", &v)
#define sfi2(v1, v2) scanf("%d %d", &v1, &v2)
#define sfi3(v1, v2, v3) scanf("%d %d %d", &v1, &v2, &v3)
#define sfll1(v) scanf("%I64d", &v);
#define sfll2(v1, v2) scanf("%I64d %I64d", &v1, &v2)
#define sfll3(v1, v2, v3) scanf("%I64d %I64d %I64d", &v1, &v2, &v3)
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define el '\n'
#define lp(i, n) for (int i = 0; i < int(n); i++)
#define lp1(i, n) for (int i = 1; i <= int(n); i++)
#define rlp(i, n) for (int i = (n)-1; i >= 0; i--)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define mp(x, y) make_pair((x), (y))
#define pb(x) push_back((x))
#define all(v) ((v).begin()), ((v).end())
#define sz(x) ((int)(x).size())
#define bits(a) __builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(), v.rend())
#define sortaa(a, n) sort(a, a + n)
#define sortad(a, n) sort(a, a + n), reverse(a, a + n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define read freopen("input.in", "rt", stdin);
#define write freopen("output.in", "wt", stdout);
#define fastIO \
cout << fixed << setprecision(0), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr);
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int kx[] = {2, 2, 1, -1, -2, -2, 1, -1};
int ky[] = {1, -1, 2, 2, 1, -1, -2, -2};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int const N = 5e5 + 9, mod = 1e9 + 7, oo = 1e9 + 7;
//------------------------------------------------------------------------------------
ll hero[N];
ll monster[N];
ll n, sum;
int main() {
cin >> n;
lp(i, n + 1) cin >> monster[i];
lp(i, n) cin >> hero[i];
lp(i, n) {
int x = min(hero[i], monster[i]);
hero[i] -= x;
monster[i] -= x;
sum += x;
x = min(hero[i], monster[i + 1]);
sum += x;
hero[i] -= x;
monster[i + 1] -= x;
}
cout << sum;
/*
*/
return 0;
}
| [
"variable_declaration.type.change",
"assignment.change"
] | 766,939 | 766,938 | u960507774 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N + 1], B[N], A_copy[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
copy(A, A + N + 1, A_copy);
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
A[i] -= B[i];
B[i] = 0;
} else {
B[i] -= A[i];
A[i] = 0;
A[i + 1] = max(0, A[i + 1] - B[i]);
}
}
int s = 0;
for (int i = 0; i < N + 1; i++) {
// cout << A[i] << endl;
s += A_copy[i] - A[i];
}
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
using namespace std;
int main(void) {
int N;
cin >> N;
int A[N + 1], B[N], A_copy[N + 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
copy(A, A + N + 1, A_copy);
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
A[i] -= B[i];
B[i] = 0;
} else {
B[i] -= A[i];
A[i] = 0;
A[i + 1] = max(0, A[i + 1] - B[i]);
}
}
long s = 0;
for (int i = 0; i < N + 1; i++) {
// cout << A[i] << endl;
s += A_copy[i] - A[i];
}
cout << s << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 766,940 | 766,941 | u710789518 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
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 ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
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];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,944 | 766,945 | u430209651 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
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 ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] = b[i] - a[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
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];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change",
"assignment.value.change"
] | 766,946 | 766,945 | u430209651 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
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 ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] -= 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
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];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i])
ans += b[i];
else {
if (a[i + 1] > b[i] - a[i]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change",
"assignment.value.change"
] | 766,948 | 766,945 | u430209651 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int n; // no of heroes
cin >> n;
int a[n + 1]; // no of towns n+1 a[i] is no of monsters attacking
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int b[n]; // heroes fighting number
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
if (a[0] < b[0]) {
ans += a[0];
b[0] -= a[0];
} else {
ans += b[0];
b[0] = 0;
}
for (int i = 1; i < n; i++) {
if (a[i] <= b[i - 1])
ans += a[i];
else {
if (b[i - 1] + b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i] - b[i - 1];
} else {
ans += b[i] + b[i - 1];
b[i] = 0;
}
}
}
if (b[n - 1] > a[n])
ans += a[n];
else
ans += b[n - 1];
cout << ans;
}
| #include <iostream>
using namespace std;
int main() {
int n; // no of heroes
cin >> n;
int a[n + 1]; // no of towns n+1 a[i] is no of monsters attacking
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
int b[n]; // heroes fighting number
for (int i = 0; i < n; i++) {
cin >> b[i];
}
long long int ans = 0;
if (a[0] < b[0]) {
ans += a[0];
b[0] -= a[0];
} else {
ans += b[0];
b[0] = 0;
}
for (int i = 1; i < n; i++) {
if (a[i] <= b[i - 1])
ans += a[i];
else {
if (b[i - 1] + b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i] - b[i - 1];
} else {
ans += b[i] + b[i - 1];
b[i] = 0;
}
}
}
if (b[n - 1] > a[n])
ans += a[n];
else
ans += b[n - 1];
cout << ans;
}
| [
"variable_declaration.type.widen.change"
] | 766,949 | 766,950 | u478964347 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, ans = 0;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
int x;
cin >> x;
ans += x;
a.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (a[i] > x) {
a[i] = a[i] - x;
} else {
a[i + 1] = max(0, a[i + 1] - x + a[i]);
a[i] = 0;
}
}
for (int i = 0; i < n + 1; i++) {
ans -= a[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
long long ans = 0;
cin >> n;
vector<int> a, b;
for (int i = 0; i < n + 1; i++) {
int x;
cin >> x;
ans += x;
a.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (a[i] > x) {
a[i] = a[i] - x;
} else {
a[i + 1] = max(0, a[i + 1] - x + a[i]);
a[i] = 0;
}
}
for (int i = 0; i < n + 1; i++) {
ans -= a[i];
}
cout << ans << endl;
} | [
"variable_declaration.type.widen.change"
] | 766,951 | 766,952 | u750028862 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
;
int n, a[N], b[N];
int main() {
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++) {
ans += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
;
int n, a[N], b[N];
int main() {
cin >> n;
for (int i = 0; i <= n; 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++) {
ans += min(a[i], b[i]);
b[i] = max(0, b[i] - a[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] = max(0, a[i + 1] - b[i]);
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 766,961 | 766,962 | u385825353 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n + 1) cin >> A[i];
int ans = 0;
rep(j, n) {
int b;
cin >> b;
if (b <= A[j])
ans += b;
else {
int c = b - A[j];
ans += A[j];
if (c <= A[j + 1]) {
ans += c;
A[j + 1] -= c;
} else {
ans += A[j + 1];
A[j + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> A(n + 1);
rep(i, n + 1) cin >> A[i];
ll ans = 0;
rep(j, n) {
int b;
cin >> b;
if (b <= A[j])
ans += b;
else {
int c = b - A[j];
ans += A[j];
if (c <= A[j + 1]) {
ans += c;
A[j + 1] -= c;
} else {
ans += A[j + 1];
A[j + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,963 | 766,964 | u115838990 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int a[110000], b[110000];
cin >> n;
int i;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (i = 0; i < n; i++) {
if (b[i] - a[i] < 0) {
ans += b[i];
} else if (b[i] - a[i] - a[i + 1] < 0) {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans;
return (0);
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int a[110000], b[110000];
cin >> n;
int i;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
long long ans = 0;
for (i = 0; i < n; i++) {
if (b[i] - a[i] < 0) {
ans += b[i];
} else if (b[i] - a[i] - a[i + 1] < 0) {
ans += b[i];
a[i + 1] = a[i + 1] - (b[i] - a[i]);
} else {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans;
return (0);
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,965 | 766,966 | u836743234 | cpp |
p02959 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1), b(n);
rep(i, n + 1) scanf("%d", &a[i]);
rep(i, n) scanf("%d", &b[i]);
int ans = 0;
rep(i, n) {
int tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
ans += tmp;
tmp = min(a[i + 1], b[i]);
a[i + 1] -= tmp;
b[i] -= tmp;
ans += tmp;
}
printf("%d\n", ans);
Please AC;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
/*多倍長整数/cpp_intで宣言
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
*/
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rep2(i, n) for (int i = 2; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define reprm(i, n) for (int i = n - 1; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printin(a) printf(a ? "possible\n" : "inposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) // string出力
#define all(x) (x).begin(), (x).end()
#define allsum(a, b, c) ((a + b) * c / 2) //等差数列の和、初項,末項,項数
#define pb push_back
#define priq priority_queue
#define rpriq priq<int, vector<int>, greater<int>>
#define deg_to_rad(deg) (((deg) / 360.0) * 2.0 * PI)
#define rad_to_deg(rad) (((rad) / 2.0 / PI) * 360.0)
#define Please return
#define AC 0
#define addf(T) [](T a, T b) { return (a + b); }
#define minf(T) [](T a, T b) { return min(a, b); }
#define maxf(T) [](T a, T b) { return max(a, b); }
using ll = long long;
constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1000000007;
const long double PI = acos(-1.0L);
using namespace std;
void scans(string &str) {
char c;
str = "";
scanf("%c", &c);
if (c == '\n')
scanf("%c", &c); //最初の改行対策
while (c != '\n' && c != -1) {
str += c;
scanf("%c", &c);
}
}
void scanc(char &str) {
char c;
scanf("%c", &c);
if (c == -1)
return;
while (c == '\n') {
scanf("%c", &c);
}
str = c;
}
double acot(double x) { return PI / 2 - atan(x); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll number1, ll number2) { // lcmを求める
return number1 / gcd(number1, number2) * number2;
}
ll LSB(ll n) { return (n & (-n)); }
/*-----------------------------------------ここからコード-----------------------------------------*/
int main() {
int n;
scanf("%d", &n);
vector<int> a(n + 1), b(n);
rep(i, n + 1) scanf("%d", &a[i]);
rep(i, n) scanf("%d", &b[i]);
ll ans = 0;
rep(i, n) {
ll tmp = min(a[i], b[i]);
a[i] -= tmp;
b[i] -= tmp;
ans += tmp;
tmp = min(a[i + 1], b[i]);
a[i + 1] -= tmp;
b[i] -= tmp;
ans += tmp;
}
printf("%lld\n", ans);
Please AC;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,967 | 766,968 | u917972976 | cpp |
p02959 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printfin(a) printf(a ? "possible\n" : "inposible\n")
#define all(x) (x).begin(), (x).end()
using ll = long long;
//マクロとかここまで
#include <algorithm>
#include <cmath>
#include <cstring>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[100001], b[100000], amount = 0;
scanf("%d", &n);
rep(i, n + 1) scanf("%d", &a[i]);
rep(i, n) scanf("%d", &b[i]);
repr(i, n - 1) {
if (b[i] >= a[i + 1]) {
b[i] -= a[i + 1];
amount += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
amount += b[i];
b[i] = 0;
}
if (b[i] >= a[i]) {
b[i] -= a[i];
amount += a[i];
a[i] = 0;
} else {
a[i] -= b[i];
amount += b[i];
b[i] = 0;
}
}
printf("%d\n", amount);
return 0;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = n; i >= 0; --i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printfin(a) printf(a ? "possible\n" : "inposible\n")
#define all(x) (x).begin(), (x).end()
using ll = long long;
//マクロとかここまで
#include <algorithm>
#include <cmath>
#include <cstring>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
ll n, a[100001], b[100000], amount = 0;
scanf("%lld", &n);
rep(i, n + 1) scanf("%lld", &a[i]);
rep(i, n) scanf("%lld", &b[i]);
repr(i, n - 1) {
if (b[i] >= a[i + 1]) {
b[i] -= a[i + 1];
amount += a[i + 1];
a[i + 1] = 0;
} else {
a[i + 1] -= b[i];
amount += b[i];
b[i] = 0;
}
if (b[i] >= a[i]) {
b[i] -= a[i];
amount += a[i];
a[i] = 0;
} else {
a[i] -= b[i];
amount += b[i];
b[i] = 0;
}
}
printf("%lld\n", amount);
return 0;
}
| [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,969 | 766,970 | u917972976 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int A[N + 1];
FOR(i, 0, N + 1) cin >> A[i];
int B[N];
FOR(i, 0, N) cin >> B[i];
int ans = 0;
FOR(i, 0, N) {
int a = min(A[i], B[i]);
ans += a;
A[i] -= a;
B[i] -= a;
a = min(A[i + 1], B[i]);
ans += a;
A[i + 1] -= a;
B[i] -= a;
}
cout << ans << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
ll A[N + 1];
FOR(i, 0, N + 1) cin >> A[i];
ll B[N];
FOR(i, 0, N) cin >> B[i];
ll ans = 0;
FOR(i, 0, N) {
ll a = min(A[i], B[i]);
ans += a;
A[i] -= a;
B[i] -= a;
a = min(A[i + 1], B[i]);
ans += a;
A[i + 1] -= a;
B[i] -= a;
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,975 | 766,976 | u310790595 | cpp |
p02959 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------------------------
int main(void) {
int n;
cin >> n;
int ans = 0;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = 0; i < n; i++) {
int mons = 0;
mons = min(b[i], a[i]);
b[i] -= mons;
ans += mons;
mons = 0;
if (b[i] > 0) {
mons = min(b[i], a[i + 1]);
a[i + 1] -= mons;
ans += mons;
mons = 0;
}
}
cout << ans << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
//----------------------------------------
int main(void) {
int n;
cin >> n;
ll ans = 0;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
for (int i = 0; i < n; i++) {
int mons = 0;
mons = min(b[i], a[i]);
b[i] -= mons;
ans += mons;
mons = 0;
if (b[i] > 0) {
mons = min(b[i], a[i + 1]);
a[i + 1] -= mons;
ans += mons;
mons = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,977 | 766,978 | u118340517 | 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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int ans = 0;
int next = 0;
for (int i = 0; i < N; i++) {
int before = min(next, A.at(i));
ans += min(next + B.at(i), A.at(i));
next = max(0, B.at(i) - (A.at(i) - before));
}
ans += min(A.at(N), next);
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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int64_t ans = 0;
int next = 0;
for (int i = 0; i < N; i++) {
int before = min(next, A.at(i));
ans += min(next + B.at(i), A.at(i));
next = max(0, B.at(i) - (A.at(i) - before));
}
ans += min(A.at(N), next);
/*/int same = min(A.at(0), B.at(0));
ans += same;
for (int i = 0; i < N-1; i++){
int other;
other = min(A.at(i+1), B.at(i) - same);
same = min(A.at(i+1) - other, B.at(i+1));
ans += other + same;
}
ans += min(A.at(N), B.at(N-1) - same);
*/
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,979 | 766,980 | u536916602 | 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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int ans = 0;
/* int next = 0;
for (int i = 0; i < N; i++){
int before = min(next,A.at(i));
ans += min(next + B.at(i), A.at(i));
next = max(0, B.at(i) - (A.at(i) - before));
}
ans += min(A.at(N), next);
*/
int same = min(A.at(0), B.at(0));
ans += same;
for (int i = 0; i < N - 1; i++) {
int other;
other = min(A.at(i + 1), B.at(i) - same);
same = min(A.at(i + 1) - other, B.at(i + 1));
ans += other + same;
}
ans += min(A.at(N), B.at(N - 1) - same);
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++) {
int a;
cin >> a;
A.at(i) = a;
}
for (int i = 0; i < N; i++) {
int b;
cin >> b;
B.at(i) = b;
}
int64_t ans = 0;
/* int next = 0;
for (int i = 0; i < N; i++){
int before = min(next,A.at(i));
ans += min(next + B.at(i), A.at(i));
next = max(0, B.at(i) - (A.at(i) - before));
}
ans += min(A.at(N), next);
*/
int same = min(A.at(0), B.at(0));
ans += same;
for (int i = 0; i < N - 1; i++) {
int other;
other = min(A.at(i + 1), B.at(i) - same);
same = min(A.at(i + 1) - other, B.at(i + 1));
ans += other + same;
}
ans += min(A.at(N), B.at(N - 1) - same);
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 766,982 | 766,983 | u536916602 | cpp |
p02959 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// read input
int n;
vector<int> a;
vector<int> b;
cin >> n;
int tmp;
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);
}
// calculate
int sum = 0;
for (int i = 0; i < n; i++) {
int atk_i = 0;
int atk_i1 = 0;
if (a[i] >= b[i]) {
atk_i = b[i];
} else {
atk_i = a[i];
atk_i1 = min(b[i] - a[i], a[i + 1]);
}
a[i] -= atk_i;
a[i + 1] -= atk_i1;
sum += atk_i + atk_i1;
}
cout << sum;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// read input
int n;
vector<int> a;
vector<int> b;
cin >> n;
int tmp;
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);
}
// calculate
long sum = 0;
for (int i = 0; i < n; i++) {
int atk_i = 0;
int atk_i1 = 0;
if (a[i] >= b[i]) {
atk_i = b[i];
} else {
atk_i = a[i];
atk_i1 = min(b[i] - a[i], a[i + 1]);
}
a[i] -= atk_i;
a[i + 1] -= atk_i1;
sum += atk_i + atk_i1;
}
cout << sum;
} | [
"variable_declaration.type.primitive.change"
] | 766,986 | 766,987 | u670575468 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
int ans = 0;
rep(i, n) {
if (b.at(i) >= a.at(i)) {
ans += a.at(i);
b.at(i) = b.at(i) - a.at(i);
a.at(i) = 0;
if (b.at(i) >= a.at(i + 1)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
} else if (b.at(i) < a.at(i + 1)) {
ans += b.at(i);
a.at(i + 1) = a.at(i + 1) - b.at(i);
}
} else if (b.at(i) < a.at(i)) {
ans += b.at(i);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000007;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a.at(i);
rep(i, n) cin >> b.at(i);
ll ans = 0;
rep(i, n) {
if (b.at(i) >= a.at(i)) {
ans += a.at(i);
b.at(i) = b.at(i) - a.at(i);
a.at(i) = 0;
if (b.at(i) >= a.at(i + 1)) {
ans += a.at(i + 1);
a.at(i + 1) = 0;
} else if (b.at(i) < a.at(i + 1)) {
ans += b.at(i);
a.at(i + 1) = a.at(i + 1) - b.at(i);
}
} else if (b.at(i) < a.at(i)) {
ans += b.at(i);
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,988 | 766,989 | u702051956 | cpp |
p02959 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1] = {0};
int b[n] = {0};
int count = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) { // monsters > capacity
count += b[i];
} else {
count += a[i];
if (a[i + 1] > b[i] - a[i]) {
count += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
count += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << count << "\n";
} | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n + 1] = {0};
int b[n] = {0};
long long int count = 0;
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > b[i]) { // monsters > capacity
count += b[i];
} else {
count += a[i];
if (a[i + 1] > b[i] - a[i]) {
count += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
} else {
count += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << count << "\n";
} | [
"variable_declaration.type.widen.change"
] | 766,996 | 766,997 | u500544894 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
// Input
int N = 0;
cin >> N;
int A[N + 1] = {0};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int B[N] = {0};
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
int a = A[i];
int b = B[i];
if (a > b) {
ans += b;
} else {
ans += a;
if (A[i + 1] > b - a) {
ans += b - a;
A[i + 1] -= b - a;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
// cout << "ans: " << ans << endl;
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
// Input
int N = 0;
cin >> N;
int A[N + 1] = {0};
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
int B[N] = {0};
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
int a = A[i];
int b = B[i];
if (a > b) {
ans += b;
} else {
ans += a;
if (A[i + 1] > b - a) {
ans += b - a;
A[i + 1] -= b - a;
} else {
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,998 | 766,999 | u395536066 | cpp |
p02959 | #define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> bool isPrime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binarySearchJudge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binarySearch(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binarySearchJudge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
a[i] -= left;
b[i] -= left;
ans += left;
int right = min(b[i], a[i + 1]);
b[i] -= right;
a[i] -= right;
ans += right;
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class Type> Type modpow(Type a, Type n, Type mod) {
Type res = 1;
while (0 < n) {
if (n & 1) {
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
template <class Type> Type gcd(Type x, Type y) {
Type r;
if (x < y) {
swap(x, y);
}
while (0 < y) {
r = x % y;
x = y;
y = r;
}
return x;
}
template <class Type> bool isPrime(Type x) {
if (x == 2)
return true;
if (x < 2 || x % 2 == 0)
return false;
for (Type i = 3; i <= sqrt(x); i += 2) {
if (x % i == 0)
return false;
}
return true;
}
template <class Type> vector<bool> eratos(Type n) {
vector<bool> isPrime(n + 1, true);
isPrime[0] = isPrime[1] = false;
for (Type i = 2; i <= n; i++) {
if (isPrime[i]) {
Type j = i + i;
while (j <= n) {
isPrime[j] = false;
j = j + i;
}
}
}
return isPrime;
}
bool binarySearchJudge(vector<int> a, int index, int key) {
if (key <= a[index])
return true;
else
return false;
}
int binarySearch(vector<int> a, int key) {
int ng = -1;
int ok = a.size();
while (1 < abs(ng - ok)) {
int mid = (ng + ok) / 2;
if (binarySearchJudge(a, mid, key))
ok = mid;
else
ng = mid;
}
return a[ok] == key;
}
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a[i], b[i]);
a[i] -= left;
b[i] -= left;
ans += left;
int right = min(b[i], a[i + 1]);
b[i] -= right;
a[i + 1] -= right;
ans += right;
}
cout << ans << endl;
} | [
"variable_declaration.type.change",
"assignment.change"
] | 767,007 | 767,006 | u999989620 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<long> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a.at(i), b.at(i));
a.at(i) -= left;
b.at(i) -= left;
ans += left;
int right = min(a.at(i + 1), b.at(i));
a.at(i + 1) -= right;
b.at(i) -= right;
ans += right;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
vector<long> b(n);
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long ans = 0;
for (int i = 0; i < n; i++) {
int left = min(a.at(i), b.at(i));
a.at(i) -= left;
b.at(i) -= left;
ans += left;
int right = min(a.at(i + 1), b.at(i));
a.at(i + 1) -= right;
b.at(i) -= right;
ans += right;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 767,008 | 767,009 | u999989620 | cpp |
p02959 | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, sum = 0;
cin >> n;
ll a[n + 1], b;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
a[i] -= b;
} else {
b -= a[i];
a[i] = 0;
if (b <= a[i + 1]) {
a[i + 1] -= b;
} else {
a[i + 1] = 0;
}
}
sum -= a[i];
}
sum -= a[n];
cout << sum << endl;
}
| #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
ll sum = 0;
cin >> n;
ll a[n + 1], b;
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b;
if (b <= a[i]) {
a[i] -= b;
} else {
b -= a[i];
a[i] = 0;
if (b <= a[i + 1]) {
a[i + 1] -= b;
} else {
a[i + 1] = 0;
}
}
sum -= a[i];
}
sum -= a[n];
cout << sum << endl;
} | [] | 767,024 | 767,025 | u991136459 | cpp |
p02959 | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int
const ll N = 1e6 + 6, M = 1e9 + 7;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n;
cin >> n;
ll s = 0;
vector<ll> a(n + 1), b(n);
for (ll &e : a)
cin >> e, s += e;
for (ll &e : b)
cin >> e;
for (ll i = 0; i < n; i++) {
ll m = min(a[i], b[i]);
a[i] -= m;
b[i] -= m;
a[i + 1] -= min(a[i + 1], b[i]);
}
for (ll e : a)
s -= e;
cout << s;
return 0;
} | // Author: getharshkumar
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
const ll N = 1e6 + 6, M = 1e9 + 7;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
ll n;
cin >> n;
ll s = 0;
vector<ll> a(n + 1), b(n);
for (ll &e : a)
cin >> e, s += e;
for (ll &e : b)
cin >> e;
for (ll i = 0; i < n; i++) {
ll m = min(a[i], b[i]);
a[i] -= m;
b[i] -= m;
a[i + 1] -= min(a[i + 1], b[i]);
}
for (ll e : a)
s -= e;
cout << s;
return 0;
} | [
"preprocessor.define.value.change"
] | 767,026 | 767,027 | u319625425 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N + 2);
vector<int> b(N + 1);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
int ans = 0;
rep(i, N + 1) {
if (b[i] > a[i]) {
int diff = min(a[i + 1], b[i] - a[i]);
a[i + 1] -= diff;
ans += a[i] + diff;
b[i] -= a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> a(N + 2);
vector<ll> b(N + 1);
rep(i, N + 1) cin >> a[i];
rep(i, N) cin >> b[i];
ll ans = 0;
rep(i, N + 1) {
if (b[i] > a[i]) {
ll diff = min(a[i + 1], b[i] - a[i]);
a[i + 1] -= diff;
ans += a[i] + diff;
b[i] -= a[i];
a[i] = 0;
} else {
ans += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 767,028 | 767,029 | u021755470 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[1000001];
long long B[1000000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) {
// 現在
long long current = min(A[i], B[i]);
A[i] -= current;
B[i] -= current;
ans += current;
// 1個先
long long next = min(A[i + 1], B[i]);
ans += next;
A[i] -= next;
B[i] -= next;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[1000001];
long long B[1000000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) {
// 現在
long long current = min(A[i], B[i]);
A[i] -= current;
B[i] -= current;
ans += current;
// 1個先
long long next = min(A[i + 1], B[i]);
ans += next;
A[i + 1] -= next;
B[i] -= next;
}
cout << ans << endl;
} | [
"assignment.change"
] | 767,030 | 767,031 | u455366471 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[100001];
long long B[100000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) {
// 現在
long long current = min(A[i], B[i]);
A[i] -= current;
B[i] -= current;
ans += current;
// 1個先
long long next = min(A[i + 1], B[i]);
ans += next;
A[i] -= next;
B[i] -= next;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
long long A[1000001];
long long B[1000000];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long long ans = 0;
for (int i = 0; i <= N - 1; i++) {
// 現在
long long current = min(A[i], B[i]);
A[i] -= current;
B[i] -= current;
ans += current;
// 1個先
long long next = min(A[i + 1], B[i]);
ans += next;
A[i + 1] -= next;
B[i] -= next;
}
cout << ans << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 767,032 | 767,031 | u455366471 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n + 1);
vector<int> vb(n);
for (int i = 0; i < n + 1; i++)
cin >> va[i];
for (int j = 0; j < n; j++)
cin >> vb[j];
int sum = 0;
for (int i = 0; i < n; i++) {
int x = min(va[i], vb[i]);
sum += x;
vb[i] -= x;
x = min(va[i + 1], vb[i]);
sum += x;
va[i + 1] -= x;
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> va(n + 1);
vector<int> vb(n);
for (int i = 0; i < n + 1; i++)
cin >> va[i];
for (int j = 0; j < n; j++)
cin >> vb[j];
long long sum = 0;
for (int i = 0; i < n; i++) {
int x = min(va[i], vb[i]);
sum += x;
vb[i] -= x;
x = min(va[i + 1], vb[i]);
sum += x;
va[i + 1] -= x;
}
cout << sum;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,033 | 767,034 | u494904817 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100000] = {}, b[100000] = {}, ans = 0;
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 (b[i] >= a[i]) {
ans += b[i] + min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100005] = {}, b[100005] = {}, ans = 0;
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 (b[i] >= a[i]) {
ans += a[i] + min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 767,037 | 767,036 | u401900157 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100000] = {}, b[100000] = {}, ans = 0;
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 (b[i] >= a[i]) {
ans += b[i] + min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
long long n, a[100005] = {}, b[100005] = {}, ans = 0;
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 (b[i] >= a[i]) {
ans += a[i] + min(a[i + 1], b[i] - a[i]);
a[i + 1] -= min(a[i + 1], b[i] - a[i]);
} else {
ans += b[i];
}
}
cout << ans << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change"
] | 767,038 | 767,036 | u401900157 | cpp |
p02959 | #include <iostream>
#include <string>
using namespace std;
#define MAX 100005
#define min(x, y) ((x) < (y)) ? x : y
int main() {
unsigned int N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int tmpii = min(A[0], B[0]);
int tmpii_1 = min(A[1], B[0] - tmpii);
int sum = tmpii + tmpii_1;
for (int i = 1; i < N; i++) {
tmpii = min(A[i] - tmpii_1, B[i]);
sum += tmpii;
tmpii_1 = min(A[i + 1], B[i] - tmpii);
sum += tmpii_1;
}
cout << sum << endl;
} | #include <iostream>
#include <string>
using namespace std;
#define MAX 100005
#define min(x, y) ((x) < (y)) ? x : y
int main() {
long N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long tmpii = min(A[0], B[0]);
long tmpii_1 = min(A[1], B[0] - tmpii);
long sum = tmpii + tmpii_1;
for (int i = 1; i < N; i++) {
tmpii = min(A[i] - tmpii_1, B[i]);
sum += tmpii;
tmpii_1 = min(A[i + 1], B[i] - tmpii);
sum += tmpii_1;
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 767,044 | 767,045 | u652760628 | cpp |
p02959 | #include <iostream>
#include <string>
using namespace std;
#define MAX 100000
#define min(x, y) ((x) < (y)) ? x : y
int main() {
int N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int tmpii = min(A[0], B[0]);
int tmpii_1 = min(A[1], B[0] - tmpii);
int sum = tmpii + tmpii_1;
for (int i = 1; i < N; i++) {
tmpii = min(A[i] - tmpii_1, B[i]);
sum += tmpii;
tmpii_1 = min(A[i + 1], B[i] - tmpii);
sum += tmpii_1;
}
cout << sum << endl;
} | #include <iostream>
#include <string>
using namespace std;
#define MAX 100005
#define min(x, y) ((x) < (y)) ? x : y
int main() {
long N, A[MAX], B[MAX];
string judge = "Yes";
cin >> N;
for (int i = 0; i <= N; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long tmpii = min(A[0], B[0]);
long tmpii_1 = min(A[1], B[0] - tmpii);
long sum = tmpii + tmpii_1;
for (int i = 1; i < N; i++) {
tmpii = min(A[i] - tmpii_1, B[i]);
sum += tmpii;
tmpii_1 = min(A[i + 1], B[i] - tmpii);
sum += tmpii_1;
}
cout << sum << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.primitive.change"
] | 767,046 | 767,045 | u652760628 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int right, left;
int ans = 0;
for (int i = 0; i < n; i++) {
left = min(a[i], b[i]);
ans += left;
b[i] -= left;
a[i] -= left;
right = min(a[i + 1], b[i]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
// int ans = 0;
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int b[n];
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int right, left;
long long ans = 0;
for (int i = 0; i < n; i++) {
left = min(a[i], b[i]);
ans += left;
b[i] -= left;
a[i] -= left;
right = min(a[i + 1], b[i]);
ans += right;
a[i + 1] -= right;
b[i] -= right;
}
// int ans = 0;
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 767,050 | 767,051 | u420421811 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<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) {
ll left = min(a[i], b[i]);
a[i] -= left;
b[i] -= left;
ans += left;
ll right = min(a[i + 1], b[n]);
a[i + 1] -= right;
b[i] -= right;
ans += right;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<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) {
ll left = min(a[i], b[i]);
a[i] -= left;
b[i] -= left;
ans += left;
ll right = min(a[i + 1], b[i]);
a[i + 1] -= right;
b[i] -= right;
ans += right;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 767,061 | 767,062 | u681559222 | cpp |
p02959 | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stdlib.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define rank qwertyuio
#define next dfghjk
#define plus fsghsf
#define minus ytryr
#define pb push_back
using namespace std;
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
const int N = 100000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int mod = (int)1e9 + 7;
const int mod1 = (int)1e9 + 9;
const int mod2 = 998244353;
const ld eps = 1e-12;
const double pi = atan2(0, -1);
const int ABC = 26;
#define ent '\n'
ll fac[100007];
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
bool sortbyfirst(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
ll power(ll x, ll y) {
ll res = 1; // Initialize result
x = x % mod; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % mod;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % mod;
}
return res;
}
ll modInverse(ll n) { return power(n, mod - 2); }
ll nCrModPFermat(ll n, ll r) {
// Base case
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r]) % mod * modInverse(fac[n - r]) % mod) %
mod;
}
// int saved[1000000007];
ll binarySearch(vector<ll> arr, ll l, ll r, ll x) {
if (r >= l) {
ll mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
ll findPos(vector<ll> arr, ll key) {
ll l = 0, h = 1;
ll val = arr[0];
// Find h to do binary search
while (val < key) {
l = h; // store previous high
h = 2 * h; // double high index
val = arr[h]; // update new val
}
return binarySearch(arr, l, h, key);
}
vector<pii> seg;
vector<vector<int>> result(10005);
int main() {
// freopen("a.in", "r", stdin);
// freopen("a.out", "w", stdout);<<" "
/*int t;
cin>>t;
while(t--){
}*/
int n;
cin >> n;
ll a[n + 1];
ll b[n];
int i;
rep(i, 0, n + 1) { cin >> a[i]; }
rep(i, 0, n) { cin >> b[i]; }
int remain = a[0];
int ans = 0;
rep(i, 0, n) {
if (b[i] > remain) {
if (a[i + 1] - b[i] + remain >= 0) {
ans += b[i];
remain = a[i + 1] - b[i] + remain;
} else {
ans += remain + a[i + 1];
remain = 0;
}
} else {
ans += b[i];
remain = a[i + 1];
}
}
cout << ans;
return 0;
} | //#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <queue>
#include <random>
#include <set>
#include <stdlib.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define rank qwertyuio
#define next dfghjk
#define plus fsghsf
#define minus ytryr
#define pb push_back
using namespace std;
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
const int N = 100000;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int mod = (int)1e9 + 7;
const int mod1 = (int)1e9 + 9;
const int mod2 = 998244353;
const ld eps = 1e-12;
const double pi = atan2(0, -1);
const int ABC = 26;
#define ent '\n'
ll fac[100007];
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
bool sortbyfirst(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
ll power(ll x, ll y) {
ll res = 1; // Initialize result
x = x % mod; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % mod;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % mod;
}
return res;
}
ll modInverse(ll n) { return power(n, mod - 2); }
ll nCrModPFermat(ll n, ll r) {
// Base case
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r]) % mod * modInverse(fac[n - r]) % mod) %
mod;
}
// int saved[1000000007];
ll binarySearch(vector<ll> arr, ll l, ll r, ll x) {
if (r >= l) {
ll mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
ll findPos(vector<ll> arr, ll key) {
ll l = 0, h = 1;
ll val = arr[0];
// Find h to do binary search
while (val < key) {
l = h; // store previous high
h = 2 * h; // double high index
val = arr[h]; // update new val
}
return binarySearch(arr, l, h, key);
}
vector<pii> seg;
vector<vector<int>> result(10005);
int main() {
// freopen("a.in", "r", stdin);
// freopen("a.out", "w", stdout);<<" "
/*int t;
cin>>t;
while(t--){
}*/
int n;
cin >> n;
ll a[n + 1];
ll b[n];
int i;
rep(i, 0, n + 1) { cin >> a[i]; }
rep(i, 0, n) { cin >> b[i]; }
ll remain = a[0];
ll ans = 0;
rep(i, 0, n) {
if (b[i] > remain) {
if (a[i + 1] - b[i] + remain >= 0) {
ans += b[i];
remain = a[i + 1] - b[i] + remain;
} else {
ans += remain + a[i + 1];
remain = 0;
}
} else {
ans += b[i];
remain = a[i + 1];
}
}
cout << ans;
return 0;
} | [
"variable_declaration.type.change"
] | 767,063 | 767,064 | u166277273 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int N;
cin >> N;
vi A(N), B(N - 1);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int count = 0;
rep(i, N) {
// 正面撃破
// モンスターの方が多い場合
if (A[i] >= B[i]) {
count += B[i];
A[i] -= B[i];
B[i] = 0;
continue;
}
// 勇者の方が多い場合
else if (A[i] < B[i]) {
count += A[i];
B[i] -= A[i];
A[i] = 0;
}
// 右隣撃破
// モンスターの方が多い場合
if (A[i + 1] >= B[i]) {
count += B[i];
A[i + 1] -= B[i];
B[i] = 0;
continue;
}
// 勇者の方が多い場合
else if (A[i] < B[i]) {
count += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define rep(i, n) for (int i = 0; i < n; i++)
int main(void) {
int N;
cin >> N;
vi A(N + 1), B(N);
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
long count = 0;
rep(i, N) {
// 正面撃破
// モンスターの方が多い場合
if (A[i] >= B[i]) {
count += B[i];
A[i] -= B[i];
B[i] = 0;
continue;
}
// 勇者の方が多い場合
else if (A[i] < B[i]) {
count += A[i];
B[i] -= A[i];
A[i] = 0;
}
// 右隣撃破
// モンスターの方が多い場合
if (A[i + 1] >= B[i]) {
count += B[i];
A[i + 1] -= B[i];
B[i] = 0;
continue;
}
// 勇者の方が多い場合
else if (A[i] < B[i]) {
count += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
}
}
cout << count << endl;
return 0;
} | [
"expression.operation.binary.remove",
"variable_declaration.type.primitive.change"
] | 767,070 | 767,069 | u664652017 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define fi(p) for (int i = 0; i < (p); i++)
#define ce(d) cout << d << endl;
#define ll long long
#define sorts(c) sort((c).begin(), (c).end());
using namespace std;
void solve() {
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
fi(N + 1) { cin >> A[i]; }
fi(N) { cin >> B[i]; }
ll res = 0;
fi(N) {
if (B[i] >= A[i]) {
res += A[i];
B[i] -= A[i];
A[i] = 0;
} else {
res += B[i];
A[i] -= B[i];
B[i] = 0;
}
if (B[i] >= A[i + 1]) {
res += A[i + 1];
B[i] -= A[i + 1];
A[i] = 0;
} else {
res += B[i];
A[i + 1] -= B[i];
B[i] = 0;
}
}
ce(res)
}
int main() {
solve();
int a; //止める用
cin >> a;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define fi(p) for (int i = 0; i < (p); i++)
#define ce(d) cout << d << endl;
#define ll long long
#define sorts(c) sort((c).begin(), (c).end());
using namespace std;
void solve() {
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
fi(N + 1) { cin >> A[i]; }
fi(N) { cin >> B[i]; }
ll res = 0;
fi(N) {
if (B[i] >= A[i]) {
res += A[i];
B[i] -= A[i];
A[i] = 0;
} else {
res += B[i];
A[i] -= B[i];
B[i] = 0;
}
if (B[i] >= A[i + 1]) {
res += A[i + 1];
B[i] -= A[i + 1];
A[i + 1] = 0;
} else {
res += B[i];
A[i + 1] -= B[i];
B[i] = 0;
}
}
ce(res)
}
int main() {
solve();
int a; //止める用
cin >> a;
return 0;
}
| [
"assignment.change"
] | 767,080 | 767,081 | u411637381 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int answer = 0;
for (int i = 0; i < N; i++) {
int left = min(A[i], B[i]);
answer += left;
// i番目の町のモンスターと勇者の倒せる数を減らす。
A[i] -= left;
B[i] -= left;
int right = min(A[i + 1], B[i]);
// i+1番目の町のモンスターとi番目の勇者の倒せる数を減らす
answer += right;
A[i + 1] -= right;
B[i] -= right;
}
// 出力
cout << answer << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
// 入力
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long answer = 0;
for (int i = 0; i < N; i++) {
long left = min(A[i], B[i]);
answer += left;
// i番目の町のモンスターと勇者の倒せる数を減らす。
A[i] -= left;
B[i] -= left;
long right = min(A[i + 1], B[i]);
// i+1番目の町のモンスターとi番目の勇者の倒せる数を減らす
answer += right;
A[i + 1] -= right;
B[i] -= right;
}
// 出力
cout << answer << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 767,086 | 767,087 | u865500049 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) > b.at(i))
count += b.at(i);
if (a.at(i) < b.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) = a.at(i + 1) - (b.at(i) - a.at(i));
} else {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << count;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (int i = 0; i < n; i++) {
cin >> b.at(i);
}
long int count = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) >= b.at(i))
count += b.at(i);
if (a.at(i) < b.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) = a.at(i + 1) - (b.at(i) - a.at(i));
} else {
count += a.at(i + 1);
a.at(i + 1) = 0;
}
}
}
cout << count;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 767,088 | 767,089 | u431602218 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
int answer = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= 1; j++) {
int attack = min(A[i + j], B[i]);
answer += attack;
A[i + j] -= attack;
B[i] -= attack;
}
}
cout << answer << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
vector<int> B(N);
for (int i = 0; i < N; i++)
cin >> B[i];
int64_t answer = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j <= 1; j++) {
int64_t attack = min(A[i + j], B[i]);
answer += attack;
A[i + j] -= attack;
B[i] -= attack;
}
}
cout << answer << "\n";
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 767,090 | 767,091 | u599568485 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N, monster = 0, help = 0;
cin >> N;
int A[N + 1], B[N + 1];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
B[N] = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] <= help + B[i]) {
monster += A[i];
if (help <= A[i]) {
help = B[i] - A[i] + help;
} else {
help = B[i];
}
} else {
monster += help + B[i];
help = 0;
}
}
cout << monster << endl;
} | #include <iostream>
using namespace std;
int main() {
int N, help = 0;
long long monster = 0;
cin >> N;
int A[N + 1], B[N + 1];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
B[N] = 0;
for (int i = 0; i < N + 1; i++) {
if (A[i] <= help + B[i]) {
monster += A[i];
if (help <= A[i]) {
help = B[i] - A[i] + help;
} else {
help = B[i];
}
} else {
monster += help + B[i];
help = 0;
}
}
cout << monster << endl;
} | [
"variable_declaration.remove",
"variable_declaration.add"
] | 767,094 | 767,095 | u979181068 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define fi first
#define se second
#define pb push_back
#define pll pair<ll, ll>
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vi>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void fastik() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
// ifstream &cin
void solve() {}
int main() {
fastik();
// ifstream cin("input.txt");
/*ll t = 1;
cin >> t;
while (t--) {
solve();
}*/
ll n;
cin >> n;
vll a(n + 1), b(n);
forn(i, n + 1) cin >> a[i];
forn(i, n) cin >> b[i];
ll ans = 0;
forn(i, n) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
if (b[i] > 0) {
ans += min(a[i + 1], b[i]);
a[i] -= min(a[i + 1], b[i]);
}
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define fi first
#define se second
#define pb push_back
#define pll pair<ll, ll>
#define vi vector<int>
#define vb vector<bool>
#define vvi vector<vi>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
void fastik() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
// ifstream &cin
void solve() {}
int main() {
fastik();
// ifstream cin("input.txt");
/*ll t = 1;
cin >> t;
while (t--) {
solve();
}*/
ll n;
cin >> n;
vll a(n + 1), b(n);
forn(i, n + 1) cin >> a[i];
forn(i, n) cin >> b[i];
ll ans = 0;
forn(i, n) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
if (b[i] > 0) {
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
}
cout << ans;
return 0;
}
| [
"assignment.change"
] | 767,096 | 767,097 | u629521741 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
int solve() {
ll N;
cin >> N;
vector<int> ai = fetch_vec<int>(N + 1);
vector<int> bi = fetch_vec<int>(N);
ll counter = 0;
for (int i = 0; i < N; ++i) {
ll tmp = std::min(bi[i], ai[i]);
counter += tmp;
bi[i] -= tmp;
ai[i] -= tmp;
if (bi[i] > 0) {
tmp = std::min(bi[i], ai[i + 1]);
counter += tmp;
bi[i] -= tmp;
ai[i] -= tmp;
}
}
cout << counter << endl;
return 0;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
int solve() {
ll N;
cin >> N;
vector<int> ai = fetch_vec<int>(N + 1);
vector<int> bi = fetch_vec<int>(N);
ll counter = 0;
for (int i = 0; i < N; ++i) {
ll tmp = std::min(bi[i], ai[i]);
counter += tmp;
bi[i] -= tmp;
ai[i] -= tmp;
if (bi[i] > 0) {
tmp = std::min(bi[i], ai[i + 1]);
counter += tmp;
bi[i] -= tmp;
ai[i + 1] -= tmp;
}
}
cout << counter << endl;
return 0;
}
int main() {
solve();
return 0;
} | [
"assignment.change"
] | 767,098 | 767,099 | u187453157 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
int solve() {
ll N;
cin >> N;
vector<int> ai = fetch_vec<int>(N + 1);
vector<int> bi = fetch_vec<int>(N);
int counter = 0;
for (int i = 0; i < N; ++i) {
int tmp = std::min(bi[i], ai[i]);
counter += tmp;
bi[i] -= tmp;
ai[i] -= tmp;
if (bi[i] > 0) {
tmp = std::min(bi[i], ai[i + 1]);
counter += tmp;
bi[i] -= tmp;
ai[i] -= tmp;
}
}
cout << counter << endl;
return 0;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define len(X) ((int)(X).size())
#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INT_INF = (int)(2e9);
const ll LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
std::string pad(int num) {
char buffer[4];
std::snprintf(buffer, sizeof(buffer), "%03d", num);
return buffer;
}
inline ll randint(ll a, ll b) {
ll w = (_g() << 31LL) ^ _g();
return a + w % (b - a + 1);
}
inline void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
};
template <typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template <typename T, typename S>
inline ostream &operator<<(ostream &os, const pair<T, S> p) {
cout << "[" << p.first << ";" << p.second << "]";
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto el : v)
cout << el << " ";
return os;
}
template <typename T> inline T fetch() {
T ret;
cin >> ret;
return ret;
}
template <typename T> inline vector<T> fetch_vec(int sz) {
vector<T> ret(sz);
for (auto &elem : ret)
cin >> elem;
return ret;
}
int solve() {
ll N;
cin >> N;
vector<int> ai = fetch_vec<int>(N + 1);
vector<int> bi = fetch_vec<int>(N);
ll counter = 0;
for (int i = 0; i < N; ++i) {
ll tmp = std::min(bi[i], ai[i]);
counter += tmp;
bi[i] -= tmp;
ai[i] -= tmp;
if (bi[i] > 0) {
tmp = std::min(bi[i], ai[i + 1]);
counter += tmp;
bi[i] -= tmp;
ai[i + 1] -= tmp;
}
}
cout << counter << endl;
return 0;
}
int main() {
solve();
return 0;
} | [
"variable_declaration.type.change",
"assignment.change"
] | 767,100 | 767,099 | u187453157 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int M = 0;
for (int i = 0; i < N + 1; i++)
M += A[i];
int L = 0;
for (int i = N - 1; i >= 0; i--) {
if (A[i + 1] > B[i]) {
L += A[i + 1] - B[i];
B[i] = 0;
} else {
if (A[i] > B[i] - A[i + 1])
A[i] -= (B[i] - A[i + 1]);
else
A[i] = 0;
A[i + 1] = 0;
}
}
L += A[0];
cout << M - L << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long M = 0;
for (int i = 0; i < N + 1; i++)
M += A[i];
long L = 0;
for (int i = N - 1; i >= 0; i--) {
if (A[i + 1] > B[i]) {
L += A[i + 1] - B[i];
B[i] = 0;
} else {
if (A[i] > B[i] - A[i + 1])
A[i] -= (B[i] - A[i + 1]);
else
A[i] = 0;
A[i + 1] = 0;
}
}
L += A[0];
cout << M - L << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 767,101 | 767,102 | u089578476 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.