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 <cmath>
#include <iostream>
const int nax = 1e5 + 5;
int arr[nax];
int dp[nax];
int main() {
std::ios_base::sync_with_stdio(false);
int N;
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> arr[i];
}
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i <= N; i++) {
dp[i] = std::min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
}
std::cout << dp[N] << "\n";
return 0;
}
| #include <cmath>
#include <iostream>
const int nax = 1e5 + 5;
int arr[nax];
int dp[nax];
int main() {
std::ios_base::sync_with_stdio(false);
int N;
std::cin >> N;
for (int i = 1; i <= N; i++) {
std::cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= N; i++) {
dp[i] = std::min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
}
std::cout << dp[N] << "\n";
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 952,902 | 952,903 | u958610807 | cpp |
p03160 | #include "bits/stdc++.h"
#define int long long
#define mod 1000000007
#define pf push_forward
#define pb push_back
#define mp make_pair
#define f(i, in, n) for (i = in; i < n; ++i)
#define scant \
int t; \
cin >> t; \
while (t--)
using namespace std;
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);//
//#endif
int n, i;
cin >> n;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] = h[i - 2]));
}
cout << dp[n - 1];
} | #include "bits/stdc++.h"
#define int long long
#define mod 1000000007
#define pf push_forward
#define pb push_back
#define mp make_pair
#define f(i, in, n) for (i = in; i < n; ++i)
#define scant \
int t; \
cin >> t; \
while (t--)
using namespace std;
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#endif
int n, i;
cin >> n;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
} | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,908 | 952,909 | u167428133 | cpp |
p03160 | #include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
int N, a[100005];
int dp[100005];
int function(int init) {
if (init == (N - 1))
return 0;
if (init >= N)
return INT_MAX;
if (dp[init != -1])
return dp[init];
int left = abs(a[init] - a[init + 1]) + function(init + 1);
int right = INT_MAX;
if (init + 2 < N) {
right = abs(a[init] - a[init + 2]) + function(init + 2);
}
return dp[init] = min(left, right);
}
signed main() {
cin >> N;
memset(dp, -1, sizeof dp);
for (int i = 0; i < N; i++)
cin >> a[i];
cout << function(0);
} |
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
int N, a[100005];
int dp[100005];
int function(int init) {
if (init == (N - 1))
return 0;
if (init >= N)
return INT_MAX;
if (dp[init] != -1)
return dp[init];
int left = abs(a[init] - a[init + 1]) + function(init + 1);
int right = INT_MAX;
if (init + 2 < N) {
right = abs(a[init] - a[init + 2]) + function(init + 2);
}
return dp[init] = min(left, right);
}
signed main() {
cin >> N;
memset(dp, -1, sizeof dp);
for (int i = 0; i < N; i++)
cin >> a[i];
cout << function(0);
} | [
"control_flow.branch.if.condition.change"
] | 952,912 | 952,913 | u519284699 | cpp |
p03160 | #include <iostream>
#include <vector>
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr)
using namespace std;
signed main() {
FAST_IO;
int n;
cin >> n;
int jumps[n];
vector<int> dp(n,
0); // dp[i] : Minimum cost for the frog to reach position i.
for (int i = 0; i < n; i++)
cin >> jumps[i];
dp[1] = abs(jumps[1] - jumps[0]); // Base value
for (int i = 2; i < n; i++)
dp[i] = min(abs(jumps[i] - jumps[i - 1]) + dp[i - 1],
abs(jumps[i] - jumps[i - 2]) + dp[i - 2]);
cout << dp[n];
return 0;
} | #include <iostream>
#include <vector>
#define FAST_IO ios_base::sync_with_stdio(false), cin.tie(nullptr)
using namespace std;
signed main() {
FAST_IO;
int n;
cin >> n;
int jumps[n];
vector<int> dp(n,
0); // dp[i] : Minimum cost for the frog to reach position i.
for (int i = 0; i < n; i++)
cin >> jumps[i];
dp[1] = abs(jumps[1] - jumps[0]); // Base value
for (int i = 2; i < n; i++)
dp[i] = min(abs(jumps[i] - jumps[i - 1]) + dp[i - 1],
abs(jumps[i] - jumps[i - 2]) + dp[i - 2]);
cout << dp[n - 1];
return 0;
} | [
"expression.operation.binary.add"
] | 952,916 | 952,917 | u835705414 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long kazu = 0;
cin >> kazu;
vector<long long> h(kazu);
for (long long i = 0; i <= kazu - 1; i++) {
cin >> h[i];
}
vector<long long> dp(kazu);
for (long long i = 0; i <= kazu - 1; i++) {
dp[i] = 1000000;
}
dp[0] = 0;
for (long long i = 1; i <= kazu - 1; 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[kazu - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long kazu = 0;
cin >> kazu;
vector<long long> h(kazu);
for (long long i = 0; i <= kazu - 1; i++) {
cin >> h[i];
}
vector<long long> dp(kazu);
for (long long i = 0; i <= kazu - 1; i++) {
dp[i] = 1000000000000000000;
}
dp[0] = 0;
for (long long i = 1; i <= kazu - 1; 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[kazu - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 952,922 | 952,923 | u567906952 | cpp |
p03160 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int height[n];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
int answer[n];
for (int i = 0; i < n; i++) {
answer[i] = 0;
}
answer[0] = 0;
answer[1] = height[1] - height[0];
for (int i = 2; i < n; i++) {
answer[i] = min(abs(height[i] - height[i - 1]) + answer[i - 1],
abs(height[i] - height[i - 2]) + answer[i - 1]);
}
cout << answer[n - 1];
}
| /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int height[n];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
int answer[n];
for (int i = 0; i < n; i++) {
answer[i] = 0;
}
answer[0] = 0;
answer[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
answer[i] = min(abs(height[i] - height[i - 1]) + answer[i - 1],
abs(height[i] - height[i - 2]) + answer[i - 2]);
}
cout << answer[n - 1];
}
| [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 952,927 | 952,928 | u984864378 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
bool cmp(pair<int, string> a, pair<int, string> b) {
if (a.first < b.first)
return true;
else
return false;
}
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int32_t main() {
fast;
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, 0);
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] + h[i]));
}
cout << dp[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
bool cmp(pair<int, string> a, pair<int, string> b) {
if (a.first < b.first)
return true;
else
return false;
}
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int32_t main() {
fast;
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, 0);
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
// for(int i = 0 ; i < n ; i++) cout << dp[i] << "**\n";
cout << dp[n - 1] << "\n";
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,936 | 952,937 | u216545111 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
int arr[n + 1];
int dp[n + 1];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n + 1; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int b = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
cout << dp[n] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
int arr[n + 1];
int dp[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n + 1; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int b = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
cout << dp[n] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 952,816 | 952,817 | u219630513 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int recur(int *arr, int n, int *dp) {
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 2; i <= n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(a, b);
}
return dp[n];
}
int main() {
int n;
cin >> n;
int arr[100005];
arr[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int dp[100004] = {0};
cout << recur(arr, n, dp) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int recur(int *arr, int n, int *dp) {
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(a, b);
}
return dp[n];
}
int main() {
int n;
cin >> n;
int arr[100005];
arr[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
int dp[100004] = {0};
cout << recur(arr, n, dp) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,820 | 952,821 | u345177558 | cpp |
p03160 | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 10010001010;
const int inf = 1000034000;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
vector<int> H(N);
int ans = 0;
int dp[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
dp[i] = inf;
}
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
for (int i = 0; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(H[i - 1] - H[i]));
chmin(dp[i], dp[i - 2] + abs(H[i] - H[i - 2]));
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 10010001010;
const int inf = 1000034000;
typedef tuple<string, int, int> TUP;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int N;
cin >> N;
vector<int> H(N);
int ans = 0;
int dp[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
dp[i] = inf;
}
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
for (int i = 2; i < N; i++) {
chmin(dp[i], dp[i - 1] + abs(H[i - 1] - H[i]));
chmin(dp[i], 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"
] | 952,827 | 952,828 | u935370883 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define pb push_back
#define mp make_pair
int main() {
ll n;
fastio;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n] = {0};
for (ll i = n - 2; i >= 0; i--) {
ll f = 0, s = 0;
f = abs(a[i + 1] - a[i]) + dp[i + 1];
if (i + 2 < n)
s = abs(a[i + 2] - a[i]) + dp[i + 2];
dp[i] = min(s, f);
}
cout << dp[0];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define pb push_back
#define mp make_pair
int main() {
ll n;
fastio;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n] = {0};
for (ll i = n - 2; i >= 0; i--) {
ll f = 0, s = LONG_LONG_MAX;
f = abs(a[i + 1] - a[i]) + dp[i + 1];
if (i + 2 < n)
s = abs(a[i + 2] - a[i]) + dp[i + 2];
dp[i] = min(s, f);
}
cout << dp[0];
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,944 | 952,945 | u253606204 | cpp |
p03160 | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> stones(n, 0);
vector<int> dp; // = new int[n];
int tmp = 0;
for (auto i : stones) {
cin >> i;
} // stones.push_back(tmp);}
dp.push_back(0);
dp.push_back(abs(stones[1] - stones[0]));
for (int i = 2; i < n; i++) {
dp.push_back(min(dp[i - 1] + abs(stones[i] - stones[i - 1]),
dp[i - 2] + abs(stones[i - 2] - stones[i])));
}
if (n >= 1)
cout << dp[n - 1] << endl;
else
cout << 0 << endl;
return 0;
}
| #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> stones(n, 0);
vector<int> dp; // = new int[n];
int tmp = 0;
for (int &i : stones) {
cin >> i;
} // stones.push_back(tmp);}
dp.push_back(0);
dp.push_back(abs(stones[1] - stones[0]));
for (int i = 2; i < n; i++) {
dp.push_back(min(dp[i - 1] + abs(stones[i] - stones[i - 1]),
dp[i - 2] + abs(stones[i - 2] - stones[i])));
}
if (n >= 1)
cout << dp[n - 1] << endl;
else
cout << 0 << endl;
return 0;
}
| [] | 952,946 | 952,947 | u309984532 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int *stones = new int[n];
int *dp = new int[n];
if (n >= 1)
cin >> stones[0];
if (n >= 2)
cin >> stones[1];
dp[0] = 0;
dp[1] = abs(stones[1] - stones[2]);
for (int i = 2; i < n; i++) {
cin >> stones[i];
dp[i] = min(dp[i - 1] + abs(stones[i] - stones[i - 1]),
dp[i - 2] + abs(stones[i - 2] - stones[i]));
}
if (n >= 1)
cout << dp[n - 1] << endl;
else
cout << 0 << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int *stones = new int[n];
int *dp = new int[n];
if (n >= 1)
cin >> stones[0];
if (n >= 2)
cin >> stones[1];
dp[0] = 0;
dp[1] = abs(stones[1] - stones[0]);
for (int i = 2; i < n; i++) {
cin >> stones[i];
dp[i] = min(dp[i - 1] + abs(stones[i] - stones[i - 1]),
dp[i - 2] + abs(stones[i - 2] - stones[i]));
}
if (n >= 1)
cout << dp[n - 1] << endl;
else
cout << 0 << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,948 | 952,949 | u309984532 | cpp |
p03160 | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
ll dp[100];
ll arr[100] = {0};
int n = 0;
ll solve(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll op1, op2;
op1 = abs(arr[i] - arr[i + 1]) + solve(i + 1);
op2 = INT_MAX;
if (i + 2 < n)
op2 = abs(arr[i] - arr[i + 2]) + solve(i + 2);
return dp[i] = min(op1, op2);
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
memset(dp, -1, sizeof(dp));
cout << "\n" << solve(0);
return 0;
}
| #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iostream>
using namespace std;
#define ll long long
ll dp[100009];
ll arr[100009] = {0};
int n = 0;
ll solve(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll op1, op2;
op1 = abs(arr[i] - arr[i + 1]) + solve(i + 1);
op2 = INT_MAX;
if (i + 2 < n)
op2 = abs(arr[i] - arr[i + 2]) + solve(i + 2);
return dp[i] = min(op1, op2);
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
memset(dp, -1, sizeof(dp));
cout << "\n" << solve(0);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,950 | 952,951 | u252634084 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 55;
int x[MAX];
int dp[100000 + 55];
int n;
int cho1 = 0;
int cho2 = 0;
int solve(int i) {
// cout<<'1'<<" "<<cho1<<" "<<x[i]<<" "<<i<<" "<<last<<endl;
if (i == n) {
return 0;
}
if (i == n - 1)
return abs(x[i] - x[i + 1]);
int &ret = dp[i];
if (ret != -1)
return ret;
cho1 += (abs(x[i] - x[i + 1]) + solve(i + 1));
cho2 += abs(x[i] - x[i + 2]) + solve(i + 2);
ret = min(cho1, cho2);
return ret;
}
int main() {
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++)
cin >> x[i];
cout << solve(1);
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 55;
int x[MAX];
int dp[100000 + 55];
int n;
int cho1 = 0;
int cho2 = 0;
int solve(int i) {
// cout<<'1'<<" "<<cho1<<" "<<x[i]<<" "<<i<<" "<<last<<endl;
if (i == n) {
return 0;
}
if (i == n - 1)
return abs(x[i] - x[i + 1]);
int &ret = dp[i];
if (ret != -1)
return ret;
cho1 = (abs(x[i] - x[i + 1]) + solve(i + 1));
cho2 = abs(x[i] - x[i + 2]) + solve(i + 2);
ret = min(cho1, cho2);
return ret;
}
int main() {
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++)
cin >> x[i];
cout << solve(1);
return 0;
}
| [
"assignment.value.change"
] | 952,952 | 952,953 | u886159995 | cpp |
p03160 | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod (ll)1e18
#define pb push_back
#define N 100000 + 5
#define N 100000 + 5
#define deb(x) cout << #x << " " << x << endl;
// cout << fixed << setprecision(12);
#define forab(i, a, b, c) for (ll(i) = a; (i) <= (b); (i) += (c))
#define forabr(i, a, b, c) for (ll(i) = a; (i) >= (b); (i) -= (c))
void arrinitialize(ll n, ll a[], ll x) {
forab(i, 0, n - 1, 1) { a[i] = x; }
}
void start() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio;
start();
ll n;
cin >> n;
ll a[n];
forab(i, 0, n - 1, 1) cin >> a[i];
ll b[n] = {0};
arrinitialize(n, b, 1000000000000000000);
ll s = 0;
b[0] = 0;
forab(i, 1, n - 1, 1) {
b[i] = min(b[i], abs(a[i] - a[i - 1]) + b[i - 1]);
if (i >= 2)
b[i] = min(b[i], abs(a[i] - a[i - 2]) + b[i - 2]);
}
cout << b[n - 1];
} | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod (ll)1e18
#define pb push_back
#define N 100000 + 5
#define N 100000 + 5
#define deb(x) cout << #x << " " << x << endl;
// cout << fixed << setprecision(12);
#define forab(i, a, b, c) for (ll(i) = a; (i) <= (b); (i) += (c))
#define forabr(i, a, b, c) for (ll(i) = a; (i) >= (b); (i) -= (c))
void arrinitialize(ll n, ll a[], ll x) {
forab(i, 0, n - 1, 1) { a[i] = x; }
}
void start() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio;
// start();
ll n;
cin >> n;
ll a[n];
forab(i, 0, n - 1, 1) cin >> a[i];
ll b[n] = {0};
arrinitialize(n, b, 1000000000000000000);
ll s = 0;
b[0] = 0;
forab(i, 1, n - 1, 1) {
b[i] = min(b[i], abs(a[i] - a[i - 1]) + b[i - 1]);
if (i >= 2)
b[i] = min(b[i], abs(a[i] - a[i - 2]) + b[i - 2]);
}
cout << b[n - 1];
} | [
"call.remove"
] | 952,956 | 952,957 | u953269735 | cpp |
p03160 | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod (ll)1e18
#define pb push_back
#define N 100000 + 5
#define N 100000 + 5
#define deb(x) cout << #x << " " << x << endl;
#define forab(i, a, b, c) for (ll(i) = a; (i) <= (b); (i) += (c))
#define forabr(i, a, b, c) for (ll(i) = a; (i) >= (b); (i) -= (c))
void arrinitialize(ll n, ll a[], ll x) {
forab(i, 0, n - 1, 1) { a[i] = x; }
}
void start() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio;
start();
ll n;
cin >> n;
ll a[n];
forab(i, 0, n - 1, 1) cin >> a[i];
ll b[n] = {0};
arrinitialize(n, b, 100000000);
ll s = 0;
b[0] = 0;
forab(i, 1, n - 1, 1) {
b[i] = min(b[i], abs(a[i] - a[i - 1]) + b[i - 1]);
if (i >= 2)
b[i] = min(b[i], abs(a[i] - a[i - 2]) + b[i - 2]);
}
cout << b[n - 1];
} | /*#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll int64_t
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod (ll)1e18
#define pb push_back
#define N 100000 + 5
#define N 100000 + 5
#define deb(x) cout << #x << " " << x << endl;
// cout << fixed << setprecision(12);
#define forab(i, a, b, c) for (ll(i) = a; (i) <= (b); (i) += (c))
#define forabr(i, a, b, c) for (ll(i) = a; (i) >= (b); (i) -= (c))
void arrinitialize(ll n, ll a[], ll x) {
forab(i, 0, n - 1, 1) { a[i] = x; }
}
void start() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio;
// start();
ll n;
cin >> n;
ll a[n];
forab(i, 0, n - 1, 1) cin >> a[i];
ll b[n] = {0};
arrinitialize(n, b, 1000000000000000000);
ll s = 0;
b[0] = 0;
forab(i, 1, n - 1, 1) {
b[i] = min(b[i], abs(a[i] - a[i - 1]) + b[i - 1]);
if (i >= 2)
b[i] = min(b[i], abs(a[i] - a[i - 2]) + b[i - 2]);
}
cout << b[n - 1];
} | [
"call.remove",
"literal.number.change",
"call.arguments.change"
] | 952,959 | 952,957 | u953269735 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
int h[n + 1];
h[0] = 1000000000;
rep(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[2] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
ll h[n + 1];
h[0] = 1000000000;
rep(i, 1, n + 1) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 952,975 | 952,976 | u340424586 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
int h[n + 1];
h[0] = 0;
rep(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[2] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
ll h[n + 1];
h[0] = 1000000000;
rep(i, 1, n + 1) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 952,977 | 952,976 | u340424586 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
int h[n + 1];
h[0] = 1000000000;
rep(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[2] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
ll h[n + 1];
h[0] = 1000000000;
rep(i, 1, n + 1) cin >> h[i];
ll dp[n + 1];
dp[2] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 952,975 | 952,978 | u340424586 | cpp |
p03160 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
int h[n + 1];
h[0] = 0;
rep(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[2] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (__typeof(b) i = a; i < b; i++)
#define Rep(i, a, b) for (__typeof(a) i = a; i > b; i--)
using namespace std;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<pll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<ll> vl;
///======code start here======///
signed main() {
fastio;
int n;
cin >> n;
ll h[n + 1];
h[0] = 1000000000;
rep(i, 1, n + 1) cin >> h[i];
ll dp[n + 1];
dp[2] = 0;
dp[1] = 0;
rep(i, 2, n + 1) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 952,977 | 952,978 | u340424586 | cpp |
p03160 |
#include <bits/stdc++.h>
using namespace std;
long long m = 1000000007;
#define boost \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define pb push_back
#define p2 second
#define p1 first
typedef long long ll;
typedef long double ld;
long long M = 1e9 + 7;
#define deb_(x) cerr << #x << " : " << x << endl;
#define deb(A, N) \
cerr << " :["; \
for (int i = 0; i < N; i++) \
cerr << A[i] << " "; \
cerr << "]\n";
#define deb2(A, N, M) \
cerr << #A << " : \n"; \
for (int i = 0; i < N; i++) { \
cerr << "["; \
for (int j = 0; j < M; ++j) \
cerr << A[i][j] << " "; \
cerr << "]\n"; \
}
#define rep(n) for (int i = 0; i < n; i++)
#define range(a, b) for (int i = a; i <= b; i++)
#define loop(i, n) for (int i = 0; i < n; i++)
void code();
int main() {
boost;
ll t = 1;
// cin>>t;
while (t--) {
code();
}
return 0;
}
void code() {
ll n;
cin >> n;
ll A[n];
rep(n) cin >> A[i];
ll dp[n];
dp[0] = A[0];
dp[1] = abs(A[1] - A[0]);
range(2, n - 1) {
dp[i] =
MIN(dp[i - 1] + abs(A[i - 1] - A[i]), dp[i - 2] + abs(A[i - 2] - A[i]));
}
// deb(dp,n);
cout << dp[n - 1] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
long long m = 1000000007;
#define boost \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define pb push_back
#define p2 second
#define p1 first
typedef long long ll;
typedef long double ld;
long long M = 1e9 + 7;
#define deb_(x) cerr << #x << " : " << x << endl;
#define deb(A, N) \
cerr << " :["; \
for (int i = 0; i < N; i++) \
cerr << A[i] << " "; \
cerr << "]\n";
#define deb2(A, N, M) \
cerr << #A << " : \n"; \
for (int i = 0; i < N; i++) { \
cerr << "["; \
for (int j = 0; j < M; ++j) \
cerr << A[i][j] << " "; \
cerr << "]\n"; \
}
#define rep(n) for (int i = 0; i < n; i++)
#define range(a, b) for (int i = a; i <= b; i++)
#define loop(i, n) for (int i = 0; i < n; i++)
void code();
int main() {
boost;
ll t = 1;
// cin>>t;
while (t--) {
code();
}
return 0;
}
void code() {
ll n;
cin >> n;
ll A[n];
rep(n) cin >> A[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(A[1] - A[0]);
range(2, n - 1) {
dp[i] =
MIN(dp[i - 1] + abs(A[i - 1] - A[i]), dp[i - 2] + abs(A[i - 2] - A[i]));
}
// deb(dp,n);
cout << dp[n - 1] << endl;
} | [] | 952,988 | 952,989 | u000032488 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define forf(i, a, b, c) for (int i = a; i < b; i = i + c)
#define forb(i, a, b, c) for (int i = a; i >= b; i = i - c)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
forf(i, 0, n, 1) { cin >> h[i]; }
vector<int> dp(n);
dp[0] = 0;
forf(i, 1, n, 1) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i >= 2) {
dp[i] = min(dp[i], dp[i - 2]) + abs(h[i] - h[i - 2]);
}
}
cout << dp.back() << "\n";
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define forf(i, a, b, c) for (int i = a; i < b; i = i + c)
#define forb(i, a, b, c) for (int i = a; i >= b; i = i - c)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
forf(i, 0, n, 1) { cin >> h[i]; }
vector<int> dp(n);
dp[0] = 0;
forf(i, 1, n, 1) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i >= 2) {
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp.back() << "\n";
return 0;
} | [
"call.arguments.change"
] | 952,993 | 952,994 | u874100196 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl "\n"
#define mod 1000000007
#define INF 1e18
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define w(x) \
int x; \
cin >> x; \
while (x--)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void rwf() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int xpowery(int x, int y) {
int ans = 1;
while (y) {
if (y & 1)
ans = (ans * x) % mod;
x = (x * x) % mod;
y = y / 2;
}
return ans;
}
const int N = 1e5 + 5;
int h[N], n;
int cache[N];
int solve(int m) {
if (m > n)
return cache[m] = 1e9;
if (m == n)
return cache[m] = 0;
if (cache[m] != -1)
return cache[m];
return cache[m] = min(abs(h[m] - h[m + 1]) + solve(m + 1),
abs(h[m] - h[m + 2]) + solve(m + 2));
}
int32_t main() {
IOS;
rwf();
cin >> n;
memset(cache, -1, sizeof(cache));
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int ans = solve(1);
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl "\n"
#define mod 1000000007
#define INF 1e18
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define w(x) \
int x; \
cin >> x; \
while (x--)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
void rwf() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int xpowery(int x, int y) {
int ans = 1;
while (y) {
if (y & 1)
ans = (ans * x) % mod;
x = (x * x) % mod;
y = y / 2;
}
return ans;
}
const int N = 1e5 + 5;
int h[N], n;
int cache[N];
int solve(int m) {
if (m > n)
return cache[m] = 1e9;
if (m == n)
return cache[m] = 0;
if (cache[m] != -1)
return cache[m];
return cache[m] = min(abs(h[m] - h[m + 1]) + solve(m + 1),
abs(h[m] - h[m + 2]) + solve(m + 2));
}
int32_t main() {
IOS;
// rwf();
cin >> n;
memset(cache, -1, sizeof(cache));
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int ans = solve(1);
cout << ans;
return 0;
} | [
"call.remove"
] | 952,995 | 952,996 | u870088166 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define rrep(i, a, b) for (ll i = a - 1; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define popcount __builtin_popcount
#define LIST(a) memset(a, 0, sizeof(a))
int main(void) {
vector<int> memo;
vector<int> h;
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
h = vector<int>(n);
memo = vector<int>(n, -1);
rep(i, 0, n) { cin >> h[i]; }
memo[0] = 0;
memo[1] = h[1] - h[0];
rep(i, 2, n) {
memo[i] = min(memo[i - 1] + abs(h[i] - h[i - 1]),
memo[i - 2] + abs(h[i] - h[i - 2]));
}
cout << memo[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define rrep(i, a, b) for (ll i = a - 1; i >= (ll)(b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define popcount __builtin_popcount
#define LIST(a) memset(a, 0, sizeof(a))
int main(void) {
vector<int> memo;
vector<int> h;
ll n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
h = vector<int>(n);
memo = vector<int>(n, -1);
rep(i, 0, n) { cin >> h[i]; }
memo[0] = 0;
memo[1] = abs(h[1] - h[0]);
rep(i, 2, n) {
memo[i] = min(memo[i - 1] + abs(h[i] - h[i - 1]),
memo[i - 2] + abs(h[i] - h[i - 2]));
}
cout << memo[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 952,997 | 952,998 | u330169562 | cpp |
p03160 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
std::cout << __LINE__ << "> " << #var << ": "; \
view(var); \
} while (0)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
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;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
void Main() {
int N;
cin >> N;
vi H(N);
REP(i, N) cin >> H[i];
vl dp(N + 1, numeric_limits<ll>::max());
dp[0] = 0;
FOR(i, 1, N + 1) {
dp[i] = min(dp[i - 1] + abs(H[i] - H[i - 1]), dp[i]);
if (i > 1) {
dp[i] = min(dp[i - 2] + abs(H[i] - H[i - 2]), dp[i]);
}
}
cout << dp[N] << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(var) \
do { \
std::cout << __LINE__ << "> " << #var << ": "; \
view(var); \
} while (0)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
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;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
void Main() {
int N;
cin >> N;
vi H(N);
REP(i, N) cin >> H[i];
vl dp(N, numeric_limits<ll>::max());
dp[0] = 0;
FOR(i, 1, N) {
dp[i] = min(dp[i - 1] + abs(H[i] - H[i - 1]), dp[i]);
if (i > 1) {
dp[i] = min(dp[i - 2] + abs(H[i] - H[i - 2]), dp[i]);
}
}
cout << dp[N - 1] << endl;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
| [
"expression.operation.binary.remove"
] | 953,003 | 953,004 | u215692812 | cpp |
p03160 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
const int INT_LARGE = 1.0e+9 + 7;
template <class T> inline bool chmin(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
int main() {
// Input
int numArray;
std::cin >> numArray;
assert(2 <= numArray and numArray <= 1.0e+5);
std::vector<int> height(1 + numArray + 2);
for (int i = 1; i <= numArray; ++i) {
std::cin >> height[i];
assert(height[i] <= 1.0e+4);
}
// Init
std::vector<int> dp(1 + numArray + 2);
for (int i = 1; i <= numArray + 2; ++i)
dp[i] = INT_LARGE;
dp[1] = 0;
// DP main
for (int i = 1; i <= numArray; ++i) {
chmin<int>(dp[i + 1], dp[i] + abs(height[i + 1] - height[i]));
chmin<int>(dp[i + 2], dp[i] + abs(height[i + 2] - height[i]));
}
// Output
std::cout << dp[numArray] << std::endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
const int INT_LARGE = 1.0e+9 + 7;
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
int main() {
// Input
int numArray;
std::cin >> numArray;
assert(2 <= numArray and numArray <= 1.0e+5);
std::vector<int> height(1 + numArray + 2);
for (int i = 1; i <= numArray; ++i) {
std::cin >> height[i];
assert(height[i] <= 1.0e+4);
}
// Init
std::vector<int> dp(1 + numArray + 2);
for (int i = 1; i <= numArray + 2; ++i)
dp[i] = INT_LARGE;
dp[1] = 0;
// DP main
for (int i = 1; i <= numArray; ++i) {
chmin<int>(dp[i + 1], dp[i] + abs(height[i + 1] - height[i]));
chmin<int>(dp[i + 2], dp[i] + abs(height[i + 2] - height[i]));
}
// Output
std::cout << dp[numArray] << std::endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 953,005 | 953,006 | u875972329 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<ll> dp(n + 1);
dp[0] = 0x3f3f3f3f;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> height[i];
}
vector<ll> dp(n);
dp[0] = 0x3f3f3f3f;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(height[i] - height[i - 1]) + dp[i - 1],
abs(height[i] - height[i - 2]) + dp[i - 2]);
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,007 | 953,008 | u239240712 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, i;
cin >> n;
long A[n + 1];
A[0] = 0;
for (i = 1; i <= n; i++)
cin >> A[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(A[1] - A[0]);
for (i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]), dp[i - 2] + abs(A[i] - A[i - 2]));
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, i;
cin >> n;
long A[n + 1];
A[0] = 0;
for (i = 1; i <= n; i++)
cin >> A[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(A[2] - A[1]);
for (i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(A[i] - A[i - 1]), dp[i - 2] + abs(A[i] - A[i - 2]));
cout << dp[n] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,009 | 953,010 | u467785978 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int INF = 1e9 + 5;
int main() {
int N;
scanf("%d%d", &N);
vector<int> h(N);
for (int &x : h)
scanf("%d", &x);
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j : {i + 1, i + 2}) {
if (j < N) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d", dp[N - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const int INF = 1e9 + 5;
int main() {
int N;
scanf("%d", &N);
vector<int> h(N);
for (int &x : h)
scanf("%d", &x);
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j : {i + 1, i + 2}) {
if (j < N) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d", dp[N - 1]);
return 0;
} | [
"literal.string.change",
"call.arguments.change"
] | 953,013 | 953,014 | u804919951 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s[i - 1]) + dp[i - 1];
int y = abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(dp[i], min(x, y));
}
return dp[n];
}
int32_t main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
cout << solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 4; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s[i - 1]) + dp[i - 1];
int y = abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(dp[i], min(x, y));
}
return dp[n];
}
int32_t main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
cout << solve();
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 953,023 | 953,024 | u093748998 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s[i - 1]) + dp[i - 1];
int y = abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(dp[i], min(x, y));
}
return dp[n];
}
int32_t main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
cout << solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define nn 100005
int n;
int s[nn];
int solve() {
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(s[2] - s[1]);
dp[3] = min(abs(s[3] - s[1]), abs(s[2] - s[3]) + dp[2]);
for (int i = 4; i <= n; i++) {
dp[i] = INT_MAX;
int x = abs(s[i] - s[i - 1]) + dp[i - 1];
int y = abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(dp[i], min(x, y));
}
return dp[n];
}
int32_t main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
cout << solve();
}
| [
"variable_declaration.value.change",
"literal.number.change",
"control_flow.loop.for.initializer.change"
] | 953,025 | 953,024 | u093748998 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n), best(n);
for (i = 0; i < n; ++i)
cin >> h[i];
best[0] = 0;
best[1] = abs(h[i] - h[i - 1]);
for (i = 2; i < n; ++i)
best[i] = min(best[i - 1] + abs(h[i] - h[i - 1]),
best[i - 2] + abs(h[i] - h[i - 2]));
cout << best[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h(n), best(n);
for (i = 0; i < n; ++i)
cin >> h[i];
best[0] = 0;
best[1] = abs(h[1] - h[0]);
for (i = 2; i < n; ++i)
best[i] = min(best[i - 1] + abs(h[i] - h[i - 1]),
best[i - 2] + abs(h[i] - h[i - 2]));
cout << best[n - 1] << "\n";
return 0;
} | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 953,032 | 953,033 | u625237702 | cpp |
p03160 | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end()
#define pb push_back
#define pii pair<int, int>
#define vpii vector<pii>
#define f first
#define db double
#define s second
#define ll long long
#define ull unsigned long long
#define E '\n'
#define lmax 9223372036854775807;
#define MOD 1000000007
using namespace std;
vi v;
vvi ed;
void dfs(int i) {
v[i] = 1;
aut(j, ed[i]) if (!v[j]) dfs(j);
}
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("code.in", "r", stdin);
freopen("code.out", "w", stdout);
#endif
}
int main() {
Fast_IO();
int t;
// cin>>t;
t = 1;
while (t--) {
int n;
cin >> n;
vi arr(n);
vi dp(n, 0);
rep(i, n) cin >> arr[i];
dp[1] = abs(arr[1] - arr[0]);
forr(i, 2, n) dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
cout << dp[n - 1];
cout << E;
}
return 0;
} | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end()
#define pb push_back
#define pii pair<int, int>
#define vpii vector<pii>
#define f first
#define db double
#define s second
#define ll long long
#define ull unsigned long long
#define E '\n'
#define lmax 9223372036854775807;
#define MOD 1000000007
using namespace std;
vi v;
vvi ed;
void dfs(int i) {
v[i] = 1;
aut(j, ed[i]) if (!v[j]) dfs(j);
}
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("code.in", "r", stdin);
freopen("code.out", "w", stdout);
#endif
}
int main() {
// Fast_IO();
int t;
// cin>>t;
t = 1;
while (t--) {
int n;
cin >> n;
vi arr(n);
vi dp(n, 0);
rep(i, n) cin >> arr[i];
dp[1] = abs(arr[1] - arr[0]);
forr(i, 2, n) dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
cout << dp[n - 1];
cout << E;
}
return 0;
} | [
"call.remove"
] | 953,036 | 953,037 | u491084584 | cpp |
p03160 | #include <bits/stdc++.h>
int res[100001];
using namespace std;
int fun1(int val[], int n) {
if (n <= 1)
return 0;
if (res[n] != -1)
return res[n];
return res[n] = min(abs(val[n] - val[n - 1]) + fun1(val, n - 1),
abs(val[n] - val[n - 2]) + fun1(val, n - 2));
}
int fun2(int val[], int n, int ind, int dp[]) {
if (ind >= n)
return INT_MAX;
if (ind == n - 1)
return 0;
if (dp[ind] != -1)
return dp[ind];
int l, r;
if (ind + 1 < n)
l = abs(val[ind] - val[ind + 1]) + fun2(val, n, ind + 1, dp);
if (ind + 2 < n)
r = abs(val[ind] - val[ind + 2]) + fun2(val, n, ind + 2, dp);
return dp[ind] = min(l, r);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = -1;
cout << fun2(arr, n, 0, dp);
return 0;
}
| #include <bits/stdc++.h>
int res[100001];
using namespace std;
int fun1(int val[], int n) {
if (n <= 1)
return 0;
if (res[n] != -1)
return res[n];
return res[n] = min(abs(val[n] - val[n - 1]) + fun1(val, n - 1),
abs(val[n] - val[n - 2]) + fun1(val, n - 2));
}
int fun2(int val[], int n, int ind, int dp[]) {
if (ind >= n)
return INT_MAX;
if (ind == n - 1)
return 0;
if (dp[ind] != -1)
return dp[ind];
int l, r = INT_MAX;
if (ind + 1 < n)
l = abs(val[ind] - val[ind + 1]) + fun2(val, n, ind + 1, dp);
if (ind + 2 < n)
r = abs(val[ind] - val[ind + 2]) + fun2(val, n, ind + 2, dp);
return dp[ind] = min(l, r);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = -1;
cout << fun2(arr, n, 0, dp);
return 0;
}
| [
"variable_declaration.value.change"
] | 953,038 | 953,039 | u253385799 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define cases \
int t; \
cin >> t; \
while (t--)
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define scan(n) scanf("%d", &n)
#define PI 3.1415926535897932384626433832795
#define int ll
#define loop0 for (int i = 0; i < n; i++)
#define loop1 for (int i = 1; i <= n; i++)
#define inpar0(ar) \
for (int i = 0; i < n; i++) \
cin >> ar[i];
#define inpar1(ar) \
for (int i = 1; i <= n; i++) \
cin >> ar[i];
#define showar0(ar) \
for (int i = 0; i < n; i++) \
cout << ar[i] << " ";
#define showar1(ar) \
for (int i = 1; i <= n; i++) \
cout << ar[i] << " ";
#define manu cout << (checkerCounter++) << endl;
int checkerCounter = 1;
int mod = 1000000007;
int maxn = 200001;
int binpow(int a, int b, int mod) {
int res = 1;
while (b > 0) {
if (b % 2) {
res = (res * a) % mod;
b--;
}
a = (a * a) % mod;
b /= 2;
}
return res % mod;
}
bool isPrime(int n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
signed main() {
int n;
cin >> n;
int h[n];
inpar0(h);
int dp[n];
for (int i = 1; i < n; i++) {
dp[i] = maxn;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
if (i < n - 2) {
dp[i + 2] = min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 2]);
}
dp[i + 1] = min(dp[i] + abs(h[i + 1] - h[i]), dp[i + 1]);
}
// showar0(dp)cout<<endl;
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define cases \
int t; \
cin >> t; \
while (t--)
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define scan(n) scanf("%d", &n)
#define PI 3.1415926535897932384626433832795
#define int ll
#define loop0 for (int i = 0; i < n; i++)
#define loop1 for (int i = 1; i <= n; i++)
#define inpar0(ar) \
for (int i = 0; i < n; i++) \
cin >> ar[i];
#define inpar1(ar) \
for (int i = 1; i <= n; i++) \
cin >> ar[i];
#define showar0(ar) \
for (int i = 0; i < n; i++) \
cout << ar[i] << " ";
#define showar1(ar) \
for (int i = 1; i <= n; i++) \
cout << ar[i] << " ";
#define manu cout << (checkerCounter++) << endl;
int checkerCounter = 1;
int mod = 1000000007;
int maxn = 200001;
int binpow(int a, int b, int mod) {
int res = 1;
while (b > 0) {
if (b % 2) {
res = (res * a) % mod;
b--;
}
a = (a * a) % mod;
b /= 2;
}
return res % mod;
}
bool isPrime(int n) {
if (n == 1)
return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
signed main() {
int n;
cin >> n;
int h[n];
inpar0(h);
int dp[n];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
if (i < n - 2) {
dp[i + 2] = min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 2]);
}
dp[i + 1] = min(dp[i] + abs(h[i + 1] - h[i]), dp[i + 1]);
}
// showar0(dp)cout<<endl;
cout << dp[n - 1];
}
| [
"assignment.value.change",
"identifier.change"
] | 953,051 | 953,052 | u919641591 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n), dp(n, INT_MAX);
int i = 0;
for (; i < n; i++)
cin >> x[i];
dp[0] = x[0];
for (i = 0; i <= n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(x[i] - x[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(x[i] - x[i + 2]));
}
cout << dp[n - 1] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> x(n), dp(n, INT_MAX);
int i = 0;
for (; i < n; i++)
cin >> x[i];
dp[0] = 0;
for (i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(x[i] - x[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(x[i] - x[i + 2]));
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,055 | 953,056 | u259468819 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int i, a, b;
int dp[n];
for (i = 0; i < n; i += 2) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++)
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
cout << dp[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int i, a, b;
int dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++)
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
cout << dp[n - 1] << "\n";
return 0;
} | [] | 953,057 | 953,058 | u259468819 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define VI vector<ll>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
const ll mod = 1e9 + 7;
double pi = 2 * acos(0.0);
#define FASTIO \
ios_base::sync_with_stdio(false); \
cout.tie(NULL); \
cout.tie(NULL);
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
bool cmp(pair<ll, ll> a, pair<ll, ll> b) { return (a.first) < (b.first); }
ll power(ll a, ll b) {
ll p = 1;
for (ll i = 1; i <= b; i++)
p *= a;
return p;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
void bfs(map<ll, vector<ll>> &g, ll src, vector<ll> &c) {
queue<ll> q;
map<ll, ll> p;
q.push(src);
p[src] = src;
c[src] = 1;
while (!q.empty()) {
ll u = q.front();
q.pop();
ll i = 1;
for (auto v : g[u]) {
if (c[v] == -1) {
q.push(v);
p[v] = u;
if (i == c[u] || i == c[p[u]])
i++;
if (i == c[u] || i == c[p[u]])
i++;
c[v] = i;
i++;
}
}
}
}
int main() {
FASTIO;
ll n, i;
cin >> n;
ll a[n], dp[n];
for (i = 0; i < n; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define VI vector<ll>
#define lf(i, a, b) for (ll i = a; i <= b; i++)
const ll mod = 1e9 + 7;
double pi = 2 * acos(0.0);
#define FASTIO \
ios_base::sync_with_stdio(false); \
cout.tie(NULL); \
cout.tie(NULL);
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
bool cmp(pair<ll, ll> a, pair<ll, ll> b) { return (a.first) < (b.first); }
ll power(ll a, ll b) {
ll p = 1;
for (ll i = 1; i <= b; i++)
p *= a;
return p;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
void bfs(map<ll, vector<ll>> &g, ll src, vector<ll> &c) {
queue<ll> q;
map<ll, ll> p;
q.push(src);
p[src] = src;
c[src] = 1;
while (!q.empty()) {
ll u = q.front();
q.pop();
ll i = 1;
for (auto v : g[u]) {
if (c[v] == -1) {
q.push(v);
p[v] = u;
if (i == c[u] || i == c[p[u]])
i++;
if (i == c[u] || i == c[p[u]])
i++;
c[v] = i;
i++;
}
}
}
}
int main() {
FASTIO;
ll n, i;
cin >> n;
ll a[n], dp[n];
for (i = 0; i < n; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [] | 953,061 | 953,062 | u953086535 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 100100;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n) {
srep(j, 1, 3) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 1001001001;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n) {
srep(j, 1, 3) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 953,063 | 953,064 | u814715203 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const int inf = 100100;
vector<int> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n) {
srep(j, 1, 3) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 1001001001;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n) {
srep(j, 1, 3) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 953,065 | 953,064 | u814715203 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const int inf = 100100;
vector<int> dp(10001, inf);
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n) {
srep(j, 1, 3) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, j, n) for (int i = j; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll inf = 1001001001;
vector<ll> dp(100001, inf);
int main() {
int n;
cin >> n;
vector<ll> h(n);
rep(i, n) cin >> h[i];
dp[0] = 0;
rep(i, n) {
srep(j, 1, 3) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 953,066 | 953,064 | u814715203 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define F first
#define S second
#define vi vector<int>
#define pi pair<int, int>
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define er(n) cout << "error " << n << endl;
#define pbds \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define mod 1000000007
void Abhay() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
Abhay();
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0, dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
dp[i] = min(dp[i], abs(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define F first
#define S second
#define vi vector<int>
#define pi pair<int, int>
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define er(n) cout << "error " << n << endl;
#define pbds \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define mod 1000000007
void Abhay() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int32_t main() {
// Abhay();
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0, dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
dp[i] = min(dp[i], abs(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"call.remove"
] | 953,069 | 953,070 | u420799504 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define cir(I, B, A) for (ll I = (A); I >= (B); I--)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define SORT(c) (sort(c.begin(), c.end()))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASES \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define FAST() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// vector<ll>a,b,c;
map<ll, ll> m1, m2, m3;
ll DP[100005];
/************************************************/
void Execute() {
ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m;
std::cin >> n;
ll ar[n];
FOR(i, 0, n - 1) cin >> ar[i];
DP[0] = 0;
DP[1] = ar[1] - ar[0];
FOR(i, 2, n - 1) {
a = abs(ar[i] - ar[i - 1]) + DP[i - 1];
b = abs(ar[i] - ar[i - 2]) + DP[i - 2];
DP[i] = min(a, b);
}
std::cout << DP[n - 1] << '\n';
}
int32_t main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
//#endif
FAST();
// CASES
Execute();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define cir(I, B, A) for (ll I = (A); I >= (B); I--)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define SORT(c) (sort(c.begin(), c.end()))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASES \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define FAST() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// vector<ll>a,b,c;
map<ll, ll> m1, m2, m3;
ll DP[100005];
/************************************************/
void Execute() {
ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m;
std::cin >> n;
ll ar[n];
FOR(i, 0, n - 1) cin >> ar[i];
DP[0] = 0;
DP[1] = abs(ar[1] - ar[0]);
FOR(i, 2, n - 1) {
a = abs(ar[i] - ar[i - 1]) + DP[i - 1];
b = abs(ar[i] - ar[i - 2]) + DP[i - 2];
DP[i] = min(a, b);
}
std::cout << DP[n - 1] << '\n';
}
int32_t main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
//#endif
FAST();
// CASES
Execute();
}
| [
"call.add",
"call.arguments.change"
] | 953,075 | 953,076 | u877043923 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define cir(I, B, A) for (ll I = (A); I >= (B); I--)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define SORT(c) (sort(c.begin(), c.end()))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASES \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define FAST() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// vector<ll>a,b,c;
map<ll, ll> m1, m2, m3;
ll DP[200000];
/************************************************/
void Execute() {
ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m;
std::cin >> n;
ll ar[n];
FOR(i, 0, n - 1) cin >> ar[i];
DP[0] = 0;
DP[1] = ar[1] - ar[0];
FOR(i, 2, n - 1) {
a = abs(ar[i] - ar[i - 1]) + DP[i - 1];
b = abs(ar[i] - ar[i - 2]) + DP[i - 2];
DP[i] = min(a, b);
}
std::cout << DP[n - 1] << '\n';
}
int32_t main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
//#endif
FAST();
// CASES
Execute();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define rad(X) cout << (X) << endl
#define ASH(X) cout << (X) << " "
#define debug(x) cout << #x << " " << x << endl;
#define debug2(x, y) cout << #x << " " << x << " " << #y << " " << y << endl;
#define FOR(I, A, B) for (ll I = (A); I <= (B); I++)
#define cir(I, B, A) for (ll I = (A); I >= (B); I--)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define SORT(c) (sort(c.begin(), c.end()))
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define CASES \
int ___T; \
cin >> ___T; \
for (int cs = 1; cs <= ___T; cs++)
#define FAST() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
template <typename T> T gcd(T x, T y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll fx[] = {1, 1, 0, -1, -1, -1, 0, 1};
ll fy[] = {0, 1, 1, 1, 0, -1, -1, -1};
// vector<ll>a,b,c;
map<ll, ll> m1, m2, m3;
ll DP[100005];
/************************************************/
void Execute() {
ll n, nb, k, q, a, b, c, l, r, d, x, y, p, m;
std::cin >> n;
ll ar[n];
FOR(i, 0, n - 1) cin >> ar[i];
DP[0] = 0;
DP[1] = abs(ar[1] - ar[0]);
FOR(i, 2, n - 1) {
a = abs(ar[i] - ar[i - 1]) + DP[i - 1];
b = abs(ar[i] - ar[i - 2]) + DP[i - 2];
DP[i] = min(a, b);
}
std::cout << DP[n - 1] << '\n';
}
int32_t main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
//#endif
FAST();
// CASES
Execute();
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.change"
] | 953,077 | 953,076 | u877043923 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 998244353
#define endL << '\n'
#define ii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define endL << '\n'
#define vii vector<ii>
#define pb push_back
/*
ll powmod(ll x, ll y, ll mod){
ll res = 1;
while (y > 0){
if (y%2) res = (res*x) % mod;
x = (x*x) % mod;
y /= 2;
}
return res;
}
*/
/*const int N = 1000000;
int lp[N+1];
vector<ll> pr;
void sieve(){
for (int i=2; i<=N; ++i) {
if (lp[i] == 0) {
lp[i] = i;
pr.push_back (i);
}
for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
lp[i * pr[j]] = pr[j];
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1; // cin >> t;
while (t--) {
int n;
cin >> n;
vll h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vll dp(n, -1);
dp[0] = h[0];
for (int i = 1; i < n; i++) {
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];
}
} | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define MOD 998244353
#define endL << '\n'
#define ii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define endL << '\n'
#define vii vector<ii>
#define pb push_back
/*
ll powmod(ll x, ll y, ll mod){
ll res = 1;
while (y > 0){
if (y%2) res = (res*x) % mod;
x = (x*x) % mod;
y /= 2;
}
return res;
}
*/
/*const int N = 1000000;
int lp[N+1];
vector<ll> pr;
void sieve(){
for (int i=2; i<=N; ++i) {
if (lp[i] == 0) {
lp[i] = i;
pr.push_back (i);
}
for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
lp[i * pr[j]] = pr[j];
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1; // cin >> t;
while (t--) {
int n;
cin >> n;
vll h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vll dp(n, -1);
dp[0] = 0;
for (int i = 1; i < n; i++) {
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];
}
} | [] | 953,078 | 953,079 | u511624091 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int INF = 1e9;
#define ll long long
#define int ll
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define testcase \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define endl "\n"
#define deb1(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define deb4(x, y, z, w) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << " | " << #w << ": " << w << endl
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(a) int((a).size())
#define pii pair<int, int>
#define fi first
#define se second
#define ld long double
#define vii vector<int>
#define all(v) v.begin(), v.end()
#define prec(n) fixed << setprecision(n)
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const ll LINF = (ll)1e18;
const ld PI = acos((ld)-1);
const ld EPS = 1e-12;
inline ll gcd(ll a, ll b) {
ll r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll fpow(ll n, ll k, int p = MOD) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % p;
n = n * n % p;
}
return r;
}
template <class T> inline int chkmin(T &a, const T &val) {
return val < a ? a = val, 1 : 0;
}
template <class T> inline int chkmax(T &a, const T &val) {
return a < val ? a = val, 1 : 0;
}
inline void addmod(int &a, int val, int p = MOD) {
if ((a = (a + val)) >= p)
a -= p;
}
inline void submod(int &a, int val, int p = MOD) {
if ((a = (a - val)) < 0)
a += p;
}
inline int mult(int a, int b, int p = MOD) { return (ll)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline void get_arr(int arr[], int n) {
for (int i = 0; i < n; i++)
cin >> arr[i];
}
inline void print_arr(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}
int32_t main() {
int n;
cin >> n;
int arr[n];
get_arr(arr, n);
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - dp[0]);
int a, b;
for (int i = 2; i < n; i++) {
a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
b = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
cout << dp[n - 1] << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
const int INF = 1e9;
#define ll long long
#define int ll
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define testcase \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define endl "\n"
#define deb1(x) cout << #x << ": " << x << endl
#define deb2(x, y) cout << #x << ": " << x << " | " << #y << ": " << y << endl
#define deb3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define deb4(x, y, z, w) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << " | " << #w << ": " << w << endl
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(a) int((a).size())
#define pii pair<int, int>
#define fi first
#define se second
#define ld long double
#define vii vector<int>
#define all(v) v.begin(), v.end()
#define prec(n) fixed << setprecision(n)
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const ll LINF = (ll)1e18;
const ld PI = acos((ld)-1);
const ld EPS = 1e-12;
inline ll gcd(ll a, ll b) {
ll r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll fpow(ll n, ll k, int p = MOD) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % p;
n = n * n % p;
}
return r;
}
template <class T> inline int chkmin(T &a, const T &val) {
return val < a ? a = val, 1 : 0;
}
template <class T> inline int chkmax(T &a, const T &val) {
return a < val ? a = val, 1 : 0;
}
inline void addmod(int &a, int val, int p = MOD) {
if ((a = (a + val)) >= p)
a -= p;
}
inline void submod(int &a, int val, int p = MOD) {
if ((a = (a - val)) < 0)
a += p;
}
inline int mult(int a, int b, int p = MOD) { return (ll)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline void get_arr(int arr[], int n) {
for (int i = 0; i < n; i++)
cin >> arr[i];
}
inline void print_arr(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}
int32_t main() {
int n;
cin >> n;
int arr[n];
get_arr(arr, n);
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
int a, b;
for (int i = 2; i < n; i++) {
a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
b = abs(arr[i] - arr[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
// print_arr(dp,n);
cout << dp[n - 1] << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,080 | 953,081 | u556783345 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]) + f(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2])) + f(i + 2, n);
}
return d[i] = cost;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(d, -1, sizeof(d));
cout << f(1, n);
}
| #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]) + f(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + f(i + 2, n));
}
return d[i] = cost;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(d, -1, sizeof(d));
cout << f(1, n);
}
| [
"call.arguments.change"
] | 953,097 | 953,098 | u045623470 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[100000], d[100000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]) + f(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2])) + f(i + 2, n);
}
return d[i] = cost;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(d, -1, sizeof(d));
cout << f(1, n);
}
| #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]) + f(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + f(i + 2, n));
}
return d[i] = cost;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(d, -1, sizeof(d));
cout << f(1, n);
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 953,099 | 953,098 | u045623470 | cpp |
p03160 | #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[mx], d[mx + 1];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]) + f(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2])) + f(i + 2, n);
}
return d[i] = cost;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(d, -1, sizeof(d));
cout << f(1, n);
}
| #include <bits/stdc++.h>
#include <stack>
#define MAX (ll)(8e3)
#define INF (ll)(1e18)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
const int mx = 8e3;
int n, a[1000000], d[1000000];
int f(int i, int n) {
if (i == n)
return 0;
if (d[i] != -1)
return d[i];
int cost = abs(a[i] - a[i + 1]) + f(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + f(i + 2, n));
}
return d[i] = cost;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(d, -1, sizeof(d));
cout << f(1, n);
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"call.arguments.change"
] | 953,100 | 953,098 | u045623470 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
input_from_file;
// int t; cin>>t;
// while(t--){
ll n;
cin >> n;
vector<ll> vec(n, 0), dp(n, 0);
for (int i = 0; i < n; i++)
cin >> vec[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(vec[0] - vec[1]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(vec[i - 1] - vec[i]),
dp[i - 2] + abs(vec[i - 2] - vec[i]));
cout << dp[n - 1];
// }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define mp make_pair
#define S second
#define F first
ll mod = 1e9 + 7;
#define input_from_file freopen("input.txt", "r", stdin);
int main() {
// input_from_file;
// int t; cin>>t;
// while(t--){
ll n;
cin >> n;
vector<ll> vec(n, 0), dp(n, 0);
for (int i = 0; i < n; i++)
cin >> vec[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(vec[0] - vec[1]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(vec[i - 1] - vec[i]),
dp[i - 2] + abs(vec[i - 2] - vec[i]));
cout << dp[n - 1];
// }
return 0;
} | [] | 953,104 | 953,105 | u066630187 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);
dp[1] = 0;
dp[2] = a[2] - a[1];
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
} | [
"call.add",
"call.arguments.change"
] | 953,108 | 953,109 | u071917297 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);
dp[1] = 0;
dp[2] = a[2] - a[1];
for (i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n + 1];
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0);
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n] << endl;
} | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,111 | 953,109 | u071917297 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007 // 10^9+7
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int INF = numeric_limits<int>::max();
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
// greatest common divisor
long long gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
// least common multiple
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[2]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007 // 10^9+7
using namespace std;
using ll = long long;
using PII = pair<int, int>;
const int INF = numeric_limits<int>::max();
// 負の数にも対応した % 演算
long long mod(long long val, long long m) {
long long res = val % m;
if (res < 0)
res += m;
return res;
}
// greatest common divisor
long long gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
// least common multiple
long long lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,117 | 953,118 | u366581326 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i = 1; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(v[i] - v[i - 2]), dp[i - 1] + abs(v[i] - v[i - 1]));
}
cout << dp[i];
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i = 1; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(v[i] - v[i - 2]), dp[i - 1] + abs(v[i] - v[i - 1]));
}
cout << dp[n - 1];
}
| [
"variable_access.subscript.index.change",
"io.output.change"
] | 953,124 | 953,125 | u990210936 | cpp |
p03160 | #define ll long long int
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<ll> dp(n);
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1];
} | #define ll long long int
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<ll> 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 - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1];
} | [] | 953,126 | 953,127 | u243508227 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const int MSIZE = 1e2 + 5;
const int MOD = 1e9 + 7;
int arr[MSIZE];
int dp[MSIZE];
int main() {
FIO int n;
cin >> n;
f(i, 0, n - 1) cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
f(i, 2, n - 1) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const int MSIZE = 2e5 + 5;
const int MOD = 1e9 + 7;
int arr[MSIZE];
int dp[MSIZE];
int main() {
FIO int n;
cin >> n;
f(i, 0, n - 1) cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
f(i, 2, n - 1) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 953,134 | 953,135 | u850655153 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
lli n, i;
lli dp[10001];
dp[0] = 0;
dp[1] = 0;
cin >> n;
lli a[n + 1];
for (i = 1; i < +n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) + dp[i - 2], dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
int main() {
lli n, i;
lli dp[100001];
dp[0] = 0;
dp[1] = 0;
cin >> n;
lli a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(a[i] - a[i - 2]) + dp[i - 2], dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n] << "\n";
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.unary.arithmetic.remove"
] | 953,138 | 953,137 | u696946433 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(), (a).end()
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;
const int MOD = 1000000007;
const double PI = acos(-1); // 3.14~
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll dp[5];
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
rep(i, 5) dp[i] = INF;
dp[0] = 0;
rep(i, 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]));
// if (i == 2)
// {
// COUT(dp[i + 1]);
// COUT(h[i]);
// COUT(h[i + 1]);
// COUT(dp[i + 2]);
// COUT(h[i + 2]);
// }
// if (i == 3)
// {
// COUT(dp[i + 1]);
// COUT(h[i]);
// COUT(h[i + 1]);
// COUT(dp[i + 2]);
// COUT(h[i + 2]);
// }
}
// for (auto it : dp) COUT(it);
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define ALL(a) (a).begin(), (a).end()
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;
const int MOD = 1000000007;
const double PI = acos(-1); // 3.14~
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll dp[100010];
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
rep(i, 100010) dp[i] = INF;
dp[0] = 0;
rep(i, 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]));
// if (i == 2)
// {
// COUT(dp[i + 1]);
// COUT(h[i]);
// COUT(h[i + 1]);
// COUT(dp[i + 2]);
// COUT(h[i + 2]);
// }
// if (i == 3)
// {
// COUT(dp[i + 1]);
// COUT(h[i]);
// COUT(h[i + 1]);
// COUT(dp[i + 2]);
// COUT(h[i + 2]);
// }
}
// for (auto it : dp) COUT(it);
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 953,139 | 953,140 | u011716617 | cpp |
p03160 | #include <bits/stdc++.h>
#include <unistd.h>
#define pb push_back
#define ll long long
#define inf 1e9
using namespace std;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
long long dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[n] = 0;
dp[n - 1] = abs(a[n] - a[n - 1]);
for (int i = n - 2; i >= 1; i--) {
dp[i] =
min(abs(a[i + 1] - a[1]) + dp[i + 1], abs(a[i + 2] - a[i]) + dp[i + 2]);
}
printf("%lld\n", dp[1]);
}
| #include <bits/stdc++.h>
#include <unistd.h>
#define pb push_back
#define ll long long
#define inf 1e9
using namespace std;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
long long dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[n] = 0;
dp[n - 1] = abs(a[n] - a[n - 1]);
for (int i = n - 2; i >= 1; i--) {
dp[i] =
min(abs(a[i + 1] - a[i]) + dp[i + 1], abs(a[i + 2] - a[i]) + dp[i + 2]);
}
printf("%lld\n", dp[1]);
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,141 | 953,142 | u213252033 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5;
int main() {
int n;
cin >> n;
vector<int> dp(n, INF), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
// Errichto's code
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
int n;
cin >> n;
vector<int> dp(n, INF), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
// Errichto's code
| [
"literal.number.change",
"variable_declaration.value.change"
] | 953,143 | 953,144 | u897669423 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[100009], n;
ll dp[100009][3];
ll f(int from, int to) {
if (to > n)
return 0;
if (from >= n)
return 0;
if (from == n - 1) {
dp[from][2] = 0;
return dp[from][to] = abs(arr[n] - arr[n - 1]);
}
if (dp[from][to] != -1)
return dp[from][to];
if (to == 1) {
return dp[from][to] = abs(arr[from + 1] - arr[from]) +
min(f(from + 1, 1), f(from + 1, 2));
} else if (to == 2)
return dp[from][to] = abs(arr[from + 2] - arr[from]) +
min(f(from + 2, 2), f(from + 1, 1));
return 0;
// return dp[pos] =
// min(abs(arr[pos+1]-arr[pos])+f(pos+1),abs(arr[pos+2]-arr[pos])+f(pos+2));
}
int main() {
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
memset(dp, -1, sizeof dp);
printf("%lld\n", min(f(1, 1), f(1, 2)));
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[100009], n;
ll dp[100009][3];
ll f(int from, int to) {
if (to > n)
return 0;
if (from >= n)
return 0;
if (from == n - 1) {
dp[from][2] = 0;
return dp[from][to] = abs(arr[n] - arr[n - 1]);
}
if (dp[from][to] != -1)
return dp[from][to];
if (to == 1) {
return dp[from][to] = abs(arr[from + 1] - arr[from]) +
min(f(from + 1, 1), f(from + 1, 2));
} else if (to == 2)
return dp[from][to] = abs(arr[from + 2] - arr[from]) +
min(f(from + 2, 2), f(from + 2, 1));
return 0;
// return dp[pos] =
// min(abs(arr[pos+1]-arr[pos])+f(pos+1),abs(arr[pos+2]-arr[pos])+f(pos+2));
}
int main() {
int i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
memset(dp, -1, sizeof dp);
printf("%lld\n", min(f(1, 1), f(1, 2)));
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 953,150 | 953,151 | u123067340 | cpp |
p03160 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
fast_io;
ll n;
cin >> n;
vector<ll> h(n + 1);
for (ll i = 0; i < n; i++)
cin >> h[i];
vector<ll> dp(n + 1);
// base case
dp[0] = 0;
dp[1] = h[1] - h[0];
// BU
for (ll i = 2; i < n; i++) {
ll op1 = dp[i - 1] + abs(h[i] - h[i - 1]);
ll op2 = dp[i - 2] + abs(h[i] - h[i - 2]);
dp[i] = min(op1, op2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int main() {
fast_io;
ll n;
cin >> n;
vector<ll> h(n + 1);
for (ll i = 0; i < n; i++)
cin >> h[i];
vector<ll> dp(n + 1);
// base case
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
// BU
for (ll i = 2; i < n; i++) {
ll op1 = dp[i - 1] + abs(h[i] - h[i - 1]);
ll op2 = dp[i - 2] + abs(h[i] - h[i - 2]);
dp[i] = min(op1, op2);
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 953,152 | 953,153 | u441400811 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
int dp[n + 2];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + abs(a[i - 1] - a[i]));
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int ans = 0;
int dp[n + 2];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + abs(a[i - 1] - a[i]));
}
cout << dp[n - 1];
} | [] | 953,157 | 953,158 | u125284404 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, a, b) for (int i = a; i <= b; i++)
#define looprev(i, a, b) for (int i = a; i >= b; i--)
#define rloop(it, c) for (auto &it : c)
#define sz(a) a.size()
#define all(c) c.begin(), c.end()
#define tr(c, i) for (auto i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
#define spresent(s, x) \
(s.find(x) != s.npos) // use 'x' while passing to parameters || we can also
// use cpresent(c,x)
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define SETINT(a, x) memset(a, x, sizeof(a))
#define SETCHAR(str, x) memset(str, x, sizeof(str) //use 'x' while passing to parameters
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define w(x) \
int x; \
cin >> x; \
while (x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int raise(int a, int n, int m = mod) {
if (n == 0)
return 1;
if (n == 1)
return a;
int x = 1;
x *= raise(a, n / 2, m);
x %= m;
x *= x;
x %= m;
if (n % 2)
x *= a;
x %= m;
return x;
}
int floor1(int n, int k) {
if (n % k == 0 || n >= 0)
return n / k;
return (n / k) - 1;
}
int ceil1(int n, int k) { return floor1(n + k - 1, k); }
void Gur27() {
ios::sync_with_stdio(0);
cin.tie(0);
}
int dp[100005];
int frog1rec(int h[], int N, int n) {
if (N == 2)
return abs(h[1] - h[0]);
if (dp[N] != -1)
return dp[N];
else
return dp[N] = min(abs(h[n - 1] - h[n - 2]) + frog1rec(h, N - 1, n - 1),
abs(h[n - 1] - h[n - 3]) + frog1rec(h, N - 2, n - 2));
}
int frog1tpdn(int *h, int N, int n) {
LOOP(i, 3, N) {
dp[i] = min(abs(h[i - 1] - h[i - 2]) + dp[i - 1],
abs(h[i - 1] - h[i - 3]) + dp[i - 2]);
}
return dp[N];
}
int32_t main() {
Gur27();
int n;
cin >> n;
int a[n];
SETINT(dp, -1);
dp[0] = 0;
dp[1] = 0;
loop(i, 0, n) cin >> a[i];
dp[2] = a[1] - a[0];
cout << frog1tpdn(a, n, n);
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, a, b) for (int i = a; i <= b; i++)
#define looprev(i, a, b) for (int i = a; i >= b; i--)
#define rloop(it, c) for (auto &it : c)
#define sz(a) a.size()
#define all(c) c.begin(), c.end()
#define tr(c, i) for (auto i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
#define spresent(s, x) \
(s.find(x) != s.npos) // use 'x' while passing to parameters || we can also
// use cpresent(c,x)
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define SETINT(a, x) memset(a, x, sizeof(a))
#define SETCHAR(str, x) memset(str, x, sizeof(str) //use 'x' while passing to parameters
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define w(x) \
int x; \
cin >> x; \
while (x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int raise(int a, int n, int m = mod) {
if (n == 0)
return 1;
if (n == 1)
return a;
int x = 1;
x *= raise(a, n / 2, m);
x %= m;
x *= x;
x %= m;
if (n % 2)
x *= a;
x %= m;
return x;
}
int floor1(int n, int k) {
if (n % k == 0 || n >= 0)
return n / k;
return (n / k) - 1;
}
int ceil1(int n, int k) { return floor1(n + k - 1, k); }
void Gur27() {
ios::sync_with_stdio(0);
cin.tie(0);
}
int dp[100005];
int frog1rec(int h[], int N, int n) {
if (N == 2)
return abs(h[1] - h[0]);
if (dp[N] != -1)
return dp[N];
else
return dp[N] = min(abs(h[n - 1] - h[n - 2]) + frog1rec(h, N - 1, n - 1),
abs(h[n - 1] - h[n - 3]) + frog1rec(h, N - 2, n - 2));
}
int frog1tpdn(int *h, int N, int n) {
LOOP(i, 3, N) {
dp[i] = min(abs(h[i - 1] - h[i - 2]) + dp[i - 1],
abs(h[i - 1] - h[i - 3]) + dp[i - 2]);
}
return dp[N];
}
int32_t main() {
Gur27();
int n;
cin >> n;
int a[n];
SETINT(dp, -1);
dp[0] = 0;
dp[1] = 0;
loop(i, 0, n) cin >> a[i];
dp[2] = abs(a[1] - a[0]);
cout << frog1tpdn(a, n, n);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 953,159 | 953,160 | u603136669 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int dp[], int a[]) {
dp[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
int o1, o2;
o1 = dp[i - 1] + abs(a[i] - a[i - 1]);
o2 = dp[i - 2] + abs(a[i] - a[i - 2]);
dp[i] = min(o1, o2);
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int a[n];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << frog(n, dp, a);
} | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int dp[], int a[]) {
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int o1, o2;
o1 = dp[i - 1] + abs(a[i] - a[i - 1]);
o2 = dp[i - 2] + abs(a[i] - a[i - 2]);
dp[i] = min(o1, o2);
}
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int a[n];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << frog(n, dp, a);
} | [
"call.add",
"call.arguments.change"
] | 953,161 | 953,162 | u375225030 | cpp |
p03160 | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std::chrono;
using namespace std;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define ll long long
bool isPowerOfTwo(ll x) {
/* First x in the below expression is for the case when x is 0 */
return x && (!(x & (x - 1)));
}
bool SameSign(ll x, ll y) { return (x >= 0) ^ (y < 0); }
ll gcd(ll u, ll v) {
ll shift;
if (u == 0)
return v;
if (v == 0)
return u;
shift = __builtin_ctz(u | v);
u >>= __builtin_ctz(u);
do {
v >>= __builtin_ctz(v);
if (u > v) {
ll t = v;
v = u;
u = t;
}
v = v - u;
} while (v != 0);
return u << shift;
}
ll lcm(ll u, ll v) { return u * v / gcd(u, v); }
int isPower(int A) {
int i = 2;
int n;
if (A == 1) {
return true;
} else {
while (1) {
n = A;
int count = 0;
while (n % i == 0) {
n = n / i;
count++;
}
if (n == 1 && count > 1) {
return true;
} else if (n == 1 && count <= 1)
return false;
i++;
}
return false;
}
}
#define PI 3.14159265358979323846
// 30 10 60 10 60 50
// dp[6]=dp[5]+10;
// dp[5]=dp[3]+0;
// dp[3]=dp[1]+30;
// dp[1]=0;
int dp[100] = {0};
int main() {
int n;
cin >> n;
int a[n];
rep(i, 0, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std::chrono;
using namespace std;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define ll long long
bool isPowerOfTwo(ll x) {
/* First x in the below expression is for the case when x is 0 */
return x && (!(x & (x - 1)));
}
bool SameSign(ll x, ll y) { return (x >= 0) ^ (y < 0); }
ll gcd(ll u, ll v) {
ll shift;
if (u == 0)
return v;
if (v == 0)
return u;
shift = __builtin_ctz(u | v);
u >>= __builtin_ctz(u);
do {
v >>= __builtin_ctz(v);
if (u > v) {
ll t = v;
v = u;
u = t;
}
v = v - u;
} while (v != 0);
return u << shift;
}
ll lcm(ll u, ll v) { return u * v / gcd(u, v); }
int isPower(int A) {
int i = 2;
int n;
if (A == 1) {
return true;
} else {
while (1) {
n = A;
int count = 0;
while (n % i == 0) {
n = n / i;
count++;
}
if (n == 1 && count > 1) {
return true;
} else if (n == 1 && count <= 1)
return false;
i++;
}
return false;
}
}
#define PI 3.14159265358979323846
// 30 10 60 10 60 50
// dp[6]=dp[5]+10;
// dp[5]=dp[3]+0;
// dp[3]=dp[1]+30;
// dp[1]=0;
int dp[100050] = {0};
int main() {
int n;
cin >> n;
int a[n];
rep(i, 0, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 953,166 | 953,167 | u811138966 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[(unsigned int)1e5];
int h[(unsigned int)1e5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dp[(unsigned int)1e5];
int h[(unsigned int)1e5];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= 2; j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 953,180 | 953,181 | u491100219 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = min(0, abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
/*
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
*/
cout << a[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = max(0, abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
/*
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
*/
cout << a[n - 1] << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 953,189 | 953,190 | u794275880 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = min(h[1], abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
/*
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
*/
cout << a[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long a[n];
a[0] = 0;
if (n >= 2) {
a[1] = max(0, abs(h[1] - h[0]));
}
for (int i = 2; i < n; i++) {
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
/*
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
*/
cout << a[n - 1] << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 953,191 | 953,190 | u794275880 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(arr[i] - arr[i - 1])),
(dp[i - 2] + abs(arr[i] - arr[i - 2])));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min((dp[i - 1] + abs(arr[i] - arr[i - 1])),
(dp[i - 2] + abs(arr[i] - arr[i - 2])));
}
cout << dp[n - 1] << endl;
} | [
"call.add",
"call.arguments.change"
] | 953,194 | 953,195 | u551087770 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
typedef long long int ll;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define f first
#define s second
#define mod 1000000007
bool compare(pair<int, int> a, pair<int, int> b) { return a.f < b.f; }
int main() {
input();
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int df[n] = {}, arr[n];
rep(i, 0, n) cin >> arr[i];
rep(i, 1, n) {
int min1 = INT_MAX;
if (i - 2 >= 0) {
// cout<<arr[i];
min1 = min(abs(arr[i] - arr[i - 2]) + df[i - 2], min1);
}
min1 = min(abs(arr[i] - arr[i - 1]) + df[i - 1], min1);
df[i] = min1;
// cout<<min1<<endl;
}
cout << df[n - 1] << endl;
}
/// shubham gupta/
| #include <bits/stdc++.h>
using namespace std;
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
typedef long long int ll;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i >= b; i--)
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define f first
#define s second
#define mod 1000000007
bool compare(pair<int, int> a, pair<int, int> b) { return a.f < b.f; }
int main() {
// input();
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int df[n] = {}, arr[n];
rep(i, 0, n) cin >> arr[i];
rep(i, 1, n) {
int min1 = INT_MAX;
if (i - 2 >= 0) {
// cout<<arr[i];
min1 = min(abs(arr[i] - arr[i - 2]) + df[i - 2], min1);
}
min1 = min(abs(arr[i] - arr[i - 1]) + df[i - 1], min1);
df[i] = min1;
// cout<<min1<<endl;
}
cout << df[n - 1] << endl;
}
/// shubham gupta/
| [
"call.remove"
] | 953,196 | 953,197 | u071936511 | 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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
long long rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
long long res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
cout << rec(N - 1) << endl;
}
| #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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
long long rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
long long res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
cout << rec(N - 1) << endl;
}
| [
"control_flow.branch.if.add"
] | 953,198 | 953,199 | u020480485 | 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;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
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]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
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;
}
| [
"control_flow.branch.if.add"
] | 953,201 | 953,202 | u020480485 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
int a[N], mem[N], n;
int dp(int i) {
if (i > n - 1)
return 2e9;
if (i == n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
int ans = 2e9;
for (int j = 1; j <= 3; j++) {
ans = min(ans, abs(a[i] - a[i + j]) + dp(i + j));
}
return mem[i] = ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
memset(mem, -1, sizeof(mem));
printf("%d", dp(0));
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
int a[N], mem[N], n;
int dp(int i) {
if (i > n - 1)
return 2e9;
if (i == n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
int ans = 2e9;
for (int j = 1; j <= 2; j++) {
ans = min(ans, abs(a[i] - a[i + j]) + dp(i + j));
}
return mem[i] = ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
memset(mem, -1, sizeof(mem));
printf("%d", dp(0));
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 953,207 | 953,208 | u027405444 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> h(n + 5, INT_MAX);
rep(i, n) cin >> h[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
rep(i, n) {
dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1]), dp[i + 1]);
dp[i + 2] = dp[i] + abs(h[i] - h[i + 2]);
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
int n;
cin >> n;
// 桁あふれ処理めんどいので、+5くらい余計にとっておく
vector<int> h(n + 5, INT_MAX);
rep(i, n) cin >> h[i];
// 桁あふれ処理めんどいので、+5くらい余計にとっておく
vector<int> dp(n + 5, INT_MAX);
// 最初だけ初期化
dp[0] = 0;
rep(i, n) {
// i+1は2つの候補がある.
dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1]), dp[i + 1]);
dp[i + 2] = dp[i] + abs(h[i] - h[i + 2]);
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"assignment.change"
] | 953,215 | 953,216 | u200509145 | cpp |
p03160 | #include <iostream>
#define mxn 100010
using namespace std;
int ar[mxn], dp[mxn];
// return minim cost to reach at n
int go(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(ar[2] - ar[1]);
if (dp[n] != -1)
return dp[n];
int cost1 = go(n - 1) + abs(ar[n] - ar[n - 1]);
int cost2 = go(n - 2) + abs(ar[n] - ar[n - 2]);
return dp[n] = min(cost1, cost2);
}
int main() {
int n;
cin >> n;
fill(ar, ar + mxn, -1);
for (int i = 1; i <= n; ++i)
cin >> ar[i];
cout << go(n);
return 0;
} | #include <iostream>
#define mxn 100010
using namespace std;
int ar[mxn], dp[mxn];
// return minim cost to reach at n
int go(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(ar[2] - ar[1]);
if (dp[n] != -1)
return dp[n];
int cost1 = go(n - 1) + abs(ar[n] - ar[n - 1]);
int cost2 = go(n - 2) + abs(ar[n] - ar[n - 2]);
return dp[n] = min(cost1, cost2);
}
int main() {
int n;
cin >> n;
fill(dp, dp + mxn, -1);
for (int i = 1; i <= n; ++i)
cin >> ar[i];
cout << go(n);
return 0;
} | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,219 | 953,220 | u907329403 | cpp |
p03160 | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
using namespace std;
int ar[mxn], dp[mxn];
int solve(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(ar[1] - ar[0]);
if (dp[n] != -1)
return dp[n];
int s1 = solve(n - 1);
int s2 = solve(n - 2);
return dp[n] = min(s1 + abs(ar[n] - ar[n - 1]), s2 + abs(ar[n] - ar[n - 2]));
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> ar[i];
for (int i = 0; i < mxn; ++i)
dp[i] = -1;
cout << solve(n) << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
using namespace std;
int ar[mxn], dp[mxn];
int solve(int n) {
if (n == 0)
return 0;
if (n == 1)
return abs(ar[1] - ar[0]);
if (dp[n] != -1)
return dp[n];
int s1 = solve(n - 1);
int s2 = solve(n - 2);
return dp[n] = min(s1 + abs(ar[n] - ar[n - 1]), s2 + abs(ar[n] - ar[n - 2]));
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> ar[i];
for (int i = 0; i < mxn; ++i)
dp[i] = -1;
cout << solve(n - 1) << '\n';
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 953,221 | 953,222 | u907329403 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 0; i < N; ++i)
cin >> h[i + 1];
vector<int> dp(N + 5, (int)1e9 + (int)1e5);
dp[0] = dp[1] = 0;
for (int i = 2; i <= N; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 0; i < N; ++i)
cin >> h[i + 1];
vector<int> dp(N + 5, (int)1e9 + (int)1e5);
dp[0] = dp[1] = 0;
for (int i = 2; i <= N; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i - 2)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N] << endl;
}
| [
"control_flow.branch.if.add"
] | 953,228 | 953,229 | u384800486 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
dp[i] = min(abs(ar[i] - ar[i - 1]) + dp[i - 1],
abs(ar[n] - ar[i - 2]) + dp[i - 2]);
if (i == n || n == 1 || n == 2)
return dp[n];
solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
}
| #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
dp[i] = min(abs(ar[i] - ar[i - 1]) + dp[i - 1],
abs(ar[i] - ar[i - 2]) + dp[i - 2]);
if (i == n || n == 1 || n == 2)
return dp[n];
solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,230 | 953,231 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
dp[i] = min(abs(ar[i] - ar[i - 1]) + dp[i - 1],
abs(ar[n] - ar[i - 2]) + dp[i - 2]);
if (i == n || i == 1 || i == 2)
return dp[n];
solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
}
| #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
dp[i] = min(abs(ar[i] - ar[i - 1]) + dp[i - 1],
abs(ar[i] - ar[i - 2]) + dp[i - 2]);
if (i == n || n == 1 || n == 2)
return dp[n];
solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 953,232 | 953,231 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
if (i - 1 == n || n == 1 || n == 2)
return dp[n];
dp[i] = abs(ar[i] - ar[i - 1]) + dp[i - 1];
dp[i] = min(dp[i], abs(ar[n] - ar[i - 2]) + dp[i - 2]);
return solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
} | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
if (i - 1 == n || n == 1 || n == 2)
return dp[n];
dp[i] = abs(ar[i] - ar[i - 1]) + dp[i - 1];
dp[i] = min(dp[i], abs(ar[i] - ar[i - 2]) + dp[i - 2]);
return solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,233 | 953,234 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
if (i - 1 == n || n == 1 || n == 2)
return dp[n];
dp[i] = abs(ar[i] - ar[i - 1]) + dp[i - 1];
dp[i] = min(dp[i], abs(ar[n] - ar[i - 2]) + dp[i - 2]);
solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
} | #include <bits/stdc++.h>
#define l(i, a, b) for (auto i = a; i < b; i++)
#define lr(i, a, b) for (auto i = a; i >= b; i--)
#define ll long long
#define lli long long int
#define ld long double
#define vec vector<int>
#define mii map<ll, ll>
#define vl vector<long long>
#define se set<long long int>
#define pi pair<long long, long long>
#define pb push_back
#define mp make_pair
#define ft first
#define sd second
#define all(v) v.begin(), v.end()
#define in(x) cin >> x
#define o(x) cout << x
#define SYNC \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int ar[200000], dp[200000], n;
int solve(int i) {
if (i - 1 == n || n == 1 || n == 2)
return dp[n];
dp[i] = abs(ar[i] - ar[i - 1]) + dp[i - 1];
dp[i] = min(dp[i], abs(ar[i] - ar[i - 2]) + dp[i - 2]);
return solve(i + 1);
}
int main() {
SYNC in(n);
l(i, 1, n + 1) in(ar[i]);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
o(solve(3));
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.return.add"
] | 953,235 | 953,234 | u586345737 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli looper;
cin >> looper;
int a[looper + 1];
fw(i, 0, looper) { cin >> a[i]; }
lli K = 2;
fw(i, K, looper + 1) {
dp[i] = Max;
for (lli j = i; j >= fmax(i - K, 0); j--) {
dp[i] = fmin(dp[i], dp[j] + fabs(a[i] - a[j]));
}
}
cout << dp[looper - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli looper;
cin >> looper;
int a[looper + 1];
fw(i, 0, looper) { cin >> a[i]; }
lli K = 2;
fw(i, K - 1, looper + 1) {
dp[i] = Max;
for (lli j = i; j >= fmax(i - K, 0); j--) {
dp[i] = fmin(dp[i], dp[j] + fabs(a[i] - a[j]));
}
}
cout << dp[looper - 1] << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 953,238 | 953,239 | u161386534 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli looper;
cin >> looper;
int a[looper + 1];
fw(i, 0, looper) { cin >> a[i]; }
lli K = 2;
fw(i, K, looper + 1) {
dp[i] = Max;
for (lli j = i - 1; j >= fmax(i - K, 0); j--) {
dp[i] = fmin(dp[i], dp[j] + fabs(a[i] - a[j]));
}
}
cout << dp[looper - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli looper;
cin >> looper;
int a[looper + 1];
fw(i, 0, looper) { cin >> a[i]; }
lli K = 2;
fw(i, K - 1, looper + 1) {
dp[i] = Max;
for (lli j = i; j >= fmax(i - K, 0); j--) {
dp[i] = fmin(dp[i], dp[j] + fabs(a[i] - a[j]));
}
}
cout << dp[looper - 1] << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 953,240 | 953,239 | u161386534 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli looper;
cin >> looper;
int a[looper + 1];
fw(i, 0, looper) { cin >> a[i]; }
lli K = 2;
fw(i, K, looper + 1) {
dp[i] = Max;
for (lli j = i - 1; j >= fmax(i - K, 1); j--) {
dp[i] = fmin(dp[i], dp[j] + fabs(a[i] - a[j]));
}
}
cout << dp[looper - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <limits>
using namespace std;
#define lli long long int
#define f first
#define s second
#define Max 1e9 + 7
#define fw(i, start, end) for (lli i = start; i < end; ++i)
int dp[100005];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli looper;
cin >> looper;
int a[looper + 1];
fw(i, 0, looper) { cin >> a[i]; }
lli K = 2;
fw(i, K - 1, looper + 1) {
dp[i] = Max;
for (lli j = i; j >= fmax(i - K, 0); j--) {
dp[i] = fmin(dp[i], dp[j] + fabs(a[i] - a[j]));
}
}
cout << dp[looper - 1] << endl;
return 0;
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,241 | 953,239 | u161386534 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
long dp[N];
for (int i = 0; i < N; i++) {
if (i == 0) {
dp[i] = 0;
continue;
}
if (i == 1) {
dp[i] = abs(h[i] - h[i - 1]);
continue;
}
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] = h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
long dp[N];
for (int i = 0; i < N; i++) {
if (i == 0) {
dp[i] = 0;
continue;
}
if (i == 1) {
dp[i] = abs(h[i] - h[i - 1]);
continue;
}
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,242 | 953,243 | u568877271 | cpp |
p03160 | /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
ll(s); \
cin >> (s);
#define Scin(s) \
ll(s); \
cin >> (s);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
// cout << "Case #" << index << " :IMPOSSIBLE";
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n;
cin >> n;
V vec(n + 1);
rep3(i, 1, n + 1) cin >> vec[i];
V dp(n + 10, 1e18);
dp[1] = 0;
dp[2] = vec[2] - vec[1];
rep3(i, 3, n + 1) {
dp[i] = min(dp[i - 1] + abs(vec[i] - vec[i - 1]),
dp[i - 2] + abs(vec[i - 2] - vec[i]));
}
cout << dp[n] << endl;
}
| /*
Author:zeke
pass System Test!
GET AC!!
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
ll(s); \
cin >> (s);
#define Scin(s) \
ll(s); \
cin >> (s);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
// cout << "Case #" << index << " :IMPOSSIBLE";
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
long long LCM(long long a, long long b) { return a * b / GCD(a, b); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
ll n;
cin >> n;
V vec(n + 1);
rep3(i, 1, n + 1) cin >> vec[i];
V dp(n + 10, 1e18);
dp[1] = 0;
dp[2] = abs(vec[2] - vec[1]);
rep3(i, 3, n + 1) {
dp[i] = min(dp[i - 1] + abs(vec[i] - vec[i - 1]),
dp[i - 2] + abs(vec[i - 2] - vec[i]));
}
cout << dp[n] << endl;
}
| [
"call.add",
"call.arguments.change"
] | 953,244 | 953,245 | u759162415 | cpp |
p03160 | // This is the Property of Rishabh Agarwal
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
ll power(ll a, ll b) {
if (b == 0) {
return 1;
}
ll temp = power(a, b / 2) % mod;
if (b % 2 == 0) {
return (temp * temp) % mod;
} else {
return ((a * temp) % mod * temp) % mod;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
// cin>>t;
t = 1;
while (t--) {
ll n;
cin >> n;
ll a[n];
a[0] = 0;
for (ll x = 0; x < n; x++) {
cin >> a[x];
}
ll dp[n];
dp[0] = 0;
dp[1] = a[1] - a[0];
for (ll x = 2; x < n; x++) {
dp[x] = min(dp[x - 1] + abs(a[x] - a[x - 1]),
dp[x - 2] + abs(a[x] - a[x - 2]));
}
cout << dp[n - 1] << "\n";
}
return 0;
}
| // This is the Property of Rishabh Agarwal
#include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e9 + 7;
ll power(ll a, ll b) {
if (b == 0) {
return 1;
}
ll temp = power(a, b / 2) % mod;
if (b % 2 == 0) {
return (temp * temp) % mod;
} else {
return ((a * temp) % mod * temp) % mod;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
// cin>>t;
t = 1;
while (t--) {
ll n;
cin >> n;
ll a[n];
a[0] = 0;
for (ll x = 0; x < n; x++) {
cin >> a[x];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll x = 2; x < n; x++) {
dp[x] = min(dp[x - 1] + abs(a[x] - a[x - 1]),
dp[x - 2] + abs(a[x] - a[x - 2]));
}
cout << dp[n - 1] << "\n";
}
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 953,252 | 953,253 | u783950415 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int tt, n, x, i, j, d, s, t, flag = 0, f;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> tt;
d = 0;
cin >> n;
vector<int> a(n), b(n);
for (i = 0; i < n; i++) {
cin >> b[i];
}
a[0] = 0;
a[1] = abs(b[1] - b[0]);
for (i = 2; i < n; i++) {
a[i] = std::min(a[i - 1] + abs(b[i] - b[i - 1]),
a[i - 2] + abs(b[i] - b[i - 2]));
}
cout << a[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int tt, n, x, i, j, d, s, t, flag = 0, f;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
d = 0;
cin >> n;
vector<int> a(n), b(n);
for (i = 0; i < n; i++) {
cin >> b[i];
}
a[0] = 0;
a[1] = abs(b[1] - b[0]);
for (i = 2; i < n; i++) {
a[i] = std::min(a[i - 1] + abs(b[i] - b[i - 1]),
a[i - 2] + abs(b[i] - b[i - 2]));
}
cout << a[n - 1] << endl;
return 0;
} | [] | 953,254 | 953,255 | u844738948 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
#include <algorithm>
#define str(a) to_string(a)
#define int long long
#define pb push_back
#define mp make_pair
#define SORT(c) sort(c.begin(), c.end())
#define max_heap priority_queue<int>
#define min_heap priority_queue<int, vector<int>, greater<int>>
#define mod 1000000007
#define setbits(x) __builtin_popcount(x)
#define ps(x, y) fixed << setprecision(y) << x
#define start(t) \
int x; \
cin >> x; \
while (x--)
#define inf LLONG_MAX
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define N 1000001
int32_t main() {
// 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 n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
// vector<int> dp(n); // dp[i] the cost to reach ith height....
int twostepsbehind = 0; // initial cost......
int onestepbehind = abs(vec[1] - vec[0]);
int presentcost;
for (int i = 2; i < n; i++) {
// cerr << onestepbehind << " " << twostepsbehind << endl;
presentcost = min(twostepsbehind + abs(vec[i] - vec[i - 2]),
onestepbehind + abs(vec[i] - vec[i - 1]));
twostepsbehind = onestepbehind;
onestepbehind = presentcost;
}
cout << presentcost << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
#include <algorithm>
#define str(a) to_string(a)
#define int long long
#define pb push_back
#define mp make_pair
#define SORT(c) sort(c.begin(), c.end())
#define max_heap priority_queue<int>
#define min_heap priority_queue<int, vector<int>, greater<int>>
#define mod 1000000007
#define setbits(x) __builtin_popcount(x)
#define ps(x, y) fixed << setprecision(y) << x
#define start(t) \
int x; \
cin >> x; \
while (x--)
#define inf LLONG_MAX
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define N 1000001
int32_t main() {
// 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 n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
// vector<int> dp(n); // dp[i] the cost to reach ith height....
int twostepsbehind = 0; // initial cost......
int onestepbehind = abs(vec[1] - vec[0]);
int presentcost = onestepbehind;
for (int i = 2; i < n; i++) {
// cerr << onestepbehind << " " << twostepsbehind << endl;
presentcost = min(twostepsbehind + abs(vec[i] - vec[i - 2]),
onestepbehind + abs(vec[i] - vec[i - 1]));
twostepsbehind = onestepbehind;
onestepbehind = presentcost;
}
cout << presentcost << endl;
}
| [
"variable_declaration.value.change"
] | 953,256 | 953,257 | u314266101 | cpp |
p03160 | #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define vmax(v) *max_element(v.begin(), v.end())
#define vmin(v) *min_element(v.begin(), v.end())
#define cnt(v, n) count(v.begin(), v.end(), (n))
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vpic vector<pair<int, char>>
#define mp make_pair
typedef long long ll;
typedef unsigned long long ulld;
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void solve() {
int n;
cin >> n;
int arr[n];
FOR(i, 0, n) { cin >> arr[i]; }
int dp[n];
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
FOR(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
// FOR(i, 0, n) cout<<dp[i]<<" ";
cout << dp[n];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// // COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t start = clock();
// //
// int t;
// cin>>t;
// while(t--){
solve();
// }
// //COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t stop = clock();
// double elapsed = (double) (stop - start) / CLOCKS_PER_SEC;
// cout<<setprecision(5)<<fixed;
// cout<<"\nProcess finished in: "<<elapsed<<"s\n";
return 0;
}
| #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define vmax(v) *max_element(v.begin(), v.end())
#define vmin(v) *min_element(v.begin(), v.end())
#define cnt(v, n) count(v.begin(), v.end(), (n))
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vpic vector<pair<int, char>>
#define mp make_pair
typedef long long ll;
typedef unsigned long long ulld;
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void solve() {
int n;
cin >> n;
int arr[n];
FOR(i, 0, n) { cin >> arr[i]; }
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
FOR(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
// FOR(i, 0, n) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// // COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t start = clock();
// //
// int t;
// cin>>t;
// while(t--){
solve();
// }
// //COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t stop = clock();
// double elapsed = (double) (stop - start) / CLOCKS_PER_SEC;
// cout<<setprecision(5)<<fixed;
// cout<<"\nProcess finished in: "<<elapsed<<"s\n";
return 0;
}
| [
"expression.operation.binary.add"
] | 953,271 | 953,270 | u537818901 | cpp |
p03160 | #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define vmax(v) *max_element(v.begin(), v.end())
#define vmin(v) *min_element(v.begin(), v.end())
#define cnt(v, n) count(v.begin(), v.end(), (n))
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vpic vector<pair<int, char>>
#define mp make_pair
typedef long long ll;
typedef unsigned long long ulld;
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void solve() {
int n;
cin >> n;
int arr[n];
FOR(i, 0, n) { cin >> arr[i]; }
int dp[n];
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
FOR(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
// FOR(i, 0, n-1) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// // COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t start = clock();
// //
// int t;
// cin>>t;
// while(t--){
solve();
// }
// //COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t stop = clock();
// double elapsed = (double) (stop - start) / CLOCKS_PER_SEC;
// cout<<setprecision(5)<<fixed;
// cout<<"\nProcess finished in: "<<elapsed<<"s\n";
return 0;
}
| #include <bits/stdc++.h>
#define CFOR(i, str) for (int i = 0; (str)[i] != '\0'; (i)++)
#define FOR(i, s, r) for (int i = (s); i < (r); i++)
#define INF 1e9
#define NINF -1e9
#define SUM(a) accumulate(a.begin(), a.end(), 0)
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.rbegin(), v.rend())
#define vmax(v) *max_element(v.begin(), v.end())
#define vmin(v) *min_element(v.begin(), v.end())
#define cnt(v, n) count(v.begin(), v.end(), (n))
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vpic vector<pair<int, char>>
#define mp make_pair
typedef long long ll;
typedef unsigned long long ulld;
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
void solve() {
int n;
cin >> n;
int arr[n];
FOR(i, 0, n) { cin >> arr[i]; }
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
FOR(i, 2, n) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
// FOR(i, 0, n) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// // COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t start = clock();
// //
// int t;
// cin>>t;
// while(t--){
solve();
// }
// //COMMENT BEFORE SUBMISSION
// ///////////////////////////////////////////////// clock_t stop = clock();
// double elapsed = (double) (stop - start) / CLOCKS_PER_SEC;
// cout<<setprecision(5)<<fixed;
// cout<<"\nProcess finished in: "<<elapsed<<"s\n";
return 0;
}
| [] | 953,272 | 953,270 | u537818901 | cpp |
p03160 | // Inbornhandsome
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define FIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define endl '\n'
#define int long long
const int N = 1e5 + 7;
int stones[N], cost[N], n;
int find_cost(int stone) {
if (stone > n)
return 1e9;
if (stone == n)
return 0;
int &ans = cost[stone];
if (ans != -1)
return ans;
ans = min(abs(stones[stone] - stones[stone + 1]) + find_cost(stone + 1),
abs(stones[stone] - stones[stone + 2]) + find_cost(stone + 2));
return ans;
}
int32_t main() {
IOS;
FIO;
cin >> n;
memset(cost, -1, sizeof(cost));
for (int i = 1; i <= n; ++i)
cin >> stones[i];
cout << find_cost(1);
return 0;
} | // Inbornhandsome
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define FIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define endl '\n'
#define int long long
const int N = 1e5 + 7;
int stones[N], cost[N], n;
int find_cost(int stone) {
if (stone > n)
return 1e9;
if (stone == n)
return 0;
int &ans = cost[stone];
if (ans != -1)
return ans;
ans = min(abs(stones[stone] - stones[stone + 1]) + find_cost(stone + 1),
abs(stones[stone] - stones[stone + 2]) + find_cost(stone + 2));
return ans;
}
int32_t main() {
IOS; // FIO;
cin >> n;
memset(cost, -1, sizeof(cost));
for (int i = 1; i <= n; ++i)
cin >> stones[i];
cout << find_cost(1);
return 0;
} | [] | 953,275 | 953,276 | u621231159 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define max 100007
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
vector<long long> dp(n, max);
dp[0] = 0;
for (long long i = 0; i < n; i++)
cin >> a[i];
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define max 1e9 + 7
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vector<long long> a(n);
vector<long long> dp(n, max);
dp[0] = 0;
for (long long i = 0; i < n; i++)
cin >> a[i];
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"preprocessor.define.value.change",
"literal.float.change"
] | 953,280 | 953,281 | u244398177 | cpp |
p03160 | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
nik();
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = a[1];
int dp[n + 1] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 2] + abs(a[i] - a[i - 2]),
dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = a[1];
int dp[n + 1] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 2] + abs(a[i] - a[i - 2]),
dp[i - 1] + abs(a[i] - a[i - 1]));
}
cout << dp[n] << endl;
}
return 0;
}
| [
"call.remove"
] | 953,282 | 953,283 | u745008216 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
DP[i] = inf;
}
DP[1] = 0;
for (int i = 2; i <= N; ++i) {
if (i - 1 >= 0)
DP[i] = min(DP[i], DP[i - 1] + dis(i, i - 1));
if (i - 2 >= 0)
DP[i] = min(DP[i], DP[i - 2] + dis(i, i - 2));
}
cout << DP[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
DP[i] = inf;
}
DP[1] = 0;
for (int i = 2; i <= N; ++i) {
if (i - 1 >= 1)
DP[i] = min(DP[i], DP[i - 1] + dis(i, i - 1));
if (i - 2 >= 1)
DP[i] = min(DP[i], DP[i - 2] + dis(i, i - 2));
}
cout << DP[N] << endl;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 953,284 | 953,285 | u813077255 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
DP[i] = inf;
}
DP[1] = 0;
for (int i = 1; i <= N; ++i) {
if (i - 1 >= 0)
DP[i] = min(DP[i], DP[i - 1] + dis(i, i - 1));
if (i - 2 >= 0)
DP[i] = min(DP[i], DP[i - 2] + dis(i, i - 2));
}
cout << DP[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 1e18;
ll h[maxn];
ll DP[maxn];
int N;
ll dis(int i, int j) { return abs(h[i] - h[j]); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
DP[i] = inf;
}
DP[1] = 0;
for (int i = 2; i <= N; ++i) {
if (i - 1 >= 1)
DP[i] = min(DP[i], DP[i - 1] + dis(i, i - 1));
if (i - 2 >= 1)
DP[i] = min(DP[i], DP[i - 2] + dis(i, i - 2));
}
cout << DP[N] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 953,286 | 953,285 | u813077255 | cpp |
p03160 | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {0};
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(dp[0] - dp[1]);
for (int i = 2; i < n; i++) {
int min1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int min2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(min1, min2);
}
cout << dp[n - 1];
return 0;
}
| #include <climits>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {0};
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
int min1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int min2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(min1, min2);
}
cout << dp[n - 1];
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 953,297 | 953,298 | u492789403 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int cost[N], height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
if (i == 0)
cost[i] = 0;
else
cost[i] = 2147483627;
}
for (int i = 0; i < N; i++) {
if (i + 1 < N)
cost[i + 1] = min(cost[i + 1], cost[i] + abs(height[i] - height[i + 1]));
if (i + 2 < N)
cost[i + 2] =
min(cost[i + 2], cost[i + 1] + abs(height[i] - height[i + 2]));
}
cout << cost[N - 1] << endl;
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
int cost[N], height[N];
for (int i = 0; i < N; i++) {
cin >> height[i];
if (i == 0)
cost[i] = 0;
else
cost[i] = 2147483627;
}
for (int i = 0; i < N; i++) {
if (i + 1 < N)
cost[i + 1] = min(cost[i + 1], cost[i] + abs(height[i] - height[i + 1]));
if (i + 2 < N)
cost[i + 2] = min(cost[i + 2], cost[i] + abs(height[i] - height[i + 2]));
}
cout << cost[N - 1] << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 953,301 | 953,302 | u002439051 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.