problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, dp[100010] = {}, h[100010];
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++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, dp[100010] = {}, h[100010];
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++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
}
| [] | 955,748 | 955,750 | u226749583 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#define siii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pi(a) printf("%d\n", a)
#define psi(a) printf(" %d", a)
#define poi(a) printf("%d", a)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
#define Nline() printf("\n")
#define sstr(str) scanf("%s", str)
#define pstr(str) printf("%s\n", str)
#define SET(a) memset(a, -1, sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define vi vector<int>
#define vvi vector<vi>
#define all(v) (v).begin(), (v).end()
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
#define VI(a, n) \
vi a(n); \
rep(i, n) cin >> a[i];
#define sq(n) (n) * (n)
#define iso \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(NULL);
int main() {
iso;
int n;
cin >> n;
int ar[n + 1];
f(i, 1, n + 1) cin >> ar[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(ar[0] - ar[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(ar[i] - ar[i - 1]),
dp[i - 2] + abs(ar[i] - ar[i - 2]));
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#define siii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define pi(a) printf("%d\n", a)
#define psi(a) printf(" %d", a)
#define poi(a) printf("%d", a)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
#define Nline() printf("\n")
#define sstr(str) scanf("%s", str)
#define pstr(str) printf("%s\n", str)
#define SET(a) memset(a, -1, sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define vi vector<int>
#define vvi vector<vi>
#define all(v) (v).begin(), (v).end()
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
#define VI(a, n) \
vi a(n); \
rep(i, n) cin >> a[i];
#define sq(n) (n) * (n)
#define iso \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(NULL);
int main() {
iso;
int n;
cin >> n;
int ar[n + 1];
f(i, 1, n + 1) cin >> ar[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(ar[i] - ar[i - 1]),
dp[i - 2] + abs(ar[i] - ar[i - 2]));
}
cout << dp[n];
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,756 | 955,758 | u207685829 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
ll n;
cin >> n;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {0};
for (ll i = 2; i <= n; i++) {
if (i == 2) {
dp[i] = a[i] - a[i - 1];
} else {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
ll n;
cin >> n;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {0};
for (ll i = 2; i <= n; i++) {
if (i == 2) {
dp[i] = abs(a[i] - a[i - 1]);
} else {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
}
}
cout << dp[n];
} | [
"call.add",
"call.arguments.change"
] | 955,759 | 955,760 | u131797876 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
#define lp(i, n) for (ll i = 0; i < n; i++)
using namespace std;
ll min(ll a, ll b) { return a < b ? a : b; }
int main() {
ll n;
cin >> n;
ll h[n];
lp(i, n) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
lp(i, n + 1) {
if (i - 1 > 0)
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i - 2 > 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define lp(i, n) for (ll i = 0; i < n; i++)
using namespace std;
ll min(ll a, ll b) { return a < b ? a : b; }
int main() {
ll n;
cin >> n;
ll h[n];
lp(i, n) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
lp(i, n + 1) {
if (i - 1 >= 0)
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 955,761 | 955,762 | u005739051 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
int dp[100010];
dp[0] = 0;
dp[1] = abs(b.at(0) - b.at(1));
for (int i = 2; i <= a; i++) {
dp[i] = min(dp[i - 1] + abs(b.at(i - 1) - b.at(i)),
dp[i - 2] + abs(b.at(i - 2) - b.at(i)));
}
cout << dp[a] << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
int dp[100010];
dp[0] = 0;
dp[1] = abs(b.at(0) - b.at(1));
for (int i = 2; i < a; i++) {
dp[i] = min(dp[i - 1] + abs(b.at(i - 1) - b.at(i)),
dp[i - 2] + abs(b.at(i - 2) - b.at(i)));
}
cout << dp[a - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 955,764 | 955,766 | u341447450 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] + arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1];
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,779 | 955,781 | u011986906 | cpp |
p03160 | /*
ID: flashysport101
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define F0R(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, a) for (int i = 0; i < (a); i++)
#define F0RR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define FORR(i, a) for (int i = (a)-1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define n << "\n"
#define k << " " <<
const int MOD = 1000000007;
const ll INF = 1e18;
const int MAXN = 1e5;
const string name = "drink";
int N, height[MAXN];
ll dp[MAXN];
int main() {
cin >> N;
FOR(i, N) cin >> height[i];
dp[1] = dp[0] + abs(height[1] - height[0]);
F0R(i, 2, N)
dp[i] = min(dp[i - 1] + abs(height[i] - height[i - 1]),
dp[i - 2] + abs(height[i] - height[i - 2]));
cout << dp[N] n;
}
| /*
ID: flashysport101
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define F0R(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, a) for (int i = 0; i < (a); i++)
#define F0RR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define FORR(i, a) for (int i = (a)-1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define n << "\n"
#define k << " " <<
const int MOD = 1000000007;
const ll INF = 1e18;
const int MAXN = 1e5;
const string name = "drink";
int N, height[MAXN];
ll dp[MAXN];
int main() {
cin >> N;
FOR(i, N) cin >> height[i];
dp[1] = dp[0] + abs(height[1] - height[0]);
F0R(i, 2, N)
dp[i] = min(dp[i - 1] + abs(height[i] - height[i - 1]),
dp[i - 2] + abs(height[i] - height[i - 2]));
cout << dp[N - 1] n;
}
| [
"expression.operation.binary.add"
] | 955,804 | 955,806 | u758353376 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/*
int chmax(int a, int b){
if(a<b)a=b;
}
void chmin(int a, int b){
if(a>b)a=b;
}
*/
int main(int argc, char **argv) {
int n;
cin >> n;
char hight[n];
int cost[n];
for (int i = 0; i < n; i++) {
int k;
cin >> k;
hight[i] = k;
}
int a;
int b;
cost[0] = 0;
cost[1] = abs(hight[1] - hight[0]);
for (int i = 2; i < n; i++) {
a = abs(hight[i] - hight[i - 1]);
b = abs(hight[i] - hight[i - 2]);
cost[i] = min(cost[i - 1] + a, cost[i - 2] + b);
}
cout << cost[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/*
int chmax(int a, int b){
if(a<b)a=b;
}
void chmin(int a, int b){
if(a>b)a=b;
}
*/
int main(int argc, char **argv) {
int n;
cin >> n;
int hight[n];
int cost[n];
for (int i = 0; i < n; i++) {
int k;
cin >> k;
hight[i] = k;
}
int a;
int b;
cost[0] = 0;
cost[1] = abs(hight[1] - hight[0]);
for (int i = 2; i < n; i++) {
a = abs(hight[i] - hight[i - 1]);
b = abs(hight[i] - hight[i - 2]);
cost[i] = min(cost[i - 1] + a, cost[i - 2] + b);
}
cout << cost[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 955,810 | 955,811 | u856586005 | cpp |
p03160 | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
ll i, j, k, n, m, a[200007], dp[200007];
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
dp[i] = 1e9;
for (j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
if (i == 1)
dp[i] = 0;
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
ll i, j, k = 2, n, m, a[200007], dp[200007];
int main() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
dp[i] = 1e9;
for (j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
if (i == 1)
dp[i] = 0;
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 955,821 | 955,823 | u594129396 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
int height[100000], dp[100000];
void read() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> height[i];
}
}
int max(int a, int b) {
if (a < b)
return a;
else
return b;
}
int solve() {
dp[0] = 0;
dp[1] = height[1] - height[0];
for (int i = 2; i < n; i++) {
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n - 1];
}
int main() {
read();
cout << solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int height[100000], dp[100000];
void read() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> height[i];
}
}
int max(int a, int b) {
if (a < b)
return a;
else
return b;
}
int solve() {
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n - 1];
}
int main() {
read();
cout << solve();
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 955,825 | 955,826 | u471769750 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[n] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1];
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 955,831 | 955,833 | u307571140 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[n] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 1] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1];
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,834 | 955,833 | u307571140 | cpp |
p03160 | #include <bits/stdc++.h>
#define oo int(1e9)
using namespace std;
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.tie(0);
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
for (int i = 1; i <= n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++)
if (dp[i] < oo) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
#define oo int(1e9)
using namespace std;
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.tie(0);
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
for (int i = 1; i < n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++)
if (dp[i] < oo) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 955,853 | 955,854 | u601330084 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if (n > 2) {
ans2 = abs(arr[n] - arr[n - 2]) + f(n - 2);
}
dp[n] = min(ans1, ans2);
return dp[n];
}
int32_t main() {
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << f(n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if (n > 2) {
ans2 = abs(arr[n] - arr[n - 2]) + f(n - 2);
}
dp[n] = min(ans1, ans2);
return dp[n];
}
int32_t main() {
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> arr[i];
cout << f(n);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 955,856 | 955,858 | u870168650 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[1000];
int dp[1000];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if (n > 2) {
ans2 = abs(arr[n] - arr[n - 2]) + f(n - 2);
}
dp[n] = min(ans1, ans2);
return dp[n];
}
int32_t main() {
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << f(n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if (n > 2) {
ans2 = abs(arr[n] - arr[n - 2]) + f(n - 2);
}
dp[n] = min(ans1, ans2);
return dp[n];
}
int32_t main() {
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> arr[i];
cout << f(n);
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 955,860 | 955,858 | u870168650 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[1000];
int dp[1000];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if (n > 2) {
ans2 = abs(arr[n] - arr[n - 2]) + f(n - 2);
}
dp[n] = min(ans1, ans2);
return dp[n];
}
int32_t main() {
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << f(n - 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if (n > 2) {
ans2 = abs(arr[n] - arr[n - 2]) + f(n - 2);
}
dp[n] = min(ans1, ans2);
return dp[n];
}
int32_t main() {
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> arr[i];
cout << f(n);
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"ex... | 955,861 | 955,858 | u870168650 | 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];
// cout<<arr[i]<<" ";
}
int a = 0;
int b = abs(arr[1] - arr[0]);
int cost = 0;
for (int i = 2; i < n; i++) {
int c1 = a + abs(arr[i] - arr[i - 2]);
int c2 = b + abs(arr[i] - arr[i - 1]);
// cout<<a<<" "<<b<<" ";
cost = min(c1, c2);
a = b;
b = cost;
// cout<<a<<" "<<b<<" "<<dp[i]<<" ";
}
// for(auto i:dp)
// cout<<i<<" ";
cout << cost;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
// cout<<arr[i]<<" ";
}
int a = 0;
int b = abs(arr[1] - arr[0]);
int cost = b;
for (int i = 2; i < n; i++) {
int c1 = a + abs(arr[i] - arr[i - 2]);
int c2 = b + abs(arr[i] - arr[i - 1]);
// cout<<a<<" "<<b<<" ";
cost = min(c1, c2);
a = b;
b = cost;
// cout<<a<<" "<<b<<" "<<dp[i]<<" ";
}
// for(auto i:dp)
// cout<<i<<" ";
cout << cost;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 955,621 | 955,622 | u174636610 | 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];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(a, b);
// cout<<dp[i]<<" ";
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
// cout<<arr[i]<<" ";
}
// cout<<"\n";
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(a, b);
// cout<<a<<" "<<b<<" "<<dp[i]<<" ";
}
// for(auto i:dp)
// cout<<i<<" ";
cout << dp[n - 1];
return 0;
} | [
"call.add",
"call.arguments.change"
] | 955,623 | 955,624 | u174636610 | cpp |
p03160 | #include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define mem(x, y) memset(x, y, sizeof(x))
#define lli long long int
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define BS binary_search
#define pii pair<lli, lli>
const long long int mod = 1000000009;
// const long long int mod=998244353;
const long double PI = 3.141592653589793;
const long long int inf = 1e18;
const long long int inf2 = LLONG_MAX;
#define setBitCount(x) __builtin_popcountll(x)
#define all(a) (a).begin(), (a).end()
#define all_r(a) (a).rbegin(), (a).rend()
lli gcd(lli a, lli b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
// calculating (x^y)%p
lli power(lli x, lli y, lli p) {
lli res = 1;
x = x % p;
while (y > 0) {
if (y & 1) // y is odd
res = (res * x) % p;
y = y >> 1;
x = ((x % p) * (x % p)) % p;
}
return res % p;
}
// calculating modular inverse using fermat little theorem
lli modInverse(lli n, lli p) { return power(n, p - 2, p) % p; }
// policy based data structures !!
#define ordered_set \
tree<lli, null_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
// s.order_of_key (k) : Number of items strictly smaller than k
// *(s.find_by_order(k)) : K-th element in a set (counting from zero)
void solve() {
lli n;
cin >> n;
lli a[n + 5];
for (lli i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 5];
mem(dp, 0);
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (lli i = 2; 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 << dp[n];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
lli T;
// cin>>T;
T = 1;
while (T--) {
solve();
}
return 0;
} | #include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define mem(x, y) memset(x, y, sizeof(x))
#define lli long long int
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define BS binary_search
#define pii pair<lli, lli>
const long long int mod = 1000000009;
// const long long int mod=998244353;
const long double PI = 3.141592653589793;
const long long int inf = 1e18;
const long long int inf2 = LLONG_MAX;
#define setBitCount(x) __builtin_popcountll(x)
#define all(a) (a).begin(), (a).end()
#define all_r(a) (a).rbegin(), (a).rend()
lli gcd(lli a, lli b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
// calculating (x^y)%p
lli power(lli x, lli y, lli p) {
lli res = 1;
x = x % p;
while (y > 0) {
if (y & 1) // y is odd
res = (res * x) % p;
y = y >> 1;
x = ((x % p) * (x % p)) % p;
}
return res % p;
}
// calculating modular inverse using fermat little theorem
lli modInverse(lli n, lli p) { return power(n, p - 2, p) % p; }
// policy based data structures !!
#define ordered_set \
tree<lli, null_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
// s.order_of_key (k) : Number of items strictly smaller than k
// *(s.find_by_order(k)) : K-th element in a set (counting from zero)
void solve() {
lli n;
cin >> n;
lli a[n + 5];
for (lli i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 5];
mem(dp, 0);
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (lli 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 << dp[n];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
lli T;
// cin>>T;
T = 1;
while (T--) {
solve();
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,625 | 955,626 | u539539244 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/*### FAST-IO ###*/
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
/*### DEBUGGGGGGG ###*/
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define testcases \
int testcases; \
cin >> testcases; \
while (testcases--)
#define queries \
int queries; \
cin >> queries; \
while (queries--)
/*### TO PRINT ###*/
#define pp1(a) cout << a << endl;
#define pp2(a, b) cout << a << " " << b << endl;
#define pp3(a, b, c) cout << a << " " << b << " " << c << endl;
#define pp4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl;
#define pp5(a, b, c, d, e) \
cout << a << " " << b << " " << c << " " << d << " " << e << endl;
/*### SSSSSSS ###*/
#define INF INT_MAX
#define endl "\n"
#define ll long long
#define int long long
ll mod = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define msi map<string, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define ff first
#define ss second
#define sz size()
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REP1(i, a, b) for (int i = a; i < b; i++)
#define f0(n) for (ll i = 0; i < n; i++)
#define f(n) for (ll i = 1; i <= n; i++)
#define fn(a, n) for (ll a = 0; a < n; a++)
#define flr(a, l, r) for (ll a = l; a <= r; a++)
#define sorta(a) sort(a.begin(), a.end());
#define sortd(a) sort(a.begin(), a.end(), greater<ll>());
#define sortdp(a) sort(a.begin(), a.end(), greater<pair<ll, ll>>());
#define blb(a, b) lower_bound(all(a), b) - a.begin();
#define bub(a, b) upper_bound(all(a), b) - a.begin();
#define stop return 0
/*### COMPARATOR ###*/
bool rev(int x, int y) { return x > y; }
/*### PAIR_SORT_IN_DESCENDING_ORDER ###*/
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
/*### MODULO ###*/
int modulo(int x, int N) { return (x % N + N) % N; }
/*### MAX & MIN ###*/
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int min(int a, int b) {
if (a <= b)
return a;
else
return b;
}
/*### MOD-DIFFERENCE ###*/
ll diff(ll a, ll b) {
if (a >= b)
return a - b;
else
return b - a;
}
/*### PAIR-SORTING ###*/
void pairsort(int a[], int b[], ll n) {
pair<int, int> pairt[n];
for (int i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (int i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
/*### GCD && LCM ###*/
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
/*### PRIME OR NOT ###*/
int isPrime(int n) {
if (n < 2)
return 0;
if (n < 4)
return 1;
if (n % 2 == 0 or n % 3 == 0)
return 0;
for (int i = 5; i * i <= n; i += 6)
if (n % i == 0 or n % (i + 2) == 0)
return 0;
return 1;
}
/*### nCr ###*/
long long C(int n, int r) {
if (r > n - r)
r = n - r;
long long ans = 1;
int i;
for (i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
}
return ans;
}
/*### MODULAR-EXPONENTIATION ###*/
ll modexpo(ll x, ll p) {
ll res = 1;
x = x % mod;
while (p) {
if (p % 2)
res = res * x;
p >>= 1;
x = x * x % mod;
res %= mod;
}
return res;
}
uint64_t mul_mod(uint64_t a, uint64_t b, uint64_t m) {
long double x;
uint64_t c;
int64_t r;
if (a >= m)
a %= m;
if (b >= m)
b %= m;
x = a;
c = x * b / m;
r = (int64_t)(a * b - c * m) % (int64_t)m;
return r < 0 ? r + m : r;
}
/*### STRING TO INT ###*/
int sti(string s) {
int ans = 0;
int p = 1;
for (int i = s.size() - 1; i >= 0; i--) {
ans = (ans + ((ll)(s[i] - '0') * p) % mod) % mod;
p = (p * 10) % mod;
}
return ans;
}
/*### TIMER ###*/
void time() {
#ifndef ONLINE_JUDGE
cout << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
#endif
}
/*************************** END OF TEMPLATE ****************************/
const int N = 1e6 + 5;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
IOS int n;
cin >> n;
vi h(n + 1);
flr(i, 1, n) { cin >> h[i]; }
vi dp(n + 1);
// dp[0]=h[0];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
flr(i, 3, n) {
dp[i] = min((dp[i - 1] + abs(h[i] - h[i - 1])),
(dp[i - 2] + abs(h[i] - h[i - 2])));
}
cout << dp[n] << endl;
// time();
stop;
} | #include <bits/stdc++.h>
using namespace std;
/*### FAST-IO ###*/
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
/*### DEBUGGGGGGG ###*/
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define testcases \
int testcases; \
cin >> testcases; \
while (testcases--)
#define queries \
int queries; \
cin >> queries; \
while (queries--)
/*### TO PRINT ###*/
#define pp1(a) cout << a << endl;
#define pp2(a, b) cout << a << " " << b << endl;
#define pp3(a, b, c) cout << a << " " << b << " " << c << endl;
#define pp4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl;
#define pp5(a, b, c, d, e) \
cout << a << " " << b << " " << c << " " << d << " " << e << endl;
/*### SSSSSSS ###*/
#define INFINTE INT_MAX
#define endl "\n"
#define ll long long
#define int long long
ll mod = 1e9 + 7;
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define msi map<string, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define ff first
#define ss second
#define sz size()
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define REP1(i, a, b) for (int i = a; i < b; i++)
#define f0(n) for (ll i = 0; i < n; i++)
#define f(n) for (ll i = 1; i <= n; i++)
#define fn(a, n) for (ll a = 0; a < n; a++)
#define flr(a, l, r) for (ll a = l; a <= r; a++)
#define sorta(a) sort(a.begin(), a.end());
#define sortd(a) sort(a.begin(), a.end(), greater<ll>());
#define sortdp(a) sort(a.begin(), a.end(), greater<pair<ll, ll>>());
#define blb(a, b) lower_bound(all(a), b) - a.begin();
#define bub(a, b) upper_bound(all(a), b) - a.begin();
#define stop return 0
/*### COMPARATOR ###*/
bool rev(int x, int y) { return x > y; }
/*### PAIR_SORT_IN_DESCENDING_ORDER ###*/
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
/*### MODULO ###*/
int modulo(int x, int N) { return (x % N + N) % N; }
/*### MAX & MIN ###*/
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
int min(int a, int b) {
if (a <= b)
return a;
else
return b;
}
/*### MOD-DIFFERENCE ###*/
ll diff(ll a, ll b) {
if (a >= b)
return a - b;
else
return b - a;
}
/*### PAIR-SORTING ###*/
void pairsort(int a[], int b[], ll n) {
pair<int, int> pairt[n];
for (int i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
sort(pairt, pairt + n);
for (int i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
/*### GCD && LCM ###*/
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
/*### PRIME OR NOT ###*/
int isPrime(int n) {
if (n < 2)
return 0;
if (n < 4)
return 1;
if (n % 2 == 0 or n % 3 == 0)
return 0;
for (int i = 5; i * i <= n; i += 6)
if (n % i == 0 or n % (i + 2) == 0)
return 0;
return 1;
}
/*### nCr ###*/
long long C(int n, int r) {
if (r > n - r)
r = n - r;
long long ans = 1;
int i;
for (i = 1; i <= r; i++) {
ans *= n - r + i;
ans /= i;
}
return ans;
}
/*### MODULAR-EXPONENTIATION ###*/
ll modexpo(ll x, ll p) {
ll res = 1;
x = x % mod;
while (p) {
if (p % 2)
res = res * x;
p >>= 1;
x = x * x % mod;
res %= mod;
}
return res;
}
uint64_t mul_mod(uint64_t a, uint64_t b, uint64_t m) {
long double x;
uint64_t c;
int64_t r;
if (a >= m)
a %= m;
if (b >= m)
b %= m;
x = a;
c = x * b / m;
r = (int64_t)(a * b - c * m) % (int64_t)m;
return r < 0 ? r + m : r;
}
/*### STRING TO INT ###*/
int sti(string s) {
int ans = 0;
int p = 1;
for (int i = s.size() - 1; i >= 0; i--) {
ans = (ans + ((ll)(s[i] - '0') * p) % mod) % mod;
p = (p * 10) % mod;
}
return ans;
}
/*### TIMER ###*/
void time() {
#ifndef ONLINE_JUDGE
cout << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
#endif
}
/*************************** END OF TEMPLATE ****************************/
const int N = 1e6 + 5;
const int INF = 1e9 + 5;
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// //freopen("output.txt", "w", stdout);
// #endif
IOS
// int n;
// cin>>n;
// vi h(n+1);
// flr(i,1,n){
// cin>>h[i];
// }
// vi dp(n+1);
// //dp[0]=h[0];
// dp[1]=0;
// dp[2]=abs(h[2]-h[1]);
// flr(i,3,n){
// dp[i]=min((dp[i-1]+abs(h[i]-h[i-1])) ,
// (dp[i-2]+abs(h[i]-h[i-2])));
// }
// cout<<dp[n]<<endl;
int n;
cin >> n;
vi h(n);
for (int &x : h) {
cin >> x;
}
vi dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1] << endl;
// time();
stop;
} | [
"identifier.change"
] | 955,635 | 955,636 | u470689998 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long int dp[1000000];
int main(void) {
long long int n;
cin >> n;
long long int a[n], i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < 1000000; i++)
dp[i] = -1;
if (n == 2) {
cout << a[0] + a[1] << endl;
return 0;
}
dp[0] = a[0];
dp[1] = abs(a[0] - a[1]);
dp[2] = abs(a[0] - a[2]);
for (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 << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int dp[1000000];
int main(void) {
long long int n;
cin >> n;
long long int a[n], i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < 1000000; i++)
dp[i] = -1;
if (n == 2) {
cout << abs(a[0] - a[1]) << endl;
return 0;
}
dp[0] = a[0];
dp[1] = abs(a[0] - a[1]);
dp[2] = abs(a[0] - a[2]);
for (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 << dp[n - 1] << endl;
return 0;
} | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"call.arguments.change"
] | 955,637 | 955,638 | u917834174 | cpp |
p03160 | #include <iostream>
#include <stdio.h>
using namespace std;
int n, h[100003], f[100003];
void DP() {
f[1] = h[1];
f[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; ++i) {
f[i] =
min(f[i - 1] + abs(h[i] - h[i - 1]), f[i - 2] + abs(h[i] - h[i - 2]));
}
printf("%d", f[n]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &h[i]);
}
DP();
return 0;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int n, h[100003], f[100003];
void DP() {
f[1] = 0;
f[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; ++i) {
f[i] =
min(f[i - 1] + abs(h[i] - h[i - 1]), f[i - 2] + abs(h[i] - h[i - 2]));
}
printf("%d", f[n]);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &h[i]);
}
DP();
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,640 | 955,641 | u177919024 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 1, 100005);
dp[0] = 0;
rep(i, N) {
if (i + 1 < N)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 < N)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 1, 1000000009);
dp[0] = 0;
rep(i, N) {
if (i + 1 < N)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 < N)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 955,644 | 955,645 | u703503553 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<ll> okay(100005, -1);
vector<ll> arr;
ll ans(ll x) {
if (okay[x - 1] != -1) {
return okay[x - 1];
}
if (x <= 3) {
return okay[x - 1];
}
if (x > 3) {
// cout
okay[x - 1] = min(abs(arr[x - 1] - arr[x - 2]) + ans(x - 1),
abs(arr[x - 1] - arr[x - 3]) + ans(x - 2));
}
// cout<<x<<" "<<okay[x-1]<<endl;
return okay[x - 1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
ll temp;
cin >> temp;
arr.pb(temp);
}
okay[1] = abs(arr[1] - arr[0]);
if (n == 2) {
cout << okay[1];
return 0;
} else {
okay[2] = min(abs(arr[2] - arr[0]), abs(arr[2] - arr[1] + okay[1]));
}
cout << ans(n);
// cout<<okay[n-1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<ll> okay(100005, -1);
vector<ll> arr;
ll ans(ll x) {
if (okay[x - 1] != -1) {
return okay[x - 1];
}
if (x <= 3) {
return okay[x - 1];
}
if (x > 3) {
// cout
okay[x - 1] = min(abs(arr[x - 1] - arr[x - 2]) + ans(x - 1),
abs(arr[x - 1] - arr[x - 3]) + ans(x - 2));
}
// cout<<x<<" "<<okay[x-1]<<endl;
return okay[x - 1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
ll temp;
cin >> temp;
arr.pb(temp);
}
okay[1] = abs(arr[1] - arr[0]);
if (n == 2) {
cout << okay[1];
return 0;
} else {
okay[2] = min(abs(arr[2] - arr[0]), abs(arr[2] - arr[1]) + okay[1]);
}
cout << ans(n);
// cout<<okay[n-1];
return 0;
}
| [
"call.arguments.change"
] | 955,660 | 955,661 | u415589348 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> dp;
dp.push_back(v[0]);
dp.push_back(abs(v[0] - v[1]));
for (int i = 2; i < n; i++) {
dp.push_back(min(abs(v[i] - v[i - 2]) + dp[i - 2],
abs(v[i] - v[i - 1]) + dp[i - 1]));
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> dp;
dp.push_back(0);
dp.push_back(abs(v[0] - v[1]));
for (int i = 2; i < n; i++) {
dp.push_back(min(abs(v[i] - v[i - 2]) + dp[i - 2],
abs(v[i] - v[i - 1]) + dp[i - 1]));
}
cout << dp[n - 1];
} | [
"call.arguments.change"
] | 955,663 | 955,664 | u552345139 | cpp |
p03160 | //// SHAKALAKA BOOM BOOM ////
#include <bits/stdc++.h>
#define ll long long
#define vi vector<ll>
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define hell 1000000007
#define endl '\n'
#define fl(z, a, b) for (ll z = a; z < b; z++)
#define ifl(i, a, b) for (ll i = a; i <= b; i++)
#define dfl(i, a, b) for (ll i = a; i >= b; i--)
#define speed ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define debug1(x) \
cerr << "at line " << __LINE__ << ": " << #x << " = " << (x) << endl
#define debug2(x) cerr << #x << " = " << (x) << endl
using namespace std;
//=====================
// const int N=1e6;
void solve() {
ll n;
cin >> n;
vi arr(n + 1);
ifl(i, 1, n) { cin >> arr[i]; }
vi dp(n + 1);
dp[1] = 0;
ifl(i, 2, n) {
ll ans = dp[i - 1] + abs(arr[i] - arr[i - 1]);
if (i - 2 >= 0)
ans = min(ans, dp[i - 2] + abs(arr[i] - arr[i - 2]));
dp[i] = ans;
}
cout << dp[n] << endl;
}
int main() {
ll TESTS = 1;
speed;
// cin>>TESTS;
while (TESTS--)
solve();
return 0;
}
| //// SHAKALAKA BOOM BOOM ////
#include <bits/stdc++.h>
#define ll long long
#define vi vector<ll>
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define hell 1000000007
#define endl '\n'
#define fl(z, a, b) for (ll z = a; z < b; z++)
#define ifl(i, a, b) for (ll i = a; i <= b; i++)
#define dfl(i, a, b) for (ll i = a; i >= b; i--)
#define speed ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define debug1(x) \
cerr << "at line " << __LINE__ << ": " << #x << " = " << (x) << endl
#define debug2(x) cerr << #x << " = " << (x) << endl
using namespace std;
//=====================
// const int N=1e6;
void solve() {
ll n;
cin >> n;
vi arr(n + 1);
ifl(i, 1, n) { cin >> arr[i]; }
vi dp(n + 1);
dp[1] = 0;
ifl(i, 2, n) {
ll ans = dp[i - 1] + abs(arr[i] - arr[i - 1]);
if (i - 2 >= 1)
ans = min(ans, dp[i - 2] + abs(arr[i] - arr[i - 2]));
dp[i] = ans;
}
cout << dp[n] << endl;
}
int main() {
ll TESTS = 1;
speed;
// cin>>TESTS;
while (TESTS--)
solve();
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 955,667 | 955,668 | u367501439 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define mod 1000000007
//#define max 100007
#define itr ::iterator it
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define repp(X, a, Y) for (int(X) = a; (X) < (Y); ++(X))
#define set(a, b) memset(a, b, sizeof(a));
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vd> vvd;
typedef vector<pii> vii;
typedef vector<string> vs;
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int j = 2; j < n; j++)
dp[j] =
min(dp[j - 1] + abs(a[j] - a[j - 1]), dp[j - 2] + abs(a[j] - a[j - 2]));
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define mod 1000000007
//#define max 100007
#define itr ::iterator it
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define rep(X, Y) for (int(X) = 0; (X) < (Y); ++(X))
#define repp(X, a, Y) for (int(X) = a; (X) < (Y); ++(X))
#define set(a, b) memset(a, b, sizeof(a));
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vd> vvd;
typedef vector<pii> vii;
typedef vector<string> vs;
#define endl '\n'
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int j = 2; j < n; j++)
dp[j] =
min(dp[j - 1] + abs(a[j] - a[j - 1]), dp[j - 2] + abs(a[j] - a[j - 2]));
cout << dp[n - 1] << endl;
return 0;
}
| [] | 955,669 | 955,670 | u925215421 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h[i]; // h[i]は足場i+1の高さ。
vector<int> dp(N);
// vector dp[i]には、足場i+1まで到達した場合の最小コストを記入する。
rep(i, N) {
if (i == 0)
dp[0] = 0; //足場1にいるとき(i=0)、コストは0
else if (i == 1)
dp[1] = abs(h[1] - h[0]); //足場2にいるとき、足場1からくることだけを考える
else
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]),
dp[i - 1] +
abs(h[i] - h[i - 1])); //足場3以上の時は両方計算して小さいほう
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i]; // h[i]は足場i+1の高さ。
vector<int> dp(N);
// vector dp[i]には、足場i+1まで到達した場合の最小コストを記入する。
rep(i, N) {
if (i == 0)
dp[0] = 0; //足場1にいるとき(i=0)、コストは0
else if (i == 1)
dp[1] = abs(h[1] - h[0]); //足場2にいるとき、足場1からくることだけを考える
else
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]),
dp[i - 1] +
abs(h[i] - h[i - 1])); //足場3以上の時は両方計算して小さいほう
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 955,671 | 955,672 | u319179101 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++)
cin >> h[i];
vector<long long> sol(n + 1, -1);
sol[0] = 0;
sol[1] = 0;
for (int i = 2; i < n + 1; i++) {
sol[i] = min(abs(h[i] - h[i - 1]) + sol[i - 1],
abs(h[i] - h[i - 2]) + sol[i - 2]);
}
cout << sol[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++)
cin >> h[i];
vector<long long> sol(n + 1, -1);
sol[0] = INT_MAX;
sol[1] = 0;
for (int i = 2; i < n + 1; i++) {
sol[i] = min(abs(h[i] - h[i - 1]) + sol[i - 1],
abs(h[i] - h[i - 2]) + sol[i - 2]);
}
cout << sol[n] << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 955,675 | 955,676 | u941949497 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> dp(n, 1000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
if (i < n - 2)
dp.at(i + 2) = min(dp.at(i + 2), dp.at(i) + abs(a.at(i) - a.at(i + 2)));
}
cout << dp.at(n - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long> dp(n, 10000000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
if (i < n - 2)
dp.at(i + 2) = min(dp.at(i + 2), dp.at(i) + abs(a.at(i) - a.at(i + 2)));
}
cout << dp.at(n - 1) << endl;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 955,677 | 955,678 | u288432959 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> dp(n, 1000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
if (i < n - 2)
dp.at(i + 2) = min(dp.at(i + 2), dp.at(i) + abs(a.at(i) - a.at(i + 2)));
}
cout << dp.at(n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long> dp(n, 10000000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
if (i < n - 2)
dp.at(i + 2) = min(dp.at(i + 2), dp.at(i) + abs(a.at(i) - a.at(i + 2)));
}
cout << dp.at(n - 1) << endl;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 955,679 | 955,678 | u288432959 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> dp(n, 1000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
if (i < n - 2)
dp.at(i + 2) = min(dp.at(i + 2), dp.at(i) + abs(a.at(i) - a.at(i + 2)));
}
cout << dp.at(n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long> dp(n, 10000000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
if (i < n - 2)
dp.at(i + 2) = min(dp.at(i + 2), dp.at(i) + abs(a.at(i) - a.at(i + 2)));
}
cout << dp.at(n - 1) << endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 955,679 | 955,680 | u288432959 | cpp |
p03160 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 100005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int h[SIZE];
REP(i, n) { cin >> h[i]; }
int ans[SIZE];
fill(ans + 1, ans + n, SIZE);
ans[0] = 0;
REP(i, n - 1) {
ans[i + 1] = min(abs(h[i] - h[i + 1]) + ans[i], ans[i + 1]);
// REP(j,n)cout << ans[j] << " ";
// cout << endl;
ans[i + 2] = min(abs(h[i] - h[i + 2]) + ans[i], ans[i + 2]);
// REP(j,n)cout << ans[j] << " ";
// cout << endl;
}
cout << ans[n - 1] << endl;
return 0;
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 100005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int h[SIZE];
REP(i, n) { cin >> h[i]; }
ll ans[SIZE];
fill(ans + 1, ans + n, INF);
ans[0] = 0;
REP(i, n - 1) {
ans[i + 1] = min(abs(h[i] - h[i + 1]) + ans[i], ans[i + 1]);
// REP(j,n)cout << ans[j] << " ";
// cout << endl;
ans[i + 2] = min(abs(h[i] - h[i + 2]) + ans[i], ans[i + 2]);
// REP(j,n)cout << ans[j] << " ";
// cout << endl;
}
cout << ans[n - 1] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change"
] | 955,681 | 955,683 | u288432959 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define pb push_back
#define fe first
#define se second
#define endl "\n"
#define pii pair<int, int>
const int N = 1e5;
int a[N], mini = 0, n;
int dp[N];
int main() {
cool;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[1] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define pb push_back
#define fe first
#define se second
#define endl "\n"
#define pii pair<int, int>
const int N = 1e5 + 5;
int a[N], mini = 0, n;
int dp[N];
int main() {
cool;
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 - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 955,685 | 955,687 | u581946498 | cpp |
p03160 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
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[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + (arr[i] - arr[i - 1]),
dp[i - 2] + (arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
} | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
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[0] = 0;
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] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
} | [
"call.add",
"call.arguments.change"
] | 955,689 | 955,691 | u354308480 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.begin(), arr.end()
using namespace std;
const lli mod = 1e9 + 7;
const lli mod_ = 998244353;
const int INF = 1000000000;
const lli INF64 = (lli)1E18;
lli n;
lli heights[100005];
lli dp[100005];
int main() {
// ifstream cin("input.in");
// ofstream cout("output.out");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (lli i = 0; i < n; i++)
cin >> heights[i];
dp[1] = abs(heights[1] - heights[0]);
for (lli i = 1; i < n; i++)
dp[i] = min(dp[i - 1] + abs(heights[i] - heights[i - 1]),
dp[i - 2] + abs(heights[i] - heights[i - 2]));
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.begin(), arr.end()
using namespace std;
const lli mod = 1e9 + 7;
const lli mod_ = 998244353;
const int INF = 1000000000;
const lli INF64 = (lli)1E18;
int n;
int heights[100005];
lli dp[100005];
int main() {
// ifstream cin("input.in");
// ofstream cout("output.out");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[1] = abs(heights[1] - heights[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(heights[i] - heights[i - 1]),
dp[i - 2] + abs(heights[i] - heights[i - 2]));
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 955,705 | 955,706 | u215714483 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.begin(), arr.end()
using namespace std;
const lli mod = 1e9 + 7;
const lli mod_ = 998244353;
const int INF = 1000000000;
const lli INF64 = (lli)1E18;
int n;
int heights[100005];
lli dp[100005];
int main() {
// ifstream cin("input.in");
// ofstream cout("output.out");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[1] = abs(heights[1] - heights[0]);
for (int i = 1; i < n; i++)
dp[i] = min(dp[i - 1] + abs(heights[i] - heights[i - 1]),
dp[i - 2] + abs(heights[i] - heights[i - 2]));
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.begin(), arr.end()
using namespace std;
const lli mod = 1e9 + 7;
const lli mod_ = 998244353;
const int INF = 1000000000;
const lli INF64 = (lli)1E18;
int n;
int heights[100005];
lli dp[100005];
int main() {
// ifstream cin("input.in");
// ofstream cout("output.out");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[1] = abs(heights[1] - heights[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(heights[i] - heights[i - 1]),
dp[i - 2] + abs(heights[i] - heights[i - 2]));
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.newline.add"
] | 955,707 | 955,706 | u215714483 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.begin(), arr.end()
using namespace std;
const lli mod = 1e9 + 7;
const lli mod_ = 998244353;
const int INF = 1000000000;
const lli INF64 = (lli)1E18;
int n;
int heights[100005];
int dp[100005];
int main() {
// ifstream cin("input.in");
// ofstream cout("output.out");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[1] = abs(heights[1] - heights[0]);
for (int i = 1; i < n; i++)
dp[i] = min(dp[i - 1] + abs(heights[i] - heights[i - 1]),
dp[i - 2] + abs(heights[i] - heights[i - 2]));
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.begin(), arr.end()
using namespace std;
const lli mod = 1e9 + 7;
const lli mod_ = 998244353;
const int INF = 1000000000;
const lli INF64 = (lli)1E18;
int n;
int heights[100005];
lli dp[100005];
int main() {
// ifstream cin("input.in");
// ofstream cout("output.out");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[1] = abs(heights[1] - heights[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(heights[i] - heights[i - 1]),
dp[i - 2] + abs(heights[i] - heights[i - 2]));
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.newline.add"
] | 955,709 | 955,706 | u215714483 | cpp |
p03160 | #include <bits/stdc++.h>
#define fr first
#define sc second
#define memset(X, Y) memset(X, Y, sizeof X)
#define all(X) X.begin(), X.end()
#define sz size()
#define pb push_back
#define ve vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define Graph vector<vector<int>>
#define Fp cout << fixed << setprecision(9)
#define Fast \
ios::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
const ll M = 1e3 + 30, N = 110, MOD = 1e9 + 7, OO = 1e7;
ll m, n, k, x, y, dp[N], bla, c = 1, cnt, ans, sum, a[N], ok = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n; i++)
dp[i] = OO;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n];
return 0;
}
/*
6 15= max
6 5
5 6
6 4
6 6
3 5
7 2
*/
| #include <bits/stdc++.h>
#define fr first
#define sc second
#define memset(X, Y) memset(X, Y, sizeof X)
#define all(X) X.begin(), X.end()
#define sz size()
#define pb push_back
#define ve vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define Graph vector<vector<int>>
#define Fp cout << fixed << setprecision(9)
#define Fast \
ios::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
const ll M = 1e3 + 30, N = 1e5 + 30, MOD = 1e9 + 7, OO = 1e7;
ll m, n, k, x, y, dp[N], bla, c = 1, cnt, ans, sum, a[N], ok = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n; i++)
dp[i] = OO;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n];
return 0;
}
/*
6 15= max
6 5
5 6
6 4
6 6
3 5
7 2
*/
| [
"literal.number.change"
] | 955,726 | 955,728 | u305865627 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1);
dp[2] = abs(dp[2] - dp[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n];
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1);
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] + abs(arr[i] - arr[i - 2]));
cout << dp[n];
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,735 | 955,736 | u241738997 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
ll a[N];
ll dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
rep(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
ll a[N];
ll dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
rep(i, 3, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 955,740 | 955,741 | u095029955 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
int a[N];
int dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
rep(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
ll a[N];
ll dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int n;
cin >> n;
rep(i, 1, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
rep(i, 3, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change"
] | 955,742 | 955,741 | u095029955 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 60;
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() {
int n;
cin >> n;
vector<int> vec(n);
vector<double> dp(n);
rep(i, n) cin >> vec[i];
rep(i, n) dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(vec[i] - vec[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(vec[i] - vec[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 60;
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() {
int n;
cin >> n;
vector<ll> vec(n);
vector<ll> dp(n);
rep(i, n) cin >> vec[i];
rep(i, n) dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(vec[i] - vec[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(vec[i] - vec[i - 2]));
}
cout << dp[n - 1] << endl;
} | [] | 955,744 | 955,745 | u845851868 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int v[n];
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
vector<int> dp(n, INF);
dp[0] = 0;
if (n > 1)
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(v[i - 1] + abs(v[i] - dp[i - 1]), v[i - 2] + abs(v[i] - dp[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int v[n];
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
vector<int> dp(n, INF);
dp[0] = 0;
if (n > 1)
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,757 | 955,763 | u790968697 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) FOR(i, 0, n)
ll fast_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = fast_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) { cin >> a[i]; }
ll memo[N + 1];
memo[0] = 0;
memo[1] = a[1] - a[0];
FOR(i, 2, N) {
memo[i] =
min(memo[i - 2] + abs(a[i] - a[i - 2]), memo[i] + abs(a[i] - a[i - 1]));
}
cout << memo[N - 1] << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
#define FOR(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) FOR(i, 0, n)
ll fast_pow(ll x, ll n, ll mod) {
if (n == 0)
return 1;
ll res = fast_pow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "{";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", " : "") << v[i];
o << "}";
return o;
}
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//小さい順から取り出すヒープ
// priority_queue<ll, vector<ll>, greater<ll> > pque1;
int main() {
int N;
cin >> N;
int a[N];
rep(i, N) { cin >> a[i]; }
ll memo[N + 1];
memo[0] = 0;
memo[1] = abs(a[1] - a[0]);
FOR(i, 2, N) {
memo[i] = min(memo[i - 2] + abs(a[i] - a[i - 2]),
memo[i - 1] + abs(a[i] - a[i - 1]));
}
cout << memo[N - 1] << endl;
}
| [
"call.add",
"call.arguments.change",
"assignment.change"
] | 955,765 | 955,767 | u652150585 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 4;
int dp[maxn], h[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1e9;
}
dp[1] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
// for(int i=0; i<n-1; i++) {
// cout<<dp[i]<<endl;
// }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 4;
int dp[maxn], h[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1e9;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
// for(int i=0; i<n; i++) {
// cout<<dp[i]<<" ";
// }
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 955,769 | 955,770 | u410677737 | 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] = 0;
dp[1] = a[1] - a[0];
for (int i = 2; 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 << dp[n - 1] << endl;
return 0;
} | #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 - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 955,771 | 955,773 | u631895856 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define INF 1e18
ll modInverse(ll a, ll m);
ll gcd(ll a, ll b);
ll power(ll x, unsigned ll y, unsigned ll m);
ll logint(ll x, ll y);
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll power(ll x, unsigned ll y, unsigned ll m) {
if (y == 0)
return 1;
ll p = power(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
ll modInverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
ll q = a / m;
ll t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
void pairsort(ll a[], ll b[], ll n) {
pair<ll, ll> pairt[n];
// Storing the respective array
// elements in pairs.
for (ll i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
// Sorting the pair array.
sort(pairt, pairt + n);
// Modifying original arrays
for (ll i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
ll logint(ll x, ll y) {
ll ans = 0;
ll a = 1;
for (ll i = 0; i < x; i++) {
if (x <= a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
/*
ll v[500001], size[500001];
vector<ll>ve(0);
ll fin(ll x){
//using path compression optimization
if(x == v[x]){
return x;
}
return v[x] = fin(v[x]);
}
void uni(ll x, ll y){
x = fin(x);
y = fin(y);
if(x == y){
return ;
}
//Using Union by size method, to reduce long chains
if(size[x] < size[y]){
size[x]+= size[y];
v[y] = x;}
else{
size[y]+=size[x];
v[x]=y;
}
}
*/
ll dp[200005][2];
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
/*
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
*/
ll a;
cin >> a;
ll dp[a];
memset(dp, 0, sizeof(dp));
ll ar[a];
REP(i, 0, a) { cin >> ar[i]; }
dp[1] = ar[1] - ar[0];
REP(i, 2, a) {
dp[i] = min(dp[i - 1] + abs(ar[i] - ar[i - 1]),
dp[i - 2] + abs(ar[i] - ar[i - 2]));
}
cout << dp[a - 1];
} | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define INF 1e18
ll modInverse(ll a, ll m);
ll gcd(ll a, ll b);
ll power(ll x, unsigned ll y, unsigned ll m);
ll logint(ll x, ll y);
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll power(ll x, unsigned ll y, unsigned ll m) {
if (y == 0)
return 1;
ll p = power(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
ll modInverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
ll q = a / m;
ll t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
void pairsort(ll a[], ll b[], ll n) {
pair<ll, ll> pairt[n];
// Storing the respective array
// elements in pairs.
for (ll i = 0; i < n; i++) {
pairt[i].first = a[i];
pairt[i].second = b[i];
}
// Sorting the pair array.
sort(pairt, pairt + n);
// Modifying original arrays
for (ll i = 0; i < n; i++) {
a[i] = pairt[i].first;
b[i] = pairt[i].second;
}
}
ll logint(ll x, ll y) {
ll ans = 0;
ll a = 1;
for (ll i = 0; i < x; i++) {
if (x <= a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
/*
ll v[500001], size[500001];
vector<ll>ve(0);
ll fin(ll x){
//using path compression optimization
if(x == v[x]){
return x;
}
return v[x] = fin(v[x]);
}
void uni(ll x, ll y){
x = fin(x);
y = fin(y);
if(x == y){
return ;
}
//Using Union by size method, to reduce long chains
if(size[x] < size[y]){
size[x]+= size[y];
v[y] = x;}
else{
size[y]+=size[x];
v[x]=y;
}
}
*/
ll dp[200005][2];
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
// cout.tie(0);
/*
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
*/
ll a;
cin >> a;
ll dp[a];
memset(dp, 0, sizeof(dp));
ll ar[a];
REP(i, 0, a) { cin >> ar[i]; }
dp[1] = abs(ar[1] - ar[0]);
REP(i, 2, a) {
dp[i] = min(dp[i - 1] + abs(ar[i] - ar[i - 1]),
dp[i - 2] + abs(ar[i] - ar[i - 2]));
}
cout << dp[a - 1];
} | [
"call.add",
"call.arguments.change"
] | 955,790 | 955,794 | u065898443 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define X first
#define Y second
const int MAXN = 1e5 + 5;
int n, dp[MAXN], arr[MAXN];
int main() {
cin >> n;
for (int 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(abs(arr[i] - arr[i - 1]) + dp[i - 1],
abs(arr[i] - arr[i - 2]) + dp[i - 2]);
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define X first
#define Y second
const int MAXN = 1e5 + 5;
int n, dp[MAXN], arr[MAXN];
int main() {
cin >> n;
for (int 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(abs(arr[i] - arr[i - 1]) + dp[i - 1],
abs(arr[i] - arr[i - 2]) + dp[i - 2]);
}
cout << dp[n] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,799 | 955,801 | u328001833 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll n, k = 3;
ll h[100000], memo[100000];
ll dp(ll i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
ll ret = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j < n)
ret = min(ret, dp(i + j) + abs(h[i] - h[i + j]));
}
memo[i] = ret;
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(memo, -1, sizeof(memo));
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp(0);
cout << memo[0] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll n, k = 2;
ll h[100000], memo[100000];
ll dp(ll i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
ll ret = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j < n)
ret = min(ret, dp(i + j) + abs(h[i] - h[i + j]));
}
memo[i] = ret;
return ret;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(memo, -1, sizeof(memo));
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp(0);
cout << memo[0] << "\n";
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 955,803 | 955,805 | u603496599 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define push_back pb
int main() {
int n;
cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] = min(v[i - 1] + abs(dp[i] - dp[i - 1]),
v[i - 2] + abs(dp[i] - dp[i - 2]));
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define push_back pb
int main() {
int n;
cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
cout << dp[n - 1];
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,807 | 955,812 | u524189874 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define mt make_tuple
#define popb pop_back()
#define popf pop_front()
#define ff first
#define ss second
#define vl vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define viii vector<tuple<int, int, int>>
#define vlll vector<tuple<ll, ll, ll>>
#define vvl vector<vector<ll>>
#define vv vector<vector<int>>
#define all(v) v.begin(), v.end()
#define sqrt sqrtl
#define cbrt cbrtl
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mapcl map<char, ll>
#define mapci map<char, int>
#define mapll map<ll, ll>
#define mapii map<int, int>
#define seti set<int>
ifstream fin("input.txt");
ofstream fout("output.txt");
ll pows(int a, int b) {
ll res = 1;
for (int i = 0; i < b; ++i) {
res *= a;
}
return res;
}
vi vis(100001, 0);
vi dp(100001, -1);
vi price;
int dpx(int n) {
if (n == 1)
return dp[1];
if (n == 2)
return dp[2];
if (dp[n] == -1) {
if (dp[n - 1] == -1)
dp[n - 1] = dpx(n - 1);
if (dp[n - 2] == -1)
dp[n - 2] = dpx(n - 2);
dp[n] = min((dp[n - 1] + abs(price[n] - price[n - 1])),
(dp[n - 2] + abs(price[n] - price[n - 2])));
return dp[n];
} else
return dp[n];
}
int main() {
std::ios::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
int n;
cin >> n;
price.pb(0);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
price.pb(x);
}
dp[1] = 0;
dp[2] = abs(price[1] - price[2]);
dpx(n + 1);
cout << dp[n + 1] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define mt make_tuple
#define popb pop_back()
#define popf pop_front()
#define ff first
#define ss second
#define vl vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define viii vector<tuple<int, int, int>>
#define vlll vector<tuple<ll, ll, ll>>
#define vvl vector<vector<ll>>
#define vv vector<vector<int>>
#define all(v) v.begin(), v.end()
#define sqrt sqrtl
#define cbrt cbrtl
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mapcl map<char, ll>
#define mapci map<char, int>
#define mapll map<ll, ll>
#define mapii map<int, int>
#define seti set<int>
ifstream fin("input.txt");
ofstream fout("output.txt");
ll pows(int a, int b) {
ll res = 1;
for (int i = 0; i < b; ++i) {
res *= a;
}
return res;
}
vi vis(100001, 0);
vi dp(100001, -1);
vi price;
int dpx(int n) {
if (n == 1)
return dp[1];
if (n == 2)
return dp[2];
if (dp[n] == -1) {
if (dp[n - 1] == -1)
dp[n - 1] = dpx(n - 1);
if (dp[n - 2] == -1)
dp[n - 2] = dpx(n - 2);
dp[n] = min((dp[n - 1] + abs(price[n] - price[n - 1])),
(dp[n - 2] + abs(price[n] - price[n - 2])));
return dp[n];
} else
return dp[n];
}
int main() {
std::ios::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
int n;
cin >> n;
price.pb(0);
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
price.pb(x);
}
dp[1] = 0;
dp[2] = abs(price[1] - price[2]);
dpx(n);
cout << dp[n] << "\n";
} | [
"expression.operation.binary.remove"
] | 955,814 | 955,816 | u186089447 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(N), h(N);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1) - h.at(i)));
if (i > 1) {
chmin(res, rec(i - 2) + abs(h.at(i - 2) - h.at(i)));
}
return dp.at(i) = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
dp.at(i) = INF;
}
cout << rec(N - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
vector<int> dp(100010), h(100010);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1) - h.at(i)));
if (i > 1) {
chmin(res, rec(i - 2) + abs(h.at(i - 2) - h.at(i)));
}
return dp.at(i) = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
dp.at(i) = INF;
}
cout << rec(N - 1) << endl;
} | [
"variable_declaration.remove"
] | 955,820 | 955,822 | u230804605 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(N), h(N);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1) - h.at(i)));
if (i > 1) {
chmin(res, rec(i - 2) + abs(h.at(i - 2) - h.at(i)));
}
return dp.at(i) = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
dp.at(i) = INF;
}
cout << rec(N - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(100010), h(100010);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1) - h.at(i)));
if (i > 1) {
chmin(res, rec(i - 2) + abs(h.at(i - 2) - h.at(i)));
}
return dp.at(i) = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
dp.at(i) = INF;
}
cout << rec(N - 1) << endl;
} | [] | 955,820 | 955,824 | u230804605 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 5000000;
ll way1 = 0, way2 = 0;
ll dp[100000];
ll ans, n;
int main() {
ll in[100000], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> in[i];
}
dp[0] = 0;
dp[1] = in[1] - in[0];
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(in[i] - in[i - 1]),
dp[i - 2] + abs(in[i] - in[i - 2]));
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 5000000;
ll way1 = 0, way2 = 0;
ll dp[100000];
ll ans, n;
int main() {
ll in[100000], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> in[i];
}
dp[0] = 0;
dp[1] = abs(in[1] - in[0]);
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(in[i] - in[i - 1]),
dp[i - 2] + abs(in[i] - in[i - 2]));
}
cout << dp[n - 1];
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 955,837 | 955,840 | u993656019 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 2]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; 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 << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,846 | 955,848 | u888060901 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 2]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; 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 << dp[n - 1] << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,850 | 955,848 | u888060901 | cpp |
p03160 | #include <iostream>
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[0] - a[1]);
for (int i = 1; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <iostream>
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[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,855 | 955,857 | u869295474 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
{ cerr << #x << ": " << x << endl; }
#define dbg2(x, y) \
{ cerr << #x << ": " << x << " , " << #y << ": " << y << endl; }
#define dbg3(x, y, z) \
{ \
cerr << #x << ": " << x << " , " << #y << ": " << y << " , " << #z << ": " \
<< z << endl; \
}
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define mpi map<pair<ll, ll>, ll>
#define pii pair<ll, ll>
#define ppb pop_back
#define F first
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pqi priority_queue<ll>
#define si set<ll>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define hell 1000000007
#define bs binary_search
#define mp make_pair
#define qi queue<ll>
#define qs queue<string>
#define qpi queue<pair<ll, ll>>
#define qps queue<pair<ll, string>>
#define endl '\n'
#define itr(a, it) \
for (typeof(a.begin()) it = a.begin(); it != a.end(); \
it++) // This will produce const_iterator for const object and normal
// iterator for non-const object
#define ss set<string>
using namespace std;
#define N 300005
ll dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n;
cin >> n;
ll a[n];
rep(i, 0, n) cin >> a[i];
dp[1] = a[1] - a[0];
rep(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
{ cerr << #x << ": " << x << endl; }
#define dbg2(x, y) \
{ cerr << #x << ": " << x << " , " << #y << ": " << y << endl; }
#define dbg3(x, y, z) \
{ \
cerr << #x << ": " << x << " , " << #y << ": " << y << " , " << #z << ": " \
<< z << endl; \
}
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define mpi map<pair<ll, ll>, ll>
#define pii pair<ll, ll>
#define ppb pop_back
#define F first
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pqi priority_queue<ll>
#define si set<ll>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define hell 1000000007
#define bs binary_search
#define mp make_pair
#define qi queue<ll>
#define qs queue<string>
#define qpi queue<pair<ll, ll>>
#define qps queue<pair<ll, string>>
#define endl '\n'
#define itr(a, it) \
for (typeof(a.begin()) it = a.begin(); it != a.end(); \
it++) // This will produce const_iterator for const object and normal
// iterator for non-const object
#define ss set<string>
using namespace std;
#define N 300005
ll dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n;
cin >> n;
ll a[n];
rep(i, 0, n) cin >> a[i];
// cout<<dp[0]<<endl;
dp[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 955,859 | 955,862 | u645123130 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 10);
dp[1] = abs(h[1] - h[0]);
rep(i, N - 2) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 1] - h[i]));
}
cout << dp[N - 1] << endl;
}
| #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 10);
dp[1] = abs(h[1] - h[0]);
rep(i, N - 2) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 2] - h[i + 1]));
}
cout << dp[N - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 955,865 | 955,867 | u314008046 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 10);
dp[1] = abs(h[1] - h[0]);
rep(i, N) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 1] - h[i]));
}
cout << dp[N - 1] << endl;
}
| #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
#define LINF (long long)4e18
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 10);
dp[1] = abs(h[1] - h[0]);
rep(i, N - 2) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 2] - h[i + 1]));
}
cout << dp[N - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 955,870 | 955,867 | u314008046 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define FOR(I, A, B) for (int I = A; I < B; I++)
#define RFOR(I, A, B) for (int I = A; I >= B; I--)
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<iii> viii;
typedef vector<ll> vll;
int h[100005];
int PD[100005];
int pd(int i) {
if (i == 0) {
return 0;
}
int &ans = PD[i];
if (ans != -1) {
return ans;
}
ans = INF;
if (i - 2 > 0) {
ans = min(ans, abs(h[i] - h[i - 2]) + pd(i - 2));
}
ans = min(ans, abs(h[i] - h[i - 1]) + pd(i - 1));
return ans;
}
int main() {
int n;
scanf("%d", &n);
FOR(i, 0, n) { scanf("%d", h + i); }
memset(PD, -1, sizeof PD);
printf("%d\n", pd(n - 1));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define FOR(I, A, B) for (int I = A; I < B; I++)
#define RFOR(I, A, B) for (int I = A; I >= B; I--)
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<iii> viii;
typedef vector<ll> vll;
int h[100005];
int PD[100005];
int pd(int i) {
if (i == 0) {
return 0;
}
int &ans = PD[i];
if (ans != -1) {
return ans;
}
ans = INF;
if (i - 2 >= 0) {
ans = min(ans, abs(h[i] - h[i - 2]) + pd(i - 2));
}
ans = min(ans, abs(h[i] - h[i - 1]) + pd(i - 1));
return ans;
}
int main() {
int n;
scanf("%d", &n);
FOR(i, 0, n) { scanf("%d", h + i); }
memset(PD, -1, sizeof PD);
printf("%d\n", pd(n - 1));
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 955,872 | 955,874 | u333900388 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i - 1 >= 0)
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
if (i - 2 >= 0)
dp[i] = min(dp[i], abs(h[i] - h[i - 2])) + dp[i - 2];
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i - 1 >= 0)
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
if (i - 2 >= 0)
dp[i] = min(dp[i], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1] << endl;
} | [
"call.arguments.change"
] | 955,876 | 955,877 | u345356200 | cpp |
p03160 | /* Problem Description:
A - Frog 1
*/
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define RREP(i, a, b) for (int i = (a); i > (b); i--)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define TRvi(it, c) for (vi::iterator it = (c).begin(); it != (c).end(); it++)
#define EPS 1e-10
#define PI acos(-1.0)
#define scan(x) scanf("%d", x)
#define ll long long
#define mp make_pair
#define pb push_back
#define sqr(x) ((x) * (x))
#define LSOne(x) x &(-x)
#define debug(x) cout << #x << " " << x << endl;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int inf = 1e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// freopen("in" , "r" , stdin);
// freopen("out" , "w" , stdout);
#endif
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n + 2];
for (int i = 0; i < n; i++) {
dp[i] = inf;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| /* Problem Description:
A - Frog 1
*/
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define RREP(i, a, b) for (int i = (a); i > (b); i--)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define TRvi(it, c) for (vi::iterator it = (c).begin(); it != (c).end(); it++)
#define EPS 1e-10
#define PI acos(-1.0)
#define scan(x) scanf("%d", x)
#define ll long long
#define mp make_pair
#define pb push_back
#define sqr(x) ((x) * (x))
#define LSOne(x) x &(-x)
#define debug(x) cout << #x << " " << x << endl;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int inf = 1e9 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// freopen("in" , "r" , stdin);
// freopen("out" , "w" , stdout);
#endif
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = inf;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 955,882 | 955,883 | u257470355 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<long long> h;
vector<long long> memo;
long long ans;
long long n;
long long DP(long long v) {
if (v == n - 1) {
return abs(h[v] - h[v - 1]);
}
if (v == n)
return 0;
if (memo[v] != -1)
return memo[v];
long long a1 = abs(h[v + 1] - h[v]);
long long a2 = abs(h[v + 2] - h[v]);
ans = min(a1 + DP(v + 1), a2 + DP(v + 2));
memo[v] = ans;
return ans;
}
int main() {
cin >> n;
h.resize(n + 1);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
memo.assign(n + 1, -1);
cout << DP(1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> h;
vector<long long> memo;
long long ans;
long long n;
long long DP(long long v) {
if (v == n - 1) {
return abs(h[v] - h[v + 1]);
}
if (v == n)
return 0;
if (memo[v] != -1)
return memo[v];
long long a1 = abs(h[v + 1] - h[v]);
long long a2 = abs(h[v + 2] - h[v]);
ans = min(a1 + DP(v + 1), a2 + DP(v + 2));
memo[v] = ans;
return ans;
}
int main() {
cin >> n;
h.resize(n + 1);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
memo.assign(n + 1, -1);
cout << DP(1) << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 955,884 | 955,885 | u085897824 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
// long long dp[100001]={0};
long long val = 0;
long long arr[100001];
for (i = 0; i < n; i++)
cin >> arr[i];
/*dp[0]=0;
dp[1]=abs(arr[1]-arr[0]);*/
int temp1 = 0;
int temp2 = abs(arr[1] - arr[0]);
for (i = 2; i < n; i++) {
val =
min(abs(arr[i] - arr[i - 1]) + temp2, abs(arr[i] - arr[i - 2]) + temp1);
temp1 = temp2;
temp2 = val;
}
cout << val << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
// long long dp[100001]={0};
long long val = 0;
long long arr[100001];
for (i = 0; i < n; i++)
cin >> arr[i];
/*dp[0]=0;
dp[1]=abs(arr[1]-arr[0]);*/
int temp1 = 0;
int temp2 = abs(arr[1] - arr[0]);
val = temp2;
for (i = 2; i < n; i++) {
val =
min(abs(arr[i] - arr[i - 1]) + temp2, abs(arr[i] - arr[i - 2]) + temp1);
temp1 = temp2;
temp2 = val;
}
cout << val << " ";
return 0;
} | [
"assignment.add"
] | 955,907 | 955,908 | u953182071 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int dp[100001] = {-1};
int a[100001];
int n;
int f(int p) {
if (p == n - 1)
return 0;
if (dp[p] != 0)
return dp[p];
dp[p] = abs(a[p] - a[p + 1]) + f(p + 1);
if (p + 2 < n)
dp[p] = min(dp[p], abs(a[p] - a[p + 2]) + f(p + 2));
return dp[p];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
dp[i] = -1;
cout << f(0) << '\n';
} | #include <cmath>
#include <iostream>
using namespace std;
int dp[100001] = {-1};
int a[100001];
int n;
int f(int p) {
if (p == n - 1)
return 0;
if (dp[p] != -1)
return dp[p];
dp[p] = abs(a[p] - a[p + 1]) + f(p + 1);
if (p + 2 < n)
dp[p] = min(dp[p], abs(a[p] - a[p + 2]) + f(p + 2));
return dp[p];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
dp[i] = -1;
cout << f(0) << '\n';
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 955,913 | 955,914 | u080344444 | cpp |
p03160 | #include "bits/stdc++.h"
// vector
#define MAX_ELE(vec) *max_element(vec.begin(), vec.end())
#define SORT(vec) sort(vec.begin(), vec.end());
// ---------------------------------------
// string
#define TO_UP(str) transform(str.cbegin(), str.cend(), str.begin(), ::toupper)
// ---------------------------------------
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() {
cin.tie(0);
ios::sync_with_stdio(false);
// --------------------------------------
int N;
int h[100000];
long long dp[100000];
cin >> N;
for (int i = 0; i < N; i++) {
dp[i] = 10010;
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << "\n";
} | #include "bits/stdc++.h"
// vector
#define MAX_ELE(vec) *max_element(vec.begin(), vec.end())
#define SORT(vec) sort(vec.begin(), vec.end());
// ---------------------------------------
// string
#define TO_UP(str) transform(str.cbegin(), str.cend(), str.begin(), ::toupper)
// ---------------------------------------
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() {
cin.tie(0);
ios::sync_with_stdio(false);
// --------------------------------------
int N;
int h[100000];
long long dp[100000];
cin >> N;
for (int i = 0; i < N; i++) {
dp[i] = INFINITY;
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << "\n";
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 955,931 | 955,932 | u373796790 | cpp |
p03160 | #include <bits/stdc++.h>
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int mod = 1e9 + 7;
static const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(10010);
rep(i, 10010) { dp[i] = INF; }
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int mod = 1e9 + 7;
static const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(100010);
rep(i, 100010) { dp[i] = INF; }
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 955,938 | 955,936 | u747087681 | cpp |
p03160 | #include <bits/stdc++.h>
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int mod = 1e9 + 7;
static const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(100100);
rep(i, 100100) { dp[i] = INF; }
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int mod = 1e9 + 7;
static const long long INF = 1LL << 60;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(100010);
rep(i, 100010) { dp[i] = INF; }
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 955,939 | 955,936 | u747087681 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fri(i, a, b) for (int i = a; i <= b; ++i)
#define fro(i, a, b) for (int i = a; i >= b; --i)
#define debug(P) cout << #P << " = " << P << endl;
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define endl "\n"
#define ii pair<int, int>
#define LL long long
#define maxm(a, b, c) max(a, max(b, c))
int q1, q2, a[100000], dp[100001];
int yo(int n) {
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
fri(i, 3, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
return dp[n];
}
int main() {
int n;
cin >> n;
for (int i = 1; i < n + 1; ++i)
cin >> a[i];
cout << yo(n);
} | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fri(i, a, b) for (int i = a; i <= b; ++i)
#define fro(i, a, b) for (int i = a; i >= b; --i)
#define debug(P) cout << #P << " = " << P << endl;
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define endl "\n"
#define ii pair<int, int>
#define LL long long
#define maxm(a, b, c) max(a, max(b, c))
int q1, q2, a[100010], dp[100010];
int yo(int n) {
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
fri(i, 3, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
return dp[n];
}
int main() {
int n;
cin >> n;
for (int i = 1; i < n + 1; ++i)
cin >> a[i];
cout << yo(n);
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,940 | 955,941 | u925429104 | cpp |
p03160 | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 100000 + 5;
int n, h[MAXN], f[MAXN];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", h + i);
f[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
h[i] =
min(f[i - 2] + abs(h[i] - h[i - 2]), f[i - 1] + abs(h[i] - h[i - 1]));
printf("%d", h[n - 1]);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 100000 + 5;
int n, h[MAXN], f[MAXN];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", h + i);
f[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
f[i] =
min(f[i - 2] + abs(h[i] - h[i - 2]), f[i - 1] + abs(h[i] - h[i - 1]));
printf("%d", f[n - 1]);
return 0;
} | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 955,942 | 955,943 | u384419821 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i <= b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<ll, int>
#define vi vector<double>
#define vvi vector<vector<double>>
#define vpii vector<pii>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int x;
vi a;
Fr(i, 0, n - 1) {
cin >> x;
a.pb(x);
}
vi b(n, 0);
Fr(i, 1, n - 1) {
if (i == 1) {
b[i] = abs(a[i] - a[i - 1]);
} else {
b[i] = min(abs(a[i] - a[i - 2]) + b[i - 2],
abs(a[i] - a[i - 1]) + b[i - 1]);
}
}
cout << b[n - 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i <= b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<ll, int>
#define vi vector<ll>
#define vvi vector<vector<double>>
#define vpii vector<pii>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int x;
vi a;
Fr(i, 0, n - 1) {
cin >> x;
a.pb(x);
}
vi b(n, 0);
Fr(i, 1, n - 1) {
if (i == 1) {
b[i] = abs(a[i] - a[i - 1]);
} else {
b[i] = min(abs(a[i] - a[i - 2]) + b[i - 2],
abs(a[i] - a[i - 1]) + b[i - 1]);
}
}
cout << b[n - 1] << endl;
}
return 0;
} | [
"preprocessor.define.value.change"
] | 955,946 | 955,947 | u479971587 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define uniq(x) \
x.erase(unique(x.begin(), x.end()), x.end()) // Unique value find from vector
#define upper(arr, n, fixed) \
upper_bound(arr, arr + n, fixed) - arr // Upper value search >
#define lower(arr, n, fixed) \
lower_bound(arr, arr + n, fixed) - arr // Lower value search >=
#define FOR(i, a, n) for (int i = a; i < (int)n; i++)
#define FORI(i, a, n) for (int i = a; i >= (int)n; i--)
#define pii pair<int, int>
#define vpii vector<pii>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(a) int((a).size())
#define fastIO() \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define endl "\n"
#define all(a) a.begin(), a.end()
#define MEMSET(p, i) memset(p, i, sizeof(p))
typedef long long LL;
LL memo[100010];
LL v[100010];
int n;
LL dp(int i) {
if (i >= n)
return 0;
if (i == n - 1)
memo[i] = 0;
if (memo[i] != -1)
return memo[i];
LL &dpm = memo[i];
dpm = 0;
dpm +=
min(abs(v[i] - v[i + 1]) + dp(i + 1), abs(v[i] - v[i + 2]) + dp(i + 2));
return dpm;
}
int main(void) {
fastIO();
cin >> n;
MEMSET(v, 0);
FOR(i, 0, n)
cin >> v[i];
MEMSET(memo, -1);
cout << dp(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define uniq(x) \
x.erase(unique(x.begin(), x.end()), x.end()) // Unique value find from vector
#define upper(arr, n, fixed) \
upper_bound(arr, arr + n, fixed) - arr // Upper value search >
#define lower(arr, n, fixed) \
lower_bound(arr, arr + n, fixed) - arr // Lower value search >=
#define FOR(i, a, n) for (int i = a; i < (int)n; i++)
#define FORI(i, a, n) for (int i = a; i >= (int)n; i--)
#define pii pair<int, int>
#define vpii vector<pii>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz(a) int((a).size())
#define fastIO() \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define endl "\n"
#define all(a) a.begin(), a.end()
#define MEMSET(p, i) memset(p, i, sizeof(p))
typedef long long LL;
LL memo[100010];
LL v[100010];
int n;
LL dp(int i) {
if (i >= n)
return 1e9;
if (i == n - 1)
memo[i] = 0;
if (memo[i] != -1)
return memo[i];
LL &dpm = memo[i];
dpm = 0;
dpm +=
min(abs(v[i] - v[i + 1]) + dp(i + 1), abs(v[i] - v[i + 2]) + dp(i + 2));
return dpm;
}
int main(void) {
fastIO();
cin >> n;
MEMSET(v, 0);
FOR(i, 0, n)
cin >> v[i];
MEMSET(memo, -1);
cout << dp(0) << endl;
} | [
"literal.number.change",
"function.return_value.change"
] | 955,948 | 955,949 | u093669840 | cpp |
p03160 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_AB(i, a, b) for (ll i = ll(a); i <= ll(b); ++i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define SIZE(x) ((ll)(x).size())
#define REVERSE(v) reverse(ALL(v))
// true / false
#define BIN_SEARCH(v, a) binary_search(ALL(v), a)
// index
#define BIN_LEFT(v, a) (lower_bound(ALL(v), a) - v.begin())
#define BIN_RIGHT(v, a) (upper_bound(ALL(v), a) - v.begin())
#define BIN_INSERT(v, a) (v.insert(v.begin() + BIN_LEFT(v, a), a))
#define DEL(v, i) v.erase(v.begin() + i)
#define INSERT(v, i, a) v.insert(v.begin() + i, a)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define out cout
#define in cin
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// template end
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
in >> n;
vector<ll> h(n);
REP(i, n) in >> h[i];
ll dp[n] = {};
dp[2] = abs(h[1] - h[0]);
if (n > 2) {
REP_AB(i, 3, n) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
out << dp[n] << endl;
}
| // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_AB(i, a, b) for (ll i = ll(a); i <= ll(b); ++i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define UNIQUE(v) \
sort(ALL(v)); \
v.erase(unique(ALL(v)), v.end());
#define SIZE(x) ((ll)(x).size())
#define REVERSE(v) reverse(ALL(v))
// true / false
#define BIN_SEARCH(v, a) binary_search(ALL(v), a)
// index
#define BIN_LEFT(v, a) (lower_bound(ALL(v), a) - v.begin())
#define BIN_RIGHT(v, a) (upper_bound(ALL(v), a) - v.begin())
#define BIN_INSERT(v, a) (v.insert(v.begin() + BIN_LEFT(v, a), a))
#define DEL(v, i) v.erase(v.begin() + i)
#define INSERT(v, i, a) v.insert(v.begin() + i, a)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
#define out cout
#define in cin
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// template end
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
in >> n;
vector<ll> h(n);
REP(i, n) in >> h[i];
ll dp[n] = {};
dp[2] = abs(h[1] - h[0]);
if (n > 2) {
REP_AB(i, 3, n) {
dp[i] = min(dp[i - 1] + abs(h[i - 1] - h[i - 2]),
dp[i - 2] + abs(h[i - 1] - h[i - 3]));
}
}
out << dp[n] << endl;
}
| [
"assignment.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,958 | 955,959 | u652057333 | cpp |
p03160 |
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<ll>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define pb push_back
#define f first
#define s second
using namespace std;
signed main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
std::vector<int> h(100001);
std::vector<int> d(100001);
for (int i = 0; i < n; ++i) {
/* code */
cin >> h[i];
}
d[1] = h[1] - h[0];
for (int i = 2; i < n; i++) {
d[i] = min((abs(h[i] - h[i - 1]) + d[i - 1]),
(abs(h[i] - h[i - 2]) + d[i - 2]));
}
cout << d[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<ll>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define pb push_back
#define f first
#define s second
using namespace std;
signed main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
std::vector<int> h(100001);
std::vector<int> d(100001);
for (int i = 0; i < n; ++i) {
/* code */
cin >> h[i];
}
d[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
d[i] = min((abs(h[i] - h[i - 1]) + d[i - 1]),
(abs(h[i] - h[i - 2]) + d[i - 2]));
}
cout << d[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 955,962 | 955,963 | u495003993 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define sz 100110
#define ll long long int
ll n, c = 0, p, q;
ll num[sz];
ll vis[sz];
ll dp[sz];
ll tani(int pos) {
if (pos >= n)
return 0;
if (vis[pos] == 1)
return dp[pos];
vis[pos] = 1;
return dp[pos] = min(abs(num[pos] - num[pos + 1]) + tani(pos + 1),
abs(num[pos] - num[pos + 2]) + tani(pos + 2));
}
int main() {
ll t, i;
for (i = 1; i < sz; i++)
num[i] = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> num[i];
}
t = tani(1);
cout << t << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define sz 100110
#define ll long long int
ll n, c = 0, p, q;
ll num[sz];
ll vis[sz];
ll dp[sz];
ll tani(int pos) {
if (pos >= n)
return 0;
if (vis[pos] == 1)
return dp[pos];
vis[pos] = 1;
return dp[pos] = min(abs(num[pos] - num[pos + 1]) + tani(pos + 1),
abs(num[pos] - num[pos + 2]) + tani(pos + 2));
}
int main() {
ll t, i;
for (i = 1; i < sz; i++)
num[i] = 1000000;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> num[i];
}
t = tani(1);
cout << t << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 955,964 | 955,965 | u984621967 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 955,966 | 955,967 | u400267362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 3; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,968 | 955,967 | u400267362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 3; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,969 | 955,967 | u400267362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
// int res = 0;
for (int 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]));
// res+=dp[i];
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
// int res = 0;
for (int 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]));
// res+=dp[i];
}
cout << dp[n - 1];
return 0;
}
| [] | 955,979 | 955,980 | u167245821 | cpp |
p03160 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
template <class T> T clampMax(const T &a, const T &b) { return min(a, b); }
template <class T> T clampMin(const T &a, const T &b) { return max(a, b); }
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define PB push
#define MOD 1000000007LL
#define EPS 1e-10
const int MAX_N = 100010;
int N;
LL h[MAX_N];
LL memo[MAX_N];
LL Solve(int pos) {
if (memo[pos] >= 0)
return memo[pos];
if (pos >= N)
return memo[pos] = 2000000000;
if (pos == N - 1)
return memo[pos] = 0;
int cost1 = abs(h[pos] - h[pos + 1]) + Solve(pos + 1);
int cost2 = abs(h[pos] - h[pos + 2]) + Solve(pos + 2);
return memo[pos] = min(cost1, cost2);
}
int main() {
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N) memo[i] = -1;
cout << Solve(0) << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
template <class T> T clampMax(const T &a, const T &b) { return min(a, b); }
template <class T> T clampMin(const T &a, const T &b) { return max(a, b); }
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define PB push
#define MOD 1000000007LL
#define EPS 1e-10
const int MAX_N = 100010;
int N;
LL h[MAX_N];
LL memo[MAX_N];
LL Solve(int pos) {
if (memo[pos] >= 0)
return memo[pos];
if (pos >= N)
return memo[pos] = 2000000000;
if (pos == N - 1)
return memo[pos] = 0;
int cost1 = abs(h[pos] - h[pos + 1]) + Solve(pos + 1);
int cost2 = abs(h[pos] - h[pos + 2]) + Solve(pos + 2);
return memo[pos] = min(cost1, cost2);
}
int main() {
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N + 2) memo[i] = -1;
cout << Solve(0) << endl;
return 0;
} | [
"assignment.change"
] | 955,983 | 955,984 | u532065884 | cpp |
p03160 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
template <class T> T clampMax(const T &a, const T &b) { return min(a, b); }
template <class T> T clampMin(const T &a, const T &b) { return max(a, b); }
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define PB push
#define MOD 1000000007LL
#define EPS 1e-10
const int MAX_N = 100010;
int N;
int h[MAX_N];
int memo[MAX_N];
int Solve(int pos) {
if (memo[pos] >= 0)
return memo[pos];
if (pos >= N)
return memo[pos] = 2000000000;
if (pos == N - 1)
return memo[pos] = 0;
int cost1 = abs(h[pos] - h[pos + 1]) + Solve(pos + 1);
int cost2 = abs(h[pos] - h[pos + 2]) + Solve(pos + 2);
return memo[pos] = min(cost1, cost2);
}
int main() {
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N) memo[i] = -1;
cout << Solve(0) << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
template <class T> T clampMax(const T &a, const T &b) { return min(a, b); }
template <class T> T clampMin(const T &a, const T &b) { return max(a, b); }
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define PB push
#define MOD 1000000007LL
#define EPS 1e-10
const int MAX_N = 100010;
int N;
LL h[MAX_N];
LL memo[MAX_N];
LL Solve(int pos) {
if (memo[pos] >= 0)
return memo[pos];
if (pos >= N)
return memo[pos] = 2000000000;
if (pos == N - 1)
return memo[pos] = 0;
int cost1 = abs(h[pos] - h[pos + 1]) + Solve(pos + 1);
int cost2 = abs(h[pos] - h[pos + 2]) + Solve(pos + 2);
return memo[pos] = min(cost1, cost2);
}
int main() {
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N + 2) memo[i] = -1;
cout << Solve(0) << endl;
return 0;
} | [
"variable_declaration.type.change",
"assignment.change"
] | 955,985 | 955,984 | u532065884 | cpp |
p03160 | /*----------------
Smit Patel
DA-IICT
----------------*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ins insert
#define fori(i, a, n) for (int i = a; i < n; i++)
#define ford(i, a, n) for (int i = a; i > n; i--)
#define clr(a, b) memset(a, b, sizeof(a))
#define deb(x) cout << #x << " : " << x << endl;
#define debug(x, y) \
cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define bp __builtin_popcount
#define mod 1000000007
#define eps 1e-6
#define infi 1000000002
#define infll 1e18 + 5
#define N 200005
#define LN 20
typedef long double ld;
typedef long long ll;
typedef map<ll, ll> mll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef set<ll> sll;
ll choose(ll n, ll k);
bool isprime(ll n);
ll power(ll x, ll y, ll p);
ll power(ll x, ll y);
ll gcd(ll a, ll b);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll a[n];
fori(i, 0, n) { cin >> a[i]; }
ll dp[n + 1] = {};
fori(i, 2, n) {
dp[i] = infi;
fori(j, 1, 3) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
bool isprime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
| /*----------------
Smit Patel
DA-IICT
----------------*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ins insert
#define fori(i, a, n) for (int i = a; i < n; i++)
#define ford(i, a, n) for (int i = a; i > n; i--)
#define clr(a, b) memset(a, b, sizeof(a))
#define deb(x) cout << #x << " : " << x << endl;
#define debug(x, y) \
cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define bp __builtin_popcount
#define mod 1000000007
#define eps 1e-6
#define infi 1000000002
#define infll 1e18 + 5
#define N 200005
#define LN 20
typedef long double ld;
typedef long long ll;
typedef map<ll, ll> mll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef set<ll> sll;
ll choose(ll n, ll k);
bool isprime(ll n);
ll power(ll x, ll y, ll p);
ll power(ll x, ll y);
ll gcd(ll a, ll b);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll a[n];
fori(i, 0, n) { cin >> a[i]; }
ll dp[n + 1] = {};
fori(i, 1, n) {
dp[i] = infi;
fori(j, 1, 3) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
bool isprime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
| [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 955,988 | 955,989 | u821117000 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 955,990 | 955,991 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 955,992 | 955,991 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 955,993 | 955,991 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 955,992 | 955,995 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i - j]) + ans[i - j]);
}
}
cout << ans[n - 1];
return 0;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 955,993 | 955,995 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
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;
}
const long long INF = 1LL << 60;
// 入力
int N;
vector<long long> h(100010, INF);
// DP テーブル
vector<long long> dp(100010, INF);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
// 初期条件
dp[0] = 0;
// ループ
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
// 答え
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
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;
}
const long long INF = 1LL << 60;
// 入力
int N;
vector<long long> h(100010, INF);
// DP テーブル
vector<long long> dp(100010, INF);
int main() {
int N, K;
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
// 初期条件
dp[0] = 0;
// ループ
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
// 答え
cout << dp[N - 1] << endl;
}
| [
"expression.operation.binary.remove"
] | 955,999 | 956,000 | u074306398 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
int main() {
int n;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
vector<int> dp(n, -1);
dp[0] = 0;
dp[1] = data[1] - data[0];
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(data[i] - data[i - 1]),
dp[i - 2] + abs(data[i] - data[i - 2]));
}
cout << dp[n - 1] << nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
int main() {
int n;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
vector<int> dp(n, -1);
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(data[i] - data[i - 1]),
dp[i - 2] + abs(data[i] - data[i - 2]));
}
cout << dp[n - 1] << nl;
return 0;
}
| [
"call.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,004 | 956,005 | u647457236 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int h[100001];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[100001] = {0, 0, abs(h[1] - h[2])};
for (int i = 2; i <= n; i++) {
// cout << dp[i] << " ";
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
// cout << endl;
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int h[100001];
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[100001] = {0, 0, abs(h[1] - h[2])};
for (int i = 3; 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] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,008 | 956,009 | u218759384 | cpp |
p03160 | #include <bits/stdc++.h>
// #define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vin(v, n) copy_n(istream_iterator<int>(cin), n, back_inserter(v));
#define all(v) v.begin(), v.end()
#define INF 2000000000
#define MOD 1000000007
#define ll long long
#define vi vector<int>
#define ii pair<int, int>
#define si set<int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define f1(i, a, b) for (int i = a; i < b; i++)
#define f2(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
int32_t main() {
IOS;
int n;
cin >> n;
vi v;
vin(v, n);
vi dp(n + 1, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
f1(i, 1, n) dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
// #define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vin(v, n) copy_n(istream_iterator<int>(cin), n, back_inserter(v));
#define all(v) v.begin(), v.end()
#define INF 2000000000
#define MOD 1000000007
#define ll long long
#define vi vector<int>
#define ii pair<int, int>
#define si set<int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define f1(i, a, b) for (int i = a; i < b; i++)
#define f2(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
int32_t main() {
IOS;
int n;
cin >> n;
vi v;
vin(v, n);
vi dp(n + 1, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
f1(i, 2, n) dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
cout << dp[n - 1];
}
| [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 956,021 | 956,022 | u350343918 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n;
cin >> n;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) dp[i] = min(dp[i - 1] + abs(a[i - 1] - a[i - 2]),
dp[i - 2] + abs(a[i - 1] - a[i - 2]));
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n;
cin >> n;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
cout << dp[n];
} | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,023 | 956,024 | u364018936 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
static const int INF = (1 << 21);
int main(void) {
// Your code here!
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = INF;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
vector<int> dp(N + 1);
dp.at(0) = INF;
dp.at(1) = 0;
for (int i = 2; i <= N; i++) {
dp.at(i) = min(dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)),
dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(N) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
static const int INF = (1 << 21);
int main(void) {
// Your code here!
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = INF;
for (int i = 0; i < N; i++) {
cin >> h.at(i + 1);
}
vector<int> dp(N + 1);
dp.at(0) = INF;
dp.at(1) = 0;
for (int i = 2; i <= N; i++) {
dp.at(i) = min(dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)),
dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(N) << endl;
}
| [
"expression.operation.binary.add"
] | 956,037 | 956,038 | u633284019 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n, b;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> b;
h[i] = b;
}
long long int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = 1000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i - 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1] << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n, b;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> b;
h[i] = b;
}
long long int dp[1000000];
for (int i = 0; i < n; i++) {
dp[i] = 1000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,041 | 956,042 | u855866205 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll h[n];
ll d[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
d[i] = 1000000;
}
d[0] = 0;
for (ll i = 1; i < n; i++) {
if (i > 1)
d[i] = min(d[i], d[i - 2] + abs(h[i] - h[i - 2]));
d[i] = min(d[i], d[i - 1] + abs(h[i] - h[i - 1]));
}
cout << d[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll h[n];
ll d[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
d[i] = pow(10, 18);
}
d[0] = 0;
for (ll i = 1; i < n; i++) {
if (i > 1)
d[i] = min(d[i], d[i - 2] + abs(h[i] - h[i - 2]));
d[i] = min(d[i], d[i - 1] + abs(h[i] - h[i - 1]));
}
cout << d[n - 1] << endl;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 956,049 | 956,050 | u876784108 | cpp |
p03160 |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N - 1]);
for (int i = N - 2; i >= 1; --i) {
int dif1 = std::abs(h[i] - h[i + 1]);
int dif2 = std::abs(h[i] = h[i + 2]);
int sum1 = dif1 + DP[i + 1];
int sum2 = dif2 + DP[i + 2];
DP[i] = std::min(sum1, sum2);
}
std::cout << DP[1];
return 0;
} |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N - 1]);
for (int i = N - 2; i >= 1; --i) {
int dif1 = std::abs(h[i] - h[i + 1]);
int dif2 = std::abs(h[i] - h[i + 2]);
int sum1 = dif1 + DP[i + 1];
int sum2 = dif2 + DP[i + 2];
DP[i] = std::min(sum1, sum2);
}
std::cout << DP[1];
return 0;
} | [
"call.arguments.change"
] | 956,060 | 956,061 | u889784755 | cpp |
p03160 |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N + 1]);
for (int i = N - 2; i >= 1; --i) {
int dif1 = std::abs(h[i] - h[i + 1]);
int dif2 = std::abs(h[i] = h[i + 2]);
int sum1 = dif1 + DP[i + 1];
int sum2 = dif2 + DP[i + 2];
DP[i] = std::min(sum1, sum2);
}
std::cout << DP[1];
return 0;
} |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N - 1]);
for (int i = N - 2; i >= 1; --i) {
int dif1 = std::abs(h[i] - h[i + 1]);
int dif2 = std::abs(h[i] - h[i + 2]);
int sum1 = dif1 + DP[i + 1];
int sum2 = dif2 + DP[i + 2];
DP[i] = std::min(sum1, sum2);
}
std::cout << DP[1];
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,062 | 956,061 | u889784755 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N;
int h[MAX_N], dp[MAX_N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
for (int i = 0; i < N; ++i) {
if (i != 0)
dp[i] = (1 << 29);
if (i - 1 >= 0)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 1]));
}
cout << dp[N - 1] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N;
int h[MAX_N], dp[MAX_N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
for (int i = 0; i < N; ++i) {
if (i != 0)
dp[i] = (1 << 29);
if (i - 1 >= 0)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << '\n';
return 0;
} | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,065 | 956,066 | u738069880 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.