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 8
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<ll, ll>
#define vi vector<ll>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pf(n) printf("%lld\n", n)
#define sf(n) scanf("%lld", &n)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<ll, ll>
#define vi vector<ll>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pf(n) printf("%lld\n", n)
#define sf(n) scanf("%lld", &n)
#define fast ... | [
"expression.operation.binary.add"
] | 956,606 | 956,607 | u501976062 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FC ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)
#define deb(x) \
cerr << "DEBUG------" << '\n'; ... | #include <bits/stdc++.h>
using namespace std;
#define FC ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)
#define deb(x) \
cerr << "DEBUG------" << '\n'; ... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 956,610 | 956,611 | u890662292 | cpp |
p03160 | // https://atcoder.jp/contests/dp/tasks/dp_a
// shauryakr
#include <bits/stdc++.h>
using namespace std;
int arr[200010];
int dp[200010];
int n;
int solve(int ind) {
if (ind == n - 1)
return 0;
if (dp[ind] != -1)
return dp[ind];
int ans = 0;
ans = solve(ind + 1) + abs(arr[ind + 1] - arr[ind]);
if (ind... | // https://atcoder.jp/contests/dp/tasks/dp_a
// shauryakr
#include <bits/stdc++.h>
using namespace std;
int arr[200010];
int dp[200010];
int n;
int solve(int ind) {
if (ind == n - 1)
return 0;
if (dp[ind] != -1)
return dp[ind];
int ans = 0;
ans = solve(ind + 1) + abs(arr[ind + 1] - arr[ind]);
if (ind... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"literal.number.change",
"io.output.change"
] | 956,614 | 956,615 | u009824133 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pa pair<int, int>
#define ld long double
#define BOOST ios_base::sync_with_stdio(false)
#define pb push_back
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX];
int main() {
int n;
scanf("%d", &n);
int tab[n];
dp[0] = 0;
dp[... | #include <bits/stdc++.h>
#define ll long long int
#define mp make_pair
#define pa pair<int, int>
#define ld long double
#define BOOST ios_base::sync_with_stdio(false)
#define pb push_back
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX];
int main() {
int n;
scanf("%d", &n);
int tab[n];
dp[0] = 0;
dp[... | [] | 956,616 | 956,617 | u668264508 | cpp |
p03160 |
// jha4032
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define M 1000000007
#define N 1000006
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll power(ll a, ll b) {
if (b == 0)
return 1;
ll tmp = power(a, b / 2) % M;
... |
// jha4032
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define M 1000000007
#define N 1000006
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll power(ll a, ll b) {
if (b == 0)
return 1;
ll tmp = power(a, b / 2) % M;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,621 | 956,622 | u897346581 | cpp |
p03160 |
// jha4032
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define M 1000000007
#define N 1000006
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll power(ll a, ll b) {
if (b == 0)
return 1;
ll tmp = power(a, b / 2) % M;
... |
// jha4032
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define M 1000000007
#define N 1000006
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
ll power(ll a, ll b) {
if (b == 0)
return 1;
ll tmp = power(a, b / 2) % M;
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 956,623 | 956,624 | u897346581 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
// FASTIO
int n;
int arr[n];
long long dp[n];
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
fill(dp, dp + n, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = min(dp[i], dp[i - 1] + abs(arr... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
// FASTIO
int n;
int arr[110000];
long long dp[110000];
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
fill(dp, dp + n, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = min(dp[i], dp[i - 1]... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"io.output.newline.add"
] | 956,629 | 956,628 | u506632698 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int Maxn = 100010;
const int INF = 100010;
int dp[Maxn], h[Maxn];
int main() {
int n, k;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
fill(dp, dp + Maxn, INF);
dp[0] = 0;
for (int... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int Maxn = 100010;
const int INF = (int)1e9;
int dp[Maxn], h[Maxn];
int main() {
int n, k;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
fill(dp, dp + Maxn, INF);
dp[0] = 0;
for (i... | [
"type_conversion.add"
] | 956,630 | 956,631 | u456333842 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int pd[1000000];
int v[1000000], n;
int ms() {
pd[1] = 0;
pd[2] = abs(v[2] - v[1]);
for (int i = 3; i <= n - 1; i++) {
pd[i] =
min(pd[i - 1] + abs(v[i] - v[i - 1]), pd[i - 2] + abs(v[i] - v[i - 2]));
}
return pd[n - 1];
}
int main() {
scanf("%d"... | #include <bits/stdc++.h>
using namespace std;
int pd[1000000];
int v[1000000], n;
int ms() {
pd[1] = 0;
pd[2] = abs(v[2] - v[1]);
for (int i = 3; i <= n; i++) {
pd[i] =
min(pd[i - 1] + abs(v[i] - v[i - 1]), pd[i - 2] + abs(v[i] - v[i - 2]));
}
return pd[n];
}
int main() {
scanf("%d", &n);
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 956,643 | 956,644 | u201928240 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(a) a.begin(), a.end()
#define pb push_back
#define ll long long
#define index(a) order_of_key(a)
#define value(a) find_by_order(a)
#define count_1 __builtin_popcount
#define mod(x, m) ((((x) %... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(a) a.begin(), a.end()
#define pb push_back
#define ll long long
#define index(a) order_of_key(a)
#define value(a) find_by_order(a)
#define count_1 __builtin_popcount
#define mod(x, m) ((((x) %... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 956,645 | 956,646 | u156373316 | cpp |
p03160 | // slight modification similar logic errichto's code
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
vector<int> h(n);
for (int &x : h) {
cin >> x;
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i ... | // slight modification similar logic errichto's code
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> h(n);
for (int &x : h) {
cin >> x;
}
vector<int> dp(n, INF);
dp[0] = 0;
... | [] | 956,654 | 956,655 | u280634298 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<int> vi(N);
for (int i = 0; i < N; ++i) {
cin >> vi[i];
}
if (N <= 1) {
cout << 0 << "\n";
return 0;
}
/*
vector<int> dp(N);
dp[0] = 0, dp[1] = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
vector<int> vi(N);
for (int i = 0; i < N; ++i) {
cin >> vi[i];
}
if (N <= 1) {
cout << 0 << "\n";
return 0;
}
/*
vector<int> dp(N);
dp[0] = 0, dp[1] = ... | [
"identifier.change",
"io.output.change"
] | 956,656 | 956,657 | u280634298 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5 + 9;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ios_base::sync_with_stdio(0); cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) {
scanf("%d", &x);
}
vector<int> dp(n... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ios_base::sync_with_stdio(0); cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int &x : a) {
scanf("%d", &x);
}
vector<int> dp(n... | [
"literal.number.change",
"expression.operation.binary.change"
] | 956,658 | 956,659 | u327949948 | cpp |
p03160 | #include <iostream>
using namespace std;
int N;
int H[100005];
int DP[100005];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> H[i + 1];
H[0] = H[1];
for (int i = 2; i < N + 1; i++)
DP[i] =
min(DP[i - 1] + abs(H[i] - H[i - 1]), DP[i - 2] + abs(H[i] - H[i - 1]));
cout << DP[N];
} | #include <iostream>
using namespace std;
int N;
int H[100005];
int DP[100005];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> H[i + 1];
H[0] = H[1];
for (int i = 2; i < N + 1; i++)
DP[i] =
min(DP[i - 1] + abs(H[i] - H[i - 1]), DP[i - 2] + abs(H[i] - H[i - 2]));
cout << DP[N];
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,664 | 956,665 | u462369736 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int niza[n];
for (int i = 0; i < n; i++) {
cin >> niza[i];
}
int dp[n];
memset(dp, -1, sizeof(dp));
dp[0] = niza[0];
dp[1] = abs(niza[1] - niza[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(niza[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int niza[n];
for (int i = 0; i < n; i++) {
cin >> niza[i];
}
int dp[n];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
dp[1] = abs(niza[1] - niza[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(niza[i] - niz... | [] | 956,686 | 956,687 | u430341757 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 956,696 | 956,697 | u286318237 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define nl '\n'
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define flood(x) memset(x, 0x3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define dcit \
cin.... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define nl '\n'
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define flood(x) memset(x, 0x3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define dcit \
cin.... | [
"assignment.change"
] | 956,698 | 956,699 | u777445689 | cpp |
p03160 | #include <bits/stdc++.h>
#define foru(a, b, c) for (int a = b; a <= c; ++a)
#define int long long
using namespace std;
int n, a[100001];
int h[100001];
main() {
cin >> n;
foru(i, 1, n) cin >> h[i];
foru(i, 2, n) a[i] = INT_MAX;
a[1] = 0;
foru(i, 1, n - 2) {
a[i + 1] = min(a[i + 1], a[i] + abs(h[i + 1] -... | #include <bits/stdc++.h>
#define foru(a, b, c) for (int a = b; a <= c; ++a)
#define int long long
using namespace std;
int n, a[100001];
int h[100001];
main() {
cin >> n;
foru(i, 1, n) cin >> h[i];
foru(i, 2, n) a[i] = INT_MAX;
a[1] = 0;
foru(i, 1, n - 1) {
a[i + 1] = min(a[i + 1], a[i] + abs(h[i + 1] -... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,702 | 956,703 | u089870626 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> sassi;
int numSassi;
cin >> numSassi;
sassi.resize(numSassi);
for (int i = 0; i < sassi.size(); i++) {
cin >> sassi[i];
}
int costoPrec, costoPrecPrec, temp;
costoPrec = abs(sassi[0] - sassi[1]);
costoPrecPrec = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> sassi;
int numSassi;
cin >> numSassi;
sassi.resize(numSassi);
for (int i = 0; i < sassi.size(); i++) {
cin >> sassi[i];
}
int costoPrec, costoPrecPrec, temp;
costoPrec = abs(sassi[0] - sassi[1]);
costoPrecPrec = 0;
for... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,706 | 956,707 | u845396889 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------... | [
"literal.number.change",
"call.arguments.change"
] | 956,710 | 956,709 | u055131803 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
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... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
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... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 956,711 | 956,712 | u824337972 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD... | [] | 956,713 | 956,714 | u824337972 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100005], f[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[1] = a[1];
f[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
f[i] =
min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2]));
cout <... | #include <bits/stdc++.h>
using namespace std;
int n, a[100005], f[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
f[i] =
min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2]));
cout << f... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 956,731 | 956,732 | u119908442 | cpp |
p03160 | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <... | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <... | [
"assignment.change"
] | 956,738 | 956,739 | u458798873 | cpp |
p03160 | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <... | #include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 956,740 | 956,739 | u458798873 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ll long long
using namespace std;
const int N = 1e5 + 10;
const int M = 1e9 + 7;
int main(... | #include <bits/stdc++.h>
#define endl '\n'
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ll long long
using namespace std;
const int N = 1e5 + 10;
const int M = 1e9 + 7;
int main(... | [] | 956,745 | 956,746 | u714262341 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, h[100010], dp[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", h + i);
if (i == 1)
dp[1] = 0;
else {
dp[i] = 2e9;
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i >= 3)
dp[i] ... | #include <bits/stdc++.h>
using namespace std;
int n, h[100010], dp[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", h + i);
if (i == 1)
dp[1] = 0;
else {
dp[i] = 2e9;
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i >= 3)
dp[i] ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,750 | 956,751 | u825075571 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
const int N = ... | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
const int N = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 956,752 | 956,753 | u162220269 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
int N;
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
int N;
l... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 956,758 | 956,759 | u257960005 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b... | [
"assignment.change"
] | 956,762 | 956,763 | u774144672 | cpp |
p03160 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define read freopen("in.in", "r", stdin)
#define write freopen("out.out", "w", stdout)
#define FastIO ios::sync_with_stdio(0)
typedef long long ll;
int n;
int cost[100005];
int memo[100005];
int dp(int idx) {
if (idx > n)... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <vector>
using namespace std;
#define read freopen("in.in", "r", stdin)
#define write freopen("out.out", "w", stdout)
#define FastIO ios::sync_with_stdio(0)
typedef long long ll;
int n;
int cost[100005];
int memo[100005];
int dp(int idx) {
if (idx > n)... | [] | 956,771 | 956,772 | u511749049 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int n;
int h[10010];
int dp[10010];
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(dp[0] - h[1]);
for (int i = 1; i < n - 1; ++i) {... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int n;
int h[100010];
int dp[100010];
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 1; i < n - 1; ++i) ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,773 | 956,774 | u542670845 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int cost[n] = {};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
if (i == 0)
continue;
if (i == 1) {
cost[i] = abs(cost[i - 1] - cost[i]);
continue;
}
cos... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int cost[n] = {};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
if (i == 0)
continue;
if (i == 1) {
cost[i] = abs(h[i - 1] - h[i]);
continue;
}
cost[i] =... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,782 | 956,783 | u798086274 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define nl "\n"
#define fastScan \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
#define int long long int
using namespace std;
int dp[123456];
int h[123456];
s... | #include <bits/stdc++.h>
#define pb push_back
#define nl "\n"
#define fastScan \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
#define int long long int
using namespace std;
int dp[123456];
int h[123456];
s... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,794 | 956,795 | u273451465 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 1000000007
#define all(_) _.begin(), _.end()
#define F first
#define S second
int main() {
ios_base ::sync... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define pb push_back
#define mp make_pair
#define MAX 1000000
#define mod 1000000007
#define all(_) _.begin(), _.end()
#define F first
#define S second
int main() {
ios_base ::sync... | [
"expression.operation.binary.add"
] | 956,796 | 956,797 | u924895886 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100001];
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100001];
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,798 | 956,799 | u387055019 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100001];
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100001];
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",... | 956,800 | 956,799 | u387055019 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100001];
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define INF 1000000000
#define MOD 1000000007
using namespace std;
ll dp[100001];
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,801 | 956,799 | u387055019 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
scanf("%d", &n);
vector<int> a(n);
vector<int> dp(n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
auto isValid = [&](int i) {
if (i < n)
return true;
return false;
};
dp[n - 1] = 0;
for (i = n - 2; i >= 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
scanf("%d", &n);
vector<int> a(n);
vector<int> dp(n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
auto isValid = [&](int i) {
if (i < n)
return true;
return false;
};
dp[n - 1] = 0;
for (i = n - 2; i >= 0; i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 956,806 | 956,807 | u294609931 | cpp |
p03160 | #include <algorithm>
#include <string>
namespace olymplib {
namespace {
template <class T> void writeInt(T x);
template <class T> void writeUInt(T x);
void writeChar(int x);
void writeWord(const char *s);
void writeDouble(double x, int len = 0);
static const int buf_size = 4096;
static int write_pos = 0;
static char wr... | #include <algorithm>
#include <string>
namespace olymplib {
namespace {
template <class T> void writeInt(T x);
template <class T> void writeUInt(T x);
void writeChar(int x);
void writeWord(const char *s);
void writeDouble(double x, int len = 0);
static const int buf_size = 4096;
static int write_pos = 0;
static char wr... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 956,811 | 956,812 | u217145434 | cpp |
p03160 | #include <algorithm>
#include <string>
namespace olymplib {
namespace {
template <class T> void writeInt(T x);
template <class T> void writeUInt(T x);
void writeChar(int x);
void writeWord(const char *s);
void writeDouble(double x, int len = 0);
static const int buf_size = 4096;
static int write_pos = 0;
static char wr... | #include <algorithm>
#include <string>
namespace olymplib {
namespace {
template <class T> void writeInt(T x);
template <class T> void writeUInt(T x);
void writeChar(int x);
void writeWord(const char *s);
void writeDouble(double x, int len = 0);
static const int buf_size = 4096;
static int write_pos = 0;
static char wr... | [
"control_flow.loop.for.condition.change"
] | 956,813 | 956,812 | u217145434 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 956,816 | 956,817 | u196798307 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vec... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.change"
] | 956,818 | 956,817 | u196798307 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans[n];
ans[0] = 0;
ans[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
ans[i] = min(ans[i - 1] + abs(a[i] - a[i - 1]),
ans[i - 2] + abs(a[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
ans[i] = min(ans[i - 1] + abs(a[i] - a[i - 1]),
ans[i - 2] + abs(... | [
"call.add",
"call.arguments.change"
] | 956,821 | 956,822 | u591744342 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int f[100005] = {0}, h[100001] = {0}, n;
int main() {
scanf("%d", &n);
f[100004] = 10007;
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
f[1] = 0;
for (int i = 2; i <= n; i++) {
f[i] = 10007;
for (int j = max(1, i - 2); j < i; j++) {
f[i] = min... | #include <bits/stdc++.h>
using namespace std;
int f[100010] = {0}, h[100010] = {0}, n;
int main() {
scanf("%d", &n);
f[100004] = 10007;
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
f[1] = 0;
for (int i = 2; i <= n; i++) {
f[i] = 2000000000;
for (int j = max(1, i - 2); j < i; j++) {
f[i] ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change"
] | 956,823 | 956,824 | u001863524 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define start... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define start... | [
"literal.number.change",
"variable_declaration.value.change"
] | 956,827 | 956,828 | u266509174 | cpp |
p03160 | /*input
3
10 20 10
*/
// author - Madhav Thakker
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
... | /*input
3
10 20 10
*/
// author - Madhav Thakker
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,831 | 956,832 | u110507182 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
int a[N];
int dp[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
dp[i] = 1e9 + 123;
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
if (i > 1) {
dp[i] = min(dp[i], dp[i - 1] + abs(a... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
int a[N];
int dp[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
dp[i] = 1e9 + 123;
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
if (i > 1) {
dp[i] = min(dp[i], dp[i - 1] + abs(a... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,837 | 956,838 | u434765267 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <v... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,841 | 956,842 | u049262741 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
using namespace std;
int x[100010], y[100010];
signed main() {
int a;
cin >> a;
x[0] = 0;
f(i, a) {
cin >> y[i];
if (i >= 2)
x[i] =
min(x[i -... | #include <bits/stdc++.h>
#define int long long
#define f(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define mod 1000000007
using namespace std;
int x[100010], y[100010];
signed main() {
int a;
cin >> a;
x[0] = 0;
f(i, a) {
cin >> y[i];
if (i >= 2)
x[i] =
min(x[i -... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,851 | 956,852 | u259210975 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
vector<int> h;
int cost[100000];
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a temperature expressed as an integer ranging... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
vector<int> h;
int cost[100000];
cin >> n;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a temperature expressed as an integer ranging... | [] | 956,853 | 956,854 | u103094881 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define inf 1e18
using namespace std;
ll dp[100007];
ll vis[100007];
ll arr[100007];
int n;
ll rec(int now) {
if (now > n)
return inf;
if (now == n)
return 0;
if (vis[now])
return dp[now];
ll q1 = llabs(arr[now + 1] - arr[now]) + rec(now + 1);
ll q2... | #include <bits/stdc++.h>
#define ll long long
#define inf 1e18
using namespace std;
ll dp[100007];
ll vis[100007];
ll arr[100007];
int n;
ll rec(int now) {
if (now >= n)
return inf;
if (now == n - 1)
return 0;
if (vis[now])
return dp[now];
ll q1 = llabs(arr[now + 1] - arr[now]) + rec(now + 1);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 956,861 | 956,862 | u050698382 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 50;
const int mod = 1e9 + 7;
int dp[maxn];
int h[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = h[2] - h[1];
for (int i = 3; i <= n; i++)
dp[i] =
min(d... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 50;
const int mod = 1e9 + 7;
int dp[maxn];
int h[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++)
dp[i] =
... | [
"call.add",
"call.arguments.change"
] | 956,863 | 956,864 | u475950249 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 50;
const int mod = 1e9 + 7;
int dp[maxn];
int h[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = h[2] - h[1];
for (int i = 3; i <= n; i++)
dp[i] =
min(d... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e5 + 50;
const int mod = 1e9 + 7;
int dp[maxn];
int h[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++)
dp[i] =
... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 956,865 | 956,864 | u475950249 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
long long num[100005];
long long mn[100005];
int main() {
int n, i, a;
scanf(" %d", &n);
for (i = 0; i < n; i++)
mn[i] = 1000000;
mn[0] = 0;
for (i = 0; i < n; i++) {
scanf(" %lld", &num[i]);
if (i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
long long num[100005];
long long mn[100005];
int main() {
long long n, i, a;
scanf(" %lld", &n);
for (i = 0; i < n; i++)
mn[i] = 1000000000;
mn[0] = 0;
for (i = 0; i < n; i++) {
scanf(" %lld", &num[i])... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"literal.number.change",
"assignment.value.change"
] | 956,872 | 956,871 | u520996989 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e5 + 9;
long long dp[inf], a[inf];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 2; i <= n; i++) {
long long x = dp[i - 1] + abs(a[i] - a[i - 1]);
long lo... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e5 + 9;
long long dp[inf], a[inf];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
long long x = dp[i - 1] + abs(a[i] - a[i - 1]);
long l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,874 | 956,875 | u664259916 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
vector<int> stones;
vector<int> costs;
int hops(int stone) {
if (stone < 1) {
return 0;
}
if (stone == 1) {
return abs(costs[stone] - costs[stone - 1]);
}
if (stones[stone] != -1) {
return stones[stone... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
vector<int> stones;
vector<int> costs;
int hops(int stone) {
if (stone < 1) {
return 0;
}
if (stone == 1) {
return abs(costs[stone] - costs[stone - 1]);
}
if (stones[stone] != -1) {
return stones[stone... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 956,878 | 956,879 | u660253398 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long... | [
"call.add",
"call.arguments.change"
] | 956,881 | 956,882 | u165454560 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 100100;
constexpr int INF = 1e9 + 5;
int n;
int arr[MAX_N];
int dp[MAX_N];
int main() {
scanf(" %d", &n);
for (int i = 1; i <= n; ++i) {
scanf(" %d", &arr[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = -1;
for (int... | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 100100;
constexpr int INF = 1e9 + 5;
int n;
int arr[MAX_N];
int dp[MAX_N];
int main() {
scanf(" %d", &n);
for (int i = 1; i <= n; ++i) {
scanf(" %d", &arr[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = -1;
for (int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 956,885 | 956,886 | u928667792 | cpp |
p03160 | /*
author: orthodoxparadox
09-Jan-2019
10:50:00
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define dbl long double
#define int ll
#define ll long long
#defi... | /*
author: orthodoxparadox
09-Jan-2019
10:50:00
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define dbl long double
#define int ll
#define ll long long
#defi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 956,889 | 956,890 | u202833686 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define debug(x) cout ... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define debug(x) cout ... | [
"expression.operation.binary.remove"
] | 956,899 | 956,900 | u496698613 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ms(x, t) memset(x, t, sizeof(x))
typedef long long int ll;
typedef unsigned long long int ull;
const int limit = 1e2 + 1;
const int inf = 1e7;
int h[limit];
int m[limit];
int abs(int i) {
if (i < 0) {
return -i;
}
return i;
}
int dp(int i) {
if (i < 1) {... | #include <bits/stdc++.h>
using namespace std;
#define ms(x, t) memset(x, t, sizeof(x))
typedef long long int ll;
typedef unsigned long long int ull;
const int limit = 1e5 + 2;
const int inf = 1e7;
ll h[limit];
ll m[limit];
int abs(int i) {
if (i < 0) {
return -i;
}
return i;
}
int dp(int i) {
if (i < 1) {
... | [
"literal.number.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 956,901 | 956,902 | u290948881 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 1; i <= N; i++)
cin >> h[i];
vector<int> dp(N + 1);
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i < N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 1; i <= N; i++)
cin >> h[i];
vector<int> dp(N + 1);
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 956,906 | 956,907 | u119098168 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 1e5 + 5;
ll n;
ll d[N], dp[N];
int main() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> d[i];
memset(dp, 0, sizeof dp);
dp[n - 2] = dp[n - 1] + abs(d[n - 2] - d[n - 1]);
for (int i = n - 2; i >= 0; i--)
dp[i] =
m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N = 1e5 + 5;
ll n;
ll d[N], dp[N];
int main() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> d[i];
memset(dp, 0, sizeof dp);
dp[n - 2] = dp[n - 1] + abs(d[n - 2] - d[n - 1]);
for (int i = n - 3; i >= 0; i--)
dp[i] =
m... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 956,908 | 956,909 | u389308389 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const int inf = 1e4 + 5;
ll dp[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k = 2;
cin >> n;
vector<int> a(n);
a[0] = dp[0] = inf;
for (int i = 1; i <= n; i++) {
cin >> a[i];
dp[i] =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const int inf = 1e9;
ll dp[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k = 2;
cin >> n;
vector<int> a(n);
a[0] = dp[0] = inf;
for (int i = 1; i <= n; i++) {
cin >> a[i];
dp[i] = inf... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 956,910 | 956,911 | u070200692 | cpp |
p03160 | #include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k = 2;
scanf("%d %d", &n);
vector<int> h(n), dp(n, 2000000000);
dp[0] = 0;
for (int i = 0; i < n; ++i)
scanf("%d", &h[i]);
for (int i = 1; i < n; ++i)
for (int p = max(0, i - k); p < i; ++p)
dp[i] =... | #include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n, k = 2;
scanf("%d", &n);
vector<int> h(n), dp(n, 2000000000);
dp[0] = 0;
for (int i = 0; i < n; ++i)
scanf("%d", &h[i]);
for (int i = 1; i < n; ++i)
for (int p = max(0, i - k); p < i; ++p)
dp[i] = mi... | [
"literal.string.change",
"call.arguments.change"
] | 956,912 | 956,913 | u904217313 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fto(i, s, e) for (int i = s; i <= e; ++i)
#define fto1(i, s, e) for (int i = s; i < e; ++i)
#define fdto(i, s, e) for (int i = s; i >= e; --i)
#define fit(var, it) \
for (__typeof(var.begin()) it = var.be... | #include <bits/stdc++.h>
using namespace std;
#define fto(i, s, e) for (int i = s; i <= e; ++i)
#define fto1(i, s, e) for (int i = s; i < e; ++i)
#define fdto(i, s, e) for (int i = s; i >= e; --i)
#define fit(var, it) \
for (__typeof(var.begin()) it = var.be... | [
"expression.operation.unary.arithmetic.remove"
] | 956,919 | 956,920 | u645891928 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1);
vector<int> dp(n + 1, 2'000'000'000);
for (auto i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = h[1];
for (auto i = 1; i <= n; i++) {
int i1 = i + 1;
int i2 = i + 2;
if (i1 <= n)... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1);
vector<int> dp(n + 1, 2'000'000'000);
for (auto i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = h[1];
for (auto i = 1; i <= n; i++) {
int i1 = i + 1;
int i2 = i + 2;
if (i1 <= n)... | [
"assignment.value.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,921 | 956,922 | u081445141 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define boost() \
ios_base ::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define boost() \
ios_base ::sync_with_stdio(0); ... | [
"expression.operation.binary.remove"
] | 956,923 | 956,924 | u243631447 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
int main() {
ll n;
cin >> n;
vll nums(n);
vll dp(n);
for (int i = 0; i < n; ++i) {
cin >> nums[i];
}
dp[0] = 0;
dp[1] = abs(nums[1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
int main() {
ll n;
cin >> n;
vll nums(n);
vll dp(n);
for (int i = 0; i < n; ++i) {
cin >> nums[i];
}
dp[0] = 0;
dp[1] = abs(nums[1]... | [
"expression.operation.binary.add"
] | 956,925 | 956,926 | u666721654 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
#define double ld
#define faster ios_base::sync_with_stdio(false);
typedef pair<int, int> pii;
///------------------------------------------------------------------------
const int inf = 1e18;
const int mod = 1e9 ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int ll
#define double ld
#define faster ios_base::sync_with_stdio(false);
typedef pair<int, int> pii;
///------------------------------------------------------------------------
const int inf = 1e18;
const int mod = 1e9 ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 956,927 | 956,928 | u493500152 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define DEBUG
#ifdef DEBUG
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define DEBUG
#ifdef DEBUG
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " ... | [
"literal.number.change",
"call.arguments.change"
] | 956,929 | 956,930 | u547372544 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
int min(int x, int y) { return x < y ? x : y; }
int abs(int x) { return x >= 0 ? x : (-1 * x); }
int main() {
int n, arr[105];
cin >> n;
int memo[105];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
memo[0] = 0;
memo[1] = abs(a... | #include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
int min(int x, int y) { return x < y ? x : y; }
int abs(int x) { return x >= 0 ? x : (-1 * x); }
int main() {
int n, arr[100005];
cin >> n;
int memo[100005];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
memo[0] = 0;
memo[1] =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 956,931 | 956,932 | u576847925 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long dp[100005];
int main() {
int n;
cin >> n;
int i;
long long a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i -... | #include <bits/stdc++.h>
using namespace std;
long long dp[100005];
int main() {
int n;
cin >> n;
int i;
long long a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2]... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 956,937 | 956,938 | u859075846 | cpp |
p03160 | //#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | //#include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | [
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 956,939 | 956,940 | u800497197 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[1000000], dp[1000000], a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
a = abs(h[i - 1] - h[i]);
b = abs(h[i - 2] - h[i]);
dp[i] = min(a ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[1000000], dp[1000000], a, b;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
a = abs(h[i - 1] - h[i]);
b = abs(h[i - 2] - h[i]);
dp[i] = min(a + d... | [] | 956,949 | 956,950 | u962104148 | cpp |
p03160 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | [
"call.arguments.change"
] | 956,953 | 956,954 | u811982971 | cpp |
p03160 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change",
"expression.operation.binary.remove",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 956,955 | 956,954 | u811982971 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll t;
cin >> t;
while (t--) {
ll n;
cin >> n;
ll arr[n], i, ans[n], x, y;
for (i = 0; i < n; i++)
cin >> arr[i];
ans[0] = 0;
x = abs(arr[1] - arr[0]);
ans[1] = ans[0] + x;
for (i = 2; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll t = 1;
while (t--) {
ll n;
cin >> n;
ll arr[n], i, ans[n], x, y;
for (i = 0; i < n; i++)
cin >> arr[i];
ans[0] = 0;
x = abs(arr[1] - arr[0]);
ans[1] = ans[0] + x;
for (i = 2; i < n; i++)
an... | [
"expression.operation.binary.remove"
] | 956,956 | 956,957 | u549346094 | cpp |
p03160 | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 956,958 | 956,959 | u904221771 | cpp |
p03160 | #include <iostream>
using namespace std;
#define N 100000
#define Q
#define INF 1 << 18
#define MIN(X, Y) ((X) < (Y) ? (X) : (Y))
#define ABS(X) ((X) < 0 ? -(X) : (X))
int dp[N + 1];
int main(void) {
int n;
int h[N + 1];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = INF;
}
dp[1]... | #include <iostream>
using namespace std;
#define N 100000
#define Q
#define INF 1 << 18
#define MIN(X, Y) ((X) < (Y) ? (X) : (Y))
#define ABS(X) ((X) < 0 ? -(X) : (X))
int dp[N + 1];
int main(void) {
int n;
int h[N + 1];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = INF;
}
dp[1]... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 956,960 | 956,961 | u023463844 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
#define M 1000000
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sz(x) (ll) x.size()
#define fill(a, x) memset(a, x, sizeof(a))
#define F first... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> ii;
#define M 1000000
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define sz(x) (ll) x.size()
#define fill(a, x) memset(a, x, sizeof(a))
#define F first... | [
"literal.number.change",
"call.arguments.change"
] | 956,968 | 956,969 | u183138131 | cpp |
p03160 | #include <fstream>
#include <iomanip>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
long arr[20000... | #include <fstream>
#include <iomanip>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
long arr[20000... | [
"expression.operation.binary.remove",
"assignment.add"
] | 956,970 | 956,971 | u283777760 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define SIZE(a) ll(a.size())
#define vll ... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define SIZE(a) ll(a.size())
#define vll ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 956,972 | 956,973 | u834354741 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
//#define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all... | #include <bits/stdc++.h>
using namespace std;
#define int long long
//#define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 956,974 | 956,975 | u693027786 | cpp |
p03160 | #include <bits/stdc++.h>
#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 all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chma... | #include <bits/stdc++.h>
#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 all(c) c.begin(), c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x, y) x = min(x, y)
#define chma... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 956,980 | 956,981 | u309470177 | cpp |
p03160 | #include <bits/stdc++.h>
#define maxn 505050
using namespace std;
typedef long long ll;
ll dp[maxn], a[maxn], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(dp[2] - dp[1]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), d... | #include <bits/stdc++.h>
#define maxn 505050
using namespace std;
typedef long long ll;
ll dp[maxn], a[maxn], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,984 | 956,985 | u797074342 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
vector<int> v(N, 0);
vector<int> memo(N, -1);
int cost(int pos, int n, int x) {
if (memo[pos] != -1)
return memo[pos];
else if (pos == n)
return 0;
else {
int min_cost = INT_MAX;
int curr_cost = 0;
for (int k = pos + 1; k <... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
vector<int> v(N, 0);
vector<int> memo(N, -1);
int cost(int pos, int n, int x) {
if (memo[pos] != -1)
return memo[pos];
else if (pos == n)
return 0;
else {
int min_cost = INT_MAX;
int curr_cost = 0;
for (int k = pos + 1; k <... | [
"call.add",
"control_flow.branch.if.condition.change"
] | 956,986 | 956,987 | u018679195 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define Me3za() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define Me3za() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0); ... | [
"control_flow.loop.for.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,990 | 956,991 | u018679195 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
lo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change"
] | 957,000 | 957,001 | u818349438 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
lo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
lo... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 957,002 | 957,001 | u818349438 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
int h[110000];
int dp[110000];
const int INF = 1001001001... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
int h[110000];
int dp[110000];
const int INF = 1001001001... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,004 | 957,005 | u818349438 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
#define ld long double
#define MAX 100000
int main() {
ll n, k;
cin >> n >> k;
ll a1, i;
vector<ll> a;
for (i = 0; i < n; i++) {
cin >> a1;
a.push_back(a1);
}
ll dp[n];
for (i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
#define ld long double
#define MAX 1000000000
int main() {
ll n, k;
cin >> n >> k;
ll a1, i;
vector<ll> a;
for (i = 0; i < n; i++) {
cin >> a1;
a.push_back(a1);
}
ll dp[n];
for (i = 0; i < n; i++)... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 957,010 | 957,011 | u904020199 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz 100100
ll a[sz];
ll ans[sz];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; ++i)
cin >> a[i];
ans[0] = 0;
for (ll i = 1; i < n; i++) {
ans[i] = ans[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz 100100
ll a[sz];
ll ans[sz];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; ++i)
cin >> a[i];
ans[0] = 0;
for (ll i = 1; i < n; i++) {
ans[i] = ans[i - 1] ... | [
"control_flow.loop.for.condition.change"
] | 957,017 | 957,018 | u155834868 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (lint i{}, i##_len = (n); i < i##_len; ++i)
#define DOUBLE_LOOP(i, h, j, w) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (lint i{}, i##_len = (n); i < i##_len; ++i)
#define DOUBLE_LOOP(i, h, j, w) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 957,028 | 957,029 | u917678406 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (lint i{}, i##_len = (n); i < i##_len; ++i)
#define DOUBLE_LOOP(i, h, j, w) ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (lint i{}, i##_len = (n); i < i##_len; ++i)
#define DOUBLE_LOOP(i, h, j, w) ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 957,030 | 957,029 | u917678406 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define vi vector<int>
#define tests \
int t; \
cin >> t; ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define vi vector<int>
#define tests \
int t; \
cin >> t; ... | [
"control_flow.return.add"
] | 957,032 | 957,033 | u955610038 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define vi vector<int>
#define tests \
int t; \
cin >> t; ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define vi vector<int>
#define tests \
int t; \
cin >> t; ... | [
"control_flow.return.add"
] | 957,034 | 957,033 | u955610038 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> dp(N), c(N);
rep(i, 0, N) cin >> c[i];
dp[0] = 0;
rep(i, 1, K) dp[i] = abs(c[0] - c[i]);
rep(i, K, N) {
dp[i] = dp[i - 1] + abs(c[i - 1] - c[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> dp(100005), c(N);
rep(i, 0, N) cin >> c[i];
dp[0] = 0;
rep(i, 1, K) dp[i] = abs(c[0] - c[i]);
rep(i, K, N) {
dp[i] = dp[i - 1] + abs(c[i - 1] -... | [] | 957,039 | 957,040 | u882098164 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n], cost[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 1; i < n; i++) {
if (k > 0) {
int mini = INT_MAX;
for (int j = 1; j <= min(k, n - 1); j++) {
mini = min(min... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n], cost[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 1; i < n; i++) {
if (k > 0) {
int mini = INT_MAX;
for (int j = 1; j <= min(k, i); j++) {
mini = min(mini, c... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 957,046 | 957,047 | u231101364 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.