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 8
values |
|---|---|---|---|---|---|---|---|
p03160 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#defi... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#defi... | [
"assignment.change"
] | 954,715 | 954,716 | u518027311 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"expression.operation.binary.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,717 | 954,718 | u103850114 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | [
"literal.number.change",
"call.arguments.change"
] | 954,722 | 954,723 | u874921280 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long a[100001], dp[100001], i, j, n, k;
long long cal(long long i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
else
dp[i] = 0;
if (i + 2 <= n)
dp[i] = min(cal(i + 1) + abs(a[i + 1] - a[i]),
cal(i + 2) + abs(a[i + 2] - ... | #include <bits/stdc++.h>
using namespace std;
long long a[100001], dp[100001], i, j, n, k;
long long cal(long long i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
else
dp[i] = 0;
if (i + 2 <= n)
dp[i] = min(cal(i + 1) + abs(a[i + 1] - a[i]),
cal(i + 2) + abs(a[i + 2] - ... | [
"expression.operation.binary.remove"
] | 954,724 | 954,725 | u227031461 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int ans[100001];
int arr[100001];
int func(int n) {
if (ans[n] != -1)
return ans[n];
int a = func(n - 1) + abs(arr[n] - arr[n - 1]);
int b = func(n - 2) + abs(arr[n] - arr[n - 2]);
ans[n] = min(a, b);
return ans[n];
}
int main() {
int n,... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int ans[100001];
int arr[100001];
int func(int n) {
if (ans[n] != -1)
return ans[n];
int a = func(n - 1) + abs(arr[n] - arr[n - 1]);
int b = func(n - 2) + abs(arr[n] - arr[n - 2]);
ans[n] = min(a, b);
return ans[n];
}
int main() {
int n,... | [
"literal.number.change",
"assignment.value.change"
] | 954,732 | 954,733 | u313894879 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = h[1] - h[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
... | [
"call.add",
"call.arguments.change"
] | 954,743 | 954,744 | u621956397 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const ll INF = 1e6;
ll N;
vector<ll> dp, h;
int main() {
cin >> N;
h.resize(N);
dp.resize(N + 5);
rep(i, N) cin >> h[i];
rep(i, N + 5) dp[i] = INF;
dp[0] = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll N;
vector<ll> dp, h;
int main() {
// cout << INF << endl;
// return 0;
cin >> N;
h.resize(N);
dp.resize(N + 5);
rep(i, N) cin >> h[... | [
"literal.number.change"
] | 954,755 | 954,754 | u455366471 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> ... | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 954,758 | 954,757 | u138597672 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,763 | 954,764 | u058509804 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define pf push_front
#define speed_up ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define debug cerr << "OK\n";
#define ub up... | [
"literal.number.change",
"expression.operation.binary.change"
] | 954,767 | 954,768 | u426777622 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
const long long INF = 1LL << 60;
long long dp[100010];
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = dp[0] + abs(h[0] - h[1]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
const long long INF = 1LL << 60;
long long dp[100010];
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = dp[0] + abs(h[0] - h[1]... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 954,769 | 954,770 | u233412274 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 2;
const int mod = 1e9 + 7;
const int inf = 1e9;
typedef long long II;
int n;
int arr[maxn], dp[maxn];
int solve_dp(int pos) {
if (pos > n) {
return inf;
}
if (pos == n - 1) {
return 0;
}
if (dp[pos] != -1) {
return dp[pos]... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 2;
const int mod = 1e9 + 7;
const int inf = 1e9;
typedef long long II;
int n;
int arr[maxn], dp[maxn];
int solve_dp(int pos) {
if (pos > n) {
return inf;
}
if (pos == n - 1) {
return 0;
}
if (dp[pos] != -1) {
return dp[pos]... | [
"expression.operation.binary.change"
] | 954,779 | 954,780 | u888155275 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(vec[i - 1] - vec[i]),
i > 1 ? dp[i - 2] + abs(vec[i - 2] -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
vector<int> dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i - 1] + abs(vec[i - 1] - vec[i]),
i > 1 ? dp[i - 2] + abs(vec[i - 2] -... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 954,785 | 954,786 | u021539722 | cpp |
p03160 | /*
LEARNING DP: FROG 1
+ Frog need to reach stone N
+ Can jump to Stone i + 1 or i + 2 when the Frog is on Stone i
+ Cost |hi - hj|
=> Imagine if the frog were at stone i + 1 or i + 2,
What is the minium cost to reach on Stone i.
PRE DP:
+FIRST STATE: i = 0 =>... | /*
LEARNING DP: FROG 1
+ Frog need to reach stone N
+ Can jump to Stone i + 1 or i + 2 when the Frog is on Stone i
+ Cost |hi - hj|
=> Imagine if the frog were at stone i + 1 or i + 2,
What is the minium cost to reach on Stone i.
PRE DP:
+FIRST STATE: i = 0 =>... | [] | 954,787 | 954,788 | u680191616 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int6... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int6... | [
"literal.number.change",
"call.arguments.change"
] | 954,791 | 954,792 | u785492958 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int6... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int6... | [
"literal.number.change",
"call.arguments.change"
] | 954,793 | 954,792 | u785492958 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int N;
long long h[100010... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int N;
long long h[1000... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,796 | 954,797 | u944656871 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(h[i] - h[j]); }
// bottom up
// int main() {
// int n;
// cin>>n;
// h.resize(n);
// for(int i=0; i<n; i++) {
// cin>>h[i];
// }
// dp.resize(n);
// dp[0] = 0;
// dp[1] = abs(h[0]-h[1]);
// for(... | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(h[i] - h[j]); }
// bottom up
// int main() {
// int n;
// cin>>n;
// h.resize(n);
// for(int i=0; i<n; i++) {
// cin>>h[i];
// }
// dp.resize(n);
// dp[0] = 0;
// dp[1] = abs(h[0]-h[1]);
// for(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 954,798 | 954,799 | u812060781 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(dp[i] - dp[j]); }
int main() {
int n;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp.resize(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
vector<int> h;
vector<int> dp;
int cost(int i, int j) { return abs(h[i] - h[j]); }
int main() {
int n;
cin >> n;
h.resize(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp.resize(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) ... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 954,800 | 954,801 | u812060781 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
using Map = unordered_map<int, int>;
int get_smallest_hop(int i, const vector<int> &vec, Map &memo) {
if (i == 0)
return 0;
if (i == 1)
return abs(vec[0] - vec[1]);
int p1, p2;
if (memo.find(i - 1) != ... | #include <cmath>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
using Map = unordered_map<int, int>;
int get_smallest_hop(int i, const vector<int> &vec, Map &memo) {
if (i == 0)
return 0;
if (i == 1)
return abs(vec[0] - vec[1]);
int p1, p2;
if (memo.find(i - 1) != ... | [
"assignment.variable.change",
"identifier.change"
] | 954,802 | 954,803 | u163776885 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"literal.number.change",
"expression.operation.binary.change"
] | 954,804 | 954,805 | u951187116 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define mp make_pair
#define s second
#define f first
#define ll long long
using namespace std;
const int MAX = 1e5;
int h[100003], dp[100003];
int main() {
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define mp make_pair
#define s second
#define f first
#define ll long long
using namespace std;
const ll MAX = 1e10;
ll h[100003], dp[100003];
int main() {
i... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 954,810 | 954,811 | u276163214 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
vector<int> m;
int proc(vector<int> &vec, int n) {
if (n == 0) {
return 0;
} else if (n == 1) {
return abs(vec[1] - vec[0]);
}
if (m[n] > 0) {
return m[n];
}
int b = abs(vec[n] - vec[n - 2]) + proc(vec, n - 2);
int a = abs(vec[n] ... | #include <iostream>
#include <vector>
using namespace std;
vector<int> m;
int proc(vector<int> &vec, int n) {
if (n == 0) {
return 0;
} else if (n == 1) {
return abs(vec[1] - vec[0]);
}
if (m[n] > 0) {
return m[n];
}
int b = abs(vec[n] - vec[n - 2]) + proc(vec, n - 2);
int a = abs(vec[n] ... | [] | 954,812 | 954,813 | u624521609 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int cost[n - 1] = {};
cost[n - 2] = abs(arr[n - 1] - arr[n - 2]);
for (int i = n - 3; i >= 0; i--) {
cost[i] = min(cost[i + 1] + abs(arr[i] - arr[i + 1]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int cost[1000000] = {-1};
cost[n - 2] = abs(arr[n - 1] - arr[n - 2]);
for (int i = n - 3; i >= 0; i--) {
cost[i] = min(cost[i + 1] + abs(arr[i] - arr[i + 1]),
... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 954,818 | 954,819 | u577996588 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[idx ... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 1e9;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[id... | [
"literal.number.change",
"function.return_value.change"
] | 954,829 | 954,830 | u848964569 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return -1000000000;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 1e9;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
dp[idx] = min(cal(idx + 1) + abs(a[idx] - a[idx + 1]),
cal(idx + 2) + abs(a[idx] - a[id... | [
"literal.number.change",
"function.return_value.change"
] | 954,831 | 954,830 | u848964569 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int best[100005];
int a[100005];
for (i = 0; i < n; i++) {
cin >> a[i];
}
// best[i]=best option to reach ith stone
best[0] = 0; // standing on 1st stone
best[1] = abs(a[1] - a[0]);
for (i = 2; i <= n - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int best[100005];
int a[100005];
for (i = 0; i < n; i++) {
cin >> a[i];
}
// best[i]=best option to reach ith stone
best[0] = 0; // standing on 1st stone
best[1] = abs(a[1] - a[0]);
for (i = 2; i <= n - 1; i++) {
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,834 | 954,835 | u034797454 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> dp(N);
vector<int> h(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = h[1] - h[0];
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]),... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> dp(N);
vector<int> h(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i -... | [
"call.add",
"call.arguments.change"
] | 954,838 | 954,839 | u737254528 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n;
cin >> n;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
b[1] = abs(b[1] - b[0]... | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n;
cin >> n;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
b[1] = abs(a[1] - a[0]... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,844 | 954,845 | u372392968 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define ld long double
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define ld long double
ll mod = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
ll n... | [] | 954,846 | 954,847 | u882466751 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define endl "\n"
#define vvi vector<vector<int>>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i >= b; i--)
#define speed ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define endl "\n"
#define vvi vector<vector<int>>
#define vii vector<pair<int, int>>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repD(i, a, b) for (int i = a; i >= b; i--)
#define speed ... | [
"assignment.add"
] | 954,861 | 954,862 | u255380940 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#define msi map<string, int... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
#define mii map<int, int>
#define msi map<string, int... | [
"assignment.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,863 | 954,864 | u452512115 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
using namespace std;
template <class T> inline bool chmin(T &a, T b)... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
using namespace std;
template <class T> inline bool chmin(T &a, T b)... | [
"variable_declaration.remove",
"literal.number.change",
"assignment.value.change"
] | 954,865 | 954,866 | u452512115 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
using namespace std;
template <class T> inline bool chmin(T &a, T b)... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ALL(a) begin(a), end(a)
using namespace std;
template <class T> inline bool chmin(T &a, T b)... | [
"variable_declaration.remove",
"literal.number.change",
"assignment.value.change"
] | 954,867 | 954,866 | u452512115 | cpp |
p03160 | #include <iostream>
#define INF 1000000
using namespace std;
int n;
int tab[1000000];
int dp[1000000];
int main() {
cin >> n;
for (int i = 1; i < n + 5; i++) {
dp[i] = INF;
}
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
// cout<<dp[10];
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i +... | #include <iostream>
#define INF 1e9 + 5
using namespace std;
int n;
int tab[1000000];
int dp[1000000];
int main() {
cin >> n;
for (int i = 1; i < n + 5; i++) {
dp[i] = INF;
}
for (int i = 0; i < n; i++) {
cin >> tab[i];
}
// cout<<dp[10];
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i +... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 954,871 | 954,872 | u722772027 | cpp |
p03160 | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>----------... | // --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
// -------------------</optimizations>----------... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 954,873 | 954,874 | u584242364 | cpp |
p03160 | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N), dp(N, 1 << 100);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
... | #include <bits/stdc++.h>
using ll = long long int;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N), dp(N, 1000000000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1) {
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 954,878 | 954,879 | u569272329 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
... | [
"call.add",
"call.arguments.change"
] | 954,881 | 954,882 | u539823537 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int jump[n];
for (int i = 0; i < n; i++)
cin >> jump[i];
int dp[n][3];
dp[0][1] = abs(jump[0] - jump[1]);
if (n > 2)
dp[0][2]... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int jump[n];
for (int i = 0; i < n; i++)
cin >> jump[i];
int dp[n][3];
dp[0][1] = abs(jump[0] - jump[1]);
if (n > 2)
dp[0][2]... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 954,883 | 954,884 | u769880428 | cpp |
p03160 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real =... | [
"expression.operation.binary.remove"
] | 954,885 | 954,886 | u876978301 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
if (i == 1)
mn[i... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
else if (i == 1)
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 954,893 | 954,894 | u850402770 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
if (i == 1)
mn[i... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
else if (i == 1)
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,895 | 954,894 | u850402770 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
if (i == 1)
mn[i] = ... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n;
cin >> n;
int wt[n];
for (int i = 0; i < n; i++) {
cin >> wt[i];
}
int mn[n];
for (int i = 0; i < n; i++) {
if (i == 0)
mn[i] = 0;
else if (i == 1)
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,896 | 954,894 | u850402770 | cpp |
p03160 | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long int
using namespace std;
// vec.back()
main() {
ll n;
cin >> n;
ll he[n] = {0};
ll dp[n] = {0};
for (ll i = 0; i < n; ++i) {
cin >> he[i];
if (i > 1) {
dp[i] = min((dp[i - 2... | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long int
using namespace std;
// vec.back()
main() {
ll n;
cin >> n;
ll he[n] = {0};
ll dp[n] = {0};
for (ll i = 0; i < n; ++i) {
cin >> he[i];
if (i > 1) {
dp[i] = min((dp[i - 2... | [
"call.add",
"call.arguments.change"
] | 954,899 | 954,900 | u645279491 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
using namespace std;
int min(int a, int b) {
if (a > b)
return a;
return b;
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =... | #include <cstdlib>
#include <iostream>
using namespace std;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =... | [
"control_flow.return.add"
] | 954,905 | 954,906 | u445037732 | cpp |
p03160 | //@author : |< U $ |-|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define vi vector<long long>
#define pb push_back
#define pop pop_back
#define pi pair<long long, lo... | //@author : |< U $ |-|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define vi vector<long long>
#define pb push_back
#define pop pop_back
#define pi pair<long long, lo... | [
"identifier.change"
] | 954,907 | 954,908 | u403552126 | cpp |
p03160 | #include "algorithm"
#include "cstring"
#include "ctime"
#include "iostream"
#include "map"
#include "math.h"
#include "numeric"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>... | #include "algorithm"
#include "cstring"
#include "ctime"
#include "iostream"
#include "map"
#include "math.h"
#include "numeric"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>... | [
"call.remove"
] | 954,942 | 954,943 | u519398162 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], c[n], i;
for (i = 0; i < n; i++)
cin >> h[i];
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
c[i] =
max(abs(h[i] - h[i - 1]) + c[i - 1], abs(h[i] - h[i - 2]) + c[i - 2]);
}
cout << c[n -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], c[n], i;
for (i = 0; i < n; i++)
cin >> h[i];
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
c[i] =
min(abs(h[i] - h[i - 1]) + c[i - 1], abs(h[i] - h[i - 2]) + c[i - 2]);
}
cout << c[n -... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,944 | 954,945 | u769493696 | cpp |
p03160 | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
typedef long long ll;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
using namespace std;
// using namespace __gnu_pbds;
// template<typename... | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
typedef long long ll;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
using namespace std;
// using namespace __gnu_pbds;
// template<typename... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,946 | 954,947 | u815813121 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define mod 1000000007
#define pii pair<int, int>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define forn(i, s, e) for (int i = s; i <= e; i++)
#define fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define mod 1000000007
#define pii pair<int, int>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define forn(i, s, e) for (int i = s; i <= e; i++)
#define fo... | [
"call.remove"
] | 954,956 | 954,957 | u809490696 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n + 3);
rep(i, n) cin >> h[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> h(n + 3);
rep(i, n) cin >> h[i];
... | [
"literal.number.change",
"call.arguments.change"
] | 954,960 | 954,961 | u274883254 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
// chMIN
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
// chMIN
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 954,962 | 954,963 | u454081619 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 954,965 | 954,966 | u228475480 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | [
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 954,977 | 954,978 | u878024225 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 60;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 30;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 954,979 | 954,980 | u424602097 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 60;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (in i = 0; i < (in)(n); i++)
const double PI = 3.14159265358979323846;
const int64_t waru = 1000000007;
const in INF = 1 << 30;
bool chmin(in &a, in b) {
if (a > b) {
a = b;
return true;
... | [
"literal.number.change",
"expression.operation.binary.change"
] | 954,981 | 954,980 | u424602097 | cpp |
p03160 | // frog1 problem
#include <iostream>
using namespace std;
int mini(int a, int b) {
if (a < b)
return a;
else
return b;
}
int modo(int a) {
if (a >= 0)
return a;
else
return -1 * a;
}
int main() {
int n;
cin >> n;
int array[n];
for (int i = 0; i < n; i++)
cin >> array[i];
int dp[n];... | // frog1 problem
#include <iostream>
using namespace std;
int mini(int a, int b) {
if (a < b)
return a;
else
return b;
}
int modo(int a) {
if (a >= 0)
return a;
else
return -1 * a;
}
int main() {
int n;
cin >> n;
int array[n];
for (int i = 0; i < n; i++)
cin >> array[i];
int dp[n];... | [
"variable_access.subscript.index.change",
"io.output.change"
] | 954,984 | 954,985 | u478964347 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define... | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,986 | 954,987 | u242049402 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <s... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 954,994 | 954,995 | u122292453 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, h[n], dp[n];
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, h[100010], dp[100010];
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; ++i) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 954,996 | 954,997 | u867806614 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define fop(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
ll dp[1000001];
ll h[2000001];
ll dpp(ll n) {
if (dp[n] != -1)
return dp[n];
dp[n] =
min(abs(h[n] - h[n - 1]) + dpp(n - 1), abs(h[n] - h[n - 2]) + dpp(n - 2));
return dp[n];
}
int main() {
... | #include <bits/stdc++.h>
#define ll long long
#define fop(i, m, n) for (ll i = m; i < n; i++)
using namespace std;
ll dp[1000001];
ll h[2000001];
ll dpp(ll n) {
if (dp[n] != -1)
return dp[n];
dp[n] =
min(abs(h[n] - h[n - 1]) + dpp(n - 1), abs(h[n] - h[n - 2]) + dpp(n - 2));
return dp[n];
}
int main() {
... | [
"literal.number.change",
"assignment.value.change"
] | 954,998 | 954,999 | u494192771 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec;
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
if (j > 2)
dp[j] = min(dp[j - 1] + abs(vec[j - 1] - vec[j - 2]),
dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
if (j > 2)
dp[j] = min(dp[j - 1] + abs(vec[j - 1] - vec[j - 2]),
... | [] | 955,002 | 955,003 | u694116078 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = (1LL << 60);
int chmin(ll x, int y) {
if (x > y)
return y;
return x;
}
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<ll> dp(100010, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF = (1LL << 60);
int chmin(ll x, int y) {
if (x > y)
return y;
return x;
}
int main() {
int N;
cin >> N;
vector<int> v;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<ll> dp(100010, ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,008 | 955,009 | u086063386 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for... | [
"call.add",
"call.arguments.change"
] | 955,010 | 955,011 | u410506856 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define Add_Speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define ins insert
#define pb push_back
#define pf push_front
#define mp make_pair
#define f firs... | #include <bits/stdc++.h>
#define ll long long
#define Add_Speed \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#define ins insert
#define pb push_back
#define pf push_front
#define mp make_pair
#define f firs... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,012 | 955,013 | u122777146 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> h(n);
vector<long long> dp(n, 1e18);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i +... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> h(n);
vector<long long> dp(n, 1e18);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i +... | [
"expression.operation.binary.remove"
] | 955,014 | 955,015 | u759497274 | cpp |
p03160 | // Vivek Rai
// Blazer_007
#include <bits/stdc++.h>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mp... | // Vivek Rai
// Blazer_007
#include <bits/stdc++.h>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mp... | [] | 955,022 | 955,023 | u956259660 | cpp |
p03160 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
rep(i, n) cin >> h.at(i);
vector<int> dp(n, 0);
dp.at(1) = h.... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
rep(i, n) cin >> h.at(i);
vector<int> dp(n, 0);
dp.at(1) = ab... | [
"call.add",
"call.arguments.change"
] | 955,024 | 955,025 | u628597699 | cpp |
p03160 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define srep(i, s, t) for (int i = (s); i < (t); ++i)
#define rng(obj) (obj).begin(), (obj).end()
#define maxs(x, y) (x = max... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rrep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define srep(i, s, t) for (int i = (s); i < (t); ++i)
#define rng(obj) (obj).begin(), (obj).end()
#define maxs(x, y) (x = max... | [] | 955,026 | 955,027 | u954176652 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int dp[1000000];
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 999999999999999;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (dp[i] > dp[i - 1] + llabs(a[i] - a[i - 1])) {
dp[i]... | #include <iostream>
#include <vector>
using namespace std;
long long dp[1000000];
int main() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 100000000000;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (dp[i] > dp[i - 1] + llabs(a[i] - a[i - 1])) {
dp... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 955,032 | 955,033 | u001858868 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
int h[100005];
int c[100005];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
c[1] = 0;
c[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++) {
c[i] = min(c[i - 1] + abs(h[i] - h[i - 1]), c[i - 2] + abs(h[i - 2]));
}
co... | #include "bits/stdc++.h"
using namespace std;
int h[100005];
int c[100005];
int main() {
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
c[1] = 0;
c[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++) {
c[i] =
min(c[i - 1] + abs(h[i] - h[i - 1]), c[i - 2] + abs(h[i] - h[i -... | [
"assignment.change"
] | 955,048 | 955,049 | u836724424 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace... | [
"expression.operation.unary.add"
] | 955,050 | 955,051 | u804262131 | cpp |
p03160 | // g++ -std=c++11 -Wall t.cpp -o test -lm -g
#include <bits/stdc++.h>
#define mod 1000000007
#define Pi 3.14159265358979311599796346854
#define INF 0x3f3f3f3f
#define MAX 400010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int... | // g++ -std=c++11 -Wall t.cpp -o test -lm -g
#include <bits/stdc++.h>
#define mod 1000000007
#define Pi 3.14159265358979311599796346854
#define INF 0x3f3f3f3f
#define MAX 400010
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int... | [
"literal.number.change",
"function.return_value.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 955,052 | 955,053 | u475175114 | cpp |
p03160 | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cs... | [
"call.add",
"call.arguments.change"
] | 955,060 | 955,061 | u685346012 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i;
cin >> n;
ll h[n], dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, i;
cin >> n;
ll h[n], dp[n];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i -... | [] | 955,068 | 955,069 | u287619443 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
#define sf s.f
#de... | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define pb push_back
#define ins insert
#define pob pop_back
#define er erase
#define emp empty
#define f first
#define s second
#define ff f.f
#define fs f.s
#define sf s.f
#de... | [
"expression.operation.binary.remove",
"assignment.add"
] | 955,075 | 955,076 | u979412452 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
int num[101];
int dp[101];
int main() {
memset(dp, 63, sizeof dp);
cin >> n;
for (int qq = 1; qq <= n; qq++)
cin >> num[qq];
dp[1] = 0;
dp[2] = abs(num[1] - num[2]);
for (int qq = 3; qq <= n; qq++) {
dp[qq] = min(abs(num[qq - 2] - num[qq]) + dp[... | #include <bits/stdc++.h>
using namespace std;
int n;
int num[100001];
int dp[100001];
int main() {
memset(dp, 63, sizeof dp);
cin >> n;
for (int qq = 1; qq <= n; qq++)
cin >> num[qq];
dp[1] = 0;
dp[2] = abs(num[1] - num[2]);
for (int qq = 3; qq <= n; qq++) {
dp[qq] = min(abs(num[qq - 2] - num[qq])... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 955,090 | 955,091 | u391888742 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = ar[0];
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp[i -... | [
"expression.operation.binary.add"
] | 955,092 | 955,093 | u774724188 | cpp |
p03160 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = ar[0];
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n + 1], ar[n + 1];
for (int i = 0; i < n; ++i)
cin >> ar[i];
dp[0] = 0;
dp[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(ar[i] - ar[i - 2]),
dp[i -... | [] | 955,094 | 955,093 | u774724188 | cpp |
p03160 | #pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define se second
#define fi first
#define ss size()
#define pb push_back
#define mp make_pair
#define ins insert
#... | #pragma comment(linker, "/stack:20000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define se second
#define fi first
#define ss size()
#define pb push_back
#define mp make_pair
#define ins insert
#... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,095 | 955,096 | u242818056 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n] = {0}, dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ll first = abs(arr[i - 1] - arr[i]) + dp[i - 1]... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
ll arr[n] = {0}, dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ll first = abs(arr[i - 1] - arr[i]) + dp[i - 1]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 955,107 | 955,108 | u091412362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 1] + abs(a[i] - a[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,109 | 955,110 | u803405081 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define INF 1e9 + 7
#define mp make_pair
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
typedef long long int lint;
typedef unsigned long long int ulint;
int main() {
int n;
cin >> n... | #include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define INF 1e9 + 7
#define mp make_pair
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
typedef long long int lint;
typedef unsigned long long int ulint;
int main() {
int n;
cin >> n... | [
"call.add",
"call.arguments.change"
] | 955,111 | 955,112 | u681511186 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, i;
cin >> N;
long long int arr[N];
long long int s[N];
cin >> arr[0];
s[0] = arr[0];
cin >> arr[1];
s[1] = abs(arr[1] - arr[0]);
for (i = 2; i < N; ++i) {
cin >> arr[i];
s[i] = min(abs(arr[i] - arr[i - 1]) + s[i - 1],
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, i;
cin >> N;
long long int arr[N];
long long int s[N];
cin >> arr[0];
s[0] = 0;
cin >> arr[1];
s[1] = abs(arr[1] - arr[0]);
for (i = 2; i < N; ++i) {
cin >> arr[i];
s[i] = min(abs(arr[i] - arr[i - 1]) + s[i - 1],
... | [] | 955,114 | 955,115 | u034821192 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.begin()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typed... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define all(x) x.begin(), x.begin()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define reps(i, m, n) for (int i = m; i <= n; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typed... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 955,123 | 955,124 | u671257784 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).rend()
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
const int inf = 1e9;
const int mod = 1e9 + 7;
vi dp(100005, inf);
int main() ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).rend()
typedef vector<int> vi;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
const int inf = 1e9;
const int mod = 1e9 + 7;
vi dp(100005, inf);
int main() ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 955,127 | 955,128 | u876386943 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define OK puts("OK");
#define sz(s) (int)s.size()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define rep(i, n) for (i = 0; i < (n); ++i)
#def... | #include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define OK puts("OK");
#define sz(s) (int)s.size()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define rep(i, n) for (i = 0; i < (n); ++i)
#def... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 955,131 | 955,132 | u526671873 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int answer = 0;
vector<int> dp(N + 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int answer = 0;
vector<int> dp(N + 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= N; i++) {
dp[i] =
min(... | [
"assignment.change"
] | 955,150 | 955,151 | u046482892 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
temp... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
template <typename T> void view(T cont) { std::cout << cont << std::endl; }
template <typename T> void view(T *cont, ll sz) {
rep(i, sz) std::cout << cont[i] << " ";
std::cout << std::endl;
}
temp... | [
"call.remove"
] | 955,156 | 955,157 | u998880072 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
//#define Fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#define... | #include <bits/stdc++.h>
using namespace std;
//#define Fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
typedef vector<int> Vl;
typedef pair<int, int> pii;
typedef vector<pii> Vll;
#define S second
#define F first
#define mp make_pair
#define ms(x, y) memset(x, y, sizeof(x))
#define... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 955,162 | 955,163 | u645644658 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, p[1000000], dp[1000000];
long long int solve(int i) {
int ans;
if (i >= n - 1)
return 0;
if (i == (n - 1))
return dp[i] = abs(p[i + 1] - p[i]);
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(p[i + 2] - p[i]) + solve(i + 2),
... | #include <bits/stdc++.h>
using namespace std;
int n, p[1000000], dp[1000000];
long long int solve(int i) {
int ans;
if (i >= n)
return 0;
if (i == (n - 1))
return dp[i] = abs(p[i + 1] - p[i]);
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(p[i + 2] - p[i]) + solve(i + 2),
... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.ch... | 955,166 | 955,167 | u049719575 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = a[2] - a[1];
for (int i = 3; i <= n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= 2; j++) {
mn = min(mn, dp[i - j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= 2; j++) {
mn = min(mn, dp[... | [
"call.add",
"call.arguments.change"
] | 955,169 | 955,170 | u040130608 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
vector<long long int> a, b;
a.resize(n);
b.resize(n);
for (i = 0; i < n; i++)
cin >> a[i];
b[0] = 0;
b[1] = a[1] - a[0];
for (i = 2; i < n; i++)
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i;
cin >> n;
vector<long long int> a, b;
a.resize(n);
b.resize(n);
for (i = 0; i < n; i++)
cin >> a[i];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), ... | [
"call.add",
"call.arguments.change"
] | 955,171 | 955,172 | u364101948 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int b = abs(arr[i] - arr[i - 2] +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int a = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int b = abs(arr[i] - arr[i - 2]) ... | [
"call.arguments.change",
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove"
] | 955,179 | 955,180 | u934892029 | cpp |
p03160 | #include <bits/stdc++.h>
#define M 500005
using namespace std;
int f[M], a[M], n;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
f[1] = abs(a[0] - a[1]);
for (int i = 2; i <= n; ++i) {
f[i] =
min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2]));
}
cou... | #include <bits/stdc++.h>
#define M 500005
using namespace std;
int f[M], a[M], n;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
f[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; ++i) {
f[i] =
min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2]));
}
cout ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 955,189 | 955,190 | u865020437 | cpp |
p03160 | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", "r")) {
freopen("A.INP", "r", stdin);
freopen(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if (fopen("A.INP", "r")) {
freopen("A.INP", "r", stdin);
freopen(... | [
"expression.operation.binary.remove",
"assignment.add"
] | 955,191 | 955,192 | u506628560 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | [
"literal.number.change",
"call.arguments.change"
] | 955,193 | 955,194 | u895971408 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
using namespace std;
int main() {
read;
write;
int n;
cin >> n;
int h[n], ans[n];
for (int i = 0; i < n... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
using namespace std;
int main() {
// read;
// write;
int n;
cin >> n;
int h[n], ans[n];
for (int i = 0;... | [] | 955,195 | 955,196 | u089012446 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define int long long
using namespace std;
const int INF = 1 << 29;
const int N_MAX = 100000;
int N;
vector<int> h;
int dp[N_MAX];
// dp[i]:足場i(0-base)にたどり着くまでの最小コスト
signed main() {
cin >> N;
h.resize(N);
REP(i, N) cin >> ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define int long long
using namespace std;
const int INF = 1 << 29;
const int N_MAX = 100000;
int N;
vector<int> h;
int dp[N_MAX];
// dp[i]:足場i(0-base)にたどり着くまでの最小コスト
signed main() {
cin >> N;
h.resize(N);
REP(i, N) cin >> ... | [
"assignment.variable.change",
"identifier.change",
"call.add",
"call.arguments.change"
] | 955,197 | 955,198 | u203033720 | cpp |
p03160 | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | [
"call.add",
"call.arguments.change"
] | 955,199 | 955,200 | u753523037 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.