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 |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << endl
#define N 1111111
#define mod 1000000007
#define rt return
#define inf 12345678908761
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("Ulug'bek","r",stdin);
// freopen("Abdimanabov","w",stdout);
int n, k;
cin >> n >> k;
vector<int> v(n), ans(n, INT_MAX);
for (auto &x : v)
cin >> x;
ans[0] = 0;
rep(i, 2, n) rep(j, 1, k + 1) if (i - j >= 0)
minn(ans[i], abs(v[i] - v[i - k]) + ans[i - k]);
cout << ans[n - 1];
rt 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << endl
#define N 1111111
#define mod 1000000007
#define rt return
#define inf 12345678908761
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("Ulug'bek","r",stdin);
// freopen("Abdimanabov","w",stdout);
int n, k;
cin >> n >> k;
vector<int> v(n), ans(n, INT_MAX);
for (auto &x : v)
cin >> x;
ans[0] = 0;
rep(i, 1, n) rep(j, 1, k + 1) if (i - j >= 0)
minn(ans[i], abs(v[i] - v[i - j]) + ans[i - j]);
cout << ans[n - 1];
rt 0;
}
| [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 961,377 | 961,378 | u208956581 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define infint 0x7fffffff // 32-bit int
#define ninfint 0x80000000
#define EPS 1e-9
#define mp(A, B) make_pair(A, B)
#define pb push_back
#define pque priority_queue
#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define lowBit(S) (S & (-S))
#define setAll(S, n) (S = (1 << n) - 1)
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
#define endl '\n'
int N, K;
int H[100000], dp[100000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int min_j = i - 1, min_cost = dp[min_j] + abs(H[min_j] - H[i]);
for (int j = i - 2; j >= i - 1 - K + 1; j--) {
if (dp[j] + abs(H[j] - H[i]) < min_cost) {
min_j = j;
min_cost = dp[min_j] + abs(H[min_j] - H[i]);
}
}
dp[i] = min_cost;
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define infint 0x7fffffff // 32-bit int
#define ninfint 0x80000000
#define EPS 1e-9
#define mp(A, B) make_pair(A, B)
#define pb push_back
#define pque priority_queue
#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 << j))
#define toggleBit(S, j) (S ^= (1 << j))
#define lowBit(S) (S & (-S))
#define setAll(S, n) (S = (1 << n) - 1)
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
#define endl '\n'
int N, K;
int H[100000], dp[100000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int min_j = i - 1, min_cost = dp[min_j] + abs(H[min_j] - H[i]);
for (int j = i - 2; j >= i - 1 - K + 1 && j >= 0; j--) {
if (dp[j] + abs(H[j] - H[i]) < min_cost) {
min_j = j;
min_cost = dp[min_j] + abs(H[min_j] - H[i]);
}
}
dp[i] = min_cost;
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,383 | 961,384 | u245704078 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define lli long long int
#define f first
#define s second
#define sc(n) scanf("%d", &n);
#define scl(n) scanf("%lld", &n);
#define pr(n) printf("%d", n);
#define prl(n) printf("%lld", n);
#define nl printf("\n");
#define all(c) (c).begin(), (c).end()
#define sz(a) int((a).size())
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define tr(c, i) for (typeof((c).begin() i = (c).begin(); i != (c).end(); i++))
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
int n, k;
cin >> n >> k;
int arr[111111];
FN(i, n) { cin >> arr[i + 1]; }
int cost[111111];
cost[1] = 0;
cost[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int tmp = max(i - k, 1);
int cst = 111111;
for (int j = i - 1; j >= tmp; j--)
cst = min(cst, cost[j] + abs(arr[i] - arr[j]));
cost[i] = cst;
}
cout << cost[n];
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define lli long long int
#define f first
#define s second
#define sc(n) scanf("%d", &n);
#define scl(n) scanf("%lld", &n);
#define pr(n) printf("%d", n);
#define prl(n) printf("%lld", n);
#define nl printf("\n");
#define all(c) (c).begin(), (c).end()
#define sz(a) int((a).size())
#define FN(i, n) for (int i = 0; i < (int)(n); ++i)
#define FEN(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define tr(c, i) for (typeof((c).begin() i = (c).begin(); i != (c).end(); i++))
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
void optimizeIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
int n, k;
cin >> n >> k;
int arr[111111];
FN(i, n) { cin >> arr[i + 1]; }
int cost[111111];
cost[1] = 0;
cost[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int tmp = max(i - k, 1);
int cst = 1000000010;
// cout << cst;
for (int j = i - 1; j >= tmp; j--)
cst = min(cst, cost[j] + abs(arr[i] - arr[j]));
cost[i] = cst;
}
cout << cost[n];
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 961,391 | 961,392 | u032692765 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 100005;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a[N], dp[N], K;
cin >> n >> K;
dp[0] = dp[1] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i == 1) {
continue;
}
dp[i] = 2 * 1e9;
for (int j = i - 1; j >= max(i - K, 0); j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
cout << dp[n];
return 0;
}
| #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 100005;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a[N], dp[N], K;
cin >> n >> K;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i == 1) {
continue;
}
dp[i] = 2 * 1e9;
for (int j = i - 1; j >= max(i - K, 1); j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
cout << dp[n];
return 0;
}
| [
"assignment.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,395 | 961,396 | u895595177 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(dp[1] - dp[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 1; j <= b; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(n[i] - n[i - j]));
}
}
cout << dp[a - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(n[1] - n[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 1; j <= b; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(n[i] - n[i - j]));
}
}
cout << dp[a - 1];
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,397 | 961,398 | u759515768 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(dp[1] - dp[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 2; j <= b; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(n[i] - n[i - j]));
}
}
cout << dp[a - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(n[1] - n[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 1; j <= b; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(n[i] - n[i - j]));
}
}
cout << dp[a - 1];
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,399 | 961,398 | u759515768 | cpp |
p03161 | // Resting_Prince
#include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define sv(v) \
sort(all(v)); \
reverse(all(v))
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mk make_pair
#define en '\n'
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double ld;
int main() {
ll n, h[100005], i, j, k, l, dp[100005];
cin >> n >> k;
rep(i, 0, n - 1) cin >> h[i + 1], dp[i + 1] = inf;
dp[0] = 0;
dp[1] = 0;
rep(i, 1, n - 2) {
rep(j, 1, k) dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
cout << dp[n];
return 0;
}
| // Resting_Prince
#include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define sv(v) \
sort(all(v)); \
reverse(all(v))
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mk make_pair
#define en '\n'
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double ld;
int main() {
ll n, h[200005], i, j, k, l, dp[200005];
cin >> n >> k;
rep(i, 0, n - 1) cin >> h[i + 1], dp[i + 1] = inf;
dp[0] = 0;
dp[1] = 0;
rep(i, 1, n) {
rep(j, 1, k) dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 961,402 | 961,401 | u640930204 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort(ALL(c), greater<int>());
#define fi first
#define se second
int INF = 1e9 + 7;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, k;
vi h;
int dp[100001] = {};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
h.pb(0);
rep(i, 0, n) {
int H;
cin >> H;
h.pb(H);
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
rep(i, 3, n + 1) {
rep(j, 1, k + 1) {
if (i - j >= 0) {
if (dp[i] == 0)
dp[i] = dp[i - j] + abs(h[i] - h[i - j]);
else
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort(ALL(c), greater<int>());
#define fi first
#define se second
int INF = 1e9 + 7;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, k;
vi h;
int dp[100001] = {};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
h.pb(0);
rep(i, 0, n) {
int H;
cin >> H;
h.pb(H);
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
rep(i, 3, n + 1) {
rep(j, 1, k + 1) {
if (i - j >= 1) {
if (j == 1)
dp[i] = dp[i - j] + abs(h[i] - h[i - j]);
else
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 961,405 | 961,406 | u961528573 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort(ALL(c), greater<int>());
#define fi first
#define se second
int INF = 1e9 + 7;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, k;
vi h;
int dp[100001] = {};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
h.pb(0);
rep(i, 0, n) {
int H;
cin >> H;
h.pb(H);
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
rep(i, 3, n + 1) {
rep(j, 1, k + 1) {
if (i - j >= 0) {
if (j == 1)
dp[i] = dp[i - j] + abs(h[i] - h[i - j]);
else
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTG(c) sort(ALL(c), greater<int>());
#define fi first
#define se second
int INF = 1e9 + 7;
typedef pair<int, int> P;
typedef vector<int> vi;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, k;
vi h;
int dp[100001] = {};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
h.pb(0);
rep(i, 0, n) {
int H;
cin >> H;
h.pb(H);
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
rep(i, 3, n + 1) {
rep(j, 1, k + 1) {
if (i - j >= 1) {
if (j == 1)
dp[i] = dp[i - j] + abs(h[i] - h[i - j]);
else
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 961,407 | 961,406 | u961528573 | cpp |
p03161 | // ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define debug(x) cout << #x << ": " << x << endl
#define ull unsigned long long int
#define ll long long int
#define ld double
#define ui unsigned int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1415926535897932385
#define INF 1e18
#define EPS 1e-7
#define MAXN 1000005
#define MOD 1000000007
// ★★ ASHWINI SHARMA ★★
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll exp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
fastio;
int n, k;
cin >> n >> k;
ll h[n];
rep(i, n) cin >> h[i];
ll dp[n] = {0};
dp[0] = 0;
fr(i, 1, n - 1) {
ll min = abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 1; j <= k; j++) {
if (j >= 0) {
ll x = abs(h[i] - h[i - j]);
x += dp[i - j];
if (x < min)
min = x;
} else
break;
}
dp[i] = min;
}
cout << dp[n - 1];
return 0;
} | // ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define debug(x) cout << #x << ": " << x << endl
#define ull unsigned long long int
#define ll long long int
#define ld double
#define ui unsigned int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1415926535897932385
#define INF 1e18
#define EPS 1e-7
#define MAXN 1000005
#define MOD 1000000007
// ★★ ASHWINI SHARMA ★★
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll exp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
fastio;
int n, k;
cin >> n >> k;
ll h[n];
rep(i, n) cin >> h[i];
ll dp[n] = {0};
dp[0] = 0;
fr(i, 1, n - 1) {
ll min = abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
ll x = abs(h[i] - h[i - j]);
x += dp[i - j];
if (x < min)
min = x;
} else
break;
}
dp[i] = min;
}
cout << dp[n - 1];
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,410 | 961,411 | u909051929 | cpp |
p03161 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
using pii = std::pair<int, int>;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); <-- PUT
// IN main()/solve()!
using namespace std;
int n, k, a[100005], ans[100105] = {0};
class BFrog2 {
public:
void solve(std::istream &in, std::ostream &out) {
in >> n >> k;
f(i, 0, n) {
in >> a[i];
ans[i] = (int)1e18;
}
ans[0] = 0;
f(i, 0, n) f(j, 1, min(i + k + 1, n - i + 1)) ans[i + j] =
min(ans[i + j], ans[i] + abs(a[i + j] - a[i]));
out << ans[n - 1] << "\n";
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
BFrog2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
using pii = std::pair<int, int>;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); <-- PUT
// IN main()/solve()!
using namespace std;
int n, k, a[100005], ans[100105] = {0};
class BFrog2 {
public:
void solve(std::istream &in, std::ostream &out) {
in >> n >> k;
f(i, 0, n) {
in >> a[i];
ans[i] = (int)1e18;
}
ans[0] = 0;
f(i, 0, n) f(j, 1, min(k + 1, n - i + 1)) ans[i + j] =
min(ans[i + j], ans[i] + abs(a[i + j] - a[i]));
out << ans[n - 1] << "\n";
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
BFrog2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"expression.operation.binary.remove"
] | 961,412 | 961,413 | u185736584 | cpp |
p03161 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
using pii = std::pair<int, int>;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); <-- PUT
// IN main()/solve()!
using namespace std;
int n, k, a[100005], ans[100105] = {0};
class BFrog2 {
public:
void solve(std::istream &in, std::ostream &out) {
in >> n >> k;
f(i, 0, n) {
in >> a[i];
ans[i] = (int)1e18;
}
ans[0] = 0;
f(i, 0, n) f(j, 1, min(i + k + 1, n)) ans[i + j] =
min(ans[i + j], ans[i] + abs(a[i + j] - a[i]));
out << ans[n - 1] << "\n";
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
BFrog2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1000000007
using pii = std::pair<int, int>;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); <-- PUT
// IN main()/solve()!
using namespace std;
int n, k, a[100005], ans[100105] = {0};
class BFrog2 {
public:
void solve(std::istream &in, std::ostream &out) {
in >> n >> k;
f(i, 0, n) {
in >> a[i];
ans[i] = (int)1e18;
}
ans[0] = 0;
f(i, 0, n) f(j, 1, min(k + 1, n - i + 1)) ans[i + j] =
min(ans[i + j], ans[i] + abs(a[i + j] - a[i]));
out << ans[n - 1] << "\n";
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
BFrog2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"expression.operation.binary.remove",
"assignment.change"
] | 961,414 | 961,413 | u185736584 | cpp |
p03161 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const double pi = acos(-1.0);
// memset ( a , 0 , n * sizeof(ll) ) ;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define sl(n) scanf("%lld", &n)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define f(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rf(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
#define ms(a, b) memset((a), (b), sizeof(a))
#define max(a, b) ((a > b) ? (a) : (b))
#define min(a, b) ((a < b) ? (a) : (b))
#define vec(g1) \
int temp; \
cin >> temp; \
g1, push_back(temp);
#define abs(x) ((x < 0) ? (-(x)) : (x))
#define MAX 100005
#define inf LLONG_MAX
#define MIN INT_MIN
// typedef
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int, int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll powmod(ll a, ll b) {
ll res = 1;
if (a >= mod)
a %= mod;
for (; b; b >>= 1) {
if (b & 1)
res = res * a;
if (res >= mod)
res %= mod;
a = a * a;
if (a >= mod)
a %= mod;
}
return res;
}
// ll fac[200005];
// ll inverse(ll n){return powmod(n, mod-2);}
// ll nCr(ll n, ll r){return (fac[n] * inverse(fac[r]) % mod * inverse(fac[n-r])
// % mod) % mod;}
/**.................................................................................................................................*/
int main() {
boost;
ll n, k;
cin >> n >> k;
ll a[n];
f(i, 0, n) cin >> a[i];
ll dp[n];
f(i, 0, n) { dp[i] = MAX; }
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = max(i - k, 0); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const double pi = acos(-1.0);
// memset ( a , 0 , n * sizeof(ll) ) ;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define sl(n) scanf("%lld", &n)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define f(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rf(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
#define ms(a, b) memset((a), (b), sizeof(a))
#define max(a, b) ((a > b) ? (a) : (b))
#define min(a, b) ((a < b) ? (a) : (b))
#define vec(g1) \
int temp; \
cin >> temp; \
g1, push_back(temp);
#define abs(x) ((x < 0) ? (-(x)) : (x))
#define MAX inf
#define inf LLONG_MAX
#define MIN INT_MIN
// typedef
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int, int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int mod = 1e9 + 7;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll powmod(ll a, ll b) {
ll res = 1;
if (a >= mod)
a %= mod;
for (; b; b >>= 1) {
if (b & 1)
res = res * a;
if (res >= mod)
res %= mod;
a = a * a;
if (a >= mod)
a %= mod;
}
return res;
}
// ll fac[200005];
// ll inverse(ll n){return powmod(n, mod-2);}
// ll nCr(ll n, ll r){return (fac[n] * inverse(fac[r]) % mod * inverse(fac[n-r])
// % mod) % mod;}
/**.................................................................................................................................*/
int main() {
boost;
ll n, k;
cin >> n >> k;
ll a[n];
f(i, 0, n) cin >> a[i];
ll dp[n];
f(i, 0, n) { dp[i] = MAX; }
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = max(i - k, 0); j <= i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"preprocessor.define.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,415 | 961,416 | u645188582 | cpp |
p03161 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) \
for (ll i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define rep(n) for (ll i = 0; i < n; i++)
#define fr(i, j, k) for (ll i = j; i < k; i++)
#define FR(i, j, k) for (ll i = j; i >= 0; i--)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define INF 1000000
#define xx first
#define yy second
#define pl cout << endl;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define deb(x) cout << #x << " = " << x << endl;
#define er(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...);
}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
ll n, k;
cin >> n >> k;
vl v(n);
invec(v, n);
vl dp(n);
fill(all(dp), LLONG_MAX);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j < 0) {
break;
}
dp[i] = min(dp[i], abs(v[i] - v[i - k]) + dp[i - k]);
}
// dp[i]=min(abs(v[i]-v[i-2])+dp[i-2],abs(v[i]-v[i-1])+dp[i-1]);
}
cout << dp[n - 1] << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) \
for (ll i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define rep(n) for (ll i = 0; i < n; i++)
#define fr(i, j, k) for (ll i = j; i < k; i++)
#define FR(i, j, k) for (ll i = j; i >= 0; i--)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define INF 1000000
#define xx first
#define yy second
#define pl cout << endl;
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define deb(x) cout << #x << " = " << x << endl;
#define er(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...);
}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
ll n, k;
cin >> n >> k;
vl v(n);
invec(v, n);
vl dp(n);
fill(all(dp), LLONG_MAX);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j < 0) {
break;
}
dp[i] = min(dp[i], abs(v[i] - v[i - j]) + dp[i - j]);
}
// dp[i]=min(abs(v[i]-v[i-2])+dp[i-2],abs(v[i]-v[i-1])+dp[i-1]);
}
cout << dp[n - 1] << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 961,417 | 961,418 | u141448608 | cpp |
p03161 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, n, i, j, k, x, y, c = 0, m;
ll a[100007];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll mi;
ll res[100007];
res[0] = 0;
res[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
ll cnt = 0;
mi = INT_MAX;
for (j = 1; j <= k; j++) {
if (j < 0) {
break;
}
mi = min(mi, res[i - j] + abs(a[i] - a[i - j]));
}
res[i] = mi;
}
cout << res[n - 1] << "\n";
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, n, i, j, k, x, y, c = 0, m;
ll a[100007];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll mi;
ll res[100007];
res[0] = 0;
res[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
ll cnt = 0;
mi = INT_MAX;
for (j = 1; j <= k; j++) {
if ((i - j) < 0) {
break;
}
mi = min(mi, res[i - j] + abs(a[i] - a[i - j]));
}
res[i] = mi;
}
cout << res[n - 1] << "\n";
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,419 | 961,420 | u718495117 | cpp |
p03161 | #include <iostream>
#include <string>
#include <vector>
#define debug(var) \
do { \
std::cout << #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);
}
}
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n + 1);
vector<int> h(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = abs(h[i - 1] - h[i]) + dp[i - 1];
for (int l = 1; l <= min(k, i); ++l) {
dp[i] = min(dp[i], abs(h[i - l] - h[i]) + dp[i - l]);
}
}
cout << dp[n] << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#define debug(var) \
do { \
std::cout << #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);
}
}
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n + 1);
vector<int> h(n + 1);
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = abs(h[i - 1] - h[i]) + dp[i - 1];
for (int l = 1; l <= min(k, i - 1); ++l) {
dp[i] = min(dp[i], abs(h[i - l] - h[i]) + dp[i - l]);
}
}
cout << dp[n] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,427 | 961,428 | u657541767 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + K);
vector<int> cost(N + K, 100000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
for (int i = 0; i < N; i++) {
for (int n = 1; n <= K; n++) {
cost[i + n] = min(cost[i + n], cost[i] + abs(h[i] - h[i + n]));
}
}
cout << cost[N - 1] << endl;
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + K);
vector<int> cost(N + K, 999999999);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
for (int i = 0; i < N; i++) {
for (int n = 1; n <= K; n++) {
cost[i + n] = min(cost[i + n], cost[i] + abs(h[i] - h[i + n]));
}
}
cout << cost[N - 1] << endl;
} | [
"import.add",
"literal.number.change",
"call.arguments.change"
] | 961,451 | 961,452 | u356117208 | cpp |
p03161 | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 1000000007
#define endl '\n'
using namespace std;
void fastio() {
ironman
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
ll parent[100005];
ll find(ll a) {
std::vector<ll> v;
while (parent[a] > 0) {
v.push_back(a);
a = parent[a];
}
for (ll i = 0; i < v.size(); i++)
parent[v[i]] = a;
return a;
}
bool prime[100005];
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
void union1(ll a, ll b) {
a = find(a);
b = find(b);
if (a != b) {
parent[a] = min(parent[a], parent[b]);
parent[b] = a;
}
}
ll n, k;
ll arr[100002];
ll dp[100002];
int main() {
memset(dp, -1, sizeof(dp));
fastio();
// ll n;
cin >> n >> k;
// ll arr[n];
for (ll i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
for (ll i = 1; i < n; i++) {
if (i - 1 >= 0)
dp[i] = dp[i - 1] + abs(arr[i] - arr[i - 1]);
for (ll j = i - 2; j >= 0 && i - j <= k; j--) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[n - 1] << endl;
} | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define MOD 1000000007
#define endl '\n'
using namespace std;
void fastio() {
ironman
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
ll parent[100005];
ll find(ll a) {
std::vector<ll> v;
while (parent[a] > 0) {
v.push_back(a);
a = parent[a];
}
for (ll i = 0; i < v.size(); i++)
parent[v[i]] = a;
return a;
}
bool prime[100005];
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
}
void union1(ll a, ll b) {
a = find(a);
b = find(b);
if (a != b) {
parent[a] = min(parent[a], parent[b]);
parent[b] = a;
}
}
ll n, k;
ll arr[100002];
ll dp[100002];
int main() {
memset(dp, -1, sizeof(dp));
// fastio();
// ll n;
cin >> n >> k;
// ll arr[n];
for (ll i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
for (ll i = 1; i < n; i++) {
if (i - 1 >= 0)
dp[i] = dp[i - 1] + abs(arr[i] - arr[i - 1]);
for (ll j = i - 2; j >= 0 && i - j <= k; j--) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[n - 1] << endl;
} | [
"call.remove"
] | 961,461 | 961,462 | u374444191 | cpp |
p03161 | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define ll long long int
#define pi 3.1415926536
using namespace std;
void solve() {
ll t, n, m, x, y, z, d, p = 0, b = 0, q, l = INT_MAX, k, mini = 0, prev;
cin >> n >> k;
vector<ll> v(n + 1, 0), dp(n + 1, INT_MAX);
for (ll i = 1; i <= n; i++)
cin >> v[i];
dp[0] = 0;
dp[1] = 0;
for (ll j = 1; j <= n; j++) {
for (ll r = 1; r <= k && (j - r) >= 0; r++)
dp[j] = min(dp[j], dp[j - r] + abs(v[j] - v[j - r]));
}
cout << dp[n] << " ";
}
int main() {
ll t = 1;
while (t--) {
solve();
// cout<<ma<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define ll long long int
#define pi 3.1415926536
using namespace std;
void solve() {
ll t, n, m, x, y, z, d, p = 0, b = 0, q, l = INT_MAX, k, mini = 0, prev;
cin >> n >> k;
vector<ll> v(n + 1, 0), dp(n + 1, INT_MAX);
for (ll i = 1; i <= n; i++)
cin >> v[i];
dp[0] = 0;
dp[1] = 0;
for (ll j = 1; j <= n; j++) {
for (ll r = 1; r <= k && (j - r) >= 1; r++)
dp[j] = min(dp[j], dp[j - r] + abs(v[j] - v[j - r]));
}
cout << dp[n] << " ";
}
int main() {
ll t = 1;
while (t--) {
solve();
// cout<<ma<<endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,465 | 961,466 | u864500649 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ull unsigned long long int
#define ll long long int
#define pb push_back
#define mp make_pair
#define pcc pair<char, char>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<long long int>
#define vc vector<char>
#define clr(a) memset(a, 0, sizeof(a))
using namespace std;
int main() {
ll a, b, c, i, j, k;
cin >> a >> k;
ll arr[a];
ll cost[a];
for (i = 0; i < a; i++)
cin >> arr[i];
cost[0] = 0;
cost[1] = abs(arr[1] - arr[0]);
ll min;
ll price;
for (i = 2; i < a; i++) {
min = cost[i - 1] + abs(arr[i] - arr[i - 1]);
for (j = 2; j <= k; j++) {
price = cost[i - j] + abs(arr[i] - arr[i - j]);
if (price < min)
min = price;
}
cost[i] = min;
}
cout << cost[a - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ull unsigned long long int
#define ll long long int
#define pb push_back
#define mp make_pair
#define pcc pair<char, char>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<long long int>
#define vc vector<char>
#define clr(a) memset(a, 0, sizeof(a))
using namespace std;
int main() {
ll a, b, c, i, j, k;
cin >> a >> k;
ll arr[a];
ll cost[a];
for (i = 0; i < a; i++)
cin >> arr[i];
cost[0] = 0;
cost[1] = abs(arr[1] - arr[0]);
ll min;
ll price;
for (i = 2; i < a; i++) {
min = cost[i - 1] + abs(arr[i] - arr[i - 1]);
for (j = 2; j <= k && j <= i; j++) {
price = cost[i - j] + abs(arr[i] - arr[i - j]);
if (price < min)
min = price;
}
cost[i] = min;
}
cout << cost[a - 1] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 961,469 | 961,470 | u079325146 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 1 << 10;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (auto &x : h) {
cin >> x;
}
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
for (int j = 1; j < min(K + 1, i + 1); ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 10000000000;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (auto &x : h) {
cin >> x;
}
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
for (int j = 1; j < min(K + 1, i + 1); ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 961,485 | 961,484 | u142415823 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 1e5 + 10;
const long long INF = 1LL << 60;
int n, k, h[MAX_N];
long long dp[MAX_N];
int main() {
cin >> n, k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
for (int i = 0; i < MAX_N; ++i) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + k]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 1e5 + 10;
const long long INF = 1LL << 60;
int n, k, h[MAX_N];
long long dp[MAX_N];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
for (int i = 0; i < MAX_N; ++i) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << 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",
"identifier.replace.add",
"literal.replace.remove",... | 961,492 | 961,493 | u835629653 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
// input
ll h[100010];
// DP Table
ll dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
// initialize
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
// First Condition
dp[0] = 0;
// loop
for (int i = 1; i < N; ++i) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
for (int j = 2; j <= K; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
// input
ll h[100010];
// DP Table
ll dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
// initialize
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
// First Condition
dp[0] = 0;
// loop
for (int i = 0; i < N; ++i) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
for (int j = 1; j <= K; ++j) {
chmin(dp[i + j], dp[i] + 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"
] | 961,505 | 961,506 | u920340928 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[100000];
main() {
memset(d, 0, sizeof(d));
ll int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
d[0] = 0;
for (int i = 1; i < k; i++) {
d[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
ll int maxi = inf;
for (int j = 1; j <= k; j++) {
maxi = max(maxi, d[i - j] + abs(h[i] - h[i - j]));
}
d[i] = maxi;
}
cout << d[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[100000];
main() {
memset(d, 0, sizeof(d));
ll int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
d[0] = 0;
for (int i = 1; i < k; i++) {
d[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
ll int maxi = inf;
for (int j = 1; j <= k; j++) {
maxi = min(maxi, d[i - j] + abs(h[i] - h[i - j]));
}
d[i] = maxi;
}
cout << d[n - 1] << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 961,507 | 961,508 | u131565555 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
const int INF = 100000;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n), h(n, 0);
for (int i = 0; i < n; ++i)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
int cost;
int minimum_cost = INF;
int m;
for (int i = 2; i < n; ++i) {
if (i <= k)
m = i;
else
m = k;
for (int j = 1; j <= m; ++j) {
cost = dp[i - j] + abs(h[i] - h[i - j]);
if (cost < minimum_cost)
minimum_cost = cost;
}
dp[i] = minimum_cost;
minimum_cost = INF;
}
cout << dp[n - 1] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1000000000;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n), h(n, 0);
for (int i = 0; i < n; ++i)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
int cost;
int minimum_cost = INF;
int m;
for (int i = 2; i < n; ++i) {
if (i <= k)
m = i;
else
m = k;
for (int j = 1; j <= m; ++j) {
cost = dp[i - j] + abs(h[i] - h[i - j]);
if (cost < minimum_cost)
minimum_cost = cost;
}
dp[i] = minimum_cost;
minimum_cost = INF;
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,514 | 961,512 | u207460172 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
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]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= K; j++) {
if (i - j < 0)
break;
cost = DP[i - K] + abs(h[i] - h[i - K]);
if (cost < min_cost)
min_cost = cost;
}
DP[i] = min_cost;
}
cout << DP[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
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]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= K; j++) {
if (i - j < 0)
break;
cost = DP[i - j] + abs(h[i] - h[i - j]);
if (cost < min_cost)
min_cost = cost;
}
DP[i] = min_cost;
}
cout << DP[N - 1] << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 961,515 | 961,516 | u689245321 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
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]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= K; j++) {
if (i - K < 0)
break;
cost = DP[i - K] + abs(h[i] - h[i - K]);
if (cost < min_cost)
min_cost = cost;
}
DP[i] = min_cost;
}
cout << DP[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
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]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= K; j++) {
if (i - j < 0)
break;
cost = DP[i - j] + abs(h[i] - h[i - j]);
if (cost < min_cost)
min_cost = cost;
}
DP[i] = min_cost;
}
cout << DP[N - 1] << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 961,517 | 961,516 | u689245321 | cpp |
p03161 | #include <cmath>
#include <iostream>
#include <limits>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
for (auto &&hi : h)
std::cin >> hi;
std::vector<int> cost(n, std::numeric_limits<int>::max());
cost[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j < k; ++k) {
const auto ii = i - k - 1;
if (ii < 0)
break;
const auto c = std::abs(h[i] - h[ii]) + cost[ii];
if (cost[i] > c)
cost[i] = c;
}
}
std::cout << cost[n - 1] << std::endl;
} | #include <cmath>
#include <iostream>
#include <limits>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
for (auto &&hi : h)
std::cin >> hi;
std::vector<int> cost(n, std::numeric_limits<int>::max());
cost[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j < k; ++j) {
const auto ii = i - j - 1;
if (ii < 0)
break;
const auto c = std::abs(h[i] - h[ii]) + cost[ii];
if (cost[i] > c)
cost[i] = c;
}
}
std::cout << cost[n - 1] << std::endl;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 961,525 | 961,524 | u217344789 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 2e18;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
else {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
cout << dp[n - 1];
}
}
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 2e18;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
else {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n - 1];
} | [] | 961,544 | 961,545 | u436936051 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N + 1], dp[N + 1];
for (int i = 1; i <= N; ++i) {
cin >> h[i];
dp[i] = 100000;
}
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
for (int j = 1; j <= K; ++j) {
if (i - j > 0)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[N] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int h[N + 1], dp[N + 1];
for (int i = 1; i <= N; ++i) {
cin >> h[i];
dp[i] = 10000000000;
}
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
for (int j = 1; j <= K; ++j) {
if (i - j > 0)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[N] << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 961,583 | 961,584 | u041282550 | cpp |
p03161 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REMOVE(v, n) remove(vector<int> v, v + v.size(), int n)
#define ll long long
#define ull unsigned long long
#define pb(a) push_back(a)
#define INF 999999999
#define V(v, i, j) vector(v.begin() + i, v.begin() + j)
#define SUM(v) FOR(i, 0, v.size())
#define INSERT(va, vb) va.insert(va.end(), vb.begin(), vb.end())
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
// vector< vector<int> > v (size1, vector<int>(size2) );
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
FOR(i, 0, n) cin >> h[i];
vector<ll> dp(n, 0);
FOR(i, 1, n) {
vector<ll> cost = {};
FOR(j, 1, k + 1) {
if (i - j >= 0) {
cost.pb(dp[i - j] + abs(h[i] - h[i - j]));
}
}
ll ans = 100000;
FOR(c, 0, cost.size()) { ans = min(ans, cost[c]); }
dp[i] = ans;
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REMOVE(v, n) remove(vector<int> v, v + v.size(), int n)
#define ll long long
#define ull unsigned long long
#define pb(a) push_back(a)
#define INF 999999999
#define V(v, i, j) vector(v.begin() + i, v.begin() + j)
#define SUM(v) FOR(i, 0, v.size())
#define INSERT(va, vb) va.insert(va.end(), vb.begin(), vb.end())
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
// vector< vector<int> > v (size1, vector<int>(size2) );
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
FOR(i, 0, n) cin >> h[i];
vector<ll> dp(n, 0);
FOR(i, 1, n) {
vector<ll> cost = {};
FOR(j, 1, k + 1) {
if (i - j >= 0) {
cost.pb(dp[i - j] + abs(h[i] - h[i - j]));
}
}
ll ans = 100000000000;
FOR(c, 0, cost.size()) { ans = min(ans, cost[c]); }
dp[i] = ans;
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,590 | 961,591 | u908349502 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, K, i, j, mincost, cost;
int h[100010];
int s[100010] = {};
cin >> N >> K;
mincost = 1e9;
for (i = 1; i <= N; i++) {
cin >> h[i];
}
s[1] = 0, s[2] = abs(h[1] - h[2]);
for (i = 3; i <= N; i++) {
mincost = 1e9;
for (j = 1; j <= K; j++) {
if (i > j) {
cost = abs(h[i] - h[j]);
mincost = min(mincost, s[i - j] + cost);
}
}
s[i] = mincost;
}
cout << s[N] << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, K, i, j, mincost, cost;
int h[100010];
int s[100010] = {};
cin >> N >> K;
mincost = 1e9;
for (i = 1; i <= N; i++) {
cin >> h[i];
}
s[1] = 0, s[2] = abs(h[1] - h[2]);
for (i = 3; i <= N; i++) {
mincost = 1e9;
for (j = 1; j <= K; j++) {
if (i - j > 0) {
cost = abs(h[i] - h[i - j]);
mincost = min(mincost, s[i - j] + cost);
}
}
s[i] = mincost;
} /*
for(int i=1;i<=N;i++){
cout << s[i] << endl;
}*/
cout << s[N] << endl;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 961,603 | 961,604 | u841111730 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 100000;
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1000000000;
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 961,607 | 961,608 | u461415203 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
long long h[100000];
for (int i = 0; i < N; ++i)
cin >> h[i];
long long dp[100100];
for (int i = 0; i < 100100; ++i)
dp[i] = 1 << 60;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= K; ++j) {
long long cost = dp[i] + abs(h[i] - h[i + j]);
dp[i + j] = min(dp[i + j], cost);
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
long long h[100000];
for (int i = 0; i < N; ++i)
cin >> h[i];
long long dp[100100];
for (int i = 0; i < 100100; ++i)
dp[i] = 1LL << 60;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= K; ++j) {
long long cost = dp[i] + abs(h[i] - h[i + j]);
dp[i + j] = min(dp[i + j], cost);
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.type.widen.change"
] | 961,609 | 961,610 | u423405217 | cpp |
p03161 | //配るDPにしたよ
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
long long N, K;
long long h[100110];
long long dp[100110];
const long long inf = 1 << 30;
int main() {
scanf("%Ld %Ld", &N, &K);
for (int i = 0; i < N; i++)
scanf("%Ld", &h[i]);
for (int i = 0; i < N; i++)
dp[i] = inf;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < K + 1; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
printf("%Ld/n", dp[N - 1]);
return 0;
} | //配るDPにしたよ
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
long long N, K;
long long h[100110];
long long dp[100110];
const long long inf = 1 << 30;
int main() {
scanf("%Ld %Ld", &N, &K);
for (int i = 0; i < N; i++)
scanf("%Ld", &h[i]);
for (int i = 0; i < N; i++)
dp[i] = inf;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < K + 1; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
printf("%Ld\n", dp[N - 1]);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 961,631 | 961,632 | u877476774 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
ll dp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 1e18;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
ll dp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 1e18;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j <= 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,633 | 961,634 | u742642200 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/a.in", "r", stdin);
// freopen("../IO/a.in", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::cin, std::cout);
return 0;
}
void solve(std::istream &in, std::ostream &out) {
int n, k;
in >> n >> k;
vector<int> dp(n + 1);
vector<int> h(n);
for (int &i : h) {
in >> i;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = numeric_limits<int>::max();
for (int j = 1; j <= k; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
out << dp[n - 1] << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/a.in", "r", stdin);
// freopen("../IO/a.in", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::cin, std::cout);
return 0;
}
void solve(std::istream &in, std::ostream &out) {
int n, k;
in >> n >> k;
vector<int> dp(n + 1);
vector<int> h(n);
for (int &i : h) {
in >> i;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = numeric_limits<int>::max();
for (int j = 1; j <= min(k, i); ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
out << dp[n - 1] << '\n';
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 961,639 | 961,640 | u478275206 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 0, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | [
"literal.number.change",
"call.arguments.change"
] | 961,646 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 0, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j >= 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,648 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 0, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | [
"literal.number.change",
"call.arguments.change"
] | 961,649 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 0, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 3, k + 2) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,650 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 3, k + 2) if (i - k >= 0) dp[i] =
min(dp[i], dp[i - k] + abs(a[i - k] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 961,651 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - k > 0) dp[i] =
min(dp[i], dp[i - k] + abs(a[i - k] - a[i]));
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fl(i, 3, n + 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j > 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n];
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,652 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n + 1];
fl(i, 0, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
fl(i, 2, n) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - k >= 0) dp[i] =
min(dp[i], dp[i - k] + abs(a[i - k] - a[i]));
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll dp[100005];
int main() {
rkc;
ll n, k;
cin >> n >> k;
ll a[n];
fl(i, 0, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
fl(i, 2, n) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
fl(j, 2, k + 1) if (i - j >= 0) dp[i] =
min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
cout << dp[n - 1];
} | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,653 | 961,654 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, h[100005], dp[100005], j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = 1e15;
for (j = i - 1; j >= i - k; j--) {
// cout<<" j = "<<j<<" dp = "<<dp[j]<<endl;
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
// cout<<" i = "<<i<<" dp = "<<dp[i]<<endl;
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, h[100005], dp[100005], j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = 1e15;
// cout<<" i = "<<i<<"\n";
for (j = i - 1; j >= i - k && j >= 1; j--) {
// cout<<" j = "<<j<<" dp = "<<dp[j]<<endl;
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
// cout<<" i = "<<i<<" dp = "<<dp[i]<<endl<<endl;
}
cout << dp[n] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 961,655 | 961,656 | u094898063 | cpp |
p03161 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long INF = 1LL << 60;
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<long long> dp(N, INF);
for (int i = 0; i < N; i++) {
cin >> h[i];
// dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] ^ h[i]));
}
}
cout << dp[N - 1] << endl;
} |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long INF = 1LL << 60;
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<long long> dp(N + K, INF);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
} | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,659 | 961,660 | u142946678 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 10000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
int main() {
IOS;
lli n, i, j, k;
cin >> n >> k;
lli a[n + k], dp[n + k];
dp[n - 1] = 0;
for (i = 1; i <= k; i++) {
a[n + i] = inf;
dp[n + i] = inf;
}
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n - 2; i >= 0; i--) {
lli mini = inf;
for (j = 1; j <= k; j++) {
mini = min(dp[i + j] + abs(a[i] - a[i + j]), mini);
}
dp[i] = mini;
}
cout << dp[0] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 1000000000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
int main() {
IOS;
lli n, i, j, k;
cin >> n >> k;
lli a[n + k], dp[n + k];
dp[n - 1] = 0;
for (i = 1; i <= k; i++) {
a[n + i - 1] = inf;
dp[n + i - 1] = inf;
}
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = n - 2; i >= 0; i--) {
lli mini = inf;
for (j = 1; j <= k; j++) {
mini = min(dp[i + j] + abs(a[i] - a[i + j]), mini);
}
dp[i] = mini;
}
cout << dp[0] << endl;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"assignment.change"
] | 961,667 | 961,666 | u653046450 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, n) for (int i = a; i < n; i++)
#define pb(v) push_back(v)
int main() {
// code
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n + 3];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < k; i++) {
dp[i] = abs(a[i] - a[0]);
}
for (int i = k; i < n; i++) {
vector<int> v;
for (int j = i - k; j < i;
j++) { // cout<<dp[j]<<"d"<<dp[j]+abs(a[i]-a[j])<<"\n"<<endl;
v.pb(dp[j] + abs(a[i] - a[j]));
}
dp[i] = *min_element(v.begin(), v.end());
// cout<<dp[i]<<"sa";
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, n) for (int i = a; i < n; i++)
#define pb(v) push_back(v)
int main() {
// code
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n + k + 1];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < k; i++) {
dp[i] = abs(a[i] - a[0]);
}
for (int i = k; i < n; i++) {
vector<int> v;
for (int j = i - k; j < i;
j++) { // cout<<dp[j]<<"d"<<dp[j]+abs(a[i]-a[j])<<"\n"<<endl;
v.pb(dp[j] + abs(a[i] - a[j]));
}
dp[i] = *min_element(v.begin(), v.end());
// cout<<dp[i]<<"sa";
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 961,668 | 961,669 | u276156810 | cpp |
p03161 | #if 1
#include <bits/stdc++.h>
using namespace std;
int a[100005], d[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
d[i] = 2e9;
}
d[1] = 0;
d[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i <= k)
break;
d[i] = min(d[i], d[i - j] + abs(a[i] - a[i - j]));
}
// cout << d[i] << " ";
}
printf("%d", d[n]);
}
#endif // 1++
| #if 1
#include <bits/stdc++.h>
using namespace std;
int a[100005], d[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
d[i] = 2e9;
}
d[1] = 0;
d[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i <= j)
break;
d[i] = min(d[i], d[i - j] + abs(a[i] - a[i - j]));
}
// cout << d[i] << " ";
}
printf("%d", d[n]);
}
#endif // 1++ | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 961,670 | 961,671 | u998677610 | cpp |
p03161 | //ライブラリ
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//ユーティリティ
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define rreps(i, n) for (int i = n; i > 0; --i)
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (former > b) {
former = b;
return true;
}
return false;
}
//型
typedef long long int ll;
typedef long long unsigned int ull;
typedef pair<int, int> pairi;
typedef pair<ull, ull> pairull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef priority_queue<int, vi> pq;
typedef priority_queue<int, vi, greater<int>> rpq;
//定数
#define INF (1e9 + 9)
const double pi = (acos(-1));
#define MOD (1e9 + 7)
const double eps = 1e-8;
//セグメント木
//データ構造
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
};
/*
// 法の元の演算
// modを維持しながらべき乗。
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
// 逆元。オイラーの定理から？
// 有限体上での割り算に利用
// 3/4 = 3*(1/4) = 3x(4の逆数) = 3x3 mod 11
// 4の逆数はかけると1になるので、この場合は3
ll mod_inverse(ll x) {
return mod_pow(x, mod-2);
}
const int fact_max_n = 1000000;
ll fact[fact_max_n];
ll fact_inv[fact_max_n];
void calc_fact() {
fact[0] = 1;
//階乗の算出。かける度にmodを取る。
for (ll i = 1; i < fact_max_n; i++)
fact[i] = (fact[i-1] * i) % mod;
//階乗の逆元の算出。
//1*2*3 => 1/(1*2*3)
//1*2 => 1/(1*2*3)*3
fact_inv[fact_max_n-1] = mod_inverse(fact[fact_max_n-1]);
for (ll i = fact_max_n-2; i >= 0; i--)
fact_inv[i] = (fact_inv[i+1] * (i+1)) % mod;
}
//mod付き組み合わせ
// nCk= n!/(n-k)!k! を、modをかませながら演算
ll mod_comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return (fact[n] * fact_inv[k] % mod) * fact_inv[n-k] % mod;
}
*/
// GCD
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int gcd(const vector<int> &list) {
int a = list[0];
for (auto i = 1; i < list.size(); i++) {
a = gcd(a, list[i]);
}
return a;
}
int N, K;
vi h;
void input() {
cin >> N >> K;
cin.ignore();
h = vi(N);
rep(i, N) cin >> h[i];
cin.ignore();
}
// 10 30 40 20
// 10 => 30: コスト20
// 10 => 40: コスト30
int solve() {
vi dp(N + 1);
rep(i, N + 1) dp[i] = INF;
dp[0] = 0;
rep(i, N - 1) {
reps(j, K) { dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i])); }
}
return dp[N - 1];
}
int main() {
input();
cout << solve() << endl;
}
| //ライブラリ
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <sys/time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//ユーティリティ
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define rreps(i, n) for (int i = n; i > 0; --i)
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())
template <class T> bool chmax(T &former, const T &b) {
if (former < b) {
former = b;
return true;
}
return false;
}
template <class T> bool chmin(T &former, const T &b) {
if (former > b) {
former = b;
return true;
}
return false;
}
//型
typedef long long int ll;
typedef long long unsigned int ull;
typedef pair<int, int> pairi;
typedef pair<ull, ull> pairull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef priority_queue<int, vi> pq;
typedef priority_queue<int, vi, greater<int>> rpq;
//定数
#define INF (1e9 + 9)
const double pi = (acos(-1));
#define MOD (1e9 + 7)
const double eps = 1e-8;
//セグメント木
//データ構造
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build() {
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
};
/*
// 法の元の演算
// modを維持しながらべき乗。
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
// 逆元。オイラーの定理から？
// 有限体上での割り算に利用
// 3/4 = 3*(1/4) = 3x(4の逆数) = 3x3 mod 11
// 4の逆数はかけると1になるので、この場合は3
ll mod_inverse(ll x) {
return mod_pow(x, mod-2);
}
const int fact_max_n = 1000000;
ll fact[fact_max_n];
ll fact_inv[fact_max_n];
void calc_fact() {
fact[0] = 1;
//階乗の算出。かける度にmodを取る。
for (ll i = 1; i < fact_max_n; i++)
fact[i] = (fact[i-1] * i) % mod;
//階乗の逆元の算出。
//1*2*3 => 1/(1*2*3)
//1*2 => 1/(1*2*3)*3
fact_inv[fact_max_n-1] = mod_inverse(fact[fact_max_n-1]);
for (ll i = fact_max_n-2; i >= 0; i--)
fact_inv[i] = (fact_inv[i+1] * (i+1)) % mod;
}
//mod付き組み合わせ
// nCk= n!/(n-k)!k! を、modをかませながら演算
ll mod_comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k) return 0;
return (fact[n] * fact_inv[k] % mod) * fact_inv[n-k] % mod;
}
*/
// GCD
int gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (!b)
break;
a %= b;
}
return a;
}
int gcd(const vector<int> &list) {
int a = list[0];
for (auto i = 1; i < list.size(); i++) {
a = gcd(a, list[i]);
}
return a;
}
int N, K;
vi h;
void input() {
cin >> N >> K;
cin.ignore();
h = vi(N + K);
rep(i, N + K) cin >> h[i];
cin.ignore();
}
// 10 30 40 20
// 10 => 30: コスト20
// 10 => 40: コスト30
int solve() {
vi dp(N + K);
rep(i, N + K) dp[i] = INF;
dp[0] = 0;
rep(i, N - 1) {
reps(j, K) { dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i])); }
}
return dp[N - 1];
}
int main() {
input();
cout << solve() << endl;
}
| [
"assignment.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 961,676 | 961,677 | u823871776 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo \
long long int i, j, k, q = 0, t, tmp, n, flg = 0, cntr = 0, maxxer = 0
#define fi first
#define se second
#define be begin()
#define en end()
#define mod 1000000007
#define debug(x) cout << " " << x << endl
ll dp[100005];
int val[100005][3];
int main() {
faster;
letsgo;
cin >> n >> k;
vector<ll> v;
for (i = 0; i < n + 1; i++)
dp[i] = 100005ll;
for (i = 0; i < n; i++) {
cin >> tmp;
v.pb(tmp);
}
ll cnt = 0;
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = i - 1; j >= max(0ll, i - k); j--) {
dp[i] = min(dp[i], abs(v[i] - v[j]) + dp[j]);
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo \
long long int i, j, k, q = 0, t, tmp, n, flg = 0, cntr = 0, maxxer = 0
#define fi first
#define se second
#define be begin()
#define en end()
#define mod 1000000007
#define debug(x) cout << " " << x << endl
ll dp[100005];
int val[100005][3];
int main() {
faster;
letsgo;
cin >> n >> k;
vector<ll> v;
for (i = 0; i < n + 1; i++)
dp[i] = 100000000005ll;
for (i = 0; i < n; i++) {
cin >> tmp;
v.pb(tmp);
}
ll cnt = 0;
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = i - 1; j >= max(0ll, i - k); j--) {
dp[i] = min(dp[i], abs(v[i] - v[j]) + dp[j]);
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 961,683 | 961,681 | u116062521 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
int i, j;
for (i = 0; i < N; i++) {
cin >> h[i];
}
int dp[N] = {0};
int t;
for (i = 1; i < N; i++) {
t = 1000000010;
for (j = max(0, i - K); j < min(i, K); j++) {
if (dp[j] + abs(h[j] - h[i]) < t)
t = dp[j] + abs(h[j] - h[i]);
}
dp[i] = t;
}
/* for(i=K;i<N;i++)
{
for(j=0;j<K;i++)
{
dp[i][j]=
}
dp[i][0]=min(dp[i-1][0],dp[i-1][1])+abs(h[i]-h[i-1]);
dp[i][1]=min(dp[i-2][0],dp[i-2][1])+abs(h[i]-h[i-2]);
}*/
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
int i, j;
for (i = 0; i < N; i++) {
cin >> h[i];
}
int dp[N] = {0};
int t;
for (i = 1; i < N; i++) {
t = 1000000010;
for (j = max(0, i - K); j < i; j++) {
if (dp[j] + abs(h[j] - h[i]) < t)
t = dp[j] + abs(h[j] - h[i]);
}
dp[i] = t;
}
/* for(i=K;i<N;i++)
{
for(j=0;j<K;i++)
{
dp[i][j]=
}
dp[i][0]=min(dp[i-1][0],dp[i-1][1])+abs(h[i]-h[i-1]);
dp[i][1]=min(dp[i-2][0],dp[i-2][1])+abs(h[i]-h[i-2]);
}*/
cout << dp[N - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.remove",
"call.arguments.change"
] | 961,694 | 961,695 | u118646012 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int h[100100];
int n, k;
int dp[100100];
const int INF = 100100;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 1)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
else
break;
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int h[100100];
int n, k;
int dp[100100];
const int INF = (int)1e18;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 1)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
else
break;
}
}
cout << dp[n];
} | [
"type_conversion.add"
] | 961,707 | 961,708 | u785442356 | cpp |
p03161 | /*
@author : srinathbalaji_99
*/
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define endl '\n'
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define rep(i, a, b, inc) for (long long i = a; i < b; i += inc)
#define REP(i, n) rep(i, 0, n, 1)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define PLL pair<long long, long long>
#define VL vector<long long>
#define VS vector<string>
#define VLL vector<PLL>
#define VVL vector<VL>
#define MPLL map<long long, long long>
#define UMPLL unordered_map<long long, long long>
#define SETL set<long long>
#define MSETL multiset<long long>
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) (a * b) / GCD(a, b)
#define ff first
#define ss second
#define pall(a) \
REP(i, sizeof(a) / sizeof(a[0])) cout << a[i] << " "; \
cout << endl;
#define pvall(v) \
REP(i, v.size()) cout << v[i] << " "; \
cout << endl;
#define gall(a, n) REP(i, n) cin >> a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
LL dp[100001], h[100001];
const LL inf = 1e9 + 10;
int main() {
fast();
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
LL t, n, i, j, k, x, y, c;
cin >> n >> k;
MEM(dp, inf);
gall(h, n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
rep(i, 2, n, 1) {
rep(j, 1, k + 1, 1) {
if (i - j <= 0)
break;
else {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
}
cout << dp[n - 1];
} | /*
@author : srinathbalaji_99
*/
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define endl '\n'
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define rep(i, a, b, inc) for (long long i = a; i < b; i += inc)
#define REP(i, n) rep(i, 0, n, 1)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define PLL pair<long long, long long>
#define VL vector<long long>
#define VS vector<string>
#define VLL vector<PLL>
#define VVL vector<VL>
#define MPLL map<long long, long long>
#define UMPLL unordered_map<long long, long long>
#define SETL set<long long>
#define MSETL multiset<long long>
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) (a * b) / GCD(a, b)
#define ff first
#define ss second
#define pall(a) \
REP(i, sizeof(a) / sizeof(a[0])) cout << a[i] << " "; \
cout << endl;
#define pvall(v) \
REP(i, v.size()) cout << v[i] << " "; \
cout << endl;
#define gall(a, n) REP(i, n) cin >> a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
LL dp[100001], h[100001];
const LL inf = 1e9 + 10;
int main() {
fast();
LL t, n, i, j, k, x, y, c;
cin >> n >> k;
MEM(dp, inf);
gall(h, n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
rep(i, 2, n, 1) {
rep(j, 1, k + 1, 1) {
if (i - j < 0)
break;
else {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
}
cout << dp[n - 1];
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,713 | 961,714 | u295992428 | cpp |
p03161 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << std::abs(v[n - 1] - v[0]) << "\n";
goto endproc;
}
// k番目の足場までは一回で飛ぶのが最適
for (int i{1}; i <= k; ++i)
tab[i] = std::abs(v[i] - v[0]);
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
// k+1番目からdp
for (int i{k + 1}; i < n; ++i) {
auto min_cost = 100000;
for (int ki{1}; ki <= k; ++ki) {
/*
std::cout
<< "(" << i << ", " << i-ki << ") "
<< "|" << v[i] << " - " << v[i - ki] << "|"
<< " + " << tab[i-ki] << "\n";
*/
auto cost = std::abs(v[i] - v[i - ki]) + tab[i - ki];
min_cost = std::min(min_cost, cost);
}
// std::cout <<"min i = "<< min_cost << "\n";
tab[i] = min_cost;
}
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
std::cout << tab[n - 1] << "\n";
endproc:
return 0;
} |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << std::abs(v[n - 1] - v[0]) << "\n";
goto endproc;
}
// k番目の足場までは一回で飛ぶのが最適
for (int i{1}; i <= k; ++i)
tab[i] = std::abs(v[i] - v[0]);
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
// k+1番目からdp
for (int i{k + 1}; i < n; ++i) {
auto min_cost = 1'000'000'000; //>10^4
for (int ki{1}; ki <= k; ++ki) {
/*
std::cout
<< "(" << i << ", " << i-ki << ") "
<< "|" << v[i] << " - " << v[i - ki] << "|"
<< " + " << tab[i-ki] << "\n";
*/
auto cost = std::abs(v[i] - v[i - ki]) + tab[i - ki];
min_cost = std::min(min_cost, cost);
}
// std::cout <<"min i = "<< min_cost << "\n";
tab[i] = min_cost;
}
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
std::cout << tab[n - 1] << "\n";
endproc:
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,718 | 961,719 | u837286475 | cpp |
p03161 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << v[n - 1] - v[0] << "\n";
goto endproc;
}
// k番目の足場までは一回で飛ぶのが最適
for (int i{1}; i <= k; ++i)
tab[i] = std::abs(v[i] - v[0]);
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
// k+1番目からdp
for (int i{k + 1}; i < n; ++i) {
auto min_cost = 100000;
for (int ki{1}; ki <= k; ++ki) {
/*
std::cout
<< "(" << i << ", " << i-ki << ") "
<< "|" << v[i] << " - " << v[i - ki] << "|"
<< " + " << tab[i-ki] << "\n";
*/
auto cost = std::abs(v[i] - v[i - ki]) + tab[i - ki];
min_cost = std::min(min_cost, cost);
}
// std::cout <<"min i = "<< min_cost << "\n";
tab[i] = min_cost;
}
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
std::cout << tab[n - 1] << "\n";
endproc:
return 0;
} |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << std::abs(v[n - 1] - v[0]) << "\n";
goto endproc;
}
// k番目の足場までは一回で飛ぶのが最適
for (int i{1}; i <= k; ++i)
tab[i] = std::abs(v[i] - v[0]);
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
// k+1番目からdp
for (int i{k + 1}; i < n; ++i) {
auto min_cost = 1'000'000'000; //>10^4
for (int ki{1}; ki <= k; ++ki) {
/*
std::cout
<< "(" << i << ", " << i-ki << ") "
<< "|" << v[i] << " - " << v[i - ki] << "|"
<< " + " << tab[i-ki] << "\n";
*/
auto cost = std::abs(v[i] - v[i - ki]) + tab[i - ki];
min_cost = std::min(min_cost, cost);
}
// std::cout <<"min i = "<< min_cost << "\n";
tab[i] = min_cost;
}
/*
for (const auto&e : tab)
std::cout << " " << e;
std::cout << "\n";
*/
std::cout << tab[n - 1] << "\n";
endproc:
return 0;
} | [
"call.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 961,720 | 961,719 | u837286475 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k;
cin >> k;
long long int a[n];
for (long long int i = 0; i < n; i++)
cin >> a[i];
long long int dp[n];
dp[0] = 0;
for (long long int i = 1; i <= k; i++) {
dp[i] = abs(a[i] - a[0]);
// cout<<dp[i]<<"\n";
}
for (long long int i = k + 1; i < n; i++) {
long long int g = 10000000;
long long int f;
for (long long int i1 = 0; i1 < k; i1++) {
if (g > dp[i - 1 - i1] + abs(a[i] - a[i - 1 - i1])) {
g = dp[i - 1 - i1] + abs(a[i] - a[i - 1 - i1]);
f = i1;
// cout<<f<<"\n";
}
}
// cout<<g<<"\n"<<f<<"\n";
dp[i] = g;
}
for (long long int i = 0; i < n; i++) {
// cout<<dp[i]<<"\n";
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k;
cin >> k;
long long int a[n];
for (long long int i = 0; i < n; i++)
cin >> a[i];
long long int dp[n];
dp[0] = 0;
for (long long int i = 1; i <= min(k, n); i++) {
dp[i] = abs(a[i] - a[0]);
// cout<<dp[i]<<"\n";
}
for (long long int i = k + 1; i < n; i++) {
long long int g = 100000000000000;
long long int f;
for (long long int i1 = 0; i1 < k; i1++) {
if (g > dp[i - 1 - i1] + abs(a[i] - a[i - 1 - i1])) {
g = dp[i - 1 - i1] + abs(a[i] - a[i - 1 - i1]);
f = i1;
// cout<<f<<"\n";
}
}
// cout<<g<<"\n"<<f<<"\n";
dp[i] = g;
}
for (long long int i = 0; i < n; i++) {
// cout<<dp[i]<<"\n";
}
cout << dp[n - 1];
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change"
] | 961,730 | 961,729 | u510050122 | cpp |
p03161 | #include <iostream>
using namespace std;
long long int arr[(int)1e5 + 1];
long long int dp[(int)1e5 + 1];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
for (int i = 0; i < n; i++) {
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] = abs(arr[i] - arr[i - 1]);
else if (k < i) {
dp[i] = abs(arr[i] - arr[i - 1]) + dp[i - 1];
for (int j = 1; j < i; j++) {
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
} else {
dp[i] = abs(arr[i] - arr[i - 1]) + dp[i - 1];
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
}
}
printf("%lld\n", dp[n - 1]);
return 0;
} | #include <iostream>
using namespace std;
long long int arr[(int)1e5 + 1];
long long int dp[(int)1e5 + 1];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
for (int i = 0; i < n; i++) {
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] = abs(arr[i] - arr[i - 1]);
else if (i < k) {
dp[i] = abs(arr[i] - arr[i - 1]) + dp[i - 1];
for (int j = 1; j <= i; j++) {
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
} else {
dp[i] = abs(arr[i] - arr[i - 1]) + dp[i - 1];
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
}
}
printf("%lld\n", dp[n - 1]);
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 961,733 | 961,734 | u743914381 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, MAX = 100000;
cin >> N >> K;
vector<int> H(N), dp(N, MAX);
dp[0] = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
if (i + j >= N)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i + j] - H[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, K, MAX = 100000000000000;
cin >> N >> K;
vector<long long> H(N), dp(N, MAX);
dp[0] = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
if (i + j >= N)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i + j] - H[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 961,740 | 961,738 | u789339072 | cpp |
p03161 | #include <iostream>
#include <utility>
using namespace std;
int main() {
int n = 0, k = 0;
cin >> n >> k;
int arr[n + 1] = {0};
cin >> arr[1];
for (int i = 2; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1] = {0};
arr[0] = 1e5;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(arr[i - 1] - arr[i]);
for (int j = 2; j <= k; j++) {
if (dp[i] > dp[i - j] + abs(arr[i - j] - arr[i]))
dp[i] = dp[i - j] + abs(arr[i - j] - arr[i]);
}
}
cout << dp[n] << endl;
cin >> n;
return 0;
}
| #include <iostream>
#include <utility>
using namespace std;
int main() {
int n = 0, k = 0;
cin >> n >> k;
int arr[n + 1] = {0};
cin >> arr[1];
for (int i = 2; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1] = {0};
arr[0] = 1e5;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(arr[i - 1] - arr[i]);
for (int j = 2; j <= k && j <= i; j++) {
if (dp[i] > dp[i - j] + abs(arr[i - j] - arr[i]))
dp[i] = dp[i - j] + abs(arr[i - j] - arr[i]);
}
}
cout << dp[n] << endl;
cin >> n;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,747 | 961,748 | u223578409 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
long long h[100010];
// DP テーブル
long long dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
//初期化
for (int i = 0; i < 100010; i++)
dp[i] = 100000;
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i < j)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
long long h[100010];
// DP テーブル
long long dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
//初期化
for (int i = 0; i < 100010; i++)
dp[i] = 1LL << 60;
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i < j)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 961,755 | 961,756 | u189961895 | cpp |
p03161 | #include <iostream>
using namespace std;
int main(void) {
int N;
int K;
long long h[100010];
long long dp[100010];
long long tmp;
long long tnp;
cin >> N >> K;
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 <= min(K, N - 1); i++) {
tmp = abs(h[i] - h[0]);
for (int j = 1; j < i; j++) {
tnp = dp[i - j] + abs(h[i] - h[i - j]);
if (tnp < tmp) {
tmp = tnp;
}
}
dp[i] = tmp;
}
for (int i = K + 1; i < N; i++) {
tmp = 10010;
for (int j = 1; j <= K; j++) {
tnp = dp[i - j] + abs(h[i] - h[i - j]);
if (tnp < tmp) {
tmp = tnp;
}
}
dp[i] = tmp;
}
cout << dp[N - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int N;
int K;
long long h[100010];
long long dp[100010];
long long tmp;
long long tnp;
cin >> N >> K;
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 <= min(K, N - 1); i++) {
tmp = abs(h[i] - h[0]);
for (int j = 1; j < i; j++) {
tnp = dp[i - j] + abs(h[i] - h[i - j]);
if (tnp < tmp) {
tmp = tnp;
}
}
dp[i] = tmp;
}
for (int i = K + 1; i < N; i++) {
tmp = 10000000000;
for (int j = 1; j <= K; j++) {
tnp = dp[i - j] + abs(h[i] - h[i - j]);
if (tnp < tmp) {
tmp = tnp;
}
}
dp[i] = tmp;
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 961,757 | 961,758 | u456213708 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long a[101010], f[101010];
int n, k;
main() {
cin >> n >> k;
for (int i = 2; i <= n; i++)
f[i] = 1e11;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= i - k; j--)
f[i] = min(f[i], f[j] + abs(a[i] - a[j]));
}
cout << f[n];
}
| #include <bits/stdc++.h>
using namespace std;
long long a[101010], f[101010];
int n, k;
main() {
cin >> n >> k;
for (int i = 2; i <= n; i++)
f[i] = 1e11;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= i - k && j >= 1; j--)
f[i] = min(f[i], f[j] + abs(a[i] - a[j]));
}
cout << f[n];
}
| [
"control_flow.loop.for.condition.change"
] | 961,763 | 961,764 | u498792596 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); \
cout.setf(ios::fixed); \
cout.precision(20)
#define ll long long
#define endl '\n'
// Author
// ::
// ( NOBODY )
// No Copyright .....You can copy and paste it without my
// permission...................................
// !!!!!!!!!!!!!!!
#define pb push_back
#define N 300009
int a[N], b[N];
int dp[100009];
int main() {
FAST_IO;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 0; j <= min(k, i); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n];
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); \
cout.setf(ios::fixed); \
cout.precision(20)
#define ll long long
#define endl '\n'
// Author
// ::
// ( NOBODY )
// No Copyright .....You can copy and paste it without my
// permission...................................
// !!!!!!!!!!!!!!!
#define pb push_back
#define N 300009
int a[N], b[N];
int dp[100009];
int main() {
FAST_IO;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 1; j <= min(k, i - 1); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n];
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"
] | 961,783 | 961,784 | u624773401 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); \
cout.setf(ios::fixed); \
cout.precision(20)
#define ll long long
#define endl '\n'
// Author
// ::
// ( NOBODY )
// No Copyright .....You can copy and paste it without my
// permission...................................
// !!!!!!!!!!!!!!!
#define pb push_back
#define N 300009
int a[N], b[N];
int dp[100009];
int main() {
FAST_IO;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 1; j <= min(k, i); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n];
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); \
cout.setf(ios::fixed); \
cout.precision(20)
#define ll long long
#define endl '\n'
// Author
// ::
// ( NOBODY )
// No Copyright .....You can copy and paste it without my
// permission...................................
// !!!!!!!!!!!!!!!
#define pb push_back
#define N 300009
int a[N], b[N];
int dp[100009];
int main() {
FAST_IO;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 1; j <= min(k, i - 1); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n];
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,785 | 961,784 | u624773401 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n, k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, 1500000009);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - k] + abs(h[i] - h[i - k]));
}
}
cout << dp[n - 1] << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, 1500000009);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,786 | 961,787 | u990764614 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n + 1];
int niza[n + 1];
for (int i = 1; i <= n; i++) {
cin >> niza[i];
dp[i] = INT_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j + 1 <= n)
dp[i + j] = min(dp[i + j], dp[i] + abs(niza[i] - niza[i + j]));
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n + 1];
int niza[n + 1];
for (int i = 1; i <= n; i++) {
cin >> niza[i];
dp[i] = INT_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], dp[i] + abs(niza[i] - niza[i + j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,794 | 961,795 | u430341757 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j < k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[i - j]) + c[i - j];
if (x > z)
x = z;
}
}
c[i] = x;
}
cout << c[n - 1];
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[i - j]) + c[i - j];
if (x > z)
x = z;
}
}
c[i] = x;
}
cout << c[n - 1];
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,798 | 961,799 | u856936587 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 0;
for (int j = 1; j < k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[i - j]) + c[i - j];
if (x < z)
x = z;
}
}
c[i] = x;
}
cout << c[n - 1];
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[i - j]) + c[i - j];
if (x > z)
x = z;
}
}
c[i] = x;
}
cout << c[n - 1];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 961,800 | 961,799 | u856936587 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 0;
for (int j = 1; j < k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[i - j]) + c[i - j];
if (x > z)
x = z;
}
}
c[i] = x;
}
cout << c[n - 1];
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[i - j]) + c[i - j];
if (x > z)
x = z;
}
}
c[i] = x;
}
cout << c[n - 1];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,801 | 961,799 | u856936587 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> f(n), a(n);
for (int &i : a)
cin >> i;
for (int i = n - 2; i >= 0; i--) {
f[i] = 1 << 30;
for (int j = 1; j <= k; j++)
if (i + k < n)
f[i] = min(f[i], abs(a[i] - a[i + k]) + f[i + k]);
}
cout << f[0] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> f(n), a(n);
for (int &i : a)
cin >> i;
for (int i = n - 2; i >= 0; i--) {
f[i] = 1 << 30;
for (int j = 1; j <= k; j++)
if (i + j < n)
f[i] = min(f[i], abs(a[i] - a[i + j]) + f[i + j]);
}
cout << f[0] << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 961,810 | 961,811 | u251828455 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int min(int x, int y) { return (x >= y) ? y : x; }
int main() {
int n, k, h[100005] = {0}, result[100005] = {0}, i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> h[i];
for (i = 1; i < n; i++) {
result[i] = 99999;
for (j = i - 1; j >= 0 && j >= i - k; j--) {
result[i] = min(result[j] + abs(h[j] - h[i]), result[i]);
}
}
cout << result[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int min(int x, int y) { return (x >= y) ? y : x; }
int main() {
int n, k, h[100005] = {0}, result[100005] = {0}, i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> h[i];
for (i = 1; i < n; i++) {
result[i] = INT_MAX;
for (j = i - 1; j >= 0 && j >= i - k; j--) {
result[i] = min(result[j] + abs(h[j] - h[i]), result[i]);
}
}
cout << result[n - 1];
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 961,814 | 961,815 | u771788598 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S size()
#define B begin()
#define E end()
#define PI acos(-1)
#define fscan1(n) scanf("%d", &(n));
#define fscan2(n, m) scanf("%d %d", &(n), &(m));
#define fscan3(n, m, k) scanf("%d %d %d", &(n), &(m), &(k));
const int N = 1e5 + 100;
const int M = 2e5 + 100;
const ll oo = 1e18;
int n, m, k, t, q, h, a, b, c, x, y, z;
using namespace std;
ll ar[N];
ll dp[N];
int main() {
cin >> n >> k;
for (int i = 1; i < n; i++)
dp[i] = -oo;
for (int i = 0; i < n; i++) {
cin >> ar[i];
for (int j = i - k; j < i && i; j++) {
(j < 0) ? j = 0 : 0;
dp[i] = min(dp[i], dp[j] + abs(ar[i] - ar[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S size()
#define B begin()
#define E end()
#define PI acos(-1)
#define fscan1(n) scanf("%d", &(n));
#define fscan2(n, m) scanf("%d %d", &(n), &(m));
#define fscan3(n, m, k) scanf("%d %d %d", &(n), &(m), &(k));
const int N = 1e5 + 100;
const int M = 2e5 + 100;
const ll oo = 1e18;
int n, m, k, t, q, h, a, b, c, x, y, z;
using namespace std;
ll ar[N];
ll dp[N];
int main() {
cin >> n >> k;
for (int i = 1; i < n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++) {
cin >> ar[i];
for (int j = i - k; j < i && i; j++) {
(j < 0) ? j = 0 : 0;
dp[i] = min(dp[i], dp[j] + abs(ar[i] - ar[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"expression.operation.unary.arithmetic.remove"
] | 961,816 | 961,817 | u225344943 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S size()
#define B begin()
#define E end()
#define PI acos(-1)
#define fscan1(n) scanf("%d", &(n));
#define fscan2(n, m) scanf("%d %d", &(n), &(m));
#define fscan3(n, m, k) scanf("%d %d %d", &(n), &(m), &(k));
const int N = 1e5 + 100;
const int M = 2e5 + 100;
const ll oo = 1e18;
int n, m, k, t, q, h, a, b, c, x, y, z;
using namespace std;
ll ar[N];
ll dp[N];
int main() {
cin >> n >> k;
for (int i = 1; i < n; i++)
dp[i] = N;
for (int i = 0; i < n; i++) {
cin >> ar[i];
for (int j = i - k; j < i; j++) {
(j < 0) ? j = 0 : 0;
dp[i] = min(dp[i], dp[j] + abs(ar[i] - ar[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S size()
#define B begin()
#define E end()
#define PI acos(-1)
#define fscan1(n) scanf("%d", &(n));
#define fscan2(n, m) scanf("%d %d", &(n), &(m));
#define fscan3(n, m, k) scanf("%d %d %d", &(n), &(m), &(k));
const int N = 1e5 + 100;
const int M = 2e5 + 100;
const ll oo = 1e18;
int n, m, k, t, q, h, a, b, c, x, y, z;
using namespace std;
ll ar[N];
ll dp[N];
int main() {
cin >> n >> k;
for (int i = 1; i < n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++) {
cin >> ar[i];
for (int j = i - k; j < i && i; j++) {
(j < 0) ? j = 0 : 0;
dp[i] = min(dp[i], dp[j] + abs(ar[i] - ar[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 961,818 | 961,817 | u225344943 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S size()
#define B begin()
#define E end()
#define PI acos(-1)
#define fscan1(n) scanf("%d", &(n));
#define fscan2(n, m) scanf("%d %d", &(n), &(m));
#define fscan3(n, m, k) scanf("%d %d %d", &(n), &(m), &(k));
const int N = 1e5 + 100;
const int M = 2e5 + 100;
const ll oo = 1e18;
int n, m, k, t, q, h, a, b, c, x, y, z;
using namespace std;
int ar[N];
int dp[N];
int main() {
cin >> n >> k;
for (int i = 1; i < n; i++)
dp[i] = N;
for (int i = 0; i < n; i++) {
cin >> ar[i];
for (int j = i - k; j < i; j++) {
(j < 0) ? j = 0 : 0;
dp[i] = min(dp[i], dp[j] + abs(ar[i] - ar[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S size()
#define B begin()
#define E end()
#define PI acos(-1)
#define fscan1(n) scanf("%d", &(n));
#define fscan2(n, m) scanf("%d %d", &(n), &(m));
#define fscan3(n, m, k) scanf("%d %d %d", &(n), &(m), &(k));
const int N = 1e5 + 100;
const int M = 2e5 + 100;
const ll oo = 1e18;
int n, m, k, t, q, h, a, b, c, x, y, z;
using namespace std;
ll ar[N];
ll dp[N];
int main() {
cin >> n >> k;
for (int i = 1; i < n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++) {
cin >> ar[i];
for (int j = i - k; j < i && i; j++) {
(j < 0) ? j = 0 : 0;
dp[i] = min(dp[i], dp[j] + abs(ar[i] - ar[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 961,819 | 961,817 | u225344943 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
using namespace std;
int solve(int *dp, int *A, int i, int k) {
if (dp[i] >= 0)
return dp[i];
int mini = INT_MAX;
for (int j = i - k; j < i; j++) {
mini = min(mini, solve(dp, A, j, k) + abs(A[i] - A[j]));
}
dp[i] = mini;
return dp[i];
}
int main() {
int n, k;
cin >> n >> k;
int A[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
dp[i] = -1;
}
dp[0] = 0;
for (int i = 1; i < k && i < n; i++) {
int mini = INT_MAX;
for (int j = 0; j < i; j++) {
mini = min(mini, abs(A[i] - A[j]));
}
dp[i] = mini;
}
cout << solve(dp, A, n - 1, k);
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
using namespace std;
int solve(int *dp, int *A, int i, int k) {
if (dp[i] >= 0)
return dp[i];
int mini = INT_MAX;
for (int j = i - k; j < i; j++) {
mini = min(mini, solve(dp, A, j, k) + abs(A[i] - A[j]));
}
dp[i] = mini;
return dp[i];
}
int main() {
int n, k;
cin >> n >> k;
int A[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
dp[i] = -1;
}
dp[0] = 0;
for (int i = 1; i < k && i < n; i++) {
int mini = INT_MAX;
for (int j = 0; j < i; j++) {
mini = min(mini, dp[j] + abs(A[i] - A[j]));
}
dp[i] = mini;
}
cout << solve(dp, A, n - 1, k);
return 0;
} | [
"assignment.change"
] | 961,837 | 961,838 | u917233175 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100000 + 1];
ll f(ll n, ll a[], ll k) {
if (dp[n] != -1)
return dp[n];
ll t = INT_MAX;
for (ll i = 1; i <= k; i++) {
if ((n - i) >= 0) {
ll c = abs(a[n] - a[n - i]) + f(n - i, a, k);
if (c < t)
t = c;
}
else
break;
}
dp[n] = t;
return dp[n];
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 0; i <= 100000; i++)
dp[i] = -1;
a[0] = 0;
for (ll i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = 0;
cout << f(n, a, k) << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100000 + 1];
ll f(ll n, ll a[], ll k) {
if (dp[n] != -1)
return dp[n];
ll t = INT_MAX;
for (ll i = 1; i <= k; i++) {
if ((n - i) > 0) {
ll c = abs(a[n] - a[n - i]) + f(n - i, a, k);
if (c < t)
t = c;
}
else
break;
}
dp[n] = t;
return dp[n];
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 0; i <= 100000; i++)
dp[i] = -1;
a[0] = 0;
for (ll i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = 0;
cout << f(n, a, k) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,839 | 961,840 | u420703524 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= min(k, pos); i++) {
long long cand_cost = jump(pos - i, k) + abs(h[pos - i] - h[pos]);
if (min_cost > cand_cost) {
min_cost = cand_cost;
}
}
// cout << "pos: " << pos << endl;
// cout << "cost: " << min_cost << endl;
cost[pos] = min_cost;
calc[pos] = 1;
return cost[pos];
}
int main() {
int n;
cin >> n;
int k;
cin >> k;
h[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i + 1] = x;
}
cout << jump(n, k) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= min(k, pos - 1); i++) {
long long cand_cost = jump(pos - i, k) + abs(h[pos - i] - h[pos]);
if (min_cost > cand_cost) {
min_cost = cand_cost;
}
}
// cout << "pos: " << pos << endl;
// cout << "cost: " << min_cost << endl;
cost[pos] = min_cost;
calc[pos] = 1;
return cost[pos];
}
int main() {
int n;
cin >> n;
int k;
cin >> k;
h[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i + 1] = x;
}
cout << jump(n, k) << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,843 | 961,844 | u611087334 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[10010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= min(k, pos); i++) {
long long cand_cost = jump(pos - i, k) + abs(h[pos - i] - h[pos]);
if (min_cost > cand_cost) {
min_cost = cand_cost;
}
}
// cout << "pos: " << pos << endl;
// cout << "cost: " << min_cost << endl;
cost[pos] = min_cost;
calc[pos] = 1;
return cost[pos];
}
int main() {
int n;
cin >> n;
int k;
cin >> k;
h[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i + 1] = x;
}
cout << jump(n, k) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= min(k, pos - 1); i++) {
long long cand_cost = jump(pos - i, k) + abs(h[pos - i] - h[pos]);
if (min_cost > cand_cost) {
min_cost = cand_cost;
}
}
// cout << "pos: " << pos << endl;
// cout << "cost: " << min_cost << endl;
cost[pos] = min_cost;
calc[pos] = 1;
return cost[pos];
}
int main() {
int n;
cin >> n;
int k;
cin >> k;
h[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i + 1] = x;
}
cout << jump(n, k) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,845 | 961,844 | u611087334 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[10000] = {};
int calc[10000] = {};
int h[10000] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= min(k, pos); i++) {
long long cand_cost = jump(pos - i, k) + abs(h[pos - i] - h[pos]);
if (min_cost > cand_cost) {
min_cost = cand_cost;
}
}
// cout << "pos: " << pos << endl;
// cout << "cost: " << min_cost << endl;
cost[pos] = min_cost;
calc[pos] = 1;
return cost[pos];
}
int main() {
int n;
cin >> n;
int k;
cin >> k;
h[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i + 1] = x;
}
cout << jump(n, k) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= min(k, pos - 1); i++) {
long long cand_cost = jump(pos - i, k) + abs(h[pos - i] - h[pos]);
if (min_cost > cand_cost) {
min_cost = cand_cost;
}
}
// cout << "pos: " << pos << endl;
// cout << "cost: " << min_cost << endl;
cost[pos] = min_cost;
calc[pos] = 1;
return cost[pos];
}
int main() {
int n;
cin >> n;
int k;
cin >> k;
h[0] = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h[i + 1] = x;
}
cout << jump(n, k) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,846 | 961,844 | u611087334 | cpp |
p03161 | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
long long int dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = 100100;
int N, K;
long long int height[100010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int j = 2; j < N; j++) {
for (int k = 1; k <= K && ((j - k) >= 0); k++) {
dp[j] = min(dp[j], dp[j - k] + abs(height[j - k] - height[j]));
}
}
cout << dp[N - 1];
} | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
long long int dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = 1LL << 60;
int N, K;
long long int height[100010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int j = 2; j < N; j++) {
for (int k = 1; k <= K && ((j - k) >= 0); k++) {
dp[j] = min(dp[j], dp[j - k] + abs(height[j - k] - height[j]));
}
}
cout << dp[N - 1];
} | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 961,850 | 961,848 | u942868002 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans[n];
ans[0] = 0;
ans[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = i - 1; j >= max(i - k, 0); j--) {
ans[i] = min(ans[i], ans[j] + abs(h[j] - h[i]));
}
}
cout << ans[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long ans[n];
ans[0] = 0;
ans[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
ans[i] = 1e10;
for (int j = i - 1; j >= max(i - k, 0); j--) {
ans[i] = min(ans[i], ans[j] + abs(h[j] - h[i]));
}
}
cout << ans[n - 1];
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 961,861 | 961,862 | u460878215 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int jump(int n, int K, vector<int> &h, vector<int> &level) {
int L = K;
if (level[n] == -1) {
int BIG_BANG = 1 << 30;
int mini = BIG_BANG;
if (n <= K) {
L = K;
L--;
}
for (int j = 1; j <= L; j++) {
mini = min(mini, abs(h[n] - h[n - j]) + jump(n - j, K, h, level));
}
level[n] = mini;
}
return level[n];
}
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + 1);
vector<int> level(N + 1, -1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
level[0] = 1 << 30;
level[1] = 0;
cout << jump(N, K, h, level) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int jump(int n, int K, vector<int> &h, vector<int> &level) {
int L = K;
if (level[n] == -1) {
const int BIG_BANG = 1 << 30;
int mini = BIG_BANG;
if (n <= K) {
L = n;
L--;
}
for (int j = 1; j <= L; j++) {
mini = min(mini, abs(h[n] - h[n - j]) + jump(n - j, K, h, level));
}
level[n] = mini;
}
return level[n];
}
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + 1);
vector<int> level(N + 1, -1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
level[0] = 1 << 30;
level[1] = 0;
cout << jump(N, K, h, level) << endl;
} | [
"assignment.value.change",
"identifier.change"
] | 961,863 | 961,864 | u652790949 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 100000000;
const long long LINF = 1000000000000000000;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-6;
using pii = std::pair<int, int>;
using pLL = std::pair<long long, long long>;
using ll = long long;
#define SORT(v) std::sort(v.begin(), v.end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<ll> h(100010), dp(100100);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
for (int i = 0; i < N; ++i)
dp[i] = LINF;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 100000000;
const long long LINF = 1000000000000000000;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-6;
using pii = std::pair<int, int>;
using pLL = std::pair<long long, long long>;
using ll = long long;
#define SORT(v) std::sort(v.begin(), v.end())
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<ll> h(100010), dp(100100);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
for (int i = 0; i < 100100; ++i)
dp[i] = LINF;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= K; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,865 | 961,866 | u199371251 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ri register int
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) > 0) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ri register int
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,871 | 961,872 | u938926508 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
using namespace std;
// for (int i = 0; i < N; i++){}
long long N, K;
int main() {
cin >> N >> K;
long long h[N];
long long c[N];
for (long long i = 0; i < N; i++) {
cin >> h[i];
c[i] = 1000;
}
c[0] = 0;
c[1] = abs(h[1] - h[0]);
for (long long i = 2; i < N; i++) {
for (long long j = 1; j <= K; j++) {
// cout << i << endl;
if ((i - j) >= 0) {
c[i] = min(c[i], c[i - j] + abs(h[i] - h[i - j]));
} else {
break;
}
// cout << c[i] << endl;
}
// cout << "----------------" << endl;
}
cout << c[N - 1] << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
using namespace std;
// for (int i = 0; i < N; i++){}
long long N, K;
int main() {
cin >> N >> K;
long long h[N];
long long c[N];
for (long long i = 0; i < N; i++) {
cin >> h[i];
c[i] = INF;
}
c[0] = 0;
c[1] = abs(h[1] - h[0]);
for (long long i = 2; i < N; i++) {
for (long long j = 1; j <= K; j++) {
if ((i - j) >= 0) {
c[i] = min(c[i], c[i - j] + abs(h[i] - h[i - j]));
} else {
break;
}
}
}
cout << c[N - 1] << endl;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 961,873 | 961,874 | u085853565 | cpp |
p03161 | #include <bits/stdc++.h>
#define JN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mod 1000000007
#define pb push_back
#define mp make_pair
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll frog[n + 2], cost[n + 2];
for (int i = 1; i <= n; i++)
cin >> cost[i];
frog[1] = 0;
frog[2] = abs(cost[2] - cost[1]);
for (ll i = 3; i <= n; i++) {
frog[i] = 1e18;
for (ll j = 1; j <= min(k, i); j++)
frog[i] = min(frog[i], frog[i - j] + abs(cost[i] - cost[i - j]));
}
cout << frog[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define JN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mod 1000000007
#define pb push_back
#define mp make_pair
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll frog[n + 2], cost[n + 2];
for (int i = 1; i <= n; i++)
cin >> cost[i];
frog[1] = 0;
frog[2] = abs(cost[2] - cost[1]);
for (ll i = 3; i <= n; i++) {
frog[i] = 1e14;
for (ll j = 1; j <= min(k, i - 1); j++)
frog[i] = min(frog[i], frog[i - j] + abs(cost[i] - cost[i - j]));
}
cout << frog[n] << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,875 | 961,876 | u835865879 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= k; j++) {
if (i - k < 0)
continue;
dp[i] = min(dp[i], dp[i - k] + abs(a[i] - a[i - k]));
}
}
cout << dp[n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << '\n';
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,887 | 961,888 | u415754428 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cstdlib>
#define ll long long
#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define MX 100010
using namespace std;
int N, K;
vector<int> h;
vector<int> dp;
int dpm;
int main() {
cin >> N >> K;
h.resize(N);
dp.resize(N);
FOR(i, 0, N) cin >> h[i];
dp[0] = 0;
FOR(i, 1, N) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 0; j <= K && j < i; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
// cout << abs(h[i] - h[i-j]) << " ";
}
// cout << "/" << endl;
// debug
// FOR(j,0,N){
// cout << dp[j] << " ";
//}
// cout << endl;
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cstdlib>
#define ll long long
#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define MX 100010
using namespace std;
int N, K;
vector<int> h;
vector<int> dp;
int dpm;
int main() {
cin >> N >> K;
h.resize(N);
dp.resize(N);
FOR(i, 0, N) cin >> h[i];
dp[0] = 0;
FOR(i, 1, N) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 0; j <= K && j <= i; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
// cout << abs(h[i] - h[i-j]) << " ";
}
// cout << "/" << endl;
// debug
// FOR(j,0,N){
// cout << dp[j] << " ";
//}
// cout << endl;
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,894 | 961,895 | u056863173 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
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;
}
int n, k;
ll h[100010], dp[100010];
int main(int argc, char const *argv[]) {
std::cin >> n >> k;
rep(i, n) std::cin >> h[i];
rep(i, 100010) dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
std::cout << dp[n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
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;
}
int n, k;
ll h[100010], dp[100010];
int main(int argc, char const *argv[]) {
std::cin >> n >> k;
rep(i, n) std::cin >> h[i];
rep(i, 100010) dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j + i]));
}
}
std::cout << dp[n - 1] << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 961,896 | 961,897 | u863279562 | cpp |
p03161 | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n;
ll arr[100010];
ll dp[100010];
ll k;
ll solve(ll i) {
// if(i==n){
// return 0;
// }
if (i >= n) {
return INT_MAX;
}
if (i == n - 1) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
ll ans = INT_MAX;
for (ll i1 = 1; i1 <= k; i1++) {
if (i + i1 < n) {
ans = min(ans, abs(arr[i + i1] - arr[i]) + solve(i + k));
} else {
break;
}
}
dp[i] = ans;
return dp[i];
}
int main() {
fast;
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0) << endl;
return 0;
} | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n;
ll arr[100010];
ll dp[100010];
ll k;
ll solve(ll i) {
// if(i==n){
// return 0;
// }
if (i >= n) {
return INT_MAX;
}
if (i == n - 1) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
ll ans = INT_MAX;
for (ll i1 = 1; i1 <= k; i1++) {
if (i + i1 < n) {
ans = min(ans, abs(arr[i + i1] - arr[i]) + solve(i + i1));
} else {
break;
}
}
dp[i] = ans;
return dp[i];
}
int main() {
fast;
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0) << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,900 | 961,901 | u512803662 | cpp |
p03161 | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n, k;
ll dp[100010];
ll arr[100010];
int main() {
fast;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
memset(dp, 0, sizeof(dp));
for (ll i = 1; i < n; i++) {
if (i == 1) {
dp[i] = dp[i - 1] + abs(arr[i] - arr[i - 1]);
} else {
dp[i] = (dp[i - 1] + abs(arr[i] - arr[i - 1]));
for (ll j = 2; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - k] + abs(arr[i] - arr[i - k]));
} else {
break;
}
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n, k;
ll dp[100010];
ll arr[100010];
int main() {
fast;
cin >> n >> k;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
memset(dp, 0, sizeof(dp));
for (ll i = 1; i < n; i++) {
if (i == 1) {
dp[i] = dp[i - 1] + abs(arr[i] - arr[i - 1]);
} else {
dp[i] = (dp[i - 1] + abs(arr[i] - arr[i - 1]));
for (ll j = 2; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
} else {
break;
}
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,902 | 961,903 | u512803662 | cpp |
p03161 | #include <bits/stdc++.h>
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pll pair<long long, long long>
#define fi first
#define se second
#define ll long long
using namespace std;
ll d[100002], a[100002];
int main() {
ios;
ll n, m;
cin >> n >> m;
fill(d + 1, d + n + 1, 1e18);
for (int k = 1; k <= n; k++)
cin >> a[k];
d[1] = 0;
if (n == 1)
d[1] = a[1];
for (int k = 2; k <= n; k++) {
for (int j = k - 1; j >= k - m && j >= 0; j--) {
if (d[j] + abs(a[k] - a[j]) < d[k])
d[k] = d[j] + abs(a[k] - a[j]);
}
}
cout << d[n];
return 0;
}
| #include <bits/stdc++.h>
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pll pair<long long, long long>
#define fi first
#define se second
#define ll long long
using namespace std;
ll d[100002], a[100002];
int main() {
ios;
ll n, m;
cin >> n >> m;
fill(d + 1, d + n + 1, 1e18);
for (int k = 1; k <= n; k++)
cin >> a[k];
d[1] = 0;
if (n == 1)
d[1] = a[1];
for (int k = 2; k <= n; k++) {
for (int j = k - 1; j >= k - m && j >= 1; j--) {
if (d[j] + abs(a[k] - a[j]) < d[k])
d[k] = d[j] + abs(a[k] - a[j]);
}
}
cout << d[n];
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,904 | 961,905 | u968786273 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i = a; i < N; i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, 0, N) cin >> h[i];
vector<ll> dp(N, 10010);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; i - j >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i = a; i < N; i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, 0, N) cin >> h[i];
vector<int> dp(N, 1000000000);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; i - j >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 961,906 | 961,907 | u076503518 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i = a; i < N; i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, 0, N) cin >> h[i];
vector<int> dp(N, 10010);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; i - j >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i = a; i < N; i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, 0, N) cin >> h[i];
vector<int> dp(N, 1000000000);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; i - j >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 961,908 | 961,907 | u076503518 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#define MAXN 100500
using namespace std;
int n, k;
int minim;
int h[MAXN];
int ans[MAXN];
int ogr;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
ans[1] = 0;
ans[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
if (i < k)
ogr = i;
else
ogr = k;
minim = ans[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 1; j <= ogr; j++) {
// cout << "i= " << i << " ogr= " << ogr << " minim= " << minim << " j= "
// << j << endl;
if (i == j)
continue;
ans[i + j] = ans[i - 1] + abs(h[i] - h[i + j]);
if (ans[i] < minim)
minim = ans[i];
}
ans[i] = minim;
}
cout << ans[n];
} | #include <algorithm>
#include <iostream>
#define MAXN 100500
using namespace std;
int n, k;
int minim;
int h[MAXN];
int ans[MAXN];
int ogr;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
ans[1] = 0;
ans[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
if (i < k)
ogr = i;
else
ogr = k;
minim = ans[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 1; j <= ogr; j++) {
if (i == j)
continue;
ans[i] = ans[i - j] + abs(h[i] - h[i - j]);
if (ans[i] < minim)
minim = ans[i];
}
ans[i] = minim;
}
cout << ans[n];
} | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change"
] | 961,914 | 961,915 | u290335371 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(123456789)
#define LINF (long long int)(123456789012345678)
#define MAX_V 1000
int main(void) {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
vector<int> dp(N, INF);
dp[0] = 0;
rep(i, N) {
reps(j, K + 1) {
if (i + j < N) {
dp[i + 1] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(123456789012345678)
#define MAX_V 1000
int main(void) {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
vector<int> dp(N, INF);
dp[0] = 0;
rep(i, N) {
reps(j, K) {
if (i + j < N) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operation.binary.remove",
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 961,925 | 961,924 | u050698451 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
const long long INF = 1e16;
long long dp[N];
fill(dp, dp + N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = i - K; j < i; j++) {
if (i - K >= 0) {
dp[i] = min({dp[i], dp[j] + abs(h[i] - h[j])});
}
}
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
const long long INF = 1e16;
long long dp[N];
fill(dp, dp + N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = i - K; j < i; j++) {
if (j >= 0) {
dp[i] = min({dp[i], dp[j] + abs(h[i] - h[j])});
}
}
}
cout << dp[N - 1] << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,926 | 961,927 | u413492096 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100009], f[100009];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
fill(f + 1, f + 1 + n, LONG_MAX);
f[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k && i - j > 0; ++j) {
f[i] = min(f[i], f[i - j] + abs(a[i - j] - a[i]));
}
}
cout << f[n];
}
| #include <bits/stdc++.h>
using namespace std;
int n, k, a[100009], f[100009];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
fill(f + 1, f + 1 + n, 1e9 + 9);
f[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k && i - j > 0; ++j) {
f[i] = min(f[i], f[i - j] + abs(a[i - j] - a[i]));
}
}
cout << f[n];
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 961,934 | 961,935 | u568218103 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> cost(n, 0);
for (int i = 1; i < n; i++) {
int temp = INT_MAX;
for (int j = 0; j <= k && i - j >= 0; j++)
temp = min(abs(arr[i - j] - arr[i]) + cost[i - j], temp);
cost[i] = temp;
}
cout << cost[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> cost(n, 0);
for (int i = 1; i < n; i++) {
int temp = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++)
temp = min(abs(arr[i - j] - arr[i]) + cost[i - j], temp);
cost[i] = temp;
}
cout << cost[n - 1];
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,938 | 961,939 | u476987752 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.