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 | // In the Name of God
#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> dp(n);
dp[0] = h[0];
dp[1] = abs(h[0] - 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 - 1] << endl;
return 0;
} | // In the Name of God
#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> dp(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++)
dp[i] = min((dp[i - 1] + abs(h[i] - h[i - 1])),
(dp[i - 2] + abs(h[i] - h[i - 2])));
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,484 | 952,483 | u566183836 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n], count[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
count[0] = 0;
count[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
count[i] = min((abs(arr[i - 1] - arr[i]) + count[i - 1]),
(abs(arr[i - 2] - arr[i]) + count[i - 2]));
}
cout << count[n] << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n], count[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
count[0] = 0;
count[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
count[i] = min((abs(arr[i - 1] - arr[i]) + count[i - 1]),
(abs(arr[i - 2] - arr[i]) + count[i - 2]));
}
cout << count[n - 1] << endl;
} | [
"expression.operation.binary.add"
] | 952,485 | 952,486 | u566183836 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<unsigned int>vec;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<vector<int>> Graph;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const ll MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
int h[202020];
ll dp[202020];
ll rec(int i) {
if (dp[i] < LINF)
return dp[i];
if (i <= 0)
return 0;
ll res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N + 1) dp[i] = LINF;
cout << rec(N - 1) << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<unsigned int>vec;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<vector<int>> Graph;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const ll MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
int h[202020];
ll dp[202020];
ll rec(int i) {
if (dp[i] < LINF)
return dp[i];
if (i <= 0)
return 0;
ll 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.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N + 1) dp[i] = LINF;
cout << rec(N - 1) << endl;
}
| [
"control_flow.branch.if.add"
] | 952,489 | 952,490 | u493750228 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend()); // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> h(n);
vector<ll> dp(n);
REP(i, n) {
cin >> h[i];
dp[i] = 1e5;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j > n - 1)
continue;
dp[i + j] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend()); // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> h(n);
vector<ll> dp(n);
REP(i, n) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j > n - 1)
continue;
dp[i + j] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,491 | 952,492 | u493750228 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend()); // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
REP(i, n) {
cin >> h[i];
dp[i] = 1e5;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j > n - 1)
continue;
dp[i + j] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.rbegin(), v.rend()); // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> h(n);
vector<ll> dp(n);
REP(i, n) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j > n - 1)
continue;
dp[i + j] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,493 | 952,492 | u493750228 | cpp |
p03160 | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define BS binary_search
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
#define fr(i, a, b) for (long long i = a; i < b; i++)
#define nfr(i, a, b) for (long long i = a; i <= b; i++)
#define psl pair<str, ll>
#define pls pair<ll, str>
#define pss pair<str, str>
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ALL(a) a.begin(), a.end()
#define stl stack<ll>
#define coml complex<ll>
#define INF 0x3f3f3f3f3f3f3f3f
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define read(v, n) fr(i, 0, n) cin >> v[i];
#define print(x) \
fr(i, 0, x.size()) cout << x[i] << " "; \
cout << "\n";
const ll MOD = 1e9 + 7;
const ll N = 2e5 + 5;
using namespace std;
using namespace __gnu_pbds;
void solve() {
ll n;
vl v(n);
read(v, n);
vl dp(n, INF);
dp[0] = 0, dp[1] = abs(v[1] - v[0]);
fr(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 1] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1];
}
int main() {
fast
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w" , stdout);
//#endif
ll t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define BS binary_search
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
#define fr(i, a, b) for (long long i = a; i < b; i++)
#define nfr(i, a, b) for (long long i = a; i <= b; i++)
#define psl pair<str, ll>
#define pls pair<ll, str>
#define pss pair<str, str>
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ALL(a) a.begin(), a.end()
#define stl stack<ll>
#define coml complex<ll>
#define INF 0x3f3f3f3f3f3f3f3f
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define read(v, n) fr(i, 0, n) cin >> v[i];
#define print(x) \
fr(i, 0, x.size()) cout << x[i] << " "; \
cout << "\n";
const ll MOD = 1e9 + 7;
const ll N = 2e5 + 5;
using namespace std;
using namespace __gnu_pbds;
void solve() {
ll n;
cin >> n;
vl v(n);
read(v, n);
vl dp(n, INF);
dp[0] = 0, dp[1] = abs(v[1] - v[0]);
fr(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1];
}
int main() {
fast
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r" , stdin);
// freopen("output.txt", "w" , stdout);
//#endif
ll t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,507 | 952,508 | u721374917 | 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];
}
long long int max[n];
max[0] = 0;
max[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i - 1] + abs(a[i] - a[i - 1]));
}
cout << max[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int max[n];
max[0] = 0;
max[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i - 1] + abs(a[i] - a[i - 1]));
}
cout << max[n - 1] << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 952,513 | 952,514 | u219874809 | 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 max[n];
max[0] = 0;
max[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i - 1] + abs(a[i] - a[i - 1]));
}
cout << max[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long int max[n];
max[0] = 0;
max[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i - 1] + abs(a[i] - a[i - 1]));
}
cout << max[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.widen.change",
"call.add",
"call.arguments.change"
] | 952,515 | 952,514 | u219874809 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.size()
#define MOD 1e9 + 7
#define inf 1e9 + 9
#define int long long
#define ld long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef vector<int> vi;
typedef pair<int, int> pii;
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
FOR(i, 3, n) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i - 2]),
dp[i - 2] + abs(arr[i - 2] - arr[i - 3]));
}
cout << dp[n] << endl;
}
int32_t main() {
fast int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.size()
#define MOD 1e9 + 7
#define inf 1e9 + 9
#define int long long
#define ld long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef vector<int> vi;
typedef pair<int, int> pii;
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
FOR(i, 3, n) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i - 2]),
dp[i - 2] + abs(arr[i - 1] - arr[i - 3]));
}
cout << dp[n] << endl;
}
int32_t main() {
fast int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,516 | 952,517 | u070400236 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.size()
#define MOD 1e9 + 7
#define inf 1e9 + 9
#define int long long
#define ld long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef vector<int> vi;
typedef pair<int, int> pii;
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 1;
dp[2] = abs(arr[1] - arr[0]);
FOR(i, 3, n) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i - 2]),
dp[i - 2] + abs(arr[i - 2] - arr[i - 3]));
}
cout << dp[n] << endl;
}
int32_t main() {
fast int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.size()
#define MOD 1e9 + 7
#define inf 1e9 + 9
#define int long long
#define ld long double
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
typedef vector<int> vi;
typedef pair<int, int> pii;
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
FOR(i, 3, n) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i - 2]),
dp[i - 2] + abs(arr[i - 1] - arr[i - 3]));
}
cout << dp[n] << endl;
}
int32_t main() {
fast int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,518 | 952,517 | u070400236 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(long int n, int h[]) {
int dp[n + 1] = {0}, i;
for (i = 2; i <= n; i++) {
int op1 = abs(dp[i] - dp[i - 1]) + dp[i - 1];
int op2 = i == 2 ? pow(10, 9) : abs(dp[i] - dp[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int main() {
long int n, i;
cin >> n;
int h[n + 1];
h[0] = {0};
for (i = 1; i <= n; i++)
cin >> h[i];
cout << frog(n, h);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int frog(long int n, int h[]) {
int dp[n + 1] = {0}, i;
for (i = 2; i <= n; i++) {
int op1 = abs(h[i] - h[i - 1]) + dp[i - 1];
int op2 = i == 2 ? pow(10, 9) : abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int main() {
long int n, i;
cin >> n;
int h[n + 1];
h[0] = {0};
for (i = 1; i <= n; i++)
cin >> h[i];
cout << frog(n, h);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,531 | 952,532 | u805280969 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n], dp[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 2] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n], dp[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,534 | 952,535 | u928828066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
int n;
int arr[N + 1];
int dp[N + 1];
int rec(int i) {
if (i >= n) {
return 0;
}
int &ret = dp[i];
if (ret != -1) {
return ret;
}
ret = 10000;
if (i + 1 <= n) {
ret = min(ret, rec(i + 1) + abs(arr[i + 1] - arr[i]));
}
if (i + 2 <= n) {
ret = min(ret, rec(i + 2) + abs(arr[i + 2] - arr[i]));
}
return ret;
}
int main() {
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
/*ll ans = 1e10 , x;
dp[2]=abs(arr[2]-arr[1]);
dp[1]=0;
for(int i = 3 ; i<= n ; i++)
{
//x=min(abs(arr[i-2]-arr[i] , abs(arr[i-1]-arr[i])) ;
dp[i]=min(dp[i-1]+abs(arr[i-1]-arr[i]),dp[i-2]+abs(arr[i-2]-arr[i]));
}
*/
cout << rec(1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
int n;
int arr[N + 1];
int dp[N + 1];
int rec(int i) {
if (i >= n) {
return 0;
}
int &ret = dp[i];
if (ret != -1) {
return ret;
}
ret = 1e9;
if (i + 1 <= n) {
ret = min(ret, rec(i + 1) + abs(arr[i + 1] - arr[i]));
}
if (i + 2 <= n) {
ret = min(ret, rec(i + 2) + abs(arr[i + 2] - arr[i]));
}
return ret;
}
int main() {
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
/*ll ans = 1e10 , x;
dp[2]=abs(arr[2]-arr[1]);
dp[1]=0;
for(int i = 3 ; i<= n ; i++)
{
//x=min(abs(arr[i-2]-arr[i] , abs(arr[i-1]-arr[i])) ;
dp[i]=min(dp[i-1]+abs(arr[i-1]-arr[i]),dp[i-2]+abs(arr[i-2]-arr[i]));
}
*/
cout << rec(1);
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 952,536 | 952,537 | u480304423 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int long long int
#define mod 1000000007
#define test \
int t; \
cin >> t; \
while (t--)
#define REP(i, a, b) for (int i = a, i <= b; i++)
#define MAXN 200001
int solve(int arr[], int n) {
int dp[n + 1];
memset(dp, -1, sizeof(dp));
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i <= n; i++) {
int op1 = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int op2 = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int32_t main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
cout << solve(arr, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int long long int
#define mod 1000000007
#define test \
int t; \
cin >> t; \
while (t--)
#define REP(i, a, b) for (int i = a, i <= b; i++)
#define MAXN 200001
int solve(int arr[], int n) {
int dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int op1 = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int op2 = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int32_t main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
cout << solve(arr, n) << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"call.add"
] | 952,548 | 952,549 | u344378347 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(m, n, c) for (int i = m; i < n; i += c)
const int N = 1e5 + 3;
int ara[N + 2];
pair<int, int> pp[N];
vector<int> vv[4 * N];
set<int> st;
map<ll, ll> mp;
int ara4[30], ara5[30];
int dp[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ara[i];
}
for (int i = 0; i < n; i++)
dp[i] = inf;
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(ara[i] - ara[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(ara[i] - ara[i + 1]));
}
cout << dp[n - 1] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(m, n, c) for (int i = m; i < n; i += c)
const int N = 1e5 + 3;
int ara[N + 2];
pair<int, int> pp[N];
vector<int> vv[4 * N];
set<int> st;
map<ll, ll> mp;
int ara4[30], ara5[30];
int dp[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ara[i];
}
for (int i = 0; i <= n; i++)
dp[i] = inf;
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(ara[i] - ara[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(ara[i] - ara[i + 2]));
}
cout << dp[n - 1] << "\n";
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 952,553 | 952,554 | u088630768 | cpp |
p03160 | // author - shreyanshjn (Shreyansh Jain)
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
/* #define input 1 */
#define INF 100000000000000000
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl
#define pi 3.141592653589793
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define sz(x) (int)(x).size()
#define len(x) (int)x.length()
#define rep(a, b, c) for (int a = b; a < c; a++)
#define fori(z, n) for (int i = z; i < n; i++)
#define fork(z, n) for (int k = z; k < n; k++)
#define forii(z, n) for (int i = z; i <= n; i++)
#define forkk(z, n) for (int k = z; k <= n; k++)
const int mod = 1e9 + 7;
int powm(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
string trim(const string &str) {
size_t first = str.find_first_not_of(' ');
if (string::npos == first) {
return str;
}
int last = str.find_last_not_of(' ');
return str.substr(first, (last - first + 1));
}
int main() {
#ifdef input
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(15);
int n;
cin >> n;
int arr[n];
fori(0, n) cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
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] << endl;
cerr << "Time elapsed" << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
return 0;
}
| // author - shreyanshjn (Shreyansh Jain)
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
/* #define input 1 */
#define INF 100000000000000000
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl
#define pi 3.141592653589793
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define sz(x) (int)(x).size()
#define len(x) (int)x.length()
#define rep(a, b, c) for (int a = b; a < c; a++)
#define fori(z, n) for (int i = z; i < n; i++)
#define fork(z, n) for (int k = z; k < n; k++)
#define forii(z, n) for (int i = z; i <= n; i++)
#define forkk(z, n) for (int k = z; k <= n; k++)
const int mod = 1e9 + 7;
int powm(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
string trim(const string &str) {
size_t first = str.find_first_not_of(' ');
if (string::npos == first) {
return str;
}
int last = str.find_last_not_of(' ');
return str.substr(first, (last - first + 1));
}
int main() {
#ifdef input
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(15);
int n;
cin >> n;
int arr[n];
fori(0, n) cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
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] << endl;
cerr << "Time elapsed" << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 952,560 | 952,561 | u829019938 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, s = 0, i;
cin >> n;
long long int a[n + 1], dp[n + 1];
a[0] = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = 0;
s = 1;
for (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] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, s = 0, i;
cin >> n;
long long int a[n + 1], dp[n + 1];
a[0] = 1000000000;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = 0;
s = 1;
for (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] << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 952,564 | 952,565 | u149925261 | cpp |
p03160 | #include <bits/stdc++.h>
#define MAX 100005
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char, char>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tr(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define MOD 1000000007
#define slld(t) scanf("%lld", &t)
#define sd(t) scanf("%d", &t)
#define pd(t) printf("%d\n", t)
#define plld(t) printf("%lld\n", t)
#define mp(a, b) make_pair(a, b)
#define FF first
#define SS second
#define pb(x) push_back(x)
#define vi vector<int>
#define clr(a) memset(a, 0, sizeof(a))
#define debug(a) printf("check%d\n", a)
#define csl \
ios::sync_with_stdio(false); \
cin.tie(0);
#define fi(a, b, c) for (int i = a; i < b; i = i + c)
#define fj(a, b, c) for (int j = a; j < b; j += c)
using namespace std;
ll gcd(ll n1, ll n2) {
if (n1 % n2 == 0)
return n2;
return gcd(n2, n1 % n2);
}
ll powmod(ll base, ll exponent) {
ll ans = 1;
while (exponent) {
if (exponent & 1)
ans = (ans * base) % MOD;
base = (base * base) % MOD;
exponent /= 2;
}
return ans;
}
ll max(ll a, ll b, ll c) { return max(a, max(b, c)); }
int max(int a, int b, int c) { return max(a, max(b, c)); }
int main() {
int n;
sd(n);
vi dp, a;
for (int i = 0; i < n; i++) {
int ai;
sd(ai);
a.pb(ai);
if (i == 0) {
dp.pb(0);
} else if (i == 1) {
dp.pb(a[1] - a[0]);
} else {
dp.pb(min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2])));
}
}
pd(dp[n - 1]);
} | #include <bits/stdc++.h>
#define MAX 100005
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char, char>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tr(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define MOD 1000000007
#define slld(t) scanf("%lld", &t)
#define sd(t) scanf("%d", &t)
#define pd(t) printf("%d\n", t)
#define plld(t) printf("%lld\n", t)
#define mp(a, b) make_pair(a, b)
#define FF first
#define SS second
#define pb(x) push_back(x)
#define vi vector<int>
#define clr(a) memset(a, 0, sizeof(a))
#define debug(a) printf("check%d\n", a)
#define csl \
ios::sync_with_stdio(false); \
cin.tie(0);
#define fi(a, b, c) for (int i = a; i < b; i = i + c)
#define fj(a, b, c) for (int j = a; j < b; j += c)
using namespace std;
ll gcd(ll n1, ll n2) {
if (n1 % n2 == 0)
return n2;
return gcd(n2, n1 % n2);
}
ll powmod(ll base, ll exponent) {
ll ans = 1;
while (exponent) {
if (exponent & 1)
ans = (ans * base) % MOD;
base = (base * base) % MOD;
exponent /= 2;
}
return ans;
}
ll max(ll a, ll b, ll c) { return max(a, max(b, c)); }
int max(int a, int b, int c) { return max(a, max(b, c)); }
int main() {
int n;
sd(n);
vi dp, a;
for (int i = 0; i < n; i++) {
int ai;
sd(ai);
a.pb(ai);
if (i == 0) {
dp.pb(0);
} else if (i == 1) {
dp.pb(abs(a[1] - a[0]));
} else {
dp.pb(min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2])));
}
}
pd(dp[n - 1]);
} | [
"call.arguments.add",
"call.arguments.change"
] | 952,566 | 952,567 | u570992262 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define LP(_i, len) for (int _i = 0; _i < len; ++_i)
#define LP2(_i, _l, len) for (int _i = 0, _l = len; _i < _l; ++_i)
#define VLP(v, _itr, _end) \
for (auto _itr = v.begin(), _end = v.end(); _itr != _end; ++_itr)
#define VCLP(v, _itr, _end) \
for (auto _itr = v.cbegin(), _end = v.cend(); _itr != _end; ++_itr)
int abs(int x, int y) { return x >= 0 ? x : -x; }
int main() {
int N;
cin >> N;
vi h(N);
VLP(h, itr, end)
cin >> *itr;
vi dps(N);
LP(i, N) {
if (i == 0) {
dps[0] = 0;
continue;
}
if (i == 1) {
dps[1] = abs(h[0] - h[1]);
}
int dp_1 = dps[i - 1] + abs(h[i - 1] - h[i]),
dp_2 = dps[i - 2] + abs(h[i - 2] - h[i]);
dps[i] = dp_1 > dp_2 ? dp_2 : dp_1;
}
cout << dps[N - 1] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define LP(_i, len) for (int _i = 0; _i < len; ++_i)
#define LP2(_i, _l, len) for (int _i = 0, _l = len; _i < _l; ++_i)
#define VLP(v, _itr, _end) \
for (auto _itr = v.begin(), _end = v.end(); _itr != _end; ++_itr)
#define VCLP(v, _itr, _end) \
for (auto _itr = v.cbegin(), _end = v.cend(); _itr != _end; ++_itr)
int abs(int x, int y) { return x >= 0 ? x : -x; }
int main() {
int N;
cin >> N;
vi h(N);
VLP(h, itr, end)
cin >> *itr;
vi dps(N);
LP(i, N) {
if (i == 0) {
dps[0] = 0;
continue;
}
if (i == 1) {
dps[1] = abs(h[0] - h[1]);
continue;
}
int dp_1 = dps[i - 1] + abs(h[i - 1] - h[i]),
dp_2 = dps[i - 2] + abs(h[i - 2] - h[i]);
dps[i] = dp_1 > dp_2 ? dp_2 : dp_1;
}
cout << dps[N - 1] << endl;
return 0;
} | [] | 952,568 | 952,569 | u966647557 | cpp |
p03160 | // Author: Sayantanu
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod = 1e9 + 7;
#define INF 10001
int main() {
// code
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if ((i - 1) >= 0) {
dp[i] = min(dp[i], (abs(arr[i] - arr[i - 1]) + dp[i - 1]));
}
if ((i - 2) >= 0) {
dp[i] = min(dp[i], (abs(arr[i] - arr[i - 2]) + dp[i - 2]));
}
}
cout << dp[n - 1];
return 0;
} | // Author: Sayantanu
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod = 1e9 + 7;
#define INF INT_MAX
int main() {
// code
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if ((i - 1) >= 0) {
dp[i] = min(dp[i], (abs(arr[i] - arr[i - 1]) + dp[i - 1]));
}
if ((i - 2) >= 0) {
dp[i] = min(dp[i], (abs(arr[i] - arr[i - 2]) + dp[i - 2]));
}
}
cout << dp[n - 1];
return 0;
} | [
"preprocessor.define.value.change"
] | 952,570 | 952,571 | u484628261 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog1(int *s, int n) {
int dp[100006];
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; i++) {
int op1 = abs(s[i] - s[i - 1]) + dp[i - 1];
int op2 = (i == 2) ? INT_MAX : abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int main() {
int a[100005];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << frog1(a, n);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int frog1(int *s, int n) {
int dp[100006];
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; i++) {
int op1 = abs(s[i] - s[i - 1]) + dp[i - 1];
int op2 = (i == 2) ? INT_MAX : abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int main() {
int a[100005];
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
cout << frog1(a, n);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,574 | 952,575 | u843286945 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int b[n + 1];
b[0] = 0;
b[1] = a[1] - a[0];
for (int i = 2; i < n; i++) //动态规划
{
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i - 2] + abs(a[i] - a[i - 2]));
}
printf("%d", b[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
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 - 1] + abs(a[i] - a[i - 1]), b[i - 2] + abs(a[i] - a[i - 2]));
}
printf("%d", b[n - 1]);
return 0;
} | [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 952,584 | 952,585 | u816631826 | cpp |
p03160 | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<ll, ll> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl "\n"
#define fx(n) fixed << setprecision(n)
#define mk make_pair
void File() {
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
#ifdef ONLINE_JUDGE
/*freopen("output.txt", "w", stdout);
freopen("pyramid.in", "r", stdin);*/
#endif
}
void fast() {
ios::sync_with_stdio(NULL);
cout.tie(NULL);
cin.tie(NULL);
File();
}
const double pi = 2 * acos(0.0);
const ll oo = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int nn = 1e5 + 15;
int dx[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1};
int n;
ll arr[nn];
ll dp[nn];
int main() {
fast();
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
memset(dp, oo, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (i == 1)
dp[i] = abs(arr[i - 1] - arr[i]) + dp[0];
else
dp[i] = min({dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i])});
}
cout << dp[n - 1] << endl;
return 0;
} | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<ll, ll> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl "\n"
#define fx(n) fixed << setprecision(n)
#define mk make_pair
void File() {
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
#ifdef ONLINE_JUDGE
/*freopen("output.txt", "w", stdout);
freopen("pyramid.in", "r", stdin);*/
#endif
}
void fast() {
ios::sync_with_stdio(NULL);
cout.tie(NULL);
cin.tie(NULL);
// File();
}
const double pi = 2 * acos(0.0);
const ll oo = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int nn = 1e5 + 15;
int dx[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1};
int n;
ll arr[nn];
ll dp[nn];
int main() {
fast();
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
memset(dp, oo, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (i == 1)
dp[i] = abs(arr[i - 1] - arr[i]) + dp[0];
else
dp[i] = min({dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i])});
}
cout << dp[n - 1] << endl;
return 0;
} | [
"call.remove"
] | 952,586 | 952,587 | u816631826 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 3;
vector<ll> dp(N);
ll frog(int n, ll ht[]) {
dp[1] = 0;
dp[2] = ht[1] - ht[0];
for (int i = 3; i <= n; i++) {
dp[i] = min((dp[i - 1] + abs(ht[i - 1] - ht[i - 2])),
(dp[i - 2] + abs(ht[i - 1] - ht[i - 3])));
}
return dp[n];
}
int main() {
int n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << frog(n, arr);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 3;
vector<ll> dp(N);
ll frog(int n, ll ht[]) {
dp[1] = 0;
dp[2] = abs(ht[1] - ht[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min((dp[i - 1] + abs(ht[i - 1] - ht[i - 2])),
(dp[i - 2] + abs(ht[i - 1] - ht[i - 3])));
}
return dp[n];
}
int main() {
int n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << frog(n, arr);
} | [
"call.add",
"call.arguments.change"
] | 952,594 | 952,595 | u043995126 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int q[n + 2];
for (int i = 1; i <= n; i++)
cin >> q[i];
int dp[n + 2];
dp[1] = q[1];
dp[2] = abs(q[1] - q[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(q[i] - q[i - 1]), dp[i - 2] + abs(q[i] - q[i - 2]));
cout << dp[n];
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int q[n + 2];
for (int i = 1; i <= n; i++)
cin >> q[i];
int dp[n + 2];
dp[1] = 0;
dp[2] = abs(q[1] - q[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(q[i] - q[i - 1]), dp[i - 2] + abs(q[i] - q[i - 2]));
cout << dp[n];
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,596 | 952,597 | u030094335 | cpp |
p03160 | #include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define INF (ll)1e9 // 10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9 + 7) // 10^9+7:合同式の法
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second
#define __MAGIC__ \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define YESNO(T) \
if (T) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define yesno(T) \
if (T) { \
cout << "yes" << endl; \
} else { \
cout << "no" << endl; \
}
#define YesNo(T) \
if (T) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define Graph vector<vector<int>>
#define PII pair<int, int>
#define VI vector<int>
#define VVI vector<vector<int>>
#define VPII vector<pair<int, int>>
#define DDD fixed << setprecision(10)
#define endl "\n"
using namespace std;
/*..................DEFINE GLOBAL VARIABLES...................*/
/*.....................DEFINE FUNCTIONS ......................*/
/*.........................kemkemG0...........................*/
signed main() {
__MAGIC__
ll N;
cin >> N;
vector<ll> h(N);
REP(i, N) cin >> h[i];
vector<ll> dp(N + 5, INF);
dp[0] = 0;
dp[1] = h[1] - h[0];
REP(i, N) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 2] - h[i + 1]));
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define INF (ll)1e9 // 10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9 + 7) // 10^9+7:合同式の法
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second
#define __MAGIC__ \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define YESNO(T) \
if (T) { \
cout << "YES" << endl; \
} else { \
cout << "NO" << endl; \
}
#define yesno(T) \
if (T) { \
cout << "yes" << endl; \
} else { \
cout << "no" << endl; \
}
#define YesNo(T) \
if (T) { \
cout << "Yes" << endl; \
} else { \
cout << "No" << endl; \
}
#define Graph vector<vector<int>>
#define PII pair<int, int>
#define VI vector<int>
#define VVI vector<vector<int>>
#define VPII vector<pair<int, int>>
#define DDD fixed << setprecision(10)
#define endl "\n"
using namespace std;
/*..................DEFINE GLOBAL VARIABLES...................*/
/*.....................DEFINE FUNCTIONS ......................*/
/*.........................kemkemG0...........................*/
signed main() {
__MAGIC__
ll N;
cin >> N;
vector<ll> h(N);
REP(i, N) cin >> h[i];
vector<ll> dp(N + 5, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
REP(i, N) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 2] - h[i + 1]));
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 952,601 | 952,602 | u345693891 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int ans;
int frog(int *a, int i, int n, int *dp) {
// base condition
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
if (i + 1 <= n - 1) {
ans = int(abs(a[i] - a[i + 1])) + frog(a, i + 1, n, dp);
}
if (i + 2 <= n - 1) {
ans = min(ans, int(abs(a[i] - a[i + 1])) + frog(a, i + 2, n, dp));
}
return dp[i] = ans;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = -1;
cout << frog(a, 0, n, dp) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int ans;
int frog(int *a, int i, int n, int *dp) {
// base condition
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
if (i + 1 <= n - 1) {
ans = int(abs(a[i] - a[i + 1])) + frog(a, i + 1, n, dp);
}
if (i + 2 <= n - 1) {
ans = min(ans, int(abs(a[i] - a[i + 2])) + frog(a, i + 2, n, dp));
}
return dp[i] = ans;
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = -1;
cout << frog(a, 0, n, dp) << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,606 | 952,607 | u279460160 | cpp |
p03160 | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bits/stdc++.h>
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm,accumulate
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //順序保持しないmap
#include <unordered_set> //順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
typedef pair<ll, ld> pld;
typedef pair<pii, int> ppiii;
typedef pair<pii, ll> ppiill;
typedef pair<pll, ll> ppllll;
typedef pair<pli, int> pplii;
typedef map<int, int> mii;
typedef deque<ll> dll;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqrll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<int>> vvint;
typedef vector<vector<pll>> vvpll;
//マクロ
// forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define cin(x) cin >> x
//最大化問題最小化問題
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;
}
signed main() {
//入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
//入力
ll N = 0;
cin >> N;
vll h(N);
REP(i, N) cin >> h[i];
//本文
// 無限大の値
// DP テーブル
long long dp[100010];
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// 初期条件
dp[0] = 0;
//出力
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 2)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
// REP(i,N) cout << ans.at(i) <<endl;
return 0;
} | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bits/stdc++.h>
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm,accumulate
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //順序保持しないmap
#include <unordered_set> //順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, int> pii;
typedef pair<ll, ld> pld;
typedef pair<pii, int> ppiii;
typedef pair<pii, ll> ppiill;
typedef pair<pll, ll> ppllll;
typedef pair<pli, int> pplii;
typedef map<int, int> mii;
typedef deque<ll> dll;
typedef queue<ll> qll;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqrll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<int>> vvint;
typedef vector<vector<pll>> vvpll;
//マクロ
// forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= ll(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) x.begin(), x.end()
#define SIZE(x) ll(x.size())
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define cin(x) cin >> x
//最大化問題最小化問題
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;
}
signed main() {
//入力の高速化用のコード
ios::sync_with_stdio(false);
cin.tie(nullptr);
//入力
ll N = 0;
cin >> N;
vll h(N);
REP(i, N) cin >> h[i];
//本文
// 無限大の値
// DP テーブル
long long dp[100010];
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// 初期条件
dp[0] = 0;
//出力
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
// REP(i,N) cout << ans.at(i) <<endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,608 | 952,609 | u725137652 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<int> dp(N);
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
if (i - 2 >= 1) {
dp.at(i) = min(dp.at(i - 2) + abs(a.at(i) - a.at(i - 2)),
dp.at(i - 1) + abs(a.at(i) - a.at(i - 1)));
} else {
dp.at(i) = dp.at(i - 1) + abs(a.at(i - 1) - a.at(i));
}
}
cout << dp.at(N - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<int> dp(N);
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
if (i - 2 >= 0) {
dp.at(i) = min(dp.at(i - 2) + abs(a.at(i) - a.at(i - 2)),
dp.at(i - 1) + abs(a.at(i) - a.at(i - 1)));
} else {
dp.at(i) = dp.at(i - 1) + abs(a.at(i - 1) - a.at(i));
}
}
cout << dp.at(N - 1) << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,618 | 952,619 | u120586196 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &arr, int n) {
int pre1 = abs(arr[1] - arr[0]), pre2 = 0, ans;
for (int i = 2; i < n; i++) {
ans = min(abs(arr[i] - arr[i - 1]) + pre1, abs(arr[i] - arr[i - 2]) + pre2);
pre2 = pre1;
pre1 = ans;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << solve(arr, n) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &arr, int n) {
int pre1 = abs(arr[1] - arr[0]), pre2 = 0, ans = pre1;
for (int i = 2; i < n; i++) {
ans = min(abs(arr[i] - arr[i - 1]) + pre1, abs(arr[i] - arr[i - 2]) + pre2);
pre2 = pre1;
pre1 = ans;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << solve(arr, n) << endl;
} | [
"variable_declaration.value.change"
] | 952,623 | 952,624 | u462253237 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
int dp[100000];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
dp[2] = abs(h[0] - h[2]);
for (int i = 3; i < (n); ++i) {
if ((dp[i - 1] + abs(h[i - 1] - h[i])) >=
(dp[i - 2] + abs(h[i] - h[i - 2]))) {
dp[i] = (dp[i - 2] + abs(h[i] - h[i - 2]));
} else {
dp[i] = (dp[i - 1] + abs(h[i - 1] - h[i]));
}
}
cout << dp[n - 1] << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(100000);
int dp[100000];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
dp[2] = abs(h[0] - h[2]);
for (int i = 3; i < (n); ++i) {
if ((dp[i - 1] + abs(h[i - 1] - h[i])) >=
(dp[i - 2] + abs(h[i] - h[i - 2]))) {
dp[i] = (dp[i - 2] + abs(h[i] - h[i - 2]));
} else {
dp[i] = (dp[i - 1] + abs(h[i - 1] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
| [] | 952,627 | 952,628 | u514896542 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
int dp[n];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
dp[2] = abs(h[0] - h[2]);
for (int i = 3; i < (n); ++i) {
if ((dp[i - 1] + abs(h[i - 1] - h[i])) >=
(dp[i - 2] + abs(h[i] - h[i - 2]))) {
dp[i] = (dp[i - 2] + abs(h[i] - h[i - 2]));
} else {
dp[i] = (dp[i - 1] + abs(h[i - 1] - h[i]));
}
}
cout << dp[n - 1] << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(100000);
int dp[100000];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
dp[2] = abs(h[0] - h[2]);
for (int i = 3; i < (n); ++i) {
if ((dp[i - 1] + abs(h[i - 1] - h[i])) >=
(dp[i - 2] + abs(h[i] - h[i - 2]))) {
dp[i] = (dp[i - 2] + abs(h[i] - h[i - 2]));
} else {
dp[i] = (dp[i - 1] + abs(h[i - 1] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 952,629 | 952,628 | u514896542 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[100005];
int arr[100005];
int main() {
int n;
cin >> n;
// int arr[n];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(dp[1] - dp[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int dp[100005];
int arr[100005];
int main() {
int n;
cin >> n;
// int arr[n];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,630 | 952,631 | u602011181 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define MOD 998244353
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define t() \
ll test; \
cin >> test; \
while (test--)
#define ii pair<int, int>
#define endl "\n"
#define que_max priority_queue<int>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef tree<int, null_type, greater<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int pw(int b, int p) {
int r = 1;
while (p > 0) {
if (p & 1)
r = r * b;
p = p >> 1;
b = b * b;
}
return r;
}
ll n;
vector<ll> arr(1e5);
vector<ll> dp(1e5, -1);
ll solve(ll id) {
if (id == n - 1)
return 0;
if (dp[id] != -1) {
return dp[id];
}
ll ans = abs(arr[id + 1] - arr[id]) + solve(id + 1);
if (id + 2 < n) {
ans = min(ans, arr[id + 2] - arr[id]) + solve(id + 2);
}
return dp[id] = ans;
}
int main() {
cin >> n;
arr.resize(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0) << endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define MOD 998244353
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define t() \
ll test; \
cin >> test; \
while (test--)
#define ii pair<int, int>
#define endl "\n"
#define que_max priority_queue<int>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef tree<int, null_type, greater<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int pw(int b, int p) {
int r = 1;
while (p > 0) {
if (p & 1)
r = r * b;
p = p >> 1;
b = b * b;
}
return r;
}
ll n;
vector<ll> arr(1e5);
vector<ll> dp(1e5, -1);
ll solve(ll id) {
if (id == n - 1)
return 0;
if (dp[id] != -1) {
return dp[id];
}
ll ans = abs(arr[id + 1] - arr[id]) + solve(id + 1);
if (id + 2 < n) {
ans = min(ans, abs(arr[id + 2] - arr[id]) + solve(id + 2));
}
return dp[id] = ans;
}
int main() {
cin >> n;
arr.resize(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0) << endl;
}
| [
"call.add",
"call.arguments.change"
] | 952,634 | 952,635 | u510279772 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9 + 7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
ll pow(ll x, ll y, ll p) {
if (y == 0)
return 1;
ll res = 1;
x %= p;
if (x == 0)
return 0LL;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y >>= 1;
x = (x * x) % p;
}
return res;
}
int find(int x) { return x == parent[x] ? x : parent[x] = find(parent[x]); }
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if (xPar != yPar)
parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for (ll i = 1; i <= r; i++) {
res = res * (n - r + i) / i;
// is different from
// res *= (n -r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
void solve() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n, INT_MAX);
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(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1] << endl;
return;
}
int main() {
IOS
// int t;
// cin >> t;
// while(t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9 + 7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
ll pow(ll x, ll y, ll p) {
if (y == 0)
return 1;
ll res = 1;
x %= p;
if (x == 0)
return 0LL;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y >>= 1;
x = (x * x) % p;
}
return res;
}
int find(int x) { return x == parent[x] ? x : parent[x] = find(parent[x]); }
void Union(int x, int y) {
int xPar = find(x), yPar = find(y);
if (xPar != yPar)
parent[xPar] = yPar;
}
ll nCr(ll n, ll r) {
ll res = 1;
for (ll i = 1; i <= r; i++) {
res = res * (n - r + i) / i;
// is different from
// res *= (n -r + i) / i;
}
return res;
}
int ask(int i, int j) {
cout << "? " << i + 1 << ' ' << j + 1 << endl;
int v;
cin >> v;
return v;
}
void solve() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n, INT_MAX);
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 - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1] << endl;
return;
}
int main() {
IOS
// int t;
// cin >> t;
// while(t--)
solve();
return 0;
} | [] | 952,636 | 952,637 | u147886643 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N - 2; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1];
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,638 | 952,639 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(dp[i] - dp[i - 2]));
}
cout << dp[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1];
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,640 | 952,641 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = 100000;
}
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(dp[i] - dp[i - 2]));
}
cout << dp[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1];
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,642 | 952,641 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[10010];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = 100000;
}
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(dp[i] - dp[i - 2]));
}
cout << dp[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll dp[100100];
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1];
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,643 | 952,641 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n, 100000);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
}
return dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
}
cout << dp[n - 1];
}
| [
"call.arguments.change",
"io.output.change"
] | 952,644 | 952,645 | u480703661 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
}
return dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
}
cout << dp[n - 1];
}
| [
"io.output.change"
] | 952,646 | 952,645 | u480703661 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n, 10000);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
}
return dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
}
cout << dp[n - 1];
}
| [
"call.arguments.change",
"io.output.change"
] | 952,647 | 952,645 | u480703661 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
}
int ans[n];
ans[0] = 0;
ans[1] = ar[1] - ar[0];
for (int i = 2; i < n; ++i) {
ans[i] = min(ans[i - 2] + abs(ar[i] - ar[i - 2]),
ans[i - 1] + abs(ar[i] - ar[i - 1]));
}
cout << ans[n - 1] << '\n';
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
ans[i] = min(ans[i - 2] + abs(ar[i] - ar[i - 2]),
ans[i - 1] + abs(ar[i] - ar[i - 1]));
}
cout << ans[n - 1] << '\n';
}
| [
"call.add",
"call.arguments.change"
] | 952,659 | 952,660 | u187940414 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
const long long INF = 1LL << 60;
bool mem[100010];
int memo[100010];
int N;
int h[100010];
int DFS(int i) {
ll ans;
if (mem[i] == true) {
ans = memo[i];
} else if (i == 0) {
ans = 0;
mem[0] = true;
} else if (i == 1) {
ans = abs(h[1] - h[0]);
memo[1] = ans;
mem[1] = true;
} else {
ans = min(memo[i - 2] + abs(h[i] - h[i - 2]),
memo[i - 1] + abs(h[i] - h[i - 1]));
memo[i] = ans;
mem[i] = true;
}
return ans;
}
int main(void) {
cin >> N;
mem[0] = true;
rep(i, N) { cin >> h[i]; }
cout << DFS(N - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
}
const long long INF = 1LL << 60;
bool mem[100010];
int memo[100010];
int N;
int h[100010];
int DFS(int i) {
ll ans;
if (mem[i] == true) {
ans = memo[i];
} else if (i == 0) {
ans = 0;
mem[0] = true;
} else if (i == 1) {
ans = abs(h[1] - h[0]);
memo[1] = ans;
mem[1] = true;
} else {
ans = min(DFS(i - 2) + abs(h[i] - h[i - 2]),
DFS(i - 1) + abs(h[i] - h[i - 1]));
memo[i] = ans;
mem[i] = true;
}
return ans;
}
int main(void) {
cin >> N;
mem[0] = true;
rep(i, N) { cin >> h[i]; }
cout << DFS(N - 1) << endl;
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,665 | 952,666 | u983563612 | cpp |
p03160 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (auto &e : v)
cin >> e;
vector<int> dp(n, 1e5 + 7);
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(v[i] - v[j]));
}
}
}
cout << dp.back() << '\n';
return 0;
}
| #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (auto &e : v)
cin >> e;
vector<int> dp(n, 1e9 + 5);
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(v[i] - v[j]));
}
}
}
cout << dp.back() << '\n';
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,673 | 952,674 | u045815849 | cpp |
p03160 | /* Author- Abhijeet Trigunait */
#include <bits/stdc++.h>
#define lld long long int
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
#define mod 1e9 + 7
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define gcd(x, y) __gcd(x, y)
#define endl '\n'
using namespace std;
lld dp[10000] = {0};
namespace MinCost {
lld getMin(lld *arr, lld n) {
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
dp[2] = abs(arr[2] - arr[0]);
for (lld i = 3; i < n; ++i) {
lld op1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
lld op2 = dp[i - 2] + abs(arr[i] - arr[i - 1]);
dp[i] = min(op1, op2);
}
return dp[n - 1];
}
} // namespace MinCost
int main() {
lld n;
cin >> n;
lld arr[n];
for (lld i = 0; i < n; ++i)
cin >> arr[i];
cout << MinCost::getMin(arr, n);
} | /* Author- Abhijeet Trigunait */
#include <bits/stdc++.h>
#define lld long long int
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
#define mod 1e9 + 7
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define gcd(x, y) __gcd(x, y)
#define endl '\n'
using namespace std;
lld dp[100010] = {0};
namespace MinCost {
lld getMin(lld *arr, lld n) {
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
dp[2] = abs(arr[2] - arr[0]);
for (lld i = 3; i < n; ++i) {
lld op1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
lld op2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(op1, op2);
}
return dp[n - 1];
}
} // namespace MinCost
int main() {
lld n;
cin >> n;
lld arr[n];
for (lld i = 0; i < n; ++i)
cin >> arr[i];
cout << MinCost::getMin(arr, n);
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,680 | 952,681 | u930295008 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of function as soon as it returns
#define all(a) a.begin(), a.end()
#define ll long long int
#define ld long double
ll power(ll a, ll b, ll m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
ll t = power(a, b / 2, m) % m;
t = (t * t) % m;
if (b & 1)
t = ((t % m) * (a % m)) % m;
return t;
}
ll modInverse(ll a, ll m) { return power(a, m - 2, m); }
#define ps push_back
#define fs first
#define sc second
#define takeline cin.ignore();
#define iactive cout.flush();
#define N 100005
#define endl "\n"
#define mod 1000000007
//((1.0l)*BIG MULTIPLY MAGIC?)
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//-----------------------------------------------
ll n, ar[N], dp[N];
ll maxval(ll i) {
if (i >= n)
return 0;
if (dp[i] != -1) {
return dp[i];
}
ll an = 1e18;
if (i + 1 <= n)
an = min(an, maxval(i + 1) + abs(ar[i + 1] - ar[i]));
if (i + 1 <= n)
an = min(an, maxval(i + 2) + abs(ar[i + 2] - ar[i]));
return dp[i] = an;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, j, k, l;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ar[i];
}
memset(dp, -1, sizeof(dp));
ll an = maxval(1);
cout << an;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of function as soon as it returns
#define all(a) a.begin(), a.end()
#define ll long long int
#define ld long double
ll power(ll a, ll b, ll m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
ll t = power(a, b / 2, m) % m;
t = (t * t) % m;
if (b & 1)
t = ((t % m) * (a % m)) % m;
return t;
}
ll modInverse(ll a, ll m) { return power(a, m - 2, m); }
#define ps push_back
#define fs first
#define sc second
#define takeline cin.ignore();
#define iactive cout.flush();
#define N 100005
#define endl "\n"
#define mod 1000000007
//((1.0l)*BIG MULTIPLY MAGIC?)
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//-----------------------------------------------
ll n, ar[N], dp[N];
ll maxval(ll i) {
if (i >= n)
return 0;
if (dp[i] != -1) {
return dp[i];
}
ll an = 1e18;
if (i + 1 <= n)
an = min(an, maxval(i + 1) + abs(ar[i + 1] - ar[i]));
if (i + 2 <= n)
an = min(an, maxval(i + 2) + abs(ar[i + 2] - ar[i]));
return dp[i] = an;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll i, j, k, l;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ar[i];
}
memset(dp, -1, sizeof(dp));
ll an = maxval(1);
cout << an;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,690 | 952,691 | u838261804 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int count(int n, vector<int> &a) {
int i;
vector<int> dp;
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if (n > 1) {
for (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]));
}
return dp[n - 1];
}
int main() {
int n, k, i;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++)
cin >> a[i];
k = count(n, a);
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int count(int n, vector<int> &a) {
int i;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if (n > 1) {
for (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]));
}
return dp[n - 1];
}
int main() {
int n, k, i;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++)
cin >> a[i];
k = count(n, a);
cout << k << endl;
} | [] | 952,692 | 952,693 | u551907439 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vb vector<bool>
#define vvl vector<vector<ll>>
#define vvi vector<vector<int>>
#define pl pair<ll, ll>
#define pb push_back
#define PI 3.14159265
#define mod 998244353
#define pb push_back
#define mp make_pair
#define fri(s, n) for (int i = s; i < n; i++)
#define frj(s, n) for (int j = s; j < n; j++)
#define T(i) \
int i = 1; \
cin >> i; \
while (i--)
#define vsi vector<set<int>>
#define pii pair<int, int>
#define inf 1e9
#define vpii vector<pair<int, int>>
ll power(ll a, ll b) {
if (b == 0)
return 1;
if (b & 1)
return a * power(a, b - 1);
ll temp = power(a, b / 2);
return temp * temp;
}
ll mycompare(ll a, ll b) { return a > b; }
ll mincost(int level, vi &height, vi &dp) {
if (level == 0)
return 0;
if (level == 1)
return abs(height[0] - height[1]);
if (dp[level] != -1)
return dp[level];
return dp[level] = min(abs(height[level] - height[level - 1]) +
mincost(level - 1, height, dp),
abs(height[level] - height[level - 2]) +
mincost(level - 2, height, dp));
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
fast;
T(t) {
int n;
cin >> n;
vi height(n);
fri(0, n) cin >> height[i];
vi dp(n, -1);
cout << mincost(n - 1, height, dp);
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vb vector<bool>
#define vvl vector<vector<ll>>
#define vvi vector<vector<int>>
#define pl pair<ll, ll>
#define pb push_back
#define PI 3.14159265
#define mod 998244353
#define pb push_back
#define mp make_pair
#define fri(s, n) for (int i = s; i < n; i++)
#define frj(s, n) for (int j = s; j < n; j++)
#define T(i) \
int i = 1; \
cin >> i; \
while (i--)
#define vsi vector<set<int>>
#define pii pair<int, int>
#define inf 1e9
#define vpii vector<pair<int, int>>
ll power(ll a, ll b) {
if (b == 0)
return 1;
if (b & 1)
return a * power(a, b - 1);
ll temp = power(a, b / 2);
return temp * temp;
}
ll mycompare(ll a, ll b) { return a > b; }
ll mincost(int level, vi &height, vi &dp) {
if (level == 0)
return 0;
if (level == 1)
return abs(height[0] - height[1]);
if (dp[level] != -1)
return dp[level];
return dp[level] = min(abs(height[level] - height[level - 1]) +
mincost(level - 1, height, dp),
abs(height[level] - height[level - 2]) +
mincost(level - 2, height, dp));
}
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
fast;
int n;
cin >> n;
vi height(n);
fri(0, n) cin >> height[i];
vi dp(n, -1);
cout << mincost(n - 1, height, dp);
}
| [] | 952,696 | 952,697 | u709648815 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int T = 0; T < t; T++) {
ll n, ans = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cost[n + 1];
cost[0] = 0;
cost[1] = 0;
cost[2] = abs(a[0] - a[1]);
for (int i = 2; i <= n; i++) {
cost[i] = min(cost[i - 1] + abs(a[i - 2] - a[i - 1]),
cost[i - 2] + abs(cost[i - 3] - a[i - 1]));
}
cout << cost[n] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int T = 0; T < t; T++) {
ll n, ans = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cost[n + 1];
cost[0] = 0;
cost[1] = 0;
cost[2] = abs(a[0] - a[1]);
for (int i = 3; i <= n; i++) {
cost[i] = min(cost[i - 1] + abs(a[i - 2] - a[i - 1]),
cost[i - 2] + abs(a[i - 3] - a[i - 1]));
// cout << cost[i] << endl;
}
cout << cost[n] << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,700 | 952,701 | u354088598 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll go(vector<ll> arr, int k = 2) {
int n = arr.size();
vector<ll> dp(n, LLONG_MAX);
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i + 1; j <= min(n - 1, i + k); j++)
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
ll ans = dp[0];
return ans;
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << go(arr) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll go(vector<ll> arr, int k = 2) {
int n = arr.size();
vector<ll> dp(n, LLONG_MAX);
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i + 1; j <= min(n - 1, i + k); j++)
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
ll ans = dp[0];
return ans;
}
int main() {
int n, k;
cin >> n;
vector<ll> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << go(arr) << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 952,704 | 952,705 | u869501185 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx], visitado[maxx];
vector<int> peso;
int solve(int k) {
// cout << visitado[k] << " k " << k << " dp[k] " << dp[k] << endl;
if (k == 0)
return 0;
if (k == 1)
return dp[1] = abs(peso[0] - peso[1]);
if (visitado[k] == 1)
return dp[k];
visitado[k] = 1;
dp[k] = min(solve(k - 2) + abs(peso[k - 1] - peso[k]),
solve(k - 1) + abs(peso[k - 1] - peso[k]));
// cout << visitado[k] << " k " << k << " dp[k] " << dp[k] << endl;
return dp[k];
}
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < x; i++) {
cin >> n;
peso.push_back(n);
}
int ans = solve(x - 1);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx], visitado[maxx];
vector<int> peso;
int solve(int k) {
// cout << visitado[k] << " k " << k << " dp[k] " << dp[k] << endl;
if (k == 0)
return 0;
if (k == 1)
return dp[1] = abs(peso[0] - peso[1]);
if (visitado[k] == 1)
return dp[k];
visitado[k] = 1;
dp[k] = min(solve(k - 2) + abs(peso[k - 2] - peso[k]),
solve(k - 1) + abs(peso[k - 1] - peso[k]));
// cout << visitado[k] << " k " << k << " dp[k] " << dp[k] << endl;
return dp[k];
}
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < x; i++) {
cin >> n;
peso.push_back(n);
}
int ans = solve(x - 1);
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,708 | 952,709 | u124853339 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx];
vector<int> peso;
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < n; i++) {
cin >> n;
peso.push_back(n);
}
dp[0] = 0;
dp[1] = dp[0] + abs(peso[0] - peso[1]);
for (int i = 2; i < x; i++)
dp[i] = min(dp[i - 1] + abs(peso[i - 1] - peso[i]),
dp[i - 2] + abs(peso[i - 2] - peso[i]));
cout << dp[x - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx];
vector<int> peso;
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < x; i++) {
cin >> n;
peso.push_back(n);
}
dp[0] = 0;
dp[1] = dp[0] + abs(peso[0] - peso[1]);
for (int i = 2; i < x; i++)
dp[i] = min(dp[i - 1] + abs(peso[i - 1] - peso[i]),
dp[i - 2] + abs(peso[i - 2] - peso[i]));
cout << dp[x - 1] << endl;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,710 | 952,711 | u124853339 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int dp[N + 100];
for (int i = 0; i < N + 100; i++)
dp[i] = 1000000;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (dp[i] > dp[i - 1] + abs(h[i] - h[i - 1])) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
}
if (i > 1) {
if (dp[i] > dp[i - 2] + abs(h[i] - h[i - 2])) {
dp[i] = dp[i - 2] + abs(h[i] - h[i - 2]);
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int dp[N + 100];
for (int i = 0; i < N + 100; i++)
dp[i] = 10000000000;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (dp[i] > dp[i - 1] + abs(h[i] - h[i - 1])) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
}
if (i > 1) {
if (dp[i] > dp[i - 2] + abs(h[i] - h[i - 2])) {
dp[i] = dp[i - 2] + abs(h[i] - h[i - 2]);
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 952,718 | 952,719 | u311671153 | cpp |
p03160 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...) \
"\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x, y) debug() << pp(x) pp(y)
#define dg3(x, y, z) debug() << pp(x) pp(y) pp(z)
#define dg4(w, x, y, z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof x);
#define sz(x) (int)x.size()
template <typename T> void db(T x) { debug() << ">>> " << x; }
template <typename T> void db(T x, T y) {
debug() << ">>> " << x << " , " << y;
}
template <typename T> void db(T x, T y, T z) {
debug() << ">>> " << x << " , " << y << " , " << z;
}
template <typename T> void db(T x, T y, T z, T a) {
debug() << ">>> " << x << " , " << y << " , " << z << " , " << a;
}
const int xx = 2e5;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;
auto in = [](auto &&...args) { (cin >> ... >> args); };
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> dp(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) + dp[i - 2], abs(a[i] - a[i - 1]) + dp[i - 1]);
}
cout << dp[N] << '\n';
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...) \
"\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x, y) debug() << pp(x) pp(y)
#define dg3(x, y, z) debug() << pp(x) pp(y) pp(z)
#define dg4(w, x, y, z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof x);
#define sz(x) (int)x.size()
template <typename T> void db(T x) { debug() << ">>> " << x; }
template <typename T> void db(T x, T y) {
debug() << ">>> " << x << " , " << y;
}
template <typename T> void db(T x, T y, T z) {
debug() << ">>> " << x << " , " << y << " , " << z;
}
template <typename T> void db(T x, T y, T z, T a) {
debug() << ">>> " << x << " , " << y << " , " << z << " , " << a;
}
const int xx = 2e5;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;
auto in = [](auto &&...args) { (cin >> ... >> args); };
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N + 1);
vector<int> dp(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) + dp[i - 2], abs(a[i] - a[i - 1]) + dp[i - 1]);
}
cout << dp[N] << '\n';
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,722 | 952,723 | u428805520 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *dp = new int[n];
for (int i = 0; i < n; i++)
cin >> a[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 - 2]));
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *dp = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1];
}
| [
"call.add",
"call.arguments.change"
] | 952,730 | 952,731 | u638369926 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long dp[100010];
int main() {
int N, K;
int h[100015];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = INT_MAX;
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] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long dp[100010];
int main() {
int N, K;
int h[100015];
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = INT_MAX;
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] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
} | [
"expression.operation.binary.remove"
] | 952,732 | 952,733 | u530497183 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int x(int arr[], int dp[], int n) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// cout<<arr[i];
dp[i] += min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
return dp[n - 1];
}
int main() {
int t;
cin >> t;
int arr[t];
for (int i = 0; i < t; i++) {
cin >> arr[i];
}
int dp[t];
cout << x(arr, dp, t);
}
| #include <bits/stdc++.h>
using namespace std;
int x(int arr[], int dp[], int n) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// cout<<arr[i];
dp[i] += min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
// cout<<dp[i]<<" ";
}
return dp[n - 1];
}
int main() {
int t;
cin >> t;
int arr[t];
for (int i = 0; i < t; i++) {
cin >> arr[i];
}
int dp[t] = {0};
cout << x(arr, dp, t);
}
| [
"variable_declaration.value.change"
] | 952,734 | 952,735 | u802332845 | cpp |
p03160 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
vector<int> dp(n + 1, INF);
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
printVector(dp);
cout << dp[n] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
// cin>>t;
t = 1;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
vector<int> dp(n + 1, INF);
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
// printVector(dp);
cout << dp[n] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
// cin>>t;
t = 1;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
} | [
"call.remove"
] | 952,738 | 952,739 | u755357342 | cpp |
p03160 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
vector<int> dp(n + 1, INF);
dp[1] = 0;
dp[2] = h[2] - h[1];
for (int i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
// printVector(dp);
cout << dp[n] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
// cin>>t;
t = 1;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
vector<int> dp(n + 1, INF);
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]);
}
// printVector(dp);
cout << dp[n] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
// cin>>t;
t = 1;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 952,740 | 952,739 | u755357342 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int fun(int arr[], int n) {
vector<int> dp(n - 1, 0);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 3; i < n; i++)
dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]),
dp[i - 1] + abs(arr[i - 1] - arr[i]));
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int *arr = new int[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << fun(arr, n);
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int fun(int arr[], int n) {
vector<int> dp(n, 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 - 2] - arr[i]),
dp[i - 1] + abs(arr[i - 1] - arr[i]));
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int *arr = new int[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << fun(arr, n);
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,741 | 952,742 | u458177232 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
long long N;
cin >> N;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
vector<long long> dp(N, 10000);
dp[0] = 0;
for (long long 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]));
}
// for(long long x : dp) cout << x << " ";
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
long long N;
cin >> N;
vector<long long> h(N);
rep(i, N) { cin >> h[i]; }
vector<long long> dp(N, INFINITY);
dp[0] = 0;
for (long long 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]));
}
// for(long long x : dp) cout << x << " ";
cout << dp[N - 1] << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 952,747 | 952,748 | u422665026 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vv;
#define pb push_back
#define MOD 1000000007
#define INF 1000000000
#define endl '\n'
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
//#ifndef ONLINE_JUDGE
// freopen("F:\\Codes\\input.txt", "r", stdin);
// freopen("F:\\Codes\\output.txt", "w", stdout);
//#endif
ll n, i;
cin >> n;
vl hgt(n), dp(n + 2, 10005);
for (i = 0; i < n; i++) {
cin >> hgt[i];
}
dp[0] = 0;
for (i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(hgt[i] - hgt[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(hgt[i] - hgt[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vv;
#define pb push_back
#define MOD 1000000007
#define INF 1000000000
#define endl '\n'
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
//#ifndef ONLINE_JUDGE
// freopen("F:\\Codes\\input.txt", "r", stdin);
// freopen("F:\\Codes\\output.txt", "w", stdout);
//#endif
ll n, i;
cin >> n;
vl hgt(n), dp(n + 2, INT_MAX);
for (i = 0; i < n; i++) {
cin >> hgt[i];
}
dp[0] = 0;
for (i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(hgt[i] - hgt[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(hgt[i] - hgt[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 952,749 | 952,750 | u727230235 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> height[i];
}
vector<int> dp(n + 1);
dp[1] = 0;
dp[2] = height[2] - height[1];
for (int i = 3; i <= n; ++i) {
dp[i] = min(dp[i - 1] + abs(height[i] - height[i - 1]),
dp[i - 2] + abs(height[i] - height[i - 2]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> height[i];
}
vector<int> dp(n + 1);
dp[1] = 0;
dp[2] = abs(height[2] - height[1]);
for (int i = 3; i <= n; ++i) {
dp[i] = min(dp[i - 1] + abs(height[i] - height[i - 1]),
dp[i - 2] + abs(height[i] - height[i - 2]));
}
cout << dp[n];
} | [
"call.add",
"call.arguments.change"
] | 952,753 | 952,754 | u478140358 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "0" << endl;
return 0;
}
vector<int> v(n);
for (int &x : v)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
max(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "0" << endl;
return 0;
}
vector<int> v(n);
for (int &x : v)
cin >> x;
vector<int> dp(n);
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] << endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 952,757 | 952,758 | u275883197 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
vector<int> dp(n, 1e6);
dp[0] = 0;
rep(i, n) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
vector<int> dp(n, INT_MAX);
dp[0] = 0;
rep(i, n) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"call.arguments.change"
] | 952,764 | 952,765 | u654115954 | cpp |
p03160 | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define ull unsigned long long
#define PI 3.14159265359
#define ll long long
#define sz(v) v.size()
#define pb push_back
#define pp pop_back
#define S second
#define bgn begin
#define F first
#define N 100000 + 5
#define MOD 1e9 + 7
#define inf 1e18
//======================================================
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
//======================================================
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 power(ull a, ull b, ull ret = 1LL) {
while (b--)
ret = (ret * a);
return ret;
}
//======================================================
ll n;
ll a[N];
ll dp[N];
ll Frog(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll c1 = inf, c2 = inf;
if (i + 1 < n)
c1 = Frog(i + 1) + abs(a[i] - a[i + 1]);
if (i + 2 < n)
c2 = Frog(i + 2) + abs(a[i] - a[i + 2]);
return dp[i] = min(c1, c2);
}
int main() {
El_Bay cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, n);
ll ans = Frog(0);
cout << ans;
return 0;
}
| // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define ull unsigned long long
#define PI 3.14159265359
#define ll long long
#define sz(v) v.size()
#define pb push_back
#define pp pop_back
#define S second
#define bgn begin
#define F first
#define N 100000 + 5
#define MOD 1e9 + 7
#define inf 1e18
//======================================================
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
//======================================================
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 power(ull a, ull b, ull ret = 1LL) {
while (b--)
ret = (ret * a);
return ret;
}
//======================================================
ll n;
ll a[N];
ll dp[N];
ll Frog(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll c1 = inf, c2 = inf;
if (i + 1 < n)
c1 = Frog(i + 1) + abs(a[i] - a[i + 1]);
if (i + 2 < n)
c2 = Frog(i + 2) + abs(a[i] - a[i + 2]);
return dp[i] = min(c1, c2);
}
int main() {
El_Bay cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
ll ans = Frog(0);
cout << ans;
return 0;
}
| [
"call.arguments.change"
] | 952,767 | 952,768 | u555748940 | cpp |
p03160 | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define ull unsigned long long
#define PI 3.14159265359
#define ll long long
#define sz(v) v.size()
#define pb push_back
#define pp pop_back
#define S second
#define bgn begin
#define F first
#define N 100000 + 5
#define MOD 1e9 + 7
#define inf 1e18
//======================================================
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
//======================================================
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 power(ull a, ull b, ull ret = 1LL) {
while (b--)
ret = (ret * a);
return ret;
}
//======================================================
ll n;
ll a[N];
ll dp[N];
ll Frog(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll c1 = inf, c2 = inf;
if (i + 1 <= n)
c1 = Frog(i + 1) + abs(a[i] - a[i + 1]);
if (i + 2 <= n)
c2 = Frog(i + 2) + abs(a[i] - a[i + 2]);
return dp[i] = min(c1, c2);
}
int main() {
El_Bay cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, n);
ll ans = Frog(0);
cout << ans;
return 0;
}
| // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define ull unsigned long long
#define PI 3.14159265359
#define ll long long
#define sz(v) v.size()
#define pb push_back
#define pp pop_back
#define S second
#define bgn begin
#define F first
#define N 100000 + 5
#define MOD 1e9 + 7
#define inf 1e18
//======================================================
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
//======================================================
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 power(ull a, ull b, ull ret = 1LL) {
while (b--)
ret = (ret * a);
return ret;
}
//======================================================
ll n;
ll a[N];
ll dp[N];
ll Frog(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll c1 = inf, c2 = inf;
if (i + 1 < n)
c1 = Frog(i + 1) + abs(a[i] - a[i + 1]);
if (i + 2 < n)
c2 = Frog(i + 2) + abs(a[i] - a[i + 2]);
return dp[i] = min(c1, c2);
}
int main() {
El_Bay cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
ll ans = Frog(0);
cout << ans;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 952,769 | 952,768 | u555748940 | cpp |
p03160 | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define ull unsigned long long
#define PI 3.14159265359
#define ll long long
#define sz(v) v.size()
#define pb push_back
#define pp pop_back
#define S second
#define bgn begin
#define F first
#define N 100000 + 5
#define MOD 1e9 + 7
#define inf 1e18
//======================================================
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
//======================================================
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 power(ull a, ull b, ull ret = 1LL) {
while (b--)
ret = (ret * a);
return ret;
}
//======================================================
ll n;
ll a[N];
ll dp[N];
ll Frog(int i) {
if (i > n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll c1 = inf, c2 = inf;
if (i + 1 < n)
c1 = Frog(i + 1) + abs(a[i] - a[i + 1]);
if (i + 2 < n)
c2 = Frog(i + 2) + abs(a[i] - a[i + 2]);
return dp[i] = min(c1, c2);
}
int main() {
El_Bay cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, n);
ll ans = Frog(0);
cout << ans;
return 0;
}
| // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define ull unsigned long long
#define PI 3.14159265359
#define ll long long
#define sz(v) v.size()
#define pb push_back
#define pp pop_back
#define S second
#define bgn begin
#define F first
#define N 100000 + 5
#define MOD 1e9 + 7
#define inf 1e18
//======================================================
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
//======================================================
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 power(ull a, ull b, ull ret = 1LL) {
while (b--)
ret = (ret * a);
return ret;
}
//======================================================
ll n;
ll a[N];
ll dp[N];
ll Frog(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll c1 = inf, c2 = inf;
if (i + 1 < n)
c1 = Frog(i + 1) + abs(a[i] - a[i + 1]);
if (i + 2 < n)
c2 = Frog(i + 2) + abs(a[i] - a[i + 2]);
return dp[i] = min(c1, c2);
}
int main() {
El_Bay cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof dp);
ll ans = Frog(0);
cout << ans;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 952,770 | 952,768 | u555748940 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rev(i, n) for (ll i = n; i >= 0; i--)
#define rep_a(i, a, n) for (ll i = a; i < n; i++)
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define debug(x) \
do { \
std::cerr << #x << ": " << x << std::endl; \
} while (0);
#define debugg(x, y) \
do { \
std::cerr << #x << ": " << x << " " << #y << ": " << y << std::endl; \
} while (0);
#define debugggg(i, j, k, ans) \
std::cerr << #i << ": " << i << " " << #j << ": " << j << #k << ": " << k \
<< #ans << ": " << ans << std::endl;
const long long mod = 998244353;
const long long MOD = 1000000007;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<pair<ll, ll>> vpll;
typedef set<ll> sll;
typedef set<string> sstr;
typedef set<pair<ll, ll>> spll;
typedef map<ll, ll> mllll;
typedef map<string, ll> mstrll;
typedef queue<ll> qll;
map<ll, ll> mp;
int solve() {
int n;
cin >> n;
vll h(n);
rep(i, n) cin >> h[i];
vll dp(n + 1, 0);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[0] - h[1]);
rep_a(i, 3, n + 1) {
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;
return 0;
}
int main() {
fast;
/* #ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif */
solve();
/* #ifndef ONLINE_JUDGE
cout<<"\nTime Elapsed: "<<1.0*clock()/ CLOCKS_PER_SEC <<" Sec\n";
#endif */
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rev(i, n) for (ll i = n; i >= 0; i--)
#define rep_a(i, a, n) for (ll i = a; i < n; i++)
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define debug(x) \
do { \
std::cerr << #x << ": " << x << std::endl; \
} while (0);
#define debugg(x, y) \
do { \
std::cerr << #x << ": " << x << " " << #y << ": " << y << std::endl; \
} while (0);
#define debugggg(i, j, k, ans) \
std::cerr << #i << ": " << i << " " << #j << ": " << j << #k << ": " << k \
<< #ans << ": " << ans << std::endl;
const long long mod = 998244353;
const long long MOD = 1000000007;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<char> vchar;
typedef vector<pair<ll, ll>> vpll;
typedef set<ll> sll;
typedef set<string> sstr;
typedef set<pair<ll, ll>> spll;
typedef map<ll, ll> mllll;
typedef map<string, ll> mstrll;
typedef queue<ll> qll;
map<ll, ll> mp;
int solve() {
int n;
cin >> n;
vll h(n);
rep(i, n) cin >> h[i];
vll dp(n + 1, 0);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[0] - h[1]);
rep_a(i, 3, n + 1) {
dp[i] = min(dp[i - 2] + abs(h[i - 3] - h[i - 1]),
dp[i - 1] + abs(h[i - 2] - h[i - 1]));
}
cout << dp[n] << endl;
return 0;
}
int main() {
fast;
/* #ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif */
solve();
/* #ifndef ONLINE_JUDGE
cout<<"\nTime Elapsed: "<<1.0*clock()/ CLOCKS_PER_SEC <<" Sec\n";
#endif */
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 952,772 | 952,773 | u296273488 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
int solve() {
int n;
cin >> n;
ll arr[n];
rep(i, n) { cin >> arr[i]; }
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
rep_a(i, 2, n) {
dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]),
dp[i - 1] + abs(arr[i - 2] - arr[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
int main() {
/* #ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif */
solve();
/* #ifndef ONLINE_JUDGE
cout<<"\nTime Elapsed: "<<1.0*clock()/ CLOCKS_PER_SEC<<" Sec\n";
#endif */
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
int solve() {
int n;
cin >> n;
ll arr[n];
rep(i, n) { cin >> arr[i]; }
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
rep_a(i, 2, n) {
dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]),
dp[i - 1] + abs(arr[i - 1] - arr[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
int main() {
/* #ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif */
solve();
/* #ifndef ONLINE_JUDGE
cout<<"\nTime Elapsed: "<<1.0*clock()/ CLOCKS_PER_SEC<<" Sec\n";
#endif */
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,774 | 952,775 | u296273488 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
dp[n - 2] = abs(v[n - 2] - v[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MAX;
dp[i] = max(dp[i], max(abs(v[i] - v[i + 1]) + dp[i + 1],
abs(v[i] - v[i + 2]) + dp[i + 2]));
}
cout << dp[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
dp[n - 2] = abs(v[n - 2] - v[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MAX;
dp[i] = min(dp[i], min(abs(v[i] - v[i + 1]) + dp[i + 1],
abs(v[i] - v[i + 2]) + dp[i + 2]));
}
cout << dp[0] << endl;
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 952,780 | 952,781 | u845776743 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(x) cout << setw(2) << setfill('0') << x << endl;
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
// a = max(a, b), a = min(a, b)
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;
}
// 階乗(MODをとる)
ll pow_mod(ll num, ll pow, ll mod) {
ll prod = 1;
num %= mod;
while (pow > 0) {
if (pow & 1)
prod = prod * num % mod;
num = num * num % mod;
pow >>= 1;
}
return prod;
}
// 二項係数(MODとる、1 ≦ k ≦ n ≦ 10^7 程度)
// COMinit()
// COM(x, y)
// とコンビで使う
// テーブルを作る前処理
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> Size;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n + 1);
rank.resize(n + 1);
Size.resize(n + 1);
for (int i = 0; i <= n; ++i)
par[i] = i, rank[i] = 0, Size[i] = 1;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
Size[x] += Size[y];
return true;
}
ll size(int x) { return Size[root(x)]; }
};
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
struct Mint {
int val;
Mint inv() const {
int tmp, a = val, b = mod, x = 1, y = 0;
while (b)
tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);
return Mint(x);
}
public:
Mint() : val(0) {}
Mint(ll x) {
if ((val = x % mod) < 0)
val += mod;
}
Mint pow(ll t) {
Mint res = 1, b = *this;
while (t) {
if (t & 1)
res *= b;
b *= b;
t >>= 1;
}
return res;
}
Mint &operator+=(const Mint &x) {
if ((val += x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator-=(const Mint &x) {
if ((val += mod - x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator*=(const Mint &x) {
val = (ll)val * x.val % mod;
return *this;
}
Mint &operator/=(const Mint &x) { return *this *= x.inv(); }
bool operator==(const Mint &x) const { return val == x.val; }
bool operator!=(const Mint &x) const { return val != x.val; }
bool operator<(const Mint &x) const { return val < x.val; }
bool operator<=(const Mint &x) const { return val <= x.val; }
bool operator>(const Mint &x) const { return val > x.val; }
bool operator>=(const Mint &x) const { return val >= x.val; }
Mint operator+(const Mint &x) const { return Mint(*this) += x; }
Mint operator-(const Mint &x) const { return Mint(*this) -= x; }
Mint operator*(const Mint &x) const { return Mint(*this) *= x; }
Mint operator/(const Mint &x) const { return Mint(*this) /= x; }
};
struct factorial {
vector<Mint> Fact, Finv;
public:
factorial(int maxx) {
Fact.resize(maxx + 1), Finv.resize(maxx + 1);
Fact[0] = Mint(1);
rep(i, 0, maxx) Fact[i + 1] = Fact[i] * (i + 1);
Finv[maxx] = Mint(1) / Fact[maxx];
rrep(i, maxx, 0) Finv[i - 1] = Finv[i] * i;
}
Mint fact(int n, bool inv = 0) {
if (inv)
return Finv[n];
else
return Fact[n];
}
Mint nPr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[n - r];
}
Mint nCr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[r] * Finv[n - r];
}
};
ll modfact(ll n) {
if (n <= 1)
return 1;
return (n * modfact(n - 1)) % MOD;
}
bool wat[3005], sug[3005];
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<int> dp(n);
dp[0] = 0;
REP(i, n - 2) {
if (i < n - 1)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(a[i + 1] - a[i]));
if (i < n - 2)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(a[i + 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(x) cout << setw(2) << setfill('0') << x << endl;
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
// a = max(a, b), a = min(a, b)
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;
}
// 階乗(MODをとる)
ll pow_mod(ll num, ll pow, ll mod) {
ll prod = 1;
num %= mod;
while (pow > 0) {
if (pow & 1)
prod = prod * num % mod;
num = num * num % mod;
pow >>= 1;
}
return prod;
}
// 二項係数(MODとる、1 ≦ k ≦ n ≦ 10^7 程度)
// COMinit()
// COM(x, y)
// とコンビで使う
// テーブルを作る前処理
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> Size;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n + 1);
rank.resize(n + 1);
Size.resize(n + 1);
for (int i = 0; i <= n; ++i)
par[i] = i, rank[i] = 0, Size[i] = 1;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
Size[x] += Size[y];
return true;
}
ll size(int x) { return Size[root(x)]; }
};
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
struct Mint {
int val;
Mint inv() const {
int tmp, a = val, b = mod, x = 1, y = 0;
while (b)
tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);
return Mint(x);
}
public:
Mint() : val(0) {}
Mint(ll x) {
if ((val = x % mod) < 0)
val += mod;
}
Mint pow(ll t) {
Mint res = 1, b = *this;
while (t) {
if (t & 1)
res *= b;
b *= b;
t >>= 1;
}
return res;
}
Mint &operator+=(const Mint &x) {
if ((val += x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator-=(const Mint &x) {
if ((val += mod - x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator*=(const Mint &x) {
val = (ll)val * x.val % mod;
return *this;
}
Mint &operator/=(const Mint &x) { return *this *= x.inv(); }
bool operator==(const Mint &x) const { return val == x.val; }
bool operator!=(const Mint &x) const { return val != x.val; }
bool operator<(const Mint &x) const { return val < x.val; }
bool operator<=(const Mint &x) const { return val <= x.val; }
bool operator>(const Mint &x) const { return val > x.val; }
bool operator>=(const Mint &x) const { return val >= x.val; }
Mint operator+(const Mint &x) const { return Mint(*this) += x; }
Mint operator-(const Mint &x) const { return Mint(*this) -= x; }
Mint operator*(const Mint &x) const { return Mint(*this) *= x; }
Mint operator/(const Mint &x) const { return Mint(*this) /= x; }
};
struct factorial {
vector<Mint> Fact, Finv;
public:
factorial(int maxx) {
Fact.resize(maxx + 1), Finv.resize(maxx + 1);
Fact[0] = Mint(1);
rep(i, 0, maxx) Fact[i + 1] = Fact[i] * (i + 1);
Finv[maxx] = Mint(1) / Fact[maxx];
rrep(i, maxx, 0) Finv[i - 1] = Finv[i] * i;
}
Mint fact(int n, bool inv = 0) {
if (inv)
return Finv[n];
else
return Fact[n];
}
Mint nPr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[n - r];
}
Mint nCr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[r] * Finv[n - r];
}
};
ll modfact(ll n) {
if (n <= 1)
return 1;
return (n * modfact(n - 1)) % MOD;
}
bool wat[3005], sug[3005];
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<int> dp(n, INF);
dp[0] = 0;
REP(i, n) {
if (i < n - 1)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(a[i + 1] - a[i]));
if (i < n - 2)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(a[i + 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 952,784 | 952,785 | u832995587 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(x) cout << setw(2) << setfill('0') << x << endl;
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
// a = max(a, b), a = min(a, b)
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;
}
// 階乗(MODをとる)
ll pow_mod(ll num, ll pow, ll mod) {
ll prod = 1;
num %= mod;
while (pow > 0) {
if (pow & 1)
prod = prod * num % mod;
num = num * num % mod;
pow >>= 1;
}
return prod;
}
// 二項係数(MODとる、1 ≦ k ≦ n ≦ 10^7 程度)
// COMinit()
// COM(x, y)
// とコンビで使う
// テーブルを作る前処理
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> Size;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n + 1);
rank.resize(n + 1);
Size.resize(n + 1);
for (int i = 0; i <= n; ++i)
par[i] = i, rank[i] = 0, Size[i] = 1;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
Size[x] += Size[y];
return true;
}
ll size(int x) { return Size[root(x)]; }
};
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
struct Mint {
int val;
Mint inv() const {
int tmp, a = val, b = mod, x = 1, y = 0;
while (b)
tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);
return Mint(x);
}
public:
Mint() : val(0) {}
Mint(ll x) {
if ((val = x % mod) < 0)
val += mod;
}
Mint pow(ll t) {
Mint res = 1, b = *this;
while (t) {
if (t & 1)
res *= b;
b *= b;
t >>= 1;
}
return res;
}
Mint &operator+=(const Mint &x) {
if ((val += x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator-=(const Mint &x) {
if ((val += mod - x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator*=(const Mint &x) {
val = (ll)val * x.val % mod;
return *this;
}
Mint &operator/=(const Mint &x) { return *this *= x.inv(); }
bool operator==(const Mint &x) const { return val == x.val; }
bool operator!=(const Mint &x) const { return val != x.val; }
bool operator<(const Mint &x) const { return val < x.val; }
bool operator<=(const Mint &x) const { return val <= x.val; }
bool operator>(const Mint &x) const { return val > x.val; }
bool operator>=(const Mint &x) const { return val >= x.val; }
Mint operator+(const Mint &x) const { return Mint(*this) += x; }
Mint operator-(const Mint &x) const { return Mint(*this) -= x; }
Mint operator*(const Mint &x) const { return Mint(*this) *= x; }
Mint operator/(const Mint &x) const { return Mint(*this) /= x; }
};
struct factorial {
vector<Mint> Fact, Finv;
public:
factorial(int maxx) {
Fact.resize(maxx + 1), Finv.resize(maxx + 1);
Fact[0] = Mint(1);
rep(i, 0, maxx) Fact[i + 1] = Fact[i] * (i + 1);
Finv[maxx] = Mint(1) / Fact[maxx];
rrep(i, maxx, 0) Finv[i - 1] = Finv[i] * i;
}
Mint fact(int n, bool inv = 0) {
if (inv)
return Finv[n];
else
return Fact[n];
}
Mint nPr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[n - r];
}
Mint nCr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[r] * Finv[n - r];
}
};
ll modfact(ll n) {
if (n <= 1)
return 1;
return (n * modfact(n - 1)) % MOD;
}
bool wat[3005], sug[3005];
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<int> dp(n);
dp[0] = 0;
REP(i, n - 2) {
if (i < n - 1)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(a[i + 1] - a[i]));
if (i < n - 2)
dp[i + 2] = min(dp[i + 1], dp[i] + abs(a[i + 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#define prints(x) cout << fixed << setprecision(10) << x << endl
#define printc(x) cout << setw(2) << setfill('0') << x << endl;
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
//最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
// a = max(a, b), a = min(a, b)
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;
}
// 階乗(MODをとる)
ll pow_mod(ll num, ll pow, ll mod) {
ll prod = 1;
num %= mod;
while (pow > 0) {
if (pow & 1)
prod = prod * num % mod;
num = num * num % mod;
pow >>= 1;
}
return prod;
}
// 二項係数(MODとる、1 ≦ k ≦ n ≦ 10^7 程度)
// COMinit()
// COM(x, y)
// とコンビで使う
// テーブルを作る前処理
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
struct UnionFind {
vector<int> par;
vector<int> rank;
vector<ll> Size;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n + 1);
rank.resize(n + 1);
Size.resize(n + 1);
for (int i = 0; i <= n; ++i)
par[i] = i, rank[i] = 0, Size[i] = 1;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
return par[x] = r;
}
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
Size[x] += Size[y];
return true;
}
ll size(int x) { return Size[root(x)]; }
};
#define rrep(i, a, b) for (int i = (a); i > (b); i--)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
struct Mint {
int val;
Mint inv() const {
int tmp, a = val, b = mod, x = 1, y = 0;
while (b)
tmp = a / b, a -= tmp * b, swap(a, b), x -= tmp * y, swap(x, y);
return Mint(x);
}
public:
Mint() : val(0) {}
Mint(ll x) {
if ((val = x % mod) < 0)
val += mod;
}
Mint pow(ll t) {
Mint res = 1, b = *this;
while (t) {
if (t & 1)
res *= b;
b *= b;
t >>= 1;
}
return res;
}
Mint &operator+=(const Mint &x) {
if ((val += x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator-=(const Mint &x) {
if ((val += mod - x.val) >= mod)
val -= mod;
return *this;
}
Mint &operator*=(const Mint &x) {
val = (ll)val * x.val % mod;
return *this;
}
Mint &operator/=(const Mint &x) { return *this *= x.inv(); }
bool operator==(const Mint &x) const { return val == x.val; }
bool operator!=(const Mint &x) const { return val != x.val; }
bool operator<(const Mint &x) const { return val < x.val; }
bool operator<=(const Mint &x) const { return val <= x.val; }
bool operator>(const Mint &x) const { return val > x.val; }
bool operator>=(const Mint &x) const { return val >= x.val; }
Mint operator+(const Mint &x) const { return Mint(*this) += x; }
Mint operator-(const Mint &x) const { return Mint(*this) -= x; }
Mint operator*(const Mint &x) const { return Mint(*this) *= x; }
Mint operator/(const Mint &x) const { return Mint(*this) /= x; }
};
struct factorial {
vector<Mint> Fact, Finv;
public:
factorial(int maxx) {
Fact.resize(maxx + 1), Finv.resize(maxx + 1);
Fact[0] = Mint(1);
rep(i, 0, maxx) Fact[i + 1] = Fact[i] * (i + 1);
Finv[maxx] = Mint(1) / Fact[maxx];
rrep(i, maxx, 0) Finv[i - 1] = Finv[i] * i;
}
Mint fact(int n, bool inv = 0) {
if (inv)
return Finv[n];
else
return Fact[n];
}
Mint nPr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[n - r];
}
Mint nCr(int n, int r) {
if (n < 0 || n < r || r < 0)
return Mint(0);
else
return Fact[n] * Finv[r] * Finv[n - r];
}
};
ll modfact(ll n) {
if (n <= 1)
return 1;
return (n * modfact(n - 1)) % MOD;
}
bool wat[3005], sug[3005];
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<int> dp(n, INF);
dp[0] = 0;
REP(i, n) {
if (i < n - 1)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(a[i + 1] - a[i]));
if (i < n - 2)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(a[i + 2] - a[i]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,786 | 952,785 | u832995587 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int a[50], arr[50], n;
int topdown(int x);
int main() {
int ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
a[i] = -1;
}
ans = topdown(0);
cout << ans;
return 0;
}
int topdown(int x) {
if (a[x] != -1) {
return a[x];
}
if (x == n - 3 || x == n - 2) {
a[x] = abs(arr[n - 1] - arr[x]);
return a[x];
}
int q;
q = min(topdown(x + 1) + abs(arr[x + 1] - arr[x]),
topdown(x + 2) + abs(arr[x + 2] - arr[x]));
a[x] = q;
return q;
}
| #include <cmath>
#include <iostream>
using namespace std;
int a[100000], arr[100000], n;
int topdown(int x);
int main() {
int ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
a[i] = -1;
}
ans = topdown(0);
cout << ans;
return 0;
}
int topdown(int x) {
if (a[x] != -1) {
return a[x];
}
if (x == n - 3 || x == n - 2) {
a[x] = abs(arr[n - 1] - arr[x]);
return a[x];
}
int q;
q = min(topdown(x + 1) + abs(arr[x + 1] - arr[x]),
topdown(x + 2) + abs(arr[x + 2] - arr[x]));
a[x] = q;
return q;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,787 | 952,788 | u538813479 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<int> v, dp;
void solve() {
int n;
cin >> n;
dp.resize(n, -1);
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
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] << "\n";
}
int main() {
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> v, dp;
void solve() {
int n;
cin >> n;
dp.resize(n, -1);
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
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] << "\n";
}
int main() {
int t = 1; // cin>>t;
while (t--) {
solve();
}
return 0;
} | [] | 952,791 | 952,792 | u053551549 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[100000] = {0};
ll dp[100000] = {0};
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[100000] = {0};
ll dp[100000] = {0};
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
} | [] | 952,793 | 952,794 | u360668137 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[10000] = {0};
ll dp[10000] = {0};
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[100000] = {0};
ll dp[100000] = {0};
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,795 | 952,794 | u360668137 | 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];
// DP テーブル
long long dp[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> h[i];
// 初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// 初期条件
dp[0] = 0;
// ループ
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i == 0)
continue;
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// 答え
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];
// DP テーブル
long long dp[100010];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; ++i)
cin >> h[i];
// 初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// 初期条件
dp[0] = 0;
// ループ
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i == 1)
continue;
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// 答え
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,802 | 952,803 | u692550512 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void calc(vector<int> A) {
vector<int> dp(A.size());
dp[0] = 0;
dp[1] = A[1] - A[0];
for (auto i = 2; i < dp.size(); i++) {
dp[i] =
min(abs(A[i] - A[i - 1]) + dp[i - 1], abs(A[i] - A[i - 2]) + dp[i - 2]);
}
cout << dp.back();
}
int main() {
int n;
cin >> n;
vector<int> h(n);
for (auto i = 0; i < n; i++)
cin >> h[i];
calc(h);
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void calc(vector<int> A) {
vector<int> dp(A.size());
dp[0] = 0;
dp[1] = abs(A[1] - A[0]);
for (auto i = 2; i < dp.size(); i++) {
dp[i] =
min(abs(A[i] - A[i - 1]) + dp[i - 1], abs(A[i] - A[i - 2]) + dp[i - 2]);
}
cout << dp.back();
}
int main() {
int n;
cin >> n;
vector<int> h(n);
for (auto i = 0; i < n; i++)
cin >> h[i];
calc(h);
}
| [
"call.add",
"call.arguments.change"
] | 952,806 | 952,807 | u848936919 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#define aut(r, v) for (auto r : v)
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define pc() pop_back()
#define ull unsigned long long
#define mp(x, y) make_pair((x), (y))
#define mset(m, v) memset(m, v, sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
#define endl '\n'
#define st stack<int>
#define vl vector<long long>
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define pii pair<int, int>
#define vpii vector<pii>
#define vvi vector<vi>
#define vs vector<string>
#define mod 1000000007
#define un unordered_map<int, int>
#define mii map<int, int>
#define Sort(a) sort(all(a))
#define ED(a) \
Sort(a), a.erase(unique(all(a)), a.end()) // removing all duplicates
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define MaxP(a) max_element(all(a)) - a.begin()
#define MinP(a) min_element(all(a)) - a.begin()
#define allUpper(a) transform(all(a), a.begin(), ::toupper)
#define allLower(a) transform(all(a), a.begin(), ::tolower)
#define rev(a) reverse(all(a))
#define ub(v, k) upper_bound(all(v), k) - v.begin()
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define adv(a, n) advance(auto it : a, n)
#define RSort(a) sort(a.rbegin(), a.rend()) // decending order
#define cnt(v, a) count(all(v), a)
#define bs(v, a) binary_search(all(v), a)
#define mmax(v) *max_element(all(v))
#define mmin(v) *min_element(all(v))
#define popcount(mask) __builtin_popcount(mask) // count set bit
#define popcountLL(mask) __builtin_popcountll(mask) // for long long
#define X \
real() // useful for working with #include <complex> for computational
// geometry
#define Y imag()
#define ll long long
#define ss second
#define ff first
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
template <typename T> T gcd(T a, T b) {
while (b)
b ^= a ^= b ^= a %= b;
return a;
}
template <typename T> T setbit(T mask, T pos) { return mask |= (1 << pos); }
template <typename T> T resetbit(T mask, T pos) { return mask &= ~(1 << pos); }
template <typename T> T togglebit(T mask, T pos) { return mask ^= (1 << pos); }
template <typename T> T checkbit(T mask, T pos) {
return (bool)(mask & (1 << pos));
}
template <typename T> T lcm(T a, T b) { return (a / gcd(a, b)) * b; }
template <typename T> T modu(T a, T b) { return (a < b ? a : a % b); }
template <typename T> T mod_neg(T a, T b) {
a = mod(a, b);
if (a < 0) {
a += b;
}
return a;
}
template <typename T> T expo(T e, T n) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = x * p;
p = p * p;
n >>= 1;
}
return x;
}
template <typename T> T mod_inverse(T a, T n) {
T x, y;
T d = extended_euclid(a, n, x, y);
return (d > 1 ? -1 : mod_neg(x, n));
}
template <typename T> T power(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mod(x * p, m);
p = mod(p * p, m);
n >>= 1;
}
return x;
}
template <typename T> T powerL(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mulmod(x, p, m);
p = mulmod(p, p, m);
n >>= 1;
}
return x;
}
bool Pow2(int n) { return n && (!(n & (n - 1))); }
void printc(vc &result) {
aut(r, result) cout << r << " ";
cout << endl;
}
void printl(vl &result) {
aut(r, result) cout << r << " ";
cout << endl;
}
void print(vi &result) {
aut(r, result) cout << r << " ";
cout << endl;
}
// Recursively computes the power
int binpow(int a, int b) {
if (b == 0)
return a;
int res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
// iteratively computes the power
int pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int modpow(int a, int b, int m) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
const int MOD = 1000000000 + 7;
const int MXX = 100000 + 69;
int fact[MXX], invfact[MXX];
int modinv(int k) { return modpow(k, MOD - 2, MOD); }
void combinatorics() {
fact[0] = fact[1] = 1;
for (int i = 2; i < MXX; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
invfact[MXX - 1] = modinv(fact[MXX - 1]);
for (int i = MXX - 2; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1);
invfact[i] %= MOD;
}
}
int nCr(int x, int y) {
if (y > x)
return 0;
int num = fact[x];
num *= invfact[y];
num %= MOD;
num *= invfact[x - y];
num %= MOD;
return num;
}
// ifstream cin("b_read_on.txt"); ofstream cout("output3.txt");
// Use (<<) for multiplication
// Use (>>) for division
// ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);cout<<fixed;cerr.tie(NULL);
// find_by_order -> value at index
// order_of_key -> index of value
// while using (1<<i) use ((ll)1<<(ll)i)
// in Floyd-Warshall Algo, k is outer loop
// If an element was not initially in map and if asked mp[a],the element gets
// inserted a%=mod take a lot of time... try to use it minimum and use memset as
// it reduces a lot of time usage...use if(a>=mod) a%=mod
// cout<<(double) can be harmful , always use printf(%.9llf)...take
// scanf("%lf",&p[i][j]) as input , not llf; use s.erase(it++) for erasing
// iterator and then moving to the next one never use adj.resize(n) as value is
// persistent, always erase use __builtin_popcountll() for ll
// no of prime numbers in range : (70,19) , (1000,168) , (100000,1229) ,
// (sqrt(10^9),3409) ;
// always check the use of segment tree using bottom-up dp
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int test;
test = 1;
// cin >> test;
while (test--) {
// seive();
int n;
cin >> n;
vi v(n);
rep(i, n) cin >> v[i];
vi ans(n, INF);
ans[0] = 0;
ans[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
ans[i] = min(ans[i], min(abs(v[i] - v[i - 1]) + ans[i - 1],
abs(v[i] - v[i - 2]) + ans[i - 2]));
}
print(ans);
cout << ans[n - 1] << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#define aut(r, v) for (auto r : v)
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define pc() pop_back()
#define ull unsigned long long
#define mp(x, y) make_pair((x), (y))
#define mset(m, v) memset(m, v, sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
#define endl '\n'
#define st stack<int>
#define vl vector<long long>
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define pii pair<int, int>
#define vpii vector<pii>
#define vvi vector<vi>
#define vs vector<string>
#define mod 1000000007
#define un unordered_map<int, int>
#define mii map<int, int>
#define Sort(a) sort(all(a))
#define ED(a) \
Sort(a), a.erase(unique(all(a)), a.end()) // removing all duplicates
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define MaxP(a) max_element(all(a)) - a.begin()
#define MinP(a) min_element(all(a)) - a.begin()
#define allUpper(a) transform(all(a), a.begin(), ::toupper)
#define allLower(a) transform(all(a), a.begin(), ::tolower)
#define rev(a) reverse(all(a))
#define ub(v, k) upper_bound(all(v), k) - v.begin()
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define adv(a, n) advance(auto it : a, n)
#define RSort(a) sort(a.rbegin(), a.rend()) // decending order
#define cnt(v, a) count(all(v), a)
#define bs(v, a) binary_search(all(v), a)
#define mmax(v) *max_element(all(v))
#define mmin(v) *min_element(all(v))
#define popcount(mask) __builtin_popcount(mask) // count set bit
#define popcountLL(mask) __builtin_popcountll(mask) // for long long
#define X \
real() // useful for working with #include <complex> for computational
// geometry
#define Y imag()
#define ll long long
#define ss second
#define ff first
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
template <typename T> T gcd(T a, T b) {
while (b)
b ^= a ^= b ^= a %= b;
return a;
}
template <typename T> T setbit(T mask, T pos) { return mask |= (1 << pos); }
template <typename T> T resetbit(T mask, T pos) { return mask &= ~(1 << pos); }
template <typename T> T togglebit(T mask, T pos) { return mask ^= (1 << pos); }
template <typename T> T checkbit(T mask, T pos) {
return (bool)(mask & (1 << pos));
}
template <typename T> T lcm(T a, T b) { return (a / gcd(a, b)) * b; }
template <typename T> T modu(T a, T b) { return (a < b ? a : a % b); }
template <typename T> T mod_neg(T a, T b) {
a = mod(a, b);
if (a < 0) {
a += b;
}
return a;
}
template <typename T> T expo(T e, T n) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = x * p;
p = p * p;
n >>= 1;
}
return x;
}
template <typename T> T mod_inverse(T a, T n) {
T x, y;
T d = extended_euclid(a, n, x, y);
return (d > 1 ? -1 : mod_neg(x, n));
}
template <typename T> T power(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mod(x * p, m);
p = mod(p * p, m);
n >>= 1;
}
return x;
}
template <typename T> T powerL(T e, T n, T m) {
T x = 1, p = e;
while (n) {
if (n & 1)
x = mulmod(x, p, m);
p = mulmod(p, p, m);
n >>= 1;
}
return x;
}
bool Pow2(int n) { return n && (!(n & (n - 1))); }
void printc(vc &result) {
aut(r, result) cout << r << " ";
cout << endl;
}
void printl(vl &result) {
aut(r, result) cout << r << " ";
cout << endl;
}
void print(vi &result) {
aut(r, result) cout << r << " ";
cout << endl;
}
// Recursively computes the power
int binpow(int a, int b) {
if (b == 0)
return a;
int res = binpow(a, b / 2);
if (b % 2)
return res * res * a;
else
return res * res;
}
// iteratively computes the power
int pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int modpow(int a, int b, int m) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
const int MOD = 1000000000 + 7;
const int MXX = 100000 + 69;
int fact[MXX], invfact[MXX];
int modinv(int k) { return modpow(k, MOD - 2, MOD); }
void combinatorics() {
fact[0] = fact[1] = 1;
for (int i = 2; i < MXX; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
invfact[MXX - 1] = modinv(fact[MXX - 1]);
for (int i = MXX - 2; i >= 0; i--) {
invfact[i] = invfact[i + 1] * (i + 1);
invfact[i] %= MOD;
}
}
int nCr(int x, int y) {
if (y > x)
return 0;
int num = fact[x];
num *= invfact[y];
num %= MOD;
num *= invfact[x - y];
num %= MOD;
return num;
}
// ifstream cin("b_read_on.txt"); ofstream cout("output3.txt");
// Use (<<) for multiplication
// Use (>>) for division
// ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);cout<<fixed;cerr.tie(NULL);
// find_by_order -> value at index
// order_of_key -> index of value
// while using (1<<i) use ((ll)1<<(ll)i)
// in Floyd-Warshall Algo, k is outer loop
// If an element was not initially in map and if asked mp[a],the element gets
// inserted a%=mod take a lot of time... try to use it minimum and use memset as
// it reduces a lot of time usage...use if(a>=mod) a%=mod
// cout<<(double) can be harmful , always use printf(%.9llf)...take
// scanf("%lf",&p[i][j]) as input , not llf; use s.erase(it++) for erasing
// iterator and then moving to the next one never use adj.resize(n) as value is
// persistent, always erase use __builtin_popcountll() for ll
// no of prime numbers in range : (70,19) , (1000,168) , (100000,1229) ,
// (sqrt(10^9),3409) ;
// always check the use of segment tree using bottom-up dp
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int test;
test = 1;
// cin >> test;
while (test--) {
// seive();
int n;
cin >> n;
vi v(n);
rep(i, n) cin >> v[i];
vi ans(n, INF);
ans[0] = 0;
ans[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
ans[i] = min(ans[i], min(abs(v[i] - v[i - 1]) + ans[i - 1],
abs(v[i] - v[i - 2]) + ans[i - 2]));
}
// print(ans);
cout << ans[n - 1] << endl;
}
} | [
"call.remove"
] | 952,808 | 952,809 | u708599234 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(int arr[], int n) {
int temp[n];
for (int i = 1; i < n; i++) {
temp[i] = 1e6;
}
temp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + 3; j++) {
temp[j] = min(temp[j], abs(arr[i] - arr[j]) + temp[i]);
}
}
return temp[n - 1];
}
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << frog(arr, n);
} | #include <bits/stdc++.h>
using namespace std;
int frog(int arr[], int n) {
int temp[n];
for (int i = 1; i < n; i++) {
temp[i] = 1e9;
}
temp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + 3; j++) {
temp[j] = min(temp[j], abs(arr[i] - arr[j]) + temp[i]);
}
}
return temp[n - 1];
}
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << frog(arr, n);
} | [
"literal.number.change",
"assignment.value.change"
] | 952,811 | 952,812 | u708599234 | cpp |
p03160 | #include <bits/stdc++.h>
#define maxN 100005
long dp[maxN] = {INT_MAX};
long input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
dp[i + j] =
std::min(dp[i] + std::abs(input[i] - input[i + j]), dp[i + j]);
}
}
std::cout << dp[n - 1] << std::endl;
} | #include <bits/stdc++.h>
#define maxN 100005
long dp[maxN] = {INT_MAX};
long input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
dp[i + j] =
std::min(dp[i] + std::abs(input[i] - input[i + j]), dp[i + j]);
}
}
std::cout << dp[n - 1] << std::endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,839 | 952,840 | u110541731 | cpp |
p03160 | #include <bits/stdc++.h>
#define maxN 100005
int dp[maxN] = {INT_MAX};
int input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
dp[i + j] =
std::min(dp[i] + std::abs(input[i] - input[i + j]), dp[i + j]);
}
}
std::cout << dp[n - 1] << std::endl;
} | #include <bits/stdc++.h>
#define maxN 100005
long dp[maxN] = {INT_MAX};
long input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
dp[i + j] =
std::min(dp[i] + std::abs(input[i] - input[i + j]), dp[i + j]);
}
}
std::cout << dp[n - 1] << std::endl;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,841 | 952,840 | u110541731 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define MX 200005
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define pw(b, p) pow(b, p) + 0.1
#define ull unsigned long long
#define ll long long
void codeforces() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.in", "w", stdout);
#endif
}
int32_t main() {
codeforces();
// int t;cin>>t;
// while(t--) {
// }
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vi dp(n, INT_MAX);
dp[0] = 0;
if (n == 1) {
cout << dp[0] << endl;
return 0;
}
for (int i = 0; i < n; i++) {
int x = a[i];
if (i + 1 < n) {
int y = a[i + 1];
y = abs(y - x);
dp[i + 1] = min(dp[i + 1], y + dp[i]);
}
if (i + 2 < n) {
int y = a[i + 2];
y = abs(y - x);
dp[i + 2] = min(dp[i + 2], y + dp[i]);
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define MX 200005
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define pw(b, p) pow(b, p) + 0.1
#define ull unsigned long long
#define ll long long
void codeforces() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("output.in", "w", stdout);
#endif
}
int32_t main() {
// codeforces();
// int t;cin>>t;
// while(t--) {
// }
int n;
cin >> n;
vi a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vi dp(n, INT_MAX);
dp[0] = 0;
if (n == 1) {
cout << dp[0] << endl;
return 0;
}
for (int i = 0; i < n; i++) {
int x = a[i];
if (i + 1 < n) {
int y = a[i + 1];
y = abs(y - x);
dp[i + 1] = min(dp[i + 1], y + dp[i]);
}
if (i + 2 < n) {
int y = a[i + 2];
y = abs(y - x);
dp[i + 2] = min(dp[i + 2], y + dp[i]);
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"call.remove"
] | 952,842 | 952,843 | u072203760 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int dp[100010];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (auto &e : h)
cin >> e;
for (int i = 0; i < n; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n - 2; ++i) {
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int dp[100010];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (auto &e : h)
cin >> e;
for (int i = 0; i < n; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; ++i) {
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 952,844 | 952,845 | u054652697 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define gcd(a, b) __gcd(a, b)
#define pb push_back
#define sevensins \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define GO \
ll t; \
cin >> t; \
while (t--)
#define mod 1000000007
#define vect vector<long long int>
#define fore(p) for (auto &x : p)
#define bins binary_search
#define vecti vector<int>::iterator
#define bitout __builtin_popcount
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define PY 3.141592653589793238
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b % 2 == 11)
res *= a;
a *= a;
b /= 2;
}
return res;
}
int main() {
sevensins ll i, j, k, l, n;
cout.precision(10);
// GO
{
cin >> n;
vect v(n);
fore(v) cin >> x;
vect dp(n, 10001);
dp[0] = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + 2; j++)
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
cout << dp[n - 1] << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define gcd(a, b) __gcd(a, b)
#define pb push_back
#define sevensins \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define GO \
ll t; \
cin >> t; \
while (t--)
#define mod 1000000007
#define vect vector<long long int>
#define fore(p) for (auto &x : p)
#define bins binary_search
#define vecti vector<int>::iterator
#define bitout __builtin_popcount
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define PY 3.141592653589793238
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b % 2 == 11)
res *= a;
a *= a;
b /= 2;
}
return res;
}
int main() {
sevensins ll i, j, k, l, n;
cout.precision(10);
// GO
{
cin >> n;
vect v(n);
fore(v) cin >> x;
vect dp(n, 1e9);
dp[0] = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + 2; j++)
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
cout << dp[n - 1] << "\n";
}
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 952,848 | 952,849 | u913333921 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[1] = abs(h[1] - h[2]);
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];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,854 | 952,855 | u880022678 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n + 1);
dp[1] = abs(h[1] - h[2]);
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];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,856 | 952,855 | u880022678 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5 + 5;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[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(a[i] - a[j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[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(a[i] - a[j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 952,857 | 952,858 | u675040086 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int a[100005];
int dp[100005];
/*int fun(int n){
if (n==0 || n==1){
return 0;
}
if (n==2){
t[n]=abs(a[1]-a[0]);
return abs(a[1]-a[0]);
}
else{
if (t[n]!=-1){
return t[n];
}
t[n]=
min(abs(a[n-1]-a[n-2])+fun(n-1),abs(a[n-1]-a[n-3])+fun(n-2));
}
}*/
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
memset(dp, 0, sizeof(dp));
if (n >= 2) {
dp[2] = abs(a[1] - a[0]);
}
for (int i = 3; i <= n; i++) {
dp[i] = min(abs(a[i - 1] - a[i - 2]) + dp[i - 1],
a[i - 1] - a[i - 3] + dp[i - 2]);
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int a[100005];
int dp[100005];
/*int fun(int n){
if (n==0 || n==1){
return 0;
}
if (n==2){
t[n]=abs(a[1]-a[0]);
return abs(a[1]-a[0]);
}
else{
if (t[n]!=-1){
return t[n];
}
t[n]=
min(abs(a[n-1]-a[n-2])+fun(n-1),abs(a[n-1]-a[n-3])+fun(n-2));
}
}*/
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
memset(dp, 0, sizeof(dp));
if (n >= 2) {
dp[2] = abs(a[1] - a[0]);
}
for (int i = 3; i <= n; i++) {
dp[i] = min(abs(a[i - 1] - a[i - 2]) + dp[i - 1],
abs(a[i - 1] - a[i - 3]) + dp[i - 2]);
}
cout << dp[n] << endl;
} | [
"call.add",
"call.arguments.change"
] | 952,859 | 952,860 | u102044886 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
vector<int> dp(N); // dp[i] を求めるにはdp[i - 1], dp[i - 2]が必要
for (int i = 0; i < N; i++)
cin >> h.at(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 - 1] - h[i]), dp[i - 1] + abs(h[i - 2] - h[i]));
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
vector<int> dp(N); // dp[i] を求めるにはdp[i - 1], dp[i - 2]が必要
for (int i = 0; i < N; i++)
cin >> h.at(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 - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,861 | 952,862 | u615258936 | cpp |
p03160 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
rep(i, n) { cin >> h[i]; }
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
rep(i, n) { cin >> h[i]; }
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n - 1] << endl;
} | [
"expression.operation.binary.add"
] | 952,865 | 952,866 | u483697387 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// #define endl "\n"
ll recurse(ll i, vector<ll> &height, vector<ll> &dp) {
ll n = dp.size();
if (i == n - 1) {
return 0;
}
if (i == n - 1) {
return abs(height[n - 1] - height[n - 2]);
}
if (dp[i] != -1) {
return dp[i];
}
int one = abs(height[i + 1] - height[i]) + recurse(i + 1, height, dp);
int two = abs(height[i + 2] - height[i]) + recurse(i + 2, height, dp);
dp[i] = min(one, two);
return dp[i];
}
int main(void) {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
vector<ll> dp(n, -1);
cout << recurse(0, arr, dp);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// #define endl "\n"
ll recurse(ll i, vector<ll> &height, vector<ll> &dp) {
ll n = dp.size();
if (i == n - 1) {
return 0;
}
if (i == n - 2) {
return abs(height[n - 1] - height[n - 2]);
}
if (dp[i] != -1) {
return dp[i];
}
int one = abs(height[i + 1] - height[i]) + recurse(i + 1, height, dp);
int two = abs(height[i + 2] - height[i]) + recurse(i + 2, height, dp);
dp[i] = min(one, two);
return dp[i];
}
int main(void) {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// cout.tie(NULL);
ll n;
cin >> n;
vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
vector<ll> dp(n, -1);
cout << recurse(0, arr, dp);
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,867 | 952,868 | u806351914 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define inf 1e9
int frog(vector<int> a, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(a[i - 1] - a[i]) + dp[n - 1];
int option2 = i == 2 ? inf : abs(a[i - 2] - a[i]) + dp[n - 2];
dp[i] = min(option1, option2);
}
return dp[n];
}
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
cout << frog(v, n) << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define inf 1e9
int frog(vector<int> a, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(a[i - 1] - a[i]) + dp[i - 1];
int option2 = i == 2 ? inf : abs(a[i - 2] - a[i]) + dp[i - 2];
dp[i] = min(option1, option2);
}
return dp[n];
}
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
cout << frog(v, n) << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 952,872 | 952,873 | u804215372 | cpp |
p03160 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#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 lrep(i, n, m) for (int i = n; i < m; i++)
using ll = long long;
using Vii = vector<vector<int>>;
using Gjudge = vector<vector<bool>>;
using Vi = vector<int>;
using Vl = vector<ll>;
using Vs = vector<string>;
using Vb = vector<bool>;
using the = pair<int, int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int Mod = static_cast<int>(1e9 + 7);
const int INF = INT_MAX;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
Vi H(n);
rep(i, n) cin >> H[i];
Vi dp(n, INT_MAX);
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 - 1]));
}
cout << dp[n - 1] << endl;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#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 lrep(i, n, m) for (int i = n; i < m; i++)
using ll = long long;
using Vii = vector<vector<int>>;
using Gjudge = vector<vector<bool>>;
using Vi = vector<int>;
using Vl = vector<ll>;
using Vs = vector<string>;
using Vb = vector<bool>;
using the = pair<int, int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int Mod = static_cast<int>(1e9 + 7);
const int INF = INT_MAX;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int n;
cin >> n;
Vi H(n);
rep(i, n) cin >> H[i];
Vi dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(H[i] - H[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(H[i] - H[i - 2]));
}
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,874 | 952,875 | u121734488 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
void solve() {
ll n;
cin >> n;
vll heights(n);
loop(i, 0, n) cin >> heights[i];
vll dp(n + 1, 0);
loop(i, 1, n) {
if (i == 1) { // because for reaching i=1 there is only one option i.e. from
// 0 to 1.
dp[1] = abs(heights[1] - heights[0]);
continue;
}
ll option1 =
dp[i - 1] + abs(heights[i - 1] - heights[i]); // jump from i to i+1
ll option2 =
dp[i - 2] + abs(heights[i] - heights[i - 2]); // jump from i to i+2
dp[i] = min(option1, option2);
}
cout << dp[n - 1] << endl;
return;
}
int main() {
fastIO;
take_fileIO();
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
void solve() {
ll n;
cin >> n;
vll heights(n);
loop(i, 0, n) cin >> heights[i];
vll dp(n + 1, 0);
loop(i, 1, n) {
if (i == 1) { // because for reaching i=1 there is only one option i.e. from
// 0 to 1.
dp[1] = abs(heights[1] - heights[0]);
continue;
}
ll option1 =
dp[i - 1] + abs(heights[i - 1] - heights[i]); // jump from i to i+1
ll option2 =
dp[i - 2] + abs(heights[i] - heights[i - 2]); // jump from i to i+2
dp[i] = min(option1, option2);
}
cout << dp[n - 1] << endl;
return;
}
int main() {
fastIO;
// take_fileIO();
solve();
return 0;
} | [
"call.remove"
] | 952,876 | 952,877 | u142133038 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define mk make_pair
#define ascSort(v) sort(v.begin(), v.end())
#define descSort(v) sort(v.begin(), v.end(), greater<int>())
#define ff first
#define ss second
#define pi pair<int, int>
#define vi vector<int>
#define umapi unordered_map<int, int>
const int m = 998244353;
using namespace std;
void FIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int32_t main() {
FIO();
int n;
cin >> n;
int array[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
for (int i = 0; i < n; i++)
dp[i] = 1e9;
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(array[i] - array[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(array[i] - array[i + 2]));
}
cout << dp[n - 1] << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define int long long
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define mk make_pair
#define ascSort(v) sort(v.begin(), v.end())
#define descSort(v) sort(v.begin(), v.end(), greater<int>())
#define ff first
#define ss second
#define pi pair<int, int>
#define vi vector<int>
#define umapi unordered_map<int, int>
const int m = 998244353;
using namespace std;
void FIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int32_t main() {
// FIO();
int n;
cin >> n;
int array[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
for (int i = 0; i < n; i++)
dp[i] = 1e9;
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(array[i] - array[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(array[i] - array[i + 2]));
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"call.remove"
] | 952,882 | 952,883 | u841140330 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int mod = 998244353;
int main() {
int n;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int mod = 998244353;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
} | [] | 952,886 | 952,887 | u836207173 | cpp |
p03160 | #include <iostream> // input output stream, cin cout( console in console out)
#include <stdio.h> // standard input output
//#include <cmath.h> // circle math ( sin, con, sinh
#include <algorithm>
#include <iomanip> // input output manipulation
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int N; // 変数の宣言
cin >> N; // 標準入力
vector<int> h(N);
rep(i, N) { cin >> h.at(i); }
vector<int> cost(N);
rep(i, N) { cost.at(i) = -1; }
cost.at(0) = 0;
cost.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < N; i++) {
cost[i] = min((cost.at(i - 2) + abs(h.at(i) - h.at(i - 2))),
(cost.at(i - 2) + abs(h.at(i) - h.at(i - 1))));
}
cout << cost.at(N - 1) << endl; // 標準出力
} | #include <iostream> // input output stream, cin cout( console in console out)
#include <stdio.h> // standard input output
//#include <cmath.h> // circle math ( sin, con, sinh
#include <algorithm>
#include <iomanip> // input output manipulation
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
int main() {
int N; // 変数の宣言
cin >> N; // 標準入力
vector<int> h(N);
rep(i, N) { cin >> h.at(i); }
vector<int> cost(N);
rep(i, N) { cost.at(i) = -1; }
cost.at(0) = 0;
cost.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < N; i++) {
cost[i] = min(cost.at(i - 2) + abs(h.at(i) - h.at(i - 2)),
(cost.at(i - 1) + abs(h.at(i) - h.at(i - 1))));
}
cout << cost.at(N - 1) << endl; // 標準出力
} | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 952,890 | 952,891 | u480059652 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.