problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define mod 1000000007
int dp[100001];
void c() {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int Mincost(vi &h, int n) {
if (n == 0)
return 0;
if (dp[n] != -1)
return dp[n];
return dp[n] =
min(Mincost(h, n - 1) + abs(h[n] - h[n - 1]),
(n >= 2 ? Mincost(h, n - 2) + abs(h[n] - h[n - 2]) : INT_MAX));
}
int32_t main() {
c();
memset(dp, -1, sizeof(dp));
int n;
cin >> n;
vi a(n);
rep(i, 0, n) cin >> a[i];
cout << Mincost(a, n - 1);
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 vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define mod 1000000007
int dp[100001];
void c() {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int Mincost(vi &h, int n) {
if (n == 0)
return 0;
if (dp[n] != -1)
return dp[n];
return dp[n] =
min(Mincost(h, n - 1) + abs(h[n] - h[n - 1]),
(n >= 2 ? Mincost(h, n - 2) + abs(h[n] - h[n - 2]) : INT_MAX));
}
int32_t main() {
// c();
memset(dp, -1, sizeof(dp));
int n;
cin >> n;
vi a(n);
rep(i, 0, n) cin >> a[i];
cout << Mincost(a, n - 1);
return 0;
} | [
"call.remove"
] | 953,735 | 953,736 | u677650388 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;
const int MX = 2005;
int main() {
ll n;
cin >> n;
ll h[n];
ll dp[INF];
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n) {
if (h[i + 1] > h[i]) {
dp[i + 1] = min(dp[i + 1], dp[i] + h[i + 1] - h[i]);
} else {
dp[i + 1] = min(dp[i + 1], dp[i] - h[i + 1] + h[i]);
}
if (h[i + 2] > h[i]) {
dp[i + 2] = dp[i] + h[i + 2] - h[i];
} else {
dp[i + 2] = dp[i] - h[i + 2] + h[i];
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;
const int MX = 2005;
int main() {
ll n;
cin >> n;
ll h[n];
ll dp[n + 2];
rep(i, n) cin >> h[i];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n) {
if (h[i + 1] > h[i]) {
dp[i + 1] = min(dp[i + 1], dp[i] + h[i + 1] - h[i]);
} else {
dp[i + 1] = min(dp[i + 1], dp[i] - h[i + 1] + h[i]);
}
if (h[i + 2] > h[i]) {
dp[i + 2] = dp[i] + h[i + 2] - h[i];
} else {
dp[i + 2] = dp[i] - h[i + 2] + h[i];
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 953,741 | 953,740 | u226147473 | cpp |
p03160 | #include "bits/stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#define ordered_set tree<ll, null_type,less<ll>,
//rb_tree_tag,tree_order_statistics_node_update>
//#include <boost/math/common_factor.cpp>
using namespace std;
#define fi first
#define sec second
#define mod 1000000009
#define MOD 998244353
#define mod9 1000000009
#define ll long long
#define ld long double
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define rep(i, a, b) for (i = a; i < (int)b; i++)
#define repr(i, a, b) for (i = a; i >= (int)b; i--)
#define mp make_pair
#define t() \
int t; \
cin >> t; \
while (t--)
#define vll vector<ll>
#define setbits(x) __builtin_popcountll(x)
#define all(p) p.begin(), p.end()
#define N 1000000000
#define cMAXN 100
#define endl '\n'
#define zro(x) __builtin_ctzll(x)
//#define T pair<int, int>
//#define ordered_set tree<T, null_type, less<T>, rb_tree_tag,
//tree_order_statistics_node_update>
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
// use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
bool isV(char x) {
if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') {
return 1;
}
return 0;
}
bool isP(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
void fio() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("in.txt", "r", stdin);
// for writing output to output.txt
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
}
void print(int *a, int n) {
int i;
rep(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
void print2d(int a[][1000], int m, int n) {
int i, j;
rep(i, 0, m) {
rep(j, 0, n) { cout << setw(2) << a[i][j]; }
cout << endl;
}
}
/*bool comp(pii i1, pii i2)
{
//For Ascending Order (i1.fi < i2.sec)
if(i1.sec == i2.sec)
return (i1.fi > i2.fi);
return (i1.sec > i2.sec);
}*/
// All Functions below this
// Main Function
int32_t main() {
fio();
int n;
cin >> n;
int *a = new int[n];
int i;
rep(i, 0, n) { cin >> a[i]; }
int *d = new int[n];
d[0] = 0, d[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
d[i] =
min(d[i - 1] + abs(a[i] - a[i - 1]), d[i - 2] + abs(a[i] - a[i - 2]));
}
cout << d[n - 1] << endl;
}
| #include "bits/stdc++.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//#define ordered_set tree<ll, null_type,less<ll>,
//rb_tree_tag,tree_order_statistics_node_update>
//#include <boost/math/common_factor.cpp>
using namespace std;
#define fi first
#define sec second
#define mod 1000000009
#define MOD 998244353
#define mod9 1000000009
#define ll long long
#define ld long double
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define rep(i, a, b) for (i = a; i < (int)b; i++)
#define repr(i, a, b) for (i = a; i >= (int)b; i--)
#define mp make_pair
#define t() \
int t; \
cin >> t; \
while (t--)
#define vll vector<ll>
#define setbits(x) __builtin_popcountll(x)
#define all(p) p.begin(), p.end()
#define N 1000000000
#define cMAXN 100
#define endl '\n'
#define zro(x) __builtin_ctzll(x)
//#define T pair<int, int>
//#define ordered_set tree<T, null_type, less<T>, rb_tree_tag,
//tree_order_statistics_node_update>
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
// use cerr if u want to display at the bottom
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
bool isV(char x) {
if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') {
return 1;
}
return 0;
}
bool isP(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return 0;
}
return 1;
}
void fio() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("in.txt", "r", stdin);
// for writing output to output.txt
freopen("out.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
}
void print(int *a, int n) {
int i;
rep(i, 0, n) { cout << a[i] << " "; }
cout << endl;
}
void print2d(int a[][1000], int m, int n) {
int i, j;
rep(i, 0, m) {
rep(j, 0, n) { cout << setw(2) << a[i][j]; }
cout << endl;
}
}
/*bool comp(pii i1, pii i2)
{
//For Ascending Order (i1.fi < i2.sec)
if(i1.sec == i2.sec)
return (i1.fi > i2.fi);
return (i1.sec > i2.sec);
}*/
// All Functions below this
// Main Function
int32_t main() {
// fio();
int n;
cin >> n;
int *a = new int[n];
int i;
rep(i, 0, n) { cin >> a[i]; }
int *d = new int[n];
d[0] = 0, d[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
d[i] =
min(d[i - 1] + abs(a[i] - a[i - 1]), d[i - 2] + abs(a[i] - a[i - 2]));
}
cout << d[n - 1] << endl;
}
| [
"call.remove"
] | 953,762 | 953,763 | u526674581 | cpp |
p03160 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
#define COUT(x) cout << (x) << "\n"
int main() {
int n;
cin >> n;
vector<ll> dp(n + 1, 0);
int h[n + 1];
REP(i, n) cin >> h[i + 1];
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
COUT(dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define ALL(v) ((v).begin(), (v).end())
#define COUT(x) cout << (x) << "\n"
int main() {
int n;
cin >> n;
vector<ll> dp(n + 1, 0);
int h[n];
REP(i, n) cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
COUT(dp[n - 1]);
return 0;
} | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,766 | 953,767 | u459105164 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] =
min(dp[i + 1] + abs(h[i] - h[i + 1]), dp[i + 2] + abs(h[i] - h[i - 2]));
}
cout << dp[0] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] =
min(dp[i + 1] + abs(h[i] - h[i + 1]), dp[i + 2] + abs(h[i] - h[i + 2]));
}
cout << dp[0] << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,768 | 953,769 | u056912761 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; --i) {
dp[i] =
min(dp[i + 1] + abs(h[i] - h[i + 1]), dp[i + 2] + abs(h[i] - h[i - 2]));
}
cout << dp[0] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h, dp;
cin >> n;
h.assign(n, 0);
dp.assign(n + 2, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] =
min(dp[i + 1] + abs(h[i] - h[i + 1]), dp[i + 2] + abs(h[i] - h[i + 2]));
}
cout << dp[0] << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,770 | 953,769 | u056912761 | cpp |
p03160 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &x, int y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<int> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
// cout << hs[i] << endl;
}
vector<int> dp(N + 1, 1000000000000);
dp[1] = 0;
chmin(dp[2], dp[1] + std::abs(hs[1] - hs[0]));
for (size_t i = 3; i <= N; ++i) {
chmin(dp[i], dp[i - 1] + std::abs(hs[i - 1] - hs[i - 2]));
chmin(dp[i], dp[i - 2] + std::abs(hs[i - 1] - hs[i - 3]));
}
int ret = dp[N];
cout << ret;
}
int main() {
core();
return 0;
} | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(long &x, long y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<long> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
// cout << hs[i] << endl;
}
vector<long> dp(N + 1, 1000000000000);
dp[1] = 0;
chmin(dp[2], dp[1] + std::abs(hs[1] - hs[0]));
for (size_t i = 3; i <= N; ++i) {
chmin(dp[i], dp[i - 1] + std::abs(hs[i - 1] - hs[i - 2]));
chmin(dp[i], dp[i - 2] + std::abs(hs[i - 1] - hs[i - 3]));
}
long ret = dp[N];
cout << ret;
}
int main() {
core();
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 953,771 | 953,772 | u701642989 | cpp |
p03160 | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(int &x, int y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<int> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
// cout << hs[i] << endl;
}
vector<int> dp(N + 1, 1000000);
dp[1] = 0;
chmin(dp[2], dp[1] + std::abs(hs[1] - hs[0]));
for (size_t i = 3; i <= N; ++i) {
chmin(dp[i], dp[i - 1] + std::abs(hs[i - 1] - hs[i - 2]));
chmin(dp[i], dp[i - 2] + std::abs(hs[i - 1] - hs[i - 3]));
}
int ret = dp[N];
cout << ret;
}
int main() {
core();
return 0;
} | #include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
void chmin(long &x, long y) {
if (x > y)
x = y;
}
void core() {
size_t N;
cin >> N;
string hs_str;
std::vector<long> hs(N);
for (size_t i = 0; i < N; ++i) {
cin >> hs_str;
hs[i] = stoi(hs_str);
// cout << hs[i] << endl;
}
vector<long> dp(N + 1, 1000000000000);
dp[1] = 0;
chmin(dp[2], dp[1] + std::abs(hs[1] - hs[0]));
for (size_t i = 3; i <= N; ++i) {
chmin(dp[i], dp[i - 1] + std::abs(hs[i - 1] - hs[i - 2]));
chmin(dp[i], dp[i - 2] + std::abs(hs[i - 1] - hs[i - 3]));
}
long ret = dp[N];
cout << ret;
}
int main() {
core();
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 953,773 | 953,772 | u701642989 | cpp |
p03160 | // Justin Choi
#include <bits/stdc++.h>
using namespace std;
string FILENAME = "template";
#define io \
ifstream fin(FILENAME + ".in"); \
ofstream fout(FILENAME + ".out")
#define fwrite(X) fout << X;
#define fwriteln(X) fout << X << endl;
#define forl(V, N) for (int V = 0; V < N; V++)
#define fore(E, X) for (auto &E : X)
#define print(X) cout << X
#define println(X) cout << X << endl
#define printe(X) \
for (auto &E : X) \
cout << E << " "; \
cout << endl
#define rem(X) \
X.top(); \
X.pop()
#define mid(A, B) ((A + B) / 2)
#define setmin(A, B) A = min(A, B)
#define setmax(A, B) A = max(A, B)
#define graph unordered_map<int, unordered_set<int>>
#define vi vector<int>
#define pb push_back
#define ll long long
int main() {
int N;
cin >> N;
vi stones(N);
forl(i, N) cin >> stones[i];
vi dp(N + 2);
fill(dp.begin(), dp.end(), 100001);
dp[0] = 0;
forl(i, N) {
setmin(dp[i + 1], dp[i] + abs(stones[i] - stones[i + 1]));
setmin(dp[i + 2], dp[i] + abs(stones[i] - stones[i + 2]));
}
println(dp[N - 1]);
} | // Justin Choi
#include <bits/stdc++.h>
using namespace std;
string FILENAME = "template";
#define io \
ifstream fin(FILENAME + ".in"); \
ofstream fout(FILENAME + ".out")
#define fwrite(X) fout << X;
#define fwriteln(X) fout << X << endl;
#define forl(V, N) for (int V = 0; V < N; V++)
#define fore(E, X) for (auto &E : X)
#define print(X) cout << X
#define println(X) cout << X << endl
#define printe(X) \
for (auto &E : X) \
cout << E << " "; \
cout << endl
#define rem(X) \
X.top(); \
X.pop()
#define mid(A, B) ((A + B) / 2)
#define setmin(A, B) A = min(A, B)
#define setmax(A, B) A = max(A, B)
#define graph unordered_map<int, unordered_set<int>>
#define vi vector<int>
#define pb push_back
#define ll long long
int main() {
int N;
cin >> N;
vi stones(N);
forl(i, N) cin >> stones[i];
vector<ll> dp(N + 10);
fill(dp.begin(), dp.end(), 999999999999);
dp[0] = 0;
forl(i, N) {
setmin(dp[i + 1], dp[i] + abs(stones[i] - stones[i + 1]));
setmin(dp[i + 2], dp[i] + abs(stones[i] - stones[i + 2]));
}
println(dp[N - 1]);
} | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,774 | 953,775 | u602301110 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = h[1] - h[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << "\n";
return 0;
} | [
"call.arguments.change",
"call.add"
] | 953,778 | 953,779 | u845907943 | cpp |
p03160 | // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
int main() {
ll N;
cin >> N;
ll dp[1000010];
rep(i, N) { dp[i] = INF; }
dp[0] = 0;
vector<ll> h(N);
rep(i, N) { cin >> h[i]; }
dp[1] = 0;
for (int i = 2; i <= N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i - 1] - h[i - 2]),
dp[i - 2] + abs(h[i - 1] - h[i - 3]));
}
/*
rep(i,N){
cout << dp[i] <<endl;
}
*/
cout << dp[N] << endl;
}
| // g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
int main() {
ll N;
cin >> N;
ll dp[1000010];
rep(i, N) { dp[i] = INF; }
dp[0] = INF;
vector<ll> h(N);
rep(i, N) { cin >> h[i]; }
dp[1] = 0;
for (int i = 2; i <= N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i - 1] - h[i - 2]),
dp[i - 2] + abs(h[i - 1] - h[i - 3]));
}
/*
rep(i,N){
cout << dp[i] <<endl;
}
*/
cout << dp[N] << endl;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,782 | 953,783 | u388134182 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 2; i >= 0; i--) {
int mini = INT_MAX;
for (int j = i + 1; j <= i + 2 && j < n; j++) {
mini = min(mini, max(a[j] - a[i], a[i] - a[j]));
}
dp[i] = mini;
}
cout << dp[0];
// your code goes here
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 2; i >= 0; i--) {
int mini = INT_MAX;
for (int j = i + 1; j <= i + 2 && j < n; j++) {
mini = min(mini, max(a[j] - a[i], a[i] - a[j]) + dp[j]);
}
dp[i] = mini;
}
cout << dp[0];
// your code goes here
return 0;
}
| [
"assignment.change"
] | 953,786 | 953,787 | u690520470 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll, ll>>
#include <algorithm> //__gcd(a,b)
#include <cmath> //abs
#include <iostream>
int main() {
ll n;
cin >> n;
vl h(n);
rep(i, n) cin >> h[i];
vl d(n);
d[0] = 0;
d[1] = h[1] - h[0];
for (ll i = 2; i < n; i++)
d[i] =
min(d[i - 1] + abs(h[i] - h[i - 1]), d[i - 2] + abs(h[i] - h[i - 2]));
cout << d[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define vl vector<ll>
#define vpl vector<pair<ll, ll>>
#include <algorithm> //__gcd(a,b)
#include <cmath> //abs
#include <iostream>
int main() {
ll n;
cin >> n;
vl h(n);
rep(i, n) cin >> h[i];
vl d(n);
d[0] = 0;
d[1] = abs(h[1] - h[0]);
for (ll i = 2; i < n; i++)
d[i] =
min(d[i - 1] + abs(h[i] - h[i - 1]), d[i - 2] + abs(h[i] - h[i - 2]));
cout << d[n - 1] << endl;
} | [
"call.add",
"call.arguments.change"
] | 953,788 | 953,789 | u454600293 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll i;
ll h[n];
ll dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = (ll)(abs(h[1] - h[0]));
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + (ll)abs(h[i] - h[i - 1]),
dp[i - 2] + (ll)abs(h[i] - h[i - 2]));
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll i;
ll h[n];
ll dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = (ll)(abs(h[1] - h[0]));
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + (ll)abs(h[i] - h[i - 1]),
dp[i - 2] + (ll)abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
return 0;
}
| [
"expression.operation.binary.add"
] | 953,790 | 953,791 | u260870629 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]) + dp[i - 2] + abs(h[i] - h[i - 2]);
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) 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] << endl;
}
| [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 953,794 | 953,795 | u392423112 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]) + dp[i - 2] + abs(h[i] - h[i - 1]);
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) 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] << endl;
}
| [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 953,796 | 953,795 | u392423112 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N;
long long h[100010];
// DP テーブル
long long dp[100010];
int main() {
int 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] << endl;
}
| #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N;
long long h[100010];
// DP テーブル
long long dp[100010];
int main() {
int N;
cin >> 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] << endl;
}
| [] | 953,801 | 953,802 | u731665172 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
for (i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
for (i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[n - 1];
}
| [] | 953,809 | 953,810 | u987273922 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -1;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -100000;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 953,813 | 953,814 | u901327149 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -1;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
arr[0] = -100000;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 953,815 | 953,814 | u901327149 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll a[n];
ll i;
for (i = 0; i < n; i++)
cin >> a[i];
ll sol[n];
sol[0] = 0;
sol[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
sol[i] = min((sol[i - 1] + abs(a[i] - a[i - 1])),
(sol[i - 2] + abs(a[i] - a[i - 2])));
cout << sol[n];
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n;
cin >> n;
ll a[n];
ll i;
for (i = 0; i < n; i++)
cin >> a[i];
ll sol[n];
sol[0] = 0;
sol[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
sol[i] = min((sol[i - 1] + abs(a[i] - a[i - 1])),
(sol[i - 2] + abs(a[i] - a[i - 2])));
cout << sol[n - 1];
} | [
"expression.operation.binary.add"
] | 953,822 | 953,823 | u975400222 | cpp |
p03160 |
#include <bits/stdc++.h>
#define zcin(type, a) \
type a; \
cin >> a;
#define zcout(a, sep1, b, sep2) cout << a << sep1 << b << sep2;
#define zfor(i, b, n) for (int i = b; i < n; ++i)
#define pb push_back
const int INF = 1e5 + 5;
using namespace std;
int main() {
#ifdef ME
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
zcin(int, n);
vector<int> dp(n, INF);
vector<int> arr(n);
zfor(i, 0, n) cin >> arr[i];
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (auto j : {i + 1, i + 2}) {
if (j < n) {
int cost = abs(arr[i] - arr[j]);
dp[j] = min(dp[j], dp[i] + cost);
}
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
#define zcin(type, a) \
type a; \
cin >> a;
#define zcout(a, sep1, b, sep2) cout << a << sep1 << b << sep2;
#define zfor(i, b, n) for (int i = b; i < n; ++i)
#define pb push_back
const int INF = 1e9 + 5;
using namespace std;
int main() {
#ifdef ME
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
zcin(int, n);
vector<int> dp(n, INF);
vector<int> arr(n);
zfor(i, 0, n) cin >> arr[i];
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (auto j : {i + 1, i + 2}) {
if (j < n) {
int cost = abs(arr[i] - arr[j]);
dp[j] = min(dp[j], dp[i] + cost);
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 953,834 | 953,835 | u549103550 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define rep(i, l, n) for (int i = (l); i < n; i++)
#define rep_cs(i, l, n) for (int i = (l); i <= n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
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 = 1000000007;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
const ll INF = 1LL << 60;
// int max = *std::max_element(vec.begin(), vec.end());
// int sum = accumulate(list, list + size, 0);
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
using Graph = vector<vector<int>>;
Graph G;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, next_v);
}
}
int main() {
ll n, k;
cin >> n >> k;
vll h(n);
rep(i, 0, n) cin >> h[i];
ll dp[100010];
rep(i, 0, 100010) { dp[i] = INF; }
dp[0] = 0;
rep(i, 0, n) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define rep(i, l, n) for (int i = (l); i < n; i++)
#define rep_cs(i, l, n) for (int i = (l); i <= n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
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 = 1000000007;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
const ll INF = 1LL << 60;
// int max = *std::max_element(vec.begin(), vec.end());
// int sum = accumulate(list, list + size, 0);
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
using Graph = vector<vector<int>>;
Graph G;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, next_v);
}
}
int main() {
ll n;
cin >> n;
vll h(n);
rep(i, 0, n) cin >> h[i];
ll dp[100010];
rep(i, 0, 100010) { dp[i] = INF; }
dp[0] = 0;
rep(i, 0, n) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
} | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 953,842 | 953,843 | u496074393 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define f q.front()
#define SIZE (ll)(1e3)
#define mod (ll)(1e9 + 7)
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], i, j;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = 100000;
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
for (j = 1; j < 3; j++)
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define f q.front()
#define SIZE (ll)(1e3)
#define mod (ll)(1e9 + 7)
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], i, j;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = mod;
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
for (j = 1; j < 3; j++) {
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n];
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,846 | 953,847 | u850140043 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define f q.front()
#define SIZE (ll)(1e3)
#define mod (ll)(1e9 + 7)
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], i, j;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = 10000;
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
for (j = 1; j < 3; j++)
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define f q.front()
#define SIZE (ll)(1e3)
#define mod (ll)(1e9 + 7)
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], i, j;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = mod;
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
for (j = 1; j < 3; j++) {
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n];
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,848 | 953,847 | u850140043 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define f q.front()
#define SIZE (ll)(1e3)
#define mod (ll)(1e9 + 7)
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], i, j;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = 100000;
dp[1] = 0;
for (i = 1; i <= n; i++) {
for (j = i + 1; j < i + 3; j++) {
if (j <= n)
dp[j] = min(dp[i] + abs(a[i] - a[j]), dp[j]);
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define max(a, b) (a > b ? a : b)
#define min(a, b) (a < b ? a : b)
#define f q.front()
#define SIZE (ll)(1e3)
#define mod (ll)(1e9 + 7)
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n + 1], i, j;
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = mod;
dp[1] = 0;
for (i = 1; i <= n; i++) {
for (j = i + 1; j < i + 3; j++) {
if (j <= n)
dp[j] = min(dp[i] + abs(a[i] - a[j]), dp[j]);
}
}
cout << dp[n];
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 953,849 | 953,850 | u850140043 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k = 2;
cin >> n;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
int start;
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
start = i - k;
if (start < 0)
start = 0;
for (int j = start; j < k; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k = 2;
cin >> n;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
int start;
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
start = i - k;
if (start < 0)
start = 0;
for (int j = start; j < i; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 953,859 | 953,860 | u565840775 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
; \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MX 80
#define FF \
freopen("input.in", "r", stdin); \
freopen("output.txt", "w", stdout);
int n;
int a[MX];
int dp[MX];
int f(int i) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
if (i < n - 1)
return dp[i] = min(f(i + 1) + abs(a[i] - a[i + 1]),
f(i + 2) + abs(a[i] - a[i + 2]));
else
return dp[i] = f(i + 1) + abs(a[i] - a[i + 1]);
}
int main() {
// FF;
IOS;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof dp);
cout << f(1);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
; \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MX 100001
#define FF \
freopen("input.in", "r", stdin); \
freopen("output.txt", "w", stdout);
int n;
int a[MX];
int dp[MX];
int f(int i) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
if (i < n - 1)
return dp[i] = min(f(i + 1) + abs(a[i] - a[i + 1]),
f(i + 2) + abs(a[i] - a[i + 2]));
else
return dp[i] = f(i + 1) + abs(a[i] - a[i + 1]);
}
int main() {
// FF;
IOS;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof dp);
cout << f(1);
}
| [
"preprocessor.define.value.change",
"literal.integer.change"
] | 953,861 | 953,862 | u905457052 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++)
dp[i] = min(abs(arr[i - 1] - arr[i] + dp[i - 1]),
abs(arr[i - 2] - arr[i]) + dp[i - 2]);
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++)
dp[i] = min(abs(arr[i - 1] - arr[i]) + dp[i - 1],
abs(arr[i - 2] - arr[i]) + dp[i - 2]);
cout << dp[n - 1];
} | [
"call.arguments.change",
"expression.operation.binary.remove"
] | 953,863 | 953,864 | u365344644 | cpp |
p03160 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#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 ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int N;
vector<long long> h(N + 1);
long long dp[110000];
long long dfs(int k) {
if (k >= N)
return INF;
if (k == N - 1)
return 0;
if (dp[k] != -1)
return dp[k];
long long step1 = dfs(k + 1) + abs(h[k + 1] - h[k]);
long long step2 = dfs(k + 2) + abs(h[k + 2] - h[k]);
return dp[k] = min(step1, step2);
}
int main() {
cin >> N;
REP(i, N) { cin >> h[i]; }
REP(i, 110000) { dp[i] = -1; }
cout << dfs(0) << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#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 ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int N;
vector<long long> h(110000);
long long dp[110000];
long long dfs(int k) {
if (k >= N)
return INF;
if (k == N - 1)
return 0;
if (dp[k] != -1)
return dp[k];
long long step1 = dfs(k + 1) + abs(h[k + 1] - h[k]);
long long step2 = dfs(k + 2) + abs(h[k + 2] - h[k]);
return dp[k] = min(step1, step2);
}
int main() {
cin >> N;
REP(i, N) { cin >> h[i]; }
REP(i, 110000) { dp[i] = -1; }
cout << dfs(0) << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,866 | 953,867 | u220428866 | cpp |
p03160 | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(), X.end()
#define endl "\n"
#define sz(x) ((ll)((x).size()))
#define pq priority_queue
using namespace std;
typedef long long int ll;
typedef long double ld;
vll dp;
vll a;
ll n;
ll calc(ll idx) {
if (dp[idx] != -1) {
return dp[idx];
}
else if (idx == n - 2) {
dp[n - 2] = abs(a[idx] + a[idx + 1]) + calc(n - 1);
return dp[n - 2];
}
else if (idx >= (n - 1)) {
dp[n - 1] = 0;
return dp[n - 1];
}
dp[idx] = min(abs(a[idx] - a[idx + 1]) + calc(idx + 1),
abs(a[idx] - a[idx + 2]) + calc(idx + 2));
return dp[idx];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
ll ans = 0;
dp.resize(n);
dp.assign(n, -1);
a.resize(n);
lp(i, 0, n) cin >> a[i];
cout << calc(0) << endl;
}
| // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(), X.end()
#define endl "\n"
#define sz(x) ((ll)((x).size()))
#define pq priority_queue
using namespace std;
typedef long long int ll;
typedef long double ld;
vll dp;
vll a;
ll n;
ll calc(ll idx) {
if (dp[idx] != -1) {
return dp[idx];
}
else if (idx == n - 2) {
dp[n - 2] = abs(a[idx] - a[idx + 1]) + calc(n - 1);
return dp[n - 2];
}
else if (idx >= (n - 1)) {
dp[n - 1] = 0;
return dp[n - 1];
}
dp[idx] = min(abs(a[idx] - a[idx + 1]) + calc(idx + 1),
abs(a[idx] - a[idx + 2]) + calc(idx + 2));
return dp[idx];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
ll ans = 0;
dp.resize(n);
dp.assign(n, -1);
a.resize(n);
lp(i, 0, n) cin >> a[i];
cout << calc(0) << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,868 | 953,869 | u007939655 | cpp |
p03160 | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(), X.end()
#define endl "\n"
#define sz(x) ((ll)((x).size()))
#define pq priority_queue
using namespace std;
typedef long long int ll;
typedef long double ld;
vll dp;
vll a;
ll n;
ll calc(ll idx) {
if (dp[idx] != -1) {
return dp[idx];
}
else if (dp[idx] == n - 2) {
dp[n - 2] = abs(a[idx] + a[idx + 1]) + calc(n - 2);
return dp[n - 2];
}
else if (idx >= (n - 1)) {
dp[n - 1] = 0;
return dp[n - 1];
}
dp[idx] = min(abs(a[idx] - a[idx + 1]) + calc(idx + 1),
abs(a[idx] - a[idx + 2]) + calc(idx + 2));
return dp[idx];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
ll ans = 0;
dp.resize(n);
dp.assign(n, -1);
a.resize(n);
lp(i, 0, n) cin >> a[i];
cout << calc(0) << endl;
}
| // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(), X.end()
#define endl "\n"
#define sz(x) ((ll)((x).size()))
#define pq priority_queue
using namespace std;
typedef long long int ll;
typedef long double ld;
vll dp;
vll a;
ll n;
ll calc(ll idx) {
if (dp[idx] != -1) {
return dp[idx];
}
else if (idx == n - 2) {
dp[n - 2] = abs(a[idx] - a[idx + 1]) + calc(n - 1);
return dp[n - 2];
}
else if (idx >= (n - 1)) {
dp[n - 1] = 0;
return dp[n - 1];
}
dp[idx] = min(abs(a[idx] - a[idx + 1]) + calc(idx + 1),
abs(a[idx] - a[idx + 2]) + calc(idx + 2));
return dp[idx];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
ll ans = 0;
dp.resize(n);
dp.assign(n, -1);
a.resize(n);
lp(i, 0, n) cin >> a[i];
cout << calc(0) << endl;
}
| [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 953,870 | 953,869 | u007939655 | cpp |
p03160 | // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(), X.end()
#define endl "\n"
#define sz(x) ((ll)((x).size()))
#define pq priority_queue
using namespace std;
typedef long long int ll;
typedef long double ld;
vll dp;
vll a;
ll n;
ll calc(ll idx) {
if (dp[idx] != -1) {
return dp[idx];
}
else if (dp[idx] == n - 2) {
dp[n - 2] == abs(a[idx] + a[idx + 1]) + calc(n - 2);
return dp[n - 2];
}
else if (idx >= (n - 1)) {
dp[n - 1] = 0;
return dp[n - 1];
}
dp[idx] = min(abs(a[idx] - a[idx + 1]) + calc(idx + 1),
abs(a[idx] - a[idx + 2]) + calc(idx + 2));
return dp[idx];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
ll ans = 0;
dp.resize(n);
dp.assign(n, -1);
a.resize(n);
lp(i, 0, n) cin >> a[i];
cout << calc(0) << endl;
}
| // Mehul Mathur randi hai
// Murali big ghey
// RisHiH is slave
// Anamaya is Sexy
// Arihanth is gay
// Aakash Aanegola is god
#include <bits/stdc++.h>
#define lp(var, start, end) for (ll var = start; var < end; ++var)
#define rlp(var, start, end) for (ll var = start; var >= end; var--)
#define pb push_back
#define mp make_pair
#define pf push_front
#define ff first
#define ss second
#define vll vector<ll>
#define vld vector<ld>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define vpll vector<pll>
#define vpld vector<pld>
#define all(X) X.begin(), X.end()
#define endl "\n"
#define sz(x) ((ll)((x).size()))
#define pq priority_queue
using namespace std;
typedef long long int ll;
typedef long double ld;
vll dp;
vll a;
ll n;
ll calc(ll idx) {
if (dp[idx] != -1) {
return dp[idx];
}
else if (idx == n - 2) {
dp[n - 2] = abs(a[idx] - a[idx + 1]) + calc(n - 1);
return dp[n - 2];
}
else if (idx >= (n - 1)) {
dp[n - 1] = 0;
return dp[n - 1];
}
dp[idx] = min(abs(a[idx] - a[idx + 1]) + calc(idx + 1),
abs(a[idx] - a[idx + 2]) + calc(idx + 2));
return dp[idx];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
ll ans = 0;
dp.resize(n);
dp.assign(n, -1);
a.resize(n);
lp(i, 0, n) cin >> a[i];
cout << calc(0) << endl;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.chan... | 953,871 | 953,869 | u007939655 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
cin >> n;
int dp[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
dp[i] = 0;
}
dp[0] = v[0];
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(v[i - 1] - v[i]), dp[i - 2] + abs(v[i - 2] - v[i]));
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
cin >> n;
int dp[n];
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> temp;
v.push_back(temp);
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(v[i - 1] - v[i]), dp[i - 2] + abs(v[i - 2] - v[i]));
cout << dp[n - 1] << endl;
return 0;
} | [] | 953,872 | 953,873 | u137340048 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long data[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> data[n];
}
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(abs(data[i] - data[i - 1]) + dp[i - 1],
abs(data[i] - data[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long data[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> data[i];
}
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(abs(data[i] - data[i - 1]) + dp[i - 1],
abs(data[i] - data[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.narrow.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 953,875 | 953,876 | u506327015 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 1);
dp[1] = abs(h[0] - h[1]);
for (int i = 1; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 1);
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;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,888 | 953,889 | u239409893 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, inf = LONG_MAX;
cin >> n;
vector<int> v(n + 10, inf), p(n + 10);
v[0] = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
v[i + 1] = min(v[i + 1], v[i] + abs(p[i] - p[i + 1]));
v[i + 2] = min(v[i + 2], v[i] + abs(p[i] - p[i + 2]));
}
cout << v[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, inf = 100000000000000000000;
cin >> n;
vector<int> v(n + 10, inf), p(n + 10);
v[0] = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n; i++) {
v[i + 1] = min(v[i + 1], v[i] + abs(p[i] - p[i + 1]));
v[i + 2] = min(v[i + 2], v[i] + abs(p[i] - p[i + 2]));
}
cout << v[n - 1] << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 953,890 | 953,891 | u677464470 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
#define ull unsigned long long
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define vi vector<ll>
#define INF 1000000000
#define M ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main() {
M ll n, dp[100] = {};
vi v;
cin >> n;
for (int i = 0; i < n; i++) {
ll in;
cin >> in;
v.pb(in);
}
dp[0] = 0;
for (int i = 1; i <= n; i++)
dp[i] = INF;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i] - v[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(v[i] - v[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
#define ull unsigned long long
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define vi vector<ll>
#define INF 1000000000
#define M ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main() {
M ll n, dp[1000001] = {};
vi v;
cin >> n;
for (int i = 0; i < n; i++) {
ll in;
cin >> in;
v.pb(in);
}
dp[0] = 0;
for (int i = 1; i <= n; i++)
dp[i] = INF;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i] - v[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(v[i] - v[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 953,894 | 953,895 | u398912415 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, n, m) for (int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
REP(i, N) cin >> A[i];
vector<ll> dp(N);
dp[1] = abs(dp[1] - dp[0]);
FOR(i, 2, N) {
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]), dp[i - 2] + abs(A[i] - A[i - 2]));
}
PRINT(dp.back());
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, n, m) for (int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
REP(i, N) cin >> A[i];
vector<ll> dp(N);
dp[1] = abs(A[1] - A[0]);
FOR(i, 2, N) {
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]), dp[i - 2] + abs(A[i] - A[i - 2]));
}
PRINT(dp.back());
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,899 | 953,900 | u802905102 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1) {
cout << "0";
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 1; 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];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1) {
cout << "0";
return 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];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,901 | 953,902 | u525349103 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1)
cout << "0";
return 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 1; 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];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int sum;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
if (n == 1) {
cout << "0";
return 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];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,903 | 953,902 | u525349103 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j;
cin >> n;
ll a[n + 1];
ll dp[n + 2];
for (i = 0; i < n + 2; i++)
dp[i] = 1e13;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[n] = 0;
dp[0] = 0;
for (i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(a[i + 1] - a[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(a[i + 2] - a[i]));
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll n, i, j;
cin >> n;
ll a[n + 1];
ll dp[n + 2];
for (i = 0; i < n + 2; i++)
dp[i] = 1e13;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
a[n] = 0;
dp[0] = 0;
for (i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(a[i + 1] - a[i]));
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.add"
] | 953,904 | 953,905 | u595893956 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, a[100005], dp[100005];
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
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] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, a[100005], dp[100005];
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,908 | 953,909 | u282636125 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int v[100001];
int dp(int i, int a[]) {
if (i == 0) {
v[0] = 0;
return 0;
}
if (i == 1) {
v[1] = (abs(a[0] - a[1]));
return v[1];
}
if (v[i] != -1)
return v[i];
v[i] = min((abs(a[i] - a[i - 1]) + dp(i - 1, a)),
abs(a[i] - a[i - 2]) + dp(i - 2, a));
// v[i]=a[i];
return a[i];
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
v[i] = -1;
cout << dp(n - 1, a);
} | #include <bits/stdc++.h>
using namespace std;
int v[100001];
int dp(int i, int a[]) {
if (i == 0) {
v[0] = 0;
return 0;
}
if (i == 1) {
v[1] = (abs(a[0] - a[1]));
return v[1];
}
if (v[i] != -1)
return v[i];
v[i] = min((abs(a[i] - a[i - 1]) + dp(i - 1, a)),
abs(a[i] - a[i - 2]) + dp(i - 2, a));
// v[i]=a[i];
return v[i];
}
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
v[i] = -1;
cout << dp(n - 1, a);
} | [
"identifier.change",
"function.return_value.change"
] | 953,910 | 953,911 | u209981906 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define MX 100005
int A[MX];
int dp[MX];
int F(int n) {
if (n == 1) {
return dp[n] = 0;
}
if (n == 2) {
return dp[n] = abs(A[2] - A[1]);
}
if (dp[n] != -1)
return dp[n];
return dp[n] = min(F(n - 1) + abs(A[n] - A[n - 1]),
F(n - 2) + abs(A[n] - A[n - 2]));
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
dp[i] = -1;
}
dp[1] = 0;
dp[2] = abs(A[1] - A[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(A[n] - A[n - 1]), dp[i - 2] + abs(A[n] - A[n - 2]));
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MX 100005
int A[MX];
int dp[MX];
int F(int n) {
if (n == 1) {
return dp[n] = 0;
}
if (n == 2) {
return dp[n] = abs(A[2] - A[1]);
}
if (dp[n] != -1)
return dp[n];
return dp[n] = min(F(n - 1) + abs(A[n] - A[n - 1]),
F(n - 2) + abs(A[n] - A[n - 2]));
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
dp[i] = -1;
}
dp[1] = 0;
dp[2] = abs(A[1] - A[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]), dp[i - 2] + abs(A[i] - A[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,914 | 953,915 | u918656720 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll exp(ll a, ll b, ll m);
#define vl vector<ll>
#define pll pair<ll, ll>
void solve() {
ll n;
cin >> n;
ll h[n];
f(n) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = h[1] - h[0];
fr(i, 2, n) {
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;
}
int main() {
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
ll exp(ll a, ll b, ll m) {
if (b == 0) {
return 1;
}
ll temp = exp(a, b / 2, m);
temp = (temp * temp) % m;
if (b & 1) {
return (temp * (a % m)) % m;
}
return temp;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll exp(ll a, ll b, ll m);
#define vl vector<ll>
#define pll pair<ll, ll>
void solve() {
int n;
cin >> n;
int h[n];
f(n) cin >> h[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
fr(i, 2, n) {
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;
}
int main() {
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
ll exp(ll a, ll b, ll m) {
if (b == 0) {
return 1;
}
ll temp = exp(a, b / 2, m);
temp = (temp * temp) % m;
if (b & 1) {
return (temp * (a % m)) % m;
}
return temp;
} | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 953,916 | 953,917 | u339112743 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll exp(ll a, ll b, ll m);
#define vl vector<ll>
#define pll pair<ll, ll>
void solve() {
int n;
cin >> n;
int h[n];
f(n) cin >> h[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = h[1] - h[0];
fr(i, 2, n) {
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;
}
int main() {
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
ll exp(ll a, ll b, ll m) {
if (b == 0) {
return 1;
}
ll temp = exp(a, b / 2, m);
temp = (temp * temp) % m;
if (b & 1) {
return (temp * (a % m)) % m;
}
return temp;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007
#define pb push_back
#define fi first
#define si second
#define mp make_pair
#define f(n) for (ll i = 0; i < n; i++)
#define ff(m) for (ll j = 0; j < m; j++)
#define fr(i, p, n) for (ll i = p; i < n; i++)
#define in insert
ll exp(ll a, ll b, ll m);
#define vl vector<ll>
#define pll pair<ll, ll>
void solve() {
int n;
cin >> n;
int h[n];
f(n) cin >> h[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
fr(i, 2, n) {
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;
}
int main() {
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
ll exp(ll a, ll b, ll m) {
if (b == 0) {
return 1;
}
ll temp = exp(a, b / 2, m);
temp = (temp * temp) % m;
if (b & 1) {
return (temp * (a % m)) % m;
}
return temp;
} | [
"call.add",
"call.arguments.change"
] | 953,918 | 953,917 | u339112743 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long dp[n];
for (int i = 0; i < n; i++)
dp[i] = 100000;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000000;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 953,919 | 953,920 | u877494916 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[100000];
long long h[100000];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[100000];
long long h[100000];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000000000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 953,925 | 953,926 | u420245204 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[10100];
long long h[10100];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long dp[100000];
long long h[100000];
for (int i = 0; i < N; ++i) {
cin >> h[i];
dp[i] = 10000000000;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change"
] | 953,927 | 953,926 | u420245204 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i + 1] - h[i]), dp[i - 2] + abs(h[i + 1] - h[i]));
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i + 1] - h[i]),
dp[i - 2] + abs(h[i + 1] - h[i - 1]));
}
cout << dp[N - 1] << endl;
}
| [
"assignment.change"
] | 953,931 | 953,932 | u963353562 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i + 1] - h[i]),
dp[i - 2] + abs(h[i + 1] - h[i - 1]));
}
cout << dp[3] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(h[i + 1] - h[i]),
dp[i - 2] + abs(h[i + 1] - h[i - 1]));
}
cout << dp[N - 1] << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 953,933 | 953,932 | u963353562 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (i == 1)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]));
else
dp[i] = min(dp[i], min(dp[i - 1] + abs(h[i - 1] - h[i]),
dp[i - 2] + abs(h[i - 2] - h[i])));
}
// for(auto it:dp)cout<<it<<endl;
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N, 1 << 30);
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (i == 1)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]));
else
dp[i] = min(dp[i], min(dp[i - 1] + abs(h[i - 1] - h[i]),
dp[i - 2] + abs(h[i - 2] - h[i])));
}
// for(auto it:dp)cout<<it<<endl;
cout << dp[N - 1] << endl;
return 0;
}
| [
"assignment.change"
] | 953,937 | 953,938 | u864171425 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N, INF);
dp[0] = 0;
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]));
else
dp[i] = min(dp[i], min(dp[i - 1] + abs(h[i - 1] - h[i]),
dp[i - 2] + abs(h[i - 2] - h[i])));
}
// for(auto it:dp)cout<<it<<endl;
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N, 1 << 30);
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (i == 1)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]));
else
dp[i] = min(dp[i], min(dp[i - 1] + abs(h[i - 1] - h[i]),
dp[i - 2] + abs(h[i - 2] - h[i])));
}
// for(auto it:dp)cout<<it<<endl;
cout << dp[N - 1] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,939 | 953,938 | u864171425 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]));
else
dp[i] = min(dp[i], min(dp[i - 1] + abs(h[i - 1] - h[i]),
dp[i - 2] + abs(h[i - 2] - h[i])));
}
// for(auto it:dp)cout<<it<<endl;
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF (1 << (4 * 4 - 1))
#define MOD 1000000007
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N, 1 << 30);
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (i == 1)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i - 1] - h[i]));
else
dp[i] = min(dp[i], min(dp[i - 1] + abs(h[i - 1] - h[i]),
dp[i - 2] + abs(h[i - 2] - h[i])));
}
// for(auto it:dp)cout<<it<<endl;
cout << dp[N - 1] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,940 | 953,938 | u864171425 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
int h[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
long long int h[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
long long int dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
} | [
"variable_declaration.type.widen.change"
] | 953,941 | 953,942 | u821432765 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
void io() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int maxn = 2 * 1e5 + 10;
const int maxm = 100 + 10;
#define ios \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int h[maxn];
int fabs(int x) { return x > 0 ? x : -x; }
int dp[maxn];
int main() {
io();
int N;
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 2; i <= N; i++) {
dp[i] = min(dp[i - 1] + fabs(h[i] - h[i - 1]),
dp[i - 2] + fabs(h[i] - h[i - 2]));
}
cout << dp[N] << endl;
// cout<<ans<<endl;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
void io() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int maxn = 2 * 1e5 + 10;
const int maxm = 100 + 10;
#define ios \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
int h[maxn];
int fabs(int x) { return x > 0 ? x : -x; }
int dp[maxn];
int main() {
io();
int N;
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N] << endl;
// cout<<ans<<endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,945 | 953,946 | u792288167 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using vb = vector<bool>;
using mll = map<ll, ll>;
using sll = stack<ll>;
#define REP(i, n) for (ll i(0); (i) < (n); (i)++)
#define rep(i, n) for (ll i(0); (i) < (n); (i)++)
#define ALL(a) a.begin(), a.end()
#define enld endl //* missspell check
const ll INF = 1LL << 60;
void chmin(ll &x, ll y) { x = min(x, y); }
void chmax(ll &x, ll y) { x = max(x, y); }
void solve(long long N, std::vector<long long> h) {
vll dp(N, INF);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (ll i = 2; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 1]));
}
cout << dp[N - 1] << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> h(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &h[i]);
}
solve(N, std::move(h));
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll, ll>;
using qll = queue<ll>;
using vb = vector<bool>;
using mll = map<ll, ll>;
using sll = stack<ll>;
#define REP(i, n) for (ll i(0); (i) < (n); (i)++)
#define rep(i, n) for (ll i(0); (i) < (n); (i)++)
#define ALL(a) a.begin(), a.end()
#define enld endl //* missspell check
const ll INF = 1LL << 60;
void chmin(ll &x, ll y) { x = min(x, y); }
void chmax(ll &x, ll y) { x = max(x, y); }
void solve(long long N, std::vector<long long> h) {
vll dp(N, INF);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (ll i = 2; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> h(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &h[i]);
}
solve(N, std::move(h));
return 0;
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,949 | 953,950 | u960267905 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/*おかしい？
void cmin(int x, int y) {
x=min(x, y);
return;
}
*/
int main() {
int N;
int INF = 1000;
cin >> N;
vector<int> h(N);
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
for (int i = 0; i < N; i++) {
d.at(i) = INF;
}
d.at(0) = 0;
for (int i = 1; i < N; i++) {
d.at(i) = min(d.at(i), d.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
if (i > 1) {
d.at(i) = min(d.at(i), d.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
}
cout << d.at(N - 1) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
/*おかしい？
void cmin(int x, int y) {
x=min(x, y);
return;
}
*/
int main() {
int N;
int INF = 1000000000;
cin >> N;
vector<int> h(N);
vector<int> d(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
for (int i = 0; i < N; i++) {
d.at(i) = INF;
}
d.at(0) = 0;
for (int i = 1; i < N; i++) {
d.at(i) = min(d.at(i), d.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
if (i > 1) {
d.at(i) = min(d.at(i), d.at(i - 2) + abs(h.at(i) - h.at(i - 2)));
}
}
cout << d.at(N - 1) << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 953,951 | 953,952 | u875815230 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll 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;
} | [] | 953,961 | 953,962 | u879906354 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define trace(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 fast_io std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
int main() {
int n;
cin >> n;
vi h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n + 7];
mem(dp, 0);
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
// trace(dp[i])
}
cout << dp[n - 1];
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int, int>
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define mem(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define trace(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 fast_io std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
int main() {
int n;
cin >> n;
vi h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n + 7];
mem(dp, 0);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
// trace2(i,dp[i])
}
cout << dp[n - 1];
// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
return 0;
} | [] | 953,971 | 953,972 | u809929160 | cpp |
p03160 | #include <bits/stdc++.h>
// #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], c[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
c[1] = 0;
// c[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
c[i] = c[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
c[i] = min(c[i], c[i - 2] + abs(a[i] - a[i - 2]));
}
cout << c[n] << endl;
return 0;
} | #include <bits/stdc++.h>
// #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1], c[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
c[1] = 0;
// c[2] = abs(a[2] - a[1]);
for (int i = 2; i <= n; i++) {
c[i] = c[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
c[i] = min(c[i], c[i - 2] + abs(a[i] - a[i - 2]));
}
cout << c[n] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,973 | 953,974 | u452576480 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define ll long long int
#define llu unsigned long long int
#define N 100001
using namespace std;
vector<int> dp(N, -1);
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
v[0] = 2 * N;
for (int i = 1; i < n + 1; i++) {
cin >> v[i];
}
dp[0] = N;
dp[1] = 0;
dp[2] = abs(v[1] - v[0]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n];
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#define ll long long int
#define llu unsigned long long int
#define N 100001
using namespace std;
vector<int> dp(N, -1);
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
v[0] = 2 * N;
for (int i = 1; i < n + 1; i++) {
cin >> v[i];
}
dp[0] = N;
dp[1] = 0;
dp[2] = abs(v[1] - v[2]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,975 | 953,976 | u889144837 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
ll int dp[1000005];
ll int N;
vector<ll int> v;
int fun(int i) {
if (i == N - 1)
return 0;
if (i >= N)
return 0;
if (dp[i + 1] == -1)
dp[i + 1] = fun(i + 1);
if (dp[i + 2] == -1)
dp[i + 2] = fun(i + 2);
dp[i] = min((abs(v[i + 1] - v[i]) + dp[i + 1]),
(abs(v[i + 2] - v[i]) + dp[i + 2]));
return dp[i];
}
int main() {
int i, x;
for (i = 0; i < 1000005; i++)
dp[i] = -1;
cin >> N;
for (i = 0; i < N; i++) {
cin >> x;
v.pb(x);
}
dp[0] = fun(0);
cout << dp[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
ll int dp[1000005];
ll int N;
vector<ll int> v;
ll int fun(int i) {
if (i == N - 1)
return 0;
if (i >= N)
return 999999999;
if (dp[i + 1] == -1)
dp[i + 1] = fun(i + 1);
if (dp[i + 2] == -1)
dp[i + 2] = fun(i + 2);
dp[i] = min((abs(v[i + 1] - v[i]) + dp[i + 1]),
(abs(v[i + 2] - v[i]) + dp[i + 2]));
return dp[i];
}
int main() {
int i, x;
for (i = 0; i < 1000005; i++)
dp[i] = -1;
cin >> N;
for (i = 0; i < N; i++) {
cin >> x;
v.pb(x);
}
dp[0] = fun(0);
cout << dp[0] << endl;
return 0;
} | [
"literal.number.change",
"function.return_value.change"
] | 953,977 | 953,978 | u042395367 | cpp |
p03160 | #include <iostream>
using namespace std;
const int INF = 1 << 30;
int N;
int h[100010];
int dp[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[1] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
const int INF = 1 << 30;
int N;
int h[100010];
int dp[100010];
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 953,981 | 953,982 | u047554023 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n, INF);
for (int &x : h)
cin >> x;
dp[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
if (i + 2 < n) {
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
}
/*
for(int i=0;i<n;++i){
cout << dp[i] << " \n"[i==n-1];
}
*/
cout << dp[n - 1] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n, INF);
for (int &x : h)
cin >> x;
dp[0] = 0;
for (int i = 0; i < n; ++i) {
if (i + 1 < n) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
}
if (i + 2 < n) {
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
}
/*
for(int i=0;i<n;++i){
cout << dp[i] << " \n"[i==n-1];
}
*/
cout << dp[n - 1] << '\n';
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,983 | 953,984 | u329213964 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int dp[100005];
int ans(int i) {
if (i >= n)
return 2e9;
if (i == n - 2)
return abs(v[i] - v[n - 1]);
if (i == n - 3)
return abs(v[i] - v[n - 1]);
int &ret = dp[i];
if (ret != 2e9)
return 2e9;
ret = min(ret, ans(i + 1) + abs(v[i] - v[i + 1]));
ret = min(ret, ans(i + 2) + abs(v[i] - v[i + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n + 1);
fill(dp, dp + n + 1, 2e9);
for (auto &t : v)
cin >> t;
cout << ans(0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int dp[100005];
int ans(int i) {
if (i >= n)
return 2e9;
if (i == n - 2)
return abs(v[i] - v[n - 1]);
if (i == n - 3)
return abs(v[i] - v[n - 1]);
int &ret = dp[i];
if (ret != 2e9)
return ret;
ret = min(ret, ans(i + 1) + abs(v[i] - v[i + 1]));
ret = min(ret, ans(i + 2) + abs(v[i] - v[i + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n + 1);
fill(dp, dp + n + 1, 2e9);
for (auto &t : v)
cin >> t;
cout << ans(0) << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 953,985 | 953,986 | u349008117 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<int> v;
int dp[100005];
int solve(int idx) {
if (idx >= n)
return 2e9;
if (idx == n - 2)
return abs(v[idx] - v[n - 1]);
if (idx == n - 3)
return abs(v[idx] - v[n - 1]);
int &ret = dp[idx];
if (ret != 2e9)
return ret;
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 1]));
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n + 1);
fill(dp, dp + n + 1, 2e9);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << solve(0) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<int> v;
int dp[100005];
int solve(int idx) {
if (idx >= n)
return 2e9;
if (idx == n - 2)
return abs(v[idx] - v[n - 1]);
if (idx == n - 3)
return abs(v[idx] - v[n - 1]);
int &ret = dp[idx];
if (ret != 2e9)
return ret;
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 1]));
ret = min(ret, solve(idx + 2) + abs(v[idx] - v[idx + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n + 1);
fill(dp, dp + n + 1, 2e9);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << solve(0) << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,987 | 953,988 | u165709298 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<int> v;
int dp[10005];
int solve(int idx) {
if (idx >= n)
return 2e9;
if (idx == n - 2)
return abs(v[idx] - v[n - 1]);
if (idx == n - 3)
return abs(v[idx] - v[n - 1]);
int &ret = dp[idx];
if (ret != 2e9)
return ret;
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 1]));
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n);
fill(dp, dp + n + 1, 2e9);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << solve(0) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<int> v;
int dp[100005];
int solve(int idx) {
if (idx >= n)
return 2e9;
if (idx == n - 2)
return abs(v[idx] - v[n - 1]);
if (idx == n - 3)
return abs(v[idx] - v[n - 1]);
int &ret = dp[idx];
if (ret != 2e9)
return ret;
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 1]));
ret = min(ret, solve(idx + 2) + abs(v[idx] - v[idx + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n + 1);
fill(dp, dp + n + 1, 2e9);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << solve(0) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,989 | 953,988 | u165709298 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<int> v;
int dp[10005];
int solve(int idx) {
if (idx >= n)
return 2e9;
if (idx == n - 2)
return abs(v[idx] - v[n - 1]);
if (idx == n - 3)
return abs(v[idx] - v[n - 2]);
int &ret = dp[idx];
if (ret != 2e9)
return ret;
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 1]));
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n);
fill(dp, dp + n + 1, 2e9);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << solve(0) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define MAX 1e9
#define MOD 1e9 + 7
using namespace std;
void file() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif !ONLINEJUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int n;
vector<int> v;
int dp[100005];
int solve(int idx) {
if (idx >= n)
return 2e9;
if (idx == n - 2)
return abs(v[idx] - v[n - 1]);
if (idx == n - 3)
return abs(v[idx] - v[n - 1]);
int &ret = dp[idx];
if (ret != 2e9)
return ret;
ret = min(ret, solve(idx + 1) + abs(v[idx] - v[idx + 1]));
ret = min(ret, solve(idx + 2) + abs(v[idx] - v[idx + 2]));
return ret;
}
int main() {
cin >> n;
v.resize(n + 1);
fill(dp, dp + n + 1, 2e9);
for (int i = 0; i < n; ++i)
cin >> v[i];
cout << solve(0) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 953,990 | 953,988 | u165709298 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int n;
vector<int> h(10010);
vector<long long> dp(10010);
cin >> 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; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int n;
vector<int> h(100010);
vector<long long> dp(100010);
cin >> 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; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 954,014 | 954,012 | u154645927 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define all(x) x.begin(), x.end()
typedef std::vector<int> vi;
typedef std::vector<vector<int>> vvi;
typedef std::vector<string> vs;
typedef std::vector<bool> vb;
typedef std::pair<int, int> pii;
typedef long long ll;
const int inf = 1e9;
template <typename T> void print(T v) {
for (auto i = v.begin(); i != v.end(); i++)
cout << setw(2) << *i << " ";
cout << endl;
}
template <typename T> void print_vv(T v, bool same_line = true) {
for (auto i = 0; i < v.size(); i++) {
cout << "{";
for (auto j = 0; j != v[i].size(); j++) {
cout << setw(3) << v[i][j] << ",";
}
cout << "},";
if (same_line)
cout << endl;
}
cout << endl;
}
int main() {
int n;
while (cin >> n) {
vi dp(n + 1);
vi h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++) {
int c1 = i - 1 >= 0 ? dp[i - 1] + abs(h[i] - h[i - 1]) : 0;
int c2 = i - 2 >= 0 ? dp[i - 2] + abs(h[i] - h[i - 2]) : 0;
dp[i] = min(c1, c2);
}
cout << dp[n] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << #x << " " << x << endl;
#define all(x) x.begin(), x.end()
typedef std::vector<int> vi;
typedef std::vector<vector<int>> vvi;
typedef std::vector<string> vs;
typedef std::vector<bool> vb;
typedef std::pair<int, int> pii;
typedef long long ll;
const int inf = 1e9;
template <typename T> void print(T v) {
for (auto i = v.begin(); i != v.end(); i++)
cout << setw(2) << *i << " ";
cout << endl;
}
template <typename T> void print_vv(T v, bool same_line = true) {
for (auto i = 0; i < v.size(); i++) {
cout << "{";
for (auto j = 0; j != v[i].size(); j++) {
cout << setw(3) << v[i][j] << ",";
}
cout << "},";
if (same_line)
cout << endl;
}
cout << endl;
}
int main() {
int n;
while (cin >> n) {
vi dp(n + 1, 1e6);
vi h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++) {
int c1 = i - 1 >= 0 ? dp[i - 1] + abs(h[i] - h[i - 1]) : 0;
int c2 = i - 2 >= 0 ? dp[i - 2] + abs(h[i] - h[i - 2]) : 0;
dp[i] = min(c1, c2);
}
cout << dp[n] << endl;
}
return 0;
} | [
"call.arguments.add"
] | 954,022 | 954,023 | u705892698 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int h[100005];
int memo[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < 100005; i++) {
memo[i] = 100000;
}
memo[1] = 0;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i == n - 1) {
memo[i + 1] = min(memo[i + 1], memo[i] + abs(h[i] - h[i + 1]));
} else {
memo[i + 1] = min(memo[i + 1], memo[i] + abs(h[i] - h[i + 1]));
memo[i + 2] = min(memo[i + 2], memo[i] + abs(h[i] - h[i + 2]));
}
}
cout << memo[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int h[100005];
int memo[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < 100005; i++) {
memo[i] = INT_MAX;
}
memo[1] = 0;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i == n - 1) {
memo[i + 1] = min(memo[i + 1], memo[i] + abs(h[i] - h[i + 1]));
} else {
memo[i + 1] = min(memo[i + 1], memo[i] + abs(h[i] - h[i + 1]));
memo[i + 2] = min(memo[i + 2], memo[i] + abs(h[i] - h[i + 2]));
}
}
cout << memo[n] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,026 | 954,027 | u477832992 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define loop(n) for (ll i = 0; i < n; i++)
#define sort(a) sort(a.begin(), a.end())
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<int> h(n);
loop(n) cin >> h[i];
vector<ll> dp(n, 9999999999);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; i + j < n && j <= 2; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define loop(n) for (ll i = 0; i < n; i++)
#define sort(a) sort(a.begin(), a.end())
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
vector<int> h(n);
loop(n) cin >> h[i];
vector<ll> dp(n, 9999999999);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; i + j < n && j <= 2; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[n - 1] << "\n";
return 0;
} | [] | 954,041 | 954,042 | u771319968 | cpp |
p03160 | /*
@author: Charan Sai
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int long long
#define ppi pair<int, int>
#define endl "\n"
#define nl cout << "\n"
#define deb(x) cout << #x << " " << x << endl;
const int N = 1e5 + 2;
int height[N];
int n;
// 1. Backtrack Solution = 2^N Time
int minCost1(int i) {
// Base Cases
if (i == n)
return 0;
if (i > n)
return INT_MAX;
// Choice
int cost1 = minCost1(i + 1) + abs(height[i + 1] - height[i]);
int cost2 = minCost1(i + 2) + abs(height[i + 2] - height[i]);
return min(cost1, cost2);
}
// 2. Top-Down Solution = Remove read-only arguments and redundant arguments
// and cache the results
// Time = (Range of possible values of the variable arguments) * (Time Compl of
// each function call) O(N) time
int dp[N];
int minCost2(int i) {
// Base Cases
if (i == n)
return 0;
if (i > n)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
// Choice
int cost1 = minCost2(i + 1) + abs(height[i + 1] - height[i]);
int cost2 = minCost2(i + 2) + abs(height[i + 2] - height[i]);
(dp[i] = min(cost1, cost2));
return dp[i];
}
// 3. Bottom-Up Solution
int minCost3() {
dp[n] = 0;
dp[n + 1] = INT_MAX;
for (int i = n - 1; i >= 1; --i) {
int cost1 = dp[i + 1] + abs(height[i + 1] - height[i]);
int cost2 = dp[i + 2] + abs(height[i + 2] - height[i]);
dp[i] = min(cost1, cost2);
}
return dp[1];
}
int32_t main() {
IOS;
int t = 1;
cin >> t;
while (t--) {
memset(dp, -1, sizeof(dp));
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> height[i];
cout << minCost3() << endl;
}
} | /*
@author: Charan Sai
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define int long long
#define ppi pair<int, int>
#define endl "\n"
#define nl cout << "\n"
#define deb(x) cout << #x << " " << x << endl;
const int N = 1e5 + 2;
int height[N];
int n;
// 1. Backtrack Solution = 2^N Time
int minCost1(int i) {
// Base Cases
if (i == n)
return 0;
if (i > n)
return INT_MAX;
// Choice
int cost1 = minCost1(i + 1) + abs(height[i + 1] - height[i]);
int cost2 = minCost1(i + 2) + abs(height[i + 2] - height[i]);
return min(cost1, cost2);
}
// 2. Top-Down Solution = Remove read-only arguments and redundant arguments
// and cache the results
// Time = (Range of possible values of the variable arguments) * (Time Compl of
// each function call) O(N) time
int dp[N];
int minCost2(int i) {
// Base Cases
if (i == n)
return 0;
if (i > n)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
// Choice
int cost1 = minCost2(i + 1) + abs(height[i + 1] - height[i]);
int cost2 = minCost2(i + 2) + abs(height[i + 2] - height[i]);
(dp[i] = min(cost1, cost2));
return dp[i];
}
// 3. Bottom-Up Solution
int minCost3() {
dp[n] = 0;
dp[n + 1] = INT_MAX;
for (int i = n - 1; i >= 1; --i) {
int cost1 = dp[i + 1] + abs(height[i + 1] - height[i]);
int cost2 = dp[i + 2] + abs(height[i + 2] - height[i]);
dp[i] = min(cost1, cost2);
}
return dp[1];
}
int32_t main() {
IOS;
int t = 1;
// cin >> t;
while (t--) {
memset(dp, -1, sizeof(dp));
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> height[i];
cout << minCost3() << endl;
}
} | [] | 954,043 | 954,044 | u895093067 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
#define inf 1000000007
//#define for(i, a, b) for(int i=a; i<b; i++)
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
// for(int i=0;i<n;i++) cout<<dp[i]<<endl;
cout << dp[n - 1];
}
signed main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
#define inf 1000000007
//#define for(i, a, b) for(int i=a; i<b; i++)
void solve() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
// for(int i=0;i<n;i++) cout<<dp[i]<<endl;
cout << dp[n - 1];
}
signed main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 954,045 | 954,046 | u515638999 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
// infinity //様々な流儀
const long long INF = 1LL << 62; // long long 1を62bit左にシフト
// dp table
long long dp[100010]; // 10^5などに合わせて
// initialize
for (int i = 0; i < 100010; i++)
dp[i] = INF;
// initial condition
dp[0] = 0;
int N;
int h[100010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
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;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(void) {
// infinity //様々な流儀
const long long INF = 1LL << 62; // long long 1を62bit左にシフト
// dp table
long long dp[100010]; // 10^5などに合わせて
// initialize
for (int i = 0; i < 100010; i++)
dp[i] = INF;
// initial condition
dp[0] = 0;
int N;
int h[100010];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 1; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 954,047 | 954,048 | u308885164 | cpp |
p03160 | #include <iostream>
using namespace std;
int climb_dp(int *h, int n) {
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] +=
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cout << climb_dp(h, n);
return 0;
} | #include <iostream>
using namespace std;
int climb_dp(int *h, int n) {
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cout << climb_dp(h, n);
return 0;
} | [
"assignment.value.change"
] | 954,066 | 954,067 | u917760390 | cpp |
p03160 | #include <bits/stdc++.h>
#define LL long long int
#define LD long double
#define PI 3.14159265358979323846
#define MOD ((LL)1e9 + 7)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const LL N = 1e5 + 10;
vector<LL> A(N), dp(N), f(N);
LL n;
/*
LL make_dp(LL I)
{
if(f[I])return dp[I];
if(I==1)dp[I]=0;
else if(I==2)dp[I]=abs(A[1]-A[2]);
else
{
dp[I]=min(dp[I-1]+abs(A[I-1]-A[I]),dp[I-2]+abs(A[I]-A[I-2]));
}
f[I]++;
return dp[I];
}*/
int main() {
IOS cin >> n;
for (LL i = 1; i <= n; i++)
cin >> A[i];
dp[1] = 0;
dp[2] = abs(A[1] - A[2]);
for (LL 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>
#define LL long long int
#define LD long double
#define PI 3.14159265358979323846
#define MOD ((LL)1e9 + 7)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
const LL N = 1e5 + 10;
vector<LL> A(N), dp(N), f(N);
LL n;
/*
LL make_dp(LL I)
{
if(f[I])return dp[I];
if(I==1)dp[I]=0;
else if(I==2)dp[I]=abs(A[1]-A[2]);
else
{
dp[I]=min(dp[I-1]+abs(A[I-1]-A[I]),dp[I-2]+abs(A[I]-A[I-2]));
}
f[I]++;
return dp[I];
}*/
int main() {
IOS cin >> n;
for (LL i = 1; i <= n; i++)
cin >> A[i];
dp[1] = 0;
dp[2] = abs(A[1] - A[2]);
for (LL i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]), dp[i - 2] + abs(A[i] - A[i - 2]));
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,068 | 954,069 | u392058778 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define MOD 1000000007
#define ld long double
#define vpll vector<pair<ll, ll>>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pld pair<ll, ld>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define ln cout << "\n";
#define test \
ll T; \
cin >> T; \
while (T--)
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
else if (b == 0)
return a;
else
return gcd(b, a % b);
}
bool isprime(ll n) {
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return 0;
return 1;
}
ll pow(ll b, ll e) {
if (e == 0)
return 1;
else if (e % 2 == 0) {
ll a = pow(b, e / 2);
return a * a;
} else {
ll a = pow(b, e / 2);
return b * a * a;
}
}
ll powm(ll x, ll y, ll m = MOD) {
x = x % m;
ll res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll modInverse(ll a, ll m) { return powm(a, m - 2, m); }
bool issq(ll n) {
ll p = sqrt(n);
return p * p == n;
}
ll MIN(ll a = 2e18, ll b = 2e18, ll c = 2e18, ll d = 2e18, ll e = 2e18) {
return min(a, min(b, min(c, min(d, e))));
}
ll MAX(ll a = -2e18, ll b = -2e18, ll c = -2e18, ll d = -2e18, ll e = -2e18) {
return max(a, max(b, max(c, max(d, e))));
}
vector<int> prime; // if i==prime[i] then prime otherwise smallest prime factor
// of that number
void seive(ll n) {
prime.resize(n + 5, 0);
ll j;
for (ll i = 2; i <= n; i++) {
if (!prime[i]) {
prime[i] = i;
for (j = i * i; j <= n; j += i)
if (!prime[j])
prime[j] = i;
}
}
}
ll extended_GCD(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll gcd = extended_GCD(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return gcd;
}
ll mulInv(ll a, ll mod) {
ll x, y;
extended_GCD(a, mod, x, y);
if (x < 0)
x += mod;
return x;
}
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << "'" << x << "'"; }
void __print(const char *x) { cout << '"' << x << '"'; }
void __print(const string &x) { cout << '"' << x << '"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x)
cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cout << ", ";
_print(v...);
}
int main() {
#ifndef ONLINE_JUDGE
auto start_time = clock();
#define debug(x...) \
cout << "[" << #x << "] = ["; \
_print(x)
freopen("input.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("out.txt", "w", stderr);
#else
#define debug(x...)
fastIO;
#endif
ll n;
cin >> n;
ll a[n + 1] = {};
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {};
dp[2] = abs(a[1] - a[2]);
for (ll i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n];
ln
#ifndef ONLINE_JUDGE
auto end_time = clock();
cout << "Execution time: "
<< (end_time - start_time) * (int)1e3 / CLOCKS_PER_SEC << " ms\n";
#endif
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define MOD 1000000007
#define ld long double
#define vpll vector<pair<ll, ll>>
#define vll vector<ll>
#define pll pair<ll, ll>
#define pld pair<ll, ld>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define ln cout << "\n";
#define test \
ll T; \
cin >> T; \
while (T--)
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
ll gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
else if (b == 0)
return a;
else
return gcd(b, a % b);
}
bool isprime(ll n) {
for (ll i = 2; i * i <= n; i++)
if (n % i == 0)
return 0;
return 1;
}
ll pow(ll b, ll e) {
if (e == 0)
return 1;
else if (e % 2 == 0) {
ll a = pow(b, e / 2);
return a * a;
} else {
ll a = pow(b, e / 2);
return b * a * a;
}
}
ll powm(ll x, ll y, ll m = MOD) {
x = x % m;
ll res = 1;
while (y) {
if (y & 1)
res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll modInverse(ll a, ll m) { return powm(a, m - 2, m); }
bool issq(ll n) {
ll p = sqrt(n);
return p * p == n;
}
ll MIN(ll a = 2e18, ll b = 2e18, ll c = 2e18, ll d = 2e18, ll e = 2e18) {
return min(a, min(b, min(c, min(d, e))));
}
ll MAX(ll a = -2e18, ll b = -2e18, ll c = -2e18, ll d = -2e18, ll e = -2e18) {
return max(a, max(b, max(c, max(d, e))));
}
vector<int> prime; // if i==prime[i] then prime otherwise smallest prime factor
// of that number
void seive(ll n) {
prime.resize(n + 5, 0);
ll j;
for (ll i = 2; i <= n; i++) {
if (!prime[i]) {
prime[i] = i;
for (j = i * i; j <= n; j += i)
if (!prime[j])
prime[j] = i;
}
}
}
ll extended_GCD(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll gcd = extended_GCD(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return gcd;
}
ll mulInv(ll a, ll mod) {
ll x, y;
extended_GCD(a, mod, x, y);
if (x < 0)
x += mod;
return x;
}
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << "'" << x << "'"; }
void __print(const char *x) { cout << '"' << x << '"'; }
void __print(const string &x) { cout << '"' << x << '"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x)
cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cout << ", ";
_print(v...);
}
int main() {
#ifdef ONLINE_JUDGE
auto start_time = clock();
#define debug(x...) \
cout << "[" << #x << "] = ["; \
_print(x)
freopen("input.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("out.txt", "w", stderr);
#else
#define debug(x...)
fastIO;
#endif
ll n;
cin >> n;
ll a[n + 1] = {};
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {};
dp[2] = abs(a[1] - a[2]);
for (ll i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n];
ln
#ifdef ONLINE_JUDGE
auto end_time = clock();
cout << "Execution time: "
<< (end_time - start_time) * (int)1e3 / CLOCKS_PER_SEC << " ms\n";
#endif
return 0;
} | [] | 954,072 | 954,073 | u725001080 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define ll long long
#define ae addEdge
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define sortv sort(v.begin(), v.end())
#define sorta sort(a.begin(), a.end())
#define sortb sort(b.begin(), b.end())
#define sorts sort(s.begin(), s.end())
int main() {
int n;
cin >> n;
vi v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.pb(a);
}
int dp[n];
dp[0] = 0;
dp[1] = 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;
} | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define pb push_back
#define ll long long
#define ae addEdge
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define si set<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define sortv sort(v.begin(), v.end())
#define sorta sort(a.begin(), a.end())
#define sortb sort(b.begin(), b.end())
#define sorts sort(s.begin(), s.end())
int main() {
int n;
cin >> n;
vi v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.pb(a);
}
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;
} | [
"call.add",
"call.arguments.change"
] | 954,074 | 954,075 | u583798468 | cpp |
p03160 | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/* [a,b] */ template <class T> T rnd_IntType(T a, T b) {
return uniform_int_distribution<T>(a, b)(rng);
}
/* [a,b) */ template <class T> T rnd_RealType(T a, T b) {
return uniform_real_distribution<T>(a, b)(rng);
}
// Common Functions
ll fastpow(ll a, ll ex) {
ll res = 1;
while (ex) {
if (ex & 1)
res *= a;
a *= a;
ex >>= 1;
}
return res;
}
ll fastpow(ll a, ll ex, ll m) {
a %= m;
ll res = 1;
while (ex) {
if (ex & 1)
res = (a * res) % m;
a = (a * a) % m;
ex >>= 1;
}
return res;
}
ll modinverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
while (a > 1) {
ll q = a / m;
a %= m;
swap(a, m);
x -= q * y;
swap(x, y);
}
if (x < 0)
x += m0;
return x;
}
// Output, Common Containers
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(" << v.F << "=>" << v.S << ") ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto i : v)
os << i << ' ';
return os;
}
// Debugging
#ifdef LOCAL
#define trace(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
d__f(_it, args); \
}
void d__f(istream_iterator<string> it) {}
template <typename Head, typename... Tail>
void d__f(istream_iterator<string> it, Head H, Tail... T) {
cerr << *it << " <=> [" << H << "]\n";
d__f(++it, T...);
}
#else
#define trace(args...)
#endif
// CODE STARTS HERE
const int mod = 998244353;
ll add(ll a, ll b) { return (a + b) % mod; }
ll sub(ll a, ll b) { return (a - b) % mod; }
ll mul(ll a, ll b) { return (a * b) % mod; }
signed main() {
std::ios::sync_with_stdio(false); // Warning: Do NOT use C I/O now.
std::cin.tie(
nullptr); // Note: Comment out this line for interactive questions.
// std::cout.setf(std::ios::fixed); std::cout.precision(20); //Note: To output
// decimals correctly.
// int t; cin>>t;
// for(int test_no = 1; test_no <= t; ++test_no){}
int n;
cin >> n;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 1; i < n; ++i) {
if (i != n - 1)
dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1]) + dp[i]);
if (i != n - 2)
dp[i + 2] = abs(h[i] - h[i + 2]) + dp[i];
}
cout << dp[n - 1];
} | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/* [a,b] */ template <class T> T rnd_IntType(T a, T b) {
return uniform_int_distribution<T>(a, b)(rng);
}
/* [a,b) */ template <class T> T rnd_RealType(T a, T b) {
return uniform_real_distribution<T>(a, b)(rng);
}
// Common Functions
ll fastpow(ll a, ll ex) {
ll res = 1;
while (ex) {
if (ex & 1)
res *= a;
a *= a;
ex >>= 1;
}
return res;
}
ll fastpow(ll a, ll ex, ll m) {
a %= m;
ll res = 1;
while (ex) {
if (ex & 1)
res = (a * res) % m;
a = (a * a) % m;
ex >>= 1;
}
return res;
}
ll modinverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
while (a > 1) {
ll q = a / m;
a %= m;
swap(a, m);
x -= q * y;
swap(x, y);
}
if (x < 0)
x += m0;
return x;
}
// Output, Common Containers
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(" << v.F << "=>" << v.S << ") ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto i : v)
os << i << ' ';
return os;
}
// Debugging
#ifdef LOCAL
#define trace(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
d__f(_it, args); \
}
void d__f(istream_iterator<string> it) {}
template <typename Head, typename... Tail>
void d__f(istream_iterator<string> it, Head H, Tail... T) {
cerr << *it << " <=> [" << H << "]\n";
d__f(++it, T...);
}
#else
#define trace(args...)
#endif
// CODE STARTS HERE
const int mod = 998244353;
ll add(ll a, ll b) { return (a + b) % mod; }
ll sub(ll a, ll b) { return (a - b) % mod; }
ll mul(ll a, ll b) { return (a * b) % mod; }
signed main() {
std::ios::sync_with_stdio(false); // Warning: Do NOT use C I/O now.
std::cin.tie(
nullptr); // Note: Comment out this line for interactive questions.
// std::cout.setf(std::ios::fixed); std::cout.precision(20); //Note: To output
// decimals correctly.
// int t; cin>>t;
// for(int test_no = 1; test_no <= t; ++test_no){}
int n;
cin >> n;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 0; i < n; ++i) {
if (i != n - 1)
dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1]) + dp[i]);
if (i != n - 2)
dp[i + 2] = abs(h[i] - h[i + 2]) + dp[i];
}
cout << dp[n - 1];
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,076 | 954,077 | u339347910 | cpp |
p03160 | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/* [a,b] */ template <class T> T rnd_IntType(T a, T b) {
return uniform_int_distribution<T>(a, b)(rng);
}
/* [a,b) */ template <class T> T rnd_RealType(T a, T b) {
return uniform_real_distribution<T>(a, b)(rng);
}
// Common Functions
ll fastpow(ll a, ll ex) {
ll res = 1;
while (ex) {
if (ex & 1)
res *= a;
a *= a;
ex >>= 1;
}
return res;
}
ll fastpow(ll a, ll ex, ll m) {
a %= m;
ll res = 1;
while (ex) {
if (ex & 1)
res = (a * res) % m;
a = (a * a) % m;
ex >>= 1;
}
return res;
}
ll modinverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
while (a > 1) {
ll q = a / m;
a %= m;
swap(a, m);
x -= q * y;
swap(x, y);
}
if (x < 0)
x += m0;
return x;
}
// Output, Common Containers
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(" << v.F << "=>" << v.S << ") ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto i : v)
os << i << ' ';
return os;
}
// Debugging
#ifdef LOCAL
#define trace(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
d__f(_it, args); \
}
void d__f(istream_iterator<string> it) {}
template <typename Head, typename... Tail>
void d__f(istream_iterator<string> it, Head H, Tail... T) {
cerr << *it << " <=> [" << H << "]\n";
d__f(++it, T...);
}
#else
#define trace(args...)
#endif
// CODE STARTS HERE
const int mod = 998244353;
ll add(ll a, ll b) { return (a + b) % mod; }
ll sub(ll a, ll b) { return (a - b) % mod; }
ll mul(ll a, ll b) { return (a * b) % mod; }
signed main() {
std::ios::sync_with_stdio(false); // Warning: Do NOT use C I/O now.
std::cin.tie(
nullptr); // Note: Comment out this line for interactive questions.
// std::cout.setf(std::ios::fixed); std::cout.precision(20); //Note: To output
// decimals correctly.
// int t; cin>>t;
// for(int test_no = 1; test_no <= t; ++test_no){}
int n;
cin >> n;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 1; i < n; ++i) {
if (i != n - 1)
dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1] + dp[i]));
if (i != n - 2)
dp[i + 2] = abs(h[i] - h[i + 2]) + dp[i];
}
cout << dp[n - 1];
} | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ALL(c) c.begin(), c.end()
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
// Random
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/* [a,b] */ template <class T> T rnd_IntType(T a, T b) {
return uniform_int_distribution<T>(a, b)(rng);
}
/* [a,b) */ template <class T> T rnd_RealType(T a, T b) {
return uniform_real_distribution<T>(a, b)(rng);
}
// Common Functions
ll fastpow(ll a, ll ex) {
ll res = 1;
while (ex) {
if (ex & 1)
res *= a;
a *= a;
ex >>= 1;
}
return res;
}
ll fastpow(ll a, ll ex, ll m) {
a %= m;
ll res = 1;
while (ex) {
if (ex & 1)
res = (a * res) % m;
a = (a * a) % m;
ex >>= 1;
}
return res;
}
ll modinverse(ll a, ll m) {
ll m0 = m;
ll y = 0, x = 1;
while (a > 1) {
ll q = a / m;
a %= m;
swap(a, m);
x -= q * y;
swap(x, y);
}
if (x < 0)
x += m0;
return x;
}
// Output, Common Containers
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(" << v.F << "=>" << v.S << ") ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto i : v)
os << i << ' ';
return os;
}
// Debugging
#ifdef LOCAL
#define trace(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
d__f(_it, args); \
}
void d__f(istream_iterator<string> it) {}
template <typename Head, typename... Tail>
void d__f(istream_iterator<string> it, Head H, Tail... T) {
cerr << *it << " <=> [" << H << "]\n";
d__f(++it, T...);
}
#else
#define trace(args...)
#endif
// CODE STARTS HERE
const int mod = 998244353;
ll add(ll a, ll b) { return (a + b) % mod; }
ll sub(ll a, ll b) { return (a - b) % mod; }
ll mul(ll a, ll b) { return (a * b) % mod; }
signed main() {
std::ios::sync_with_stdio(false); // Warning: Do NOT use C I/O now.
std::cin.tie(
nullptr); // Note: Comment out this line for interactive questions.
// std::cout.setf(std::ios::fixed); std::cout.precision(20); //Note: To output
// decimals correctly.
// int t; cin>>t;
// for(int test_no = 1; test_no <= t; ++test_no){}
int n;
cin >> n;
ll h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 0; i < n; ++i) {
if (i != n - 1)
dp[i + 1] = min(dp[i + 1], abs(h[i] - h[i + 1]) + dp[i]);
if (i != n - 2)
dp[i + 2] = abs(h[i] - h[i + 2]) + dp[i];
}
cout << dp[n - 1];
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 954,078 | 954,077 | u339347910 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
int dp[100005] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
// cout << i << " " << dp[i] << endl;
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
int dp[100005] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++) {
if (i - j > 0)
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
// cout << i << " " << dp[i] << endl;
}
cout << dp[n];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 954,079 | 954,080 | u883218614 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int *b = new int[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 - 1] + a[i]), b[i - 2] + abs(a[i - 2] - a[i]));
}
cout << b[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int *b = new int[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 - 1] - a[i]), b[i - 2] + abs(a[i - 2] - a[i]));
}
cout << b[n - 1] << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,081 | 954,082 | u883218614 | cpp |
p03160 | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n;
std::cin >> n;
int a[n], dp[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
dp[0] = a[0];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1)
dp[i] = std::min(dp[i], dp[i - 2] + abs(a[i - 2] - a[i]));
}
std::cout << dp[n - 1] << std::endl;
return 0;
} | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n;
std::cin >> n;
int a[n], dp[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1)
dp[i] = std::min(dp[i], dp[i - 2] + abs(a[i - 2] - a[i]));
}
std::cout << dp[n - 1] << std::endl;
return 0;
} | [] | 954,083 | 954,084 | u387880194 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N;
cin >> N;
int h[N] = {};
rep(i, N) cin >> h[i];
int result[N] = {};
repr(i, 1, N) {
if (i == 0)
result[i] = result[i - 1] + abs(h[i] - h[i - 1]);
else
result[i] = min(result[i - 1] + abs(h[i] - h[i - 1]),
result[i - 2] + abs(h[i] - h[i - 2]));
}
cout << result[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int N;
cin >> N;
int h[N] = {};
rep(i, N) cin >> h[i];
int result[N] = {};
repr(i, 1, N) {
if (i == 1)
result[i] = result[i - 1] + abs(h[i] - h[i - 1]);
else
result[i] = min(result[i - 1] + abs(h[i] - h[i - 1]),
result[i - 2] + abs(h[i] - h[i - 2]));
}
cout << result[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 954,085 | 954,086 | u680707192 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807 / 2;
const int MOD = 1000000007;
const int N_MAX = pow(10, 5);
int main() {
int N;
cin >> N;
int h[N];
rep(i, N) cin >> h[i];
int dp[N_MAX] = {};
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[1] = abs(dp[1] - dp[0]);
else
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;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807 / 2;
const int MOD = 1000000007;
const int N_MAX = pow(10, 5);
int main() {
int N;
cin >> N;
int h[N];
rep(i, N) cin >> h[i];
int dp[N_MAX] = {};
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[1] = abs(h[1] - h[0]);
else
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;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,087 | 954,088 | u680707192 | cpp |
p03160 | #include <bits/stdc++.h>
#define crap \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define int ll
using namespace std;
const int N = 1e5 + 5;
int A[N];
int n;
int dp[N];
int solve(int i) {
if (i == n - 1)
return 0;
if (i >= n)
return INT_MAX;
int a = INT_MAX, b = INT_MAX;
if (dp[i] != -1)
return dp[i];
if (i + 1 < n) {
a = min(a, abs(A[i + 2] - A[i]) + solve(i + 2));
}
if (i + 2 < n) {
b = min(b, abs(A[i + 1] - A[i]) + solve(i + 1));
}
return dp[i] = min(a, b);
}
int32_t main() {
crap;
memset(dp, -1, sizeof(dp));
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
int ans = solve(0);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define crap \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define int ll
using namespace std;
const int N = 1e5 + 5;
int A[N];
int n;
int dp[N];
int solve(int i) {
if (i == n - 1)
return 0;
if (i >= n)
return INT_MAX;
int a = INT_MAX, b = INT_MAX;
if (dp[i] != -1)
return dp[i];
if (i + 2 < n) {
a = min(a, abs(A[i + 2] - A[i]) + solve(i + 2));
}
if (i + 1 < n) {
b = min(b, abs(A[i + 1] - A[i]) + solve(i + 1));
}
return dp[i] = min(a, b);
}
int32_t main() {
crap;
memset(dp, -1, sizeof(dp));
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
int ans = solve(0);
cout << ans << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 954,093 | 954,094 | u058484297 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mod 1000000007
#define pi acos(-1.0)
#define eps 1e-9
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fs first
#define sc second
#define pb push_back
#define sp printf(" ")
#define nl '\n'
#define all(a) a.begin(), a.end()
#define itn int
#define set0(a) memset(a, 0, sizeof(a))
#define setneg(a) memset(a, -1, sizeof(a))
#define setinf(a) memset(a, 126, sizeof(a))
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<LL> vll;
typedef vector<double> vd;
void solve() {
int n;
cin >> n;
LL arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
LL dp[n + 1];
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] << nl;
}
int main() { solve(); }
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define mod 1000000007
#define pi acos(-1.0)
#define eps 1e-9
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fs first
#define sc second
#define pb push_back
#define sp printf(" ")
#define nl '\n'
#define all(a) a.begin(), a.end()
#define itn int
#define set0(a) memset(a, 0, sizeof(a))
#define setneg(a) memset(a, -1, sizeof(a))
#define setinf(a) memset(a, 126, sizeof(a))
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<LL> vll;
typedef vector<double> vd;
void solve() {
int n;
cin >> n;
LL arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
LL dp[n + 1];
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] << nl;
}
int main() {
fast;
solve();
}
| [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,095 | 954,096 | u965661170 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
ll solve(vector<int> &height, int n) {
vector<ll> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
cout << solve(height, n);
return 0;
}
| /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
else
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
cout << solve(height, n);
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,110 | 954,111 | u212789054 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
cout << solve(height, n);
return 0;
}
| /*
author: kartik8800
*/
#include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
else
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
cout << solve(height, n);
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,112 | 954,111 | u212789054 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
cout << solve(height, n);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int solve(vector<int> &height, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(height[i] - height[i - 1]) + dp[i - 1];
else
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
cout << solve(height, n);
return 0;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,112 | 954,113 | u212789054 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = INT_MAX;
}
b[0] = 0;
b[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
b[i] =
min(b[i - 1] + abs(b[i] - b[i - 1]), b[i - 2] + abs(b[i - 2] - b[i]));
}
cout << b[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = INT_MAX;
}
b[0] = 0;
b[1] = abs(a[0] - a[1]);
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 - 2] - a[i]));
}
cout << b[n - 1];
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,114 | 954,115 | u072459929 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1], d[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = a[i];
d[0] = 0;
d[1] = 0;
for (j = 2; j <= n; j++) {
d[n] =
min(abs(a[j] - a[j - 1]) + d[j - 1], abs(a[j] - a[j - 2]) + d[j - 2]);
}
cout << d[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
cin >> n;
int a[n + 1], d[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = a[1];
d[0] = 0;
d[1] = 0;
/*for(j=0;j<=n;j++)
{
cout<<a[j]<<" ";
}*/
for (j = 2; j <= n; j++) {
d[j] =
min(abs(a[j] - a[j - 1]) + d[j - 1], abs(a[j] - a[j - 2]) + d[j - 2]);
// cout<<d[j]<<endl;
}
cout << d[n] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"assignment.variable.change",
"identifier.change"
] | 954,116 | 954,117 | u213550434 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = v[1] - v[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 2]) + dp[i - 2], abs(v[i] - v[i - 1]) + dp[i - 1]);
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t;
cin >> n;
vector<int> v(n, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 2]) + dp[i - 2], abs(v[i] - v[i - 1]) + dp[i - 1]);
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 954,127 | 954,128 | u929177784 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int i, j, t, n, m, a, b, c;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i <= n; i++)
dp[i] = min((dp[i - 1] + abs(arr[i] - arr[i - 1])),
(dp[i - 2] + abs(arr[i] - arr[i - 2])));
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int i, j, t, n, m, a, b, c;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = min((dp[i - 1] + abs(arr[i] - arr[i - 1])),
(dp[i - 2] + abs(arr[i] - arr[i - 2])));
cout << dp[n] << endl;
return 0;
} | [
"call.add",
"call.arguments.change"
] | 954,131 | 954,132 | u629410400 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnStage) {
int nStageSiz;
cin >> nStageSiz;
rvnStage.resize(nStageSiz);
for (int &rnStage : rvnStage)
cin >> rnStage;
}
double fnDPCost(const vector<int> &cnrvnStage) {
vector<int> vnDPCost(cnrvnStage.size(), INT_MAX);
vnDPCost[0] = 0;
for (int i = 1; i < cnrvnStage.size(); i++) {
vnDPCost[i] = min(vnDPCost[i],
vnDPCost[i - 1] + abs(cnrvnStage[i] - cnrvnStage[i - 1]));
if (i > 1)
vnDPCost[i] = min(vnDPCost[i], vnDPCost[i - 2] + abs(cnrvnStage[i] -
cnrvnStage[i - 2]));
}
return vnDPCost[cnrvnStage.size() - 1];
}
int main() {
vector<int> vnStage;
fnInput(vnStage);
cout << fnDPCost(vnStage) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void fnInput(vector<int> &rvnStage) {
int nStageSiz;
cin >> nStageSiz;
rvnStage.resize(nStageSiz);
for (int &rnStage : rvnStage)
cin >> rnStage;
}
int fnDPCost(const vector<int> &cnrvnStage) {
vector<int> vnDPCost(cnrvnStage.size(), INT_MAX);
vnDPCost[0] = 0;
for (int i = 1; i < cnrvnStage.size(); i++) {
vnDPCost[i] = min(vnDPCost[i],
vnDPCost[i - 1] + abs(cnrvnStage[i] - cnrvnStage[i - 1]));
if (i > 1)
vnDPCost[i] = min(vnDPCost[i], vnDPCost[i - 2] + abs(cnrvnStage[i] -
cnrvnStage[i - 2]));
}
return vnDPCost[cnrvnStage.size() - 1];
}
int main() {
vector<int> vnStage;
fnInput(vnStage);
cout << fnDPCost(vnStage) << endl;
return 0;
} | [
"function.return_type.change"
] | 954,136 | 954,137 | u439912527 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, y = 1;
// cin>>t;
t = 1;
while (t > 0) {
t--;
ll n, i, j, k, flag = 0;
cin >> n;
ll h[n + 1], a[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
}
a[1] = 0;
a[2] = h[2] - h[1];
for (i = 3; i <= n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
cout << a[n] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, y = 1;
// cin>>t;
t = 1;
while (t > 0) {
t--;
ll n, i, j, k, flag = 0;
cin >> n;
ll h[n + 1], a[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
}
a[1] = 0;
a[2] = abs(h[2] - h[1]);
for (i = 3; i <= n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
cout << a[n] << endl;
}
return 0;
} | [
"call.add",
"call.arguments.change"
] | 954,138 | 954,139 | u689769413 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define to_s to_string
#define sz(v) (int)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define pr(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
#define yes "Yes"
#define no "No"
using namespace std;
using ll = long long;
using Edge = pair<int, long long>;
using Graph = vector<vector<Edge>>;
typedef pair<int, int> P;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
int DP[N + 10];
DP[0] = 0, DP[1] = abs(h[0] - h[1]);
for (int i = 1; i < N; i++)
DP[i + 2] =
min(DP[i] + abs(h[i + 2] - h[i]), DP[i + 1] + abs(h[i + 1] - h[i]));
pr(DP[N - 1]);
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define to_s to_string
#define sz(v) (int)v.size()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define pr(x) cout << (x) << '\n'
#define debug(x) cout << #x << ": " << (x) << '\n'
#define yes "Yes"
#define no "No"
using namespace std;
using ll = long long;
using Edge = pair<int, long long>;
using Graph = vector<vector<Edge>>;
typedef pair<int, int> P;
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
int DP[N + 10];
DP[0] = 0, DP[1] = abs(h[0] - h[1]);
for (int i = 0; i < N - 2; i++)
DP[i + 2] =
min(DP[i] + abs(h[i + 2] - h[i]), DP[i + 1] + abs(h[i + 2] - h[i + 1]));
pr(DP[N - 1]);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.chan... | 954,142 | 954,143 | u281168735 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.