problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <iostream>
using namespace std;
const int MAX = 100000;
const long long _INFINITY = 10001;
long long dp[MAX];
long long h[MAX];
int main(int argc, const char *argv[]) {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < MAX; i++) {
dp[i] = _INFINITY;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
long long min = dp[i] + abs(h[i] - h[i + 1]);
if (dp[i + 1] > min) {
dp[i + 1] = min;
}
min = dp[i] + abs(h[i] - h[i + 2]);
if (dp[i + 2] > min) {
dp[i + 2] = min;
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
const int MAX = 100000;
const long long _INFINITY = 1LL << 60;
long long dp[MAX];
long long h[MAX];
int main(int argc, const char *argv[]) {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < MAX; i++) {
dp[i] = _INFINITY;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
long long min = dp[i] + abs(h[i] - h[i + 1]);
if (dp[i + 1] > min) {
dp[i + 1] = min;
}
min = dp[i] + abs(h[i] - h[i + 2]);
if (dp[i + 2] > min) {
dp[i + 2] = min;
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change"
] | 957,370 | 957,372 | u189697391 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int a = 0, b = abs(h[1] - h[0]), c = 0;
for (int i = 2; i < n; i++) {
c = min(abs(h[i - 2] - h[i]) + a, abs(h[i - 1] - h[i]) + b);
a = b;
b = c;
}
cout << c << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int a = 0, b = abs(h[1] - h[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(abs(h[i - 2] - h[i]) + a, abs(h[i - 1] - h[i]) + b);
a = b;
b = c;
}
cout << c << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,374 | 957,376 | u399623102 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
dp[2] = min(abs(a[2] - a[1]), abs(a[2] - a[1]) + dp[1]);
for (i = 3; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
dp[2] = min(abs(a[2] - a[0]), abs(a[2] - a[1]) + dp[1]);
for (i = 3; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n - 1];
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,398 | 957,400 | u815015310 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 100000;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 100000000000000000;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 957,514 | 957,515 | u695206817 | cpp |
p03160 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
cin >> x[i];
int ans[n + 1];
for (int i = 0; i < n + 1; i++)
ans[i] = 0;
for (int i = 1; i <= n; i++) {
ans[i] = min(ans[max(i - 1, 0)] + abs(x[i] - x[max(i - 1, 0)]),
ans[max(i - 2, 0)] + abs(x[i] - x[max(i - 2, 0)]));
}
cout << ans[n] << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
cin >> x[i];
int ans[n + 1];
for (int i = 0; i < n + 1; i++)
ans[i] = 0;
for (int i = 1; i <= n; i++) {
ans[i] = min(ans[max(i - 1, 0)] + abs(x[i - 1] - x[max(i - 2, 0)]),
ans[max(i - 2, 0)] + abs(x[i - 1] - x[max(i - 3, 0)]));
}
cout << ans[n] << endl;
return 0;
}
| [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,402 | 957,404 | u353602031 | cpp |
p03160 | /*huzaifa242 copyright*/
#include <bits/stdc++.h>
using namespace std;
#define PI 3.1415926535897932384626
#define mod 1000000007
#define MAX 100005
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, i;
cin >> n;
int a[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
a[i] = 0;
else if (i == 1)
a[i] = abs(h[i] - h[0]);
else
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
cout << a[n - 1] << "\n";
return 0;
} | /*huzaifa242 copyright*/
#include <bits/stdc++.h>
using namespace std;
#define PI 3.1415926535897932384626
#define mod 1000000007
#define MAX 100005
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, i;
cin >> n;
int a[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
a[i] = 0;
else if (i == 1)
a[i] = abs(h[i] - h[0]);
else
a[i] =
min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2]));
}
cout << a[n - 1] << "\n";
return 0;
} | [] | 957,406 | 957,408 | u087663048 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 100000;
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] = MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 100000000000000000;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 957,516 | 957,515 | u695206817 | cpp |
p03160 | // In The Name Of God
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define mp make_pair
#define L(x) (2 * (x))
#define R(x) ((2 * (x)) + 1)
#define pii pair<int, int>
#define pb push_back
using namespace std;
const int N = 2e6 + 5, Mod = 1e9 + 7, P = 727, Lg = 22, TOF = 1900;
int Dp[N], H[N];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> H[i];
for (int i = 2; i <= n; i++) {
Dp[i] = Dp[i - 1] + abs(H[i] - H[i - 1]);
Dp[i] = min(Dp[i], Dp[i - 2] + abs(H[i] - H[i - 2]));
}
cout << Dp[n];
return 0;
}
| // In The Name Of God
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define mp make_pair
#define L(x) (2 * (x))
#define R(x) ((2 * (x)) + 1)
#define pii pair<int, int>
#define pb push_back
using namespace std;
const int N = 2e6 + 5, Mod = 1e9 + 7, P = 727, Lg = 22, TOF = 1900;
int Dp[N], H[N];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> H[i];
for (int i = 2; i <= n; i++) {
Dp[i] = Dp[i - 1] + abs(H[i] - H[i - 1]);
if (i > 2)
Dp[i] = min(Dp[i], Dp[i - 2] + abs(H[i] - H[i - 2]));
}
cout << Dp[n];
return 0;
}
| [
"control_flow.branch.if.add"
] | 957,410 | 957,413 | u119868341 | cpp |
p03161 | #include <bits/stdc++.h>
#include <utility>
#define ll long long
#define fr first
#define sd second
using namespace std;
struct Node {
int data;
struct Node *left;
struct Node *right;
Node(int x) {
data = x;
left = NULL;
right = NULL;
}
};
#define Node struct Node
int dp[100005];
int calc(int a[], int i, int k) {
if (i == 0)
return dp[i] = 0;
int temp = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
if (dp[i - j] != -1)
dp[i - j] = calc(a, i - j, k);
temp = min(temp, abs(a[i] - a[i - j]) + dp[i - j]);
}
}
return dp[i] = temp;
}
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << calc(a, n - 1, k) << endl;
}
}
| #include <bits/stdc++.h>
#include <utility>
#define ll long long
#define fr first
#define sd second
using namespace std;
struct Node {
int data;
struct Node *left;
struct Node *right;
Node(int x) {
data = x;
left = NULL;
right = NULL;
}
};
#define Node struct Node
int dp[100005];
int calc(int a[], int i, int k) {
if (i == 0)
return dp[i] = 0;
int temp = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
if (dp[i - j] == -1)
dp[i - j] = calc(a, i - j, k);
temp = min(temp, abs(a[i] - a[i - j]) + dp[i - j]);
}
}
return dp[i] = temp;
}
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << calc(a, n - 1, k) << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,428 | 957,429 | u912221417 | cpp |
p03161 | template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int INF = 10000 * 100000;
int main() {
int n, k, i, j;
cin >> n >> k;
vector<int> h(n), dp(n, INF);
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = 1; j <= k && i + j < n; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#include <bits/stdc++.h>
using namespace std;
const int INF = 10000 * 100000;
int main() {
int n, k, i, j;
cin >> n >> k;
vector<int> h(n), dp(n, INF);
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (i = 0; i < n - 1; i++) {
for (j = 1; j <= k && i + j < n; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 957,525 | 957,526 | u383367633 | cpp |
p03161 | #include <bits/stdc++.h>
#include <utility>
#define ll long long
#define fr first
#define sd second
using namespace std;
struct Node {
int data;
struct Node *left;
struct Node *right;
Node(int x) {
data = x;
left = NULL;
right = NULL;
}
};
#define Node struct Node
int dp[100005];
int calc(int a[], int i, int k) {
if (i == 0)
return 0;
int temp = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
if (dp[i - j] != -1)
dp[i - j] = calc(a, i - j, k);
temp = min(temp, abs(a[i] - a[i - j]) + dp[i - j]);
}
}
return dp[i] = temp;
}
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << calc(a, n - 1, k) << endl;
}
}
| #include <bits/stdc++.h>
#include <utility>
#define ll long long
#define fr first
#define sd second
using namespace std;
struct Node {
int data;
struct Node *left;
struct Node *right;
Node(int x) {
data = x;
left = NULL;
right = NULL;
}
};
#define Node struct Node
int dp[100005];
int calc(int a[], int i, int k) {
if (i == 0)
return dp[i] = 0;
int temp = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
if (dp[i - j] == -1)
dp[i - j] = calc(a, i - j, k);
temp = min(temp, abs(a[i] - a[i - j]) + dp[i - j]);
}
}
return dp[i] = temp;
}
int main() {
/*freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << calc(a, n - 1, k) << endl;
}
}
| [
"assignment.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,430 | 957,429 | u912221417 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(110000, INF);
dp[0] = 0;
for (int i = 1; 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;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + k, 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;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,527 | 957,528 | u005006157 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(110000, INF);
dp[0] = 0;
for (int i = 1; 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;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(110000, 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;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,527 | 957,529 | u005006157 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(110000, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(110000, 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;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,530 | 957,529 | u005006157 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp(ll i, ll k);
int n, k;
vector<ll> ans(10010, 0);
vector<ll> field(10010, 0);
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> field.at(i);
}
ans.at(0) = 0;
ans.at(1) = abs(field.at(1) - field.at(0));
for (int i = 2; i <= n + 1; i++) {
ans.at(i) = ans.at(i - 1) + abs(field.at(i - 1) - field.at(i));
for (int o = 2; o <= k + 1; o++) {
if (i - o >= 1) {
ans.at(i) =
min(ans.at(i), ans.at(i - o) + abs(field.at(i - o) - field.at(i)));
}
}
}
cout << ans.at(n - 1) << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp(ll i, ll k);
int n, k;
vector<ll> ans(100010, 0);
vector<ll> field(100010, 0);
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> field.at(i);
}
ans.at(0) = 0;
ans.at(1) = abs(field.at(1) - field.at(0));
for (int i = 2; i < n + 1; i++) {
ans.at(i) = ans.at(i - 1) + abs(field.at(i - 1) - field.at(i));
for (int o = 2; o < k + 1; o++) {
if (i - o >= 0) {
ans.at(i) =
min(ans.at(i), ans.at(i - o) + abs(field.at(i - o) - field.at(i)));
}
}
}
cout << ans.at(n - 1) << endl;
return (0);
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 957,533 | 957,532 | u943151520 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int h[100005], k;
vector<int> mem(100005, -1);
int dp(int n);
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << dp(n) << "\n";
return 0;
}
int dp(int n) {
if (n == 1) {
mem[1] = 0;
return 0;
}
if (n == 2) {
mem[2] = abs(h[n - 1] - h[n]);
return abs(h[n - 1] - h[n]);
}
if (mem[n] < 0) {
int minv = 1000000007;
for (int i = 1; i <= k; i++) {
minv = min(minv, abs(h[n] - h[n - i]) + dp(n - i));
}
mem[n] = minv;
}
return mem[n];
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int h[100005], k;
vector<int> mem(100005, -1);
int dp(int n);
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << dp(n) << "\n";
return 0;
}
int dp(int n) {
if (n == 1) {
mem[1] = 0;
return 0;
}
if (n == 2) {
mem[2] = abs(h[n - 1] - h[n]);
return abs(h[n - 1] - h[n]);
}
if (mem[n] < 0) {
int minv = 1000000007;
for (int i = 1; i <= k && n - i > 0; i++) {
minv = min(minv, abs(h[n] - h[n - i]) + dp(n - i));
}
mem[n] = minv;
}
return mem[n];
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 957,534 | 957,535 | u976853924 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0 << endl;
return;
}
vector<int> a(n);
vector<int> dp(n, 100000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
} else {
break;
}
}
}
cout << dp[n - 1] << endl;
return;
}
int main() {
// your code goes here
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0 << endl;
return;
}
vector<int> a(n);
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
} else {
break;
}
}
}
cout << dp[n - 1] << endl;
return;
}
int main() {
// your code goes here
solve();
return 0;
}
| [
"call.arguments.change"
] | 957,536 | 957,537 | u956355198 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
int solve(int n, int k, vector<int> h) {
vector<int> dp(n, 10005);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
cout << solve(n, k, h) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
int solve(int n, int k, vector<int> h) {
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
cout << solve(n, k, h) << endl;
} | [
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 957,550 | 957,549 | u166553470 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int j = 1; j < n; j++) {
dp[j] = 100000;
for (int K = 1; K <= k; K++) {
if (K <= j) {
long x = fabs(arr[j] - arr[j - K]) + dp[j - K];
if (dp[j] > x)
dp[j] = x;
}
}
}
cout << dp[n - 1] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int j = 1; j < n; j++) {
dp[j] = INT_MAX;
for (int K = 1; K <= k; K++) {
if (K <= j) {
long x = fabs(arr[j] - arr[j - K]) + dp[j - K];
if (dp[j] > x)
dp[j] = x;
}
}
}
cout << dp[n - 1] << "\n";
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,566 | 957,567 | u349445356 | cpp |
p03161 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 1; i < n; i++) {
dp[i] = 1000;
// dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]), dp[i-2]+abs(a[i]-a[i-2]));
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
// dp[i]=min(dp[i-1]+abs(a[i]-a[i-1]), dp[i-2]+abs(a[i]-a[i-2]));
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,568 | 957,569 | u121552449 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k;
cin >> n >> k;
lli arr[n];
for (lli i = 0; i < n; i++)
cin >> arr[i];
vector<lli> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (lli i = 2; i < n; i++) {
for (lli j = 1; j <= min(n, k); j++)
dp[i] = min(dp[i - j] + abs(arr[i] - arr[i - j]), dp[i]);
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k;
cin >> n >> k;
lli arr[n];
for (lli i = 0; i < n; i++)
cin >> arr[i];
vector<lli> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (lli i = 2; i < n; i++) {
for (lli j = 1; j <= min(i, k); j++)
dp[i] = min(dp[i - j] + abs(arr[i] - arr[i - j]), dp[i]);
}
cout << dp[n - 1];
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,570 | 957,571 | u175618319 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k;
cin >> n >> k;
lli arr[n];
for (lli i = 0; i < n; i++)
cin >> arr[i];
vector<lli> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (lli i = 2; i < n; i++) {
for (lli j = 1; j <= k; j++)
dp[i] = min(dp[i - j] + abs(arr[i] - arr[i - j]), dp[i]);
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
lli n, k;
cin >> n >> k;
lli arr[n];
for (lli i = 0; i < n; i++)
cin >> arr[i];
vector<lli> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (lli i = 2; i < n; i++) {
for (lli j = 1; j <= min(i, k); j++)
dp[i] = min(dp[i - j] + abs(arr[i] - arr[i - j]), dp[i]);
}
cout << dp[n - 1];
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 957,572 | 957,571 | u175618319 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#define ll long long int
#define md 1000000007
#define pb emplace_back
#define all(s) s.begin(), s.end()
typedef vector<int> vi;
typedef vector<bool> vb;
void solve() {
int n = 0, k = 0;
cin >> n >> k;
vi st(n + 1);
for (int i = 1; i <= n; i++) {
cin >> st[i];
}
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(st[2] - st[1]);
if (n == 2) {
cout << dp[2] << "\n";
return;
}
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + abs(st[i - 1] - st[i]);
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
int a = dp[i - j] + abs(st[i] - st[i - j]);
dp[i] = min(a, dp[i]);
}
}
}
cout << dp[n] << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#define ll long long int
#define md 1000000007
#define pb emplace_back
#define all(s) s.begin(), s.end()
typedef vector<int> vi;
typedef vector<bool> vb;
void solve() {
int n = 0, k = 0;
cin >> n >> k;
vi st(n + 1);
for (int i = 1; i <= n; i++) {
cin >> st[i];
}
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(st[2] - st[1]);
if (n == 2) {
cout << dp[2] << "\n";
return;
}
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + abs(st[i - 1] - st[i]);
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
int a = dp[i - j] + abs(st[i] - st[i - j]);
dp[i] = min(a, dp[i]);
}
}
}
cout << dp[n] << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,576 | 957,577 | u284269175 | cpp |
p03161 | /*https://atcoder.jp/contests/dp/tasks/dp_b*/
#include <bits/stdc++.h>
#include <sstream>
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define pi 2 * acos(0.0)
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define repe(i, a, b) for (ll i = a; i <= b; ++i)
#define CPrint(c) \
for (auto i : (c)) { \
cout << i << " "; \
} \
nl
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define sz(a) int((a).size())
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
// Allows to traverse any type of macro
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
// debuggers
#define trace2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl
#define trace3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z \
<< endl
#define trace4(w, x, y, z) \
cout << #w << "=" << w << " " << #x << "=" << x << " " << #y << "=" << y \
<< " " << #z << "=" << z << endl
typedef long long ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 5;
int main() {
FAST_IO;
ll n, k;
cin >> n >> k;
vector<ll> dp(n, INF);
dp[0] = 0; // base case
vector<ll> h(n);
rep(i, 0, n) { cin >> h[i]; }
/* i+1.. i+k abs(h[i]-h[j])
*/
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
#include <sstream>
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define pi 2 * acos(0.0)
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define repe(i, a, b) for (ll i = a; i <= b; ++i)
#define CPrint(c) \
for (auto i : (c)) { \
cout << i << " "; \
} \
nl
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define sz(a) int((a).size())
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
// Allows to traverse any type of macro
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
// debuggers
#define trace2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl
#define trace3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z \
<< endl
#define trace4(w, x, y, z) \
cout << #w << "=" << w << " " << #x << "=" << x << " " << #y << "=" << y \
<< " " << #z << "=" << z << endl
typedef long long ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 5;
int main() {
FAST_IO;
ll n, k;
cin >> n >> k;
vector<ll> dp(n, INF);
dp[0] = 0; // base case
vector<ll> h(n);
rep(i, 0, n) { cin >> h[i]; }
/* i+1.. i+k abs(h[i]-h[j])
*/
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 957,586 | 957,587 | u466328955 | cpp |
p03161 | /*https://atcoder.jp/contests/dp/tasks/dp_b*/
#include <bits/stdc++.h>
#include <sstream>
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define pi 2 * acos(0.0)
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define repe(i, a, b) for (ll i = a; i <= b; ++i)
#define CPrint(c) \
for (auto i : (c)) { \
cout << i << " "; \
} \
nl
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define sz(a) int((a).size())
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
// Allows to traverse any type of macro
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
// debuggers
#define trace2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl
#define trace3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z \
<< endl
#define trace4(w, x, y, z) \
cout << #w << "=" << w << " " << #x << "=" << x << " " << #y << "=" << y \
<< " " << #z << "=" << z << endl
typedef long long ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 5;
int main() {
FAST_IO;
ll n, k;
cin >> n >> k;
vector<ll> dp(n, INF);
dp[0] = 0; // base case
vector<ll> h(n);
rep(i, 0, n) { cin >> h[i]; }
/* i+1.. i+k abs(h[i]-h[j])
*/
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
| /*https://atcoder.jp/contests/dp/tasks/dp_b*/
#include <bits/stdc++.h>
#include <sstream>
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define pi 2 * acos(0.0)
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define repe(i, a, b) for (ll i = a; i <= b; ++i)
#define CPrint(c) \
for (auto i : (c)) { \
cout << i << " "; \
} \
nl
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define sz(a) int((a).size())
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
// Allows to traverse any type of macro
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
// debuggers
#define trace2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl
#define trace3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z \
<< endl
#define trace4(w, x, y, z) \
cout << #w << "=" << w << " " << #x << "=" << x << " " << #y << "=" << y \
<< " " << #z << "=" << z << endl
typedef long long ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 5;
int main() {
FAST_IO;
ll n, k;
cin >> n >> k;
vector<ll> dp(n, INF);
dp[0] = 0; // base case
vector<ll> h(n);
rep(i, 0, n) { cin >> h[i]; }
/* i+1.. i+k abs(h[i]-h[j])
*/
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 957,586 | 957,588 | u466328955 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, k;
int height[100001];
int dp[100002];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> height[i];
fill(dp, dp + n, 100000ll);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (i <= k) {
for (int j = 0; j <= i; j++) {
dp[i] = min(dp[i], dp[j] + abs(height[i] - height[j]));
}
} else {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(height[i] - height[i - j]));
}
}
// cout << dp[i] << endl ;
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n, k;
int height[100001];
int dp[100002];
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> height[i];
fill(dp, dp + n, LONG_LONG_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (i <= k) {
for (int j = 0; j <= i; j++) {
dp[i] = min(dp[i], dp[j] + abs(height[i] - height[j]));
}
} else {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(height[i] - height[i - j]));
}
}
// cout << dp[i] << endl ;
}
cout << dp[n - 1] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 957,589 | 957,590 | u287226050 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
long long int min(long long int a, long long int b) {
if (a < b)
return a;
else
return b;
}
int main() {
long long int n, k;
cin >> n >> k;
long long int ans[n];
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ans[1] = abs(a[0] - a[1]);
ans[0] = 0;
for (int i = 2; i < n; i++) {
long long int min = 100000;
int j = i - 1;
long long int count = k;
while (count != 0 && j >= 0) {
long long int s = ans[j] + abs(a[i] - a[j]);
if (min > s)
min = s;
count--;
j--;
}
ans[i] = min;
// cout<<min<<" ";
}
cout << ans[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
long long int min(long long int a, long long int b) {
if (a < b)
return a;
else
return b;
}
int main() {
long long int n, k;
cin >> n >> k;
long long int ans[n];
long long int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ans[1] = abs(a[0] - a[1]);
ans[0] = 0;
for (int i = 2; i < n; i++) {
long long int min = 1000000000;
int j = i - 1;
long long int count = k;
while (count != 0 && j >= 0) {
long long int s = ans[j] + abs(a[i] - a[j]);
if (min > s)
min = s;
count--;
j--;
}
ans[i] = min;
// cout<<min<<" ";
}
cout << ans[n - 1];
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 957,595 | 957,594 | u671595716 | cpp |
p03161 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
// int n, k, heights[100000] = {40, 10, 20, 70, 80, 10, 20, 70, 80, 60};
int n, k, heights[100005];
std::vector<int> dp(105, -1);
int min_cost(int ind) {
int branch_cost[k];
if (dp.at(ind) != -1)
return dp.at(ind);
if (ind == n - 1)
return 0;
if (ind >= n)
return INT_MAX;
for (int i = 0; i < k; i++) {
// cout<<"\n"<<heights[ind]<<"\t"<<heights[ind+1]<<"\t"<<heights[ind+2]<<endl;
if (ind + i + 1 < n) {
// cout<<"\n i that passes : "<<ind;
// cout<<"\n diff: "<<abs(heights[ind] - heights[ind+i+1]);
branch_cost[i] =
abs(heights[ind] - heights[ind + i + 1]) + min_cost(ind + i + 1);
// cout<<"\nbranch cost for branch "<<i<<" "<<branch_cost[i];
}
}
int min = INT_MAX;
for (int i = 0; i < k; i++) {
if (branch_cost[i] < min && ind + i + 1 < n)
min = branch_cost[i];
}
dp.at(ind) = min;
return min;
}
int main() {
// cout<<"Enter no of stones:";
cin >> n;
// n = 10;
// cout<<"\nEnter K:";
cin >> k;
// k = 4;
// cout<<"\nEnter heights:";
for (int i = 0; i < n; i++)
cin >> heights[i];
// heights = {10, 30, 40, 50, 20};
// cout<<"\nmin_cost:"<<min_cost(0);
cout << min_cost(0);
} | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
// int n, k, heights[100000] = {40, 10, 20, 70, 80, 10, 20, 70, 80, 60};
int n, k, heights[100005];
// int n, k, heights[100000] = {10, 30, 40, 50, 20};
std::vector<int> dp(100005, -1);
int min_cost(int ind) {
int branch_cost[k];
if (dp.at(ind) != -1)
return dp.at(ind);
if (ind == n - 1)
return 0;
if (ind >= n)
return INT_MAX;
for (int i = 0; i < k; i++) {
// cout<<"\n"<<heights[ind]<<"\t"<<heights[ind+1]<<"\t"<<heights[ind+2]<<endl;
if (ind + i + 1 < n) {
// cout<<"\n i that passes : "<<ind;
// cout<<"\n diff: "<<abs(heights[ind] - heights[ind+i+1]);
branch_cost[i] =
abs(heights[ind] - heights[ind + i + 1]) + min_cost(ind + i + 1);
// cout<<"\nbranch cost for branch "<<i<<" "<<branch_cost[i];
}
}
int min = INT_MAX;
for (int i = 0; i < k; i++) {
if (branch_cost[i] < min && ind + i + 1 < n)
min = branch_cost[i];
}
dp.at(ind) = min;
return min;
}
int main() {
// cout<<"Enter no of stones:";
cin >> n;
// n = 10;
// n = 5;
// cout<<"\nEnter K:";
cin >> k;
// k = 4;
// k = 3;
// cout<<"\nEnter heights:";
for (int i = 0; i < n; i++)
cin >> heights[i];
// heights = {10, 30, 40, 50, 20};
// cout<<"\nmin_cost:"<<min_cost(0);
cout << min_cost(0);
} | [
"literal.number.change",
"call.arguments.change"
] | 957,598 | 957,599 | u878229184 | cpp |
p03161 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
// int n, k, heights[100000] = {40, 10, 20, 70, 80, 10, 20, 70, 80, 60};
int n, k, heights[100000];
std::vector<int> dp(100, -1);
int min_cost(int ind) {
int branch_cost[k];
if (dp.at(ind) != -1)
return dp.at(ind);
if (ind == n - 1)
return 0;
if (ind >= n)
return INT_MAX;
for (int i = 0; i < k; i++) {
// cout<<"\n"<<heights[ind]<<"\t"<<heights[ind+1]<<"\t"<<heights[ind+2]<<endl;
if (ind + i + 1 < n) {
// cout<<"\n i that passes : "<<ind;
// cout<<"\n diff: "<<abs(heights[ind] - heights[ind+i+1]);
branch_cost[i] =
abs(heights[ind] - heights[ind + i + 1]) + min_cost(ind + i + 1);
// cout<<"\nbranch cost for branch "<<i<<" "<<branch_cost[i];
}
}
int min = INT_MAX;
for (int i = 0; i < k; i++) {
if (branch_cost[i] < min && ind + i + 1 < n)
min = branch_cost[i];
}
dp.at(ind) = min;
return min;
}
int main() {
// cout<<"Enter no of stones:";
cin >> n;
// n = 10;
// cout<<"\nEnter K:";
cin >> k;
// k = 4;
// cout<<"\nEnter heights:";
for (int i = 0; i < n; i++)
cin >> heights[i];
// heights = {10, 30, 40, 50, 20};
// cout<<"\nmin_cost:"<<min_cost(0);
cout << min_cost(0);
} | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
// int n, k, heights[100000] = {40, 10, 20, 70, 80, 10, 20, 70, 80, 60};
int n, k, heights[100005];
// int n, k, heights[100000] = {10, 30, 40, 50, 20};
std::vector<int> dp(100005, -1);
int min_cost(int ind) {
int branch_cost[k];
if (dp.at(ind) != -1)
return dp.at(ind);
if (ind == n - 1)
return 0;
if (ind >= n)
return INT_MAX;
for (int i = 0; i < k; i++) {
// cout<<"\n"<<heights[ind]<<"\t"<<heights[ind+1]<<"\t"<<heights[ind+2]<<endl;
if (ind + i + 1 < n) {
// cout<<"\n i that passes : "<<ind;
// cout<<"\n diff: "<<abs(heights[ind] - heights[ind+i+1]);
branch_cost[i] =
abs(heights[ind] - heights[ind + i + 1]) + min_cost(ind + i + 1);
// cout<<"\nbranch cost for branch "<<i<<" "<<branch_cost[i];
}
}
int min = INT_MAX;
for (int i = 0; i < k; i++) {
if (branch_cost[i] < min && ind + i + 1 < n)
min = branch_cost[i];
}
dp.at(ind) = min;
return min;
}
int main() {
// cout<<"Enter no of stones:";
cin >> n;
// n = 10;
// n = 5;
// cout<<"\nEnter K:";
cin >> k;
// k = 4;
// k = 3;
// cout<<"\nEnter heights:";
for (int i = 0; i < n; i++)
cin >> heights[i];
// heights = {10, 30, 40, 50, 20};
// cout<<"\nmin_cost:"<<min_cost(0);
cout << min_cost(0);
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change"
] | 957,600 | 957,599 | u878229184 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> arr, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 0 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n + 1);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
cout << solve(arr, n, k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> arr, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n + 1);
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
cout << solve(arr, n, k);
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,601 | 957,602 | u783213079 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, a[100005], dp[100005], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, 0x7f7f7f, sizeof(dp));
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(a[i - j] - a[i]) + dp[i - j]);
}
}
cout << dp[n] << '\n';
} | #include <bits/stdc++.h>
using namespace std;
long long n, a[100005], dp[100005], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, 0x7f7f7f, sizeof(dp));
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], abs(a[i - j] - a[i]) + dp[i - j]);
}
}
cout << dp[n] << '\n';
} | [
"control_flow.loop.for.condition.change"
] | 957,603 | 957,604 | u844973506 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c, h[100005], dp[100005] = {};
int k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 100000;
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
c = min(i - 1, k);
for (int j = 1; j <= c; j++) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[n] << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, h[100005], dp[100005] = {};
int k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 1000000000;
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
c = min(i - 1, k);
for (int j = 1; j <= c; j++) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[n] << endl;
return (0);
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"assignment.value.change"
] | 957,608 | 957,606 | u490965711 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, c, h[100005], dp[100005] = {};
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 100000;
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
c = min(i - 1, k);
for (int j = 1; j <= c; j++) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[n] << endl;
return (0);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, h[100005], dp[100005] = {};
int k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 1000000000;
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
c = min(i - 1, k);
for (int j = 1; j <= c; j++) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[n] << endl;
return (0);
}
| [
"variable_declaration.remove",
"variable_declaration.add",
"literal.number.change",
"assignment.value.change"
] | 957,609 | 957,606 | u490965711 | cpp |
p03161 | #include <cmath>
#include <iostream>
//#include<cstring>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
for (int i = 0; i < n - 1; i++)
dp[i] = 10000;
dp[n - 1] = 0;
for (int i = n - 2; i >= n - k; i--) {
for (int j = i + 1; j < n; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
for (int i = n - k - 1; i >= 0; i--) {
for (int j = i + 1; j <= i + k; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[0] << endl;
// for(int i=0;i<n;i++)
// cout<<dp[i]<<" ";
return 0;
}
| #include <cmath>
#include <iostream>
//#include<cstring>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
long long int dp[n];
for (int i = 0; i < n - 1; i++)
dp[i] = 100000000000;
dp[n - 1] = 0;
for (int i = n - 2; i >= n - k; i--) {
for (int j = i + 1; j < n; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
for (int i = n - k - 1; i >= 0; i--) {
for (int j = i + 1; j <= i + k; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[0] << endl;
// for(int i=0;i<n;i++)
// cout<<dp[i]<<" ";
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 957,612 | 957,611 | u572600743 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long N = 100000;
int K = 100;
vector<long long> h(N);
vector<long long> c(N, 10000);
int main() {
cin >> N >> K;
for (long long i = 0; i < N; i++)
cin >> h.at(i);
c.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = max(i - K, 0); j < i; j++) {
c.at(i) = min(c.at(i), c.at(j) + abs(h.at(i) - h.at(j)));
}
}
cout << c.at(N - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long N = 100000;
int K = 100;
vector<long long> h(N);
vector<long long> c(N, 1e13);
int main() {
cin >> N >> K;
for (long long i = 0; i < N; i++)
cin >> h.at(i);
c.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = max(i - K, 0); j < i; j++) {
c.at(i) = min(c.at(i), c.at(j) + abs(h.at(i) - h.at(j)));
}
}
cout << c.at(N - 1) << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 957,619 | 957,620 | u548601871 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
cin >> n >> k;
vector<int> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
long long dp[n + 1];
dp[0] = dp[1] = 0;
k = min(k, n);
for (i = 2; i <= n; i++)
dp[i] = INT_MAX;
for (i = 2; i <= n; i++) {
for (j = i - 2; j >= max(0, i - k); j--)
dp[i] = min(abs(v[i - 1] - v[j]) + dp[j], dp[i]);
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
cin >> n >> k;
vector<int> v(n);
for (i = 0; i < n; i++) {
cin >> v[i];
}
long long dp[n + 1];
dp[0] = dp[1] = 0;
k = min(k, n);
for (i = 2; i <= n; i++)
dp[i] = INT_MAX;
for (i = 2; i <= n; i++) {
for (j = i - 2; j >= max(0, i - k - 1); j--)
dp[i] = min(abs(v[i - 1] - v[j]) + dp[j + 1], dp[i]);
// cout<<dp[i]<<" ";
}
cout << dp[n];
}
| [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 957,621 | 957,622 | u540443494 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k;
cin.tie(0);
cout.tie(0);
cin >> n >> k;
vector<int> v;
v.push_back(0);
for (int i = 0; i < n; i++) {
cin >> m;
v.push_back(m);
}
int dp[n + 1];
for (int i = 1; i <= n; i++)
dp[i] = 200000;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
// cout<<"i"<<i<<"\n";
for (int j = i - 1; j > 0 and j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
// cout<<dp[i]<<"\n";
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, k;
cin.tie(0);
cout.tie(0);
cin >> n >> k;
vector<int> v;
v.push_back(0);
for (int i = 0; i < n; i++) {
cin >> m;
v.push_back(m);
}
long long int dp[n + 1];
for (int i = 1; i <= n; i++)
dp[i] = 2000000000;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
// cout<<"i"<<i<<"\n";
for (int j = i - 1; j > 0 and j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
// cout<<dp[i]<<"\n";
}
cout << dp[n];
} | [
"literal.number.change",
"assignment.value.change"
] | 957,623 | 957,624 | u367343855 | 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, INT_MAX);
dp[0] = h[0];
dp[1] = abs(dp[0] - h[1]);
for (int i = 2; i < n; i++) {
int j = 1;
while (j <= k && (i - j) >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
j++;
}
}
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, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int j = 1;
while (j <= k && (i - j) >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
j++;
}
}
cout << dp[n - 1] << endl;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,625 | 957,626 | u204158532 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int i, j;
cin >> N >> K;
vector<int> d(N);
vector<int> h(N);
for (i = 0; i < N; i++) {
cin >> h[i];
d[i] = 20000;
}
d[0] = 0;
for (i = 1; i < N; i++)
for (j = max(0, i - K); j < i; j++)
d[i] = min(d[i], d[j] + abs(h[i] - h[j]));
std::cout << d[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int i, j;
cin >> N >> K;
vector<int> d(N);
vector<int> h(N);
for (i = 0; i < N; i++) {
cin >> h[i];
d[i] = INT_MAX;
}
d[0] = 0;
for (i = 1; i < N; i++)
for (j = max(0, i - K); j < i; j++)
d[i] = min(d[i], d[j] + abs(h[i] - h[j]));
std::cout << d[N - 1];
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,627 | 957,628 | u900753971 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define fr(i, j, p) for (int i = j; i < p; i++)
#define frr(i, j, p) for (int i = j; i >= p; i--)
#define PI 3.14159265358979323846
#define pb push_back
#define mkp make_pair
#define print(m) std::cout << std::fixed << std::setprecision(11) << m << endl;
#define ff first
#define ss second
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
h[0] = 0;
fr(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
fr(i, 3, n + 1) {
int mn = INT_MAX;
for (int j = max(0, i - k); j < i; j++) {
mn = min(mn, dp[j] + abs(h[i] - h[j]));
}
dp[i] = mn;
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define fr(i, j, p) for (int i = j; i < p; i++)
#define frr(i, j, p) for (int i = j; i >= p; i--)
#define PI 3.14159265358979323846
#define pb push_back
#define mkp make_pair
#define print(m) std::cout << std::fixed << std::setprecision(11) << m << endl;
#define ff first
#define ss second
#define mod 1000000007
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
h[0] = 0;
fr(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
fr(i, 3, n + 1) {
int mn = INT_MAX;
for (int j = max(1, i - k); j < i; j++) {
mn = min(mn, dp[j] + abs(h[i] - h[j]));
}
dp[i] = mn;
}
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 957,631 | 957,632 | u806307372 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll mod = 998244353;
int main() {
ll n, k, i;
cin >> n >> k;
ll h[n];
for (i = 0; i < n; i++)
cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (i = 3; i <= n; i++) {
dp[i] = INT_MAX;
int j = 1;
while (j <= k && i - k > 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - 1] - h[i - 1 - j]));
j++;
}
// dp[i]=min(dp[i-2]+abs(h[i-1]-h[i-3]),dp[i-1]+abs(h[i-1]-h[i-2]));
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
ll mod = 998244353;
int main() {
ll n, k, i;
cin >> n >> k;
ll h[n];
for (i = 0; i < n; i++)
cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (i = 3; i <= n; i++) {
dp[i] = INT_MAX;
int j = 1;
while (j <= k && i - j > 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - 1] - h[i - 1 - j]));
j++;
}
// dp[i]=min(dp[i-2]+abs(h[i-1]-h[i-3]),dp[i-1]+abs(h[i-1]-h[i-2]));
}
cout << dp[n];
return 0;
} | [
"identifier.change",
"control_flow.loop.condition.change"
] | 957,641 | 957,642 | u362345573 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;
vector<int> dp(100010, INF);
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
rep(i, N) {
int min_cost = INF;
for (int k = 1; k <= K; k++) {
if (i - k < 0)
continue;
dp[i] = min(dp[i - k] + abs(H[i - k] - H[i]), min_cost);
}
}
print(dp[N - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
template <class T> void print(vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back())
cout << " ";
}
cout << endl;
}
template <class T> void print(vector<vector<T>> &df) {
for (auto &vec : df) {
print(vec);
}
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;
vector<int> dp(100010, INF);
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
rep(i, N) {
int min_cost = INF;
for (int k = 1; k <= K; k++) {
if (i - k < 0)
continue;
dp[i] = min(dp[i - k] + abs(H[i - k] - H[i]), dp[i]);
}
}
print(dp[N - 1]);
return 0;
} | [
"assignment.value.change",
"call.arguments.change"
] | 957,643 | 957,644 | u896941378 | cpp |
p03161 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> a(N);
vector<LL> dp(N);
dp.assign(N, 10005);
for (int i = 0; i < N; ++i)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; ++i)
for (int j = max(0, i - K); j < i; ++j)
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define LL long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> a(N);
vector<LL> dp(N);
dp.assign(N, 100000000000005);
for (int i = 0; i < N; ++i)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; ++i)
for (int j = max(0, i - K); j < i; ++j)
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 957,652 | 957,651 | u969876522 | cpp |
p03161 | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> a(N);
vector<int> dp(N);
dp.assign(N, 10005);
for (int i = 0; i < N; ++i)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; ++i)
for (int j = max(0, i - K); j < i; ++j)
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define LL long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N, K;
cin >> N >> K;
vector<int> a(N);
vector<LL> dp(N);
dp.assign(N, 100000000000005);
for (int i = 0; i < N; ++i)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; ++i)
for (int j = max(0, i - K); j < i; ++j)
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 957,653 | 957,651 | u969876522 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,avx2,fma,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
ll mod = 1e9 + 7;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
//#######################################
int main() {
boost;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1] = {};
// memset(dp,,sizeof dp);
// cout<<dp[0]<<"\n";
for (int i = 0; i < n + 1; i++) {
dp[i] = 100000;
}
dp[0] = 0;
// dp[1]=abs(a[1]-a[0]);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n - 1];
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,avx2,fma,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
typedef long long ll;
ll mod = 1e9 + 7;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
n >>= 1;
}
return res;
}
//#######################################
int main() {
boost;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1] = {};
// memset(dp,,sizeof dp);
// cout<<dp[0]<<"\n";
for (int i = 0; i < n + 1; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
// dp[1]=abs(a[1]-a[0]);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n - 1];
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,663 | 957,664 | u060999774 | cpp |
p03161 | #include <bits/stdc++.h>
#define MAXN 100005
#define ll long long
using namespace std;
ll dp[MAXN];
int n, k;
vector<ll> v;
ll solve(int i) {
if (i < 0)
return 0;
if (dp[i] >= 0) {
return dp[i];
}
ll res1 = -1;
for (int j = 1; j <= k; ++j)
if (res1 != -1)
res1 = min(res1, abs(v[i] - v[i - j]) + solve(i - j));
else
res1 = abs(v[i] - v[i - j]) + solve(i - j);
dp[i] = res1;
return dp[i];
}
int main() {
ll num;
cin >> n >> k;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; ++i) {
cin >> num;
v.push_back(num);
}
dp[0] = 0LL;
dp[1] = abs(v[0] - v[1]);
cout << solve(n - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
#define MAXN 100005
#define ll long long
using namespace std;
ll dp[MAXN];
int n, k;
vector<ll> v;
ll solve(int i) {
if (i < 0)
return 0;
if (dp[i] >= 0) {
return dp[i];
}
ll res1 = -1;
for (int j = 1; j <= min(k, i); ++j)
if (res1 != -1)
res1 = min(res1, abs(v[i] - v[i - j]) + solve(i - j));
else
res1 = abs(v[i] - v[i - j]) + solve(i - j);
dp[i] = res1;
return dp[i];
}
int main() {
ll num;
cin >> n >> k;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; ++i) {
cin >> num;
v.push_back(num);
}
dp[0] = 0LL;
dp[1] = abs(v[0] - v[1]);
cout << solve(n - 1) << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 957,671 | 957,672 | u405808586 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> dp(n, INT_MAX);
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> dp(n, INT_MAX);
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k && i - j >= 0; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,673 | 957,674 | u964364251 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
vector<long long> dp(n + 1, 100000);
for (long long i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (long long i = 0; i < n; i++) {
for (long long j = 1; j <= k && i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1];
// for(long long i=0;i<n;i++) cout << dp[i]<<" ";
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
vector<long long> dp(n + 1, 1e13);
for (long long i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (long long i = 0; i < n; i++) {
for (long long j = 1; j <= k && i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1];
// for(long long i=0;i<n;i++) cout << dp[i]<<" ";
} | [
"literal.number.change",
"call.arguments.change"
] | 957,675 | 957,676 | u591322332 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long int n, k;
const long long int x = 100000;
long long int a[x];
long long int dp[x + 10];
long long int frog_jump(int i) {
long long int next = INT_MAX, ans = INT_MAX;
if (i + 1 == n)
return 0;
if (dp[i] != -1)
return dp[i];
for (int j = 1; j <= k; j++) {
if (i + j < n - 1) {
next = abs(a[i] - a[i + j]) + frog_jump(i + j);
ans = min(ans, next);
dp[i] = ans;
}
}
return dp[i];
}
int main() {
long long int result;
memset(dp, -1, sizeof(dp));
cin >> n;
cin >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
result = frog_jump(0);
cout << result << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long int n, k;
const long long int x = 100000;
long long int a[x];
long long int dp[x + 10];
long long int frog_jump(int i) {
long long int next = INT_MAX, ans = INT_MAX;
if (i + 1 == n)
return 0;
if (dp[i] != -1)
return dp[i];
for (int j = 1; j <= k; j++) {
if (i + j <= n - 1) {
next = abs(a[i] - a[i + j]) + frog_jump(i + j);
ans = min(ans, next);
dp[i] = ans;
}
}
return dp[i];
}
int main() {
long long int result;
memset(dp, -1, sizeof(dp));
cin >> n;
cin >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
result = frog_jump(0);
cout << result << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,677 | 957,678 | u471005830 | cpp |
p03161 | #include <iostream>
using namespace std;
const int MAX_N = 12345;
int n, k, stone[MAX_N], f[MAX_N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> stone[i];
f[1] = 0;
for (int i = 2; i <= n; i++) {
int j = i - 1;
f[i] = f[j] + abs(stone[i] - stone[j]);
j--;
while (j > 0 && j >= i - k) {
if (f[j] + abs(stone[i] - stone[j]) < f[i])
f[i] = f[j] + abs(stone[i] - stone[j]);
j--;
}
cout << f[i] << endl;
}
return 0;
} | #include <iostream>
using namespace std;
const int MAX_N = 102345;
int n, k, stone[MAX_N], f[MAX_N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> stone[i];
f[1] = 0;
for (int i = 2; i <= n; i++) {
int j = i - 1;
f[i] = f[j] + abs(stone[i] - stone[j]);
j--;
while (j > 0 && j >= i - k) {
if (f[j] + abs(stone[i] - stone[j]) < f[i])
f[i] = f[j] + abs(stone[i] - stone[j]);
j--;
}
}
cout << f[n] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 957,683 | 957,682 | u214691308 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> ans(N, INF);
ans.at(0) = 0;
for (size_t i = 0; i < N + 1; i++) {
for (size_t j = 1; j < K + 1; j++) {
if (i + j > N) {
continue;
}
ans.at(i + j) =
min(ans.at(i) + abs(A.at(i + j) - A.at(i)), ans.at(i + j));
}
}
cout << ans.at(N - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> ans(1 + N, INF);
ans.at(0) = 0;
for (size_t i = 0; i < N + 1; i++) {
for (size_t j = 1; j < K + 1; j++) {
if (i + j > N) {
continue;
}
ans.at(i + j) =
min(ans.at(i) + abs(A.at(i + j) - A.at(i)), ans.at(i + j));
}
}
cout << ans.at(N - 1) << endl;
return 0;
} | [
"assignment.change"
] | 957,696 | 957,697 | u005072763 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> ans(2, INF);
ans.at(0) = 0;
for (size_t i = 0; i < N + 1; i++) {
for (size_t j = 1; j < K + 1; j++) {
if (i + j > N) {
continue;
}
ans.at(i + j) =
min(ans.at(i) + abs(A.at(i + j) - A.at(i)), ans.at(i + j));
}
}
cout << ans.at(N - 1) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1 << 30;
int main() {
int N = 0;
cin >> N;
int K = 0;
cin >> K;
vector<int> A(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<int> ans(1 + N, INF);
ans.at(0) = 0;
for (size_t i = 0; i < N + 1; i++) {
for (size_t j = 1; j < K + 1; j++) {
if (i + j > N) {
continue;
}
ans.at(i + j) =
min(ans.at(i) + abs(A.at(i + j) - A.at(i)), ans.at(i + j));
}
}
cout << ans.at(N - 1) << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 957,698 | 957,697 | u005072763 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int solve(vi &a, int n, int k) {
int dp[n + 1] = {0};
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = inf;
for (int j = 1; j <= k; ++j) {
if (i >= j) {
int op = abs(a[i] - a[i - j]) + dp[i - j];
dp[i] = min(dp[i], op);
}
}
}
return dp[n];
}
int32_t main() {
FIO;
int n, k;
cin >> n >> k;
vi a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a[i];
cout << solve(a, n, k) << '\n';
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int solve(vi &a, int n, int k) {
int dp[n + 1] = {0};
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = inf;
for (int j = 1; j <= k; ++j) {
if (i > j) {
int op = abs(a[i] - a[i - j]) + dp[i - j];
dp[i] = min(dp[i], op);
}
}
}
return dp[n];
}
int32_t main() {
FIO;
int n, k;
cin >> n >> k;
vi a(n + 1);
for (int i = 1; i <= n; ++i)
cin >> a[i];
cout << solve(a, n, k) << '\n';
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,706 | 957,707 | u476737806 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define ff first
#define ss second
#define INF (ll)1e9
#define tt \
ll testcase; \
cin >> testcase; \
while (testcase--)
int main() {
fast;
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, (int)1e5);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(i, k); j++) {
if (dp[i - j] + abs(h[i] - h[i - j]) < dp[i]) {
dp[i] = dp[i - j] + abs(h[i] - h[i - j]);
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define ff first
#define ss second
#define INF (ll)1e9
#define tt \
ll testcase; \
cin >> testcase; \
while (testcase--)
int main() {
fast;
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, (int)1e9);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(i, k); j++) {
if (dp[i - j] + abs(h[i] - h[i - j]) < dp[i]) {
dp[i] = dp[i - j] + abs(h[i] - h[i - j]);
}
}
}
cout << dp[n - 1];
} | [
"literal.number.change",
"call.arguments.change"
] | 957,715 | 957,716 | u866172338 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, j, i;
cin >> n >> k;
vector<long long> h(n), dp(n, 100000);
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
for (j = i - 1; j >= 0 && j >= i - k; j--)
dp[i] = min(abs(h[i] - h[j]) + dp[j], dp[i]);
}
cout << dp[n - 1] << endl;
/* for(i=0;i<n;i++)
cout<<dp[i]<<" ";*/
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, j, i;
cin >> n >> k;
vector<long long> h(n), dp(n, 1000000000000);
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
for (j = i - 1; j >= 0 && j >= i - k; j--)
dp[i] = min(abs(h[i] - h[j]) + dp[j], dp[i]);
}
cout << dp[n - 1] << endl;
/* for(i=0;i<n;i++)
cout<<dp[i]<<" ";*/
} | [
"literal.number.change",
"call.arguments.change"
] | 957,721 | 957,722 | u837254382 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll Inf = (1U << 8) - 1;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
vector<ll> dp(n + k + 100, Inf);
dp[0] = 0;
for (ll i = 0; i < n; ++i) {
for (ll j = 1; j <= k; ++j) {
ll c = dp[i] + abs(h[i + j] - h[i]);
dp[i + j] = min(dp[i + j], c);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll Inf = (1U << 62) - 1;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
vector<ll> dp(n + k + 100, Inf);
dp[0] = 0;
for (ll i = 0; i < n; ++i) {
for (ll j = 1; j <= k; ++j) {
ll c = dp[i] + abs(h[i + j] - h[i]);
dp[i + j] = min(dp[i + j], c);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 957,723 | 957,724 | u185413585 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans[n];
int h[n];
for (int i = 0; i < n; i++)
ans[i] = 100000;
for (int i = 0; i < n; i++)
cin >> h[i];
ans[0] = 0;
ans[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
for (int j = max(0, i - k); j < i; j++)
ans[i] = min(ans[i], ans[j] + abs(h[i] - h[j]));
cout << ans[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long ans[n];
int h[n];
for (int i = 0; i < n; i++)
ans[i] = 1000000000000000;
for (int i = 0; i < n; i++)
cin >> h[i];
ans[0] = 0;
ans[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
for (int j = max(0, i - k); j < i; j++)
ans[i] = min(ans[i], ans[j] + abs(h[i] - h[j]));
cout << ans[n - 1];
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 957,727 | 957,726 | u411909445 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
for (int i = 0; i < N; i++)
cin >> heights[i];
vector<long> dp(N, 0);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (int k = 2; k <= K; k++) {
dp[i] = min(dp[i], abs(heights[i] - heights[i - k]) + dp[i - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
// EDABC
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
for (int i = 0; i < N; i++)
cin >> heights[i];
vector<long> dp(N, 0);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(heights[i] - heights[i - 1]);
// i - k >= 0 i >= k
for (int k = 2; k <= min(i, K); k++) {
dp[i] = min(dp[i], abs(heights[i] - heights[i - k]) + dp[i - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
// EDABC
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 957,732 | 957,733 | u031847959 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
for (long long i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long> dp(n, 0);
for (long long i = 0; i < k; i++) {
if (i < n) {
dp[i] = abs(h[i] - h[0]);
} else {
break;
}
}
for (long long i = k; i < n; i++) {
dp[i] = LONG_LONG_MAX;
// long long baseDp = 0;
// if(i!=0)baseDp=dp[i-1];
for (long long j = 1; j <= k; j++) {
// if(i==9)cout<<abs(h[i]-h[i-j])<<endl;
dp[i] = min(dp[i], dp[i - k] + abs(h[i] - h[i - j]));
}
}
// for(long long i = 0; i < n; i++){
// cout << dp[i] << " ";
//}
// cout << endl;
cout << dp.back() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
for (long long i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long> dp(n, 0);
for (long long i = 0; i < k; i++) {
if (i < n) {
dp[i] = abs(h[i] - h[0]);
} else {
break;
}
}
for (long long i = k; i < n; i++) {
dp[i] = LONG_LONG_MAX;
// long long baseDp = 0;
// if(i!=0)baseDp=dp[i-1];
for (long long j = 1; j <= k; j++) {
// if(i==9)cout<<abs(h[i]-h[i-j])<<endl;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
// for(long long i = 0; i < n; i++){
// cout << dp[i] << " ";
//}
// cout << endl;
cout << dp.back() << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,736 | 957,737 | u708721324 | cpp |
p03161 | #include <cmath>
#include <iostream>
int main() {
int n, k;
std::cin >> n >> k;
int h[n], dp[n];
for (int i = 0; i < n; ++i) {
std::cin >> h[i];
dp[i] = 100000;
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k && i + j < n; ++j) {
if (dp[i + j] > dp[i] + std::abs(h[i] - h[i + j])) {
dp[i + j] = dp[i] + std::abs(h[i] - h[i + j]);
}
}
}
std::cout << dp[n - 1] << std::endl;
} | #include <cmath>
#include <iostream>
int main() {
int n, k;
std::cin >> n >> k;
int h[n], dp[n];
for (int i = 0; i < n; ++i) {
std::cin >> h[i];
dp[i] = 1000000000;
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k && i + j < n; ++j) {
if (dp[i + j] > dp[i] + std::abs(h[i] - h[i + j])) {
dp[i + j] = dp[i] + std::abs(h[i] - h[i + j]);
}
}
}
std::cout << dp[n - 1] << std::endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 957,744 | 957,743 | u535202049 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
vector<int> dp(1000000, INF);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep0(i, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
REP(i, 2, n) {
rep1(j, k + 1) {
if (k > j)
continue;
dp[i] = min(dp[i], (dp[i - j] + abs(a[i - j] - a[i])));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
vector<int> dp(1000000, INF);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep0(i, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
REP(i, 2, n) {
rep1(j, k + 1) {
if (j > i)
continue;
dp[i] = min(dp[i], (dp[i - j] + abs(a[i - j] - a[i])));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 957,766 | 957,767 | u820341516 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
vector<int> dp(1000000, INF);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep0(i, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
REP(i, 2, n) {
rep1(j, k) {
if (j > i)
break;
dp[i] = min(dp[i], (dp[i - j] + abs(a[i - j] - a[i])));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int main() {
vector<int> dp(1000000, INF);
int n, k;
cin >> n >> k;
vector<int> a(n);
rep0(i, n) cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
REP(i, 2, n) {
rep1(j, k + 1) {
if (j > i)
continue;
dp[i] = min(dp[i], (dp[i - j] + abs(a[i - j] - a[i])));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 957,768 | 957,767 | u820341516 | cpp |
p03161 | #include <iostream>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr int MAX_N = 1e5 + 100 + 7;
constexpr int INF = 1e5 + 7;
int h[MAX_N];
long long dp[MAX_N];
int main() {
int N, K;
cin >> N >> K;
for (int i{}; i < N; ++i) {
cin >> h[i];
}
fill(dp, dp + MAX_N, INF);
dp[0] = 0;
for (int i{0}; i < N; ++i) {
for (int j{1}; j <= K; ++j) {
if (i + j >= N)
break;
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr int MAX_N = 1e5 + 100 + 7;
constexpr int INF = 1e9 + 7;
int h[MAX_N];
long long dp[MAX_N];
int main() {
int N, K;
cin >> N >> K;
for (int i{}; i < N; ++i) {
cin >> h[i];
}
fill(dp, dp + MAX_N, INF);
dp[0] = 0;
for (int i{0}; i < N; ++i) {
for (int j{1}; j <= K; ++j) {
if (i + j >= N)
break;
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 957,769 | 957,770 | u154289649 | cpp |
p03161 | #include <iostream>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr int MAX_N = 1e5 + 100 + 7;
constexpr int INF = 1e4 * 3 + 7;
int h[MAX_N];
long long dp[MAX_N];
int main() {
int N, K;
cin >> N >> K;
for (int i{}; i < N; ++i) {
cin >> h[i];
}
fill(dp, dp + MAX_N, INF);
dp[0] = 0;
for (int i{0}; i < N; ++i) {
for (int j{1}; j <= K; ++j) {
if (i + j >= N)
break;
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
constexpr int MAX_N = 1e5 + 100 + 7;
constexpr int INF = 1e9 + 7;
int h[MAX_N];
long long dp[MAX_N];
int main() {
int N, K;
cin >> N >> K;
for (int i{}; i < N; ++i) {
cin >> h[i];
}
fill(dp, dp + MAX_N, INF);
dp[0] = 0;
for (int i{0}; i < N; ++i) {
for (int j{1}; j <= K; ++j) {
if (i + j >= N)
break;
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 957,771 | 957,770 | u154289649 | cpp |
p03161 | #include <bits/stdc++.h>
#include <string>
#define int long long
#define mod 1000000007
#define all(x) x.begin(), x.end()
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int minm = INT_MAX;
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = INT_MAX;
}
for (int i = 1; i < min(k, n); ++i) {
dp[i] = abs(arr[i] - arr[0]);
}
for (int i = k; i < n; ++i) {
for (int j = i - 1; j >= i - k; --j) {
dp[i] = min(abs(arr[i] - arr[j]) + dp[j], dp[i]);
}
}
// for(int i=0;i<n;++i) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| #include <bits/stdc++.h>
#include <string>
#define int long long
#define mod 1000000007
#define all(x) x.begin(), x.end()
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int minm = INT_MAX;
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = INT_MAX;
}
for (int i = 0; i < min(k, n); ++i) {
dp[i] = abs(arr[i] - arr[0]);
}
for (int i = k; i < n; ++i) {
for (int j = i - 1; j >= i - k; --j) {
dp[i] = min(abs(arr[i] - arr[j]) + dp[j], dp[i]);
}
}
// for(int i=0;i<n;++i) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,781 | 957,782 | u578753285 | cpp |
p03161 | #include <bits/stdc++.h>
#include <string>
#define int long long
#define mod 1000000007
#define all(x) x.begin(), x.end()
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int minm = INT_MAX;
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = INT_MAX;
}
for (int i = 1; i < min(k, n); ++i) {
dp[i] = min(dp[i], abs(arr[i] - arr[0]));
}
for (int i = k; i < n; ++i) {
for (int j = i - 1; j >= i - k; --j) {
dp[i] = min(abs(arr[i] - arr[j]) + dp[j], dp[i]);
}
}
// for(int i=0;i<n;++i) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| #include <bits/stdc++.h>
#include <string>
#define int long long
#define mod 1000000007
#define all(x) x.begin(), x.end()
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int minm = INT_MAX;
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = INT_MAX;
}
for (int i = 0; i < min(k, n); ++i) {
dp[i] = min(dp[i], abs(arr[i] - arr[0]));
}
for (int i = k; i < n; ++i) {
for (int j = i - 1; j >= i - k; --j) {
dp[i] = min(abs(arr[i] - arr[j]) + dp[j], dp[i]);
}
}
// for(int i=0;i<n;++i) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin>>t;
while (t--)
solve();
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,783 | 957,784 | u578753285 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
ll dp[n + 1];
rep(i, n + 1) dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
// cout<<dp[i]<<" "<<i<<"i"<<endl;
}
}
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
ll dp[n + 1];
rep(i, n + 1) dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll i = 1; i < n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
// cout<<dp[i]<<" "<<i<<"i"<<endl;
}
}
}
cout << dp[n - 1];
}
| [
"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",
"control_flow.branch.if.condition.change"
] | 957,785 | 957,786 | u289381123 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int X[n];
for (int i = 0; i < n; i++) {
cin >> X[i];
}
ll Cost[n];
for (int i = 0; i < n; i++) {
Cost[i] = 100000;
}
// cout << Cost[2] <<endl;
if (n == 1) {
cout << 0 << endl;
return 0;
}
Cost[0] = 0;
Cost[1] = abs(X[1] - X[0]);
if (n == 2) {
cout << Cost[n - 1];
return 0;
}
for (int i = 2; i < n; i++) {
for (int j = k; j >= 0; j--) {
if (i - (j) >= 0) {
// cout << Cost[i] << " , " << i <<endl;
Cost[i] = min(Cost[i], Cost[i - (j)] + abs(X[i] - X[i - (j)]));
// cout << Cost[i] << " , "<< i <<endl;
// cout << Cost[i-(j)] << " , "<< i-(j) <<endl;
}
}
}
cout << Cost[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
int X[n];
for (int i = 0; i < n; i++) {
cin >> X[i];
}
ll Cost[n];
for (int i = 0; i < n; i++) {
Cost[i] = 1e9 + 5;
}
// cout << Cost[2] <<endl;
if (n == 1) {
cout << 0 << endl;
return 0;
}
Cost[0] = 0;
Cost[1] = abs(X[1] - X[0]);
if (n == 2) {
cout << Cost[n - 1];
return 0;
}
for (int i = 2; i < n; i++) {
for (int j = k; j >= 0; j--) {
if (i - (j) >= 0) {
// cout << Cost[i] << " , " << i <<endl;
Cost[i] = min(Cost[i], Cost[i - (j)] + abs(X[i] - X[i - (j)]));
// cout << Cost[i] << " , "<< i <<endl;
// cout << Cost[i-(j)] << " , "<< i-(j) <<endl;
}
}
}
cout << Cost[n - 1];
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 957,800 | 957,801 | u967105498 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll X[n];
for (int i = 0; i < n; i++) {
cin >> X[i];
}
ll Cost[n];
for (int i = 0; i < n; i++) {
Cost[i] = 100000;
}
// cout << Cost[2] <<endl;
Cost[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
// cout << Cost[i] << " , " << i <<endl;
Cost[j] = min(Cost[j], Cost[i] + abs(X[i] - X[j]));
// cout << Cost[i] << " , "<< i <<endl;
// cout << Cost[i-(j)] << " , "<< i-(j) <<endl;
}
}
}
cout << Cost[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
ll X[n];
for (int i = 0; i < n; i++) {
cin >> X[i];
}
ll Cost[n];
for (int i = 0; i < n; i++) {
Cost[i] = 1e9 + 5;
}
// cout << Cost[2] <<endl;
Cost[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
// cout << Cost[i] << " , " << i <<endl;
Cost[j] = min(Cost[j], Cost[i] + abs(X[i] - X[j]));
// cout << Cost[i] << " , "<< i <<endl;
// cout << Cost[i-(j)] << " , "<< i-(j) <<endl;
}
}
}
cout << Cost[n - 1];
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 957,802 | 957,803 | u967105498 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define F first
#define S second
#define ld long double
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define vi vector<ll>
#define all(v) (v).begin(), (v).end()
#define M_PI 3.14159265358979323846
const ll MOD = 1e9 + 7;
void solve() {
ll n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, 1, n + 1) cin >> h[i];
vi dp(n + 1, MOD);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k && i - j >= 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
// for(auto c:dp) cout<<c<<" ";
// cout<<endl;
cout << dp[n] << endl;
}
int main() {
int t = 1;
// cin >> t;
ll k = 1;
while (t--) {
// cout << "Case #" << k++ << ": ";
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define F first
#define S second
#define ld long double
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define vi vector<ll>
#define all(v) (v).begin(), (v).end()
#define M_PI 3.14159265358979323846
const ll MOD = 1e9 + 7;
void solve() {
ll n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, 1, n + 1) cin >> h[i];
vi dp(n + 1, MOD);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k && i - j >= 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
// for(auto c:dp) cout<<c<<" ";
// cout<<endl;
cout << dp[n] << endl;
}
int main() {
int t = 1;
// cin >> t;
ll k = 1;
while (t--) {
// cout << "Case #" << k++ << ": ";
solve();
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,804 | 957,805 | u949455358 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define x first
#define y second
#define sz(v) (int)v.size()
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979
#define N 200005
int solve() {
int n, k;
cin >> n >> k;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int dp[n + 1] = {};
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; ++i) {
dp[i] = 1e18;
for (int j = max(0ll, i - k); j <= i - 1; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
// dp[i]=min(dp[i-2]+abs(a[i]-a[i-2]),dp[i-1]+abs(a[i]-a[i-1]));
// cout<<i<<" "<<dp[i]<<"\n";
}
cout << dp[n];
return 0;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define x first
#define y second
#define sz(v) (int)v.size()
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979
#define N 200005
int solve() {
int n, k;
cin >> n >> k;
int a[n + 1];
a[0] = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int dp[n + 1] = {};
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; ++i) {
dp[i] = 1e18;
for (int j = max(1ll, i - k); j <= i - 1; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
// dp[i]=min(dp[i-2]+abs(a[i]-a[i-2]),dp[i-1]+abs(a[i]-a[i-1]));
// cout<<i<<" "<<dp[i]<<"\n";
}
cout << dp[n];
return 0;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 957,806 | 957,807 | u177897754 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, k;
int h[101010];
int memo[101010];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
memo[0] = 0;
for (int i = 1; i < n; i++) {
memo[i] = INF;
for (int j = i - k; j < i; j++)
memo[i] = min(memo[i], memo[j] + abs(h[i] - h[j]));
}
printf("%d\n", memo[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n, k;
int h[101010];
int memo[101010];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
memo[0] = 0;
for (int i = 1; i < n; i++) {
memo[i] = INF;
for (int j = max(0, i - k); j < i; j++)
memo[i] = min(memo[i], memo[j] + abs(h[i] - h[j]));
}
printf("%d\n", memo[n - 1]);
return 0;
} | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.change"
] | 957,808 | 957,809 | u863554242 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, a, k;
vector<long long int> v;
cin >> n >> k;
vector<long long int> cost(n, 10001);
for (long long int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
cost[0] = 0;
cost[1] = abs(v[1] - v[0]);
for (long long int i = 2; i < n; i++) {
if (i - k < 0) {
for (long long int j = 0; j < i; j++)
cost[i] = min(cost[i], (cost[j] + abs(v[i] - v[j])));
} else if ((i - k) >= 0) { // cout<<"hoho";
for (long long int l = i - k; l < i; l++)
cost[i] = min(cost[i], (cost[l] + abs(v[i] - v[l])));
}
}
cout << cost[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, a, k;
vector<long long int> v;
cin >> n >> k;
vector<long long int> cost(n, INT_MAX);
for (long long int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
cost[0] = 0;
cost[1] = abs(v[1] - v[0]);
for (long long int i = 2; i < n; i++) {
if (i - k < 0) {
for (long long int j = 0; j < i; j++)
cost[i] = min(cost[i], (cost[j] + abs(v[i] - v[j])));
} else if ((i - k) >= 0) { // cout<<"hoho";
for (long long int l = i - k; l < i; l++)
cost[i] = min(cost[i], (cost[l] + abs(v[i] - v[l])));
}
}
cout << cost[n - 1] << "\n";
return 0;
} | [
"call.arguments.change"
] | 957,810 | 957,811 | u473692746 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, arr[1000000];
unsigned long long dp[1000000];
long long solve() {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2]);
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - 1]);
}
}
return dp[n - 1];
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, k, arr[1000000];
unsigned long long dp[1000000];
long solve(int i) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2]);
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
}
return dp[n - 1];
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0);
return 0;
}
| [
"variable_declaration.type.narrow.change",
"function.parameters.parameter.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,814 | 957,815 | u941672501 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, arr[1000000];
unsigned long long dp[1000000];
long solve(int i) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2]);
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - 1]);
}
}
return dp[n - 1];
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, k, arr[1000000];
unsigned long long dp[1000000];
long solve(int i) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2]);
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
}
return dp[n - 1];
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0);
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,816 | 957,815 | u941672501 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, arr[1000000];
unsigned long long dp[1000000];
long solve(int i) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2]);
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) > 0)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - 1]);
}
}
return dp[n - 1];
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, k, arr[1000000];
unsigned long long dp[1000000];
long solve(int i) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// dp[i] = min(abs(arr[i]-arr[i-1])+dp[i-1],abs(arr[i]-arr[i-2])+dp[i-2]);
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
}
return dp[n - 1];
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << solve(0);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,817 | 957,815 | u941672501 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
long long n, k;
long long A[100001];
long long F[100001];
void input() {
cin >> n >> k;
for (long long i = 1; i <= n; i++)
cin >> A[i];
}
int main() {
input();
if (k > n)
k = n;
F[1] = 0;
F[2] = abs(A[1] - A[2]);
for (long long i = 3; i <= k; i++) {
F[i] = 9999;
for (long long j = 1; j <= i - 1; j++) {
long long tmp = F[j] + abs(A[i] - A[j]);
F[i] = min(F[i], tmp);
}
}
for (long long i = k + 1; i <= n; i++) {
F[i] = 9999;
for (long long j = i - k; j <= i - 1; j++) {
long long tmp = F[j] + abs(A[i] - A[j]);
F[i] = min(F[i], tmp);
}
}
cout << F[n];
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
long long n, k;
long long A[100001];
long long F[100001];
void input() {
cin >> n >> k;
for (long long i = 1; i <= n; i++)
cin >> A[i];
}
int main() {
input();
if (k > n)
k = n;
F[1] = 0;
F[2] = abs(A[1] - A[2]);
for (long long i = 3; i <= k; i++) {
F[i] = 999999999;
for (long long j = 1; j <= i - 1; j++) {
long long tmp = F[j] + abs(A[i] - A[j]);
F[i] = min(F[i], tmp);
}
}
for (long long i = k + 1; i <= n; i++) {
F[i] = 999999999;
for (long long j = i - k; j <= i - 1; j++) {
long long tmp = F[j] + abs(A[i] - A[j]);
F[i] = min(F[i], tmp);
}
}
cout << F[n];
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 957,818 | 957,819 | u611194223 | cpp |
p03161 | #include <iostream>
#include <math.h>
#include <stdlib.h>
using namespace std;
int n, k, i, j, a[100004], f[100005];
int main() {
cin >> n;
cin >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
f[i] = 100000;
for (j = i - 1; j >= i - k; j--) {
if (j >= 1)
if (f[i] > f[j] + abs(a[i] - a[j]))
f[i] = f[j] + abs(a[i] - a[j]);
}
}
cout << f[n];
}
| #include <iostream>
#include <math.h>
#include <stdlib.h>
using namespace std;
long long n, k, i, j, a[100004], f[100005];
int main() {
cin >> n;
cin >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
f[i] = 9999999999;
for (j = i - 1; j >= i - k; j--) {
if (j >= 1)
if (f[i] > f[j] + abs(a[i] - a[j]))
f[i] = f[j] + abs(a[i] - a[j]);
}
}
cout << f[n];
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 957,820 | 957,821 | u519309774 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
ll INF = 100007;
int main() {
ll n, i, k, j;
cin >> n >> k;
ll arr[n + 1], dp[n + 1];
for (i = 1; i <= n; i++) {
cin >> arr[i];
dp[i] = INF;
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i > k) {
for (j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
} else {
for (j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll INF = 1000000007;
int main() {
ll n, i, k, j;
cin >> n >> k;
ll arr[n + 1], dp[n + 1];
for (i = 1; i <= n; i++) {
cin >> arr[i];
dp[i] = INF;
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i > k) {
for (j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
} else {
for (j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
}
cout << dp[n];
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 957,822 | 957,823 | u895064416 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll INF = 100007;
int main() {
ll n, i, k, j;
cin >> n >> k;
ll arr[n + 1], dp[n + 1];
for (i = 1; i <= n; i++) {
cin >> arr[i];
dp[i] = INF;
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i > k) {
for (j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
} else {
for (j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll INF = 1000000007;
int main() {
ll n, i, k, j;
cin >> n >> k;
ll arr[n + 1], dp[n + 1];
for (i = 1; i <= n; i++) {
cin >> arr[i];
dp[i] = INF;
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i > k) {
for (j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
} else {
for (j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
}
cout << dp[n];
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 957,824 | 957,823 | u895064416 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll INF = 100007;
int main() {
ll n, i, k, j;
cin >> n >> k;
ll arr[n + 1], dp[n + 1];
for (i = 1; i <= n; i++)
cin >> arr[i], dp[i] = INF;
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i > k) {
for (j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
} else {
for (j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll INF = 1000000007;
int main() {
ll n, i, k, j;
cin >> n >> k;
ll arr[n + 1], dp[n + 1];
for (i = 1; i <= n; i++) {
cin >> arr[i];
dp[i] = INF;
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i > k) {
for (j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
} else {
for (j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
}
cout << dp[n];
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 957,825 | 957,823 | u895064416 | cpp |
p03161 | #include <bits/stdc++.h>
#define MAX 1e9
using namespace std;
typedef long long ll;
void chmin(int *arrdp, int cost, int index) {
if (cost < arrdp[index]) {
arrdp[index] = cost;
}
return;
}
int main(void) {
int n;
cin >> n;
int k;
cin >> k;
int arrh[10];
for (int i = 0; i < n; ++i)
cin >> arrh[i];
int arrdp[10];
for (int i = 0; i < n; ++i)
arrdp[i] = MAX;
arrdp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k && i - j >= 0; ++j) {
chmin(arrdp, arrdp[i - j] + abs(arrh[i - j] - arrh[i]), i);
}
}
cout << arrdp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define MAX 1e9
using namespace std;
typedef long long ll;
void chmin(int *arrdp, int cost, int index) {
if (cost < arrdp[index]) {
arrdp[index] = cost;
}
return;
}
int main(void) {
int n;
cin >> n;
int k;
cin >> k;
int arrh[100010];
for (int i = 0; i < n; ++i)
cin >> arrh[i];
int arrdp[100010];
for (int i = 0; i < n; ++i)
arrdp[i] = MAX;
arrdp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k && i - j >= 0; ++j) {
chmin(arrdp, arrdp[i - j] + abs(arrh[i - j] - arrh[i]), i);
}
}
cout << arrdp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 957,826 | 957,827 | u873269440 | cpp |
p03161 | /*****TEMPLATE*****/
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// INCLUDES
using namespace std;
#define lld long long int
#define ulld unsigned long long int
#define mod 1000000007
#define pb push_back
#define umap unordered_map
#define mp make_pair
#define fi first
#define se second
#define rep(n) for (int i = 0; i < n; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// DEFINES
lld gcd(lld a, lld b) {
if (a < b) {
a = a + b;
b = a - b;
a = a - b;
}
while (b != 0) {
lld r = a % b;
a = b;
b = r;
}
return a;
}
lld bs(lld arr[], lld l, lld r, lld x) {
if (r >= l) {
lld mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return bs(arr, l, mid - 1, x);
return bs(arr, mid + 1, r, x);
}
return -1;
}
lld mypower(lld x, lld n) {
if (n == 0)
return 1;
if (n & 1)
return (((x * mypower(x, n / 2)) % mod) * (mypower(x, n / 2) % mod) % mod);
return (((mypower(x, n / 2)) % mod) * (mypower(x, n / 2) % mod)) % mod;
}
lld modinv(lld a) {
lld g = gcd(a, mod);
if (g != 1)
return -1;
else {
return mypower(a, mod - 2) % mod;
}
}
// FUNCTIONS
void solve() {
lld n, k;
cin >> n >> k;
lld h[n];
rep(n) cin >> h[i];
lld ans[n] = {};
ans[0] = 0;
for (int i = 1; i < n; i++) {
lld val = 1e5;
for (lld j = 1; j <= k && i - j >= 0; j++) {
val = min(val, (abs(h[i] - h[i - j]) + ans[i - j]));
}
ans[i] = val;
}
cout << ans[n - 1] << "\n";
return;
}
int main() {
fast
// lld t;
// cin>>t;
// while(t--)
solve();
return 0;
}
| /*****TEMPLATE*****/
#include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
// INCLUDES
using namespace std;
#define lld long long int
#define ulld unsigned long long int
#define mod 1000000007
#define pb push_back
#define umap unordered_map
#define mp make_pair
#define fi first
#define se second
#define rep(n) for (int i = 0; i < n; i++)
#define fore(i, a, b) for (int i = a; i <= b; i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
// DEFINES
lld gcd(lld a, lld b) {
if (a < b) {
a = a + b;
b = a - b;
a = a - b;
}
while (b != 0) {
lld r = a % b;
a = b;
b = r;
}
return a;
}
lld bs(lld arr[], lld l, lld r, lld x) {
if (r >= l) {
lld mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return bs(arr, l, mid - 1, x);
return bs(arr, mid + 1, r, x);
}
return -1;
}
lld mypower(lld x, lld n) {
if (n == 0)
return 1;
if (n & 1)
return (((x * mypower(x, n / 2)) % mod) * (mypower(x, n / 2) % mod) % mod);
return (((mypower(x, n / 2)) % mod) * (mypower(x, n / 2) % mod)) % mod;
}
lld modinv(lld a) {
lld g = gcd(a, mod);
if (g != 1)
return -1;
else {
return mypower(a, mod - 2) % mod;
}
}
// FUNCTIONS
void solve() {
lld n, k;
cin >> n >> k;
lld h[n];
rep(n) cin >> h[i];
lld ans[n] = {};
ans[0] = 0;
for (int i = 1; i < n; i++) {
lld val = 1e15;
for (lld j = 1; j <= k && (i - j) >= 0; j++) {
val = min(val, (abs(h[i] - h[i - j]) + ans[i - j]));
}
ans[i] = val;
}
cout << ans[n - 1] << "\n";
return;
}
int main() {
fast
// lld t;
// cin>>t;
// while(t--)
solve();
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 957,833 | 957,834 | u282557448 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define forn(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fon(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define se second
#define fi first
#define ciin(v) forn(i, 0, v.size()) cin >> v[i]
#define coutt(v) forn(i, 0, v.size()) cout << v[i] << " "
using namespace std;
int main() {
ios ll test;
test = 1;
// cin>>test;
while (test--) {
ll n, x;
cin >> n >> x;
vi v(n), p(n + 1, 1e18);
ciin(v);
x = min(n, x);
p[0] = v[0];
p[1] = abs(v[1] - v[0]);
forn(i, 2, n) {
for (ll j = max(0ll, i - x); j < i; j++) {
p[i] = min(p[i], p[j] + abs(v[j] - v[i]));
}
}
cout << p[n - 1];
}
}
| #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define forn(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define fon(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define se second
#define fi first
#define ciin(v) forn(i, 0, v.size()) cin >> v[i]
#define coutt(v) forn(i, 0, v.size()) cout << v[i] << " "
using namespace std;
int main() {
ios ll test;
test = 1;
// cin>>test;
while (test--) {
ll n, x;
cin >> n >> x;
vi v(n), p(n + 1, 1e18);
ciin(v);
x = min(n, x);
p[0] = 0;
p[1] = abs(v[1] - v[0]);
forn(i, 2, n) {
for (ll j = max(0ll, i - x); j < i; j++) {
p[i] = min(p[i], p[j] + abs(v[j] - v[i]));
}
}
cout << p[n - 1];
}
}
| [] | 957,835 | 957,836 | u307238770 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
b[i] = n * 10000;
b[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= i - k; j--)
b[i] = min(b[i], b[j] + abs(a[i] - a[j]));
}
cout << b[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
b[i] = n * 10000;
b[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= i - k && j >= 0; j--)
b[i] = min(b[i], b[j] + abs(a[i] - a[j]));
}
cout << b[n - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 957,837 | 957,838 | u260684766 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
vector<int> dp(100000, INT_MAX);
int minCost(vector<int> &stones, int k, int dest) {
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(stones[i] - stones[0]);
}
for (int i = k + 1; i < dest; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(stones[i] - stones[i - j]) + dp[i - j]);
}
}
return dp[dest];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> vec;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
vec.push_back(temp);
}
cout << minCost(vec, k, vec.size() - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> dp(100000, INT_MAX);
int minCost(vector<int> &stones, int k, int dest) {
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(stones[i] - stones[0]);
}
for (int i = k + 1; i <= dest; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(stones[i] - stones[i - j]) + dp[i - j]);
}
}
return dp[dest];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> vec;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
vec.push_back(temp);
}
cout << minCost(vec, k, vec.size() - 1) << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,841 | 957,842 | u491959145 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
vector<int> dp(100000, INT_MAX);
int minCost(vector<int> &stones, int k, int dest) {
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(stones[k] - stones[i]);
}
for (int i = k + 1; i < dest; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(stones[i] - stones[i - j]) + dp[i - j]);
}
}
return dp[dest];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> vec;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
vec.push_back(temp);
}
cout << minCost(vec, k, vec.size() - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> dp(100000, INT_MAX);
int minCost(vector<int> &stones, int k, int dest) {
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(stones[i] - stones[0]);
}
for (int i = k + 1; i <= dest; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], abs(stones[i] - stones[i - j]) + dp[i - j]);
}
}
return dp[dest];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> vec;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
vec.push_back(temp);
}
cout << minCost(vec, k, vec.size() - 1) << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.o... | 957,843 | 957,842 | u491959145 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + (v[i + j] - v[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(v[i + j] - v[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 957,844 | 957,845 | u065541219 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define AC ios::sync_with_stdio(0), cin.tie(0);
const int N = 1e5 + 5;
int dp[N];
int a[N];
int main() {
AC int n;
cin >> n;
int k;
cin >> k;
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
dp[i] = 1e9 + 10;
}
dp[1] = 0;
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j < k + 1; j++) {
if (i - j >= 0)
dp[i] = min(dp[i - j] + abs(a[i - j] - a[i]), dp[i]);
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define AC ios::sync_with_stdio(0), cin.tie(0);
const int N = 1e5 + 5;
int dp[N];
int a[N];
int main() {
AC int n;
cin >> n;
int k;
cin >> k;
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
dp[i] = 1e9 + 10;
}
dp[1] = 0;
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j < k + 1; j++) {
if (i - j >= 1)
dp[i] = min(dp[i - j] + abs(a[i - j] - a[i]), dp[i]);
}
}
cout << dp[n] << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,852 | 957,853 | u723744542 | cpp |
p03161 | // thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int oo = 1e9;
int n, k;
int h[MaxN], dp[MaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = oo;
}
dp[1] = 0;
for (int i = 1; i < n; i++) {
for (int j = min(n, i + k); j > i; i--) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n];
return 0;
} | // thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int oo = 1e9;
int n, k;
int h[MaxN], dp[MaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = oo;
}
dp[1] = 0;
for (int i = 1; i < n; i++) {
for (int j = min(n, i + k); j > i; j--) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n];
return 0;
} | [
"identifier.change"
] | 957,856 | 957,857 | u124636763 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define has(c, i) ((c).find(i) != end(c))
#define has_str(s, c) ((s).find(c) != string::npos)
typedef long long ll;
int main() {
#ifdef LOCAL
// freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &i : h)
cin >> i;
vector<int> dp(n, 1e9 + 9);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < k + i; ++j) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[i + 1]));
}
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define has(c, i) ((c).find(i) != end(c))
#define has_str(s, c) ((s).find(c) != string::npos)
typedef long long ll;
int main() {
#ifdef LOCAL
// freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &i : h)
cin >> i;
vector<int> dp(n, 1e9 + 9);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= k + i; ++j) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 957,858 | 957,859 | u931971262 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, h;
cin >> n >> k;
vector<int> v, dp(n, 0);
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 1; i < min(k + 1, n); i++) {
dp[i] = abs(v[0] - v[i]);
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[i - k] + abs(v[i - k] - v[i]);
for (int j = 2; j < k + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i - j] - v[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, h;
cin >> n >> k;
vector<int> v, dp(n, 0);
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 1; i < min(k + 1, n); i++) {
dp[i] = abs(v[0] - v[i]);
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[i - k] + abs(v[i - k] - v[i]);
for (int j = 1; j < k + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i - j] - v[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,869 | 957,870 | u528388170 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, h;
cin >> n >> k;
vector<int> v, dp(n, 0);
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 1; i < min(k + 1, n); i++) {
dp[i] = abs(v[0] - v[i]);
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[k] + abs(v[k] - v[i]);
for (int j = 2; j < k + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i - j] - v[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, h;
cin >> n >> k;
vector<int> v, dp(n, 0);
for (int i = 0; i < n; i++) {
cin >> h;
v.push_back(h);
}
for (int i = 1; i < min(k + 1, n); i++) {
dp[i] = abs(v[0] - v[i]);
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[i - k] + abs(v[i - k] - v[i]);
for (int j = 1; j < k + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i - j] - v[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"assignment.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,871 | 957,870 | u528388170 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
ll dp[100000];
ll h[100000];
int n, k;
ll solve(int p) {
if (p == n - 1)
return 0;
if (p >= n)
return 100000;
if (dp[p] != -1)
return dp[p];
ll res = 100000;
for (int i = 1; i <= k; i++) {
res = min(res, abs(h[p] - h[p + i]) + solve(p + i));
}
return dp[p] = res;
}
int main() {
cin >> n >> k;
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++)
cin >> h[i];
cout << solve(0) << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#define ll long long
using namespace std;
ll dp[100000];
ll h[100000];
int n, k;
ll solve(int p) {
if (p == n - 1)
return 0;
if (p >= n)
return 10000000000ll;
if (dp[p] != -1)
return dp[p];
ll res = 10000000000ll;
for (int i = 1; i <= k; i++) {
res = min(res, abs(h[p] - h[p + i]) + solve(p + i));
}
return dp[p] = res;
}
int main() {
cin >> n >> k;
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++)
cin >> h[i];
cout << solve(0) << endl;
return 0;
} | [
"literal.number.change",
"function.return_value.change",
"variable_declaration.value.change"
] | 957,874 | 957,875 | u529795194 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define INF INT_MAX
void solve() {
int n, k;
cin >> n >> k;
int h[n], dp[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 2; i < n; ++i) {
dp[i] = INF;
for (int j = max(0, i - k); j < i; ++j) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
#define INF INT_MAX
void solve() {
int n, k;
cin >> n >> k;
int h[n], dp[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = INF;
for (int j = max(0, i - k); j < i; ++j) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
solve();
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,876 | 957,877 | u660087124 | cpp |
p03161 | /*
*@Author Chand Vachhani
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define mii map<int, int>
#define pb push_back
#define pf push_front
#define mp(a, b) make_pair((a), (b))
#define vpii vector<pair<int, int>>
#define fo(i, l, n) for (int i{l}; i < n; i++)
#define rf(s) for (auto &c : s)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI 3.141592653589
#define sz(x) (int)x.size()
#define bs(v, n) binary_search(all((v)), (n))
#define lb(v, n) lower_bound(all((v)), (n))
#define ub(v, n) upper_bound(all((v)), (n))
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
using namespace std;
template <class T> T big(T a, T b) { return a > b ? a : b; }
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
bool mod(double a, double b) { return a / b - floor(a / b); }
int occurs(vi v, int n) {
auto it = lb(v, n);
auto it1 = ub(v, n);
int x = it1 - it;
return x;
}
int logb(int base, int x) { return (log(x) / log(base)); }
int pow(int n, int m) {
int ans = 1;
fo(i, 0, m) { ans *= n; }
return ans;
}
int factors(int ans) {
int count = 0;
for (int i = 1; i <= sqrt(ans); i++) {
if (ans % i == 0) {
if (ans / i == i)
count++;
else
count += 2;
}
}
return count;
}
bool isSubSequence(string str1, string str2, int m, int n) // str1<str2
{
// Base Cases
if (m == 0)
return true;
if (n == 0)
return false;
// If last characters of two strings are matching
if (str1[m - 1] == str2[n - 1])
return isSubSequence(str1, str2, m - 1, n - 1);
// If last characters are not matching
return isSubSequence(str1, str2, m, n - 1);
}
int fact(int n) {
if (n == 0 || n == 1)
return 1;
else
return n * fact(n - 1);
}
int f(int n, int dp[]) {
// if(n==0 || n==1 || n==2) return 1;
// if(n==3) return 2;
if (dp[n] != 0)
return dp[n];
int h1 = f(n - 1, dp);
int h2 = f(n - 3, dp);
int h3 = f(n - 4, dp);
dp[n] = h1 + h2 + h3;
return dp[n];
}
int xnor(int a, int b) {
// Make sure a is larger
if (a < b)
swap(a, b);
if (a == 0 && b == 0)
return 1;
int a_rem = 0; // for last bit of a
int b_rem = 0; // for last bit of b
// counter for count bit
// and set bit in xnornum
int count = 0;
// to make new xnor number
int xnornum = 0;
// for set bits in new xnor number
while (a) {
// get last bit of a
a_rem = a & 1;
// get last bit of b
b_rem = b & 1;
// Check if current two
// bits are same
if (a_rem == b_rem)
xnornum |= (1 << count);
// counter for count bit
count++;
a = a >> 1;
b = b >> 1;
}
return xnornum;
}
signed main() {
tezz
int n,
p, k;
cin >> n >> k;
vi a;
a.pb(0);
fo(i, 0, n) {
cin >> p;
a.pb(p);
}
int dp[n + 1] = {0};
dp[1] = 0;
if (k > n)
k = n;
if (k == 0)
return 0;
for (int i = 2; i <= k; i++) {
int tmp = INT_MAX;
// dp[i] = min( dp[i-1]+abs(a[i]-a[i-1]) , dp[i-2]+abs(a[i]-a[i-2]) );
for (int j = 1; j <= i; j++) {
if (tmp > (dp[i - j] + abs(a[i] - a[i - j])))
tmp = dp[i - j] + abs(a[i] - a[i - j]);
// cout << (dp[i-j]+abs(a[i]-a[i-j])) <<" ";
} // cout << endl;
dp[i] = tmp;
// cout << dp[i] << " ";
}
for (int i = k + 1; i <= n; i++) {
int tmp = INT_MAX;
// dp[i] = min( dp[i-1]+abs(a[i]-a[i-1]) , dp[i-2]+abs(a[i]-a[i-2]) );
for (int j = 1; j <= k; j++) {
if (tmp > (dp[i - j] + abs(a[i] - a[i - j])))
tmp = dp[i - j] + abs(a[i] - a[i - j]);
// cout << (dp[i-j]+abs(a[i]-a[i-j])) <<" ";
} // cout << endl;
dp[i] = tmp;
// cout << dp[i] << " ";
}
cout << dp[n] << endl;
return 0;
} | /*
*@Author Chand Vachhani
*/
#include <bits/stdc++.h>
#define int long long
#define double long double
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define mii map<int, int>
#define pb push_back
#define pf push_front
#define mp(a, b) make_pair((a), (b))
#define vpii vector<pair<int, int>>
#define fo(i, l, n) for (int i{l}; i < n; i++)
#define rf(s) for (auto &c : s)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define PI 3.141592653589
#define sz(x) (int)x.size()
#define bs(v, n) binary_search(all((v)), (n))
#define lb(v, n) lower_bound(all((v)), (n))
#define ub(v, n) upper_bound(all((v)), (n))
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
using namespace std;
template <class T> T big(T a, T b) { return a > b ? a : b; }
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
bool mod(double a, double b) { return a / b - floor(a / b); }
int occurs(vi v, int n) {
auto it = lb(v, n);
auto it1 = ub(v, n);
int x = it1 - it;
return x;
}
int logb(int base, int x) { return (log(x) / log(base)); }
int pow(int n, int m) {
int ans = 1;
fo(i, 0, m) { ans *= n; }
return ans;
}
int factors(int ans) {
int count = 0;
for (int i = 1; i <= sqrt(ans); i++) {
if (ans % i == 0) {
if (ans / i == i)
count++;
else
count += 2;
}
}
return count;
}
bool isSubSequence(string str1, string str2, int m, int n) // str1<str2
{
// Base Cases
if (m == 0)
return true;
if (n == 0)
return false;
// If last characters of two strings are matching
if (str1[m - 1] == str2[n - 1])
return isSubSequence(str1, str2, m - 1, n - 1);
// If last characters are not matching
return isSubSequence(str1, str2, m, n - 1);
}
int fact(int n) {
if (n == 0 || n == 1)
return 1;
else
return n * fact(n - 1);
}
int f(int n, int dp[]) {
// if(n==0 || n==1 || n==2) return 1;
// if(n==3) return 2;
if (dp[n] != 0)
return dp[n];
int h1 = f(n - 1, dp);
int h2 = f(n - 3, dp);
int h3 = f(n - 4, dp);
dp[n] = h1 + h2 + h3;
return dp[n];
}
int xnor(int a, int b) {
// Make sure a is larger
if (a < b)
swap(a, b);
if (a == 0 && b == 0)
return 1;
int a_rem = 0; // for last bit of a
int b_rem = 0; // for last bit of b
// counter for count bit
// and set bit in xnornum
int count = 0;
// to make new xnor number
int xnornum = 0;
// for set bits in new xnor number
while (a) {
// get last bit of a
a_rem = a & 1;
// get last bit of b
b_rem = b & 1;
// Check if current two
// bits are same
if (a_rem == b_rem)
xnornum |= (1 << count);
// counter for count bit
count++;
a = a >> 1;
b = b >> 1;
}
return xnornum;
}
signed main() {
tezz
int n,
p, k;
cin >> n >> k;
vi a;
a.pb(0);
fo(i, 0, n) {
cin >> p;
a.pb(p);
}
int dp[n + 1] = {0};
dp[1] = 0;
if (k > n)
k = n;
if (k == 0)
return 0;
for (int i = 2; i <= k; i++) {
int tmp = INT_MAX;
for (int j = 1; j < i; j++) {
if (tmp > (dp[i - j] + abs(a[i] - a[i - j])))
tmp = dp[i - j] + abs(a[i] - a[i - j]);
}
dp[i] = tmp;
}
for (int i = k + 1; i <= n; i++) {
int tmp = INT_MAX;
for (int j = 1; j <= k; j++) {
if (tmp > (dp[i - j] + abs(a[i] - a[i - j])))
tmp = dp[i - j] + abs(a[i] - a[i - j]);
}
dp[i] = tmp;
}
cout << dp[n] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,878 | 957,879 | u084466852 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 1;
int n, k;
int h[mx], dp[mx];
int solve(int s) // s->no of stone
{
if (s == n)
return 0;
if (dp[s] != -1)
return dp[s];
int ret = INT_MAX;
for (int i = 1; i <= k; i++) {
if ((i + s) <= n)
ret = min(ret, abs(h[s + i] - h[i]) + solve(s + i));
}
return dp[s] = ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin); return 0;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
memset(dp, -1, sizeof dp);
cout << solve(1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 1;
int n, k;
int h[mx], dp[mx];
int solve(int s) // s->no of stone
{
if (s == n)
return 0;
if (dp[s] != -1)
return dp[s];
int ret = INT_MAX;
for (int i = 1; i <= k; i++) {
if ((i + s) <= n)
ret = min(ret, abs(h[s + i] - h[s]) + solve(s + i));
}
return dp[s] = ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin); return 0;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
memset(dp, -1, sizeof dp);
cout << solve(1);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,880 | 957,881 | u507086371 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 1;
int n, k;
int h[mx], dp[mx];
int solve(int s) // s->no of stone
{
if (s == n)
return 0;
if (dp[s] != -1)
return dp[s];
int ret = INT_MAX;
for (int i = 1; i <= k; i++) {
if ((i + s) <= n)
ret = min(ret, abs(h[i + 1] - h[i]) + solve(s + i));
}
return dp[s] = ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin); return 0;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
memset(dp, -1, sizeof dp);
cout << solve(1);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int mx = 1e5 + 1;
int n, k;
int h[mx], dp[mx];
int solve(int s) // s->no of stone
{
if (s == n)
return 0;
if (dp[s] != -1)
return dp[s];
int ret = INT_MAX;
for (int i = 1; i <= k; i++) {
if ((i + s) <= n)
ret = min(ret, abs(h[s + i] - h[s]) + solve(s + i));
}
return dp[s] = ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin); return 0;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
memset(dp, -1, sizeof dp);
cout << solve(1);
return 0;
}
| [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 957,882 | 957,881 | u507086371 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int h[N], f[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
f[i] = 100000;
f[0] = 0;
f[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
for (int j = max(0, i - k); j < i; j++) {
f[i] = min(f[i], f[j] + abs(h[j] - h[i]));
}
}
cout << f[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int h[N];
long long f[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
f[i] = 10000000000;
f[0] = 0;
f[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
for (int j = max(0, i - k); j < i; j++) {
f[i] = min(f[i], f[j] + abs(h[j] - h[i]));
}
}
cout << f[n - 1];
} | [
"literal.number.change",
"assignment.value.change"
] | 957,891 | 957,892 | u943017136 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = pow(10, 9) + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int ar[n + 1];
for (int i = 1; i <= n; i++)
cin >> ar[i];
int dp[n + 1][k + 1] = {0};
int value[n + 1] = {0};
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i][j] = INT_MAX;
dp[1][1] = 0;
value[1] = 0;
for (int i = 2; i <= n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= k; j++)
mn = min(mn, dp[i - 1][j]);
value[i - 1] = mn;
for (int j = 1; j <= k; j++) {
if (i - j <= 0)
break;
dp[i][j] = value[i - j] + abs(ar[i] - ar[i - j]);
}
}
int mn = INT_MAX;
for (int j = 1; j <= k; j++)
mn = min(mn, dp[n - 1][j]);
cout << mn << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll mod = pow(10, 9) + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int ar[n + 1];
for (int i = 1; i <= n; i++)
cin >> ar[i];
int dp[n + 1][k + 1] = {0};
int value[n + 1] = {0};
for (int i = 1; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i][j] = INT_MAX;
dp[1][1] = 0;
value[1] = 0;
for (int i = 2; i <= n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= k; j++)
mn = min(mn, dp[i - 1][j]);
value[i - 1] = mn;
for (int j = 1; j <= k; j++) {
if (i - j <= 0)
break;
dp[i][j] = value[i - j] + abs(ar[i] - ar[i - j]);
}
}
int mn = INT_MAX;
for (int j = 1; j <= k; j++)
mn = min(mn, dp[n][j]);
cout << mn << endl;
}
| [
"expression.operation.binary.remove"
] | 957,907 | 957,908 | u981076121 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.