problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll INF = 1 << 60;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[100000];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n - 1) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i + 1] - v[i]));
if (i > 0)
dp[i + 1] = min(dp[i + 1], dp[i - 1] + abs(v[i + 1] - v[i - 1]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll INF = 10000000000;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[100000];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n - 1) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i + 1] - v[i]));
if (i > 0)
dp[i + 1] = min(dp[i + 1], dp[i - 1] + abs(v[i + 1] - v[i - 1]));
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 951,815 | 951,814 | u264265458 | cpp |
p03160 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
vector<pair<char, ll>> runlength(string s, vector<pair<char, ll>> p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
return p;
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
return p;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n;
cin >> n;
vector<ll> v(n), dp;
rep(i, n) cin >> v[i];
dp.push_back(v[0]);
dp.push_back(abs(v[1] - v[0]));
for (ll i = 0; i < n - 2; i++) {
dp.push_back(min(dp[i] + abs(v[i] - v[i + 2]),
dp[i + 1] + abs(v[i + 1] - v[i + 2])));
}
cout << dp[n - 1] << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
vector<pair<char, ll>> runlength(string s, vector<pair<char, ll>> p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
return p;
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
return p;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
ll n;
cin >> n;
vector<ll> v(n), dp;
rep(i, n) cin >> v[i];
dp.push_back(0);
dp.push_back(abs(v[1] - v[0]));
for (ll i = 0; i < n - 2; i++) {
dp.push_back(min(dp[i] + abs(v[i] - v[i + 2]),
dp[i + 1] + abs(v[i + 1] - v[i + 2])));
}
cout << dp[n - 1] << endl;
} | [
"call.arguments.change"
] | 951,816 | 951,817 | u264265458 | cpp |
p03160 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
vector<pair<char, ll>> runlength(string s, vector<pair<char, ll>> p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
return p;
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
return p;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n;
cin >> n;
vector<ll> v(n), dp;
rep(i, n) cin >> v[i];
dp.push_back(v[0]);
dp.push_back(abs(v[1] - v[0]));
for (ll i = 0; i < n - 2; i++) {
dp.push_back(min(dp[i] + abs(v[i] - v[i + 2]),
dp[i + 1] + abs(v[i + 1] - v[i + 2])));
}
cout << dp[n - 1] << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) {
ll r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return b;
}
ll LCM(ll a, ll b) {
ll c = a, d = b, r, tmp;
/*自然数 a > b を確認・入替*/
if (a < b) {
tmp = a, a = b, b = tmp;
}
/*ユークリッドの互除法*/
r = a % b;
while (r != 0) {
a = b, b = r, r = a % b;
}
return c / b * d;
}
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
vector<pair<char, ll>> runlength(string s, vector<pair<char, ll>> p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
return p;
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
return p;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n;
cin >> n;
vector<ll> v(n), dp;
rep(i, n) cin >> v[i];
dp.push_back(0);
dp.push_back(abs(v[1] - v[0]));
for (ll i = 0; i < n - 2; i++) {
dp.push_back(min(dp[i] + abs(v[i] - v[i + 2]),
dp[i + 1] + abs(v[i + 1] - v[i + 2])));
}
cout << dp[n - 1] << endl;
} | [
"call.arguments.change"
] | 951,816 | 951,818 | u264265458 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int ans, n;
int dp[100005];
int jump(int a[], int i) {
if (i >= n)
return 1001001001;
;
if (i == n - 1)
return 0;
if (dp[i] != -1) {
return dp[i];
}
dp[i] = min(abs(a[i] - a[i + 1]) + jump(a, i + 1),
abs(a[i] - a[i + 2]) + jump(a, i + 2));
return dp[i];
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << jump(a, 0);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int ans, n;
long long dp[100005];
long long jump(int a[], int i) {
if (i >= n)
return 1001001001;
if (i == n - 1)
return 0;
if (dp[i] != -1) {
return dp[i];
}
dp[i] = min(abs(a[i] - a[i + 1]) + jump(a, i + 1),
abs(a[i] - a[i + 2]) + jump(a, i + 2));
return dp[i];
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << jump(a, 0);
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 951,819 | 951,820 | u174314384 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n + 1, 0);
dp[0] = 0;
dp[1] = 0;
dp[2] = dp[1] + abs(v[1] - v[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(v[i - 1] - v[i - 2]),
dp[i - 2] + abs(v[i - 2] - v[i - 3]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n + 1, 0);
dp[0] = 0;
dp[1] = 0;
dp[2] = dp[1] + abs(v[1] - v[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(v[i - 1] - v[i - 2]),
dp[i - 2] + abs(v[i - 1] - v[i - 3]));
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,825 | 951,826 | u601414164 | cpp |
p03160 | /*maximum subarray sum
* kadane algo space optimize dp
*/
#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;
for (int i = 1; i < n; i++) {
int opt = INT_MAX, opt2 = INT_MAX;
opt = dp[i - 1] + abs(arr[i] - arr[i - 1]);
if (i - 2 > 0)
opt2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(opt, opt2);
}
cout << dp[n - 1] << endl;
}
| /*maximum subarray sum
* kadane algo space optimize dp
*/
#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;
for (int i = 1; i < n; i++) {
int opt = INT_MAX, opt2 = INT_MAX;
opt = dp[i - 1] + abs(arr[i] - arr[i - 1]);
if (i - 2 >= 0)
opt2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(opt, opt2);
}
cout << dp[n - 1] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,827 | 951,828 | u129880691 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int MAX_INT = 2000000000;
int dp[100001];
int h[100001];
int cost(int i, int j) { return abs(h[i] - h[j]); }
int main() {
int N;
cin >> N;
FOR(i, 1, N) { cin >> h[i]; }
dp[N] = 0;
dp[N - 1] = cost(N - 1, N);
for (int i = N - 2; i >= 1; i++) {
dp[i] = min(cost(i, i + 1) + dp[i + 1], cost(i, i + 2) + dp[i + 2]);
}
cout << dp[1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int MAX_INT = 2000000000;
int dp[100001];
int h[100001];
int cost(int i, int j) { return abs(h[i] - h[j]); }
int main() {
int N;
cin >> N;
FOR(i, 1, N) { cin >> h[i]; }
dp[N] = 0;
dp[N - 1] = cost(N - 1, N);
for (int i = N - 2; i >= 1; i--) {
dp[i] = min(cost(i, i + 1) + dp[i + 1], cost(i, i + 2) + dp[i + 2]);
}
cout << dp[1];
return 0;
}
| [] | 951,831 | 951,832 | u117022482 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define mem(x, y) memset(x, y, sizeof(x)) // memset array
#define fo(i, r, k) for ((i) = r; (i) < (k); i = i + 1)
#define fok(i, k, n) for ((i) = k; (i) > n; i = i - 1)
#define deb(x) cout << #x << " = " << x << endl
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define deb3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define bug puts("Hello");
#define mp make_pair
#define pb push_back
#define pi pair<int, int>
#define pl pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define vpl vector<pair<long long, long long>>
#define vpi vector<pair<int, int>>
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define br cout << "\n";
#define sortall(x) sort(x.begin(), x.end())
#define modexpo poww
ll modexpo(ll x, ll y, ll m) {
x = x % m;
if (y == 0) {
return 1;
}
if (y % 2 == 0) {
return modexpo(x * x, y / 2, m);
} else {
return (x * modexpo(x * x, y / 2, m)) % m;
}
}
void io();
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
int n, k, a[maxn];
int dp[maxn];
int rec(int n) {
if (dp[n] != -1)
return dp[n];
int ans = INT_MAX;
int i;
for (i = max(1, n - k); i < n; i++) {
ans = min(ans, abs(a[n] - a[i]) + rec(i));
}
return dp[n] = ans;
}
int main() {
int i, j;
cin >> n >> k;
fo(i, 1, n + 1) cin >> a[i];
mem(dp, -1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
rec(n);
cout << dp[n];
return 0;
}
void io() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
| #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define mem(x, y) memset(x, y, sizeof(x)) // memset array
#define fo(i, r, k) for ((i) = r; (i) < (k); i = i + 1)
#define fok(i, k, n) for ((i) = k; (i) > n; i = i - 1)
#define deb(x) cout << #x << " = " << x << endl
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define deb3(x, y, z) \
cout << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " \
<< z << endl
#define bug puts("Hello");
#define mp make_pair
#define pb push_back
#define pi pair<int, int>
#define pl pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define vpl vector<pair<long long, long long>>
#define vpi vector<pair<int, int>>
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define br cout << "\n";
#define sortall(x) sort(x.begin(), x.end())
#define modexpo poww
ll modexpo(ll x, ll y, ll m) {
x = x % m;
if (y == 0) {
return 1;
}
if (y % 2 == 0) {
return modexpo(x * x, y / 2, m);
} else {
return (x * modexpo(x * x, y / 2, m)) % m;
}
}
void io();
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
int n, k, a[maxn];
int dp[maxn];
int rec(int n) {
if (dp[n] != -1)
return dp[n];
int ans = INT_MAX;
int i;
for (i = max(1, n - k); i < n; i++) {
ans = min(ans, abs(a[n] - a[i]) + rec(i));
}
return dp[n] = ans;
}
int main() {
int i, j;
cin >> n;
k = 2;
//>>k;
fo(i, 1, n + 1) cin >> a[i];
mem(dp, -1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
rec(n);
cout << dp[n];
return 0;
}
void io() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
| [
"expression.operation.binary.remove",
"assignment.add"
] | 951,833 | 951,834 | u763558684 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, inf = 0x3f3f3f3f;
int n, h[N], dp[N];
int main() {
cin >> n;
for (int i = 2; i < N; i++)
dp[i] = inf;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[min(i + 2, n)] =
min(dp[min(i + 2, n)], dp[i] + abs(h[i] - h[min(i + 2, n)]));
dp[i + 1] = min(dp[i + 1], abs(dp[i] + h[i] - h[i + 1]));
}
cout << dp[n] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, inf = 0x3f3f3f3f;
int n, h[N], dp[N];
int main() {
cin >> n;
for (int i = 2; i < N; i++)
dp[i] = inf;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[min(i + 2, n)] =
min(dp[min(i + 2, n)], dp[i] + abs(h[i] - h[min(i + 2, n)]));
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
cout << dp[n] << "\n";
}
| [
"call.remove",
"call.add"
] | 951,835 | 951,836 | u942678409 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog1dp(int h[], int n) {
int mindp[n + 1];
mindp[0] = 0;
mindp[1] = 0;
mindp[2] = abs(h[2] - h[1]);
for (int i = 2; i <= n; i++) {
mindp[i] = min(mindp[i - 1] + abs(h[i] - h[i - 1]),
mindp[i - 2] + abs(h[i] - h[i - 2]));
}
return mindp[n];
}
int main() {
int n;
scanf("%d\n", &n);
int h[n + 1];
h[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d ", &h[i]);
}
printf("%d", frog1dp(h, n));
} | #include <bits/stdc++.h>
using namespace std;
int frog1dp(int h[], int n) {
int mindp[n + 1];
mindp[0] = 0;
mindp[1] = 0;
mindp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
mindp[i] = min(mindp[i - 1] + abs(h[i] - h[i - 1]),
mindp[i - 2] + abs(h[i] - h[i - 2]));
}
return mindp[n];
}
int main() {
int n;
scanf("%d\n", &n);
int h[n + 1];
h[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
printf("%d", frog1dp(h, n));
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"call.arguments.change"
] | 951,841 | 951,842 | u844872846 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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;
}
const long long INF = 1LL << 60;
int n;
long long h[100010];
long long dp[100010];
int main() {
cin >> n;
rep(i, n) cin >> h[i];
rep(i, 100010) dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < n; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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;
}
const long long INF = 1LL << 60;
int n;
long long h[100010];
long long dp[100010];
int main() {
cin >> n;
rep(i, n) cin >> h[i];
rep(i, 100010) dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 951,843 | 951,844 | u700970062 | cpp |
p03160 | // I can't tell you what it really is,
// I can only tell you what it feels like.
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define F first
#define S second
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define fo(i, n) for (int i = 1; i <= n; ++i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define P pair<int, int>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define E cout << '\n'
const int N = 1e5 + 5;
int dp[N], a[N];
signed main() {
fast;
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
if (n == 1)
return cout << 0, 0;
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
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];
return 0;
}
| // I can't tell you what it really is,
// I can only tell you what it feels like.
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define F first
#define S second
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define fo(i, n) for (int i = 1; i <= n; ++i)
#define all(v) v.begin(), v.end()
#define pb push_back
#define P pair<int, int>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define E cout << '\n'
const int N = 1e5 + 5;
int dp[N], a[N];
signed main() {
fast;
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
if (n == 1)
return cout << 0, 0;
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 951,847 | 951,848 | u450009898 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N, 10000);
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j == N)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N, 1000000000);
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j == N)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 951,853 | 951,854 | u109489258 | cpp |
p03160 | #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld, ld>;
using vi = vector<ll>;
using vd = vector<db>;
using vl = vector<ll>;
using vld = vector<ld>;
using vs = vector<str>;
using vb = vector<bool>;
using vc = vector<char>;
using vpi = vector<pl>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vl>;
using vvl = vector<vl>;
using vvc = vector<vc>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define si(a) ((int)(a).size())
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define rs resize
#define ins insert
#define nl "\n"
#define sor(a) sort(all(a))
#define res(a, n) \
a.rs(n); \
re(a)
#define int long long
#define sort_by(x, y) \
sort(all(x), [&](const auto &a, const auto &b) { return y; })
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define rop(i, a) rep(i, 0, a)
#define per(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define por(i, a) per(i, 0, a)
#define trav(i, a) for (auto &i : a)
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll a, ll b) { return uniform_int_distribution<ll>(a, b)(rng); }
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> void uni(vector<T> &v) {
sor(v);
v.erase(unique(all(v)), end(v));
}
int cdiv(const ll &a, const ll &b) {
return a / b + ((a ^ b) > 0 && a % b);
} // (a / b) rounded up
int fdiv(const ll &a, const ll &b) {
return a / b - ((a ^ b) < 0 && a % b);
} // (a / b) rounded down
int fstTrue(function<bool(int)> f, int lo, int hi) {
for (hi++; lo < hi;) {
int mid = fdiv((lo + hi), 2);
f(mid) ? hi = mid : lo = mid + 1;
}
return lo;
}
int lstTrue(function<bool(int)> f, int lo, int hi) {
for (lo--; lo < hi;) {
int mid = fdiv((lo + hi + 1), 2);
f(mid) ? lo = mid : hi = mid - 1;
}
return lo;
}
int power(ll a, ll b, ll c) {
ll res = 1;
a %= c;
while (b > 0) {
if (b & 1)
res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res;
}
int power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ull modMul(ull a, ull b, const ull mod) {
ll ret = a * b - mod * (ull)((ld)a * b / mod);
return ret + ((ret < 0) - (ret >= (ll)mod)) * mod;
}
ull modPow(ull a, ull b, const ull mod) {
if (b == 0) {
return 1;
}
ull res = modPow(a, b / 2, mod);
res = modMul(res, res, mod);
return b & 1 ? modMul(res, a, mod) : res;
}
bool prime(ull n) {
if (n < 2 || n % 6 % 4 != 1) {
return n - 2 < 2;
}
ull A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022},
s = __builtin_ctzll(n - 1), d = n >> s;
trav(i, A) {
ull p = modPow(i, d, n), a = s;
while (p != 1 && p != n - 1 && i % n && a--) {
p = modMul(p, p, n);
}
if (p != n - 1 && a != s) {
return false;
}
}
return true;
}
int pct(int x) {
x = (x & 0x5555555555555555LL) + ((x >> 1) & 0x5555555555555555LL);
x = (x & 0x3333333333333333LL) + ((x >> 2) & 0x3333333333333333LL);
x = (x & 0x0F0F0F0F0F0F0F0FLL) + ((x >> 4) & 0x0F0F0F0F0F0F0F0FLL);
return (x * 0x0101010101010101LL) >> 56;
}
// uni: O(nlog(n)), cdiv: O(1), fdiv: O(1), fstTrue: O(log(hi - lo)), lstTrue:
// O(log(hi - lo)), gcd: O(log(min(a, b))), lcm: O(log(min(a, b))), power:
// O(log(b)), prime: O(sqrt(a)), pct: O(1)
// TO_STRING
#define ts to_string
string ts(char c) { return string(1, c); }
string ts(bool b) { return b ? "true" : "false"; }
string ts(const char *s) { return (string)s; }
string ts(string s) { return s; }
template <class A> string ts(complex<A> c) {
stringstream ss;
ss << c;
return ss.str();
}
string ts(vector<bool> v) {
string res = "{";
for (int i = 0; i < si(v); i++) {
res += char('0' + v[i]);
}
res += "}";
return res;
}
template <size_t SZ> string ts(bitset<SZ> b) {
string res = "";
for (int i = 0; i < (ll)SZ; i++) {
res += char('0' + b[i]);
}
return res;
}
template <class A, class B> string ts(pair<A, B> p) {
return "(" + ts(p.f) + ", " + ts(p.s) + ")";
}
template <class T> string ts(T v) {
bool fst = 1;
string res = "{";
for (const auto &x : v) {
if (!fst) {
res += ", ";
}
fst = 0;
res += ts(x);
}
res += "}";
return res;
}
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t)) {
cerr << ", ";
}
DBG(t...);
}
void EDBG(string names) { names = names; }
template <class H, class... T> void EDBG(string names, H h, T... t) {
auto pos = names.find(',');
auto first_name = names.substr(0, pos);
auto rest = names.substr(pos + 1);
while (rest.front() == ' ') {
rest = rest.substr(1);
}
cerr << "[" << first_name << "]: [" << ts(h) << "]" << nl;
EDBG(rest, t...);
}
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define edbg(...) EDBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...) 42
#define edbg(...) 7
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
}
void setIO(string s = "") {
unsyncIO();
if (si(s)) {
setIn(s + ".in");
setOut(s + ".out");
}
}
const int MX = 2e5 + 5;
const long long INF = 1e18;
const long long MOD = 1e9 + 7; // 998244353
const long double PI = acos((ld)-1);
const long double EPS = 1e-18;
int n;
vi a, dp;
int32_t main() {
setIO();
cin >> n;
a.rs(n);
dp.rs(n);
trav(i, a) { cin >> i; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 1]));
}
cout << dp.back() << nl;
}
| #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld, ld>;
using vi = vector<ll>;
using vd = vector<db>;
using vl = vector<ll>;
using vld = vector<ld>;
using vs = vector<str>;
using vb = vector<bool>;
using vc = vector<char>;
using vpi = vector<pl>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vl>;
using vvl = vector<vl>;
using vvc = vector<vc>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define si(a) ((int)(a).size())
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define rs resize
#define ins insert
#define nl "\n"
#define sor(a) sort(all(a))
#define res(a, n) \
a.rs(n); \
re(a)
#define int long long
#define sort_by(x, y) \
sort(all(x), [&](const auto &a, const auto &b) { return y; })
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define rop(i, a) rep(i, 0, a)
#define per(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define por(i, a) per(i, 0, a)
#define trav(i, a) for (auto &i : a)
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll a, ll b) { return uniform_int_distribution<ll>(a, b)(rng); }
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> void uni(vector<T> &v) {
sor(v);
v.erase(unique(all(v)), end(v));
}
int cdiv(const ll &a, const ll &b) {
return a / b + ((a ^ b) > 0 && a % b);
} // (a / b) rounded up
int fdiv(const ll &a, const ll &b) {
return a / b - ((a ^ b) < 0 && a % b);
} // (a / b) rounded down
int fstTrue(function<bool(int)> f, int lo, int hi) {
for (hi++; lo < hi;) {
int mid = fdiv((lo + hi), 2);
f(mid) ? hi = mid : lo = mid + 1;
}
return lo;
}
int lstTrue(function<bool(int)> f, int lo, int hi) {
for (lo--; lo < hi;) {
int mid = fdiv((lo + hi + 1), 2);
f(mid) ? lo = mid : hi = mid - 1;
}
return lo;
}
int power(ll a, ll b, ll c) {
ll res = 1;
a %= c;
while (b > 0) {
if (b & 1)
res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res;
}
int power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ull modMul(ull a, ull b, const ull mod) {
ll ret = a * b - mod * (ull)((ld)a * b / mod);
return ret + ((ret < 0) - (ret >= (ll)mod)) * mod;
}
ull modPow(ull a, ull b, const ull mod) {
if (b == 0) {
return 1;
}
ull res = modPow(a, b / 2, mod);
res = modMul(res, res, mod);
return b & 1 ? modMul(res, a, mod) : res;
}
bool prime(ull n) {
if (n < 2 || n % 6 % 4 != 1) {
return n - 2 < 2;
}
ull A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022},
s = __builtin_ctzll(n - 1), d = n >> s;
trav(i, A) {
ull p = modPow(i, d, n), a = s;
while (p != 1 && p != n - 1 && i % n && a--) {
p = modMul(p, p, n);
}
if (p != n - 1 && a != s) {
return false;
}
}
return true;
}
int pct(int x) {
x = (x & 0x5555555555555555LL) + ((x >> 1) & 0x5555555555555555LL);
x = (x & 0x3333333333333333LL) + ((x >> 2) & 0x3333333333333333LL);
x = (x & 0x0F0F0F0F0F0F0F0FLL) + ((x >> 4) & 0x0F0F0F0F0F0F0F0FLL);
return (x * 0x0101010101010101LL) >> 56;
}
// uni: O(nlog(n)), cdiv: O(1), fdiv: O(1), fstTrue: O(log(hi - lo)), lstTrue:
// O(log(hi - lo)), gcd: O(log(min(a, b))), lcm: O(log(min(a, b))), power:
// O(log(b)), prime: O(sqrt(a)), pct: O(1)
// TO_STRING
#define ts to_string
string ts(char c) { return string(1, c); }
string ts(bool b) { return b ? "true" : "false"; }
string ts(const char *s) { return (string)s; }
string ts(string s) { return s; }
template <class A> string ts(complex<A> c) {
stringstream ss;
ss << c;
return ss.str();
}
string ts(vector<bool> v) {
string res = "{";
for (int i = 0; i < si(v); i++) {
res += char('0' + v[i]);
}
res += "}";
return res;
}
template <size_t SZ> string ts(bitset<SZ> b) {
string res = "";
for (int i = 0; i < (ll)SZ; i++) {
res += char('0' + b[i]);
}
return res;
}
template <class A, class B> string ts(pair<A, B> p) {
return "(" + ts(p.f) + ", " + ts(p.s) + ")";
}
template <class T> string ts(T v) {
bool fst = 1;
string res = "{";
for (const auto &x : v) {
if (!fst) {
res += ", ";
}
fst = 0;
res += ts(x);
}
res += "}";
return res;
}
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t)) {
cerr << ", ";
}
DBG(t...);
}
void EDBG(string names) { names = names; }
template <class H, class... T> void EDBG(string names, H h, T... t) {
auto pos = names.find(',');
auto first_name = names.substr(0, pos);
auto rest = names.substr(pos + 1);
while (rest.front() == ' ') {
rest = rest.substr(1);
}
cerr << "[" << first_name << "]: [" << ts(h) << "]" << nl;
EDBG(rest, t...);
}
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define edbg(...) EDBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...) 42
#define edbg(...) 7
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
}
void setIO(string s = "") {
unsyncIO();
if (si(s)) {
setIn(s + ".in");
setOut(s + ".out");
}
}
const int MX = 2e5 + 5;
const long long INF = 1e18;
const long long MOD = 1e9 + 7; // 998244353
const long double PI = acos((ld)-1);
const long double EPS = 1e-18;
int n;
vi a, dp;
int32_t main() {
setIO();
cin >> n;
a.rs(n);
dp.rs(n);
trav(i, a) { cin >> i; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp.back() << nl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,855 | 951,856 | u249899006 | cpp |
p03160 | #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld, ld>;
using vi = vector<ll>;
using vd = vector<db>;
using vl = vector<ll>;
using vld = vector<ld>;
using vs = vector<str>;
using vb = vector<bool>;
using vc = vector<char>;
using vpi = vector<pl>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vl>;
using vvl = vector<vl>;
using vvc = vector<vc>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define si(a) ((int)(a).size())
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define rs resize
#define ins insert
#define nl "\n"
#define sor(a) sort(all(a))
#define res(a, n) \
a.rs(n); \
re(a)
#define int long long
#define sort_by(x, y) \
sort(all(x), [&](const auto &a, const auto &b) { return y; })
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define rop(i, a) rep(i, 0, a)
#define per(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define por(i, a) per(i, 0, a)
#define trav(i, a) for (auto &i : a)
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll a, ll b) { return uniform_int_distribution<ll>(a, b)(rng); }
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> void uni(vector<T> &v) {
sor(v);
v.erase(unique(all(v)), end(v));
}
int cdiv(const ll &a, const ll &b) {
return a / b + ((a ^ b) > 0 && a % b);
} // (a / b) rounded up
int fdiv(const ll &a, const ll &b) {
return a / b - ((a ^ b) < 0 && a % b);
} // (a / b) rounded down
int fstTrue(function<bool(int)> f, int lo, int hi) {
for (hi++; lo < hi;) {
int mid = fdiv((lo + hi), 2);
f(mid) ? hi = mid : lo = mid + 1;
}
return lo;
}
int lstTrue(function<bool(int)> f, int lo, int hi) {
for (lo--; lo < hi;) {
int mid = fdiv((lo + hi + 1), 2);
f(mid) ? lo = mid : hi = mid - 1;
}
return lo;
}
int power(ll a, ll b, ll c) {
ll res = 1;
a %= c;
while (b > 0) {
if (b & 1)
res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res;
}
int power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ull modMul(ull a, ull b, const ull mod) {
ll ret = a * b - mod * (ull)((ld)a * b / mod);
return ret + ((ret < 0) - (ret >= (ll)mod)) * mod;
}
ull modPow(ull a, ull b, const ull mod) {
if (b == 0) {
return 1;
}
ull res = modPow(a, b / 2, mod);
res = modMul(res, res, mod);
return b & 1 ? modMul(res, a, mod) : res;
}
bool prime(ull n) {
if (n < 2 || n % 6 % 4 != 1) {
return n - 2 < 2;
}
ull A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022},
s = __builtin_ctzll(n - 1), d = n >> s;
trav(i, A) {
ull p = modPow(i, d, n), a = s;
while (p != 1 && p != n - 1 && i % n && a--) {
p = modMul(p, p, n);
}
if (p != n - 1 && a != s) {
return false;
}
}
return true;
}
int pct(int x) {
x = (x & 0x5555555555555555LL) + ((x >> 1) & 0x5555555555555555LL);
x = (x & 0x3333333333333333LL) + ((x >> 2) & 0x3333333333333333LL);
x = (x & 0x0F0F0F0F0F0F0F0FLL) + ((x >> 4) & 0x0F0F0F0F0F0F0F0FLL);
return (x * 0x0101010101010101LL) >> 56;
}
// uni: O(nlog(n)), cdiv: O(1), fdiv: O(1), fstTrue: O(log(hi - lo)), lstTrue:
// O(log(hi - lo)), gcd: O(log(min(a, b))), lcm: O(log(min(a, b))), power:
// O(log(b)), prime: O(sqrt(a)), pct: O(1)
// TO_STRING
#define ts to_string
string ts(char c) { return string(1, c); }
string ts(bool b) { return b ? "true" : "false"; }
string ts(const char *s) { return (string)s; }
string ts(string s) { return s; }
template <class A> string ts(complex<A> c) {
stringstream ss;
ss << c;
return ss.str();
}
string ts(vector<bool> v) {
string res = "{";
for (int i = 0; i < si(v); i++) {
res += char('0' + v[i]);
}
res += "}";
return res;
}
template <size_t SZ> string ts(bitset<SZ> b) {
string res = "";
for (int i = 0; i < (ll)SZ; i++) {
res += char('0' + b[i]);
}
return res;
}
template <class A, class B> string ts(pair<A, B> p) {
return "(" + ts(p.f) + ", " + ts(p.s) + ")";
}
template <class T> string ts(T v) {
bool fst = 1;
string res = "{";
for (const auto &x : v) {
if (!fst) {
res += ", ";
}
fst = 0;
res += ts(x);
}
res += "}";
return res;
}
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t)) {
cerr << ", ";
}
DBG(t...);
}
void EDBG(string names) { names = names; }
template <class H, class... T> void EDBG(string names, H h, T... t) {
auto pos = names.find(',');
auto first_name = names.substr(0, pos);
auto rest = names.substr(pos + 1);
while (rest.front() == ' ') {
rest = rest.substr(1);
}
cerr << "[" << first_name << "]: [" << ts(h) << "]" << nl;
EDBG(rest, t...);
}
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define edbg(...) EDBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...) 42
#define edbg(...) 7
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
}
void setIO(string s = "") {
unsyncIO();
if (si(s)) {
setIn(s + ".in");
setOut(s + ".out");
}
}
const int MX = 2e5 + 5;
const long long INF = 1e18;
const long long MOD = 1e9 + 7; // 998244353
const long double PI = acos((ld)-1);
const long double EPS = 1e-18;
int n;
vi a, dp;
int32_t main() {
setIO();
cin >> n;
a.rs(n);
dp.rs(n);
trav(i, a) { cin >> i; }
dp[0] = 0;
dp[1] = a[1] - a[0];
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 1]));
}
cout << dp.back() << nl;
}
| #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld, ld>;
using vi = vector<ll>;
using vd = vector<db>;
using vl = vector<ll>;
using vld = vector<ld>;
using vs = vector<str>;
using vb = vector<bool>;
using vc = vector<char>;
using vpi = vector<pl>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vl>;
using vvl = vector<vl>;
using vvc = vector<vc>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define si(a) ((int)(a).size())
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define rs resize
#define ins insert
#define nl "\n"
#define sor(a) sort(all(a))
#define res(a, n) \
a.rs(n); \
re(a)
#define int long long
#define sort_by(x, y) \
sort(all(x), [&](const auto &a, const auto &b) { return y; })
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define rop(i, a) rep(i, 0, a)
#define per(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define por(i, a) per(i, 0, a)
#define trav(i, a) for (auto &i : a)
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll a, ll b) { return uniform_int_distribution<ll>(a, b)(rng); }
template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
template <class T> void uni(vector<T> &v) {
sor(v);
v.erase(unique(all(v)), end(v));
}
int cdiv(const ll &a, const ll &b) {
return a / b + ((a ^ b) > 0 && a % b);
} // (a / b) rounded up
int fdiv(const ll &a, const ll &b) {
return a / b - ((a ^ b) < 0 && a % b);
} // (a / b) rounded down
int fstTrue(function<bool(int)> f, int lo, int hi) {
for (hi++; lo < hi;) {
int mid = fdiv((lo + hi), 2);
f(mid) ? hi = mid : lo = mid + 1;
}
return lo;
}
int lstTrue(function<bool(int)> f, int lo, int hi) {
for (lo--; lo < hi;) {
int mid = fdiv((lo + hi + 1), 2);
f(mid) ? lo = mid : hi = mid - 1;
}
return lo;
}
int power(ll a, ll b, ll c) {
ll res = 1;
a %= c;
while (b > 0) {
if (b & 1)
res = res * a % c;
a = a * a % c;
b >>= 1;
}
return res;
}
int power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
ull modMul(ull a, ull b, const ull mod) {
ll ret = a * b - mod * (ull)((ld)a * b / mod);
return ret + ((ret < 0) - (ret >= (ll)mod)) * mod;
}
ull modPow(ull a, ull b, const ull mod) {
if (b == 0) {
return 1;
}
ull res = modPow(a, b / 2, mod);
res = modMul(res, res, mod);
return b & 1 ? modMul(res, a, mod) : res;
}
bool prime(ull n) {
if (n < 2 || n % 6 % 4 != 1) {
return n - 2 < 2;
}
ull A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022},
s = __builtin_ctzll(n - 1), d = n >> s;
trav(i, A) {
ull p = modPow(i, d, n), a = s;
while (p != 1 && p != n - 1 && i % n && a--) {
p = modMul(p, p, n);
}
if (p != n - 1 && a != s) {
return false;
}
}
return true;
}
int pct(int x) {
x = (x & 0x5555555555555555LL) + ((x >> 1) & 0x5555555555555555LL);
x = (x & 0x3333333333333333LL) + ((x >> 2) & 0x3333333333333333LL);
x = (x & 0x0F0F0F0F0F0F0F0FLL) + ((x >> 4) & 0x0F0F0F0F0F0F0F0FLL);
return (x * 0x0101010101010101LL) >> 56;
}
// uni: O(nlog(n)), cdiv: O(1), fdiv: O(1), fstTrue: O(log(hi - lo)), lstTrue:
// O(log(hi - lo)), gcd: O(log(min(a, b))), lcm: O(log(min(a, b))), power:
// O(log(b)), prime: O(sqrt(a)), pct: O(1)
// TO_STRING
#define ts to_string
string ts(char c) { return string(1, c); }
string ts(bool b) { return b ? "true" : "false"; }
string ts(const char *s) { return (string)s; }
string ts(string s) { return s; }
template <class A> string ts(complex<A> c) {
stringstream ss;
ss << c;
return ss.str();
}
string ts(vector<bool> v) {
string res = "{";
for (int i = 0; i < si(v); i++) {
res += char('0' + v[i]);
}
res += "}";
return res;
}
template <size_t SZ> string ts(bitset<SZ> b) {
string res = "";
for (int i = 0; i < (ll)SZ; i++) {
res += char('0' + b[i]);
}
return res;
}
template <class A, class B> string ts(pair<A, B> p) {
return "(" + ts(p.f) + ", " + ts(p.s) + ")";
}
template <class T> string ts(T v) {
bool fst = 1;
string res = "{";
for (const auto &x : v) {
if (!fst) {
res += ", ";
}
fst = 0;
res += ts(x);
}
res += "}";
return res;
}
void DBG() { cerr << "]" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
cerr << ts(h);
if (sizeof...(t)) {
cerr << ", ";
}
DBG(t...);
}
void EDBG(string names) { names = names; }
template <class H, class... T> void EDBG(string names, H h, T... t) {
auto pos = names.find(',');
auto first_name = names.substr(0, pos);
auto rest = names.substr(pos + 1);
while (rest.front() == ' ') {
rest = rest.substr(1);
}
cerr << "[" << first_name << "]: [" << ts(h) << "]" << nl;
EDBG(rest, t...);
}
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#define edbg(...) EDBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...) 42
#define edbg(...) 7
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(20);
}
void setIO(string s = "") {
unsyncIO();
if (si(s)) {
setIn(s + ".in");
setOut(s + ".out");
}
}
const int MX = 2e5 + 5;
const long long INF = 1e18;
const long long MOD = 1e9 + 7; // 998244353
const long double PI = acos((ld)-1);
const long double EPS = 1e-18;
int n;
vi a, dp;
int32_t main() {
setIO();
cin >> n;
a.rs(n);
dp.rs(n);
trav(i, a) { cin >> i; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp.back() << nl;
}
| [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 951,857 | 951,856 | u249899006 | 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; // first stone
if (n > 1) // imp
dp[1] = 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] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long int dp[n];
dp[0] = 0; // first stone
if (n > 1) // imp
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[i]<<" ";
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.widen.change",
"call.add",
"call.arguments.change"
] | 951,858 | 951,859 | u997020717 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef vector<vector<P>> vvP;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
cin >> n >> k;
vl h(n);
rep(i, n) { cin >> h[i]; }
vl dp(n, INF); // dp[i] : 足場iにたどりつく最小コスト
dp[0] = 0;
rep(i, n) {
exrep(j, 1, 2) {
if (i + j < n) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
}
out(dp[n - 1]);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef vector<vector<P>> vvP;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
cin >> n;
vl h(n);
rep(i, n) { cin >> h[i]; }
vl dp(n, INF); // dp[i] : 足場iにたどりつく最小コスト
dp[0] = 0;
rep(i, n) {
exrep(j, 1, 2) {
if (i + j < n) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
}
out(dp[n - 1]);
re0;
} | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 951,860 | 951,861 | u828388155 | cpp |
p03160 | #include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, INT16_MAX);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1]), dp[i + 1]);
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<long long> dp(n, 100000000000);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1]), dp[i + 1]);
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 951,862 | 951,863 | u110383054 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[101000];
int main() {
int n;
scanf("%d", &n);
vector<int> a(1 << n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
op1 = abs(a[i] - a[i - 1]) + dp[i - 1];
}
if (i >= 2) {
op2 = abs(a[i] - a[i - 2]) + dp[i - 2];
}
dp[i] = min(op1, op2);
}
printf("%d\n", dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dp[101000];
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
op1 = abs(a[i] - a[i - 1]) + dp[i - 1];
}
if (i >= 2) {
op2 = abs(a[i] - a[i - 2]) + dp[i - 2];
}
dp[i] = min(op1, op2);
}
printf("%d\n", dp[n - 1]);
return 0;
} | [
"expression.operation.binary.remove"
] | 951,868 | 951,869 | u779663511 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[10001];
int main() {
int n;
scanf("%d", &n);
vector<int> a(1 << n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
op1 = abs(a[i] - a[i - 1]) + dp[i - 1];
}
if (i >= 2) {
op2 = abs(a[i] - a[i - 2]) + dp[i - 2];
}
dp[i] = min(op1, op2);
}
printf("%d\n", dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dp[101000];
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
op1 = abs(a[i] - a[i - 1]) + dp[i - 1];
}
if (i >= 2) {
op2 = abs(a[i] - a[i - 2]) + dp[i - 2];
}
dp[i] = min(op1, op2);
}
printf("%d\n", dp[n - 1]);
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 951,870 | 951,869 | u779663511 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
vector<int> v(t);
for (int i = 0; i < t; ++i)
cin >> v[i];
int dp[t + 1];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (int i = 2; i < t; ++i)
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i - 2] - v[i]));
cout << dp[t - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
vector<int> v(t);
for (int i = 0; i < t; ++i)
cin >> v[i];
int dp[t + 1];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < t; ++i)
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i - 2] - v[i]));
cout << dp[t - 1] << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 951,871 | 951,872 | u843295336 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int input[n];
for (int i = 0; i < n; i++) {
cin >> input[i];
}
// 10, 30, 40, 20
// 0, 20, 30 30
int dp[n];
dp[0] = 0;
dp[1] = abs(input[2] - input[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(input[i] - input[i - 1]),
dp[i - 2] + abs(input[i] - input[i - 2]));
}
cout << dp[n - 1];
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int input[n];
for (int i = 0; i < n; i++) {
cin >> input[i];
}
// 10, 30, 40, 20
// 0, 20, 30 30
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(input[1] - input[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(input[i] - input[i - 1]),
dp[i - 2] + abs(input[i] - input[i - 2]));
}
cout << dp[n - 1];
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,873 | 951,874 | u982131228 | cpp |
p03160 | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long int
typedef complex<long double> cd;
const long double pi = acos(-1);
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
#define m1 make_pair
#define pb push_back
#define flush fflush(stdout)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define reset(x, v) memset(x, v, sizeof(x))
#define fi first
#define se second
#define endl "\n"
#define debug(x) (cerr << #x << ": " << x << "\n")
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
inline ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p % m * p % m) % m;
if (n % 2)
return (p % m * a % m) % m;
else
return p;
}
const double EPS = 1e-9;
const ll MOD = 998244353;
const ll hell = 1000000007;
const int INF = 1e18;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 rng(seed);
double startTime;
double getCurrentTime() {
return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int N = 100005;
int dp[N];
void solve() {
// dp[1]=0;
dp[1] = 0;
int n, k;
cin >> n >> k;
for (int i = 2; i <= n; i++)
dp[i] = INF;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int j = 2; j <= n; j++) {
for (int i = j - 1; i >= max((int)1, j - k); i--)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
cout << dp[n] << endl;
}
int32_t main() {
IOS;
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long int
typedef complex<long double> cd;
const long double pi = acos(-1);
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
#define m1 make_pair
#define pb push_back
#define flush fflush(stdout)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define reset(x, v) memset(x, v, sizeof(x))
#define fi first
#define se second
#define endl "\n"
#define debug(x) (cerr << #x << ": " << x << "\n")
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
inline ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p % m * p % m) % m;
if (n % 2)
return (p % m * a % m) % m;
else
return p;
}
const double EPS = 1e-9;
const ll MOD = 998244353;
const ll hell = 1000000007;
const int INF = 1e18;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 rng(seed);
double startTime;
double getCurrentTime() {
return ((double)clock() - startTime) / CLOCKS_PER_SEC;
}
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const int N = 100005;
int dp[N];
void solve() {
// dp[1]=0;
dp[1] = 0;
int n, k;
cin >> n;
k = 2;
for (int i = 2; i <= n; i++)
dp[i] = INF;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int j = 2; j <= n; j++) {
for (int i = j - 1; i >= max((int)1, j - k); i--)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
cout << dp[n] << endl;
}
int32_t main() {
IOS;
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.add"
] | 951,875 | 951,876 | u314476982 | cpp |
p03160 | /*
Educational Dp Contest Atcoder
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long int
typedef complex<long double> cd;
const long double pi = acos(-1);
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
#define m1 make_pair
#define pb push_back
#define flush fflush(stdout)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define reset(x, v) memset(x, v, sizeof(x))
#define fi first
#define se second
#define endl "\n"
#define debug(x) (cerr << #x << ": " << x << "\n")
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
inline ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p % m * p % m) % m;
if (n % 2)
return (p % m * a % m) % m;
else
return p;
}
const ll MOD = 998244353;
const ll hell = 1000000007;
const int INF = 1e16;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 rng(seed);
const int N = 1e5 + 5;
int h[N + 1];
int dp[N];
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
if (n >= 2)
dp[2] = abs(h[2] - h[1]);
for (int i = 2; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cout << dp[n] << endl;
}
int32_t main() {
IOS;
// FILE *fin = freopen("in","r",stdin);
// FILE *fout = freopen("out","w",stdout);
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| /*
Educational Dp Contest Atcoder
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long int
typedef complex<long double> cd;
const long double pi = acos(-1);
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
#define m1 make_pair
#define pb push_back
#define flush fflush(stdout)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define reset(x, v) memset(x, v, sizeof(x))
#define fi first
#define se second
#define endl "\n"
#define debug(x) (cerr << #x << ": " << x << "\n")
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
inline ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p % m * p % m) % m;
if (n % 2)
return (p % m * a % m) % m;
else
return p;
}
const ll MOD = 998244353;
const ll hell = 1000000007;
const int INF = 1e16;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
std::mt19937 rng(seed);
const int N = 1e5 + 5;
int h[N + 1];
int dp[N];
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
if (n >= 2)
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cout << dp[n] << endl;
}
int32_t main() {
IOS;
// FILE *fin = freopen("in","r",stdin);
// FILE *fout = freopen("out","w",stdout);
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 951,877 | 951,878 | u314476982 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S second
#define debug(x) cout << (#x) << " is " << (x) << endl
#define lb(arr, n, x) lower_bound(arr, arr + n, x) - arr
#define ub(arr, n, x) upper_bound(arr, arr + n, x) - arr
#define endl "\n"
#define PI 3.14159265358979323846 /* pi */
#define sqr(x) (x) * (x)
#define sign(x) (x > 0) - (x < 0)
#define is_poweroftwo(n) (n && !(n & (n - 1)))
#define all(v) ((v).begin()), ((v).end())
#define degreesToRadians(angleDegrees) \
(angleDegrees * PI / 180.0) // Converts degrees to radians.
#define radiansToDegrees(angleRadians) \
(angleRadians * 180.0 / PI) // Converts radians to degrees.
#define int long long
#define debug(x) cout << (#x) << " is " << (x) << endl
#define AagLgaDe \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
typedef long double ld;
// Calculation of (x^y)%mm
ll mod_exp(ll x, ll y, ll mm) {
if (y == 0)
return (1);
else if (y % 2 == 0)
return (mod_exp((x * x) % mm, y / 2, mm));
else
return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
bool isPowerOfTwo(int n) {
if (n == 0)
return false;
return (ceil(log2(n)) == floor(log2(n)));
}
// int x1[]={+1,-1,+0,+0};
// int y1[]={+0,+0,+1,-1};
// int x2[]={+0,+0,+1,-1,-1,+1,-1,+1};
// int y2[]={-1,+1,+0,+0,+1,+1,-1,-1};
// int x3[]={-2,-2,-1,-1,+1,+1,+2,+2};
// int y3[]={-1,+1,-2,+2,-2,+2,-1,+1};
int solve() {
int n;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++)
cin >> arr[i];
// int ans=0;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i]));
}
return dp[n - 1];
}
signed main() {
AagLgaDe
// int t;cin>>t;while(t--)
cout
<< solve() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S second
#define debug(x) cout << (#x) << " is " << (x) << endl
#define lb(arr, n, x) lower_bound(arr, arr + n, x) - arr
#define ub(arr, n, x) upper_bound(arr, arr + n, x) - arr
#define endl "\n"
#define PI 3.14159265358979323846 /* pi */
#define sqr(x) (x) * (x)
#define sign(x) (x > 0) - (x < 0)
#define is_poweroftwo(n) (n && !(n & (n - 1)))
#define all(v) ((v).begin()), ((v).end())
#define degreesToRadians(angleDegrees) \
(angleDegrees * PI / 180.0) // Converts degrees to radians.
#define radiansToDegrees(angleRadians) \
(angleRadians * 180.0 / PI) // Converts radians to degrees.
#define int long long
#define debug(x) cout << (#x) << " is " << (x) << endl
#define AagLgaDe \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
typedef long double ld;
// Calculation of (x^y)%mm
ll mod_exp(ll x, ll y, ll mm) {
if (y == 0)
return (1);
else if (y % 2 == 0)
return (mod_exp((x * x) % mm, y / 2, mm));
else
return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
bool isPowerOfTwo(int n) {
if (n == 0)
return false;
return (ceil(log2(n)) == floor(log2(n)));
}
// int x1[]={+1,-1,+0,+0};
// int y1[]={+0,+0,+1,-1};
// int x2[]={+0,+0,+1,-1,-1,+1,-1,+1};
// int y2[]={-1,+1,+0,+0,+1,+1,-1,-1};
// int x3[]={-2,-2,-1,-1,+1,+1,+2,+2};
// int y3[]={-1,+1,-2,+2,-2,+2,-1,+1};
int solve() {
int n;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++)
cin >> arr[i];
// int ans=0;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i]));
}
return dp[n - 1];
}
signed main() {
AagLgaDe
// int t;cin>>t;while(t--)
cout
<< solve() << endl;
return 0;
} | [
"assignment.change"
] | 951,879 | 951,880 | u748931010 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S second
#define debug(x) cout << (#x) << " is " << (x) << endl
#define lb(arr, n, x) lower_bound(arr, arr + n, x) - arr
#define ub(arr, n, x) upper_bound(arr, arr + n, x) - arr
#define endl "\n"
#define PI 3.14159265358979323846 /* pi */
#define sqr(x) (x) * (x)
#define sign(x) (x > 0) - (x < 0)
#define is_poweroftwo(n) (n && !(n & (n - 1)))
#define all(v) ((v).begin()), ((v).end())
#define degreesToRadians(angleDegrees) \
(angleDegrees * PI / 180.0) // Converts degrees to radians.
#define radiansToDegrees(angleRadians) \
(angleRadians * 180.0 / PI) // Converts radians to degrees.
#define int long long
#define debug(x) cout << (#x) << " is " << (x) << endl
#define AagLgaDe \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
typedef long double ld;
// Calculation of (x^y)%mm
ll mod_exp(ll x, ll y, ll mm) {
if (y == 0)
return (1);
else if (y % 2 == 0)
return (mod_exp((x * x) % mm, y / 2, mm));
else
return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
bool isPowerOfTwo(int n) {
if (n == 0)
return false;
return (ceil(log2(n)) == floor(log2(n)));
}
// int x1[]={+1,-1,+0,+0};
// int y1[]={+0,+0,+1,-1};
// int x2[]={+0,+0,+1,-1,-1,+1,-1,+1};
// int y2[]={-1,+1,+0,+0,+1,+1,-1,-1};
// int x3[]={-2,-2,-1,-1,+1,+1,+2,+2};
// int y3[]={-1,+1,-2,+2,-2,+2,-1,+1};
int solve() {
int n;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++)
cin >> arr[i];
// int ans=0;
vector<int> dp(n + 1, 0);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i] + abs(arr[i - 1] - arr[i - 1]),
dp[i - 2] + abs(arr[i - 2] - arr[i]));
}
return dp[n - 1];
}
signed main() {
AagLgaDe
// int t;cin>>t;while(t--)
cout
<< solve() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S second
#define debug(x) cout << (#x) << " is " << (x) << endl
#define lb(arr, n, x) lower_bound(arr, arr + n, x) - arr
#define ub(arr, n, x) upper_bound(arr, arr + n, x) - arr
#define endl "\n"
#define PI 3.14159265358979323846 /* pi */
#define sqr(x) (x) * (x)
#define sign(x) (x > 0) - (x < 0)
#define is_poweroftwo(n) (n && !(n & (n - 1)))
#define all(v) ((v).begin()), ((v).end())
#define degreesToRadians(angleDegrees) \
(angleDegrees * PI / 180.0) // Converts degrees to radians.
#define radiansToDegrees(angleRadians) \
(angleRadians * 180.0 / PI) // Converts radians to degrees.
#define int long long
#define debug(x) cout << (#x) << " is " << (x) << endl
#define AagLgaDe \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef long long ll;
typedef long double ld;
// Calculation of (x^y)%mm
ll mod_exp(ll x, ll y, ll mm) {
if (y == 0)
return (1);
else if (y % 2 == 0)
return (mod_exp((x * x) % mm, y / 2, mm));
else
return ((x * mod_exp((x * x) % mm, (y - 1) / 2, mm)) % mm);
}
bool isPowerOfTwo(int n) {
if (n == 0)
return false;
return (ceil(log2(n)) == floor(log2(n)));
}
// int x1[]={+1,-1,+0,+0};
// int y1[]={+0,+0,+1,-1};
// int x2[]={+0,+0,+1,-1,-1,+1,-1,+1};
// int y2[]={-1,+1,+0,+0,+1,+1,-1,-1};
// int x3[]={-2,-2,-1,-1,+1,+1,+2,+2};
// int y3[]={-1,+1,-2,+2,-2,+2,-1,+1};
int solve() {
int n;
cin >> n;
vector<int> arr(n, 0);
for (int i = 0; i < n; i++)
cin >> arr[i];
// int ans=0;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i]));
}
return dp[n - 1];
}
signed main() {
AagLgaDe
// int t;cin>>t;while(t--)
cout
<< solve() << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.change"
] | 951,881 | 951,880 | u748931010 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> &dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] == -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[index] - arr[index - 2]) + minHeight(arr, dp, index - 2));
}
return dp[index];
}
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> ans(n, -1);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
minHeight(arr, ans, 2);
cout << ans[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> &dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] == -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[index] - arr[index - 2]) + minHeight(arr, dp, index - 2));
}
return dp[index];
}
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> ans(n, -1);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
minHeight(arr, ans, n - 1);
cout << ans[n - 1] << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 951,882 | 951,883 | u437546797 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] != -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[index] - arr[index - 2]) + minHeight(arr, dp, index - 2));
}
return dp[index];
}
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> ans(n, -1);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
minHeight(arr, ans, 2);
cout << ans[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> &dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] == -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[index] - arr[index - 2]) + minHeight(arr, dp, index - 2));
}
return dp[index];
}
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> ans(n, -1);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
minHeight(arr, ans, n - 1);
cout << ans[n - 1] << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 951,884 | 951,883 | u437546797 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1], i, j;
for (i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
for (i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= 2 && (i + j) <= n; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1], i, j;
for (i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
for (i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= 2 && (i + j) <= n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"assignment.change"
] | 951,887 | 951,888 | u051694454 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int h[]) {
int dp[n] = {INT_MAX};
dp[0] = h[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]));
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = frog(n, h);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int h[]) {
int dp[n] = {INT_MAX};
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]));
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans = frog(n, h);
cout << ans << endl;
return 0;
} | [] | 951,891 | 951,892 | u103298438 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
//////////////////
#ifdef DEBUG
#include "debug.h"
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
// http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
//////////////////
#define int long long
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
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 (a > b) {
a = b;
return 1;
}
return 0;
}
//*
#define mod \
1000000007 /*/ \
#define mod 998244353 //*/
typedef pair<int, int> P;
#define INF (1LL << 60)
void solve() {
int N;
cin >> N;
vector<int> h(N + 1);
rep(i, N) cin >> h[i + 1];
vector<int> dp(N + 1, INF);
dp[1] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N] << endl;
}
signed main() {
cout << fixed << setprecision(18);
// cerr << fixed << setprecision(18);
solve();
}
| #include <bits/stdc++.h>
using namespace std;
//////////////////
#ifdef DEBUG
#include "debug.h"
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
// http://beet-aizu.hatenablog.com/entry/2018/04/08/145516
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
//////////////////
#define int long long
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
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 (a > b) {
a = b;
return 1;
}
return 0;
}
//*
#define mod \
1000000007 /*/ \
#define mod 998244353 //*/
typedef pair<int, int> P;
#define INF (1LL << 60)
void solve() {
int N;
cin >> N;
vector<int> h(N + 1);
rep(i, N) cin >> h[i + 1];
vector<int> dp(N + 2, INF);
dp[1] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N] << endl;
}
signed main() {
cout << fixed << setprecision(18);
// cerr << fixed << setprecision(18);
solve();
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,893 | 951,894 | u592610268 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = height[1] - height[0];
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 1] - height[i - 3]) + dp[i - 2]));
}
return dp[n];
}
int main() {
int n;
cin >> n;
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
cout << minSteps(height, n);
}
| #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = abs(height[1] - height[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 1] - height[i - 3]) + dp[i - 2]));
}
return dp[n];
}
int main() {
int n;
cin >> n;
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
cout << minSteps(height, n);
}
| [
"call.add",
"call.arguments.change"
] | 951,897 | 951,898 | u337524871 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = height[1] - height[0];
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 2] - height[i - 3]) + dp[i - 2]));
}
return dp[n];
}
int main() {
int n;
cin >> n;
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
cout << minSteps(height, n);
} | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = abs(height[1] - height[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 1] - height[i - 3]) + dp[i - 2]));
}
return dp[n];
}
int main() {
int n;
cin >> n;
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
cout << minSteps(height, n);
}
| [
"call.add",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 951,899 | 951,898 | u337524871 | cpp |
p03160 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(res * a, c);
a = mod(a * a, c);
b >>= 1;
}
return res;
}
int GCD(int x, int y) {
if (x < y) {
swap(x, y);
}
while (x % y != 0) {
int temp = x;
x = y;
y = temp % y;
}
return y;
}
int par[100001], r[100001];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
r[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (r[x] < r[y]) {
par[x] = y;
} else {
par[y] = x;
if (r[x] == r[y])
r[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 2] + abs(h[i - 1] - h[i - 3]),
dp[i - 1] + h[i - 1] - h[i - 2]);
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = mod(res * a, c);
a = mod(a * a, c);
b >>= 1;
}
return res;
}
int GCD(int x, int y) {
if (x < y) {
swap(x, y);
}
while (x % y != 0) {
int temp = x;
x = y;
y = temp % y;
}
return y;
}
int par[100001], r[100001];
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
r[i] = 0;
}
}
int find(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = find(par[x]);
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (r[x] < r[y]) {
par[x] = y;
} else {
par[y] = x;
if (r[x] == r[y])
r[x]++;
}
}
bool same(int x, int y) { return find(x) == find(y); }
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 2] + abs(h[i - 1] - h[i - 3]),
dp[i - 1] + abs(h[i - 1] - h[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 951,902 | 951,903 | u201553784 | cpp |
p03160 | // Program.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frC(i, n) for (int i = 0; (i < (n)) && (c); ++i)
#define frA(i, a, n) for (int i = a; i <= (n); ++i)
#define frD(i, a, n) for (int i = a; i >= (n); --i)
#define fill(a) memset(a, 0, sizeof(a))
#define revsort(a, b) sort(a, b, greater<int>())
#define dout \
if (DEBUGGING) \
cout
#define dbg if (DEBUGGING)
#define endl "\n"
int DEBUGGING = 0;
const int INF = 1000000000;
const int MOD = 1000000007;
const double PI = 3.1415926535897932;
const double EPS = 1e-7;
void solve(int TEST_CASE) {
int n;
cin >> n;
int arr[n];
int m[n];
fr(i, n) {
cin >> arr[i];
m[i] = INF;
}
for (int i = 0; i < n; ++i) {
if (i == 0)
m[i] = 0;
else if (i == 1)
m[i] = abs(arr[n - 2] - arr[n - 1]);
else {
int a1 = m[i - 2] + abs(arr[i] - arr[i - 2]);
int a2 = m[i - 1] + abs(arr[i] - arr[i - 1]);
m[i] = min(a1, a2);
}
}
cout << m[n - 1] << endl;
}
int main(int argc, char *argv[]) {
if (argc == 2 && argv[1][1] == 'v')
DEBUGGING = 1;
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int nTestCases = 1;
// cin >> nTestCases;
frA(i, 1, nTestCases) solve(i);
return 0;
} | // Program.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frC(i, n) for (int i = 0; (i < (n)) && (c); ++i)
#define frA(i, a, n) for (int i = a; i <= (n); ++i)
#define frD(i, a, n) for (int i = a; i >= (n); --i)
#define fill(a) memset(a, 0, sizeof(a))
#define revsort(a, b) sort(a, b, greater<int>())
#define dout \
if (DEBUGGING) \
cout
#define dbg if (DEBUGGING)
#define endl "\n"
int DEBUGGING = 0;
const int INF = 1000000000;
const int MOD = 1000000007;
const double PI = 3.1415926535897932;
const double EPS = 1e-7;
void solve(int TEST_CASE) {
int n;
cin >> n;
int arr[n];
int m[n];
fr(i, n) {
cin >> arr[i];
m[i] = INF;
}
for (int i = 0; i < n; ++i) {
if (i == 0)
m[i] = 0;
else if (i == 1)
m[i] = abs(arr[1] - arr[0]);
else {
int a1 = m[i - 2] + abs(arr[i] - arr[i - 2]);
int a2 = m[i - 1] + abs(arr[i] - arr[i - 1]);
m[i] = min(a1, a2);
}
}
cout << m[n - 1] << endl;
}
int main(int argc, char *argv[]) {
if (argc == 2 && argv[1][1] == 'v')
DEBUGGING = 1;
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int nTestCases = 1;
// cin >> nTestCases;
frA(i, 1, nTestCases) solve(i);
return 0;
} | [
"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"
] | 951,907 | 951,908 | u701566212 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 0; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(as[i] - as[i - 1]),
dp[i - 2] + abs(as[i] - as[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(as[i] - as[i - 1]),
dp[i - 2] + abs(as[i] - as[i - 2]));
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 951,909 | 951,910 | u067151927 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e5 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
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]));
}
}
}
/*
for (auto x : dp) {
cerr << x << " ";
} cerr << endl;
*/
cout << dp[n - 1] << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
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]));
}
}
}
/*
for (auto x : dp) {
cerr << x << " ";
} cerr << endl;
*/
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 951,917 | 951,918 | u358973239 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e5 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
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]));
}
}
}
/*
for (auto x : dp) {
cerr << x << " ";
} cerr << endl;
*/
cerr << dp[n - 1] << endl;
return 0;
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
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]));
}
}
}
/*
for (auto x : dp) {
cerr << x << " ";
} cerr << endl;
*/
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 951,920 | 951,918 | u358973239 | cpp |
p03160 | #include "bits/stdc++.h"
#define ll long long
#define inf 1e9
using namespace std;
int main() {
ll n;
cin >> n;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n - 2; i++) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include "bits/stdc++.h"
#define ll long long
#define inf 1e9
using namespace std;
int main() {
ll n;
cin >> n;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 951,930 | 951,931 | u165543937 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
bool compare(string &a, string &b) { return a.length() > b.length(); }
void solve() {
int n;
cin >> n;
ll a[n];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> dp(n + 1);
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] - a[i - 2] + dp[i - 2]));
}
cout << dp[n] << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
bool compare(string &a, string &b) { return a.length() > b.length(); }
void solve() {
int n;
cin >> n;
ll a[n];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> dp(n + 1);
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(abs(a[i] - a[i - 2]) + dp[i - 2]));
}
cout << dp[n] << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| [
"call.arguments.change",
"call.add"
] | 951,932 | 951,933 | u500482384 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int arr[100005];
int dp[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll mi = 0;
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int arr[100005];
int dp[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll mi = 0;
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
}
cout << dp[n - 1];
return 0;
} | [
"expression.operation.binary.add"
] | 951,934 | 951,935 | u500482384 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = arr[2] - arr[1];
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
cout << dp[n] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
cout << dp[n] << endl;
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 951,936 | 951,937 | u733347296 | 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];
memset(dp, 0, sizeof(dp));
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
}
cout << dp[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];
memset(dp, 0, sizeof(dp));
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
} | [
"expression.operation.binary.add"
] | 951,942 | 951,943 | u696991379 | cpp |
p03160 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
int main(void) {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = 1000000;
}
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[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>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
int main(void) {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = 1000000000;
}
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 951,944 | 951,945 | u150155436 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n];
vector<int> v(n);
for (auto &x : v)
cin >> x;
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n];
vector<int> v(n);
for (auto &x : v)
cin >> x;
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1];
} | [
"expression.operation.binary.add"
] | 951,946 | 951,947 | u217317073 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
typedef pair<int, int> P;
signed main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N);
dp[0] = h[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]));
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
typedef pair<int, int> P;
signed main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<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 - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[N - 1] << endl;
} | [] | 951,948 | 951,949 | u237390401 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n;
cin >> n;
vector<long int> c(n, 0);
for (int i = 1; i < n; i++) {
cin >> c[i];
}
vector<long int> dp(n, 100000000);
dp[0] = 0;
dp[1] = abs(c[0]);
for (int i = 2; i < n; i++) {
if (dp[i - 1] + abs(c[i - 1] - c[i]) < dp[i - 2] + abs(c[i - 2] - c[i])) {
dp[i] = dp[i - 1] + abs(c[i - 1] - c[i]);
} else {
dp[i] = dp[i - 2] + abs(c[i - 2] - c[i]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n;
cin >> n;
vector<long int> c(n, 0);
for (int i = 0; i < n; i++) {
cin >> c[i];
}
vector<long int> dp(n, 100000000);
dp[0] = 0;
dp[1] = abs(c[1] - c[0]);
for (int i = 2; i < n; i++) {
if (dp[i - 1] + abs(c[i - 1] - c[i]) < dp[i - 2] + abs(c[i - 2] - c[i])) {
dp[i] = dp[i - 1] + abs(c[i - 1] - c[i]);
} else {
dp[i] = dp[i - 2] + abs(c[i - 2] - c[i]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 951,956 | 951,957 | u632118923 | cpp |
p03160 | #include <iostream>
#define inf 1e9
using namespace std;
int solve(int arr[], int n) {
int dp[n + 1]; // minimum cost to reach the ith stone
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(arr[i] - arr[i - 1] + dp[i - 1]);
int option2 = (i == 2) ? inf : abs(arr[i] - arr[i - 2] + dp[i - 2]);
dp[i] = min(option2, option1);
}
return dp[n];
}
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
cout << solve(arr, n);
return 0;
} | #include <iostream>
#define inf 1e9
using namespace std;
int solve(int arr[], int n) {
int dp[n + 1]; // minimum cost to reach the ith stone
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int option2 = (i == 2) ? inf : abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(option2, option1);
}
return dp[n];
}
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
cout << solve(arr, n);
return 0;
} | [
"call.arguments.change"
] | 951,958 | 951,959 | u189511022 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int n;
vector<int> h;
int dp[100001];
int v[100001];
int s1(int i) {
if (i == n - 1) {
return abs(h[n] - h[i]);
}
if (i == n - 2) {
return min(abs(h[n] - h[n - 2]),
abs(h[n - 1] - h[n - 2]) + abs(h[n - 1] - h[n - 2]));
// return abs(h[n]-h[n-2]);
}
if (i == n) {
return 0;
}
if (v[i]) {
return dp[i];
}
v[i] = 1;
int thing1 = abs(h[i + 1] - h[i]) + s1(i + 1);
int thing2 = abs(h[i + 2] - h[i]) + s1(i + 2);
dp[i] = min(thing2, thing1);
return dp[i];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
h.resize(n + 1);
h[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << s1(1) << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int n;
vector<int> h;
int dp[100001];
int v[100001];
int s1(int i) {
if (i == n - 1) {
return abs(h[n] - h[i]);
}
if (i == n - 2) {
return min(
abs(h[n] - h[n - 2]),
abs(h[n] - h[n - 1]) +
abs(h[n - 1] - h[n - 2])); // If I remove this if statement it works
}
if (i == n) {
return 0;
}
if (v[i]) {
return dp[i];
}
v[i] = 1;
int thing1 = abs(h[i + 1] - h[i]) + s1(i + 1);
int thing2 = abs(h[i + 2] - h[i]) + s1(i + 2);
dp[i] = min(thing2, thing1);
return dp[i];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
h.resize(n + 1);
h[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << s1(1) << '\n';
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 951,962 | 951,963 | u976563729 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 1]) + dp[i - 1], abs(v[i] - v[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 1]) + dp[i - 1], abs(v[i] - v[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 951,968 | 951,969 | u109156113 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 1]) + dp[i - 1], abs(v[i] - v[i - 1]) + dp[i - 2]);
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 1]) + dp[i - 1], abs(v[i] - v[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
return 0;
}
| [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 951,970 | 951,969 | u109156113 | cpp |
p03160 | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad !
___man be to dami gharar natvanam kard
___va ehsane to ra shomar natvanam kard
####################
___gar bar tane man zaban shavad har moyee
___yek shokre to az hezar natvanam kard
*/
#include <bits/stdc++.h>
#define pb push_back
#define SALI main
#define left(x) ((x)*2)
#define right(x) (((x)*2) + 1)
#define fuck(x) cout << #x << " : " << x << endl;
#define findLowVec(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define findUpVec(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define findLowArr(a, n, x) (lower_bound(a, a + n, x) - a)
#define findUpArr(a, n, x) (upper_bound(a, a + n, x) - a)
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &v) {
out << "[";
for (int i = 0; i < v.size(); i++) {
if (i)
out << ", ";
out << v[i];
}
return out << "]";
}
template <class A, class B>
ostream &operator<<(ostream &out, const set<A, B> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
template <class A> ostream &operator<<(ostream &out, const set<A> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
const int inf = 1e9 + 7;
int32_t SALI() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, inf);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min({dp[i], dp[i - 1] + abs(dp[i] - dp[i - 1]),
dp[i - 2] + abs(dp[i] - dp[i - 2])});
}
cout << dp[n - 1] << endl;
}
/**< WRITEN BY ALI ADELKHAH */
| /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad !
___man be to dami gharar natvanam kard
___va ehsane to ra shomar natvanam kard
####################
___gar bar tane man zaban shavad har moyee
___yek shokre to az hezar natvanam kard
*/
#include <bits/stdc++.h>
#define pb push_back
#define SALI main
#define left(x) ((x)*2)
#define right(x) (((x)*2) + 1)
#define fuck(x) cout << #x << " : " << x << endl;
#define findLowVec(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define findUpVec(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define findLowArr(a, n, x) (lower_bound(a, a + n, x) - a)
#define findUpArr(a, n, x) (upper_bound(a, a + n, x) - a)
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &v) {
out << "[";
for (int i = 0; i < v.size(); i++) {
if (i)
out << ", ";
out << v[i];
}
return out << "]";
}
template <class A, class B>
ostream &operator<<(ostream &out, const set<A, B> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
template <class A> ostream &operator<<(ostream &out, const set<A> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
const int inf = 1e9 + 7;
int32_t SALI() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, inf);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min({dp[i], dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2])});
}
cout << dp[n - 1] << endl;
}
/**< WRITEN BY ALI ADELKHAH */
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,971 | 951,972 | u232873057 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int p = 0;
int q = arr[1] - arr[0];
for (int i = 2; i < N; i++) {
int temp = min(abs(arr[i] - arr[i - 2]) + p, abs(arr[i] - arr[i - 1]) + q);
p = q;
q = temp;
}
cout << q << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int p = 0;
int q = abs(arr[1] - arr[0]);
for (int i = 2; i < N; i++) {
int temp = min(abs(arr[i] - arr[i - 2]) + p, abs(arr[i] - arr[i - 1]) + q);
p = q;
q = temp;
}
cout << q << endl;
} | [
"call.add",
"call.arguments.change"
] | 951,973 | 951,974 | u259733964 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less_equal<ll>, rb_tree_tag, \
tree_order_statistics_node_update>
#define PI 3.14159265
#define ll long long
#define ld long double
#define vi vector<int>
#define pb push_back
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 300000000000000001
#define infx 9223372036854775806
#define all(c) c.begin(), c.end()
#define mk(x, yy) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define ff first
#define ss second
#define re return
// #define endl "\n"
#define max2(x, y) (x > y) ? x : y
#define min2(x, y) (x < y) ? x : y
#define mid(s, e) (s + (e - s) / 2)
#define mini INT_MIN
#define maxo INT_MAX
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define read(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define show(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '; \
cout << endl
#define ene cout << "\n";
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
bool compr(std::vector<ll> a, std::vector<ll> b) {
if (a[0] == b[0])
return a[1] < b[1];
else
return a[0] < b[0];
}
bool comp(std::vector<ll> a, std::vector<ll> b) {
if (a[1] == b[1] && a[2] == b[2])
return a[0] < b[0];
else if (a[1] == b[1])
return a[2] > b[2];
else
return a[1] < b[1];
}
vector<ll> ans;
ll dfs(vector<ll> adj[], ll x, ll visited[], ll n) {
visited[x] = 1;
ll child = 1;
for (ll i = 0; i < adj[x].size(); i++) {
if (visited[adj[x][i]] == 0) {
ll ch = dfs(adj, adj[x][i], visited, n);
ans.push_back(ch * (n - ch));
child += ch;
}
}
return child;
}
int main() {
#ifdef SHIVANSH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll dp[n] = {};
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) + dp[i - 2], abs(a[i] - a[i - 1]) + dp[i - 1]);
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set \
tree<ll, null_type, less_equal<ll>, rb_tree_tag, \
tree_order_statistics_node_update>
#define PI 3.14159265
#define ll long long
#define ld long double
#define vi vector<int>
#define pb push_back
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 300000000000000001
#define infx 9223372036854775806
#define all(c) c.begin(), c.end()
#define mk(x, yy) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define ff first
#define ss second
#define re return
// #define endl "\n"
#define max2(x, y) (x > y) ? x : y
#define min2(x, y) (x < y) ? x : y
#define mid(s, e) (s + (e - s) / 2)
#define mini INT_MIN
#define maxo INT_MAX
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define read(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define show(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << ' '; \
cout << endl
#define ene cout << "\n";
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
bool compr(std::vector<ll> a, std::vector<ll> b) {
if (a[0] == b[0])
return a[1] < b[1];
else
return a[0] < b[0];
}
bool comp(std::vector<ll> a, std::vector<ll> b) {
if (a[1] == b[1] && a[2] == b[2])
return a[0] < b[0];
else if (a[1] == b[1])
return a[2] > b[2];
else
return a[1] < b[1];
}
vector<ll> ans;
ll dfs(vector<ll> adj[], ll x, ll visited[], ll n) {
visited[x] = 1;
ll child = 1;
for (ll i = 0; i < adj[x].size(); i++) {
if (visited[adj[x][i]] == 0) {
ll ch = dfs(adj, adj[x][i], visited, n);
ans.push_back(ch * (n - ch));
child += ch;
}
}
return child;
}
int main() {
#ifdef SHIVANSH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll dp[n] = {};
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) + dp[i - 2], abs(a[i] - a[i - 1]) + dp[i - 1]);
// cout<<dp[i]<<endl;
}
cout << dp[n - 1] << endl;
} | [] | 951,977 | 951,978 | u206663422 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long a = 0, b = abs(arr[1] - arr[0]), c;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
}
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long a = 0, b = abs(arr[1] - arr[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
}
cout << c << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 951,979 | 951,980 | u653611614 | 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];
}
long a = 0, b = abs(arr[1] - arr[0]), c;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
}
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long a = 0, b = abs(arr[1] - arr[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
}
cout << c << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 951,981 | 951,980 | u653611614 | 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 a = 0, b = abs(arr[1] - arr[0]), c;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
}
cout << c << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long a = 0, b = abs(arr[1] - arr[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
}
cout << c << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 951,982 | 951,980 | u653611614 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll a[200005];
ll b[200005];
ll h[200005];
ll dp[200005];
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = h[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;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll a[200005];
ll b[200005];
ll h[200005];
ll dp[200005];
typedef pair<int, int> P;
int main() {
ll n;
cin >> 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;
return 0;
} | [] | 951,994 | 951,995 | u077051605 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int a[1000000];
int getans(int i, int n) {
if (i == 0) {
return dp[i] = 0;
}
if (dp[i] != -1) {
return dp[i];
}
int cost = abs(a[i] - a[i + 1]) + getans(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + getans(i + 2, n));
// return cost;
}
return dp[i] = cost;
// return dp[i];
}
int main() {
int n;
cin >> n;
// int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof(dp));
int ans = getans(1, n);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int a[1000000];
int getans(int i, int n) {
if (i == n) {
return dp[i] = 0;
}
if (dp[i] != -1) {
return dp[i];
}
int cost = abs(a[i] - a[i + 1]) + getans(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + getans(i + 2, n));
// return cost;
}
return dp[i] = cost;
// return dp[i];
}
int main() {
int n;
cin >> n;
// int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof(dp));
int ans = getans(1, n);
cout << ans << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 951,998 | 951,999 | u181739580 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define ff first
#define ss second
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define pb push_back
#define mkp make_pair
#define all(v) (v).begin(), (v).end()
#define pii pair<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define rev(x) reverse(all(x))
#define gcd(m, n) __gcd(m, n)
#define negmod(x, m) ((x) % (m) + (m)) % (m)
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define M 1000000007
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
ull countBits(ull n) {
ull count = 0;
while (n) {
count++;
n >>= 1;
}
return count;
}
int updiv(int a, int b) {
if (a % b == 0)
return (a / b);
else
return (a / b) + 1;
}
int mymod(int x, int m) {
if (x > 0)
return x % m;
else
return negmod(x, m);
}
int binpow(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
bool second_sort(const pii &lhs, const pii &rhs) {
pii a, b;
a.ff = lhs.ss;
a.ss = lhs.ff;
b.ff = rhs.ss;
b.ss = rhs.ff;
return a < b;
}
int32_t main() {
fast int t = 1, n;
// cin>>t;
while (t--) {
cin >> n;
int h[n + 1] = {0};
for (int i = 1; i < n; i++) {
cin >> h[i];
}
int dp[n + 1] = {0};
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
cout << dp[n] << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define ff first
#define ss second
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define pb push_back
#define mkp make_pair
#define all(v) (v).begin(), (v).end()
#define pii pair<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define rev(x) reverse(all(x))
#define gcd(m, n) __gcd(m, n)
#define negmod(x, m) ((x) % (m) + (m)) % (m)
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define M 1000000007
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
ull countBits(ull n) {
ull count = 0;
while (n) {
count++;
n >>= 1;
}
return count;
}
int updiv(int a, int b) {
if (a % b == 0)
return (a / b);
else
return (a / b) + 1;
}
int mymod(int x, int m) {
if (x > 0)
return x % m;
else
return negmod(x, m);
}
int binpow(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
bool second_sort(const pii &lhs, const pii &rhs) {
pii a, b;
a.ff = lhs.ss;
a.ss = lhs.ff;
b.ff = rhs.ss;
b.ss = rhs.ff;
return a < b;
}
int32_t main() {
fast int t = 1, n;
// cin>>t;
while (t--) {
cin >> n;
int h[n + 1] = {0};
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1] = {0};
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
cout << dp[n] << "\n";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 952,007 | 952,008 | u845142924 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[0] - 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 - 1] << endl;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 2; 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 - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,009 | 952,010 | u192243254 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define ll long long
#define debug(x) cout << "debug: " << x << endl
#define MOD 1e9 + 7
#define INF 1e9
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp_table(n, INF);
dp_table[0] = 0;
rep(i, n) {
chmin(dp_table[i], h[i] - h[i - 1] + dp_table[i - 1]);
if (i > 1) {
chmin(dp_table[i], h[i] - h[i - 2] + dp_table[i - 2]);
}
}
cout << dp_table[n - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define ll long long
#define debug(x) cout << "debug: " << x << endl
#define MOD 1e9 + 7
#define INF 1e9
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp_table(n, INF);
dp_table[0] = 0;
rep(i, n) {
chmin(dp_table[i], abs(h[i] - h[i - 1]) + dp_table[i - 1]);
if (i > 1) {
chmin(dp_table[i], abs(h[i] - h[i - 2]) + dp_table[i - 2]);
}
}
cout << dp_table[n - 1] << endl;
} | [
"call.add",
"call.arguments.change"
] | 952,015 | 952,016 | u296160120 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (auto &i : arr)
cin >> i;
vector<int> ans(n);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ans[i] = min(abs(arr[i] - arr[i - 1]) + ans[i - 1],
ans[i - 2] + abs(arr[i - 2] - arr[i]));
}
cout << arr[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (auto &i : arr)
cin >> i;
vector<int> ans(n);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ans[i] = min(abs(arr[i] - arr[i - 1]) + ans[i - 1],
ans[i - 2] + abs(arr[i - 2] - arr[i]));
}
cout << ans[n - 1] << endl;
} | [
"identifier.change",
"io.output.change"
] | 952,019 | 952,020 | u756206025 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> st(n);
vector<int> cost(n, 0);
for (int i = 0; i < n; i++) {
cin >> st[i];
}
cost[0] = 0;
cost[1] = abs(st[1] - st[0]);
for (int i = 2; i < n; i++) {
cost[i] = min(cost[i - 1] + abs(st[i] - st[i - 1]),
cost[i - 2] + abs(st[i] - st[i - 2]));
cout << cost[n - 1];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> st(n);
vector<int> cost(n, 0);
for (int i = 0; i < n; i++) {
cin >> st[i];
}
cost[0] = 0;
cost[1] = abs(st[1] - st[0]);
for (int i = 2; i < n; i++) {
cost[i] = min(cost[i - 1] + abs(st[i] - st[i - 1]),
cost[i - 2] + abs(st[i] - st[i - 2]));
}
cout << cost[n - 1];
return 0;
} | [] | 952,021 | 952,022 | u047452604 | cpp |
p03160 | // Lets go to the next level
// AIM CM at CF *__* asap
// Hit A,B,C and D faster and reach Candidate Master
// Remember you were also a novice when you started,
// hence never be rude to anyone who wants to learn something
// Never open a ranklist untill and unless you are done with solving problems,
// wastes 3/4 minuts Donot treat CP as a placement thing, love it and enjoy it,
// you will succeed for sure.
#include <bits/stdc++.h>
using namespace std;
#define mod (int)1000000007
#define MOD (int)10000000007
// Big two primes
#define X 1001100011100001111ll
#define M 26388279066623ll
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for0e(i, n) for (int i = 0; i <= n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define bloop(i, a, b) for (int i = a; i >= b; i--)
#define tc(t) \
int t; \
cin >> t; \
while (t--)
#define int long long
#define ll long long
#define pb emplace_back
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define in(x) scanf("%d", &x)
#define rr return 0
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define inf (int)(1e18)
#define ini(a, i) memset(a, i, sizeof(a))
#define vi vector<int>
#define F first
#define S second
#define pi pair<int, int>
#define ppi pair<pair<int, int>, int>
#define vii vector<pi>
const int MAXN = (int)((1e5) + 100);
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int cbrt(int x) {
int lo = 1, hi = min(2000000ll, x);
while (hi - lo > 1) {
int mid = (lo + hi) / 2;
if (mid * mid * mid < x) {
lo = mid;
} else
hi = mid;
}
if (hi * hi * hi <= x)
return hi;
else
return lo;
}
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const int N = (int)(1e6 + 5);
signed main() {
fio;
int n;
cin >> n;
vector<int> h(n), dp(n, inf);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 20], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1];
rr;
} | #include <bits/stdc++.h>
using namespace std;
#define mod (int)1000000007
#define MOD (int)10000000007
// Big two primes
#define X 1001100011100001111ll
#define M 26388279066623ll
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for0e(i, n) for (int i = 0; i <= n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define bloop(i, a, b) for (int i = a; i >= b; i--)
#define tc(t) \
int t; \
cin >> t; \
while (t--)
#define int long long
#define ll long long
#define pb emplace_back
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define in(x) scanf("%d", &x)
#define rr return 0
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define inf (int)(1e18)
#define ini(a, i) memset(a, i, sizeof(a))
#define vi vector<int>
#define F first
#define S second
#define pi pair<int, int>
#define ppi pair<pair<int, int>, int>
#define vii vector<pi>
const int MAXN = (int)((1e5) + 100);
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int cbrt(int x) {
int lo = 1, hi = min(2000000ll, x);
while (hi - lo > 1) {
int mid = (lo + hi) / 2;
if (mid * mid * mid < x) {
lo = mid;
} else
hi = mid;
}
if (hi * hi * hi <= x)
return hi;
else
return lo;
}
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const int N = (int)(1e6 + 5);
signed main() {
fio;
int n;
cin >> n;
vector<int> h(n), dp(n, inf);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
rr;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 952,025 | 952,026 | u923715191 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int i, j, n, m, dp;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int mod(int a) {
if (a < 0)
return a * (-1);
return a;
}
int steps(int *A, int n, int N) {
int dp[N];
dp[0] = 0;
dp[1] = mod(A[1] - A[0]);
dp[2] = min(dp[1] + mod(A[1] - A[0]), mod(A[2] - A[0]));
for (i = 3; i < N; i++) {
dp[i] =
min(dp[i - 1] + mod(A[i] - A[i - 1]), dp[i - 2] + mod(A[i] - A[i - 2]));
}
return dp[N - 1];
}
int main() {
int N;
cin >> N;
int a;
int A[N];
for (int i = 0; i < N; i++) {
cin >> a;
A[i] = a;
}
if (N == 1)
cout << 0;
if (N == 0)
cout << 0;
else if (N == 2)
cout << mod(A[1] - A[0]);
else
cout << steps(A, 0, N);
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int i, j, n, m, dp;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int mod(int a) {
if (a < 0)
return a * (-1);
return a;
}
int steps(int *A, int n, int N) {
int dp[N];
dp[0] = 0;
dp[1] = mod(A[1] - A[0]);
dp[2] = min(dp[1] + mod(A[2] - A[1]), mod(A[2] - A[0]));
for (i = 3; i < N; i++) {
dp[i] =
min(dp[i - 1] + mod(A[i] - A[i - 1]), dp[i - 2] + mod(A[i] - A[i - 2]));
}
return dp[N - 1];
}
int main() {
int N;
cin >> N;
int a;
int A[N];
for (int i = 0; i < N; i++) {
cin >> a;
A[i] = a;
}
if (N == 1)
cout << 0;
else if (N == 0)
cout << 0;
else if (N == 2)
cout << mod(A[1] - A[0]);
else
cout << steps(A, 0, N);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 952,027 | 952,028 | u245521778 | cpp |
p03160 | /*input
4
10 30 40 20
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define ar array
#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 rep(i, n) for (int i = 0; i < (n); i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define tests \
int r; \
cin >> r; \
while (r--)
#define MP make_pair
#define PI acos(-1)
typedef pair<long long, long long> PII;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
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;
#define godspeed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define M(x) ((x) % (1000000007))
int64 fact(int n) {
int64 count = 1;
for (int64 i = 1; i <= n; i++) {
count = M(count * i);
}
return count;
}
int main() {
int n;
cin >> n;
int64 arr[n];
rep(i, n) {
int a;
cin >> a;
arr[i] = a;
}
int64 dp[n];
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1] << endl;
} | /*input
2
10 10
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define ar array
#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 rep(i, n) for (int i = 0; i < (n); i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define tests \
int r; \
cin >> r; \
while (r--)
#define MP make_pair
#define PI acos(-1)
typedef pair<long long, long long> PII;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
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;
#define godspeed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define M(x) ((x) % (1000000007))
int64 fact(int n) {
int64 count = 1;
for (int64 i = 1; i <= n; i++) {
count = M(count * i);
}
return count;
}
int main() {
int n;
cin >> n;
int64 arr[n];
rep(i, n) {
int a;
cin >> a;
arr[i] = a;
}
int64 dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1] << endl;
} | [] | 952,032 | 952,033 | u751790772 | cpp |
p03160 | #include <stdio.h>
int abs(int);
int min(int, int);
void output(int, int *);
int main() {
int n;
int h[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
int dp[100000] = {};
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++) {
if (i == 0) {
dp[0] = h[i];
// output(n,dp);
continue;
}
if (i == 1) {
dp[i] = abs(h[i - 1] - h[i]);
// output(n,dp);
continue;
}
dp[i] =
min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]);
// output(n,dp);
}
printf("%d\n", dp[n - 1]);
}
int abs(int n) {
if (n >= 0)
return n;
else
return -n;
}
int min(int a, int b) {
if (a <= b)
return a;
if (b < a)
return b;
return 0;
}
void output(int n, int dp[]) {
for (int i = 0; i < n; i++) {
printf("dp[%d]=%d\n", i, dp[i]);
}
} | #include <stdio.h>
int abs(int);
int min(int, int);
void output(int, int *);
int main() {
int n;
int h[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
int dp[100000] = {};
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++) {
if (i == 0) {
dp[0] = 0;
// output(n,dp);
continue;
}
if (i == 1) {
dp[i] = abs(h[i - 1] - h[i]);
// output(n,dp);
continue;
}
dp[i] =
min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]);
// output(n,dp);
}
printf("%d\n", dp[n - 1]);
}
int abs(int n) {
if (n >= 0)
return n;
else
return -n;
}
int min(int a, int b) {
if (a <= b)
return a;
if (b < a)
return b;
return 0;
}
void output(int n, int dp[]) {
for (int i = 0; i < n; i++) {
printf("dp[%d]=%d\n", i, dp[i]);
}
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,036 | 952,037 | u691912637 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 <= n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(1, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == (n - 1))
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 < n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(0, n) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"literal.number.change",
"io.output.change"
] | 952,038 | 952,039 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 < n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(1, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == (n - 1))
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 < n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(0, n) << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 952,040 | 952,039 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 <= n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(1, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 <= n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> a[i];
cout << solve(1, n) << endl;
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"
] | 952,038 | 952,041 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 < n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(1, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000000];
int a[1000000];
int solve(int i, int n) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = abs(a[i] - a[i + 1]) + solve(i + 1, n);
if (i + 2 <= n)
ans = min(ans, abs(a[i] - a[i + 2]) + solve(i + 2, n));
return dp[i] = ans;
}
int main() {
FIO;
int n;
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> a[i];
cout << solve(1, n) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,040 | 952,041 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pub(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define getl(s) getline(cin, s);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
ll dp[n + 1];
ll h[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (ll i = 3; i <= n; i++) {
dp[i] =
min(dp[n - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pub(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define getl(s) getline(cin, s);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
ll dp[n + 1];
ll h[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = dp[0] = 0;
dp[2] = abs(h[2] - h[1]);
for (ll 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];
return 0;
}
| [
"assignment.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,042 | 952,043 | u142335552 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
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[i]<<' ';
}
// cout<<'\n';
cout << dp[n] << '\n';
return 0;
}
// * * ***** * * * * **** **** **** ** ***
// * * * ** * * * * * * * * * * *
// ***** ***** * * * * * * **** * * * *
// * * * * ** * * * * * * ***** *
// * * ***** * * *** **** * * **** * ****
// **** * * * * *** * * ***** * *
// * * * * * * * * * * * *
// *** ***** * * ***** * * * **** * *
// * * * * * * * * * * * *
// **** * *** * * * * ***** ***
| #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
// cout<<dp[i]<<' ';
}
// cout<<'\n';
cout << dp[n] << '\n';
return 0;
}
// * * ***** * * * * **** **** **** ** ***
// * * * ** * * * * * * * * * * *
// ***** ***** * * * * * * **** * * * *
// * * * * ** * * * * * * ***** *
// * * ***** * * *** **** * * **** * ****
// **** * * * * *** * * ***** * *
// * * * * * * * * * * * *
// *** ***** * * ***** * * * **** * *
// * * * * * * * * * * * *
// **** * *** * * * * ***** ***
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,046 | 952,047 | u370304992 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = arr[2] - arr[1];
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[i]<<' ';
}
// cout<<'\n';
cout << dp[n] << '\n';
return 0;
}
// * * ***** * * * * **** **** **** ** ***
// * * * ** * * * * * * * * * * *
// ***** ***** * * * * * * **** * * * *
// * * * * ** * * * * * * ***** *
// * * ***** * * *** **** * * **** * ****
// **** * * * * *** * * ***** * *
// * * * * * * * * * * * *
// *** ***** * * ***** * * * **** * *
// * * * * * * * * * * * *
// **** * *** * * * * ***** ***
| #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
// cout<<dp[i]<<' ';
}
// cout<<'\n';
cout << dp[n] << '\n';
return 0;
}
// * * ***** * * * * **** **** **** ** ***
// * * * ** * * * * * * * * * * *
// ***** ***** * * * * * * **** * * * *
// * * * * ** * * * * * * ***** *
// * * ***** * * *** **** * * **** * ****
// **** * * * * *** * * ***** * *
// * * * * * * * * * * * *
// *** ***** * * ***** * * * **** * *
// * * * * * * * * * * * *
// **** * *** * * * * ***** ***
| [
"call.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,048 | 952,047 | u370304992 | cpp |
p03160 | /** "Ever tried.
Ever failed.
No matter.
Try Again.
Fail again.
Fail better.**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define oo 0x3f3f3f3f3f3f3f3fLL
#define pb push_back
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define debug(x) cout << " LOOK " << (#x) << " = " << x << '\n'
#define NumofDigits(n) ((long long)log10(n) + 1)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int maxn = 1e5 + 5;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
/*
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
ll fastpow(ll b, ll p)
{if(!p)return 1;ll ret = fastpow(b, p >> 1);ret *= ret;if(p&1)ret*= b;return
ret;} int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};*/
inline void File() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
}
int dp[maxn];
int n;
int arr[maxn];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// File();
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 2]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1] << endl;
}
| /** "Ever tried.
Ever failed.
No matter.
Try Again.
Fail again.
Fail better.**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define oo 0x3f3f3f3f3f3f3f3fLL
#define pb push_back
#define loop(i, n) for (int i = 0; i < int(n); i++)
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define debug(x) cout << " LOOK " << (#x) << " = " << x << '\n'
#define NumofDigits(n) ((long long)log10(n) + 1)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int maxn = 1e5 + 5;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
/*
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
ll fastpow(ll b, ll p)
{if(!p)return 1;ll ret = fastpow(b, p >> 1);ret *= ret;if(p&1)ret*= b;return
ret;} int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};*/
inline void File() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
}
int dp[maxn];
int n;
int arr[maxn];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// File();
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,049 | 952,050 | u973466769 | cpp |
p03160 | #include <cmath>
#include <iostream>
#define INF 2147483637
int main() {
int n;
int d[100005] = {INF};
int h[100005] = {0};
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::cin >> h[i];
}
d[2] = abs(h[1] - h[2]);
d[1] = 0;
for (int i = 2; i <= n; i++) {
d[i] = std::min(d[i - 1] + std::abs(h[i] - h[i - 1]),
d[i - 2] + std::abs(h[i] - h[i - 2]));
}
std::cout << d[n] << '\n';
return 0;
} | #include <cmath>
#include <iostream>
#define INF 2147483637
int main() {
int n;
int d[100005] = {INF};
int h[100005] = {0};
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::cin >> h[i];
}
d[2] = abs(h[1] - h[2]);
d[1] = 0;
for (int i = 3; i <= n; i++) {
d[i] = std::min(d[i - 1] + std::abs(h[i] - h[i - 1]),
d[i - 2] + std::abs(h[i] - h[i - 2]));
}
std::cout << d[n] << '\n';
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,055 | 952,056 | u708220166 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int h[100010] = {0}, d[100010] = {0}, n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
d[1] = 0;
d[2] = h[2] - h[1];
for (int i = 3; i <= n; i++) {
d[i] =
min(d[i - 2] + abs(h[i] - h[i - 2]), d[i - 1] + abs(h[i] - h[i - 1]));
}
cout << d[n] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int h[100010] = {0}, d[100010] = {0}, n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
d[1] = 0;
d[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
d[i] =
min(d[i - 2] + abs(h[i] - h[i - 2]), d[i - 1] + abs(h[i] - h[i - 1]));
}
cout << d[n] << endl;
}
| [
"call.add",
"call.arguments.change"
] | 952,057 | 952,058 | u916678430 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
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(height[i] - height[j]));
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
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(height[i] - height[j]));
}
}
}
cout << dp[n - 1];
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,079 | 952,080 | u395808707 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
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(height[i] - height[j]));
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
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(height[i] - height[j]));
}
}
}
cout << dp[n - 1];
}
| [] | 952,081 | 952,080 | u395808707 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
#define ub upper_bound
#define sum(a) accumulate(all(a), 0ll)
#define lb lower_bound
#define all(v) begin(v), end(v)
#define allr(v) rbegin(v), rend(v)
#define sort_dec(v) sort(all(v), [](auto e1, auto e2) { return e1 > e2; })
#define For(n) for (ll i = 0; i < n; i++)
#define Forj(n) for (ll j = 0; j < n; j++)
typedef long long int ll;
typedef unsigned long long int ull;
#define fi first
#define se second
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define Mp 1e9 + 7
#define vpll vector<pair<ll, ll>>
#define bug(n) \
{ \
cout << n; \
return; \
}
#define cont(n) \
{ \
cout << n << endl; \
continue; \
}
#define pb push_back
void solve() {
ll n;
cin >> n;
ll a[n];
For(n) cin >> a[i];
ll dp[n];
dp[0] = a[0];
dp[1] = abs(a[0] - a[1]);
rep(i, 2, n) dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
// For(n)cout<<dp[i]<<" ";cout<<endl;
cout << dp[n - 1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("error.txt", "w", stderr);
int t = 1;
while (t--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ub upper_bound
#define sum(a) accumulate(all(a), 0ll)
#define lb lower_bound
#define all(v) begin(v), end(v)
#define allr(v) rbegin(v), rend(v)
#define sort_dec(v) sort(all(v), [](auto e1, auto e2) { return e1 > e2; })
#define For(n) for (ll i = 0; i < n; i++)
#define Forj(n) for (ll j = 0; j < n; j++)
typedef long long int ll;
typedef unsigned long long int ull;
#define fi first
#define se second
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define Mp 1e9 + 7
#define vpll vector<pair<ll, ll>>
#define bug(n) \
{ \
cout << n; \
return; \
}
#define cont(n) \
{ \
cout << n << endl; \
continue; \
}
#define pb push_back
void solve() {
ll n;
cin >> n;
ll a[n];
For(n) cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
rep(i, 2, n) dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
// For(n)cout<<dp[i]<<" ";cout<<endl;
cout << dp[n - 1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("error.txt", "w", stderr);
int t = 1;
while (t--) {
solve();
}
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
} | [] | 952,085 | 952,086 | u689408308 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
b[i] = min(b[i - 2] + abs(a[i] - a[i - 2]), b[i] + abs(a[i] - a[i - 1]));
cout << b[n - 1];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
b[i] =
min(b[i - 2] + abs(a[i] - a[i - 2]), b[i - 1] + abs(a[i] - a[i - 1]));
cout << b[n - 1];
}
return 0;
} | [
"assignment.change"
] | 952,087 | 952,088 | u510784445 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = a[1] - a[0];
for (int i = 2; i < n; i++)
b[i] =
min(b[i - 2] + abs(a[i] - a[i - 2]), b[i - 1] + abs(a[i] - a[i - 1]));
cout << b[n - 1];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
b[i] =
min(b[i - 2] + abs(a[i] - a[i - 2]), b[i - 1] + abs(a[i] - a[i - 1]));
cout << b[n - 1];
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 952,089 | 952,088 | u510784445 | 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 d[n];
for (int i = 0; i < n; i++)
d[i] = 10001;
d[0] = 0;
for (int i = 0; i < n; i++) {
int j = i + 1;
int k = i + 2;
if (j < n)
d[j] = min(d[j], d[i] + abs(h[i] - h[j]));
if (k < n)
d[k] = min(d[k], d[i] + abs(h[i] - h[k]));
}
cout << d[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 d[n];
for (int i = 0; i < n; i++)
d[i] = 1e9 + 5;
d[0] = 0;
for (int i = 0; i < n; i++) {
int j = i + 1;
int k = i + 2;
if (j < n)
d[j] = min(d[j], d[i] + abs(h[i] - h[j]));
if (k < n)
d[k] = min(d[k], d[i] + abs(h[i] - h[k]));
}
cout << d[n - 1];
}
| [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 952,090 | 952,091 | u001462978 | cpp |
p03160 | // Abhinav ---IIIT_A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < (int)n; ++i)
#define vpii vector<pair<int, int>>
#define vi vector<int>
#define mpii map<pair<int, int>, int>
#define mpivpii map<int, vector<pair<int, int>>>
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define mpi map<int, int>
#define vvi vector<vector<int>>
#define vvvi vector<vvi>
ld pie = 3.141592653589;
int mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
int k = 1;
int a[n];
f(i, 0, n) cin >> a[i];
int cost[n];
cost[0] = 0;
f(i, 1, n) {
int mn = LLONG_MAX;
for (int j = i - 1; j >= 0 && (i - j) <= k; --j) {
mn = min(mn, cost[j] + abs(a[i] - a[j]));
}
cost[i] = mn;
}
cout << cost[n - 1];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1; // cin>>t;
while (t--)
solve();
return 0;
}
// check for overflows dummy !!!
| // Abhinav ---IIIT_A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < (int)n; ++i)
#define vpii vector<pair<int, int>>
#define vi vector<int>
#define mpii map<pair<int, int>, int>
#define mpivpii map<int, vector<pair<int, int>>>
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define mpi map<int, int>
#define vvi vector<vector<int>>
#define vvvi vector<vvi>
ld pie = 3.141592653589;
int mod = 1e9 + 7;
void solve() {
int n;
cin >> n;
int k = 2; // cin>>k;
int a[n];
f(i, 0, n) cin >> a[i];
int cost[n];
cost[0] = 0;
f(i, 1, n) {
int mn = LLONG_MAX;
for (int j = i - 1; j >= 0 && (i - j) <= k; --j) {
mn = min(mn, cost[j] + abs(a[i] - a[j]));
}
cost[i] = mn;
}
cout << cost[n - 1];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1; // cin>>t;
while (t--)
solve();
return 0;
}
// check for overflows dummy !!!
| [
"literal.number.change",
"variable_declaration.value.change"
] | 952,092 | 952,093 | u587202199 | 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];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2]),
score[i - 1] + abs(h[i] - h[i - 1]));
}
cout << h[N - 1] << endl;
} | #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];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2]),
score[i - 1] + abs(h[i] - h[i - 1]));
}
cout << score[N - 1] << endl;
} | [
"identifier.change",
"io.output.change"
] | 952,098 | 952,099 | u323531048 | 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];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2]),
score[i - 1] + abs(h[i] - h[i - 1]));
}
cout << h[N] << endl;
} | #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];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2]),
score[i - 1] + abs(h[i] - h[i - 1]));
}
cout << score[N - 1] << endl;
} | [
"identifier.change",
"io.output.change"
] | 952,100 | 952,099 | u323531048 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void debug() { cout << endl; }
template <typename T, typename... Args> void debug(T x, Args... args) {
cout << x << " ";
debug(args...);
}
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 100005;
int H[MAX], n, dp[MAX], inf = 1e9;
int f(int i) {
if (i == n - 1)
return 0;
int &ans = dp[i];
if (ans != -1)
return ans;
ans = inf;
if (i + 1 < n)
ans = min(ans, f(i + 1) + abs(H[i] - H[i + 1]));
if (i + 2 < n)
ans = min(ans, f(i + 2) + abs(H[i] - H[i + 1]));
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
forn(i, 0, n) cin >> H[i];
memset(dp, -1, sizeof dp);
dp[n - 1] = 0;
for (int i = n - 1; i >= 0; i--) {
if (i - 1 >= 0)
dp[i - 1] = min(dp[i - 1], dp[i] + abs(H[i] - H[i - 1]));
if (i - 2 >= 0)
dp[i - 2] = min(dp[i - 2], dp[i] + abs(H[i] - H[i - 2]));
}
cout << f(0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
void debug() { cout << endl; }
template <typename T, typename... Args> void debug(T x, Args... args) {
cout << x << " ";
debug(args...);
}
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 100005;
int H[MAX], n, dp[MAX], inf = 1e9;
int f(int i) {
if (i == n - 1)
return 0;
int &ans = dp[i];
if (ans != -1)
return ans;
ans = inf;
if (i + 1 < n)
ans = min(ans, f(i + 1) + abs(H[i] - H[i + 1]));
if (i + 2 < n)
ans = min(ans, f(i + 2) + abs(H[i] - H[i + 2]));
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
forn(i, 0, n) cin >> H[i];
memset(dp, -1, sizeof dp);
dp[n - 1] = 0;
for (int i = n - 1; i >= 0; i--) {
if (i - 1 >= 0)
dp[i - 1] = min(dp[i - 1], dp[i] + abs(H[i] - H[i - 1]));
if (i - 2 >= 0)
dp[i - 2] = min(dp[i - 2], dp[i] + abs(H[i] - H[i - 2]));
}
cout << f(0) << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,106 | 952,107 | u921552251 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {(int)1e9};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 3; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) + dp[i - 2]);
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {(int)1e9};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) + dp[i - 2]);
}
cout << dp[n];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,108 | 952,109 | u846964991 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) + dp[i - 2]);
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {(int)1e9};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) + dp[i - 2]);
}
cout << dp[n];
}
| [
"type_conversion.add"
] | 952,110 | 952,109 | u846964991 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int func(int i, int ht[], int dp[]) {
if (i == 1)
return 0;
if (i < 1)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
int pos1 = abs(ht[i] - ht[i - 1]) + func(i - 1, ht, dp);
int pos2 = abs(ht[i] - ht[i - 2]) + func(i - 2, ht, dp);
return dp[i] = min(pos1, pos2);
}
int main() {
int n;
cin >> n;
int ht[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 1];
memset(dp, -1, sizeof(dp));
cout << func(n, ht, dp);
} | #include <bits/stdc++.h>
using namespace std;
int func(int i, int ht[], int dp[]) {
if (i == 1)
return 0;
if (i < 1)
return 1e9;
if (dp[i] != -1)
return dp[i];
int pos1 = abs(ht[i] - ht[i - 1]) + func(i - 1, ht, dp);
int pos2 = abs(ht[i] - ht[i - 2]) + func(i - 2, ht, dp);
return dp[i] = min(pos1, pos2);
}
int main() {
int n;
cin >> n;
int ht[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 1];
memset(dp, -1, sizeof(dp));
cout << func(n, ht, dp);
} | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 952,111 | 952,112 | u846964991 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define print(arr) \
for (auto it = arr.begin(); it != arr.end(); ++it) \
cout << *it << " "; \
cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define endl "\n"
#define E "\n"
#define show(arr) \
REP(i, arr.size()) { cout << arr[i] << " "; }
const int INF = 1e18 + 1;
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979323846264338;
const int MAX = 1e18;
const int N = 2 * 1e5 + 10;
void solve() {
int n;
cin >> n;
vi dp(n + 1, 0), a(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
dp[2] = abs(a[1] - a[2]);
rep(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] << E;
}
signed main() {
int t = 1;
cin >> t;
WL(t) solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FORD(i, a, b) for (int i = a; i >= b; i--)
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define print(arr) \
for (auto it = arr.begin(); it != arr.end(); ++it) \
cout << *it << " "; \
cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define endl "\n"
#define E "\n"
#define show(arr) \
REP(i, arr.size()) { cout << arr[i] << " "; }
const int INF = 1e18 + 1;
const int MOD = 1e9 + 7;
const double PI = 3.14159265358979323846264338;
const int MAX = 1e18;
const int N = 2 * 1e5 + 10;
void solve() {
int n;
cin >> n;
vi dp(n + 1, 0), a(n + 1, 0);
rep(i, 1, n + 1) cin >> a[i];
dp[2] = abs(a[1] - a[2]);
rep(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] << E;
}
signed main() {
int t = 1;
// cin>>t;
WL(t) solve();
return 0;
}
| [] | 952,113 | 952,114 | u463602788 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define NIL 0
#define INF 1e18
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define pb push_back
#define F first
#define S second
#define pp pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define rpk(i, k, n) for (int i = k; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define RPK(i, k, n) for (int i = k; i <= n; i++)
#define ritr(i, gr) for (auto i = gr.begin(); i != gr.end(); i++)
const int M = 1e9 + 7;
int V, E, i, j, k, u, v, x, y, p, q, r, t, n;
vi *g;
vb sn;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
REP(i, n - 1) {
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>
using namespace std;
#define ll long long
#define NIL 0
#define INF 1e18
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define pb push_back
#define F first
#define S second
#define pp pair<int, int>
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; i++)
#define rpk(i, k, n) for (int i = k; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define RPK(i, k, n) for (int i = k; i <= n; i++)
#define ritr(i, gr) for (auto i = gr.begin(); i != gr.end(); i++)
const int M = 1e9 + 7;
int V, E, i, j, k, u, v, x, y, p, q, r, t, n;
vi *g;
vb sn;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
RPK(i, 2, n - 1) {
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;
}
| [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 952,115 | 952,116 | u695206817 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[n - 1] << endl;
}
| [
"expression.operation.binary.add"
] | 952,117 | 952,118 | u695206817 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#define ll long long
#define pb push_back
#define vi vector<int>
#define si set<int>
#define msi multiset<int>
#define vll vector<ll>
#define ff first
#define ss second
#define pii pair<int, int>
#define mp make_pair
#define all(a) a.begin(), a.end()
#define f(i, x, n) for (int i = x; i < n; i++)
#define fd(i, n, x) for (int i = n; i >= x; i--)
#define itr ::iterator it
#define endl '\n'
#define INF 1e9
#define mod 1e9 + 7
using namespace std;
ll step(ll i, ll n, vector<ll> &h, vector<ll> &dp) {
if (i == n - 1)
return 0;
if (i >= n)
return 100;
if (dp[i] != -1)
return dp[i];
ll left = abs(h[i] - h[i + 2]) + step(i + 2, n, h, dp);
ll right;
/*if(i+2>=n)
right=INF;
else*/
right = abs(h[i] - h[i + 1]) + step(i + 1, n, h, dp);
return dp[i] = min(left, right);
}
int main() {
ll n;
cin >> n;
vector<ll> h;
vector<ll> dp(n, -1);
for (ll i = 0; i < n; i++) {
ll a;
cin >> a;
h.push_back(a);
}
cout << step(0, n, h, dp);
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#define ll long long
#define pb push_back
#define vi vector<int>
#define si set<int>
#define msi multiset<int>
#define vll vector<ll>
#define ff first
#define ss second
#define pii pair<int, int>
#define mp make_pair
#define all(a) a.begin(), a.end()
#define f(i, x, n) for (int i = x; i < n; i++)
#define fd(i, n, x) for (int i = n; i >= x; i--)
#define itr ::iterator it
#define endl '\n'
#define INF 1e9
#define mod 1e9 + 7
using namespace std;
ll step(ll i, ll n, vector<ll> &h, vector<ll> &dp) {
if (i == n - 1)
return 0;
if (i >= n)
return INF;
if (dp[i] != -1)
return dp[i];
ll left = abs(h[i] - h[i + 2]) + step(i + 2, n, h, dp);
ll right;
/*if(i+2>=n)
right=INF;
else*/
right = abs(h[i] - h[i + 1]) + step(i + 1, n, h, dp);
return dp[i] = min(left, right);
}
int main() {
ll n;
cin >> n;
vector<ll> h;
vector<ll> dp(n, -1);
for (ll i = 0; i < n; i++) {
ll a;
cin >> a;
h.push_back(a);
}
cout << step(0, n, h, dp);
}
| [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 952,121 | 952,122 | u099821811 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
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] = abs(array[1] - array[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(array[i] - array[i - 1]),
dp[i - 2] + abs(array[i] - array[i - 2]));
}
cout << dp[n - 2];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
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] = abs(array[1] - array[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(array[i] - array[i - 1]),
dp[i - 2] + abs(array[i] - array[i - 2]));
}
cout << dp[n - 1];
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 952,123 | 952,124 | u213987341 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n, 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;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n, 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;
} | [] | 952,130 | 952,131 | u005006157 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
int res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int n;
cin >> n;
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
cout << rec(n) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
int res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int n;
cin >> n;
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
cout << rec(n - 1) << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 952,132 | 952,133 | u005006157 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
int res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
cin >> n;
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
cout << rec(n) << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
int res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int n;
cin >> n;
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
cout << rec(n - 1) << endl;
return 0;
} | [
"variable_declaration.add"
] | 952,134 | 952,133 | u005006157 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, h[100000], dp[100000];
cin >> n;
for (int i = 1; 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(abs(h[i] - h[i - 2]) + dp[i - 2], abs(h[i] - h[i - 1]) + dp[i - 1]);
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, h[100000], dp[100000];
cin >> 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(abs(h[i] - h[i - 2]) + dp[i - 2], abs(h[i] - h[i - 1]) + dp[i - 1]);
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,135 | 952,136 | u899084195 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.