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 <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int cost[N], height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
if (i == 0)
cost[i] = 0;
else
cost[i] = 2147483627;
}
for (int i = 0; i < N; i++) {
if (i + 1 < N)
cost[i + 1]... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int cost[N], height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
if (i == 0)
cost[i] = 0;
else
cost[i] = 2147483627;
}
for (int i = 0; i < N; i++) {
if (i + 1 < N)
cost[i + 1]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,303 | 953,302 | u002439051 | 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 dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(a[n - 1] - a[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] =
min(abs(a[i] - a[i + 1]) + dp[i + 1], 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 dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--) {
dp[i] =
min(abs(a[i] - a[i + 1]) + dp[i + 1], abs(a[i] ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,308 | 953,309 | u837533136 | cpp |
p03160 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iosfwd>
#... | [
"literal.number.change",
"assignment.value.change"
] | 953,315 | 953,316 | u684423349 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100] = {0};
int main() {
int n, i;
cin >> n;
int arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] ... | #include <bits/stdc++.h>
using namespace std;
long int dp[100001] = {0};
int main() {
long int n, i;
cin >> n;
long int arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 953,320 | 953,321 | u537339800 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define endl "\n"
ll h[100005];
ll mini[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> h[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define endl "\n"
ll h[100005];
ll mini[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> h[i]... | [
"call.add",
"call.arguments.change"
] | 953,329 | 953,330 | u616547520 | cpp |
p03160 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef std::vector<int> vi;
typedef std::vector<long long> vll;
#define pub push_back
#define pob pop_back
#define mp make_pair
#define ff first
#define ss second
#define umap unordered_map
#define uset unordered_set
#define forn(i, n) for (ll i... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef std::vector<int> vi;
typedef std::vector<long long> vll;
#define pub push_back
#define pob pop_back
#define mp make_pair
#define ff first
#define ss second
#define umap unordered_map
#define uset unordered_set
#define forn(i, n) for (ll i... | [
"call.add",
"call.arguments.change"
] | 953,333 | 953,334 | u532327992 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define loop(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
int main() {
ll n, i, j;
cin >> n;
ll a[n], dp[n + 3];
loop(i, 0, n) cin >> a[i];
dp[0] = 0;
dp[1] = ab... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define loop(i, a, b) for (i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
int main() {
ll n, i, j;
cin >> n;
ll a[n], dp[n + 3];
loop(i, 0, n) cin >> a[i];
dp[0] = 0;
dp[1] = ab... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,335 | 953,336 | u379656178 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i)
cin >> ar[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i] + abs(ar[i - 1] - ar[i]), dp[i - 1] + abs(ar[i - 2] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i)
cin >> ar[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 1] + abs(ar[i - 1] - ar[i]),
dp[i - 2] + abs... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,337 | 953,338 | u135066978 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i)
cin >> ar[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 1] + abs(ar[i - 1] - ar[i]),
dp[i - 2] + abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i)
cin >> ar[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 1] + abs(ar[i - 1] - ar[i]),
dp[i - 2] + abs... | [
"expression.operation.binary.add"
] | 953,339 | 953,338 | u135066978 | cpp |
p03160 | #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 dp[n];
memset(dp, 0, sizeof(dp));
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int f = dp[i - 1] + abs(arr[i] - arr[i - 1]);
... | #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 dp[n];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int f = dp[i - 1] + abs(arr[i] - arr[i - 1]);
in... | [] | 953,340 | 953,341 | u965448987 | cpp |
p03159 | #include <bits/stdc++.h>
using namespace std;
long long dp[5010][5010];
long long tmp[5010];
bool pos[5010][5010];
bool ptmp[5010];
int sz[5010];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vecto... | #include <bits/stdc++.h>
using namespace std;
long long dp[5010][5010];
long long tmp[5010];
bool pos[5010][5010];
bool ptmp[5010];
int sz[5010];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<vecto... | [] | 953,360 | 953,361 | u521364030 | cpp |
p03159 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 953,372 | 953,373 | u874947858 | cpp |
p03159 | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define LL long long
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return ... | #include <bits/stdc++.h>
using namespace std;
#define _for(i, j, N) for (int i = (j); i < (N); i++)
#define _rep(i, j, N) for (int i = (j); i <= (N); i++)
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define LL long long
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return ... | [
"literal.number.change",
"call.arguments.change"
] | 953,380 | 953,381 | u066651036 | cpp |
p03159 | #include <bits/stdc++.h>
#include <ostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
const ll INF = TEN(18);
i... | #include <bits/stdc++.h>
#include <ostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
const ll INF = TEN(18);
i... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,398 | 953,399 | u965174248 | cpp |
p03159 | #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.operation.binary.remove"
] | 953,401 | 953,402 | u309470177 | cpp |
p03159 | // https://atcoder.jp/contests/aising2019/tasks/aising2019_e
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)... | // https://atcoder.jp/contests/aising2019/tasks/aising2019_e
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if (1)
#else
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define DEBUG if (0)... | [
"assignment.value.change"
] | 953,407 | 953,408 | u613658617 | cpp |
p03159 | #include <bits/stdc++.h>
#define INF (1LL << 60)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
ll a[5005];
ll a2[5005];
vector<int> G[5005];
vector<int> G2[5005];
int cmp[5005];
ll dp[5005][5005][2];
int sz[5005];
int cnt2[5005];
void dfs(int v, int c) {
cmp[v] = c;
if (a[v] < 0LL)
... | #include <bits/stdc++.h>
#define INF (1LL << 60)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
ll a[5005];
ll a2[5005];
vector<int> G[5005];
vector<int> G2[5005];
int cmp[5005];
ll dp[5005][5005][2];
int sz[5005];
int cnt2[5005];
void dfs(int v, int c) {
cmp[v] = c;
if (a[v] < 0LL)
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 953,410 | 953,411 | u854869949 | cpp |
p03159 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
using i_i = tuple<int, int>;
int N;
void f(int u, int p, vector<int> &a, vector<vector<int>> &G,
vector<vector<ll>> &dp, vector<vector... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
using ll = long long;
using i_i = tuple<int, int>;
int N;
void f(int u, int p, vector<int> &a, vector<vector<int>> &G,
vector<vector<ll>> &dp, vector<vector... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 953,412 | 953,413 | u277541046 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define plxy pair<long long, pll>
#define I... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define plxy pair<long long, pll>
#define I... | [] | 953,416 | 953,417 | u353919145 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
int a[1000010];
int f[10000... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
int a[1000010];
int f[10000... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 953,420 | 953,421 | u353919145 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FAST \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FAST \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,424 | 953,425 | u572539622 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sffl(a, b) scanf("%lld %lld", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfffl(a, b, c) scanf("%lld %lld %lld", &a, &b... | #include <bits/stdc++.h>
using namespace std;
#define pf printf
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sffl(a, b) scanf("%lld %lld", &a, &b)
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfffl(a, b, c) scanf("%lld %lld %lld", &a, &b... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,431 | 953,432 | u018679195 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N), dp(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
dp[0] = vec[0], dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 2] + abs(vec[i] - vec[i - 2]),
dp[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N), dp(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
dp[0] = 0, dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 2] + abs(vec[i] - vec[i - 2]),
dp[i - 1] ... | [] | 953,433 | 953,434 | u187772564 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N), dp(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
dp[0] = vec[0], dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < N; i++) {
dp[i + 1] = min(dp[i - 2] + abs(vec[i] - vec[i - 2]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N), dp(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
dp[0] = 0, dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 2] + abs(vec[i] - vec[i - 2]),
dp[i - 1] ... | [
"expression.operation.binary.remove"
] | 953,435 | 953,434 | u187772564 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define lc 2 * v
#define rc 2 * v + 1
#define mid (s + e) / 2
#define ll long long
#define int long long
#define ld long double
#define pii pair<int, int>
#define pll pair<long long, long long>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define lc 2 * v
#define rc 2 * v + 1
#define mid (s + e) / 2
#define ll long long
#define int long long
#define ld long double
#define pii pair<int, int>
#define pll pair<long long, long long>
#defi... | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,438 | 953,439 | u717668588 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int calcCost(int N, vector<int> heights) {
// init dp array
vector<int> dp(N, 0);
dp[0] = 0;
dp[1] = abs(heights[1] - heights[0]);
if (N == 2) {
return dp[1];
}
int cost;
int firstJump;
int secondJump;
for (int i ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int calcCost(int N, vector<int> heights) {
// cout << "here\n";
// init dp array
vector<int> dp(N, 0);
dp[0] = 0;
dp[1] = abs(heights[1] - heights[0]);
if (N == 2) {
return dp[1];
}
int cost;
int firstJump;
int s... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,440 | 953,441 | u623883058 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [] | 953,457 | 953,460 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add"
] | 953,459 | 953,460 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,457 | 953,461 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 953,459 | 953,461 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [] | 953,457 | 953,462 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add"
] | 953,459 | 953,462 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,457 | 953,463 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 953,459 | 953,463 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,457 | 953,464 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 953,459 | 953,464 | u884476319 | cpp |
p03160 | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 953,459 | 953,465 | u884476319 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define omajinai \
ios::sync_with_stdio(false); ... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define omajinai \
ios::sync_with_stdio(false); ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 953,468 | 953,467 | u884476319 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define omajinai \
ios::sync_with_stdio(false); ... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define omajinai \
ios::sync_with_stdio(false); ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"identifier.change"
] | 953,469 | 953,467 | u884476319 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define PB push_back
#define MP make_pair
#define endl '\n'
#define all(a) (a).begin(), (a).end()
#define optimize() \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define PB push_back
#define MP make_pair
#define endl '\n'
#define all(a) (a).begin(), (a).end()
#define optimize() \
ios_base::sync_with_stdio(0); ... | [
"expression.operation.binary.remove"
] | 953,470 | 953,471 | u963996446 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define MSET(x, y) memset(x, y, sizeof(x))
#define M 100005
using namespace std;
int n, h[M], dp[M];
int main() {
scanf("%d", &n);
REP(i, 1, n) scanf("%d", &h[i]);
dp[1] = 0;
REP(i, 2, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
... | #include <bits/stdc++.h>
#define REP(x, y, z) for (int x = y; x <= z; x++)
#define MSET(x, y) memset(x, y, sizeof(x))
#define M 100005
using namespace std;
int n, h[M], dp[M];
int main() {
scanf("%d", &n);
REP(i, 1, n) scanf("%d", &h[i]);
dp[1] = 0;
REP(i, 2, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
... | [
"control_flow.branch.if.add"
] | 953,472 | 953,473 | u863370423 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100009;
ll cost[N], h[N];
int main() {
ll n, i, a, b;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &h[i]);
}
cost[n - 1] = fabs(h[i - 1] - h[i]);
for (i = n - 2; i >= 1; i--) {
a = fabs(h[i] - h[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100009;
ll cost[N], h[N];
int main() {
ll n, i, a, b;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &h[i]);
}
cost[n - 1] = fabs(h[n - 1] - h[n]);
for (i = n - 2; i >= 1; i--) {
a = fabs(h[i] - h[i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,474 | 953,475 | u863370423 | cpp |
p03160 | #include <bits/stdc++.h>
// freopen("transmitters.in","r",stdin);
// cout<<fixed<<setprecision(6)<<n<<endl;
// transform(s.begin(), s.end(), s.begin(), ::tolower);
// double PI=3.14159265359,c=0;
#define all(v) v.begin(), v.end()
#define endl '\n'
#define ll long long
//#define f(n) for(int i=;i<n;i++)
double PI = acos... | #include <bits/stdc++.h>
// freopen("transmitters.in","r",stdin);
// cout<<fixed<<setprecision(6)<<n<<endl;
// transform(s.begin(), s.end(), s.begin(), ::tolower);
// double PI=3.14159265359,c=0;
#define all(v) v.begin(), v.end()
#define endl '\n'
#define ll long long
//#define f(n) for(int i=;i<n;i++)
double PI = acos... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 953,480 | 953,481 | u863370423 | cpp |
p03160 | #include <bits/stdc++.h>
#define MAX 100005
#define pb push_back
#define mp make_pair
#define pii pair<long long, long long>
#define read(a) scanf("%d", &a)
#define p1(a) cout << "Check " << a << endl;
#define p2(a, b) cout << "Check " << a << ' ' << b << endl;
#define p3(a, b, c) cout << "Check " << a << ' ' << b << '... | #include <bits/stdc++.h>
#define MAX 100005
#define pb push_back
#define mp make_pair
#define pii pair<long long, long long>
#define read(a) scanf("%d", &a)
#define p1(a) cout << "Check " << a << endl;
#define p2(a, b) cout << "Check " << a << ' ' << b << endl;
#define p3(a, b, c) cout << "Check " << a << ' ' << b << '... | [
"literal.number.change",
"assignment.value.change"
] | 953,482 | 953,483 | u863370423 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> frog(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> frog[i];
}
vector<int> dp(n + 5, 0);
dp[1] = abs(frog[1] - frog[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(frog[i - 1] - frog[i])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> frog(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> frog[i];
}
vector<int> dp(n + 5, 0);
dp[2] = abs(frog[2] - frog[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(frog[i - 1] - frog[i])... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,484 | 953,485 | u863370423 | cpp |
p03160 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (l... | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (l... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 953,486 | 953,487 | u145179061 | cpp |
p03160 | #include <cmath>
#include <iostream>
int n;
long long int dp[100001];
int h[100001];
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
dp[i] = 100000;
std::cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
if (dp[i] + abs(h[i + 1] - h[i]) < dp[i + 1]) {
dp[i + 1] = dp[i] ... | #include <cmath>
#include <iostream>
int n;
int dp[100001];
int h[100001];
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
dp[i] = 2000000000;
std::cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
if (dp[i] + abs(h[i + 1] - h[i]) < dp[i + 1]) {
dp[i + 1] = dp[i] + abs(... | [
"literal.number.change",
"assignment.value.change"
] | 953,488 | 953,489 | u956593558 | cpp |
p03160 | #include <cmath>
#include <iostream>
int n;
int dp[100001];
int h[100001];
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
dp[i] = 100000;
std::cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
if (dp[i] + abs(h[i + 1] - h[i]) < dp[i + 1]) {
dp[i + 1] = dp[i] + abs(h[i ... | #include <cmath>
#include <iostream>
int n;
int dp[100001];
int h[100001];
int main() {
std::cin >> n;
for (int i = 0; i < n; i++) {
dp[i] = 2000000000;
std::cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
if (dp[i] + abs(h[i + 1] - h[i]) < dp[i + 1]) {
dp[i + 1] = dp[i] + abs(... | [
"literal.number.change",
"assignment.value.change"
] | 953,490 | 953,489 | u956593558 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int dp[N];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
dp[2] = abs(h[2] - h[0]);
for (int i = 0; i < N - 2; i++) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]),... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int dp[N];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
dp[2] = abs(h[2] - h[0]);
for (int i = 0; i < N - 2; i++) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]),... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 953,494 | 953,495 | u083494782 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 1e+5;
int main() {
long long N;
cin >> N;
vector<long long> h(N);
for (long long i = 0; i < N; i++)
cin >> h[i];
vecto... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const long long int INF = 1e9 + 5;
int main() {
long long N;
cin >> N;
vector<long long> h(N);
for (long long i = 0; i < N; i++)
cin >> h[i];
ve... | [
"literal.number.change"
] | 953,498 | 953,499 | u395652671 | cpp |
p03160 | /*
HELLO WORLD
-----------
SHUBHAM
-----------
:) CODING
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define in... | /*
HELLO WORLD
-----------
SHUBHAM
-----------
:) CODING
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define pb push_back
#define in... | [
"call.add",
"call.arguments.change"
] | 953,504 | 953,505 | u924233799 | cpp |
p03160 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,517 | 953,518 | u045238638 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n);
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n);
for (int i = 0; i < n; i++) ... | [
"call.add",
"call.arguments.change"
] | 953,524 | 953,525 | u530350853 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int main() {
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++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 1]));
cout... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int main() {
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++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,528 | 953,529 | u422780284 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
c... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int main() {
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++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 953,530 | 953,529 | u422780284 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 1]));
c... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int main() {
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++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,531 | 953,529 | u422780284 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll solve(int i, vector<ll> v, int n, vector<ll> &dp) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll cur = LONG_MAX;
if (i + 1 < n) {
cur = min(cur, abs(v[i] - v[i + 1]) + solve(i + 1, v, n, dp));
}
if (i + ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll solve(int i, vector<ll> v, int n, vector<ll> &dp) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll cur = LONG_MAX;
if (i + 1 < n) {
cur = min(cur, abs(v[i] - v[i + 1]) + solve(i + 1, v, n, dp));
}
if (i + ... | [
"call.arguments.change"
] | 953,539 | 953,540 | u294694938 | cpp |
p03160 | /*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : thanos1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _... | /*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : thanos1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _... | [
"call.remove"
] | 953,545 | 953,546 | u332867154 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll h[n + 1];
ll dp[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = 0;
dp[2] = h[2] - h[1];
for (ll i = 3; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll h[n + 1];
ll dp[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (ll i = 3; i <= n; i+... | [
"call.add",
"call.arguments.change"
] | 953,549 | 953,550 | u470829007 | cpp |
p03160 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int memoTable[100000];
int minCost(int index, int *stoneHeight, int nStones) {
if (index == nStones) {
return 0;
}
if (memoTable[index] != -1) {
return memoTable[index];
}
int op1 = (index + 1, stoneHeight, nStones) +
... | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int memoTable[100000];
int minCost(int index, int *stoneHeight, int nStones) {
if (index == nStones - 1) {
return 0;
}
if (memoTable[index] != -1) {
return memoTable[index];
}
int op1 = minCost(index + 1, stoneHeight, ... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.add",
"call.add"
] | 953,556 | 953,557 | u508422627 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n;
cin >> n;
ll int a[n];
for (ll int i = 0; i < n; i++)
cin >> a[i];
ll int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if (n > 2)
dp[2] = min(abs(a[2] - a[0]), dp[1] + a[2] - a[1]);
for (int i = 3;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n;
cin >> n;
ll int a[n];
for (ll int i = 0; i < n; i++)
cin >> a[i];
ll int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if (n > 2)
dp[2] = min(abs(a[2] - a[0]), dp[1] + abs(a[2] - a[1]));
for (int i ... | [
"call.add",
"call.arguments.change"
] | 953,562 | 953,563 | u322729493 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define frst first
#define sec second
#define fast cin.tie(0), ios_base ::sync_with_stdio(0)
#define db double
#define mod 1000000007
void online_judge() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define frst first
#define sec second
#define fast cin.tie(0), ios_base ::sync_with_stdio(0)
#define db double
#define mod 1000000007
void online_judge() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.t... | [
"call.remove"
] | 953,564 | 953,565 | u723601567 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define frst first
#define sec second
#define fast cin.tie(0), ios_base ::sync_with_stdio(0)
#define db double
#define mod 1000000007
void online_judge() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define frst first
#define sec second
#define fast cin.tie(0), ios_base ::sync_with_stdio(0)
#define db double
#define mod 1000000007
void online_judge() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.t... | [
"call.remove"
] | 953,566 | 953,567 | u723601567 | cpp |
p03160 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define mi map<int, int>
#define umi unordered_map<int, int>
#define pii pair<int, int... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define mi map<int, int>
#define umi unordered_map<int, int>
#define pii pair<int, int... | [
"call.remove"
] | 953,570 | 953,571 | u959464076 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int height[n + 1];
int dp[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &height[i]);
}
dp[1] = 0;
dp[2] = abs(height[1] - height[2]);
for (int i = 3; i <= n; i++) {
dp[i] = max(dp[i - 1] + abs(height[i - 1]... | #include <bits/stdc++.h>
/*
初始位置在石头1，要求跳到石头N
每一次可以跳1格或者2格，
每次从i跳到j，需要代价abs(height[i] - height[j])
求从1跳到N的最小代价
算法复杂度：O(n)
*/
using namespace std;
int main() {
int n;
scanf("%d", &n);
int height[n + 1];
int dp[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &height... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 953,574 | 953,575 | u439850264 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int height[n + 1];
int dp[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &height[i]);
}
dp[1] = 0;
dp[2] = abs(height[1] - height[2]);
for (int i = 3; i <= n; i++) {
dp[i] = max(dp[i - 1] + abs(height[i - 1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int height[n + 1];
int dp[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &height[i]);
}
dp[1] = 0;
dp[2] = abs(height[1] - height[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(height[i - 1]... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 953,574 | 953,576 | u439850264 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define int long long
#define pb push_back
#define mod 1000000007
#define endl '\n'
#define w(x) \
int x; \
cin >... | #include <bits/stdc++.h>
#include <stdint.h>
using namespace std;
#define int long long
#define pb push_back
#define mod 1000000007
#define endl '\n'
#define w(x) \
int x; \
cin >... | [
"call.remove"
] | 953,581 | 953,582 | u464104383 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int &x : v)
scanf("%d", &x);
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(d... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int &x : v)
scanf("%d", &x);
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 953,583 | 953,584 | u339548494 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
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;
}
long long inf = 100000000000000;
int main(... | #include <algorithm>
#include <iostream>
using namespace std;
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;
}
long long inf = 100000000000000;
int main(... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,591 | 953,592 | u836743234 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], i;
for (i = 0; i < n; i++)
cin >> h[i];
int a = 0, b = abs(h[1] - h[0]), c;
i = 2;
while (i < n) {
c = min(abs(h[i] - h[i - 1]) + b, abs(h[i] - h[i - 2]) + a);
a = b;
b = c;
i++;
}
cout << c << e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], i;
for (i = 0; i < n; i++)
cin >> h[i];
int a = 0, b = abs(h[1] - h[0]), c = b;
i = 2;
while (i < n) {
c = min(abs(h[i] - h[i - 1]) + b, abs(h[i] - h[i - 2]) + a);
a = b;
b = c;
i++;
}
// if(n ==... | [
"variable_declaration.value.change"
] | 953,593 | 953,594 | u554798265 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
std::cin.tie(0); \
std::ios_base::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb pus... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
std::cin.tie(0); \
std::ios_base::sync_with_stdio(false)
#define ll long long
#define Fi first
#define Se second
#define Pb pus... | [
"call.arguments.change",
"call.add",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 953,599 | 953,600 | u960080897 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define vb vector<bool>
#define pii pair<ll, ll>
#define mod 1000000007
#define pll pair<ll, ll>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) fo... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define vb vector<bool>
#define pii pair<ll, ll>
#define mod 1000000007
#define pll pair<ll, ll>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) fo... | [
"call.add",
"call.arguments.change"
] | 953,603 | 953,604 | u720542798 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int dp[n + 1];
dp[0] = dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int dp[n + 1];
dp[0] = dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,605 | 953,606 | u862953056 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1001001001;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n, INF);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1001001001;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 2, INF);
dp[0] = 0;
dp[1] = abs(h[0] - h[... | [
"assignment.change"
] | 953,609 | 953,610 | u786667376 | 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 dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));... | #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 dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
... | [] | 953,620 | 953,621 | u788146497 | 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 dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
max(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));... | #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 dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 953,622 | 953,621 | u788146497 | cpp |
p03160 | //<============ Author --> @venom ============>//
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fo(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#defin... | //<============ Author --> @venom ============>//
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fo(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pb emplace_back
#define mp make_pair
#define ff first
#define ss second
#defin... | [
"call.arguments.change"
] | 953,625 | 953,626 | u712465155 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 long long INF = pow(10, 6);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
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 long long INF = pow(10, 9);
... | [
"literal.number.change",
"call.arguments.change"
] | 953,644 | 953,645 | u095360661 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define INF 1000000000000000000
#define all(x) x.begin(), x.end()
#define PI 3.141592653589793
int main() {
int N;
cin >> N;
vector<int> H(N);
rep(i, N) { cin >> H[i]; }
vector<int> dp(N, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define INF 1000000000000000000
#define all(x) x.begin(), x.end()
#define PI 3.141592653589793
int main() {
int N;
cin >> N;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
vector<ll> dp(N, IN... | [
"call.arguments.change"
] | 953,646 | 953,647 | u115454768 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
int arr[100005];
int n;
long long dp[100005];
/*long long go(int i){
if(i == n-1)
return 0;
if(i >= n)
return 1000000;
int &ans = dp[i];
if(ans!=-1)
return ans;
ans = min(abs(arr[i] - arr[i+1]) + go(i+1) , ab... | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
int arr[100005];
int n;
long long dp[100005];
int main() {
// auto start = high_resolution_clock::now();
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[0] = 100000;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] =... | [
"literal.number.change",
"assignment.value.change"
] | 953,648 | 953,649 | u163562872 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define repx(x, i, n) for (int i = x; i < n; i++)
#define rep(i, n) repx(0, i, n)
#define all(x) x.begin(), x.end()
signed main() {
ll N;
cin >> N;
ll h[N];
ll DP[N];
rep(i, N) cin >> h[i];
DP[0] = 0;
DP[1] = abs(h[1] - h[0]);
rep(i, N)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define repx(x, i, n) for (int i = x; i < n; i++)
#define rep(i, n) repx(0, i, n)
#define all(x) x.begin(), x.end()
signed main() {
ll N;
cin >> N;
ll h[N];
ll DP[N];
rep(i, N) cin >> h[i];
DP[0] = 0;
DP[1] = abs(h[1] - h[0]);
repx(2, i... | [
"call.arguments.add"
] | 953,652 | 953,653 | u855838587 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define repx(x, i, n) for (int i = x; i < n; i++)
#define rep(i, n) repx(0, i, n)
#define all(x) x.begin(), x.end()
signed main() {
ll N;
cin >> N;
ll h[N + 10] = {0};
ll DP[N + 10] = {0};
repx(1, i, N + 1) cin >> h[i];
DP[2] = h[2] - h[1];... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define repx(x, i, n) for (int i = x; i < n; i++)
#define rep(i, n) repx(0, i, n)
#define all(x) x.begin(), x.end()
signed main() {
ll N;
cin >> N;
ll h[N + 10] = {0};
ll DP[N + 10] = {0};
repx(1, i, N + 1) cin >> h[i];
DP[2] = abs(h[2] - h... | [
"call.add",
"call.arguments.change"
] | 953,654 | 953,655 | u855838587 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
int ans[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
ans[0] = 0;
ans[1] = abs(height[1] - height[0]);
for (int i = 2; i < N; i++) {
ans[i] = min(ans[i - 1] + abs(height[i] - height[i - 1]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int height[N];
int ans[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
}
ans[0] = 0;
ans[1] = abs(height[1] - height[0]);
for (int i = 2; i < N; i++) {
ans[i] = min(ans[i - 1] + abs(height[i] - height[i - 1]),
... | [
"expression.operation.binary.add"
] | 953,656 | 953,657 | u052165189 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2]... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,662 | 953,663 | u309191974 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,664 | 953,663 | u309191974 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (i = 0; i < n; i++)
#define of(i, n) for (i = n - 1; i >= 0; i--)
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k = 0, t = 0, i = 0, mex = 0, e = 0, cnt = 0;
ll n, m;
cin >> n;
int a[n], dp[n... | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (i = 0; i < n; i++)
#define of(i, n) for (i = n - 1; i >= 0; i--)
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long k = 0, t = 0, i = 0, mex = 0, e = 0, cnt = 0;
ll n, m;
cin >> n;
int a[n], dp[n... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,665 | 953,666 | u744956225 | cpp |
p03160 | /*# # # # # # # # # # # # # # # # # # #
# # # # # # # # #
# # # # # ## # # # # # ## # # # # # # # # # # # # # ##
# # # # # # # # #
# # # # # # # # # # # # #*/
#include... | /*# # # # # # # # # # # # # # # # # # #
# # # # # # # # #
# # # # # ## # # # # # ## # # # # # # # # # # # # # ##
# # # # # # # # #
# # # # # # # # # # # # #*/
#include... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 953,667 | 953,668 | u600992329 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD (int)(998244353)
#define ceil(x, y) (x % y == 0 ? (x / y) : (x / y + 1))
#define FOR(i, N) for (int i = 0; i < N; ++i)
#define FOR1(i, N) for (int i = 1; i <= N; ++i)
#define vi vector<int>
#define pii pair<int, int>
#define pb pus... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD (int)(998244353)
#define ceil(x, y) (x % y == 0 ? (x / y) : (x / y + 1))
#define FOR(i, N) for (int i = 0; i < N; ++i)
#define FOR1(i, N) for (int i = 1; i <= N; ++i)
#define vi vector<int>
#define pii pair<int, int>
#define pb pus... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,673 | 953,674 | u391763659 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, h[100009], dp[100009];
cin >> n;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = dp[1] = 0;
for (i = 2; i <= n; 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];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, h[100009], dp[100009];
cin >> n;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = INT_MAX;
dp[1] = 0;
for (i = 2; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cout ... | [
"assignment.add"
] | 953,675 | 953,676 | u811723415 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, h[100009], dp[100009];
cin >> n;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = dp[1] = 0;
for (i = 2; i <= n; 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];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, h[100009], dp[100009];
cin >> n;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = INT_MAX;
dp[1] = 0;
for (i = 2; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cout ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.add"
] | 953,677 | 953,676 | u811723415 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[100005];
int main() {
memset(dp, -1, sizeof(dp));
ll n;
cin >> n;
ll arr[n];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = arr[1];
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[100005];
int main() {
memset(dp, -1, sizeof(dp));
ll n;
cin >> n;
ll arr[n];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + ab... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 953,686 | 953,687 | u004051291 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp1[100005];
int least[100005];
int n;
int dp(int m) {
if (m == 2)
return abs(least[2] - least[0]);
if (m == 1)
return abs(least[1] - least[0]);
if (dp1[m])
return dp1[m];
return dp1[m] = min(abs(least[m] - least[m - 1]) + dp(m - 1),
... | #include <bits/stdc++.h>
using namespace std;
int dp1[100005];
int least[100005];
int n;
int dp(int m) {
if (m == 2)
return abs(least[2] - least[0]);
if (m == 1)
return abs(least[1] - least[0]);
if (dp1[m] > -1)
return dp1[m];
return dp1[m] = min(abs(least[m] - least[m - 1]) + dp(m - 1),
... | [
"control_flow.branch.if.condition.change"
] | 953,693 | 953,694 | u240258562 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll... | [
"expression.operation.binary.remove"
] | 953,708 | 953,709 | u879674287 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,710 | 953,711 | u879674287 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
// i番目に到達するために必要なコストの最小値をdp[i]とする。
int dp[10010];
// dpテーブルの初期化
dp[0] = 0;
dp[1] = 0;
dp[2] = h[1] - h[0];
for (int i = 2; i < n; i++) {
dp[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
// i番目に到達するために必要なコストの最小値をdp[i]とする。
int dp[n];
// dpテーブルの初期化
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i + 1]... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.change"
] | 953,715 | 953,713 | u882039496 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> stones = vector<int>(n);
vector<int> dp = vector<int>(n, INF);
for (int i = 0; i < n; ++i)
cin >> stones[i];
dp[0] = 0;
for (int i = 0; i < n; ++i)
for (int j : {i + 1, i + 2})
if... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> stones = vector<int>(n);
vector<int> dp = vector<int>(n, INF);
for (int i = 0; i < n; ++i)
cin >> stones[i];
dp[0] = 0;
for (int i = 0; i < n; ++i)
for (int j : {i + 1, i + 2})
if... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,718 | 953,719 | u158312277 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
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;
}
int main() {
const long long INF = 1LL <... | #include <bits/stdc++.h>
using namespace std;
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;
}
int main() {
const long long INF = 1LL <... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,724 | 953,725 | u011539601 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define lli long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n, x;
cin >> n;
vector<lli> h;
for (lli i = 0; i < n; i++) {
cin >> x;
h.push_back(x);
}
vector<lli> dp(n, 999999);
dp[0] = 0;
for (lli i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define lli long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
lli n, x;
cin >> n;
vector<lli> h;
for (lli i = 0; i < n; i++) {
cin >> x;
h.push_back(x);
}
vector<lli> dp(n, 999999999);
dp[0] = 0;
for (lli i = 0; i < n; i++) ... | [
"literal.number.change",
"call.arguments.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 953,730 | 953,729 | u056755599 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int dp[n];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2... | #include <iostream>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n + 1];
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int dp[n];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(... | [
"expression.operation.binary.remove"
] | 953,731 | 953,732 | u051114039 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int a[100005], dp[100005];
int main(int argc, char **argv) {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1)
dp[i] = min(dp[i], ... | #include <cmath>
#include <iostream>
using namespace std;
int a[100005], dp[100005];
int main(int argc, char **argv) {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
dp[i] = min(dp[i], ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 953,733 | 953,734 | u141633429 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.