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 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const int INF = 1e9 + 5;
const int N = 2e5 + 123;
int main() {
speed;
int n;
cin >> n;
vi v(n);
vi dp(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
dp[1] = 0;
dp[2] = abs(v[2] - v[1]);
for (int i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 2] + abs(v[i] - v[i - 2]), dp[i - 1] + abs(v[i] - v[i - 1]));
}
cout << dp[n];
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const int INF = 1e9 + 5;
const int N = 2e5 + 123;
int main() {
speed;
int n;
cin >> n;
vi v(n + 1);
vi dp(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
dp[1] = 0;
dp[2] = abs(v[2] - v[1]);
for (int i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 2] + abs(v[i] - v[i - 2]), dp[i - 1] + abs(v[i] - v[i - 1]));
}
cout << dp[n];
} | [
"assignment.change"
] | 954,715 | 954,716 | u518027311 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
vll h(n);
rep(i, n) cin >> h[i];
vll dp(n + 1);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
max(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]);
}
COUT(dp[n - 1]);
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
vll h(n);
rep(i, n) cin >> h[i];
vll dp(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]);
}
COUT(dp[n - 1]);
} | [
"expression.operation.binary.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,717 | 954,718 | u103850114 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define FOR(i, l, r) for (long long i = l; i < r; i++)
#define FOR_REV(i, r, l) for (long long i = r; i >= l; i--)
#define pb push_back
#define mp make_pair
int main() {
int n;
cin >> n;
int a[200009];
FOR(i, 1, n + 1) { cin >> a[i]; }
int dp[200009];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
FOR(i, 2, n + 1) {
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;
}
| #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define FOR(i, l, r) for (long long i = l; i < r; i++)
#define FOR_REV(i, r, l) for (long long i = r; i >= l; i--)
#define pb push_back
#define mp make_pair
int main() {
int n;
cin >> n;
int a[200009];
FOR(i, 1, n + 1) { cin >> a[i]; }
int dp[200009];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
FOR(i, 3, n + 1) {
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;
}
| [
"literal.number.change",
"call.arguments.change"
] | 954,722 | 954,723 | u874921280 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long a[100001], dp[100001], i, j, n, k;
long long cal(long long i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
else
dp[i] = 0;
if (i + 2 <= n)
dp[i] = min(cal(i + 1) + abs(a[i + 1] - a[i]),
cal(i + 2) + abs(a[i + 2] - a[i + 1]));
else
dp[i] = cal(i + 1) + abs(a[i + 1] - a[i]);
return dp[i];
}
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
// scanf("%d",&a[i]);
cin >> a[i];
dp[i] = -1;
}
// printf("%d", cal(1));
cout << cal(1);
}
| #include <bits/stdc++.h>
using namespace std;
long long a[100001], dp[100001], i, j, n, k;
long long cal(long long i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
else
dp[i] = 0;
if (i + 2 <= n)
dp[i] = min(cal(i + 1) + abs(a[i + 1] - a[i]),
cal(i + 2) + abs(a[i + 2] - a[i]));
else
dp[i] = cal(i + 1) + abs(a[i + 1] - a[i]);
return dp[i];
}
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
// scanf("%d",&a[i]);
cin >> a[i];
dp[i] = -1;
}
// printf("%d", cal(1));
cout << cal(1);
}
| [
"expression.operation.binary.remove"
] | 954,724 | 954,725 | u227031461 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int ans[100001];
int arr[100001];
int func(int n) {
if (ans[n] != -1)
return ans[n];
int a = func(n - 1) + abs(arr[n] - arr[n - 1]);
int b = func(n - 2) + abs(arr[n] - arr[n - 2]);
ans[n] = min(a, b);
return ans[n];
}
int main() {
int n, i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> arr[i];
for (i = 1; i <= n; ++i)
ans[i] = -1;
ans[0] = 0;
ans[1] = 0;
int final = func(n);
cout << final << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int ans[100001];
int arr[100001];
int func(int n) {
if (ans[n] != -1)
return ans[n];
int a = func(n - 1) + abs(arr[n] - arr[n - 1]);
int b = func(n - 2) + abs(arr[n] - arr[n - 2]);
ans[n] = min(a, b);
return ans[n];
}
int main() {
int n, i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> arr[i];
for (i = 1; i <= n; ++i)
ans[i] = -1;
ans[0] = 1e9;
ans[1] = 0;
int final = func(n);
cout << final << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 954,732 | 954,733 | u313894879 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = h[1] - h[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]));
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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];
} | [
"call.add",
"call.arguments.change"
] | 954,743 | 954,744 | u621956397 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const ll INF = 1e6;
ll N;
vector<ll> dp, h;
int main() {
cin >> N;
h.resize(N);
dp.resize(N + 5);
rep(i, N) cin >> h[i];
rep(i, N + 5) dp[i] = INF;
dp[0] = 0;
rep(i, N) {
if (i + 1 <= N - 1) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
}
if (i + 2 <= N - 1) {
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
}
cout << dp[N - 1] << endl;
// rep(i, N) {
// cout << dp[i] << endl;
// }
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll N;
vector<ll> dp, h;
int main() {
// cout << INF << endl;
// return 0;
cin >> N;
h.resize(N);
dp.resize(N + 5);
rep(i, N) cin >> h[i];
rep(i, N + 5) dp[i] = INF;
dp[0] = 0;
rep(i, N) {
if (i + 1 <= N - 1) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
}
if (i + 2 <= N - 1) {
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
}
cout << dp[N - 1] << endl;
// rep(i, N) {
// cout << dp[i] << endl;
// }
} | [
"literal.number.change"
] | 954,755 | 954,754 | u455366471 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
const long long MOD = 1e9 + 7;
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;
int h[1000100];
rep(i, n) { cin >> h[i]; }
ll dp[1000100];
// dp テーブルの初期化
rep(i, n) { dp[i] = INF; }
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 1; 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] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
const long long MOD = 1e9 + 7;
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;
ll h[n];
rep(i, n) { cin >> h[i]; }
ll dp[n];
// dp テーブルの初期化
rep(i, n) { dp[i] = INF; }
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 1; 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] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 954,758 | 954,757 | u138597672 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
int arr[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
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] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 1]));
}
cout << dp[n - 1] << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
int arr[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
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] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1] << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,763 | 954,764 | u058509804 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub upper_bound
#define lb lower_bound
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef set<int> si;
typedef set<ll> sll;
typedef multiset<int> msi;
typedef multiset<ll> msll;
typedef map<int, int> mi;
typedef map<ll, int> mll;
const int N = 1e6 + 2;
const int M = 1e5 + 2;
const int mod = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e16;
void data() {
#ifdef PC
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
void scerr(vi nums) {
for (auto it : nums)
cerr << it << " | ";
cerr << "\n";
}
ll n, dp[N], a[N];
int main() {
data();
scanf("%lld", &n);
dp[0] = dp[1] = 0LL;
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
if (i > 1)
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
}
printf("%lld", dp[n]);
return 0;
}
/*
Timus: 288481RF
CodeForces: __fractal
*/ | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub upper_bound
#define lb lower_bound
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef set<int> si;
typedef set<ll> sll;
typedef multiset<int> msi;
typedef multiset<ll> msll;
typedef map<int, int> mi;
typedef map<ll, int> mll;
const int N = 1e5 + 2;
const int M = 1e5 + 2;
const int mod = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e16;
void data() {
#ifdef PC
freopen("main.in", "r", stdin);
freopen("main.out", "w", stdout);
#endif
}
void scerr(vi nums) {
for (auto it : nums)
cerr << it << " | ";
cerr << "\n";
}
ll n, dp[N], a[N];
int main() {
data();
scanf("%lld", &n);
dp[0] = inf, dp[1] = 0;
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
if (i > 1)
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
}
printf("%lld", dp[n]);
return 0;
}
/*
Timus: 288481RF
CodeForces: __fractal
*/ | [
"literal.number.change",
"expression.operation.binary.change"
] | 954,767 | 954,768 | u426777622 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
const long long INF = 1LL << 60;
long long dp[100010];
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = dp[0] + abs(h[0] - h[1]);
for (int i = 1; i < 10010; 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;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
const long long INF = 1LL << 60;
long long dp[100010];
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = dp[0] + abs(h[0] - h[1]);
for (int i = 1; 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;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 954,769 | 954,770 | u233412274 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 2;
const int mod = 1e9 + 7;
const int inf = 1e9;
typedef long long II;
int n;
int arr[maxn], dp[maxn];
int solve_dp(int pos) {
if (pos > n) {
return inf;
}
if (pos == n - 1) {
return 0;
}
if (dp[pos] != -1) {
return dp[pos];
}
int ans = inf;
ans = min(ans, solve_dp(pos + 1) + abs(arr[pos + 1] - arr[pos]));
ans = min(ans, solve_dp(pos + 2) + abs(arr[pos + 2] - arr[pos]));
return dp[pos] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> n;
}
memset(dp, -1, sizeof dp);
cout << solve_dp(0) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 2;
const int mod = 1e9 + 7;
const int inf = 1e9;
typedef long long II;
int n;
int arr[maxn], dp[maxn];
int solve_dp(int pos) {
if (pos > n) {
return inf;
}
if (pos == n - 1) {
return 0;
}
if (dp[pos] != -1) {
return dp[pos];
}
int ans = inf;
ans = min(ans, solve_dp(pos + 1) + abs(arr[pos + 1] - arr[pos]));
ans = min(ans, solve_dp(pos + 2) + abs(arr[pos + 2] - arr[pos]));
return dp[pos] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof dp);
cout << solve_dp(0) << "\n";
} | [
"expression.operation.binary.change"
] | 954,779 | 954,780 | u888155275 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(vec[i - 1] - vec[i]),
i > 1 ? dp[i - 2] + abs(vec[i - 2] - vec[i]) : 0);
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(vec[i - 1] - vec[i]),
i > 1 ? dp[i - 2] + abs(vec[i - 2] - vec[i]) : INT_MAX);
}
cout << dp[N - 1] << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 954,785 | 954,786 | u021539722 | cpp |
p03160 | /*
LEARNING DP: FROG 1
+ Frog need to reach stone N
+ Can jump to Stone i + 1 or i + 2 when the Frog is on Stone i
+ Cost |hi - hj|
=> Imagine if the frog were at stone i + 1 or i + 2,
What is the minium cost to reach on Stone i.
PRE DP:
+FIRST STATE: i = 0 => cost = 0
*/
#include <bits/stdc++.h>
using namespace std;
#define DB(_x) cout << #_x << " is " << (_x) << "\n";
#define FOR(_a, _b) for (_a = 0; _a < _b; ++_a)
using LL = long long;
using LD = long double;
using VI = vector<int>;
using PI = pair<int, int>;
void Excalibur() {
int n;
while (cin >> n) {
VI a(n);
for (auto &x : a)
cin >> x;
VI dp(n, 1e9);
int i;
dp[0] = 0;
FOR(i, n) {
if (i - 1 >= 0)
dp[i] = min(dp[i], dp[i - 1] + abs(a[i] - a[i - 1]));
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
freopen("INPUT.in", "r", stdin);
freopen("OUTPUT.out", "w", stdout);
Excalibur();
return 0;
}
| /*
LEARNING DP: FROG 1
+ Frog need to reach stone N
+ Can jump to Stone i + 1 or i + 2 when the Frog is on Stone i
+ Cost |hi - hj|
=> Imagine if the frog were at stone i + 1 or i + 2,
What is the minium cost to reach on Stone i.
PRE DP:
+FIRST STATE: i = 0 => cost = 0
*/
#include <bits/stdc++.h>
using namespace std;
#define DB(_x) cout << #_x << " is " << (_x) << "\n";
#define FOR(_a, _b) for (_a = 0; _a < _b; ++_a)
//#define IOFILE
using LL = long long;
using LD = long double;
using VI = vector<int>;
using PI = pair<int, int>;
void Excalibur() {
int n;
while (cin >> n) {
VI a(n);
for (auto &x : a)
cin >> x;
VI dp(n, 1e9);
int i;
dp[0] = 0;
FOR(i, n) {
if (i - 1 >= 0)
dp[i] = min(dp[i], dp[i - 1] + abs(a[i] - a[i - 1]));
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
#ifdef IOFILE
freopen("INPUT.in", "r", stdin);
freopen("OUTPUT.out", "w", stdout);
#endif
Excalibur();
return 0;
}
| [] | 954,787 | 954,788 | u680191616 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
int64_t abs(int64_t n) {
if (n < 0) {
n = -n;
}
return n;
}
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
vector<int> dp(100010, 100000);
dp.at(0) = 0;
for (int i = 1; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(vec.at(i) - vec.at(i - 1)));
if (i > 1) {
chmin(dp.at(i), dp.at(i - 2) + abs(vec.at(i) - vec.at(i - 2)));
}
}
cout << dp.at(n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
int64_t abs(int64_t n) {
if (n < 0) {
n = -n;
}
return n;
}
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
vector<int> dp(100010, 1000000007);
dp.at(0) = 0;
for (int i = 1; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(vec.at(i) - vec.at(i - 1)));
if (i > 1) {
chmin(dp.at(i), dp.at(i - 2) + abs(vec.at(i) - vec.at(i - 2)));
}
}
cout << dp.at(n - 1) << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 954,791 | 954,792 | u785492958 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
int64_t abs(int64_t n) {
if (n < 0) {
n = -n;
}
return n;
}
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
vector<int> dp(100010, 10000);
dp.at(0) = 0;
for (int i = 1; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(vec.at(i) - vec.at(i - 1)));
if (i > 1) {
chmin(dp.at(i), dp.at(i - 2) + abs(vec.at(i) - vec.at(i - 2)));
}
}
cout << dp.at(n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
int64_t abs(int64_t n) {
if (n < 0) {
n = -n;
}
return n;
}
int main() {
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) { cin >> vec.at(i); }
vector<int> dp(100010, 1000000007);
dp.at(0) = 0;
for (int i = 1; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(vec.at(i) - vec.at(i - 1)));
if (i > 1) {
chmin(dp.at(i), dp.at(i - 2) + abs(vec.at(i) - vec.at(i - 2)));
}
}
cout << dp.at(n - 1) << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 954,793 | 954,792 | u785492958 | 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;
long long h[100010];
long long dp[100010];
int main(int argc, char const *argv[]) {
int N;
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; 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;
return 0;
} | #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;
long long h[100010];
long long dp[100010];
int main(int argc, char const *argv[]) {
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> h[i];
// 初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
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;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,796 | 954,797 | u944656871 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(h[i] - h[j]); }
// bottom up
// int main() {
// int n;
// cin>>n;
// h.resize(n);
// for(int i=0; i<n; i++) {
// cin>>h[i];
// }
// dp.resize(n);
// dp[0] = 0;
// dp[1] = abs(h[0]-h[1]);
// for(int i=2; i<n; i++) {
// dp[i] = min(dp[i-1] + cost(i,i-1), dp[i-2] + cost(i,i-2));
// }
// cout<<dp[n-1]<<endl;
// return 0;
// }
int func(int idx) {
if (idx > dp.size() || idx < 0)
return INT_MAX;
if (dp[idx] != -1)
return dp[idx];
if (idx == 0)
return dp[0] = 0;
if (idx == 1)
return dp[1] = cost(0, 1);
dp[idx] = min(func(idx - 1) + cost(idx, idx - 1),
func(idx - 2) + cost(idx, idx - 2));
return dp[idx];
}
int main() {
int n;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp.resize(n);
cout << func(n - 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(h[i] - h[j]); }
// bottom up
// int main() {
// int n;
// cin>>n;
// h.resize(n);
// for(int i=0; i<n; i++) {
// cin>>h[i];
// }
// dp.resize(n);
// dp[0] = 0;
// dp[1] = abs(h[0]-h[1]);
// for(int i=2; i<n; i++) {
// dp[i] = min(dp[i-1] + cost(i,i-1), dp[i-2] + cost(i,i-2));
// }
// cout<<dp[n-1]<<endl;
// return 0;
// }
int func(int idx) {
if (idx >= dp.size() || idx < 0)
return INT_MAX;
if (dp[idx] != -1)
return dp[idx];
if (idx == 0)
return dp[0] = 0;
if (idx == 1)
return dp[1] = cost(0, 1);
dp[idx] = min(func(idx - 1) + cost(idx, idx - 1),
func(idx - 2) + cost(idx, idx - 2));
return dp[idx];
}
int main() {
int n;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp.resize(n, -1);
cout << func(n - 1) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 954,798 | 954,799 | u812060781 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(dp[i] - dp[j]); }
int main() {
int n;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp.resize(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + cost(i, i - 1), dp[i - 2] + cost(i, i - 2));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(h[i] - h[j]); }
int main() {
int n;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp.resize(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + cost(i, i - 1), dp[i - 2] + cost(i, i - 2));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 954,800 | 954,801 | u812060781 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
using Map = unordered_map<int, int>;
int get_smallest_hop(int i, const vector<int> &vec, Map &memo) {
if (i == 0)
return 0;
if (i == 1)
return abs(vec[0] - vec[1]);
int p1, p2;
if (memo.find(i - 1) != memo.end()) {
p1 = memo[i - 1];
} else {
p1 = memo[i - 1] = get_smallest_hop(i - 1, vec, memo);
}
if (memo.find(i - 2) != memo.end()) {
p1 = memo[i - 2];
} else {
p1 = memo[i - 2] = get_smallest_hop(i - 2, vec, memo);
}
return min(abs(vec[i - 1] - vec[i]) + p1, abs(vec[i - 2] - vec[i]) + p2);
}
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; ++i) {
int v;
cin >> v;
h.push_back(v);
}
Map memo;
cout << get_smallest_hop(n - 1, h, memo);
return 0;
} | #include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
using Map = unordered_map<int, int>;
int get_smallest_hop(int i, const vector<int> &vec, Map &memo) {
if (i == 0)
return 0;
if (i == 1)
return abs(vec[0] - vec[1]);
int p1, p2;
if (memo.find(i - 1) != memo.end()) {
p1 = memo[i - 1];
} else {
p1 = memo[i - 1] = get_smallest_hop(i - 1, vec, memo);
}
if (memo.find(i - 2) != memo.end()) {
p2 = memo[i - 2];
} else {
p2 = memo[i - 2] = get_smallest_hop(i - 2, vec, memo);
}
return min(abs(vec[i - 1] - vec[i]) + p1, abs(vec[i - 2] - vec[i]) + p2);
}
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; ++i) {
int v;
cin >> v;
h.push_back(v);
}
Map memo;
cout << get_smallest_hop(n - 1, h, memo);
return 0;
} | [
"assignment.variable.change",
"identifier.change"
] | 954,802 | 954,803 | u163776885 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
const int INF = 1e5 + 5;
int32_t main() {
IOS;
int n;
scanf("%d", &n);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
const int INF = 1e9 + 5;
int32_t main() {
IOS;
int n;
scanf("%d", &n);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 954,804 | 954,805 | u951187116 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define mp make_pair
#define s second
#define f first
#define ll long long
using namespace std;
const int MAX = 1e5;
int h[100003], dp[100003];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = MAX;
for (int j = 1; j <= 2; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define mp make_pair
#define s second
#define f first
#define ll long long
using namespace std;
const ll MAX = 1e10;
ll h[100003], dp[100003];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = MAX;
for (int j = 1; j <= 2; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 954,810 | 954,811 | u276163214 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
vector<int> m;
int proc(vector<int> &vec, int n) {
if (n == 0) {
return 0;
} else if (n == 1) {
return abs(vec[1] - vec[0]);
}
if (m[n] > 0) {
return m[n];
}
int b = abs(vec[n] - vec[n - 2]) + proc(vec, n - 2);
int a = abs(vec[n] - vec[n - 1]) + proc(vec, n - 1);
int r = min(a, b);
m[n] = r;
return r;
}
int main(void) {
int n;
cin >> n;
vector<int> vec;
// vec.resize(n);
m.resize(n);
for (size_t i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
vec.push_back(tmp);
}
// int r = proc(vec, n-1);
for (size_t i = 1; i < n; ++i) {
if (i == 1) {
m[i] = abs(vec[1] - vec[0]);
}
int a = abs(vec[i] - vec[i - 1]) + m[i - 1];
int b = abs(vec[i] - vec[i - 2]) + m[i - 2];
m[i] = min(a, b);
}
cout << m[n - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
vector<int> m;
int proc(vector<int> &vec, int n) {
if (n == 0) {
return 0;
} else if (n == 1) {
return abs(vec[1] - vec[0]);
}
if (m[n] > 0) {
return m[n];
}
int b = abs(vec[n] - vec[n - 2]) + proc(vec, n - 2);
int a = abs(vec[n] - vec[n - 1]) + proc(vec, n - 1);
int r = min(a, b);
m[n] = r;
return r;
}
int main(void) {
int n;
cin >> n;
vector<int> vec;
// vec.resize(n);
m.resize(n);
for (size_t i = 0; i < n; ++i) {
int tmp;
cin >> tmp;
vec.push_back(tmp);
}
// int r = proc(vec, n-1);
for (size_t i = 1; i < n; ++i) {
if (i == 1) {
m[i] = abs(vec[1] - vec[0]);
continue;
}
int a = abs(vec[i] - vec[i - 1]) + m[i - 1];
int b = abs(vec[i] - vec[i - 2]) + m[i - 2];
m[i] = min(a, b);
}
cout << m[n - 1] << endl;
return 0;
}
| [] | 954,812 | 954,813 | u624521609 | 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 cost[n - 1] = {};
cost[n - 2] = abs(arr[n - 1] - arr[n - 2]);
for (int i = n - 3; i >= 0; i--) {
cost[i] = min(cost[i + 1] + abs(arr[i] - arr[i + 1]),
cost[i + 2] + abs(arr[i + 2] - arr[i]));
}
cout << cost[0] << endl;
} | #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 cost[1000000] = {-1};
cost[n - 2] = abs(arr[n - 1] - arr[n - 2]);
for (int i = n - 3; i >= 0; i--) {
cost[i] = min(cost[i + 1] + abs(arr[i] - arr[i + 1]),
cost[i + 2] + abs(arr[i + 2] - arr[i]));
}
cout << cost[0] << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 954,818 | 954,819 | u577996588 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[idx + 2]));
return dp[idx];
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i <= n; i++)
dp[i] = -1;
cout << cal(1);
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 1e9;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[idx + 2]));
return dp[idx];
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i <= n; i++)
dp[i] = -1;
cout << cal(1);
}
| [
"literal.number.change",
"function.return_value.change"
] | 954,829 | 954,830 | u848964569 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return -1000000000;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[idx + 2]));
return dp[idx];
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i <= n; i++)
dp[i] = -1;
cout << cal(1);
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 1e9;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[idx + 2]));
return dp[idx];
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i <= n; i++)
dp[i] = -1;
cout << cal(1);
}
| [
"literal.number.change",
"function.return_value.change"
] | 954,831 | 954,830 | u848964569 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int best[100005];
int a[100005];
for (i = 0; i < n; i++) {
cin >> a[i];
}
// best[i]=best option to reach ith stone
best[0] = 0; // standing on 1st stone
best[1] = abs(a[1] - a[0]);
for (i = 2; i <= n - 1; i++) {
best[i] = max((abs(a[i] - a[i - 2]) + best[i - 2]),
(best[i - 1] + abs(a[i] - a[i - 1])));
// cout<<best[i];
}
cout << best[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int best[100005];
int a[100005];
for (i = 0; i < n; i++) {
cin >> a[i];
}
// best[i]=best option to reach ith stone
best[0] = 0; // standing on 1st stone
best[1] = abs(a[1] - a[0]);
for (i = 2; i <= n - 1; i++) {
best[i] = min((abs(a[i] - a[i - 2]) + best[i - 2]),
(best[i - 1] + abs(a[i] - a[i - 1])));
// cout<<best[i];
}
cout << best[n - 1];
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,834 | 954,835 | u034797454 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> dp(N);
vector<int> h(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = h[1] - h[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]));
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> dp(N);
vector<int> h(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[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]));
}
cout << dp[N - 1] << endl;
}
| [
"call.add",
"call.arguments.change"
] | 954,838 | 954,839 | u737254528 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n;
cin >> n;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
b[1] = abs(b[1] - b[0]);
for (int i = 2; i < n; i++) {
b[i] = min((b[i - 1] + abs(a[i - 1] - a[i])),
(b[i - 2] + abs(a[i - 2] - a[i])));
}
cout << b[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n;
cin >> n;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
b[i] = min((b[i - 1] + abs(a[i - 1] - a[i])),
(b[i - 2] + abs(a[i - 2] - a[i])));
}
cout << b[n - 1] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,844 | 954,845 | u372392968 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define ld long double
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n, i, j, k = 0;
cin >> n;
vector<ll> v(n);
for (i = 0; i < n; i++)
cin >> v[i];
j = v[0];
k = abs(v[1] - v[0]);
for (i = 2; i < n; i++) {
ll temp = k;
k = min(k + abs(v[i] - v[i - 1]), j + abs(v[i] - v[i - 2]));
j = temp;
}
cout << k;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define ld long double
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n, i, j, k = 0;
cin >> n;
vector<ll> v(n);
for (i = 0; i < n; i++)
cin >> v[i];
j = 0;
k = abs(v[1] - v[0]);
for (i = 2; i < n; i++) {
ll temp = k;
k = min(k + abs(v[i] - v[i - 1]), j + abs(v[i] - v[i - 2]));
j = temp;
}
cout << k;
}
} | [] | 954,846 | 954,847 | u882466751 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define endl "\n"
#define vvi vector<vector<int>>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i >= b; i--)
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define init(i, k) memset(i, k, sizeof i)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 1e5 + 5, MOD = 1e9 + 7;
int a[N];
//---------------------------------------------------------------
void solve() {
int n, x = 0, y = 0, z = 0;
cin >> n;
rep(i, 0, n) { cin >> a[i]; }
x = 0;
y = abs(a[1] - a[0]);
rep(i, 2, n) {
z = min(x + abs(a[i] - a[i - 2]), y + abs(a[i] - a[i - 1]));
x = y;
y = z;
}
cout << z << endl;
}
signed main() {
speed;
// int t; cin >> t;
// rep(tt,1,t+1)
// {
// cout <<"Case #"<<tt<<": ";
solve();
// }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define endl "\n"
#define vvi vector<vector<int>>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i >= b; i--)
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define init(i, k) memset(i, k, sizeof i)
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 1e5 + 5, MOD = 1e9 + 7;
int a[N];
//---------------------------------------------------------------
void solve() {
int n, x = 0, y = 0, z = 0;
cin >> n;
rep(i, 0, n) { cin >> a[i]; }
x = 0;
y = abs(a[1] - a[0]);
z = y;
rep(i, 2, n) {
z = min(x + abs(a[i] - a[i - 2]), y + abs(a[i] - a[i - 1]));
x = y;
y = z;
}
cout << z << endl;
}
signed main() {
speed;
// int t; cin >> t;
// rep(tt,1,t+1)
// {
// cout <<"Case #"<<tt<<": ";
solve();
// }
return 0;
} | [
"assignment.add"
] | 954,861 | 954,862 | u255380940 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#define msi map<string, int>
#define vi vector<int>
#define vl vector<ll>
#define MOD 1000000007
#define INF 1e9
#define showVector(v) \
rep(i, 0, v.size()) { \
p(v[i]); \
p(" ") \
} \
pl("")
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
using namespace std;
// 素数判定 O(√n)
bool is_prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
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() {
ll h[110000];
ll dp[110000];
int N;
cin >> N;
rep(i, 0, N) { cin >> h[i]; }
rep(i, 0, 110000) { dp[i] = INF; }
dp[0] = 0;
rep(i, 0, N) {
dp[i + 1] = min(dp[i] + abs(h[i] - h[i - 1]), dp[i + 1]);
dp[i + 2] = min(dp[i] + abs(h[i - 2] - h[i]), dp[i + 2]);
}
cout << dp[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#define msi map<string, int>
#define vi vector<int>
#define vl vector<ll>
#define MOD 1000000007
#define INF 1e9
#define showVector(v) \
rep(i, 0, v.size()) { \
p(v[i]); \
p(" ") \
} \
pl("")
#define p(s) std::cout << s;
#define pl(s) std::cout << s << endl;
using namespace std;
// 素数判定 O(√n)
bool is_prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
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() {
ll h[110000];
ll dp[110000];
int N;
cin >> N;
rep(i, 0, N) { cin >> h[i]; }
rep(i, 0, 110000) { dp[i] = INF; }
dp[0] = 0;
rep(i, 0, N) {
dp[i + 1] = min(dp[i] + abs(h[i + 1] - h[i]), dp[i + 1]);
dp[i + 2] = min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 2]);
}
cout << dp[N - 1] << endl;
return 0;
} | [
"assignment.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,863 | 954,864 | u452512115 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
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;
}
vector<int> vec;
int N, H[101010], dp[101010];
int main() {
string s;
int N;
cin >> N;
rep(i, 0, N) cin >> H[i];
rep(i, 0, N) dp[i] = -1;
dp[0] = 0;
rep(i, 0, N) {
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;
return 0;
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
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;
}
vector<int> vec;
int N, H[101010], dp[101010];
int main() {
int N;
cin >> N;
rep(i, 0, N) cin >> H[i];
rep(i, 0, N) dp[i] = 1000000000;
dp[0] = 0;
rep(i, 0, N) {
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;
return 0;
} | [
"variable_declaration.remove",
"literal.number.change",
"assignment.value.change"
] | 954,865 | 954,866 | u452512115 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
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;
}
vector<int> vec;
int N, H[101010], dp[101010];
int main() {
string s;
int N;
cin >> N;
rep(i, 0, N) cin >> H[i];
rep(i, 0, N) dp[i] = 1000000;
dp[0] = 0;
rep(i, 0, N) {
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;
return 0;
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
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;
}
vector<int> vec;
int N, H[101010], dp[101010];
int main() {
int N;
cin >> N;
rep(i, 0, N) cin >> H[i];
rep(i, 0, N) dp[i] = 1000000000;
dp[0] = 0;
rep(i, 0, N) {
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;
return 0;
} | [
"variable_declaration.remove",
"literal.number.change",
"assignment.value.change"
] | 954,867 | 954,866 | u452512115 | cpp |
p03160 | #include <iostream>
#define INF 1000000
using namespace std;
int n;
int tab[1000000];
int dp[1000000];
int main() {
cin >> n;
for (int i = 1; i < n + 5; i++) {
dp[i] = INF;
}
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
// cout<<dp[10];
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(tab[i] - tab[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(tab[i] - tab[i + 2]));
}
cout << dp[n - 1];
}
| #include <iostream>
#define INF 1e9 + 5
using namespace std;
int n;
int tab[1000000];
int dp[1000000];
int main() {
cin >> n;
for (int i = 1; i < n + 5; i++) {
dp[i] = INF;
}
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
// cout<<dp[10];
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(tab[i] - tab[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(tab[i] - tab[i + 2]));
}
cout << dp[n - 1];
}
| [
"preprocessor.define.value.change",
"literal.float.change"
] | 954,871 | 954,872 | u722772027 | cpp |
p03160 | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define f first
#define s second
#define sz(x) int(x.size())
#define endl '\n'
#define forn(i, n) for (int i = 0; i < n; ++i)
#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
#define rep(i, begin, end) for (__typeof(end) i = (begin); i != (end); i++)
#define fill(a, value) memset(a, value, sizeof(a));
#define SIZE 26
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const int N = 1e5 + 5;
int h[N], dp[N];
signed main() {
fastio;
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
}
dp[2] = abs(h[2] - h[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n];
return 0;
} | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>--------------------
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define f first
#define s second
#define sz(x) int(x.size())
#define endl '\n'
#define forn(i, n) for (int i = 0; i < n; ++i)
#define fore(i, l, r) for (int i = int(l); i <= int(r); ++i)
#define rep(i, begin, end) for (__typeof(end) i = (begin); i != (end); i++)
#define fill(a, value) memset(a, value, sizeof(a));
#define SIZE 26
#define watch(x) cout << (#x) << " is " << (x) << endl
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
const int N = 1e5 + 5;
int h[N], dp[N];
signed main() {
fastio;
int i, n;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> h[i];
}
dp[2] = abs(h[2] - h[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"assignment.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"
] | 954,873 | 954,874 | u584242364 | cpp |
p03160 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N), dp(N, 1 << 100);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N), dp(N, 1000000000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 954,878 | 954,879 | u569272329 | 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] = a[1] - a[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n - 1];
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[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n - 1];
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 954,881 | 954,882 | u539823537 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int jump[n];
for (int i = 0; i < n; i++)
cin >> jump[i];
int dp[n][3];
dp[0][1] = abs(jump[0] - jump[1]);
if (n > 2)
dp[0][2] = abs(jump[0] - jump[2]);
for (int i = 1; i < n - 1; i++) {
dp[i][i + 1] =
min((dp[i - 1][1] + abs(jump[i] - jump[i + 1])), dp[i - 1][2]);
if (i + 2 < n)
dp[i][i + 2] = dp[i - 1][1] + abs(jump[i] - jump[i + 2]);
}
cout << dp[n - 2][2] << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int jump[n];
for (int i = 0; i < n; i++)
cin >> jump[i];
int dp[n][3];
dp[0][1] = abs(jump[0] - jump[1]);
if (n > 2)
dp[0][2] = abs(jump[0] - jump[2]);
for (int i = 1; i < n - 1; i++) {
dp[i][1] = min((dp[i - 1][1] + abs(jump[i] - jump[i + 1])), dp[i - 1][2]);
if (i + 2 < n)
dp[i][2] = dp[i - 1][1] + abs(jump[i] - jump[i + 2]);
}
cout << dp[n - 2][1] << endl;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 954,883 | 954,884 | u769880428 | cpp |
p03160 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))
// container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))
// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
// constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};
//
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
struct Accelerate_Cin {
Accelerate_Cin() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
};
int N;
int h[101010];
signed main() {
cin >> N;
vector<int> dp(N, INF);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 1; i <= N; i++) {
if (i + 1 <= N)
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 <= N)
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N] << endl;
return 0;
}
| #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))
// container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))
// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
// constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};
//
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
struct Accelerate_Cin {
Accelerate_Cin() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
};
int N;
int h[101010];
signed main() {
cin >> N;
vector<int> dp(N + 100, INF);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 1; i <= N; i++) {
if (i + 1 <= N)
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i + 2 <= N)
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N] << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 954,885 | 954,886 | u876978301 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
if (i == 1)
mn[i] = abs(wt[i] - wt[i - 1]);
else
mn[i] = min(abs(wt[i] - wt[i - 1]) + mn[i - 1],
abs(wt[i] - wt[i - 2]) + mn[i - 2]);
}
cout << mn[n - 1];
return 0;
} | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
else if (i == 1)
mn[i] = abs(wt[i] - wt[i - 1]);
else
mn[i] = min(abs(wt[i] - wt[i - 1]) + mn[i - 1],
abs(wt[i] - wt[i - 2]) + mn[i - 2]);
}
cout << mn[n - 1];
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 954,893 | 954,894 | u850402770 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
if (i == 1)
mn[i] = abs(wt[i] - wt[i - 1]);
mn[i] = min(abs(wt[i] - wt[i - 1]) + mn[i - 1],
abs(wt[i] - wt[i - 2]) + mn[i - 2]);
}
cout << mn[n - 1];
return 0;
} | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
else if (i == 1)
mn[i] = abs(wt[i] - wt[i - 1]);
else
mn[i] = min(abs(wt[i] - wt[i - 1]) + mn[i - 1],
abs(wt[i] - wt[i - 2]) + mn[i - 2]);
}
cout << mn[n - 1];
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,895 | 954,894 | u850402770 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
if (i == 1)
mn[i] = abs(wt[i] - wt[i - 1]);
mn[i] = min(abs(wt[i] - wt[i - 1]) + mn[i - 1],
abs(wt[i] - wt[i - 2]) + mn[i - 2]);
}
cout << mn[n - 1];
return 0;
} | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
else if (i == 1)
mn[i] = abs(wt[i] - wt[i - 1]);
else
mn[i] = min(abs(wt[i] - wt[i - 1]) + mn[i - 1],
abs(wt[i] - wt[i - 2]) + mn[i - 2]);
}
cout << mn[n - 1];
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,896 | 954,894 | u850402770 | cpp |
p03160 | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long int
using namespace std;
// vec.back()
main() {
ll n;
cin >> n;
ll he[n] = {0};
ll dp[n] = {0};
for (ll i = 0; i < n; ++i) {
cin >> he[i];
if (i > 1) {
dp[i] = min((dp[i - 2] + abs(he[i - 2] - he[i])),
(dp[i - 1] + abs(he[i - 1] - he[i])));
} else if (i == 1)
dp[1] = he[1] - he[0];
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long int
using namespace std;
// vec.back()
main() {
ll n;
cin >> n;
ll he[n] = {0};
ll dp[n] = {0};
for (ll i = 0; i < n; ++i) {
cin >> he[i];
if (i > 1) {
dp[i] = min((dp[i - 2] + abs(he[i - 2] - he[i])),
(dp[i - 1] + abs(he[i - 1] - he[i])));
} else if (i == 1)
dp[1] = abs(he[1] - he[0]);
}
cout << dp[n - 1];
} | [
"call.add",
"call.arguments.change"
] | 954,899 | 954,900 | u645279491 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
using namespace std;
int min(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1];
return 0;
} | #include <cstdlib>
#include <iostream>
using namespace std;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1];
return 0;
}
| [
"control_flow.return.add"
] | 954,905 | 954,906 | u445037732 | cpp |
p03160 | //@author : |< U $ |-|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define vi vector<long long>
#define pb push_back
#define pop pop_back
#define pi pair<long long, long long>
#define vp vector<pair<long long, long long>>
#define mkp make_pair
#define in(i, n) for (i = 0; i < n; i++)
#define fon(i, n, m) for (i = n; i < m; i++)
#define rfon(i, n, m) for (i = n; i >= m; i--)
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define jaldi \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define map map<long long, long long>
#define inm1(b) memset(b, -1, sizeof(b))
#define in0(b) memset(b, 0, sizeof(b))
#define ininf(b) memset(b, 1000000001, sizeof(b))
#define MOD 1000000007
#define I 10000000001
#define TakeInput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
jaldi
#ifndef ONLINE_JUDGE
TakeInput
#endif
ll n,
i, j, k;
cin >> n;
ll a[n];
in(i, n) { cin >> a[i]; }
ll dp[n];
in0(dp);
dp[1] = abs(a[1] - a[0]);
fon(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];
}
| //@author : |< U $ |-|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define vi vector<long long>
#define pb push_back
#define pop pop_back
#define pi pair<long long, long long>
#define vp vector<pair<long long, long long>>
#define mkp make_pair
#define in(i, n) for (i = 0; i < n; i++)
#define fon(i, n, m) for (i = n; i < m; i++)
#define rfon(i, n, m) for (i = n; i >= m; i--)
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define jaldi \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define map map<long long, long long>
#define inm1(b) memset(b, -1, sizeof(b))
#define in0(b) memset(b, 0, sizeof(b))
#define ininf(b) memset(b, 1000000001, sizeof(b))
#define MOD 1000000007
#define I 10000000001
#define TakeInput \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int main() {
jaldi
#ifndef _DEBUG
// TakeInput
#endif
ll n,
i, j, k;
cin >> n;
ll a[n];
in(i, n) { cin >> a[i]; }
ll dp[n];
in0(dp);
dp[1] = abs(a[1] - a[0]);
fon(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];
}
| [
"identifier.change"
] | 954,907 | 954,908 | u403552126 | cpp |
p03160 | #include "algorithm"
#include "cstring"
#include "ctime"
#include "iostream"
#include "map"
#include "math.h"
#include "numeric"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define f first
#define lgn 25
#define endl '\n'
#define sc second
#define N (int)2e5 + 5
#define pb push_back
#define mod 1000000007
#define ld long double
#define vi vector<int>
#define eb emplace_back
#define vpii vector<pii>
#define mii map<int, int>
#define int long long
#define pii pair<int, int>
#define pq priority_queue
#define test(x) while (x--)
#define all(x) begin(x), end(x)
#define allr(x) rbegin(x), rend(x)
#define fo(i, a, n) for (int i = a; i < n; i++)
#define rfo(i, n, a) for (int i = n; i >= a; i--)
#define db(x) cout << #x << " : " << x << endl;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define time() \
cerr << "Time : " << (double)clock() / (double)CLOCKS_PER_SEC << "s\n"
#define PI acos(-1.0)
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
OS;
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
inline void INP() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("ou.txt", "w", stdout);
#endif
}
const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
int n, m, k, q;
string s;
int vis[N], dp[N], h[N];
void go() {
cin >> n;
fo(i, 0, n) cin >> h[i];
memset(dp, 0x3f3f3f3f, sizeof dp);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
fo(i, 2, 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 - 1] << endl;
}
int32_t main() {
INP();
FAST;
int t = 1;
// cin>>t;
test(t) go();
}
| #include "algorithm"
#include "cstring"
#include "ctime"
#include "iostream"
#include "map"
#include "math.h"
#include "numeric"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define f first
#define lgn 25
#define endl '\n'
#define sc second
#define N (int)2e5 + 5
#define pb push_back
#define mod 1000000007
#define ld long double
#define vi vector<int>
#define eb emplace_back
#define vpii vector<pii>
#define mii map<int, int>
#define int long long
#define pii pair<int, int>
#define pq priority_queue
#define test(x) while (x--)
#define all(x) begin(x), end(x)
#define allr(x) rbegin(x), rend(x)
#define fo(i, a, n) for (int i = a; i < n; i++)
#define rfo(i, n, a) for (int i = n; i >= a; i--)
#define db(x) cout << #x << " : " << x << endl;
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define time() \
cerr << "Time : " << (double)clock() / (double)CLOCKS_PER_SEC << "s\n"
#define PI acos(-1.0)
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
OS;
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
inline void INP() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("ou.txt", "w", stdout);
#endif
}
const int inf = 0x3f3f3f3f;
const int INF = 0x3f3f3f3f3f3f3f3f;
int n, m, k, q;
string s;
int vis[N], dp[N], h[N];
void go() {
cin >> n;
fo(i, 0, n) cin >> h[i];
memset(dp, 0x3f3f3f3f, sizeof dp);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
fo(i, 2, 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 - 1] << endl;
}
int32_t main() {
// INP();
FAST;
int t = 1;
// cin>>t;
test(t) go();
}
| [
"call.remove"
] | 954,942 | 954,943 | u519398162 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], c[n], i;
for (i = 0; i < n; i++)
cin >> h[i];
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
c[i] =
max(abs(h[i] - h[i - 1]) + c[i - 1], abs(h[i] - h[i - 2]) + c[i - 2]);
}
cout << c[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], c[n], i;
for (i = 0; i < n; i++)
cin >> h[i];
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
c[i] =
min(abs(h[i] - h[i - 1]) + c[i - 1], abs(h[i] - h[i - 2]) + c[i - 2]);
}
cout << c[n - 1];
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,944 | 954,945 | u769493696 | cpp |
p03160 | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
typedef long long ll;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
using namespace std;
// using namespace __gnu_pbds;
// template<typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
const int INF = (int)1e10;
int n, h[100500], dp[100500];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int tt = 1;
while (tt--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
typedef long long ll;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
using namespace std;
// using namespace __gnu_pbds;
// template<typename T> using ordered_set = tree<T, null_type, less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
const int INF = (int)1e10;
int n, h[100500], dp[100500];
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int tt = 1;
while (tt--) {
solve();
}
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,946 | 954,947 | u815813121 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define mod 1000000007
#define pii pair<int, int>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define forn(i, s, e) for (int i = s; i <= e; i++)
#define fornd(i, s, e) for (int i = s; i >= e; i--)
#define autoit(x, it) for (auto it = x.begin(); it != x.end(); it++)
#define print(x) \
for (auto el : x) \
cout << el << " "; \
cout << "\n"
#define PSET(x, y) fixed << setprecision(y) << x
// #define bits(x) __builtin_popcount(x)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
void fileio() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
template <typename T> void swap(T &a, T &b) {
T temp = a;
a = b;
b = temp;
}
const int N = 1000001;
vector<int> h;
vector<int> dp;
int rec(int i) {
if (i == 0)
return 0;
if (i < 0)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
return dp[i] =
min((i - 1) >= 0 ? rec(i - 1) + abs(h[i] - h[i - 1]) : INT_MAX,
(i - 2) >= 0 ? rec(i - 2) + abs(h[i] - h[i - 2]) : INT_MAX);
}
void solve() {
int n;
cin >> n;
h = vector<int>(n);
dp = vector<int>(n, -1);
forn(i, 0, n - 1) cin >> h[i];
cout << rec(n - 1) << endl;
}
int32_t main() {
fileio();
fast;
// int t;
// cin>>t;
// for(int y=1;y<=t;y++)
{
// cout<<"Case #"<<y<<": ";
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define mod 1000000007
#define pii pair<int, int>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define forn(i, s, e) for (int i = s; i <= e; i++)
#define fornd(i, s, e) for (int i = s; i >= e; i--)
#define autoit(x, it) for (auto it = x.begin(); it != x.end(); it++)
#define print(x) \
for (auto el : x) \
cout << el << " "; \
cout << "\n"
#define PSET(x, y) fixed << setprecision(y) << x
// #define bits(x) __builtin_popcount(x)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
void fileio() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
template <typename T> void swap(T &a, T &b) {
T temp = a;
a = b;
b = temp;
}
const int N = 1000001;
vector<int> h;
vector<int> dp;
int rec(int i) {
if (i == 0)
return 0;
if (i < 0)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
return dp[i] =
min((i - 1) >= 0 ? rec(i - 1) + abs(h[i] - h[i - 1]) : INT_MAX,
(i - 2) >= 0 ? rec(i - 2) + abs(h[i] - h[i - 2]) : INT_MAX);
}
void solve() {
int n;
cin >> n;
h = vector<int>(n);
dp = vector<int>(n, -1);
forn(i, 0, n - 1) cin >> h[i];
cout << rec(n - 1) << endl;
}
int32_t main() {
fast;
// int t;
// cin>>t;
// for(int y=1;y<=t;y++)
{
// cout<<"Case #"<<y<<": ";
solve();
}
return 0;
} | [
"call.remove"
] | 954,956 | 954,957 | u809490696 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n + 3);
rep(i, n) cin >> h[i];
vector<int> dp(n + 3, 1000000);
// 0-index
dp[0] = 0;
for (int i = 0; i < n + 1; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
dunk(dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n + 3);
rep(i, n) cin >> h[i];
vector<int> dp(n + 3, 100000000000);
// 0-index
dp[0] = 0;
for (int i = 0; i < n + 1; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
dunk(dp[n - 1]);
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 954,960 | 954,961 | u274883254 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
// chMIN
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
ll dp[100099];
ll INF = 1e5;
rep(i, 100099) { dp[i] = INF; }
dp[0] = 0;
for (ll 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]));
}
}
dunk(dp[n - 1]);
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
// chMIN
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n;
cin >> n;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
ll dp[100099];
ll INF = 1e9;
rep(i, 100099) { dp[i] = INF; }
dp[0] = 0;
for (ll 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]));
}
}
dunk(dp[n - 1]);
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 954,962 | 954,963 | u454081619 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<string, int>> vpsi;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int P = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n;
cin >> n;
vi h(n);
vi dp(n + 1);
rep(i, n) cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i <= n; ++i) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
fin(dp[n]);
//////////////////////////////////////////////////////
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<string, int>> vpsi;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define STI(s) atoi(s.c_str())
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int P = 1000000007;
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
//////////////////////////////////////////////////////
int n;
cin >> n;
vi h(n);
vi dp(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
fin(dp[n - 1]);
//////////////////////////////////////////////////////
return 0;
} | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 954,965 | 954,966 | u228475480 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<ll> dp(n, 1 << 20);
vector<ll> h(n);
rep(i, n) cin >> h.at(i);
dp.at(0) = 0;
dp.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
chmin(dp.at(i), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(n - 1) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<ll> dp(n, 1ll << 60);
vector<ll> h(n);
rep(i, n) cin >> h.at(i);
dp.at(0) = 0;
dp.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
chmin(dp.at(i), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(n - 1) << endl;
}
| [
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 954,977 | 954,978 | u878024225 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 60;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
in n;
cin >> n;
vector<in> h(n);
rep(i, n) cin >> h.at(i);
vector<in> dp(n);
rep(i, n) dp.at(i) = INF;
dp.at(0) = 0;
dp.at(1) = abs(h.at(1) - h.at(0));
for (in i = 2; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
chmin(dp.at(i), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(n - 1);
}
| #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 30;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
in n;
cin >> n;
vector<in> h(n);
rep(i, n) cin >> h.at(i);
vector<in> dp(n);
rep(i, n) dp.at(i) = INF;
dp.at(0) = 0;
dp.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
chmin(dp.at(i), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(n - 1);
}
| [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 954,979 | 954,980 | u424602097 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 60;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
in n;
cin >> n;
vector<in> h(n);
rep(i, n) cin >> h.at(i);
vector<in> dp(n);
rep(i, n) dp.at(i) = INF;
dp.at(0) = 0;
dp.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
chmin(dp.at(i), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(n - 1);
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 30;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
int main() {
in n;
cin >> n;
vector<in> h(n);
rep(i, n) cin >> h.at(i);
vector<in> dp(n);
rep(i, n) dp.at(i) = INF;
dp.at(0) = 0;
dp.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
chmin(dp.at(i), dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
chmin(dp.at(i), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
cout << dp.at(n - 1);
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 954,981 | 954,980 | u424602097 | cpp |
p03160 | // frog1 problem
#include <iostream>
using namespace std;
int mini(int a, int b) {
if (a < b)
return a;
else
return b;
}
int modo(int a) {
if (a >= 0)
return a;
else
return -1 * a;
}
int main() {
int n;
cin >> n;
int array[n];
for (int i = 0; i < n; i++)
cin >> array[i];
int dp[n];
dp[0] = 0;
dp[1] = modo(array[1] - array[0]);
for (int i = 2; i < n; i++) {
dp[i] = mini((dp[i - 2] + modo(array[i] - array[i - 2])),
(dp[i - 1] + modo(array[i] - array[i - 1])));
cout << dp[i];
}
}
| // frog1 problem
#include <iostream>
using namespace std;
int mini(int a, int b) {
if (a < b)
return a;
else
return b;
}
int modo(int a) {
if (a >= 0)
return a;
else
return -1 * a;
}
int main() {
int n;
cin >> n;
int array[n];
for (int i = 0; i < n; i++)
cin >> array[i];
int dp[n];
dp[0] = 0;
dp[1] = modo(array[1] - array[0]);
for (int i = 2; i < n; i++) {
dp[i] = mini((dp[i - 2] + modo(array[i] - array[i - 2])),
(dp[i - 1] + modo(array[i] - array[i - 1])));
}
cout << dp[n - 1];
}
| [
"variable_access.subscript.index.change",
"io.output.change"
] | 954,984 | 954,985 | u478964347 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j; i < k; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define foreach(i, a) for (auto i : a)
#define forEach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(A, B, C) assert(B <= A && A <= C)
#define mp make_pair
#define pb push_back
#define endl "\n"
#define inf (int)(1e9 + 7)
#define epsi 1e-9
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define read(type) readInt<type>()
#define io \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define left tuyiuoi
#define right fgjhk
#define ss second
#define ff first
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) \
rep(i, l, r) cout << a[i] << " "; \
cout << endl
#define Flag(n) cout << "here " << n << endl
const double pi = acos(-1.0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<ll, ll> pll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef map<int, int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int main() {
io;
ll n;
cin >> n;
ll arr[n + 1] = {0};
rep(i, 1, n + 1) cin >> arr[i];
ll dp[n + 1] = {0};
dp[1] = abs(arr[1] - arr[0]);
rep(i, 2, n + 1) {
dp[i] = min(abs(arr[i] - arr[i - 2]) + dp[i - 2],
dp[i - 1] + abs(arr[i] - arr[i - 1]));
}
// rep(i,1,n+1)
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j; i < k; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define foreach(i, a) for (auto i : a)
#define forEach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define in(A, B, C) assert(B <= A && A <= C)
#define mp make_pair
#define pb push_back
#define endl "\n"
#define inf (int)(1e9 + 7)
#define epsi 1e-9
#define PI 3.1415926535897932384626433832795
#define mod 1000000007
#define read(type) readInt<type>()
#define io \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define left tuyiuoi
#define right fgjhk
#define ss second
#define ff first
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) \
rep(i, l, r) cout << a[i] << " "; \
cout << endl
#define Flag(n) cout << "here " << n << endl
const double pi = acos(-1.0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<ll, ll> pll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef map<int, int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int main() {
io;
ll n;
cin >> n;
ll arr[n + 1] = {0};
rep(i, 1, n + 1) cin >> arr[i];
ll dp[n + 1] = {0};
dp[2] = abs(arr[2] - arr[1]);
rep(i, 3, n + 1) {
dp[i] = min(abs(arr[i] - arr[i - 2]) + dp[i - 2],
dp[i - 1] + abs(arr[i] - arr[i - 1]));
}
// rep(i,1,n+1)
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,986 | 954,987 | u242049402 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define el_cucuy \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
#define pii pair<int, int>
#define f first
#define s second
const llong mxn = 4 * 1e5 + 3;
const llong mod = 1e9 + 7;
const llong inf = 1e18 + 9;
using namespace std;
// int dx[]= {1,0,-1,0}; int dy[]= {0,1,0,-1}; //4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1}; int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
// int dx[]={2,1,-1,-2,-2,-1,1,2}; int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight
// Direction int dx[]={-1,-1,+0,+1,+1,+0}; int dy[]={-1,+1,+2,+1,-1,-2};
// //Hexagonal Direction
llong q, n, m, a[mxn], dp[mxn];
int main() {
/// freopen("input.txt", "r", stdin);
/// freopen("output.txt", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(abs(a[i - 1] - a[i]) + dp[i - 1], abs(a[i - 2] - a[i]) + dp[i - 2]);
}
cout << dp[n];
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define el_cucuy \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
#define pii pair<int, int>
#define f first
#define s second
const llong mxn = 4 * 1e5 + 3;
const llong mod = 1e9 + 7;
const llong inf = 1e18 + 9;
using namespace std;
// int dx[]= {1,0,-1,0}; int dy[]= {0,1,0,-1}; //4 Direction
// int dx[]={1,1,0,-1,-1,-1,0,1}; int dy[]={0,1,1,1,0,-1,-1,-1};//8 direction
// int dx[]={2,1,-1,-2,-2,-1,1,2}; int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight
// Direction int dx[]={-1,-1,+0,+1,+1,+0}; int dy[]={-1,+1,+2,+1,-1,-2};
// //Hexagonal Direction
llong q, n, m, a[mxn], dp[mxn];
int main() {
/// freopen("input.txt", "r", stdin);
/// freopen("output.txt", "w", stdout);
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(abs(a[i - 1] - a[i]) + dp[i - 1], abs(a[i - 2] - a[i]) + dp[i - 2]);
}
cout << dp[n];
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 954,994 | 954,995 | u122292453 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[n], dp[n];
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
dp[1] = 0;
dp[2] = 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;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, h[100010], dp[100010];
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
dp[1] = 0;
dp[2] = 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;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 954,996 | 954,997 | u867806614 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define fop(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
ll dp[1000001];
ll h[2000001];
ll dpp(ll n) {
if (dp[n] != -1)
return dp[n];
dp[n] =
min(abs(h[n] - h[n - 1]) + dpp(n - 1), abs(h[n] - h[n - 2]) + dpp(n - 2));
return dp[n];
}
int main() {
ll t;
cin >> t;
fop(i, 0, t) cin >> h[i];
fop(i, 0, 1000000) dp[i] = 0;
dp[1] = abs(h[1] - h[0]);
dp[2] = abs(h[2] - h[0]);
cout << dpp(t - 1) << endl;
}
| #include <bits/stdc++.h>
#define ll long long
#define fop(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
ll dp[1000001];
ll h[2000001];
ll dpp(ll n) {
if (dp[n] != -1)
return dp[n];
dp[n] =
min(abs(h[n] - h[n - 1]) + dpp(n - 1), abs(h[n] - h[n - 2]) + dpp(n - 2));
return dp[n];
}
int main() {
ll t;
cin >> t;
fop(i, 0, t) cin >> h[i];
fop(i, 0, 1000000) dp[i] = -1;
dp[1] = abs(h[1] - h[0]);
dp[2] = abs(h[2] - h[0]);
cout << dpp(t - 1) << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 954,998 | 954,999 | u494192771 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec;
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
if (j > 2)
dp[j] = min(dp[j - 1] + abs(vec[j - 1] - vec[j - 2]),
dp[j - 2] + abs(vec[j - 1] - vec[j - 3]));
else
dp[j] = dp[j - 1] + abs(vec[j - 1] - vec[j - 2]);
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
if (j > 2)
dp[j] = min(dp[j - 1] + abs(vec[j - 1] - vec[j - 2]),
dp[j - 2] + abs(vec[j - 1] - vec[j - 3]));
else
dp[j] = dp[j - 1] + abs(vec[j - 1] - vec[j - 2]);
}
cout << dp[n] << endl;
} | [] | 955,002 | 955,003 | u694116078 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = (1LL << 60);
int chmin(ll x, int y) {
if (x > y)
return y;
return x;
}
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<ll> dp(100010, INF);
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
dp.at(i) = chmin(dp.at(i), v.at(i - 1) + abs(v.at(i) - v.at(i - 1)));
if (i != 1)
dp.at(i) = chmin(dp.at(i), v.at(i - 2) + abs(v.at(i) - v.at(i - 2)));
}
cout << dp.at(N - 1) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = (1LL << 60);
int chmin(ll x, int y) {
if (x > y)
return y;
return x;
}
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<ll> dp(100010, INF);
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
dp.at(i) = chmin(dp.at(i), dp.at(i - 1) + abs(v.at(i) - v.at(i - 1)));
if (i != 1)
dp.at(i) = chmin(dp.at(i), dp.at(i - 2) + abs(v.at(i) - v.at(i - 2)));
}
cout << dp.at(N - 1) << "\n";
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,008 | 955,009 | u086063386 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> height(n);
rep(i, n) cin >> height.at(i);
ll cost[n];
cost[0] = 0;
cost[1] = height.at(1) - height.at(0);
for (int now = 2; now < n; now++) {
cost[now] = min(abs(height[now] - height[now - 1]) + cost[now - 1],
abs(height[now] - height[now - 2]) + cost[now - 2]);
}
cout << cost[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define rep2(i, begin_i, end_i) for (ll i = (ll)begin_i; i < (ll)end_i; i++)
long long INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> height(n);
rep(i, n) cin >> height.at(i);
ll cost[n];
cost[0] = 0;
cost[1] = abs(height.at(1) - height.at(0));
for (int now = 2; now < n; now++) {
cost[now] = min(abs(height[now] - height[now - 1]) + cost[now - 1],
abs(height[now] - height[now - 2]) + cost[now - 2]);
}
cout << cost[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 955,010 | 955,011 | u410506856 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define Add_Speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define ins insert
#define pb push_back
#define pf push_front
#define mp make_pair
#define f first
#define sz size()
#define s second
#define all(s) s.begin(), s.end()
#define file(s) \
freopen(s ".in", "r", stdin); \
freopen(s ".out", "w", stdout);
#define inf (int)1e9
#define gcd(a, b) __gcd(a, b)
//#define int ll
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
const int maxn = (int)1e5 + 17;
const int maxm = (int)15e2 + 7;
const int minn = (int)1e3 + 7;
const int mod = (int)1e9 + 7;
const long double PI = acos(-1);
const int P = (int)1e5 + 7;
int n, dp[maxn], a[maxn];
int main() {
Add_Speed
cin >>
n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
#define ll long long
#define Add_Speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define ins insert
#define pb push_back
#define pf push_front
#define mp make_pair
#define f first
#define sz size()
#define s second
#define all(s) s.begin(), s.end()
#define file(s) \
freopen(s ".in", "r", stdin); \
freopen(s ".out", "w", stdout);
#define inf (int)1e9
#define gcd(a, b) __gcd(a, b)
//#define int ll
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
const int maxn = (int)1e5 + 17;
const int maxm = (int)15e2 + 7;
const int minn = (int)1e3 + 7;
const int mod = (int)1e9 + 7;
const long double PI = acos(-1);
const int P = (int)1e5 + 7;
int n, dp[maxn], a[maxn];
int main() {
Add_Speed
cin >>
n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n];
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,012 | 955,013 | u122777146 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> h(n);
vector<long long> dp(n, 1e18);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + 2 and j < n; ++j) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> h(n);
vector<long long> dp(n, 1e18);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + 2 and j < n; ++j) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1];
return 0;
} | [
"expression.operation.binary.remove"
] | 955,014 | 955,015 | u759497274 | cpp |
p03160 | // Vivek Rai
// Blazer_007
#include <bits/stdc++.h>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mp(i, j) make_pair(i, j)
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define loop(i, a, b) for (int i = a; i < b; i++)
using namespace std;
void solution() {
int n;
cin >> n;
vi h(n);
loop(i, 0, n) cin >> h[i];
vi dp(n);
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
loop(i, 2, 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 - 1] << endl;
}
signed main() {
fastio;
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<":";
solution();
}
return 0;
}
| // Vivek Rai
// Blazer_007
#include <bits/stdc++.h>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mp(i, j) make_pair(i, j)
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define loop(i, a, b) for (int i = a; i < b; i++)
using namespace std;
void solution() {
int n;
cin >> n;
vi h(n);
loop(i, 0, n) cin >> h[i];
vi dp(n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
loop(i, 2, 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 - 1] << endl;
}
signed main() {
fastio;
int t = 1;
// cin>>t;
for (int i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<":";
solution();
}
return 0;
}
| [] | 955,022 | 955,023 | u956259660 | cpp |
p03160 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
rep(i, n) cin >> h.at(i);
vector<int> dp(n, 0);
dp.at(1) = h.at(1) - h.at(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 - 1) << endl;
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
rep(i, n) cin >> h.at(i);
vector<int> dp(n, 0);
dp.at(1) = abs(h.at(1) - h.at(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 - 1) << endl;
// rep(i,n) cout << i << " " << dp.at(i) << endl;
} | [
"call.add",
"call.arguments.change"
] | 955,024 | 955,025 | u628597699 | cpp |
p03160 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define srep(i, s, t) for (int i = (s); i < (t); ++i)
#define rng(obj) (obj).begin(), (obj).end()
#define maxs(x, y) (x = max((x), (y)))
#define mins(x, y) (x = min((x), (y)))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vp = vector<P>;
inline int in() {
int x;
cin >> x;
return x;
}
template <class T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <class T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <class T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <class T1, class T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <class T1, class T2>
inline ostream &operator<<(ostream &o, pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <class T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const double eps = 1e-10;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
#define fileio \
ifstream fio; \
if (argc > 0) { \
fio.open(argv[1]); \
std::cin.rdbuf(fio.rdbuf()); \
}
//----------------------------------------------------------------
int main(int argc, char *argv[]) {
fileio vi dp(MX, INF);
int n = in();
vi h(n);
cin >> h;
h.pb(INF);
h.pb(INF);
dp[0] = 0;
rep(i, n) {
mins(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
mins(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define srep(i, s, t) for (int i = (s); i < (t); ++i)
#define rng(obj) (obj).begin(), (obj).end()
#define maxs(x, y) (x = max((x), (y)))
#define mins(x, y) (x = min((x), (y)))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vp = vector<P>;
inline int in() {
int x;
cin >> x;
return x;
}
template <class T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <class T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <class T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <class T1, class T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <class T1, class T2>
inline ostream &operator<<(ostream &o, pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <class T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const double eps = 1e-10;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
#define fileio \
ifstream fio; \
if (argc >= 2) { \
fio.open(argv[1]); \
std::cin.rdbuf(fio.rdbuf()); \
}
//----------------------------------------------------------------
int main(int argc, char *argv[]) {
fileio vi dp(MX, INF);
int n = in();
vi h(n);
cin >> h;
h.pb(INF);
h.pb(INF);
dp[0] = 0;
rep(i, n) {
mins(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
mins(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
} | [] | 955,026 | 955,027 | u954176652 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int dp[1000000];
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 999999999999999;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (dp[i] > dp[i - 1] + llabs(a[i] - a[i - 1])) {
dp[i] = dp[i - 1] + llabs(a[i] - a[i - 1]);
}
if (i > 1) {
if (dp[i] > dp[i - 2] + llabs(a[i] - a[i - 2])) {
dp[i] = dp[i - 2] + llabs(a[i] - a[i - 2]);
}
}
}
cout << dp[n - 1] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
long long dp[1000000];
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 100000000000;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (dp[i] > dp[i - 1] + llabs(a[i] - a[i - 1])) {
dp[i] = dp[i - 1] + llabs(a[i] - a[i - 1]);
}
if (i > 1) {
if (dp[i] > dp[i - 2] + llabs(a[i] - a[i - 2])) {
dp[i] = dp[i - 2] + llabs(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"
] | 955,032 | 955,033 | u001858868 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
int h[100005];
int c[100005];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
c[1] = 0;
c[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++) {
c[i] = min(c[i - 1] + abs(h[i] - h[i - 1]), c[i - 2] + abs(h[i - 2]));
}
cout << c[N] << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int h[100005];
int c[100005];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
c[1] = 0;
c[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++) {
c[i] =
min(c[i - 1] + abs(h[i] - h[i - 1]), c[i - 2] + abs(h[i] - h[i - 2]));
}
cout << c[N] << endl;
return 0;
} | [
"assignment.change"
] | 955,048 | 955,049 | u836724424 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i, l, r) for (int i = (l); i < (r); i++)
#define forb(i, r, l) for (int i = (r); i > (l); i--)
#define sqr(x) (x) * (x)
#define log2i(x) 32 - __builtin_clz((x)) - 1
#define log2l(x) 64 - __builtin_clzll((x)) - 1
#define inf1 int(1e9 + 7)
#define inf2 0x3f3f3f3f
#define infll ll(1e18 + 7)
#define Pi acos(-1.0)
#define mu(x, y) trunc(exp(log((x)) * (y)))
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
const int N = 1e5 + 7;
int n;
int dp[N] = {0}, h[N] = {0};
int main() {
fastIO;
// freopen("test.inp","r",stdin);
// freopen(".out","w",stdout);
cin >> n;
forw(i, 1, n + 1) {
cin >> h[i];
if (i == 1)
dp[i] = 0;
else
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n];
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i, l, r) for (int i = (l); i < (r); i++)
#define forb(i, r, l) for (int i = (r); i > (l); i--)
#define sqr(x) (x) * (x)
#define log2i(x) 32 - __builtin_clz((x)) - 1
#define log2l(x) 64 - __builtin_clzll((x)) - 1
#define inf1 int(1e9 + 7)
#define inf2 0x3f3f3f3f
#define infll ll(1e18 + 7)
#define Pi acos(-1.0)
#define mu(x, y) trunc(exp(log((x)) * (y)))
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
const int N = 1e5 + 7;
int n;
int dp[N] = {0}, h[N] = {-inf1};
int main() {
fastIO;
// freopen("test.inp","r",stdin);
// freopen(".out","w",stdout);
cin >> n;
forw(i, 1, n + 1) {
cin >> h[i];
if (i == 1)
dp[i] = 0;
else
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n];
return 0;
}
| [
"expression.operation.unary.add"
] | 955,050 | 955,051 | u804262131 | cpp |
p03160 | // g++ -std=c++11 -Wall t.cpp -o test -lm -g
#include <bits/stdc++.h>
#define mod 1000000007
#define Pi 3.14159265358979311599796346854
#define INF 0x3f3f3f3f
#define MAX 400010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define sws \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define mdc(a, b) (__gcd((a), (b)))
#define mmc(a, b) (((a) / __gcd(a, b)) * b)
#define endl '\n'
#define teto(a, b) (a + b - 1) / b
#define ld long double
// for(int y : {i - k, i + k})
using namespace std;
int dp[100010];
int vet[100010];
int N;
int solve(int x) {
if (dp[x] != -1)
return dp[x];
if (x >= N)
return -1;
if (x == N - 1)
return 1;
int um = solve(x + 1);
int dois = solve(x + 2);
int val1 = abs(vet[x + 1] - vet[x]), val2 = abs(vet[x + 2] - vet[x]);
if (um == -1)
return dp[x] = val2 * dois;
if (dois == -1)
return dp[x] = val1 * um;
return dp[x] = min(val1 + um, val2 + dois);
}
int main() {
// sws;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
memset(dp, -1, sizeof(dp));
cin >> N;
for (int i = 0; i < N; i++)
cin >> vet[i];
cout << solve(0) << endl;
return 0;
} | // g++ -std=c++11 -Wall t.cpp -o test -lm -g
#include <bits/stdc++.h>
#define mod 1000000007
#define Pi 3.14159265358979311599796346854
#define INF 0x3f3f3f3f
#define MAX 400010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define sws \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define forn(i, n) for (int i = 0; i < (int)(n); i++)
#define mdc(a, b) (__gcd((a), (b)))
#define mmc(a, b) (((a) / __gcd(a, b)) * b)
#define endl '\n'
#define teto(a, b) (a + b - 1) / b
#define ld long double
// for(int y : {i - k, i + k})
using namespace std;
int dp[100010];
int vet[100010];
int N;
int solve(int x) {
if (dp[x] != -1)
return dp[x];
if (x >= N)
return -1;
if (x == N - 1)
return 0;
int um = solve(x + 1);
int dois = solve(x + 2);
int val1 = abs(vet[x + 1] - vet[x]), val2 = abs(vet[x + 2] - vet[x]);
if (um == -1)
return dp[x] = val2 + dois;
if (dois == -1)
return dp[x] = val1 + um;
return dp[x] = min(val1 + um, val2 + dois);
}
int main() {
// sws;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
memset(dp, -1, sizeof(dp));
cin >> N;
for (int i = 0; i < N; i++)
cin >> vet[i];
cout << solve(0) << endl;
return 0;
} | [
"literal.number.change",
"function.return_value.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 955,052 | 955,053 | u475175114 | cpp |
p03160 | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
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;
}
// LOVE NyantakoGG
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
vector<int> dp(N);
for (int i = 0; i < N; i++) {
dp[i] = INFINITY;
}
dp[0] = 0;
dp[1] = data[1] - data[0];
for (int i = 2; i < N; i++) {
chmin(dp[i], dp[i - 2] + abs(data[i - 2] - data[i]));
chmin(dp[i], dp[i - 1] + abs(data[i - 1] - data[i]));
}
cout << dp[N - 1] << endl;
}
| // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
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;
}
// LOVE NyantakoGG
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
vector<int> dp(N);
for (int i = 0; i < N; i++) {
dp[i] = INFINITY;
}
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < N; i++) {
chmin(dp[i], dp[i - 2] + abs(data[i - 2] - data[i]));
chmin(dp[i], dp[i - 1] + abs(data[i - 1] - data[i]));
}
cout << dp[N - 1] << endl;
}
| [
"call.add",
"call.arguments.change"
] | 955,060 | 955,061 | u685346012 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i;
cin >> n;
ll h[n], dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i;
cin >> n;
ll h[n], dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
| [] | 955,068 | 955,069 | u287619443 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
#define sf s.f
#define ss s.s
#define var auto
#define M int main()
#define For(itr, max) for (int itr = 0; itr <= max; itr++)
using namespace std;
template <typename T> using s = set<T>;
template <typename T> using v = vector<T>;
template <typename T1, typename T2> using p = pair<T1, T2>;
typedef p<int, int> pii;
typedef v<int> vi;
typedef v<pii> vpii;
typedef s<int> si;
typedef s<pii> spii;
typedef long long ll;
// const int Max = 1e8 + 10;
const int Mx = 1e5;
ll n, k;
ll H[Mx];
ll dp[Mx];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
dp[n - 1] = 0;
for (int i = n - 1; i--;) {
dp[i] = 1e18;
for (int j = 1; j <= k; j++) {
if (i + j == n)
break;
dp[i] = min(dp[i], dp[i + j] + abs(H[i] - H[i + j]));
}
}
cout << dp[0];
} | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
#define sf s.f
#define ss s.s
#define var auto
#define M int main()
#define For(itr, max) for (int itr = 0; itr <= max; itr++)
using namespace std;
template <typename T> using s = set<T>;
template <typename T> using v = vector<T>;
template <typename T1, typename T2> using p = pair<T1, T2>;
typedef p<int, int> pii;
typedef v<int> vi;
typedef v<pii> vpii;
typedef s<int> si;
typedef s<pii> spii;
typedef long long ll;
// const int Max = 1e8 + 10;
const int Mx = 1e5;
ll n, k;
ll H[Mx];
ll dp[Mx];
int main() {
cin >> n;
k = 2;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
dp[n - 1] = 0;
for (int i = n - 1; i--;) {
dp[i] = 1e18;
for (int j = 1; j <= k; j++) {
if (i + j == n)
break;
dp[i] = min(dp[i], dp[i + j] + abs(H[i] - H[i + j]));
}
}
cout << dp[0];
} | [
"expression.operation.binary.remove",
"assignment.add"
] | 955,075 | 955,076 | u979412452 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
int num[101];
int dp[101];
int main() {
memset(dp, 63, sizeof dp);
cin >> n;
for (int qq = 1; qq <= n; qq++)
cin >> num[qq];
dp[1] = 0;
dp[2] = abs(num[1] - num[2]);
for (int qq = 3; qq <= n; qq++) {
dp[qq] = min(abs(num[qq - 2] - num[qq]) + dp[qq - 2],
abs(num[qq - 1] - num[qq]) + dp[qq - 1]);
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int num[100001];
int dp[100001];
int main() {
memset(dp, 63, sizeof dp);
cin >> n;
for (int qq = 1; qq <= n; qq++)
cin >> num[qq];
dp[1] = 0;
dp[2] = abs(num[1] - num[2]);
for (int qq = 3; qq <= n; qq++) {
dp[qq] = min(abs(num[qq - 2] - num[qq]) + dp[qq - 2],
abs(num[qq - 1] - num[qq]) + dp[qq - 1]);
}
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 955,090 | 955,091 | u391888742 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = ar[0];
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp[i - 1] + abs(ar[i] - ar[i - 1]));
}
cout << dp[n];
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp[i - 1] + abs(ar[i] - ar[i - 1]));
}
cout << dp[n - 1];
return 0;
} | [
"expression.operation.binary.add"
] | 955,092 | 955,093 | u774724188 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = ar[0];
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp[i - 1] + abs(ar[i] - ar[i - 1]));
}
cout << dp[n - 1];
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp[i - 1] + abs(ar[i] - ar[i - 1]));
}
cout << dp[n - 1];
return 0;
} | [] | 955,094 | 955,093 | u774724188 | cpp |
p03160 | #pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define se second
#define fi first
#define ss size()
#define pb push_back
#define mp make_pair
#define ins insert
#define ll long long
#define y1 y12313312312
#define endl '\n'
#define gcd __gcd
//#define int ll
using namespace std;
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, std::less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 40, T = 4 * N, inf = 1e9 + 7;
int n, m, f, r, l, e, w, o, z, test, id;
ll a[N], d[N];
void freop() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void boos() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
main() {
// freop();
boos();
cin >> n;
for (int i = 1; i < n; i++) {
cin >> a[i];
// cout << a[i] << " ";
}
// cout << endl;
d[0] = 0;
d[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
d[i] =
min(d[i - 1] + abs(a[i] - a[i - 1]), d[i - 2] + abs(a[i] - a[i - 2]));
// cout << d[i] << " ";
}
// cout << endl;
cout << d[n - 1];
}
| #pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define se second
#define fi first
#define ss size()
#define pb push_back
#define mp make_pair
#define ins insert
#define ll long long
#define y1 y12313312312
#define endl '\n'
#define gcd __gcd
//#define int ll
using namespace std;
// using namespace __gnu_pbds;
// template <typename T> using ordered_set = tree<T, null_type, std::less<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 40, T = 4 * N, inf = 1e9 + 7;
int n, m, f, r, l, e, w, o, z, test, id;
ll a[N], d[N];
void freop() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void boos() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
main() {
// freop();
boos();
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
// cout << a[i] << " ";
}
// cout << endl;
d[0] = 0;
d[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
d[i] =
min(d[i - 1] + abs(a[i] - a[i - 1]), d[i - 2] + abs(a[i] - a[i - 2]));
}
cout << d[n - 1];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,095 | 955,096 | u242818056 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n] = {0}, dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ll first = abs(arr[i - 1] - arr[i]) + dp[i - 1];
ll second = abs(arr[i - 1] - arr[i]) + dp[i - 2];
dp[i] = first < second ? first : second;
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n] = {0}, dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ll first = abs(arr[i - 1] - arr[i]) + dp[i - 1];
ll second = abs(arr[i - 2] - arr[i]) + dp[i - 2];
dp[i] = first <= second ? first : second;
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 955,107 | 955,108 | u091412362 | 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 + 1];
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 - 1] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << "\n";
} | #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 + 1];
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] << "\n";
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,109 | 955,110 | u803405081 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define INF 1e9 + 7
#define mp make_pair
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
typedef long long int lint;
typedef unsigned long long int ulint;
int main() {
int n;
cin >> n;
int arr[n + 10];
int dp[n + 10];
for (int i = 1; i < n + 1; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i < n + 1; 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 <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define INF 1e9 + 7
#define mp make_pair
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
typedef long long int lint;
typedef unsigned long long int ulint;
int main() {
int n;
cin >> n;
int arr[n + 10];
int dp[n + 10];
for (int i = 1; i < n + 1; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n + 1; 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;
} | [
"call.add",
"call.arguments.change"
] | 955,111 | 955,112 | u681511186 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, i;
cin >> N;
long long int arr[N];
long long int s[N];
cin >> arr[0];
s[0] = arr[0];
cin >> arr[1];
s[1] = abs(arr[1] - arr[0]);
for (i = 2; i < N; ++i) {
cin >> arr[i];
s[i] = min(abs(arr[i] - arr[i - 1]) + s[i - 1],
abs(arr[i] - arr[i - 2]) + s[i - 2]);
}
cout << s[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, i;
cin >> N;
long long int arr[N];
long long int s[N];
cin >> arr[0];
s[0] = 0;
cin >> arr[1];
s[1] = abs(arr[1] - arr[0]);
for (i = 2; i < N; ++i) {
cin >> arr[i];
s[i] = min(abs(arr[i] - arr[i - 1]) + s[i - 1],
abs(arr[i] - arr[i - 2]) + s[i - 2]);
}
cout << s[N - 1] << endl;
return 0;
} | [] | 955,114 | 955,115 | u034821192 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.begin()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int dp[100010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int h[100010];
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 2; i <= n; ++i) {
if (n != 2)
dp[i] = min(abs(h[i] - h[i - 2]) + dp[i - 2],
abs(h[i] - h[i - 1]) + dp[i - 1]);
else
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.begin()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int dp[100010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int h[100010];
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 2; i <= n; ++i) {
if (i != 2)
dp[i] = min(abs(h[i] - h[i - 2]) + dp[i - 2],
abs(h[i] - h[i - 1]) + dp[i - 1]);
else
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
}
cout << dp[n] << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 955,123 | 955,124 | u671257784 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).rend()
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
const int inf = 1e9;
const int mod = 1e9 + 7;
vi dp(100005, inf);
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i + 2 < 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;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).rend()
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
const int inf = 1e9;
const int mod = 1e9 + 7;
vi dp(100005, inf);
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
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;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 955,127 | 955,128 | u876386943 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define OK puts("OK");
#define sz(s) (int)s.size()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define rep(i, n) for (i = 0; i < (n); ++i)
#define rep1(i, n) for (i = 1; i <= (n); ++i)
#define ret return
#define scan1(a) scanf("%lld", &(a));
#define scan2(a, b) scanf("%lld %lld", &(a), &(b));
#define scan3(a, b, c) scanf("%lld %lld %lld", &(a), &(b), &(c));
#define nemeshay ios::sync_with_stdio(0), cin.tie(0);
const int INF = 1e9 + 7, N = 2e5 + 12;
int dp[N], q[N];
int main() {
int n, i, j, k;
scan1(n) rep1(i, n) scan1(q[i]) dp[2] = abs(q[i] - q[i - 1]);
for (i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 1] + abs(q[i] - q[i - 1]), dp[i - 2] + abs(q[i] - q[i - 2]));
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define OK puts("OK");
#define sz(s) (int)s.size()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define rep(i, n) for (i = 0; i < (n); ++i)
#define rep1(i, n) for (i = 1; i <= (n); ++i)
#define ret return
#define scan1(a) scanf("%lld", &(a));
#define scan2(a, b) scanf("%lld %lld", &(a), &(b));
#define scan3(a, b, c) scanf("%lld %lld %lld", &(a), &(b), &(c));
#define nemeshay ios::sync_with_stdio(0), cin.tie(0);
const int INF = 1e9 + 7, N = 2e5 + 12;
int dp[N], q[N];
int main() {
int n, i, j, k;
scan1(n) rep1(i, n) scan1(q[i]) dp[2] = abs(q[2] - q[1]);
for (i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 1] + abs(q[i] - q[i - 1]), dp[i - 2] + abs(q[i] - q[i - 2]));
}
cout << dp[n];
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 955,131 | 955,132 | u526671873 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int answer = 0;
vector<int> dp(N + 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]);
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int answer = 0;
vector<int> dp(N + 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]);
}
cout << dp[N] << endl;
} | [
"assignment.change"
] | 955,150 | 955,151 | u046482892 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<T> &v) {
for (const auto &f : v)
std::cout << f << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
#define INF 1000000000
int main() {
int N;
cin >> N;
vector<int> h;
rep(i, N) {
int temp;
cin >> temp;
h.push_back(temp);
}
vector<int> dp(N);
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 - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
view(dp);
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<T> &v) {
for (const auto &f : v)
std::cout << f << " ";
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
#define INF 1000000000
int main() {
int N;
cin >> N;
vector<int> h;
rep(i, N) {
int temp;
cin >> temp;
h.push_back(temp);
}
vector<int> dp(N);
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 - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
// view(dp);
cout << dp[N - 1] << endl;
} | [
"call.remove"
] | 955,156 | 955,157 | u998880072 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
//#define Fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define sl(n) scanf("%lld", &n)
#define pl(n) printf("%lld", n)
#define sz(a) (int)(a).size()
const int mod = 1e5;
signed main() {
int n;
sl(n);
int arr[n + 1], dp[n + 5];
for (int i = 1; i <= n + 4; i++) {
dp[i] = mod;
}
dp[1] = 0;
for (int i = 1; i <= n; i++)
sl(arr[i]);
for (int i = 1; i <= n - 1; i++) {
if (i + 1 <= n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(arr[i + 1] - arr[i]));
if (i + 2 <= n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(arr[i + 2] - arr[i]));
}
// for(int i=1;i<=n;i++)cout<<dp[i]<<" ";
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
//#define Fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#define pb push_back
#define sl(n) scanf("%lld", &n)
#define pl(n) printf("%lld", n)
#define sz(a) (int)(a).size()
const int mod = 2e9;
signed main() {
int n;
sl(n);
int arr[n + 1], dp[n + 5];
for (int i = 1; i <= n + 4; i++) {
dp[i] = mod;
}
dp[1] = 0;
for (int i = 1; i <= n; i++)
sl(arr[i]);
for (int i = 1; i <= n; i++) {
if (i + 1 <= n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(arr[i + 1] - arr[i]));
if (i + 2 <= n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(arr[i + 2] - arr[i]));
}
// for(int i=1;i<=n;i++)cout<<dp[i]<<" ";
cout << dp[n] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 955,162 | 955,163 | u645644658 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, p[1000000], dp[1000000];
long long int solve(int i) {
int ans;
if (i >= n - 1)
return 0;
if (i == (n - 1))
return dp[i] = abs(p[i + 1] - p[i]);
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(p[i + 2] - p[i]) + solve(i + 2),
abs(p[i + 1] - p[i]) + solve(i + 1));
}
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++)
cin >> p[i];
cout << solve(0);
} | #include <bits/stdc++.h>
using namespace std;
int n, p[1000000], dp[1000000];
long long int solve(int i) {
int ans;
if (i >= n)
return 0;
if (i == (n - 1))
return dp[i] = abs(p[i + 1] - p[i]);
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(p[i + 2] - p[i]) + solve(i + 2),
abs(p[i + 1] - p[i]) + solve(i + 1));
}
int main() {
cin >> n;
for (int i = 0; i <= n; i++)
dp[i] = -1;
for (int i = 1; i <= n; i++)
cin >> p[i];
cout << solve(1);
} | [
"expression.operation.binary.remove",
"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",
"io.output.ch... | 955,166 | 955,167 | u049719575 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = a[2] - a[1];
for (int i = 3; i <= n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= 2; j++) {
mn = min(mn, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = mn;
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= 2; j++) {
mn = min(mn, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = mn;
}
cout << dp[n];
} | [
"call.add",
"call.arguments.change"
] | 955,169 | 955,170 | u040130608 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
vector<long long int> a, b;
a.resize(n);
b.resize(n);
for (i = 0; i < n; i++)
cin >> a[i];
b[0] = 0;
b[1] = a[1] - a[0];
for (i = 2; i < n; i++)
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i - 2] + abs(a[i] - a[i - 2]));
cout << b[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
vector<long long int> a, b;
a.resize(n);
b.resize(n);
for (i = 0; i < n; i++)
cin >> a[i];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i - 2] + abs(a[i] - a[i - 2]));
cout << b[n - 1];
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 955,171 | 955,172 | u364101948 | 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] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int b = abs(arr[i] - arr[i - 2] + dp[i - 2]);
dp[i] = min(a, b);
}
if (n <= 1)
cout << 0 << endl;
else
cout << dp[n - 1] << endl;
}
| #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] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int b = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
if (n <= 0)
cout << 0 << endl;
cout << dp[n - 1] << endl;
}
| [
"call.arguments.change",
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove"
] | 955,179 | 955,180 | u934892029 | cpp |
p03160 | #include <bits/stdc++.h>
#define M 500005
using namespace std;
int f[M], a[M], n;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
f[1] = abs(a[0] - a[1]);
for (int i = 2; i <= n; ++i) {
f[i] =
min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2]));
}
cout << f[n];
return 0;
}
| #include <bits/stdc++.h>
#define M 500005
using namespace std;
int f[M], a[M], n;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
f[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; ++i) {
f[i] =
min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2]));
}
cout << f[n - 1];
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,189 | 955,190 | u865020437 | cpp |
p03160 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", "r")) {
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
if (fopen(Task ".in", "r")) {
freopen(Task ".in", "r", stdin);
freopen(Task ".out", "w", stdout);
}
int n, k;
cin >> n >> k;
vector<int> a(n), f(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (i)
f[i] = 2e9 + 5;
for (int j = i - 1; j >= 0 && j >= i - k; --j) {
f[i] = min(f[i], f[j] + abs(a[i] - a[j]));
}
}
cout << f[n - 1] << '\n';
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", "r")) {
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
if (fopen(Task ".in", "r")) {
freopen(Task ".in", "r", stdin);
freopen(Task ".out", "w", stdout);
}
int n, k;
cin >> n;
k = 2;
vector<int> a(n), f(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (i)
f[i] = 2e9 + 5;
for (int j = i - 1; j >= 0 && j >= i - k; --j) {
f[i] = min(f[i], f[j] + abs(a[i] - a[j]));
}
}
cout << f[n - 1] << '\n';
}
| [
"expression.operation.binary.remove",
"assignment.add"
] | 955,191 | 955,192 | u506628560 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <typename T> void vprint(T &v) {
REP(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
ll N;
cin >> N;
vector<ll> h(N);
REP(i, N) cin >> h[i];
vector<ll> res(N, 101010);
res[0] = 0;
REP(i, N) {
if (i + 1 < N)
res[i + 1] = min(res[i + 1], res[i] + abs(h[i + 1] - h[i]));
if (i + 2 < N)
res[i + 2] = min(res[i + 2], res[i] + abs(h[i + 2] - h[i]));
}
cout << res[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <typename T> void vprint(T &v) {
REP(i, v.size()) { cout << v[i] << " "; }
cout << endl;
}
int main() {
ll N;
cin >> N;
vector<ll> h(N);
REP(i, N) cin >> h[i];
vector<ll> res(N, 101010101010);
res[0] = 0;
REP(i, N) {
if (i + 1 < N)
res[i + 1] = min(res[i + 1], res[i] + abs(h[i + 1] - h[i]));
if (i + 2 < N)
res[i + 2] = min(res[i + 2], res[i] + abs(h[i + 2] - h[i]));
}
cout << res[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 955,193 | 955,194 | u895971408 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
using namespace std;
int main() {
read;
write;
int n;
cin >> n;
int h[n], ans[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = min(abs(h[i] - h[i - 1]) + ans[i - 1],
abs(h[i] - h[i - 2]) + ans[i - 2]);
}
cout << ans[n - 1];
}
| #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
using namespace std;
int main() {
// read;
// write;
int n;
cin >> n;
int h[n], ans[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = min(abs(h[i] - h[i - 1]) + ans[i - 1],
abs(h[i] - h[i - 2]) + ans[i - 2]);
}
cout << ans[n - 1];
}
| [] | 955,195 | 955,196 | u089012446 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define int long long
using namespace std;
const int INF = 1 << 29;
const int N_MAX = 100000;
int N;
vector<int> h;
int dp[N_MAX];
// dp[i]:足場i(0-base)にたどり着くまでの最小コスト
signed main() {
cin >> N;
h.resize(N);
REP(i, N) cin >> h[i];
h[0] = 0;
dp[1] = h[1] - h[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]));
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define int long long
using namespace std;
const int INF = 1 << 29;
const int N_MAX = 100000;
int N;
vector<int> h;
int dp[N_MAX];
// dp[i]:足場i(0-base)にたどり着くまでの最小コスト
signed main() {
cin >> N;
h.resize(N);
REP(i, N) cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[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]));
}
cout << dp[N - 1] << endl;
} | [
"assignment.variable.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 955,197 | 955,198 | u203033720 | cpp |
p03160 | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define deb(x) cout << #x << " " << endl;
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
//-------------------------------------------------------------------------------
int n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int h[100005];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[100005] = {};
dp[1] = 0;
dp[2] = h[2] - h[1];
for (int i = 3; i <= n; ++i) {
dp[i] = min((dp[i - 1] + abs(h[i - 1] - h[i])),
(dp[i - 2] + abs(h[i - 2] - h[i])));
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define deb(x) cout << #x << " " << endl;
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef double ld;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
//-------------------------------------------------------------------------------
int n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
int h[100005];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[100005] = {};
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; ++i) {
dp[i] = min((dp[i - 1] + abs(h[i - 1] - h[i])),
(dp[i - 2] + abs(h[i - 2] - h[i])));
}
cout << dp[n] << endl;
}
| [
"call.add",
"call.arguments.change"
] | 955,199 | 955,200 | u753523037 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.