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 |
|---|---|---|---|---|---|---|---|
p02958 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
int p[n], ps[n];
for (int i = 0; i < n; ++i) {
cin >> p[i];
ps[i] = p[i];
}
sort(ps, ps + n);
for (int i = 0; i < n; ++i) {
if (p[i] != ps[i])
count++;
}
if (count == 2 || count == 0) {
cout << "Yes" << '\n';
} else {
cout << "No" << '\n';
}
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
int p[n], ps[n];
for (int i = 0; i < n; ++i) {
cin >> p[i];
ps[i] = p[i];
}
sort(ps, ps + n);
for (int i = 0; i < n; ++i) {
if (p[i] != ps[i])
count++;
}
if (count == 2 || count == 0) {
cout << "YES" << '\n';
} else {
cout << "NO" << '\n';
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,731 | 765,732 | u021083776 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
bool isprime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
ll n;
cin >> n;
ll p[n + 1], i;
for (i = 1; i < n; i++) {
cin >> p[i];
}
ll ctr = 0;
for (i = 1; i <= n; i++) {
if (p[i] != i) {
ctr++;
}
}
if (ctr == 2 || ctr == 0) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
bool isprime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
ll n;
cin >> n;
ll p[n + 1], i;
for (i = 1; i <= n; i++) {
cin >> p[i];
}
ll ctr = 0;
for (i = 1; i <= n; i++) {
if (p[i] != i) {
ctr++;
}
}
if (ctr == 2 || ctr == 0) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 765,733 | 765,734 | u688707061 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EACH(begin, end) for (auto itr = (begin); itr != (end); itr++)
/* function */
#define IN(x) cin >> x
#define DEBUG(x) cerr << (x) << " "
#define PRINT(x) cout << (x) << endl
#define BR cout << endl
/* const */
const int INF = 1001001001; // 10^9
const ll LINF = 1001001001001001001; // 10^18
const int MOD = 1e9 + 7;
ll N = 0;
ll ret = 0;
void input() { IN(N); }
void solve() {
int cnt = 0;
REP(i, N) {
ll num = i + 1;
ll tmp;
IN(tmp);
if (tmp != num) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
PRINT("Yes");
} else {
PRINT("No");
}
}
int main(void) {
input();
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* short */
#define pb push_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
/* REPmacro */
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EACH(begin, end) for (auto itr = (begin); itr != (end); itr++)
/* function */
#define IN(x) cin >> x
#define DEBUG(x) cerr << (x) << " "
#define PRINT(x) cout << (x) << endl
#define BR cout << endl
/* const */
const int INF = 1001001001; // 10^9
const ll LINF = 1001001001001001001; // 10^18
const int MOD = 1e9 + 7;
ll N = 0;
ll ret = 0;
void input() { IN(N); }
void solve() {
int cnt = 0;
REP(i, N) {
ll num = i + 1;
ll tmp;
IN(tmp);
if (tmp != num) {
cnt++;
}
}
if (cnt == 2 || cnt == 0) {
PRINT("YES");
} else {
PRINT("NO");
}
}
int main(void) {
input();
solve();
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 765,735 | 765,736 | u790171360 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
int main() {
int N, a, count = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a;
if (i != a)
count++;
}
if (count == 2 || count == 0)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
int main() {
int N, a, count = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a;
if (i != a)
count++;
}
if (count == 2 || count == 0)
cout << "YES";
else
cout << "NO";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,737 | 765,738 | u776086908 | cpp |
p02958 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<ll> step;
void dfs(const Graph &G, int v, ll now) {
seen[v] = true; // v を訪問済にする
step[v] = now;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v] && (now + 1 >= step[next_v]))
continue; // next_v が探索済だったらスルー
dfs(G, next_v, now + 1); // 再帰的に探索
}
}
int main() {
// COMinit();
ll N;
cin >> N;
ll p[N];
ll ans = 0;
FOR(i, 0, N - 1) {
cin >> p[i];
if (i != p[i] - 1)
ans++;
}
if (ans <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
public:
//親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
//作るときはParentの値を全て-1にする
//こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //親をとってきたい]
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
struct Edge {
int to; // 辺の行き先
int weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<ll> step;
void dfs(const Graph &G, int v, ll now) {
seen[v] = true; // v を訪問済にする
step[v] = now;
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v] && (now + 1 >= step[next_v]))
continue; // next_v が探索済だったらスルー
dfs(G, next_v, now + 1); // 再帰的に探索
}
}
int main() {
// COMinit();
ll N;
cin >> N;
ll p[N];
ll ans = 0;
FOR(i, 0, N - 1) {
cin >> p[i];
if (i != p[i] - 1)
ans++;
}
if (ans <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,743 | 765,744 | u043443359 | cpp |
p02958 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int t = 1;
// cin >> t;
int tt = t;
while (t--) {
if (codejam)
cout << "Case #" << tt - t << ": ";
solve();
}
return 0;
}
const int N = 500;
int n;
int want[N], arr[N];
void solve() {
for (int i = 0; i < N; ++i)
want[i] = i + 1;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
swap(arr[i], arr[j]);
bool ok = true;
for (int k = 0; k < n; ++k) {
if (arr[k] != want[k])
ok = false;
}
if (ok) {
cout << "YES";
return;
}
swap(arr[i], arr[j]);
}
}
cout << "NO";
} | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define int long long
bool codejam = 0;
typedef long long li;
typedef long double ld;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int t = 1;
// cin >> t;
int tt = t;
while (t--) {
if (codejam)
cout << "Case #" << tt - t << ": ";
solve();
}
return 0;
}
const int N = 500;
int n;
int want[N], arr[N];
void solve() {
for (int i = 0; i < N; ++i)
want[i] = i + 1;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
swap(arr[i], arr[j]);
bool ok = true;
for (int k = 0; k < n; ++k) {
if (arr[k] != want[k])
ok = false;
}
if (ok) {
cout << "YES";
return;
}
swap(arr[i], arr[j]);
}
}
cout << "NO";
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 765,749 | 765,750 | u345794450 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p[i] > p[i + 1]) {
flg = false;
}
}
if (flg) {
cout << "Yes" << endl;
return 0;
}
rep(i, N) rep(j, i) {
swap(p[j], p[i]);
flg = true;
rep(k, N - 1) {
if (p[k] > p[k + 1]) {
flg = false;
break;
}
}
if (flg) {
cout << "YES" << endl;
return 0;
}
swap(p[j], p[i]);
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p[i] > p[i + 1]) {
flg = false;
}
}
if (flg) {
cout << "YES" << endl;
return 0;
}
rep(i, N) rep(j, i) {
swap(p[j], p[i]);
flg = true;
rep(k, N - 1) {
if (p[k] > p[k + 1]) {
flg = false;
break;
}
}
if (flg) {
cout << "YES" << endl;
return 0;
}
swap(p[j], p[i]);
}
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,759 | 765,760 | u992875223 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p[i] > p[i + 1]) {
flg = false;
}
}
if (flg) {
cout << "Yes" << endl;
return 0;
}
rep(i, N) rep(j, i) {
swap(p[j], p[i]);
flg = true;
rep(k, N - 1) {
if (p[k] > p[k + 1]) {
flg = false;
break;
}
}
if (flg) {
cout << "Yes" << endl;
return 0;
}
swap(p[j], p[i]);
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll MAX = 55;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int N, p[MAX];
int main() {
cin >> N;
rep(i, N) cin >> p[i];
bool flg = true;
rep(i, N - 1) {
if (p[i] > p[i + 1]) {
flg = false;
}
}
if (flg) {
cout << "YES" << endl;
return 0;
}
rep(i, N) rep(j, i) {
swap(p[j], p[i]);
flg = true;
rep(k, N - 1) {
if (p[k] > p[k + 1]) {
flg = false;
break;
}
}
if (flg) {
cout << "YES" << endl;
return 0;
}
swap(p[j], p[i]);
}
cout << "NO" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,761 | 765,760 | u992875223 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int c = 0;
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1)
c++;
}
if (c == 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int c = 0;
for (int i = 0; i < n; i++) {
if (arr[i] != i + 1)
c++;
}
if (c == 2 || c == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 765,766 | 765,767 | u082318524 | cpp |
p02958 | #include <stdio.h>
int main() {
int i, n, d = 0;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != i + i) {
d++;
}
}
if (d == 0 || d == 2) {
printf("YES");
} else {
printf("NO");
}
} | #include <stdio.h>
int main() {
int i, n, d = 0;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] != i + 1) {
d++;
}
}
if (d == 0 || d == 2) {
printf("YES");
} else {
printf("NO");
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 765,777 | 765,778 | u222643545 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
vector<lll> p, s;
p.resize(n);
for (ii = 0; ii < n; ii++) {
cin >> p[ii];
}
s = p;
sort(s.begin(), s.end());
// for(ii=0;ii<n;ii++){
// cout << s[ii] << " ";
//}
num = 0;
for (ii = 0; ii < n; ii++) {
if (s[ii] != p[ii]) {
num++;
}
}
if (num <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
vector<lll> p, s;
p.resize(n);
for (ii = 0; ii < n; ii++) {
cin >> p[ii];
}
s = p;
sort(s.begin(), s.end());
// for(ii=0;ii<n;ii++){
// cout << s[ii] << " ";
//}
num = 0;
for (ii = 0; ii < n; ii++) {
if (s[ii] != p[ii]) {
num++;
}
}
if (num <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,779 | 765,780 | u146847434 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
vector<lll> p, s;
p.resize(n);
for (ii = 0; ii < n; ii++) {
cin >> p[ii];
}
s = p;
sort(s.begin(), s.end());
// for(ii=0;ii<n;ii++){
// cout << s[ii] << " ";
//}
num = 0;
for (ii = 0; ii < n; ii++) {
if (s[ii] != p[ii]) {
num++;
}
}
if (num <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
using lll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
lll ii, jj, kk;
lll n, num;
cin >> n;
vector<lll> p, s;
p.resize(n);
for (ii = 0; ii < n; ii++) {
cin >> p[ii];
}
s = p;
sort(s.begin(), s.end());
// for(ii=0;ii<n;ii++){
// cout << s[ii] << " ";
//}
num = 0;
for (ii = 0; ii < n; ii++) {
if (s[ii] != p[ii]) {
num++;
}
}
if (num <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,781 | 765,780 | u146847434 | cpp |
p02958 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define dump(x) cerr << #x << "=" << (x) << endl;
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(x) \
int(x); \
cin >> x
#define INS(x) \
string(s); \
cin >> s
#define INL(x) \
ll(x); \
cin >> x
#define VINT(a, n) vector<int> a(n)
#define VIN(a, n) \
VINT(a, n); \
REP(i, n) { cin >> a[i]; }
#define ALL(x) (x).begin(), (x).end()
int main() {
IN(n);
VIN(p, n);
bool done = false;
REP(i, n) {
if (p[i] != i + 1) {
if (done) {
cout << "NO";
return 0;
} else {
int val = p[i];
if (p[val - 1] == i + 1) {
p[val - 1] = val;
done = true;
} else {
cout << "NO";
return 0;
}
}
}
}
cout << "Yes";
}
| #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define dump(x) cerr << #x << "=" << (x) << endl;
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define IN(x) \
int(x); \
cin >> x
#define INS(x) \
string(s); \
cin >> s
#define INL(x) \
ll(x); \
cin >> x
#define VINT(a, n) vector<int> a(n)
#define VIN(a, n) \
VINT(a, n); \
REP(i, n) { cin >> a[i]; }
#define ALL(x) (x).begin(), (x).end()
int main() {
IN(n);
VIN(p, n);
bool done = false;
REP(i, n) {
if (p[i] != i + 1) {
if (done) {
cout << "NO";
return 0;
} else {
int val = p[i];
if (p[val - 1] == i + 1) {
p[val - 1] = val;
done = true;
} else {
cout << "NO";
return 0;
}
}
}
}
cout << "YES";
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,790 | 765,791 | u934954661 | cpp |
p02958 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> p(n), q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
ll cnt = 0;
rep(i, n) {
if (p[i] != q[i])
cnt++;
}
if (cnt <= 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> p(n), q(n);
rep(i, n) {
cin >> p[i];
q[i] = p[i];
}
sort(p.begin(), p.end());
ll cnt = 0;
rep(i, n) {
if (p[i] != q[i])
cnt++;
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,795 | 765,796 | u201316840 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + m) % m;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef set<int> si;
typedef map<string, int> msi;
#define all(x) (x).begin(), (x).end()
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define loop(i, b, n) for (int i = b; i < n; i++)
#define loopv(i, b, n, a) for (int i = b; i < n; i += a)
#define loopr(i, b, n) for (int i = n; i >= 0; i--)
#define sum(a) (accumulate((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) (min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) (max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) (lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) (upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << "\n\n" \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms\n\n"; \
return 0
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define modA(a, b) (((a % MOD) + (b % MOD)) % MOD)
#define modS(a, b) \
(((((a % MOD) - (b % MOD)) % MOD) < 0) \
? (int)(MOD + ((a % MOD) - (b % MOD)) % MOD) \
: (int)(((a % MOD) - (b % MOD)) % MOD))
#define modM(a, b) (int)((((ll)(a % MOD)) * ((ll)(b % MOD))) % MOD)
#define modD(a, b) ((modI(b, MOD) * (a % MOD)) % MOD)
ll modP(ll x, ll y) {
ll r = 1;
x %= MOD;
while (y > 0) {
if (y & 1) {
r = (r * x) % MOD;
}
y = y >> 1;
x = (x * x) % MOD;
}
return r;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
// start_routine();
ll t, sum = 0, ans = 0, n;
// cin>>t;
// while(t--) { cin>>n ; }
cin >> n;
vector<ll> a(n), u(n);
loop(i, 0, n) cin >> a[i];
u = a;
sort(all(u));
ll c = 0;
loop(i, 0, n) if (a[i] == u[i]) c++;
if (c == n - 2 || c == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int gcdEx(int a, int b, int *x, int *y) {
if (!a) {
*x = 0;
*y = 1;
return b;
}
int x1, y1, gcd = gcdEx(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd;
}
int modI(int b, int m) {
int x, y;
gcdEx(b, m, &x, &y);
return (x % m + m) % m;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef set<int> si;
typedef map<string, int> msi;
#define all(x) (x).begin(), (x).end()
#define make_unique(x) \
sort(all((x))); \
(x).resize(unique(all((x))) - (x).begin())
#define loop(i, b, n) for (int i = b; i < n; i++)
#define loopv(i, b, n, a) for (int i = b; i < n; i += a)
#define loopr(i, b, n) for (int i = n; i >= 0; i--)
#define sum(a) (accumulate((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) (min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) (max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) (lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) (upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define start_routine() int begtime = clock();
#define end_routine() \
int endtime = clock(); \
cerr << "\n\n" \
<< "Time elapsed: " << (endtime - begtime) * 1000 / CLOCKS_PER_SEC \
<< " ms\n\n"; \
return 0
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define modA(a, b) (((a % MOD) + (b % MOD)) % MOD)
#define modS(a, b) \
(((((a % MOD) - (b % MOD)) % MOD) < 0) \
? (int)(MOD + ((a % MOD) - (b % MOD)) % MOD) \
: (int)(((a % MOD) - (b % MOD)) % MOD))
#define modM(a, b) (int)((((ll)(a % MOD)) * ((ll)(b % MOD))) % MOD)
#define modD(a, b) ((modI(b, MOD) * (a % MOD)) % MOD)
ll modP(ll x, ll y) {
ll r = 1;
x %= MOD;
while (y > 0) {
if (y & 1) {
r = (r * x) % MOD;
}
y = y >> 1;
x = (x * x) % MOD;
}
return r;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
// start_routine();
ll t, sum = 0, ans = 0, n;
// cin>>t;
// while(t--) { cin>>n ; }
cin >> n;
vector<ll> a(n), u(n);
loop(i, 0, n) cin >> a[i];
u = a;
sort(all(u));
ll c = 0;
loop(i, 0, n) if (a[i] == u[i]) c++;
if (c == n - 2 || c == n)
cout << "YES";
else
cout << "NO";
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 765,799 | 765,800 | u755134895 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
ans++;
}
}
if (ans == 0 || ans == 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (p[i] != i + 1) {
ans++;
}
}
if (ans == 0 || ans == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,801 | 765,802 | u745852541 | cpp |
p02958 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
rep(i, N) {
int a;
cin >> a;
ans += (a != (N - i));
}
if (ans <= 2)
cout << "YES";
else
cout << "NO";
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0;
rep(i, N) {
int a;
cin >> a;
ans += (a != (i + 1));
}
if (ans <= 2)
cout << "YES";
else
cout << "NO";
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 765,805 | 765,806 | u923676814 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> p(N);
rep(i, N) { cin >> p[i]; }
rep(k, N - 1) {
if (p[k] > p[k + 1]) {
break;
}
if (k == N - 2) {
YES;
return 0;
}
}
rep(i, N) {
for (ll j = i + 1; j <= N; j++) {
vector<ll> vec(N);
copy(p.begin(), p.end(), vec.begin());
ll tmp = vec[i];
vec[i] = vec[j];
vec[j] = tmp;
rep(k, N - 1) {
if (vec[k] > vec[k + 1]) {
break;
}
if (k == N - 2) {
YES;
return 0;
}
}
}
}
NO;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
int main(int argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
vector<ll> p(N);
rep(i, N) { cin >> p[i]; }
rep(k, N - 1) {
if (p[k] > p[k + 1]) {
break;
}
if (k == N - 2) {
YES;
return 0;
}
}
rep(i, N) {
for (ll j = i + 1; j < N; j++) {
vector<ll> vec(N);
copy(p.begin(), p.end(), vec.begin());
ll tmp = vec[i];
vec[i] = vec[j];
vec[j] = tmp;
rep(k, N - 1) {
if (vec[k] > vec[k + 1]) {
break;
}
if (k == N - 2) {
YES;
return 0;
}
}
}
}
NO;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 765,807 | 765,808 | u458798873 | cpp |
p02958 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define sz size()
#define all(A) A.begin(), A.end()
#define mem(a, b) \
memset(a, b, sizeof(a)) // all elements of A are b=0 or b=-1 else don't work
#define f0(i, b) for (ll i = 0; i < (b); i++)
#define f1(i, b) for (ll i = 1; i <= (b); i++)
#define f2(i, a, b) for (ll i = (a); i <= (b); i++)
#define f3(i, b, a) for (ll i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (ll i = (a); i != (b); i += (c))
#define mod 1000000007
#define whilee(i, t) while (i != t)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
#define scan(x) \
do { \
while ((x = getchar()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar()); x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
// for(auto it =A.begin(); it!=A.end(); it++)
// sort(A.begin(),A.end());
// binary_search(A.begin(),A.end(),x);
// reverse(A.begin(), A.end());
// cout << *max_element(A.begin(), A.end());
// cout << *min_element(A.begin(), A.end());
// count(A.begin(), A.end(), X); //counts the occurrences of X
// distance(A.begin(),A.end()); //distance between first to last element
// accumulate(A.begin(), A.end(), 0); //add
// next_permutation(A.begin(), A.end());
// prev_permutation(A.begin(), A.end());
// swap(S[0], T[0]);
// scanf("%lld",&x);
// printf("%lld\n",x);
// while (scanf("%lld %lld", &a, &b) == 2)
// printf("Case %lld: %lld\n", t++, a);
// vector <ll> A;
// deque <ll> A;
// queue <ll> A;
// stack <ll> A;
// list <int> A;
// set <ll> A;
// map <ll,ll> A;
// pair <ll,ll> A ;
// vector <pair <ll,ll>> A ;
// bitset<32> bset1;
// char ch;
// string S, T, U;
ll i, j, k, a, b, c, d, e, f, g, h, l, m, n, o, p, q, r, s,
t = 1, u, v, w, x, y, z, maxx = INT_MIN, minn = INT_MAX, ans = 0, sum = 0,
cnt = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); // NULL
cout.tie(nullptr); // NULL
// scan(n);
cin >> n;
ll A[n], B[i];
f0(i, n) {
cin >> A[i];
B[i] = A[i];
}
sort(B, B + n);
f0(i, n) {
if (A[i] != B[i]) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define sz size()
#define all(A) A.begin(), A.end()
#define mem(a, b) \
memset(a, b, sizeof(a)) // all elements of A are b=0 or b=-1 else don't work
#define f0(i, b) for (ll i = 0; i < (b); i++)
#define f1(i, b) for (ll i = 1; i <= (b); i++)
#define f2(i, a, b) for (ll i = (a); i <= (b); i++)
#define f3(i, b, a) for (ll i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (ll i = (a); i != (b); i += (c))
#define mod 1000000007
#define whilee(i, t) while (i != t)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
#define scan(x) \
do { \
while ((x = getchar()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar()); x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
// for(auto it =A.begin(); it!=A.end(); it++)
// sort(A.begin(),A.end());
// binary_search(A.begin(),A.end(),x);
// reverse(A.begin(), A.end());
// cout << *max_element(A.begin(), A.end());
// cout << *min_element(A.begin(), A.end());
// count(A.begin(), A.end(), X); //counts the occurrences of X
// distance(A.begin(),A.end()); //distance between first to last element
// accumulate(A.begin(), A.end(), 0); //add
// next_permutation(A.begin(), A.end());
// prev_permutation(A.begin(), A.end());
// swap(S[0], T[0]);
// scanf("%lld",&x);
// printf("%lld\n",x);
// while (scanf("%lld %lld", &a, &b) == 2)
// printf("Case %lld: %lld\n", t++, a);
// vector <ll> A;
// deque <ll> A;
// queue <ll> A;
// stack <ll> A;
// list <int> A;
// set <ll> A;
// map <ll,ll> A;
// pair <ll,ll> A ;
// vector <pair <ll,ll>> A ;
// bitset<32> bset1;
// char ch;
// string S, T, U;
ll i, j, k, a, b, c, d, e, f, g, h, l, m, n, o, p, q, r, s,
t = 1, u, v, w, x, y, z, maxx = INT_MIN, minn = INT_MAX, ans = 0, sum = 0,
cnt = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); // NULL
cout.tie(nullptr); // NULL
// scan(n);
cin >> n;
ll A[n], B[n];
f0(i, n) {
cin >> A[i];
B[i] = A[i];
}
sort(B, B + n);
f0(i, n) {
if (A[i] != B[i]) {
cnt++;
}
}
if (cnt <= 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 765,811 | 765,812 | u779159351 | cpp |
p02958 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
int count = 0;
rep(i, N) {
if (p[i] != i + 1)
count++;
}
if (count < 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> p(N);
rep(i, N) cin >> p[i];
int count = 0;
rep(i, N) {
if (p[i] != i + 1)
count++;
}
if (count <= 2)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,817 | 765,818 | u608258653 | cpp |
p02958 | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (int i = 1; i <= N; i++) {
cin >> num;
if (i != num) {
e++;
}
}
if (e == 0 || e == 2) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
} | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (int i = 1; i <= N; i++) {
cin >> num;
if (i != num) {
e++;
}
}
if (e == 0 || e == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,821 | 765,822 | u380317210 | cpp |
p02958 | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (int i = 1; i <= N; i++) {
cin >> num;
if (i != num) {
e++;
}
}
if (e == 0 || e == 1) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
} | // Shift-JIS（シフトジス）
#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
int N;
cin >> N;
int num, e = 0;
for (int i = 1; i <= N; i++) {
cin >> num;
if (i != num) {
e++;
}
}
if (e == 0 || e == 2) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 765,823 | 765,822 | u380317210 | cpp |
p02958 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int c = 0;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
if (t != i)
c++;
}
cout << (c <= 2) ? "YES" : "NO";
return 0;
}
| #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int c = 0;
for (int i = 1; i <= n; i++) {
int t;
cin >> t;
if (t != i)
c++;
}
cout << ((c <= 2) ? "YES" : "NO");
return 0;
}
| [] | 765,829 | 765,830 | u770567389 | cpp |
p02958 | #include <stdio.h>
int main(void) {
int a[50];
int i;
int count;
int n;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i + 1 != a[i]) {
count++;
}
}
if (count == 2) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | #include <stdio.h>
int main(void) {
int a[50];
int i;
int count;
int n;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i + 1 != a[i]) {
count++;
}
}
if (count == 2 || count == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 765,831 | 765,832 | u966052848 | cpp |
p02958 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
rep(j, i) {
swap(a[i], a[j]);
if (is_sorted(a.begin(), a.end())) {
cout << "YES" << endl;
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(i, n) {
rep(j, i + 1) {
swap(a[i], a[j]);
if (is_sorted(a.begin(), a.end())) {
cout << "YES" << endl;
return 0;
}
swap(a[i], a[j]);
}
}
cout << "NO" << endl;
} | [
"expression.operation.binary.add"
] | 765,837 | 765,838 | u006493569 | cpp |
p02959 | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define Speed() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define forn(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
template <class T> void umin(T &a, T b) { a = min(a, b); }
template <class T> void umax(T &a, T b) { a = max(a, b); }
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1e9, mod = 1e9 + 7, N = 2e5 + 5;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
int ans = 0;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
int x = a[i + 1];
a[i + 1] = max(0, a[i + 1] - (b[i] - a[i]));
ans += x - a[i + 1];
}
}
cout << ans;
}
int main() {
Speed();
int T = 1;
// cin>>T;
while (T--)
solve();
} | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define f first
#define s second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define Speed() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, n) for (int i = 0; i < n; ++i)
#define forn(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
template <class T> void umin(T &a, T b) { a = min(a, b); }
template <class T> void umax(T &a, T b) { a = max(a, b); }
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1e9, mod = 1e9 + 7, N = 2e5 + 5;
void solve() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
ll ans = 0;
rep(i, n) { cin >> b[i]; }
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
ans += a[i];
int x = a[i + 1];
a[i + 1] = max(0, a[i + 1] - (b[i] - a[i]));
ans += x - a[i + 1];
}
}
cout << ans;
}
int main() {
Speed();
int T = 1;
// cin>>T;
while (T--)
solve();
} | [
"variable_declaration.type.change"
] | 765,848 | 765,849 | u002627851 | cpp |
p02959 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N + 1], B[N];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int res = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
res += B[i];
continue;
} 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 <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long A[N + 1], B[N];
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
long res = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
res += B[i];
continue;
} 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.primitive.change"
] | 765,850 | 765,851 | u580363327 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnMonstr, vector<int> &rvnBrave) {
int nMonstrSiz;
cin >> nMonstrSiz;
rvnMonstr.resize(nMonstrSiz + 1);
rvnBrave.resize(nMonstrSiz);
for (int &rnMonstr : rvnMonstr)
cin >> rnMonstr;
for (int &rnBrave : rvnBrave)
cin >> rnBrave;
}
int fnDeftMonstr(vector<int> &rvnMonstr, vector<int> &rvnBrave) {
int nDeftMonstr = 0;
for (int nBgn = 0; nBgn < rvnBrave.size(); nBgn++)
for (int nFoward = nBgn; nFoward < nBgn + 2; nFoward++)
if (rvnBrave[nBgn] <= rvnMonstr[nFoward]) {
nDeftMonstr += rvnBrave[nBgn];
rvnMonstr[nFoward] -= rvnBrave[nBgn];
rvnBrave[nBgn] = 0;
break;
} else {
nDeftMonstr += rvnMonstr[nFoward];
rvnBrave[nBgn] -= rvnMonstr[nFoward];
rvnMonstr[nFoward] = 0;
}
return nDeftMonstr;
}
int main() {
vector<int> vnMonstr, vnBrave;
fnInput(vnMonstr, vnBrave);
cout << fnDeftMonstr(vnMonstr, vnBrave) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnMonstr, vector<int> &rvnBrave) {
int nMonstrSiz;
cin >> nMonstrSiz;
rvnMonstr.resize(nMonstrSiz + 1);
rvnBrave.resize(nMonstrSiz);
for (int &rnMonstr : rvnMonstr)
cin >> rnMonstr;
for (int &rnBrave : rvnBrave)
cin >> rnBrave;
}
int64_t fnDeftMonstr(vector<int> &rvnMonstr, vector<int> &rvnBrave) {
int64_t nDeftMonstr = 0;
for (int nBgn = 0; nBgn < rvnBrave.size(); nBgn++)
for (int nFoward = nBgn; nFoward < nBgn + 2; nFoward++)
if (rvnBrave[nBgn] <= rvnMonstr[nFoward]) {
nDeftMonstr += rvnBrave[nBgn];
rvnMonstr[nFoward] -= rvnBrave[nBgn];
rvnBrave[nBgn] = 0;
break;
} else {
nDeftMonstr += rvnMonstr[nFoward];
rvnBrave[nBgn] -= rvnMonstr[nFoward];
rvnMonstr[nFoward] = 0;
}
return nDeftMonstr;
}
int main() {
vector<int> vnMonstr, vnBrave;
fnInput(vnMonstr, vnBrave);
cout << fnDeftMonstr(vnMonstr, vnBrave) << endl;
return 0;
} | [
"function.return_type.change",
"variable_declaration.type.primitive.change"
] | 765,852 | 765,853 | u439912527 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, b, c;
cin >> n;
vector<int> a(n + 1);
long long ans = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) {
cin >> b;
c = a[i + 1] + a[i];
ans += min(c, b);
a[i + 1] = clamp(c, 0, a[i + 1]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, b, c;
cin >> n;
vector<int> a(n + 1);
long long ans = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) {
cin >> b;
c = a[i + 1] + a[i];
ans += min(c, b);
a[i + 1] = clamp(c - b, 0, a[i + 1]);
}
cout << ans << endl;
} | [
"assignment.change"
] | 765,856 | 765,857 | u132364782 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
counter += B[i];
A[i + 1] -= B[i] - A[i];
} else {
counter += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
counter += B[i];
A[i + 1] -= B[i] - A[i];
} else {
counter += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << counter << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,859 | 765,860 | u132364782 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
counter += B[i];
A[i + 1] -= A[i] - B[i];
} else {
counter += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << counter << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A[N], B[N - 1];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long counter = 0;
for (int i = 0; i < N; i++) {
if (B[i] <= A[i]) {
counter += B[i];
} else if (B[i] <= A[i] + A[i + 1]) {
counter += B[i];
A[i + 1] -= B[i] - A[i];
} else {
counter += A[i] + A[i + 1];
A[i + 1] = 0;
}
}
cout << counter << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 765,861 | 765,860 | u132364782 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
res += a[i];
if (a[i + 1] <= b[i] - a[i]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
}
} else {
res += b[i];
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
ll res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
res += a[i];
if (a[i + 1] <= b[i] - a[i]) {
res += a[i + 1];
a[i + 1] = 0;
} else {
res += b[i] - a[i];
a[i + 1] -= b[i] - a[i];
}
} else {
res += b[i];
}
}
cout << res << endl;
} | [
"variable_declaration.type.change"
] | 765,862 | 765,863 | u743124029 | cpp |
p02959 | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
if (b[i] - a[i] >= a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i] - a[i];
}
}
}
std::cout << ans << std::endl;
return 0;
} | #include <iostream>
#include <vector>
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n + 1), b(n);
for (int i = 0; i < n + 1; i++) {
std::cin >> a[i];
}
for (int i = 0; i < n; i++) {
std::cin >> b[i];
}
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else {
if (b[i] - a[i] >= a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i] - a[i];
}
}
}
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,875 | 765,876 | u275256557 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <vector>
double min_double(double a, double b) {
if (a < b)
return a;
else
return b;
}
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
int gcd(int a, int b) {
if (a < b)
swap(&a, &b);
if (b < 1)
return -1;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
int sum = 0;
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
sum += A[i];
}
std::vector<int> B(N);
for (int i = 0; i < N; i++) {
std::cin >> B[i];
if (B[i] >= A[i]) {
B[i] -= A[i];
A[i] = 0;
if (B[i] >= A[i + 1])
A[i + 1] = 0;
else
A[i + 1] -= B[i];
} else
A[i] -= B[i];
}
int rest = 0;
for (int i = 0; i < N + 1; i++)
rest += A[i];
int ans = sum - rest;
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <memory>
#include <stdio.h>
#include <string>
#include <vector>
double min_double(double a, double b) {
if (a < b)
return a;
else
return b;
}
void swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
}
int gcd(int a, int b) {
if (a < b)
swap(&a, &b);
if (b < 1)
return -1;
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
long long sum = 0;
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
sum += A[i];
}
std::vector<int> B(N);
for (int i = 0; i < N; i++) {
std::cin >> B[i];
if (B[i] >= A[i]) {
B[i] -= A[i];
A[i] = 0;
if (B[i] >= A[i + 1])
A[i + 1] = 0;
else
A[i + 1] -= B[i];
} else
A[i] -= B[i];
}
long long rest = 0;
for (int i = 0; i < N + 1; i++)
rest += A[i];
long long ans = sum - rest;
std::cout << ans << std::endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,877 | 765,878 | u389834932 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
const int mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
sum += A[i];
int sp = B[i] - A[i];
A[i] = 0;
if (A[i + 1] <= sp) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
A[i] -= sp;
sum += sp;
}
} else {
sum += B[i];
A[i] -= B[i];
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
const int mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int64_t sum = 0;
for (int i = 0; i < N; i++) {
if (A[i] <= B[i]) {
sum += A[i];
int sp = B[i] - A[i];
A[i] = 0;
if (A[i + 1] <= sp) {
sum += A[i + 1];
A[i + 1] = 0;
} else {
A[i + 1] -= sp;
sum += sp;
}
} else {
sum += B[i];
A[i] -= B[i];
}
}
cout << sum << endl;
return 0;
} | [
"assignment.change"
] | 765,881 | 765,882 | u209457657 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> prime_factorize(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int cnt = 0;
for (int i = 0; i < N; i++) {
cnt += min(A[i], B[i]);
int a = max(0, B[i] - A[i]);
cnt += min(A[i + 1], a);
A[i + 1] = max(0, A[i + 1] - a);
// cout<<cnt<<endl;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> prime_factorize(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int64_t cnt = 0;
for (int i = 0; i < N; i++) {
cnt += min(A[i], B[i]);
int a = max(0, B[i] - A[i]);
cnt += min(A[i + 1], a);
A[i + 1] = max(0, A[i + 1] - a);
// cout<<cnt<<endl;
}
cout << cnt << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 765,883 | 765,884 | u209457657 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main() {
int n, sum = 0;
cin >> n;
vector<int> a(n + 1), b(n);
REP(i, n + 1) { cin >> a[i]; }
REP(i, n) { cin >> b[i]; }
REP(i, n) {
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main() {
ll n, sum = 0;
cin >> n;
vector<ll> a(n + 1), b(n);
REP(i, n + 1) { cin >> a[i]; }
REP(i, n) { cin >> b[i]; }
REP(i, n) {
if (a[i] >= b[i]) {
sum += b[i];
} else {
sum += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
} else {
sum += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
} | [
"variable_declaration.type.change"
] | 765,885 | 765,886 | u008905660 | cpp |
p02959 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (ll i = 0; i <= N; i++)
cin >> A[i];
for (ll i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (ll i = N - 1; i >= 0; i--) {
ll v = min(B[i], A[i + 1]);
ans += v;
A[i + 1] -= v;
B[i] -= v;
ll w = min(B[i], A[i]);
ans += w;
A[i + 1] -= w;
B[i] -= w;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N;
cin >> N;
vector<ll> A(N + 1), B(N);
for (ll i = 0; i <= N; i++)
cin >> A[i];
for (ll i = 0; i < N; i++)
cin >> B[i];
ll ans = 0;
for (ll i = N - 1; i >= 0; i--) {
ll v = min(B[i], A[i + 1]);
ans += v;
A[i + 1] -= v;
B[i] -= v;
ll w = min(B[i], A[i]);
ans += w;
A[i] -= w;
B[i] -= w;
}
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 765,887 | 765,888 | u588093355 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, bef = 0;
cin >> N;
vector<int64_t> A(N + 1);
for (int i = 0; i <= N; i++) {
cin >> A.at(i);
}
bef = accumulate(A.begin(), A.end(), 0);
for (int i = 0; i < N; i++) {
int64_t b;
cin >> b;
A.at(i) -= b;
if (A.at(i) >= 0)
continue;
b = abs(A.at(i));
A.at(i) = 0;
A.at(i + 1) -= b;
if (A.at(i + 1) < 0)
A.at(i + 1) = 0;
}
int64_t aft = accumulate(A.begin(), A.end(), 0);
cout << bef - aft << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, bef = 0;
cin >> N;
vector<int64_t> A(N + 1);
for (int i = 0; i <= N; i++) {
cin >> A.at(i);
}
bef = accumulate(A.begin(), A.end(), 0LL);
for (int i = 0; i < N; i++) {
int64_t b;
cin >> b;
A.at(i) -= b;
if (A.at(i) >= 0)
continue;
b = abs(A.at(i));
A.at(i) = 0;
A.at(i + 1) -= b;
if (A.at(i + 1) < 0)
A.at(i + 1) = 0;
}
int64_t aft = accumulate(A.begin(), A.end(), 0LL);
cout << bef - aft << endl;
} | [
"literal.number.type.widen.change"
] | 765,889 | 765,890 | u543466827 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
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]) {
if (a[i] < b[i] - a[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];
a[i] -= b[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
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]) {
if (a[i + 1] < b[i] - a[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];
a[i] -= b[i];
}
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 765,891 | 765,892 | u224469387 | cpp |
p02959 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a, n) \
for (long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i, n) for (int i = (int)(n); i > -1; i--)
#define irrep2(i, a, n) for (int i = (int)(n); i >= (int)(a); i--)
typedef long long ll;
typedef std::vector<char> v_char;
typedef std::vector<std::vector<char>> v2_char;
typedef std::vector<double> v_double;
typedef std::vector<std::vector<double>> v2_double;
typedef std::vector<int> v_int;
typedef std::vector<std::vector<int>> v2_int;
typedef std::vector<ll> v_ll;
typedef std::vector<std::vector<ll>> v2_ll;
typedef std::vector<std::string> v_string;
typedef std::vector<std::vector<std::string>> v2_string;
typedef std::vector<bool> v_bool;
typedef std::vector<std::vector<bool>> v2_bool;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, int> pii;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void) {
int n;
cin >> n;
v_ll a_l(n + 1), a_r(n + 1), b_l(n), b_r(n);
irep(i, n + 1) {
cin >> a_l[i];
a_r[i] = a_l[i];
}
irep(i, n) {
cin >> b_l[i];
b_r[i] = b_l[i];
}
ll ans_l = 0;
irep(i, n) {
ll l = a_l[i], r = a_l[i + 1];
ans_l += min(l, b_l[i]);
b_l[i] -= min(l, b_l[i]);
ans_l += min(r, b_l[i]);
a_l[i + 1] -= min(r, b_l[i]);
b_l[i] -= min(r, b_l[i]);
}
ll ans_r = 0;
irep(i, n) {
int j = n - i - 1;
ll l = a_r[j], r = a_r[j + 1];
ans_r += min(r, b_r[j]);
b_r[j] -= min(r, b_r[j]);
ans_r += min(l, b_r[j]);
a_r[j + 1] -= min(r, b_r[j]);
b_r[j] -= min(r, b_r[j]);
}
cout << max(ans_l, ans_r) << endl;
return 0;
}
/** atcoder **/
| #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a, n) \
for (long long i = (long long)(a); i <= (long long)(n); i++)
#define irrep(i, n) for (int i = (int)(n); i > -1; i--)
#define irrep2(i, a, n) for (int i = (int)(n); i >= (int)(a); i--)
typedef long long ll;
typedef std::vector<char> v_char;
typedef std::vector<std::vector<char>> v2_char;
typedef std::vector<double> v_double;
typedef std::vector<std::vector<double>> v2_double;
typedef std::vector<int> v_int;
typedef std::vector<std::vector<int>> v2_int;
typedef std::vector<ll> v_ll;
typedef std::vector<std::vector<ll>> v2_ll;
typedef std::vector<std::string> v_string;
typedef std::vector<std::vector<std::string>> v2_string;
typedef std::vector<bool> v_bool;
typedef std::vector<std::vector<bool>> v2_bool;
typedef std::pair<ll, ll> pll;
typedef std::pair<int, int> pii;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void) {
int n;
cin >> n;
v_ll a_l(n + 1), a_r(n + 1), b_l(n), b_r(n);
irep(i, n + 1) {
cin >> a_l[i];
a_r[i] = a_l[i];
}
irep(i, n) {
cin >> b_l[i];
b_r[i] = b_l[i];
}
ll ans_l = 0;
irep(i, n) {
ll l = a_l[i], r = a_l[i + 1];
ans_l += min(l, b_l[i]);
b_l[i] -= min(l, b_l[i]);
ans_l += min(r, b_l[i]);
a_l[i + 1] -= min(r, b_l[i]);
b_l[i] -= min(r, b_l[i]);
}
ll ans_r = 0;
irep(i, n) {
int j = n - i - 1;
ll l = a_r[j], r = a_r[j + 1];
ans_r += min(r, b_r[j]);
b_r[j] -= min(r, b_r[j]);
ans_r += min(l, b_r[j]);
a_r[j] -= min(l, b_r[j]);
b_r[j] -= min(l, b_r[j]);
}
cout << max(ans_l, ans_r) << endl;
return 0;
}
/** atcoder **/
| [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 765,893 | 765,894 | u829260400 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
ll t[n + 1], y[n];
rep(i, n + 1) cin >> t[i];
rep(i, n) cin >> y[i];
ll ans = 0;
rep(i, n) {
if (y[i] > t[i]) {
ans += t[i];
y[i] -= t[i];
if (y[i] > t[i + 1]) {
ans += t[i + 1];
t[i + 1] = 0;
} else {
ans += y[i];
t[i + 1] -= y[i];
}
} else {
ans = y[i];
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n;
cin >> n;
ll t[n + 1], y[n];
rep(i, n + 1) cin >> t[i];
rep(i, n) cin >> y[i];
ll ans = 0;
rep(i, n) {
if (y[i] > t[i]) {
ans += t[i];
y[i] -= t[i];
if (y[i] > t[i + 1]) {
ans += t[i + 1];
t[i + 1] = 0;
} else {
ans += y[i];
t[i + 1] -= y[i];
}
} else {
ans += y[i];
}
}
cout << ans << endl;
} | [
"assignment.value.change"
] | 765,895 | 765,896 | u318661636 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
vector<ll> vec(a + 1);
for (ll i = 0; i < a + 1; i++) {
cin >> vec.at(i);
b += vec.at(i);
}
for (ll i = 0; i < a; i++) {
ll c;
cin >> c;
if (vec.at(i) > c) {
vec.at(i) -= c;
}
if (vec.at(i) <= c) {
ll g = 0;
vec.at(i + 1) = max(g, vec.at(i + 1) - c + vec.at(i));
vec.at(i) = 0;
}
}
ll s = 0;
for (ll i = 0; i < a + 1; i++) {
s += vec.at(i);
}
cout << b - s << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
ll b = 0;
vector<ll> vec(a + 1);
for (ll i = 0; i < a + 1; i++) {
cin >> vec.at(i);
b += vec.at(i);
}
for (ll i = 0; i < a; i++) {
ll c;
cin >> c;
if (vec.at(i) > c) {
vec.at(i) -= c;
} else if (vec.at(i) <= c) {
ll g = 0;
vec.at(i + 1) = max(g, vec.at(i + 1) - c + vec.at(i));
vec.at(i) = 0;
}
}
ll s = 0;
for (ll i = 0; i < a + 1; i++) {
s += vec.at(i);
}
cout << b - s << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 765,897 | 765,898 | u883297128 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long long count = 0;
long long f1 = 1;
long long f2 = 1; /*ここを変える*/
long long temp;
if (d == 1) {
count = f1;
} else if (d == 2) {
count = f2;
} else if (d == 0) {
count = 1;
} else {
for (int i = 0; i < d - 2; i++) {
temp = f1 + f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L, long long R) {
if (L > R) {
long long temp = R;
R = L;
L = temp;
}
unsigned long long pp = 0, ppt = 0;
unsigned long long ans = 0;
if (R % L == 0) {
ans = L;
} else {
while (true) {
ppt = pp;
pp = R % L;
if (pp == 0) {
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L, long long R) {
unsigned long long ans;
unsigned long long gcd = GCD(L, R);
ans = (L / gcd) * R;
return ans;
}
/*Combination set*/
#define mod 1000000007
#define maxcomb 3000 /*大きいものを求めるときはここを変える*/
vector<long long> fc(maxcomb + 1);
vector<long long> ifc(maxcomb + 1);
long long modpow(long long x, long long n) {
long long ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
void Conb() {
fc[0] = 1;
ifc[0] = 1;
for (long long i = 0; i < maxcomb; i++) {
fc[i + 1] = fc[i] * (i + 1) % mod; // n!(mod)
ifc[i + 1] = ifc[i] * modpow(i + 1, mod - 2) % mod; // k!^{M-2} (mod)
}
}
unsigned long long Combination(long long L, long long R) {
unsigned long long up = 1, ans;
Conb();
if (L == 0 && R == 0) {
return 1;
} else if (L < R || L < 0) {
return 0;
} else {
long long t = ifc[L - R] * ifc[R] % mod;
ans = t * fc[L] % mod;
}
return ans;
}
/*Combination set ここまで*/
/*ここから*/
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
int sum = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i]) {
B[i] = B[i] - A[i];
A[i] = 0;
if (A[i + 1] > B[i]) {
A[i + 1] -= B[i];
} else {
A[i + 1] = 0;
}
} else {
A[i] -= B[i];
}
}
for (int i = 0; i < N + 1; i++) {
sum -= A[i];
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N) {
v[N - 1] += 1;
int ind = N - 1;
int j = N - 1;
for (j = N - 1; j >= 1; j--) {
if (v[j] > 1) {
v[j - 1] += 1;
v[j] = 0;
}
}
return v;
}
/*フィボナッチ*/
long long fibonatti(long long d) {
long long count = 0;
long long f1 = 1;
long long f2 = 1; /*ここを変える*/
long long temp;
if (d == 1) {
count = f1;
} else if (d == 2) {
count = f2;
} else if (d == 0) {
count = 1;
} else {
for (int i = 0; i < d - 2; i++) {
temp = f1 + f2;
f1 = f2;
f2 = temp;
}
count = temp;
}
return count;
}
/*最大公約数*/
unsigned long long GCD(long long L, long long R) {
if (L > R) {
long long temp = R;
R = L;
L = temp;
}
unsigned long long pp = 0, ppt = 0;
unsigned long long ans = 0;
if (R % L == 0) {
ans = L;
} else {
while (true) {
ppt = pp;
pp = R % L;
if (pp == 0) {
ans = ppt;
break;
}
R = L;
L = pp;
}
}
return ans;
}
/*最小公倍数*/
unsigned long long LCM(long long L, long long R) {
unsigned long long ans;
unsigned long long gcd = GCD(L, R);
ans = (L / gcd) * R;
return ans;
}
/*Combination set*/
#define mod 1000000007
#define maxcomb 3000 /*大きいものを求めるときはここを変える*/
vector<long long> fc(maxcomb + 1);
vector<long long> ifc(maxcomb + 1);
long long modpow(long long x, long long n) {
long long ans = 1;
while (n > 0) {
if (n & 1) {
ans = ans * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return ans;
}
void Conb() {
fc[0] = 1;
ifc[0] = 1;
for (long long i = 0; i < maxcomb; i++) {
fc[i + 1] = fc[i] * (i + 1) % mod; // n!(mod)
ifc[i + 1] = ifc[i] * modpow(i + 1, mod - 2) % mod; // k!^{M-2} (mod)
}
}
unsigned long long Combination(long long L, long long R) {
unsigned long long up = 1, ans;
Conb();
if (L == 0 && R == 0) {
return 1;
} else if (L < R || L < 0) {
return 0;
} else {
long long t = ifc[L - R] * ifc[R] % mod;
ans = t * fc[L] % mod;
}
return ans;
}
/*Combination set ここまで*/
/*ここから*/
int main() {
int N;
cin >> N;
vector<long> A(N + 1);
vector<long> B(N);
long long sum = 0;
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
sum += A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
long long ans = 0;
for (int i = 0; i < N; i++) {
if (B[i] >= A[i]) {
B[i] = B[i] - A[i];
A[i] = 0;
if (A[i + 1] > B[i]) {
A[i + 1] -= B[i];
} else {
A[i + 1] = 0;
}
} else {
A[i] -= B[i];
}
}
for (int i = 0; i < N + 1; i++) {
sum -= A[i];
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,899 | 765,900 | u770067864 | 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; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
} | #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; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i]) {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] <= b[i]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
} else {
ans += b[i];
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,901 | 765,902 | u528258842 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int N;
int A[100005];
int B[100005];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
int tmp = 0;
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
tmp += B[i];
} else {
int tt;
tmp += A[i];
tt = B[i] - A[i];
if (A[i + 1] - tt > 0) {
tmp += tt;
A[i + 1] = A[i + 1] - tt;
} else {
tmp += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << tmp << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using Graph = vector<vector<int>>;
using GraphC = vector<vector<char>>;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
const int MAX_L = 100000000;
const int MAX_SQRT_B = 10000;
const int INF = 1000000000;
typedef int64_t ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int N;
int A[100005];
int B[100005];
int main() {
cin >> N;
rep(i, N + 1) { cin >> A[i]; }
rep(i, N) { cin >> B[i]; }
ll tmp = 0;
for (int i = 0; i < N; i++) {
if (A[i] - B[i] > 0) {
tmp += B[i];
} else {
ll tt;
tmp += A[i];
tt = B[i] - A[i];
if (A[i + 1] - tt > 0) {
tmp += tt;
A[i + 1] = A[i + 1] - tt;
} else {
tmp += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << tmp << endl;
}
| [
"variable_declaration.type.change"
] | 765,905 | 765,906 | u992723601 | cpp |
p02959 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i])
ans += a[i], b[i] -= a[i], a[i] = 0;
else
ans += b[i], a[i] -= b[i], b[i] = 0;
if (b[i] > 0) {
if (b[i] >= a[i + 1])
ans += a[i + 1], a[i + 1] = 0;
else
ans += b[i], a[i + 1] -= b[i];
}
}
cout << ans << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#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 ans = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= b[i])
ans += a[i], b[i] -= a[i], a[i] = 0;
else
ans += b[i], a[i] -= b[i], b[i] = 0;
if (b[i] > 0) {
if (b[i] >= a[i + 1])
ans += a[i + 1], a[i + 1] = 0;
else
ans += b[i], a[i + 1] -= b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 765,907 | 765,908 | u199441105 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
void solve() {
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 x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i] -= x;
}
cout << ans;
}
int main() {
int y;
y = 1;
// cin>>y ;
while (y--) {
solve();
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
void solve() {
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 x = min(a[i], b[i]);
ans += x;
b[i] -= x;
x = min(a[i + 1], b[i]);
ans += x;
a[i + 1] -= x;
}
cout << ans;
}
int main() {
int y;
y = 1;
// cin>>y ;
while (y--) {
solve();
}
} | [
"assignment.change"
] | 765,909 | 765,910 | u806692883 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> hero(N);
for (int i = 0; i <= N; i++) {
cin >> monster[i];
}
for (int i = 0; i <= N - 1; i++) {
cin >> hero[i];
}
int ans = 0;
for (int i = 0; i <= N - 1; i++) {
if (hero[i] >= monster[i]) {
ans += monster[i];
hero[i] -= monster[i];
monster[i] = 0;
if (hero[i] >= monster[i + 1]) {
ans += monster[i + 1];
hero[i] -= monster[i + 1];
monster[i + 1] = 0;
} else {
monster[i + 1] -= hero[i];
ans += hero[i];
hero[i] = 0;
}
} else {
ans += hero[i];
monster[i] -= hero[i];
hero[i] = 0;
}
}
cout << ans;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> monster(N + 1);
vector<int> hero(N);
for (int i = 0; i <= N; i++) {
cin >> monster[i];
}
for (int i = 0; i <= N - 1; i++) {
cin >> hero[i];
}
long long ans = 0;
for (int i = 0; i <= N - 1; i++) {
if (hero[i] >= monster[i]) {
ans += monster[i];
hero[i] -= monster[i];
monster[i] = 0;
if (hero[i] >= monster[i + 1]) {
ans += monster[i + 1];
hero[i] -= monster[i + 1];
monster[i + 1] = 0;
} else {
monster[i + 1] -= hero[i];
ans += hero[i];
hero[i] = 0;
}
} else {
ans += hero[i];
monster[i] -= hero[i];
hero[i] = 0;
}
}
cout << ans;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,913 | 765,914 | u328530240 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, sum = 0;
cin >> n;
vector<int> a(n + 1), b(n);
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
for (i = 0; i < n; i++) {
if (a.at(i) > b.at(i))
//街nの一部を退治
{
sum += b.at(i);
} else if (a.at(i + 1) > b.at(i) - a.at(i))
//街nを殲滅後、n+1の一部を退治
{
a.at(i + 1) -= b.at(i) - a.at(i);
sum += b.at(i);
} else //街n+1まで殲滅
{
sum += (a.at(i) + a.at(i + 1));
a.at(i + 1) = 0;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
long sum = 0;
cin >> n;
vector<long> a(n + 1), b(n);
for (i = 0; i < n + 1; i++) {
cin >> a.at(i);
}
for (i = 0; i < n; i++) {
cin >> b.at(i);
}
for (i = 0; i < n; i++) {
if (a.at(i) > b.at(i))
//街nの一部を退治
{
sum += b.at(i);
} else if (a.at(i + 1) > b.at(i) - a.at(i))
//街nを殲滅後、n+1の一部を退治
{
a.at(i + 1) -= b.at(i) - a.at(i);
sum += b.at(i);
} else //街n+1まで殲滅
{
sum += (a.at(i) + a.at(i + 1));
a.at(i + 1) = 0;
}
}
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.widen.change",
"variable_declaration.type.primitive.change"
] | 765,915 | 765,916 | u367958900 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
B.at(i) = 0;
} else {
ans += A.at(i);
B.at(i) -= A.at(i);
}
if (A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
ans += A.at(i + 1);
A.at(i) = 0;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
B.at(i) = 0;
} else {
ans += A.at(i);
B.at(i) -= A.at(i);
}
if (A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
ans += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 765,921 | 765,922 | u879226168 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
B.at(i) = 0;
} else {
ans += A.at(i);
B.at(i) -= A.at(i);
}
if (A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
ans += A.at(i + 1);
A.at(i) = 0;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i <= N; i++)
cin >> A.at(i);
for (int i = 0; i < N; i++)
cin >> B.at(i);
long long int ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) >= B.at(i)) {
ans += B.at(i);
B.at(i) = 0;
} else {
ans += A.at(i);
B.at(i) -= A.at(i);
}
if (A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
ans += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 765,923 | 765,922 | u879226168 | cpp |
p02959 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int i, j, k, n, a[100001], b[100000], ans;
cin >> n;
ans = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i] + a[i + 1] >= b[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
ans += b[i];
} else {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
long long int i, j, k, n, a[100001], b[100000], ans;
cin >> n;
ans = 0;
for (i = 0; i <= n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
ans += b[i];
} else if (a[i] + a[i + 1] >= b[i]) {
a[i + 1] = a[i + 1] + a[i] - b[i];
ans += b[i];
} else {
ans = ans + a[i] + a[i + 1];
a[i + 1] = 0;
}
}
cout << ans;
} | [
"variable_declaration.type.widen.change"
] | 765,926 | 765,927 | u491376630 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int main() {
int n;
cin >> n;
V<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll prev_left = 0;
ll count = 0;
rep(i, n + 1) {
ll monster_num = a[i];
count += min(monster_num, prev_left);
monster_num -= min(monster_num, prev_left);
if (i <= n) {
count += min(monster_num, b[i]);
prev_left = b[i] - min(monster_num, b[i]);
monster_num -= min(monster_num, b[i]);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int main() {
int n;
cin >> n;
V<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll prev_left = 0;
ll count = 0;
rep(i, n + 1) {
ll monster_num = a[i];
count += min(monster_num, prev_left);
monster_num -= min(monster_num, prev_left);
if (i < n) {
count += min(monster_num, b[i]);
prev_left = b[i] - min(monster_num, b[i]);
monster_num -= min(monster_num, b[i]);
}
}
cout << count << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,928 | 765,929 | u469813907 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int main() {
int n;
cin >> n;
V<int> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
int prev_left = 0;
int count = 0;
rep(i, n + 1) {
int monster_num = a[i];
count += min(monster_num, prev_left);
monster_num -= min(monster_num, prev_left);
if (i <= n) {
count += min(monster_num, b[i]);
prev_left = b[i] - min(monster_num, b[i]);
monster_num -= min(monster_num, b[i]);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); i++)
#define rrep(i, to) for (int i = (to)-1; i >= 0; i--)
#define repf(i, from, to) for (int i = (from); i < (to); i++)
#define all(v) v.begin(), v.end()
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
template <typename T, typename U> using P = pair<T, U>;
int main() {
int n;
cin >> n;
V<ll> a(n + 1), b(n);
rep(i, n + 1) { cin >> a[i]; }
rep(i, n) { cin >> b[i]; }
ll prev_left = 0;
ll count = 0;
rep(i, n + 1) {
ll monster_num = a[i];
count += min(monster_num, prev_left);
monster_num -= min(monster_num, prev_left);
if (i < n) {
count += min(monster_num, b[i]);
prev_left = b[i] - min(monster_num, b[i]);
monster_num -= min(monster_num, b[i]);
}
}
cout << count << endl;
} | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,930 | 765,929 | u469813907 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
ll a[n + 1];
ll b[n];
ll sum = 0;
for (int i = 0; i <= n; i++) {
ll x;
cin >> x;
a[i] = x;
}
for (int i = 0; i < n; i++) {
ll y;
cin >> y;
b[i] = y;
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i - 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
ll a[n + 1];
ll b[n];
ll sum = 0;
for (int i = 0; i <= n; i++) {
ll x;
cin >> x;
a[i] = x;
}
for (int i = 0; i < n; i++) {
ll y;
cin >> y;
b[i] = y;
}
for (int i = 0; i < n; i++) {
if (a[i] >= b[i]) {
sum += b[i];
a[i] -= b[i];
b[i] = 0;
} else {
sum += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
sum += b[i];
a[i + 1] -= b[i];
b[i] = 0;
} else {
sum += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
cout << sum << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 765,935 | 765,936 | u018679195 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
// deque/functional/iterator/list/map/memory/numeric/queue/set/stack/utility/vector
//#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[100010];
int b[100010];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = n; i >= 0; i--) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
cin >> b[i];
}
int s = 0;
int k = a[0];
// cout<<"a "<<k<<endl;
for (int i = 1; i <= n; i++) {
if (k >= b[i]) {
s += b[i];
b[i] = 0;
} else {
b[i] = b[i] - k;
s += k;
}
// cout<<s<<endl;
if (a[i] > b[i]) {
s += b[i];
k = a[i] - b[i];
} else {
s += a[i];
k = 0;
}
// cout<<s<<endl;
}
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
// deque/functional/iterator/list/map/memory/numeric/queue/set/stack/utility/vector
//#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[100010];
int b[100010];
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = n; i >= 0; i--) {
cin >> a[i];
}
for (int i = n; i >= 1; i--) {
cin >> b[i];
}
ll s = 0;
int k = a[0];
// cout<<"a "<<k<<endl;
for (int i = 1; i <= n; i++) {
if (k >= b[i]) {
s += b[i];
b[i] = 0;
} else {
b[i] = b[i] - k;
s += k;
}
// cout<<s<<endl;
if (a[i] > b[i]) {
s += b[i];
k = a[i] - b[i];
} else {
s += a[i];
k = 0;
}
// cout<<s<<endl;
}
cout << s << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 765,937 | 765,938 | u018679195 | cpp |
p02959 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) {
int v1 = min(a[i], b[i]);
a[i] -= v1;
b[i] -= v1;
int v2 = min(a[i + 1], b[i]);
a[i] -= v2;
b[i] -= v2;
sum += v1 + v2;
}
put(sum);
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
rep(i, n + 1) cin >> a[i];
vector<ll> b(n);
rep(i, n) cin >> b[i];
ll sum = 0;
rep(i, n) {
int v1 = min(a[i], b[i]);
a[i] -= v1;
b[i] -= v1;
int v2 = min(a[i + 1], b[i]);
a[i + 1] -= v2;
b[i] -= v2;
sum += v1 + v2;
}
put(sum);
return 0;
} | [
"assignment.change"
] | 765,939 | 765,940 | u570601094 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void) {
ll n, ans = 0;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
ll l = min(a[i], b[i]);
ans += l;
a[i] -= l;
b[i] -= l;
ll r = min(a[i + 1], b[i]);
ans += r;
a[i] -= r;
b[i] -= r;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll, ll>
#define all(v) (v).begin(), (v).end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void) {
ll n, ans = 0;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) {
ll l = min(a[i], b[i]);
ans += l;
a[i] -= l;
b[i] -= l;
ll r = min(a[i + 1], b[i]);
ans += r;
a[i + 1] -= r;
b[i] -= r;
}
cout << ans << endl;
return 0;
} | [
"assignment.change"
] | 765,941 | 765,942 | u025469035 | 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 count = 0;
for (int i = 0; i < N; i++) {
int C = min(A.at(i), B.at(i));
A.at(i) -= C;
count += C;
B.at(i) -= C;
int D = min(A.at(i + 1), B.at(i));
A.at(i + 1) -= D;
count += D;
B.at(i) -= D;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
long long count = 0;
for (int i = 0; i < N; i++) {
int C = min(A.at(i), B.at(i));
A.at(i) -= C;
count += C;
B.at(i) -= C;
int D = min(A.at(i + 1), B.at(i));
A.at(i + 1) -= D;
count += D;
B.at(i) -= D;
}
cout << count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,943 | 765,944 | u280966279 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
continue;
}
if (a[i] < b[i] && b[i] <= a[i] + a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
continue;
}
if (a[i] < b[i] && b[i] > a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
continue;
}
if (a[i] < b[i] && b[i] <= a[i] + a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
continue;
}
if (a[i] < b[i] && b[i] > a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 765,948 | 765,949 | u818755983 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
continue;
}
if (a[i] < b[i] && b[i] <= a[i] + a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
continue;
}
if (a[i] < b[i] && b[i] > a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
continue;
}
if (a[i] < b[i] && b[i] <= a[i] + a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i] - a[i];
continue;
}
if (a[i] < b[i] && b[i] > a[i] + a[i + 1]) {
ans += a[i] + a[i + 1];
a[i + 1] = 0;
continue;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 765,950 | 765,949 | u818755983 | 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> mon(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> mon[i];
rep(i, n) cin >> b[i];
int cnt = 0;
rep(i, n) {
if (b[i] > mon[i]) {
cnt += mon[i];
b[i] -= mon[i];
int x = min(b[i], mon[i + 1]);
cnt += x;
mon[i + 1] -= x;
} else {
cnt += b[i];
b[i] = 0;
}
}
cout << cnt << '\n';
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> mon(n + 1);
vector<int> b(n);
rep(i, n + 1) cin >> mon[i];
rep(i, n) cin >> b[i];
ll cnt = 0;
rep(i, n) {
if (b[i] > mon[i]) {
cnt += mon[i];
b[i] -= mon[i];
int x = min(b[i], mon[i + 1]);
cnt += x;
mon[i + 1] -= x;
} else {
cnt += b[i];
b[i] = 0;
}
}
cout << cnt << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 765,951 | 765,952 | u600402037 | cpp |
p02959 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[200000];
int B[200000];
int restA[200000];
int restB[200000];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
restA[i] = A[i];
restB[i] = B[i];
}
int counter = 0;
for (int i = 0; i < N; i++) {
counter += min(restA[i], B[i]);
restB[i] -= min(restA[i], B[i]);
counter += min(A[i + 1], restB[i]);
restA[i + 1] -= min(A[i + 1], restB[i]);
}
cout << counter << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int A[200000];
int B[200000];
int restA[200000];
int restB[200000];
for (int i = 0; i < N + 1; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
restA[i] = A[i];
restB[i] = B[i];
}
long long counter = 0;
for (int i = 0; i < N; i++) {
counter += min(restA[i], B[i]);
restB[i] -= min(restA[i], B[i]);
counter += min(A[i + 1], restB[i]);
restA[i + 1] -= min(A[i + 1], restB[i]);
}
cout << counter << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,955 | 765,956 | u865014539 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1);
for (size_t i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (size_t i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
int c;
c = min(a[i], b[i]);
a[i] -= c;
ans += c;
c = min(a[i + 1], b[i] - c);
a[i + 1] -= c;
ans += c;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n + 1);
for (size_t i = 0; i < n + 1; i++)
cin >> a[i];
vector<int> b(n);
for (size_t i = 0; i < n; i++)
cin >> b[i];
long long ans = 0;
for (int i = 0; i < n; i++) {
int c;
c = min(a[i], b[i]);
a[i] -= c;
ans += c;
c = min(a[i + 1], b[i] - c);
a[i + 1] -= c;
ans += c;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,963 | 765,964 | u008040394 | 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 + 1];
for (int i = 0; i <= N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
int monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2 = min(a[i + 1], b[i] - ans1);
monster += ans1;
monster += ans2;
a[i] -= ans1;
a[i + 1] -= ans2;
}
cout << monster;
} | #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];
ll monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2 = min(a[i + 1], b[i] - ans1);
monster += ans1;
monster += ans2;
a[i] -= ans1;
a[i + 1] -= ans2;
}
cout << monster;
} | [
"expression.operation.binary.remove",
"variable_declaration.type.change"
] | 765,965 | 765,966 | u401152875 | 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 + 1];
for (int i = 0; i <= N; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
cin >> b[i];
int monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2 = min(a[i + 1], b[i] - ans1);
monster += ans1;
monster += ans2;
a[i] = ans1;
a[i + 1] -= ans2;
}
cout << monster;
} | #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];
ll monster = 0;
for (int i = 0; i < N; i++) {
int ans1 = min(a[i], b[i]);
int ans2 = min(a[i + 1], b[i] - ans1);
monster += ans1;
monster += ans2;
a[i] -= ans1;
a[i + 1] -= ans2;
}
cout << monster;
} | [
"expression.operation.binary.remove",
"variable_declaration.type.change",
"assignment.value.change"
] | 765,967 | 765,966 | u401152875 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
int count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
count += B[i];
A[i] -= B[i];
} else if (A[i] < B[i]) {
count += A[i] + min(B[i] - A[i], A[i + 1]);
A[i + 1] = max(A[i + 1] - (B[i] - A[i]), 0);
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> A(N + 1), B(N);
for (int i = 0; i < N + 1; i++)
cin >> A[i];
for (int i = 0; i < N; i++)
cin >> B[i];
ll count = 0;
for (int i = 0; i < N; i++) {
if (A[i] >= B[i]) {
count += B[i];
A[i] -= B[i];
} else if (A[i] < B[i]) {
count += A[i] + min(B[i] - A[i], A[i + 1]);
A[i + 1] = max(A[i + 1] - (B[i] - A[i]), 0);
}
}
cout << count << endl;
} | [
"variable_declaration.type.change"
] | 765,968 | 765,969 | u418892821 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) > B.at(i)) {
ans += B.at(i);
A.at(i + 1) = A.at(i + 1) - B.at(i) + A.at(i);
} else if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) < B.at(i)) {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i) == B.at(i)) {
ans += A.at(i);
} else if (A.at(i) > B.at(i)) {
ans += B.at(i);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
A.at(i + 1) = A.at(i + 1) - B.at(i) + A.at(i);
} else if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) < B.at(i)) {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i) == B.at(i)) {
ans += A.at(i);
} else if (A.at(i) > B.at(i)) {
ans += B.at(i);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 765,970 | 765,971 | u856957535 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) > B.at(i)) {
ans += B.at(i);
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
} else if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) < B.at(i)) {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i) == B.at(i)) {
ans += A.at(i);
} else if (A.at(i) > B.at(i)) {
ans += B.at(i);
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
vector<int> B(N);
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) >= B.at(i)) {
ans += B.at(i);
A.at(i + 1) = A.at(i + 1) - B.at(i) + A.at(i);
} else if (A.at(i) < B.at(i) && A.at(i) + A.at(i + 1) < B.at(i)) {
ans += A.at(i) + A.at(i + 1);
A.at(i + 1) = 0;
} else if (A.at(i) == B.at(i)) {
ans += A.at(i);
} else if (A.at(i) > B.at(i)) {
ans += B.at(i);
}
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 765,972 | 765,971 | u856957535 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n + 1), B(n);
for (int i = 0; i < n + 1; ++i)
cin >> A[i];
for (int i = 0; i < n; ++i)
cin >> B[i];
int count = 0;
for (int i = 0; i < n; ++i) {
count += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
count += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> A(n + 1), B(n);
for (int i = 0; i < n + 1; ++i)
cin >> A[i];
for (int i = 0; i < n; ++i)
cin >> B[i];
long long int count = 0;
for (int i = 0; i < n; ++i) {
count += min(A[i], B[i]);
B[i] -= min(A[i], B[i]);
count += min(A[i + 1], B[i]);
A[i + 1] -= min(A[i + 1], B[i]);
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 765,975 | 765,976 | u058106405 | cpp |
p02959 |
/********************************************************
**░██████╗██╗░░░░░░█████╗░██╗░░░██╗██╗░█████╗░░██████╗░**
**██╔════╝██║░░░░░██╔══██╗██║░░░██║██║██╔══██╗██╔════╝░**
**╚█████╗░██║░░░░░███████║╚██╗░██╔╝██║██║░░╚═╝██║░░██╗░**
**░╚═══██╗██║░░░░░██╔══██║░╚████╔╝░██║██║░░██╗██║░░╚██╗**
**██████╔╝███████╗██║░░██║░░╚██╔╝░░██║╚█████╔╝╚██████╔╝**
**╚═════╝░╚══════╝╚═╝░░╚═╝░░░╚═╝░░░╚═╝░╚════╝░░╚═════╝░**
*********************************************************/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define isSubstring(s1, s2) s1.find(s2) != std::string::npos
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define vpi vector<pair<int, int>>
#define vi vector<int>
#define sz(a) (int)a.size()
#define endl "\n"
#define nl cout << "\n";
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MN INT_MIN
#define MX INT_MAX
bool isPrime(ll n) {
if (n < 2)
return false;
for (ll x = 2; x * x <= n; x++) {
if (n % x == 0)
return false;
}
return true;
}
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
int dp[100001];
int32_t main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
} |
/********************************************************
**░██████╗██╗░░░░░░█████╗░██╗░░░██╗██╗░█████╗░░██████╗░**
**██╔════╝██║░░░░░██╔══██╗██║░░░██║██║██╔══██╗██╔════╝░**
**╚█████╗░██║░░░░░███████║╚██╗░██╔╝██║██║░░╚═╝██║░░██╗░**
**░╚═══██╗██║░░░░░██╔══██║░╚████╔╝░██║██║░░██╗██║░░╚██╗**
**██████╔╝███████╗██║░░██║░░╚██╔╝░░██║╚█████╔╝╚██████╔╝**
**╚═════╝░╚══════╝╚═╝░░╚═╝░░░╚═╝░░░╚═╝░╚════╝░░╚═════╝░**
*********************************************************/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define isSubstring(s1, s2) s1.find(s2) != std::string::npos
#define pb push_back
#define pf push_front
#define mp make_pair
#define fr first
#define sc second
#define vpi vector<pair<int, int>>
#define vi vector<int>
#define sz(a) (int)a.size()
#define endl "\n"
#define nl cout << "\n";
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MN INT_MIN
#define MX INT_MAX
#define int long long
bool isPrime(ll n) {
if (n < 2)
return false;
for (ll x = 2; x * x <= n; x++) {
if (n % x == 0)
return false;
}
return true;
}
bool isPerfectSquare(long double x) {
long double sr = sqrt(x);
return ((sr - floor(sr)) == 0);
}
int gcd(int a, int b) {
if (a == 0)
return b;
if (b == 0)
return a;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
int dp[100001];
int32_t main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
int ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
} | [] | 765,983 | 765,984 | u649811088 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N + 1);
vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
int count = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
count += A.at(i);
B.at(i) -= A.at(i);
} else {
count += B.at(i);
B.at(i) = 0;
}
if (B.at(i) <= A.at(i + 1)) {
count += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
count += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<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 count = 0;
for (int i = 0; i < N; i++) {
if (B.at(i) >= A.at(i)) {
count += A.at(i);
B.at(i) -= A.at(i);
} else {
count += B.at(i);
B.at(i) = 0;
}
if (B.at(i) <= A.at(i + 1)) {
count += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
count += A.at(i + 1);
A.at(i + 1) = 0;
}
}
cout << count << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 765,997 | 765,998 | u710877960 | cpp |
p02959 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int>>;
int main(void) {
Int n;
cin >> n;
VI a(n + 1), b(n);
for (Int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (Int i = 0; i < n; ++i) {
cin >> b[i];
}
Int result = 0;
for (Int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
result += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] < b[i]) {
result += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
result += b[i];
a[i] -= b[i];
b[i] = 0;
}
} else {
result += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << result << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vector<vector<long long int>>;
int main(void) {
Int n;
cin >> n;
VI a(n + 1), b(n);
for (Int i = 0; i < n + 1; ++i) {
cin >> a[i];
}
for (Int i = 0; i < n; ++i) {
cin >> b[i];
}
Int result = 0;
for (Int i = 0; i < n; ++i) {
if (a[i] < b[i]) {
result += a[i];
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] < b[i]) {
result += a[i + 1];
b[i] -= a[i + 1];
a[i + 1] = 0;
} else {
result += b[i];
a[i + 1] -= b[i];
b[i] = 0;
}
} else {
result += b[i];
a[i] -= b[i];
b[i] = 0;
}
}
cout << result << endl;
return 0;
}
| [
"assignment.change"
] | 766,002 | 766,003 | u984427208 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &n);
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
printf("%d\n", ans);
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &n);
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
printf("%lld\n", ans);
return 0;
}
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,006 | 766,007 | u994074033 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &n);
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
printf("%d\n", ans);
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, tmp;
long long ans = 0;
scanf("%d", &n);
vector<int> a(n + 1);
vector<int> b(n);
for (int i = 0; i < n + 1; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
for (int i = 0; i < n; i++) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
ans += min(b[i], a[i + 1]);
a[i + 1] -= min(b[i], a[i + 1]);
}
}
printf("%lld\n", ans);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 766,006 | 766,008 | u994074033 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
vector<int> A(N + 1, 0);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<int> B(N, 0);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
if (A.at(i) + A.at(i + 1) <= B.at(i)) {
sum += A.at(i) + A.at(i + 1);
A.at(i) = 0;
A.at(i + 1) = 0;
} else {
sum += B.at(i);
if (A.at(i) <= B.at(i))
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
A.at(i) = 0;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long sum = 0;
vector<long> A(N + 1, 0);
for (int i = 0; i < N + 1; i++)
cin >> A.at(i);
vector<long> B(N, 0);
for (int i = 0; i < N; i++)
cin >> B.at(i);
for (int i = 0; i < N; i++) {
if (A.at(i) + A.at(i + 1) <= B.at(i)) {
sum += A.at(i) + A.at(i + 1);
A.at(i) = 0;
A.at(i + 1) = 0;
} else {
sum += B.at(i);
if (A.at(i) <= B.at(i))
A.at(i + 1) = A.at(i + 1) - (B.at(i) - A.at(i));
A.at(i) = 0;
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,011 | 766,012 | u512266180 | cpp |
p02959 | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]";
return os;
}
template <typename T> void print(T v, string s = "\n") { cout << v << s; }
template <typename T> void in(T &v) { cin >> v; }
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
int main() {
int n;
in(n);
vector<ll> A(n + 1), B(n);
loop(i, 0, n + 1) in(A[i]);
loop(i, 0, n) in(B[i]);
int ans = 0;
loop(i, 0, n) {
ll &a1 = A[i];
ll &a2 = A[i + 1];
ll &b = B[i];
ll d = min(a1, b);
a1 -= d;
b -= d;
ll d2 = min(a2, b);
a2 -= d2;
b -= d2;
ans += d + d2;
}
print(ans);
return 0;
}
| // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]";
return os;
}
template <typename T> void print(T v, string s = "\n") { cout << v << s; }
template <typename T> void in(T &v) { cin >> v; }
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
int main() {
int n;
in(n);
vector<ll> A(n + 1), B(n);
loop(i, 0, n + 1) in(A[i]);
loop(i, 0, n) in(B[i]);
ll ans = 0;
loop(i, 0, n) {
ll &a1 = A[i];
ll &a2 = A[i + 1];
ll &b = B[i];
ll d = min(a1, b);
a1 -= d;
b -= d;
ll d2 = min(a2, b);
a2 -= d2;
b -= d2;
ans += d + d2;
}
print(ans);
return 0;
}
| [
"variable_declaration.type.change"
] | 766,015 | 766,016 | u823862638 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
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 mon_count = 0;
rep(i, N) {
if (A.at(i) < B.at(i)) {
mon_count += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0;
if (A.at(i + 1) >= B.at(i)) {
mon_count += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
mon_count += A.at(i + 1);
A.at(i + 1) = 0;
}
} else {
A.at(i) -= B.at(i);
mon_count += B.at(i);
}
}
cout << mon_count << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1), B(N);
rep(i, N + 1) cin >> A.at(i);
rep(i, N) cin >> B.at(i);
long long mon_count = 0;
rep(i, N) {
if (A.at(i) < B.at(i)) {
mon_count += A.at(i);
B.at(i) -= A.at(i);
A.at(i) = 0;
if (A.at(i + 1) >= B.at(i)) {
mon_count += B.at(i);
A.at(i + 1) -= B.at(i);
} else {
mon_count += A.at(i + 1);
A.at(i + 1) = 0;
}
} else {
A.at(i) -= B.at(i);
mon_count += B.at(i);
}
}
cout << mon_count << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 766,023 | 766,024 | u109489258 | cpp |
p02959 | #include <bits/stdc++.h>
#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);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
b[i] -= a[i + 1];
} else {
ans += b[i];
b[i] = 0;
}
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i];
a[i] = 0;
}
a.pop_back();
}
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;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
b[i] -= a[i + 1];
} else {
ans += b[i];
b[i] = 0;
}
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i];
a[i] = 0;
}
a.pop_back();
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,027 | 766,028 | u529722835 | cpp |
p02959 | #include <bits/stdc++.h>
#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);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,029 | 766,030 | u529722835 | cpp |
p02959 | #include <bits/stdc++.h>
#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);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] >= a[i]) {
ans += a[i];
b[i] -= a[i];
} else {
ans += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
ans += a[i + 1];
a[i + 1] = 0;
} else {
ans += b[i];
a[i + 1] -= b[i];
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,029 | 766,031 | u529722835 | cpp |
p02959 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
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 count = 0;
rep(i, n) {
if (a[i] >= b[i]) {
a[i] -= b[i];
count += b[i];
b[i] = 0;
} else {
b[i] -= a[i];
count += a[i];
a[i] = 0;
}
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count += b[i];
b[i] = 0;
} else {
b[i] -= a[i + 1];
count += a[i + 1];
a[i + 1] = 0;
}
}
cout << count << endl;
return 0;
} | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
#define int long long
signed 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 count = 0;
rep(i, n) {
if (a[i] >= b[i]) {
a[i] -= b[i];
count += b[i];
b[i] = 0;
} else {
b[i] -= a[i];
count += a[i];
a[i] = 0;
}
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
count += b[i];
b[i] = 0;
} else {
b[i] -= a[i + 1];
count += a[i + 1];
a[i + 1] = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 766,034 | 766,035 | u608773191 | cpp |
p02959 | #include <bits/stdc++.h>
#define io() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main() {
io();
int n;
cin >> n;
vector<int> a(n + 1), b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int tot = 0;
for (int i = 0; i < n; ++i) {
if (b[i] >= a[i]) {
tot += a[i];
b[i] -= a[i];
} else {
tot += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
tot += a[i + 1];
a[i + 1] = 0;
} else {
tot += b[i];
a[i + 1] -= b[i];
}
}
cout << tot << '\n';
return 0;
} | #include <bits/stdc++.h>
#define io() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
srand(time(NULL));
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
signed main() {
io();
int n;
cin >> n;
vector<ll> a(n + 1), b(n);
for (int i = 0; i <= n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
ll tot = 0;
for (int i = 0; i < n; ++i) {
if (b[i] >= a[i]) {
tot += a[i];
b[i] -= a[i];
} else {
tot += b[i];
b[i] = 0;
}
if (b[i] >= a[i + 1]) {
tot += a[i + 1];
a[i + 1] = 0;
} else {
tot += b[i];
a[i + 1] -= b[i];
}
}
cout << tot << '\n';
return 0;
} | [
"variable_declaration.type.change"
] | 766,040 | 766,041 | u393220099 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int a[n + 1], b[n];
for (int i = 0; i < n + 1; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
cin >> b[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += min(a[i], b[i]);
b[i] -= min(a[i], b[i]);
ans += min(a[i + 1], b[i]);
a[i + 1] -= min(a[i + 1], b[i]);
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 766,042 | 766,043 | u056912761 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
ll n;
cin >> n;
vll a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll r = 0;
rep(i, n) {
r += min(a[i], b[i]);
b[i] = max((ll)0, a[i] - b[i]);
if (b[i] == 0)
continue;
r += min(a[i + 1], b[i]);
a[i + 1] = max((ll)0, a[i + 1] - b[i]);
}
mes(r);
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
struct io {
io() {
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
signed main(void) {
ll n;
cin >> n;
vll a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll r = 0;
rep(i, n) {
r += min(a[i], b[i]);
b[i] = max((ll)0, b[i] - a[i]);
if (b[i] == 0)
continue;
r += min(a[i + 1], b[i]);
a[i + 1] = max((ll)0, a[i + 1] - b[i]);
}
mes(r);
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,046 | 766,047 | u038537254 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int n;
cin >> n;
vector<ll> v(n + 1);
vector<ll> u(n);
rep(i, n + 1) cin >> v[i];
rep(i, n) cin >> u[i];
ll ans = 0;
rep(i, n) {
ans += min(v[i], u[i]);
u[i] = max((ll)0, u[i] - v[i]);
if (u[i] == 0)
continue;
ans += min(v[i + 1], u[i]);
v[i] = max((ll)0, v[i] - u[i]);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void solve() {
int n;
cin >> n;
vector<ll> v(n + 1);
vector<ll> u(n);
rep(i, n + 1) cin >> v[i];
rep(i, n) cin >> u[i];
ll ans = 0;
rep(i, n) {
ans += min(v[i], u[i]);
u[i] = max((ll)0, u[i] - v[i]);
if (u[i] == 0)
continue;
ans += min(v[i + 1], u[i]);
v[i + 1] = max((ll)0, v[i + 1] - u[i]);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | [
"assignment.change"
] | 766,048 | 766,049 | u280175105 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n + 1);
rep(i, n + 1) cin >> v[i];
vector<int> u(n);
rep(i, n) cin >> u[i];
int ans = 0;
rep(i, n) {
if (v[i] >= u[i])
ans += u[i];
else {
ans += v[i];
u[i] -= v[i];
if (v[i + 1] >= u[i]) {
ans += u[i];
v[i + 1] -= u[i];
} else {
ans += v[i + 1];
v[i + 1] = 0;
}
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n + 1);
rep(i, n + 1) cin >> v[i];
vector<int> u(n);
rep(i, n) cin >> u[i];
long ans = 0;
rep(i, n) {
if (v[i] >= u[i])
ans += u[i];
else {
ans += v[i];
u[i] -= v[i];
if (v[i + 1] >= u[i]) {
ans += u[i];
v[i + 1] -= u[i];
} else {
ans += v[i + 1];
v[i + 1] = 0;
}
}
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
| [
"variable_declaration.type.primitive.change"
] | 766,050 | 766,051 | u280175105 | cpp |
p02959 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
std::cin >> N;
std::vector<int> A(N + 1);
std::vector<int> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
int result = 0;
for (int i = N - 1; i >= 0; i--) {
if (A[i + 1] >= B[i]) {
result += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
result += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
if (A[i] >= B[i]) {
result += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
result += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
}
std::cout << result << std::endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
std::cin >> N;
std::vector<long> A(N + 1);
std::vector<long> B(N);
for (int i = 0; i < N + 1; i++) {
std::cin >> A[i];
}
for (int i = 0; i < N; i++) {
std::cin >> B[i];
}
long result = 0;
for (int i = N - 1; i >= 0; i--) {
if (A[i + 1] >= B[i]) {
result += B[i];
A[i + 1] = A[i + 1] - B[i];
B[i] = 0;
} else {
result += A[i + 1];
B[i] = B[i] - A[i + 1];
A[i + 1] = 0;
}
if (A[i] >= B[i]) {
result += B[i];
A[i] = A[i] - B[i];
B[i] = 0;
} else {
result += A[i];
B[i] = B[i] - A[i];
A[i] = 0;
}
}
std::cout << result << std::endl;
}
| [
"variable_declaration.type.primitive.change"
] | 766,054 | 766,055 | u059976138 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
int count = 0;
rep(i, n + 1) {
cin >> a[i];
count += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i]) {
a[i] -= b[i];
b[i] = 0;
} else {
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
b[i] = 0;
} else {
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
int count2 = 0;
rep(i, n + 1) { count2 += a[i]; }
cout << count - count2 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
ll count = 0;
rep(i, n + 1) {
cin >> a[i];
count += a[i];
}
rep(i, n) cin >> b[i];
rep(i, n) {
if (a[i] >= b[i]) {
a[i] -= b[i];
b[i] = 0;
} else {
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] >= b[i]) {
a[i + 1] -= b[i];
b[i] = 0;
} else {
b[i] -= a[i + 1];
a[i + 1] = 0;
}
}
}
ll count2 = 0;
rep(i, n + 1) { count2 += a[i]; }
cout << count - count2 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,058 | 766,059 | u869009830 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (b[i] <= a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
// cout << b[i] << " " << a[i] << endl;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main() {
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (b[i] <= a[i]) {
ans += b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (b[i] <= a[i + 1]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
// cout << b[i] << " " << a[i] << endl;
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 766,060 | 766,061 | u534923072 | cpp |
p02959 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
int sum = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n + 1) sum += a[i];
rep(i, n) {
if (a[i] > b[i]) {
a[i] -= b[i];
continue;
} else if (a[i] < b[i]) {
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
} else
a[i + 1] = 0;
} else {
a[i] = 0;
b[i] = 0;
}
}
int sa = 0;
rep(i, n + 1) sa += a[i];
cout << sum - sa;
} | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
ll sum = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n + 1) sum += a[i];
rep(i, n) {
if (a[i] > b[i]) {
a[i] -= b[i];
continue;
} else if (a[i] < b[i]) {
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
} else
a[i + 1] = 0;
} else {
a[i] = 0;
b[i] = 0;
}
}
ll sa = 0;
rep(i, n + 1) sa += a[i];
cout << sum - sa;
}
| [
"variable_declaration.type.change"
] | 766,064 | 766,065 | u510989601 | cpp |
p02959 | #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1);
vector<int> b(n);
int sum = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n + 1) sum += a[i];
rep(i, n) {
if (a[i] > b[i]) {
a[i] -= b[i];
continue;
} else if (a[i] < b[i]) {
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
} else
a[i + 1] = 0;
} else {
a[i] = 0;
b[i] = 0;
}
}
int sa = 0;
rep(i, n + 1) sa += a[i];
cout << sum - sa;
}
| #include <algorithm>
#include <ciso646>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<ll> a(n + 1);
vector<ll> b(n);
ll sum = 0;
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n + 1) sum += a[i];
rep(i, n) {
if (a[i] > b[i]) {
a[i] -= b[i];
continue;
} else if (a[i] < b[i]) {
b[i] -= a[i];
a[i] = 0;
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
} else
a[i + 1] = 0;
} else {
a[i] = 0;
b[i] = 0;
}
}
ll sa = 0;
rep(i, n + 1) sa += a[i];
cout << sum - sa;
}
| [
"variable_declaration.type.change"
] | 766,066 | 766,065 | u510989601 | 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() {
ll N;
cin >> N;
vector<ll> B(N + 1);
vector<ll> A(N);
ll ans = 0;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
for (int i = 0; i < N; i++) {
if (A[i] >= B[i])
ans += B[i]; // B[i]だけ倒して町にはモンスターが残る
else if (A[i] < B[i]) {
ans += A[i]; //町にいるモンスターは全滅
B[i] -= A[i]; //倒せる残りの数を更新
if (A[i + 1] >= B[i]) { //次の街にいるモンスターのほうがキャパより多い
ans += B[i];
A[i + 1] -= B[i];
} else if (A[i + 1] < B[i]) { //次の街も全滅させられる
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll N;
cin >> N;
vector<ll> B(N + 2);
vector<ll> A(N + 1);
ll ans = 0;
rep(i, N + 1) cin >> A[i];
rep(i, N) cin >> B[i];
for (int i = 0; i < N; i++) {
if (A[i] >= B[i])
ans += B[i]; // B[i]だけ倒して町にはモンスターが残る
else if (A[i] < B[i]) {
ans += A[i]; //町にいるモンスターは全滅
B[i] -= A[i]; //倒せる残りの数を更新
if (A[i + 1] >= B[i]) { //次の街にいるモンスターのほうがキャパより多い
ans += B[i];
A[i + 1] -= B[i];
} else if (A[i + 1] < B[i]) { //次の街も全滅させられる
ans += A[i + 1];
A[i + 1] = 0;
}
}
}
cout << ans << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 766,071 | 766,072 | u078435079 | cpp |
p02959 | #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp << " "
#define nw << "\n"
#define ca "Case " << tc++ << ": "
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ull unsigned LL
#define check cout << "* ";
#define show_vector(i) \
for (int q = 0; q < i.size(); q++) { \
cout << i[q] << " "; \
}
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define N_MAX 26
#define rep(i, a, b) for (int i = a; i < b; i++)
const int inf = 1 << 30;
const long long int INF = 1e10;
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 10;
int a[200005], b[1000005];
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
/*
int ck_prime(int n)
{
int coun;
coun=0;
if(n>1){
for(int i=2;i*i<=n;i++){
if( n%i==0 ){
coun++;
break;
}
}
}
if(n==1){
coun=coun;
}
if(coun==0){
return 1; // n is prime
}
return 0;
}
*/
int main() {
int n;
cin >> n;
vector<int> a(n), b(n - 1);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
long long int sum = 0;
rep(i, 0, n) {
int x = min(a[i], b[i]);
sum += x;
a[i] = a[i] - x;
b[i] = b[i] - x;
x = min(a[i + 1], b[i]);
sum += x;
a[i + 1] = a[i + 1] - x;
b[i] = b[i] - x;
}
cout << sum nw;
}
| #include <iostream>
#include <deque>
#include <stdio.h>
#include <cstdio>
#include <algorithm>
#include <bits/stdc++.h>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define sp << " "
#define nw << "\n"
#define ca "Case " << tc++ << ": "
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ull unsigned LL
#define check cout << "* ";
#define show_vector(i) \
for (int q = 0; q < i.size(); q++) { \
cout << i[q] << " "; \
}
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define N_MAX 26
#define rep(i, a, b) for (int i = a; i < b; i++)
const int inf = 1 << 30;
const long long int INF = 1e10;
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 10;
int a[200005], b[1000005];
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
/*
int ck_prime(int n)
{
int coun;
coun=0;
if(n>1){
for(int i=2;i*i<=n;i++){
if( n%i==0 ){
coun++;
break;
}
}
}
if(n==1){
coun=coun;
}
if(coun==0){
return 1; // n is prime
}
return 0;
}
*/
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, 0, n + 1) cin >> a[i];
rep(i, 0, n) cin >> b[i];
long long int sum = 0;
rep(i, 0, n) {
int x = min(a[i], b[i]);
sum += x;
a[i] = a[i] - x;
b[i] = b[i] - x;
x = min(a[i + 1], b[i]);
sum += x;
a[i + 1] = a[i + 1] - x;
b[i] = b[i] - x;
}
cout << sum nw;
}
| [
"expression.operation.binary.remove"
] | 766,073 | 766,074 | u156677439 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
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 count = 0;
rep(i, n) rep(j, 2) {
if (a[i + j] > b[i]) {
a[i + j] -= b[i];
count += b[i];
b[i] = 0;
} else {
b[i] -= a[i + j];
count += a[i + j];
a[i + j] = 0;
}
}
cout << count << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll count = 0;
rep(i, n) rep(j, 2) {
if (a[i + j] > b[i]) {
a[i + j] -= b[i];
count += b[i];
b[i] = 0;
} else {
b[i] -= a[i + j];
count += a[i + j];
a[i + j] = 0;
}
}
cout << count << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,075 | 766,076 | u622070196 | cpp |
p02959 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
int ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), b(n);
rep(i, n + 1) cin >> a[i];
rep(i, n) cin >> b[i];
ll ans = 0;
rep(i, n) {
if (a[i] >= b[i]) {
ans += b[i];
a[i] -= b[i];
} else {
ans += a[i];
b[i] -= a[i];
if (a[i + 1] >= b[i]) {
ans += b[i];
a[i + 1] -= b[i];
} else {
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change"
] | 766,077 | 766,078 | u556120601 | cpp |
p02959 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> monsters(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> monsters[i];
}
int last = monsters[0];
int killed = 0;
for (int i = 1; i < n + 1; i++) {
int kill;
cin >> kill;
int new_last = monsters[i];
if (last < kill) {
if (new_last + last > kill) {
killed += kill;
new_last -= kill - last;
} else {
killed += (new_last + last);
new_last = 0;
}
} else {
killed += kill;
}
last = new_last;
}
cout << killed;
} | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> monsters(n + 1);
for (int i = 0; i < n + 1; i++) {
cin >> monsters[i];
}
int last = monsters[0];
ll killed = 0;
for (int i = 1; i < n + 1; i++) {
int kill;
cin >> kill;
int new_last = monsters[i];
if (last < kill) {
if (new_last + last > kill) {
killed += kill;
new_last -= kill - last;
} else {
killed += (new_last + last);
new_last = 0;
}
} else {
killed += kill;
}
last = new_last;
}
cout << killed;
} | [
"variable_declaration.type.change"
] | 766,083 | 766,084 | u323819429 | cpp |
p02959 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), 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]) {
a[i] -= b[i];
ans += b[i];
b[i] = 0;
} else {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
}
if (b[i] > 0) {
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
} else {
b[i] -= a[i + 1];
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n + 1), 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]) {
a[i] -= b[i];
ans += b[i];
b[i] = 0;
} else {
b[i] -= a[i];
ans += a[i];
a[i] = 0;
}
if (b[i] > 0) {
if (a[i + 1] > b[i]) {
a[i + 1] -= b[i];
ans += b[i];
b[i] = 0;
} else {
b[i] -= a[i + 1];
ans += a[i + 1];
a[i + 1] = 0;
}
}
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,085 | 766,086 | u447455959 | cpp |
p02959 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll i, n, a[100010], b[100010];
cin >> n;
ll sum = 0;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
a[i] = a[i] - b[i];
} else {
b[i] = b[i] - a[i];
a[i] = 0;
a[i + 1] = max(ll(0), a[i + 1] - b[i]);
}
}
int sum1 = 0;
for (i = 0; i < n + 1; i++) {
sum1 += a[i];
}
cout << sum - sum1 << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll i, n, a[100010], b[100010];
cin >> n;
ll sum = 0;
for (i = 0; i < n + 1; i++) {
cin >> a[i];
sum += a[i];
}
for (i = 0; i < n; i++) {
cin >> b[i];
}
for (i = 0; i < n; i++) {
if (a[i] >= b[i]) {
a[i] = a[i] - b[i];
} else {
b[i] = b[i] - a[i];
a[i] = 0;
a[i + 1] = max(ll(0), a[i + 1] - b[i]);
}
}
ll sum1 = 0;
for (i = 0; i < n + 1; i++) {
sum1 += a[i];
}
cout << sum - sum1 << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 766,089 | 766,090 | u265187423 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.