problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long> h(n);
vector<long long> jump(n, 1e14);
for (int i = 0; i < n; ++i)
cin >> h[i];
jump[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i + 2; j < min(n, i + k + 1); ++j)
jump[i] = min(jump[i], jump[j] + abs(h[i] - h[j]));
cout << jump[0] << "\n";
return 0;
} // RUL0 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long> h(n);
vector<long long> jump(n, 1e14);
for (int i = 0; i < n; ++i)
cin >> h[i];
jump[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i + 1; j < min(n, i + k + 1); ++j)
jump[i] = min(jump[i], jump[j] + abs(h[i] - h[j]));
cout << jump[0] << "\n";
return 0;
} // RUL0 | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,944 | 961,945 | u628380758 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 10000;
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - 1 - j] + abs(h[i] - h[i - 1 - j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 1000000000000;
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - 1 - j] + abs(h[i] - h[i - 1 - j]));
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 961,949 | 961,950 | u067888645 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 10000;
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - 1 - j] + abs(h[i] - h[i - 1 - k]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 1000000000000;
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - 1 - j] + abs(h[i] - h[i - 1 - j]));
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,951 | 961,950 | u067888645 | cpp |
p03161 | #include <cstdio>
int d[100000], dp[100000];
int dist(int x, int y) { return (x > y) ? (x - y) : (y - x); }
int min(int x, int y) { return (x > y) ? y : x; }
int max(int x, int y) { return (x > y) ? x : y; }
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &d[i]);
for (int i = 0; i < n; i++)
dp[i] = 1e9 + 7;
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + dist(d[i], d[j]));
}
}
printf("%d", &dp[n - 1]);
return 0;
} | #include <cstdio>
int d[100000], dp[100000];
int dist(int x, int y) { return (x > y) ? (x - y) : (y - x); }
int min(int x, int y) { return (x > y) ? y : x; }
int max(int x, int y) { return (x > y) ? x : y; }
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &d[i]);
for (int i = 0; i < n; i++)
dp[i] = 1e9 + 7;
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + dist(d[i], d[j]));
}
}
printf("%d", dp[n - 1]);
return 0;
}
| [
"call.arguments.change"
] | 961,952 | 961,953 | u350561621 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mxx];
int fun(int pos) {
if (pos + 1 == n)
return 0;
if (dp[pos] == -1) {
dp[pos] = INT_MAX;
rep(i, 1, k + 1) {
if (pos + i != n)
dp[pos] = min(dp[pos], (abs(a[pos + i] - a[pos]) + fun(pos + i)));
}
}
return dp[pos];
}
int main() {
_fastIO();
rep(i, 0, mxx) dp[i] = -1;
cin >> n >> k;
rep(i, 0, n) cin >> a[i];
cout << fun(0) << NL;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mxx];
int fun(int pos) {
if (pos + 1 == n)
return 0;
if (dp[pos] == -1) {
dp[pos] = INT_MAX;
rep(i, 1, k + 1) {
if (pos + i < n)
dp[pos] = min(dp[pos], (abs(a[pos + i] - a[pos]) + fun(pos + i)));
}
}
return dp[pos];
}
int main() {
_fastIO();
rep(i, 0, mxx) dp[i] = -1;
cin >> n >> k;
rep(i, 0, n) cin >> a[i];
cout << fun(0) << NL;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,954 | 961,955 | u895045773 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mxx];
int fun(int pos) {
if (pos + 1 == n)
return 0;
if (dp[pos] == -1) {
dp[pos] = INT_MAX;
rep(i, 1, k + 1) {
if (pos + i != n)
dp[pos] = min(dp[pos], (abs(a[pos + i] - a[pos]) + fun(pos + i)));
}
}
return dp[pos];
}
int main() {
_fastIO();
rep(i, 0, mxx) dp[i] = -1;
cin >> n >> k;
rep(i, 0, n) cin >> a[i];
cout << fun(0) << NL;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mxx];
int fun(int pos) {
if (pos + 1 == n)
return 0;
if (dp[pos] == -1) {
dp[pos] = INT_MAX;
rep(i, 0, k + 1) {
if (pos + i < n)
dp[pos] = min(dp[pos], (abs(a[pos + i] - a[pos]) + fun(pos + i)));
}
}
return dp[pos];
}
int main() {
_fastIO();
rep(i, 0, mxx) dp[i] = -1;
cin >> n >> k;
rep(i, 0, n) cin >> a[i];
cout << fun(0) << NL;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,954 | 961,956 | u895045773 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[100005], num[100005];
int main() {
cin.tie(), cout.tie();
memset(dp, 23333, sizeof(dp));
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i - k; j <= i - 1; j++) {
int add = fabs(num[i] - num[j]);
dp[i] = min(dp[i], dp[j] + add);
}
// cout<<i<<':'<<dp[i]<<endl;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[100005], num[100005];
int main() {
cin.tie(), cout.tie();
memset(dp, 233333, sizeof(dp));
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = max(1, i - k); j <= i - 1; j++) {
int add = fabs(num[i] - num[j]);
dp[i] = min(dp[i], dp[j] + add);
}
// cout<<i<<':'<<dp[i]<<endl;
}
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"call.add"
] | 961,957 | 961,958 | u332820511 | cpp |
p03161 | /*
|** In the name of Allah, most gracious, most merciful **|
* * ****
* * * *
* * * *
* * * *
** *** *** ***** ***** *** ** *** **** *** ** *** *** **
*** ***
* * * * * * * * * * * * * * * * * *
* * * *
* * * * * ***** * * * * * * * * * *
* * * *
* * * * * * * * * * * * * * * *
* * * *
* *** ** ** *** * * **** *** * * * *** *
* * *** *
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false)
#define FASTtie ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0)
#define PI 2 * acos(0.0)
#define E 2.718281828
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define pis pair<int, string>
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define F first
#define S second
#define add(v) accumulate(v.begin(), v.end(), 0)
#define srt(v) sort(v.begin(), v.end())
#define loop(i, n) for (int i = 0; i <= n; i++)
#define pqa_i priority_queue<int, vector<int>, greater<int>>
#define pqa_pii priority_queue<pii, vector<pii>, greater<pii>>
#define mp make_pair
#define endl "\n"
#define pf printf
#define sf(t) scanf("%d", &t)
#define memvis memset(visited, 0, M * sizeof(bool))
#define memvisg memset(visited, 0, sizeof visited)
#define memlev memset(level, -1, M * sizeof(int))
#define memprev memset(previous, -1, M * sizeof(int))
#define memlevg memset(level, -1, sizeof level)
#define mempro memset(process, -1, M * sizeof(int))
#define mempar memset(parent, -1, M * sizeof(int))
#define N 4
#define inf 1e18 + 10
#define nai string::npos
#define elif else if
#define ins insert
#define all(v) v.begin(), v.end()
#define debug(x) cout << #x << " = " << x << endl
#define ordered_set_int \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define ordered_set_str \
tree<string, null_type, less<string>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
void printarr(ull *arr, int f, int n, int base) {
for (int i = base + f; i < n + base; i++)
cout << arr[i] << "\n";
cout << endl;
}
const int M = 1e8 + 10;
const int Mx = 3125555;
/*multiset<int> adj[M];
int dx[] = {1, -1, 0, 0}; /// [Move in
int dy[] = {0, 0, 1, -1}; /// x and y axis]
int kx[] = {2, 2, -2, -2, 1, -1, 1, -1}; /// {Knight
int ky[] = {1, -1, 1, -1, 2, 2, -2, -2}; /// move}
bool grid[17][17];
int level[M];
int previous[M];
bool visited[M];
int row=8, col=8;
int process[M]; /// -1 -> not processed yet; 0 -> processing; 1 -> processed
(DFS) int parent[M]; /// (DFS) map<pii, int> weight; ///(Dijkstra) vector<ll>
dist(M, inf);
*/
// ll binpow(ll base, ll exp){ll res = 1;while(1){ if(exp&1)
// res*=base;exp>>=1;if(!exp)break;base*=base;}return res;}
/*ll bigmod(ll a, ll b, ll Md)
{
if(b == 0) return 1%Md;
ll x = bigmod(a, b/2, Md);
x = ((x%Md)*(x%Md))%Md;
if(b&1) x = ((x%Md)*(a%Md))%Md;
return x;
}*/
ll dp[100007], arr[100007];
ll n;
ll ABS(ll a) {
if (a < 0)
a *= -1;
return a;
}
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[2] = ABS(arr[2] - arr[1]);
// cout << dp[1] << " " << dp[2] << " ";
for (int i = 3; i <= n; i++) {
ll tmp = inf;
for (int j = 1; i - j >= 0 && j <= k; j++) {
tmp = min(tmp, ABS(arr[i] - arr[i - j]) + dp[i - j]);
}
dp[i] = tmp;
// cout << dp[i] << " " ;
}
cout << dp[n] << endl;
return 0;
}
| /*
|** In the name of Allah, most gracious, most merciful **|
* * ****
* * * *
* * * *
* * * *
** *** *** ***** ***** *** ** *** **** *** ** *** *** **
*** ***
* * * * * * * * * * * * * * * * * *
* * * *
* * * * * ***** * * * * * * * * * *
* * * *
* * * * * * * * * * * * * * * *
* * * *
* *** ** ** *** * * **** *** * * * *** *
* * *** *
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define FAST ios_base::sync_with_stdio(false)
#define FASTtie ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0)
#define PI 2 * acos(0.0)
#define E 2.718281828
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define pis pair<int, string>
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define F first
#define S second
#define add(v) accumulate(v.begin(), v.end(), 0)
#define srt(v) sort(v.begin(), v.end())
#define loop(i, n) for (int i = 0; i <= n; i++)
#define pqa_i priority_queue<int, vector<int>, greater<int>>
#define pqa_pii priority_queue<pii, vector<pii>, greater<pii>>
#define mp make_pair
#define endl "\n"
#define pf printf
#define sf(t) scanf("%d", &t)
#define memvis memset(visited, 0, M * sizeof(bool))
#define memvisg memset(visited, 0, sizeof visited)
#define memlev memset(level, -1, M * sizeof(int))
#define memprev memset(previous, -1, M * sizeof(int))
#define memlevg memset(level, -1, sizeof level)
#define mempro memset(process, -1, M * sizeof(int))
#define mempar memset(parent, -1, M * sizeof(int))
#define N 4
#define inf 1e18 + 10
#define nai string::npos
#define elif else if
#define ins insert
#define all(v) v.begin(), v.end()
#define debug(x) cout << #x << " = " << x << endl
#define ordered_set_int \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define ordered_set_str \
tree<string, null_type, less<string>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
void printarr(ull *arr, int f, int n, int base) {
for (int i = base + f; i < n + base; i++)
cout << arr[i] << "\n";
cout << endl;
}
const int M = 1e8 + 10;
const int Mx = 3125555;
/*multiset<int> adj[M];
int dx[] = {1, -1, 0, 0}; /// [Move in
int dy[] = {0, 0, 1, -1}; /// x and y axis]
int kx[] = {2, 2, -2, -2, 1, -1, 1, -1}; /// {Knight
int ky[] = {1, -1, 1, -1, 2, 2, -2, -2}; /// move}
bool grid[17][17];
int level[M];
int previous[M];
bool visited[M];
int row=8, col=8;
int process[M]; /// -1 -> not processed yet; 0 -> processing; 1 -> processed
(DFS) int parent[M]; /// (DFS) map<pii, int> weight; ///(Dijkstra) vector<ll>
dist(M, inf);
*/
// ll binpow(ll base, ll exp){ll res = 1;while(1){ if(exp&1)
// res*=base;exp>>=1;if(!exp)break;base*=base;}return res;}
/*ll bigmod(ll a, ll b, ll Md)
{
if(b == 0) return 1%Md;
ll x = bigmod(a, b/2, Md);
x = ((x%Md)*(x%Md))%Md;
if(b&1) x = ((x%Md)*(a%Md))%Md;
return x;
}*/
ll dp[100007], arr[100007];
ll n;
ll ABS(ll a) {
if (a < 0)
a *= -1;
return a;
}
int main() {
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[2] = ABS(arr[2] - arr[1]);
// cout << dp[1] << " " << dp[2] << " ";
for (int i = 3; i <= n; i++) {
ll tmp = inf;
for (int j = 1; i - j >= 1 && j <= k; j++) {
tmp = min(tmp, ABS(arr[i] - arr[i - j]) + dp[i - j]);
}
dp[i] = tmp;
// cout << dp[i] << " " ;
}
cout << dp[n] << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,962 | 961,963 | u203289196 | cpp |
p03161 | #include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N, K;
int dp[100100];
int h[100100];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
dp[i] = INF;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
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;
return 0;
}
| #include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N, K;
long long dp[100100];
int h[100100];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
dp[i] = INF;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
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;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 961,964 | 961,965 | u775623741 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
static int N, K;
static int stones[100004];
static int rem[100004];
using namespace std;
int solotion(int i) {
if (i >= N - 1) {
return 0;
}
if (rem[i] != -1) {
return rem[i];
}
int first = abs(stones[i] - stones[i + 1]) + solotion(i + 1);
for (int j = 2; j <= K; j++) {
int ks =
i + j < N ? abs(stones[i] - stones[j]) + solotion(i + j) : first + 1;
first = min(first, ks);
rem[i] = first;
}
rem[i] = first;
return rem[i];
}
int main() {
cin >> N;
cin >> K;
for (int i = 0; i < N; i++) {
cin >> stones[i];
rem[i] = -1;
}
printf("%d", solotion(0));
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
static int N, K;
static int stones[100004];
static int rem[100004];
using namespace std;
int solotion(int i) {
if (i >= N - 1) {
return 0;
}
if (rem[i] != -1) {
return rem[i];
}
int first = abs(stones[i] - stones[i + 1]) + solotion(i + 1);
for (int j = 2; j <= K; j++) {
int ks = i + j < N ? abs(stones[i] - stones[i + j]) + solotion(i + j)
: first + 1;
first = min(first, ks);
rem[i] = first;
}
rem[i] = first;
return rem[i];
}
int main() {
cin >> N;
cin >> K;
for (int i = 0; i < N; i++) {
cin >> stones[i];
rem[i] = -1;
}
printf("%d", solotion(0));
}
| [
"assignment.change"
] | 961,966 | 961,967 | u237573822 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define forn(i, n) for (int i = 0; i < n; i++)
#define mp makepair
#define pb push_back
int main() {
int n, k;
int arr[100000 + 7];
scanf("%d%d", &n, &k);
forn(i, n) scanf("%d", arr + i);
ll dp[100000 + 7];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1L << 63;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define forn(i, n) for (int i = 0; i < n; i++)
#define mp makepair
#define pb push_back
int main() {
int n, k;
int arr[100000 + 7];
scanf("%d%d", &n, &k);
forn(i, n) scanf("%d", arr + i);
ll dp[100000 + 7];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1L << 63 - 1;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"assignment.change"
] | 961,969 | 961,970 | u985355615 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, h[100000], dp[100000], k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, h[100000], dp[100000], k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 961,971 | 961,972 | u265206075 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, arr[100009], dp[100009], k;
long long bt(int id) {
long long &ret = dp[id];
if (ret != -1)
return ret;
if (id + 1 < n) {
ret = 10000000009;
for (int i = 1; i <= k; i++) {
if (id + i < n)
ret = min(ret, bt(id + i) + abs(arr[id] - arr[id + i]));
return ret;
}
} else
return 0;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << bt(0);
}
/*
#include <bits/stdc++.h>
using namespace std;
int n,arr[100009];
int dp[100009];
int main(){
cin>>n;
for(int i=0;i<n;i++) cin>>arr[i];
dp[n-2] = abs(arr[n-2]-arr[n-1]);
for(int i=n-3;i>=0;i--){
dp[i] = min(abs(arr[i]-arr[i+1])+dp[i+1],abs(arr[i]-arr[i+2])+dp[i+2]);
}
cout<<dp[0]<<endl;
}*/ | #include <bits/stdc++.h>
using namespace std;
long long n, arr[100009], dp[100009], k;
long long bt(int id) {
long long &ret = dp[id];
if (ret != -1)
return ret;
if (id + 1 < n) {
ret = 1000000000000009ll;
for (int i = 1; i <= k; i++) {
if (id + i < n)
ret = min(ret, bt(id + i) + abs(arr[id] - arr[id + i]));
}
return ret;
}
return 0;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << bt(0);
}
/*
#include <bits/stdc++.h>
using namespace std;
int n,arr[100009];
int dp[100009];
int main(){
cin>>n;
for(int i=0;i<n;i++) cin>>arr[i];
dp[n-2] = abs(arr[n-2]-arr[n-1]);
for(int i=n-3;i>=0;i--){
dp[i] = min(abs(arr[i]-arr[i+1])+dp[i+1],abs(arr[i]-arr[i+2])+dp[i+2]);
}
cout<<dp[0]<<endl;
}*/ | [
"literal.number.change",
"assignment.value.change"
] | 961,973 | 961,974 | u382971323 | cpp |
p03161 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i(a); i <= (b); ++i)
#define gc getchar()
struct Reader {
template <class T> inline operator T() {
T w;
char c, p = 0;
for (; !isdigit(c = gc); c == '-' && (p = 1))
;
for (w = c & 15; isdigit(c = gc); w = w * 10 + (c & 15))
;
return p ? -w : w;
}
} rd;
template <class T> inline bool smin(T &x, const T &y) {
return y < x ? x = y, 1 : 0;
}
template <class T> inline bool smax(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
typedef long long ll;
const int N(1e5 + 5);
int n, k, a[N], f[N];
int main() {
n = rd, k = rd;
REP(i, 1, n) a[i] = rd;
REP(i, 2, n) {
f[i] = f[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= k; ++j)
smin(f[i], f[i - j] + abs(a[i] - a[i - j]));
}
std::cout << f[n];
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, a, b) for (int i(a); i <= (b); ++i)
#define gc getchar()
struct Reader {
template <class T> inline operator T() {
T w;
char c, p = 0;
for (; !isdigit(c = gc); c == '-' && (p = 1))
;
for (w = c & 15; isdigit(c = gc); w = w * 10 + (c & 15))
;
return p ? -w : w;
}
} rd;
template <class T> inline bool smin(T &x, const T &y) {
return y < x ? x = y, 1 : 0;
}
template <class T> inline bool smax(T &x, const T &y) {
return x < y ? x = y, 1 : 0;
}
typedef long long ll;
const int N(1e5 + 5);
int n, k, a[N], f[N];
int main() {
n = rd, k = rd;
REP(i, 1, n) a[i] = rd;
REP(i, 2, n) {
f[i] = f[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j < i && j <= k; ++j)
smin(f[i], f[i - j] + abs(a[i] - a[i - j]));
}
std::cout << f[n];
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,977 | 961,978 | u616158789 | cpp |
p03161 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAX 9223372036854775800
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ll N, K;
cin >> N >> K;
ll h[N];
ll dp[N];
FOR(i, 0, N - 1) {
cin >> h[i];
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = abs(h[0], h[1]);
FOR(i, 2, N - 1) {
ll cost = LLONG_MAX;
FOR(j, 1, K) {
if (j - i >= 0) {
ll tmp = dp[i - j] + abs(h[i], h[i - j]);
cost = min(cost, tmp);
}
// cout<<cost<<endl;
}
dp[i] = cost;
}
cout << dp[N - 1] << endl;
FOR(i, 0, N - 1) {
// cout<<dp[i]<<endl;
}
} | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <string.h>
#include <string>
#include <utility>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAX 9223372036854775800
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
ll N, K;
cin >> N >> K;
ll h[N];
ll dp[N];
FOR(i, 0, N - 1) {
cin >> h[i];
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = abs(h[0], h[1]);
FOR(i, 2, N - 1) {
ll cost = LLONG_MAX;
FOR(j, 1, K) {
if (i - j >= 0) {
ll tmp = dp[i - j] + abs(h[i], h[i - j]);
cost = min(cost, tmp);
}
// cout<<cost<<endl;
}
dp[i] = cost;
}
cout << dp[N - 1] << endl;
FOR(i, 0, N - 1) {
// cout<<dp[i]<<endl;
}
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 961,979 | 961,980 | u043443359 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = i; j > max(i - k, -1); j--) {
dp[i] = min(dp[j] + abs(h[j] - h[i]), dp[i]);
}
}
printf("%d", dp[n - 1]);
} | #include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= max(i - k, 0); j--) {
dp[i] = min(dp[j] + abs(h[j] - h[i]), dp[i]);
}
}
printf("%d", dp[n - 1]);
} | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"call.arguments.change"
] | 961,982 | 961,983 | u385306891 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323
#define debug(x) cout << "Case " << x << ": "
#define For(i, n) for (long long i = 0; i < n; i++)
#define Frabs(i, a, b) for (long long i = a; i < b; i++)
#define Frabr(i, a, b) for (long long i = a; i >= b; i--)
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
// Handle:cyber_rajat
int main(int argc, char const *argv[]) {
sync;
ll n, k;
cin >> n >> k;
ll arr[n + 5] = {0}, dp[n + 5];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
for (ll i = 0; i <= n + 2; i++)
dp[i] = 1000000000;
dp[0] = 0, dp[1] = 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i < j)
break;
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323
#define debug(x) cout << "Case " << x << ": "
#define For(i, n) for (long long i = 0; i < n; i++)
#define Frabs(i, a, b) for (long long i = a; i < b; i++)
#define Frabr(i, a, b) for (long long i = a; i >= b; i--)
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
// Handle:cyber_rajat
int main(int argc, char const *argv[]) {
sync;
ll n, k;
cin >> n >> k;
ll arr[n + 5] = {0}, dp[n + 5];
for (ll i = 1; i <= n; i++)
cin >> arr[i];
for (ll i = 0; i <= n + 2; i++)
dp[i] = 1000000000;
dp[0] = 0, dp[1] = 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i <= j || j >= n)
break;
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,986 | 961,987 | u431173823 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<ll, ll>
#define vi vector<ll>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pf(n) printf("%lld\n", n)
#define sf(n) scanf("%lld", &n)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) x.begin(), x.end()
#define ms(n, i) memset(n, i, sizeof n)
#define sz(x) (ll) x.size()
#define pi 3.141592653589793238
#define hell 1000000007
#define hell2 1000000009
#define endl '\n'
#define inf 1e18
#define N 100005
int main() {
ll n;
cin >> n;
ll i, j, k;
cin >> k;
vi a(n), dp(n);
for (i = 0; i < n; i++)
cin >> a[i], dp[i] = inf;
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = i - 1; j >= max(0LL, i - k); j--)
dp[i] = min(dp[j], abs(a[i] - a[j]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<ll, ll>
#define vi vector<ll>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pf(n) printf("%lld\n", n)
#define sf(n) scanf("%lld", &n)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(x) x.begin(), x.end()
#define ms(n, i) memset(n, i, sizeof n)
#define sz(x) (ll) x.size()
#define pi 3.141592653589793238
#define hell 1000000007
#define hell2 1000000009
#define endl '\n'
#define inf 1e18
#define N 100005
int main() {
ll n;
cin >> n;
ll i, j, k;
cin >> k;
vi a(n), dp(n);
for (i = 0; i < n; i++)
cin >> a[i], dp[i] = inf;
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = i - 1; j >= max(0LL, i - k); j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
// cout<<dp[i]<<" ";
}
// cout<<endl;
cout << dp[n - 1] << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 961,991 | 961,992 | u501976062 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= j + k; j++)
dp[j] = min(dp[j], dp[i] + abs(cc[i] - cc[j]));
}
printf("%d\n", dp[n]);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= i + k; j++)
dp[j] = min(dp[j], dp[i] + abs(cc[i] - cc[j]));
}
printf("%d\n", dp[n]);
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,000 | 962,001 | u704549083 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= j + k; j++)
dp[j] = min(dp[j], dp[i] + abs(cc[i] - cc[j]));
}
printf("%d\n", dp[n]);
return 0;
} | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= i + k; j++)
dp[j] = min(dp[j], dp[i] + abs(cc[i] - cc[j]));
}
printf("%d\n", dp[n]);
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"call.arguments.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,002 | 962,001 | u704549083 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
// int moreGcd
int N = 0;
int K = 0;
vector<int> h;
int main() {
cin >> N;
cin >> K;
int t = 0;
h.push_back(0);
for (int i = 0; i < N; i++) {
cin >> t;
h.push_back(t);
}
vector<int> cost(N, 11451419);
cost[0] = 0;
cost[1] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j >= 1) {
cost[i] = min(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
// cout << cost[i] << endl;
}
cout << cost[N] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
// int moreGcd
int N = 0;
int K = 0;
vector<int> h;
//何がだめなのか全くわからん
int main() {
cin >> N;
cin >> K;
int t = 0;
h.push_back(0);
for (int i = 0; i < N; i++) {
cin >> t;
h.push_back(t);
}
vector<int> cost(N + 1, 1145141919);
// cout << cost.size() << endl;
//初期化的な
cost[0] = 0;
cost[1] = 0;
for (int i = 1; i <= N; i++) {
// cout << h[i] << endl;
for (int j = 1; j <= K; j++) {
if (i - j >= 1) {
// cout << abs(h[i]-h[i-j]) << endl;
cost[i] = min(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
// cout << cost[i] << " " ;
}
}
// cout << "::" << cost[i] << endl;
}
cout << cost[N] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 962,015 | 962,011 | u048791623 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 100007;
const long long INF = 100000009;
long long A[N], D[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> A[i], D[i] = INF;
D[1] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= i + k + 1; ++j) {
D[j] = min(D[j], D[i] + abs(A[i] - A[j]));
}
}
cout << D[n];
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1000007;
const long long INF = 1000000009;
long long A[N], D[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> A[i], D[i] = INF;
D[1] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= i + k; ++j) {
D[j] = min(D[j], D[i] + abs(A[i] - A[j]));
}
}
cout << D[n];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,029 | 962,030 | u588613695 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 3; i <= n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i <= n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,031 | 962,032 | u552951622 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int array[n];
for (int x = 0; x < n; x++) {
cin >> array[x];
}
int dp[n];
dp[0] = 0;
for (int x = 0; x <= k; x++) {
dp[x] = abs(array[x] - array[0]);
for (int i = 0; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
for (int x = k + 1; x < n; x++) {
dp[x] = dp[x - k] + abs(array[x] - array[x - k]);
for (int i = x - k; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int array[n];
for (int x = 0; x < n; x++) {
cin >> array[x];
}
int dp[n];
dp[0] = 0;
for (int x = 0; x <= k && x < n; x++) {
dp[x] = abs(array[x] - array[0]);
for (int i = 0; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
for (int x = k + 1; x < n; x++) {
dp[x] = dp[x - k] + abs(array[x] - array[x - k]);
for (int i = x - k; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 962,033 | 962,034 | u859774897 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define rep(i, s, n) for (int i = (s); (n) > i; i++)
#define REP(i, n) rep(i, 0, n)
#define RANGE(x, a, b) ((a) <= (x) && (x) < (b))
#define DUPLE(a, b, c, d) \
(RANGE(a, c, d) || RANGE(b, c, d) || RANGE(c, a, b) || RANGE(d, a, b))
#define INCLU(a, b, c, d) (RANGE(a, c, d) && (b, c, d))
#define PW(x) ((x) * (x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 1000000007LL
#define bitcheck(a, b) ((a >> b) & 1)
#define bitset(a, b) (a |= (1 << b))
#define bitunset(a, b) (a &= ~(1 << b))
#define MP(a, b) make_pair((a), (b))
#define Manh(a, b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589
#define izryt bool
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
pll Dir[8] = { //移動
{0, 1}, {-1, 0}, {1, 0}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
//[a, b)
#define Getsum(ar, a, b) (ar[b] - ar[a])
#define INF 10000000000000000LL
struct Edge {
int from, to;
ll w;
};
typedef vector<vector<Edge>> Graph;
signed main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n + 103);
REP(i, n) { cin >> h[i]; }
int dp[100103] = {};
Fill(dp, INT_MAX);
dp[0] = 0;
REP(i, n) {
rep(j, 1, k + 1) dp[i + k] = min(dp[i + k], dp[i] + abs(h[i] - h[i + k]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#define rep(i, s, n) for (int i = (s); (n) > i; i++)
#define REP(i, n) rep(i, 0, n)
#define RANGE(x, a, b) ((a) <= (x) && (x) < (b))
#define DUPLE(a, b, c, d) \
(RANGE(a, c, d) || RANGE(b, c, d) || RANGE(c, a, b) || RANGE(d, a, b))
#define INCLU(a, b, c, d) (RANGE(a, c, d) && (b, c, d))
#define PW(x) ((x) * (x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 1000000007LL
#define bitcheck(a, b) ((a >> b) & 1)
#define bitset(a, b) (a |= (1 << b))
#define bitunset(a, b) (a &= ~(1 << b))
#define MP(a, b) make_pair((a), (b))
#define Manh(a, b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589
#define izryt bool
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
pll Dir[8] = { //移動
{0, 1}, {-1, 0}, {1, 0}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
//[a, b)
#define Getsum(ar, a, b) (ar[b] - ar[a])
#define INF 10000000000000000LL
struct Edge {
int from, to;
ll w;
};
typedef vector<vector<Edge>> Graph;
signed main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n + 103);
REP(i, n) { cin >> h[i]; }
int dp[100103] = {};
Fill(dp, INT_MAX);
dp[0] = 0;
REP(i, n) {
rep(j, 1, k + 1) dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 962,035 | 962,036 | u152129372 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> c(n, 1e+9);
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= i - k && i - j >= 0; j--) {
c[i] = min(c[i], c[j] + abs(h[i] - h[j]));
}
}
cout << c[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> c(n, 1e+9);
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= i - k && j >= 0; j--) {
c[i] = min(c[i], c[j] + abs(h[i] - h[j]));
}
}
cout << c[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,037 | 962,038 | u376817785 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n), dp(n, 100007);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < n; i++) {
if (i < k) {
for (int j = 1; j < i + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
} else {
for (int j = 1; j < k + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> vec(n), dp(n, 10000000000);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < n; i++) {
if (i < k) {
for (int j = 1; j < i + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
} else {
for (int j = 1; j < k + 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
}
}
cout << dp[n - 1];
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 962,039 | 962,040 | u823444917 | cpp |
p03161 | /*input
5 3
10 30 40 50 20
*/
/**
* B Frog 2
* @author: Raj
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define MOD 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb(n) emplace_back(n)
#define pb(n) push_back(n)
#define F first
#define S second
#define int long long int
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
void note_to_myself() {
// new_data_set s;
// logn operations
// cout << *(s.find_by_order(i)) << " ";
// cout << "The index of number 6::" << p.order_of_key(6) << endl;
}
int add(int x, int y) {
x += y;
if (x >= MOD)
return x - MOD;
return x;
}
int sub(int x, int y) {
x -= y;
if (x < 0)
return x + MOD;
return x;
}
int mul(int x, int y) { return ((long long)x * y) % MOD; }
inline int power(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1) {
res = mul(res, a);
}
a = mul(a, a);
b >>= 1;
}
return res;
}
inline int inv(int a) {
a %= MOD;
if (a < 0)
a += MOD;
int b = MOD, u = 0, v = 1;
while (a) {
int t = b / a;
b -= t * a;
swap(a, b);
u -= t * v;
swap(u, v);
}
assert(b == 1);
if (u < 0)
u += MOD;
return u;
}
const int INF = 1e9 + 5;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi h(n), dp(n, INF);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < i + k; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | /*input
5 3
10 30 40 50 20
*/
/**
* B Frog 2
* @author: Raj
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define MOD 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb(n) emplace_back(n)
#define pb(n) push_back(n)
#define F first
#define S second
#define int long long int
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
void note_to_myself() {
// new_data_set s;
// logn operations
// cout << *(s.find_by_order(i)) << " ";
// cout << "The index of number 6::" << p.order_of_key(6) << endl;
}
int add(int x, int y) {
x += y;
if (x >= MOD)
return x - MOD;
return x;
}
int sub(int x, int y) {
x -= y;
if (x < 0)
return x + MOD;
return x;
}
int mul(int x, int y) { return ((long long)x * y) % MOD; }
inline int power(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1) {
res = mul(res, a);
}
a = mul(a, a);
b >>= 1;
}
return res;
}
inline int inv(int a) {
a %= MOD;
if (a < 0)
a += MOD;
int b = MOD, u = 0, v = 1;
while (a) {
int t = b / a;
b -= t * a;
swap(a, b);
u -= t * v;
swap(u, v);
}
assert(b == 1);
if (u < 0)
u += MOD;
return u;
}
const int INF = 1e9 + 5;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vi h(n), dp(n, INF);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,045 | 962,046 | u436403625 | cpp |
p03161 | /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = 10001;
for (int j = 1; j <= min(i, k); ++j) {
dis[i] = min(dis[i - j] + abs(h[i] - h[i - j]), dis[i]);
}
}
cout << dis[n - 1];
return 0;
}
| /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = INT_MAX;
for (int j = 1; j <= min(i, k); ++j) {
dis[i] = min(dis[i - j] + abs(h[i] - h[i - j]), dis[i]);
}
}
cout << dis[n - 1];
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,047 | 962,048 | u013751809 | cpp |
p03161 | /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = 1001;
for (int j = 1; j <= min(i, k); ++j) {
dis[i] = min(dis[i - j] + abs(h[i] - h[i - j]), dis[i]);
}
}
cout << dis[n - 1];
return 0;
}
| /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = INT_MAX;
for (int j = 1; j <= min(i, k); ++j) {
dis[i] = min(dis[i - j] + abs(h[i] - h[i - j]), dis[i]);
}
}
cout << dis[n - 1];
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,049 | 962,048 | u013751809 | cpp |
p03161 | #include <iostream>
using namespace std;
int N, K;
int H[100005];
int DP[100005];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 1; i < N; i++) {
DP[i] = 1e9;
for (int j = 1; j < min(i, K + 1); j++)
DP[i] = min(DP[i], DP[i - j] + abs(H[i] - H[i - j]));
}
cout << DP[N - 1];
} | #include <iostream>
using namespace std;
int N, K;
int H[100005];
int DP[100005];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 1; i < N; i++) {
DP[i] = 1e9;
for (int j = 1; j < min(i + 1, K + 1); j++)
DP[i] = min(DP[i], DP[i - j] + abs(H[i] - H[i - j]));
}
cout << DP[N - 1];
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 962,050 | 962,051 | u462369736 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &x : a) {
cin >> x;
}
vector<int> dp(n, 1e9 + 2);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
int cur = i + j;
if (cur < n) {
dp[cur] = min(dp[cur], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &x : a) {
cin >> x;
}
vector<int> dp(n, 1e9 + 2);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
int cur = i + j;
if (cur < n) {
dp[cur] = min(dp[cur], dp[i] + abs(a[i] - a[cur]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,052 | 962,053 | u770383589 | cpp |
p03161 | /*
Author : Pranav_Raut.
*/
#include <bits/stdc++.h>
using namespace std;
#define input(arr, n) \
for (ll i = 0; i < n; i++) { \
cin >> arr[i]; \
}
typedef long long int ll;
ll MOD = 1000000007;
ll MAXN = 100005;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
while (t--) {
/* JUST CODE TILL YOU CRACK IT !!! */
ll n, k;
cin >> n >> k;
ll arr[n + k];
ll ans[n + k];
input(arr, n);
for (ll i = n; i < n + k; ++i) {
arr[i] = arr[n - 1];
ans[i] = 0;
}
ans[n] = 0;
for (ll i = n - 2; i >= 0; --i) {
ll minn = INT_MAX;
for (ll j = 1; j <= k; j++) {
ll tt = abs(arr[i] - arr[i + j]) + ans[i + j];
if (tt < minn)
minn = tt;
}
ans[i] = minn;
}
cout << ans[0] << endl;
}
return 0;
}
| /*
Author : Pranav_Raut.
*/
#include <bits/stdc++.h>
using namespace std;
#define input(arr, n) \
for (ll i = 0; i < n; i++) { \
cin >> arr[i]; \
}
typedef long long int ll;
ll MOD = 1000000007;
ll MAXN = 100005;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
while (t--) {
/* JUST CODE TILL YOU CRACK IT !!! */
ll n, k;
cin >> n >> k;
ll arr[n + k];
ll ans[n + k];
input(arr, n);
for (ll i = n; i < n + k; ++i) {
arr[i] = arr[n - 1];
ans[i] = 0;
}
ans[n - 1] = 0;
for (ll i = n - 2; i >= 0; --i) {
ll minn = INT_MAX;
for (ll j = 1; j <= k; j++) {
ll tt = abs(arr[i] - arr[i + j]) + ans[i + j];
if (tt < minn)
minn = tt;
}
ans[i] = minn;
}
cout << ans[0] << endl;
}
return 0;
}
| [
"assignment.change"
] | 962,061 | 962,062 | u743925717 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return LONG_MAX;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i + j]) + rec(i + j);
}
return dp[i] = mini(ch);
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n; i < n + k; i++)
a[i] = 1e16;
cout << rec();
return 0;
}
ll mini(ll arr[]) {
ll res = arr[0];
for (int i = 1; i < k; i++)
if (res > arr[i])
res = arr[i];
return res;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return 1e16;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i + j]) + rec(i + j);
}
return dp[i] = mini(ch);
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n; i < n + k; i++)
a[i] = 1e16;
cout << rec();
return 0;
}
ll mini(ll arr[]) {
ll res = arr[0];
for (int i = 1; i < k; i++)
if (res > arr[i])
res = arr[i];
return res;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 962,065 | 962,066 | u840404068 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return LONG_MAX;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i + j]) + rec(i + j);
}
return dp[i] = mini(ch);
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n; i < n + k; i++)
a[i] = 1e9;
cout << rec();
return 0;
}
ll mini(ll arr[]) {
ll res = arr[0];
for (int i = 1; i < k; i++)
if (res > arr[i])
res = arr[i];
return res;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return 1e16;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i + j]) + rec(i + j);
}
return dp[i] = mini(ch);
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = n; i < n + k; i++)
a[i] = 1e16;
cout << rec();
return 0;
}
ll mini(ll arr[]) {
ll res = arr[0];
for (int i = 1; i < k; i++)
if (res > arr[i])
res = arr[i];
return res;
}
| [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change",
"literal.number.change",
"assignment.value.change"
] | 962,067 | 962,066 | u840404068 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 10005;
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
/*for(int i=0;i<n;i++)
cout<<dp[i]<<" ";
cout<<endl;*/
cout << dp[n - 1] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 1001001001;
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
/*for(int i=0;i<n;i++)
cout<<dp[i]<<" ";
cout<<endl;*/
cout << dp[n - 1] << "\n";
} | [
"literal.number.change",
"assignment.value.change"
] | 962,072 | 962,073 | u049031340 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a[100001], res[100001], mn, j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
res[1] = 0;
res[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
mn = res[i - 1] + abs(a[i] - a[i - 1]);
for (j = 2; j <= k; j++)
mn = min(mn, res[i - j] + abs(a[i] - a[i - j]));
res[i] = mn;
}
cout << res[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a[100001], res[100001], mn, j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
res[1] = 0;
res[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
mn = res[i - 1] + abs(a[i] - a[i - 1]);
for (j = 2; j <= k && i - j > 0; j++)
mn = min(mn, res[i - j] + abs(a[i] - a[i - j]));
res[i] = mn;
}
cout << res[n];
} | [
"control_flow.loop.for.condition.change"
] | 962,076 | 962,077 | u843774006 | cpp |
p03161 | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define maxval 100005
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n, k;
scanf("%d %d", &n, &k);
vector<int> h(n + 1);
vector<int> dp(n + 1, 1e5);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], abs(h[j] - h[i]) + dp[j]);
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define maxval 100005
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n, k;
scanf("%d %d", &n, &k);
vector<int> h(n + 1);
vector<int> dp(n + 1, 1e9);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], abs(h[j] - h[i]) + dp[j]);
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 962,078 | 962,079 | u926505307 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= min(k, i); ++j)
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - k]);
}
cout << dp[n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= min(k, i); ++j)
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
cout << dp[n - 1] << '\n';
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,089 | 962,090 | u784576081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n, k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= min(k, i); ++j)
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - k]);
}
cout << dp[n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= min(k, i); ++j)
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
cout << dp[n - 1] << '\n';
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,091 | 962,090 | u784576081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long int n, dp[100002], k;
long long int h[100002];
long long int solve(long long int index) {
if (index == n - 1)
return 0;
if (dp[index] != -1)
return dp[index];
long long int ans = 100;
for (int i = index + 1; i <= min(n - 1, index + k); i++)
ans = min(ans, solve(i) + abs(h[i] - h[index]));
return dp[index] = ans;
}
int main() {
long long int i, j, kk, x, y, z;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> h[i];
for (i = 0; i <= 100000; i++)
dp[i] = -1;
cout << solve(0);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long int n, dp[100002], k;
long long int h[100002];
long long int solve(long long int index) {
if (index == n - 1)
return 0;
if (dp[index] != -1)
return dp[index];
long long int ans = 1e9;
for (int i = index + 1; i <= min(n - 1, index + k); i++)
ans = min(ans, solve(i) + abs(h[i] - h[index]));
return dp[index] = ans;
}
int main() {
long long int i, j, kk, x, y, z;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> h[i];
for (i = 0; i <= 100000; i++)
dp[i] = -1;
cout << solve(0);
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 962,092 | 962,093 | u711948228 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (1 + k <= n) {
cout << abs(h[n - 1] - h[0]) << endl;
return 0;
}
vector<long long> dp(n, 0);
dp[0] = 0;
for (int i = 0; i < k + 1; i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n <= 1 + k) {
cout << abs(h[n - 1] - h[0]) << endl;
return 0;
}
vector<long long> dp(n, 0);
dp[0] = 0;
for (int i = 0; i < k + 1; i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k + 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 962,096 | 962,097 | u790502959 | cpp |
p03161 | #include <climits>
#include <fstream>
#include <iostream>
#include <vector>
#define NMAX 100001
using namespace std;
int DP[NMAX], n, initial[NMAX], k;
void read() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> initial[i];
}
}
void solve() {
for (int i = 2; i <= n; i++) {
DP[i] = INT_MAX;
}
for (int i = 1; i <= n - k; i++) {
for (int j = 1; j <= k; j++) {
DP[i + j] = min(DP[i] + abs(initial[i] - initial[i + j]), DP[i + j]);
}
}
cout << DP[n] << '\n';
}
int main() {
read();
solve();
return 0;
} | #include <climits>
#include <fstream>
#include <iostream>
#include <vector>
#define NMAX 100001
using namespace std;
int DP[NMAX], n, initial[NMAX], k;
void read() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> initial[i];
}
}
void solve() {
for (int i = 2; i <= n; i++) {
DP[i] = INT_MAX;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
DP[i + j] = min(DP[i] + abs(initial[i] - initial[i + j]), DP[i + j]);
}
}
cout << DP[n] << '\n';
}
int main() {
read();
solve();
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,098 | 962,099 | u389532053 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
long long int dp[n + 1];
for (long long int i = 0; i <= n; i++) {
dp[i] = 1e9 + 5;
}
dp[1] = 0;
for (long long int i = 2; i <= n; i++) {
long long int min1 = 100005;
for (long long int j = 1; j <= k; j++) {
if (i - j > 0) {
min1 = min(min1, dp[i - j] + abs(h[i] - h[i - j]));
} else {
break;
}
}
dp[i] = min1;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
long long int dp[n + 1];
for (long long int i = 0; i <= n; i++) {
dp[i] = 1e9 + 5;
}
dp[1] = 0;
for (long long int i = 2; i <= n; i++) {
long long int min1 = 1e9 + 5;
for (long long int j = 1; j <= k; j++) {
if (i - j > 0) {
min1 = min(min1, dp[i - j] + abs(h[i] - h[i - j]));
} else {
break;
}
}
dp[i] = min1;
}
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change"
] | 962,100 | 962,101 | u450781785 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin >> hi;
h[i] = hi;
}
}
void solve() {
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[i] = 0;
else {
ll cost = INT64_MAX;
for (int j = 1; j <= K; j++) {
if (i - j < 0)
break;
cost = min(cost, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = cost;
}
}
}
int main() {
input();
solve();
cout << dp[N] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin >> hi;
h[i] = hi;
}
}
void solve() {
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[i] = 0;
else {
ll cost = INT64_MAX;
for (int j = 1; j <= K; j++) {
if (i - j <= 0)
break;
cost = min(cost, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = cost;
}
}
}
int main() {
input();
solve();
cout << dp[N] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,105 | 962,106 | u610253537 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin >> hi;
h[i] = hi;
}
}
void solve() {
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[i] = 0;
else {
ll cost = 10e10;
for (int j = 1; j <= K; j++) {
if (i - j < 0)
break;
cost = min(cost, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = cost;
}
}
}
int main() {
input();
solve();
cout << dp[N] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin >> hi;
h[i] = hi;
}
}
void solve() {
for (int i = 1; i <= N; i++) {
if (i == 1)
dp[i] = 0;
else {
ll cost = INT64_MAX;
for (int j = 1; j <= K; j++) {
if (i - j <= 0)
break;
cost = min(cost, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = cost;
}
}
}
int main() {
input();
solve();
cout << dp[N] << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,107 | 962,106 | u610253537 | cpp |
p03161 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace ::std;
vector<int> v, a;
#define INT_MAX 2100000000
signed main() {
int n, k;
cin >> n;
cin >> k;
v.resize(n);
a.resize(n, INT_MAX);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
a[0] = 0;
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k && i - j >= 0; j++)
a[i] = min(a[i], a[i - j] + abs(v[i - j] - v[i]));
}
cout << a[n - 1];
cin >> n;
}
// aaaddda | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace ::std;
vector<int> v, a;
#define INT_MAX 2100000000
signed main() {
int n, k;
cin >> n;
cin >> k;
v.resize(n);
a.resize(n, INT_MAX);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
a[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k && i - j >= 0; j++)
a[i] = min(a[i], a[i - j] + abs(v[i - j] - v[i]));
}
cout << a[n - 1];
cin >> n;
}
// aaaddda | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,112 | 962,113 | u095384223 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++)
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
cout << dp[n] << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k && i - j > 0; j++)
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
cout << dp[n] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 962,114 | 962,115 | u523141528 | cpp |
p03161 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define ALL(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N;
cin >> K;
int h[0] = {};
REP(i, N) cin >> h[i];
ll DP[N];
REP(i, N) DP[i] = INF;
DP[0] = 0;
REPS(i, N - 1) {
REPS(j, K) {
if (i - j >= 0)
chmin(DP[i], DP[i - j] + abs(h[i] - h[i - j]));
}
}
cout << DP[N - 1];
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define ALL(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N;
cin >> K;
int h[N] = {};
REP(i, N) cin >> h[i];
ll DP[N];
REP(i, N) DP[i] = INF;
DP[0] = 0;
REPS(i, N - 1) {
REPS(j, K) {
if (i - j >= 0)
chmin(DP[i], DP[i - j] + abs(h[i] - h[i - j]));
}
}
cout << DP[N - 1];
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 962,120 | 962,121 | u054106284 | 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 min_jumps[n];
min_jumps[0] = 0;
for (int i = 1; i < k; i++)
min_jumps[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " << i << " " <<
// abs(arr[i]-arr[i-1])+min_jumps[i-1] << endl;
for (int j = 1; j <= k; j++) {
if (min_jumps[i] > abs(arr[i] - arr[i - j]) + min_jumps[i - j])
min_jumps[i] = abs(arr[i] - arr[i - j]) + min_jumps[i - j];
}
}
// for(int i =0; i<n;i++)
cout << min_jumps[n - 1] << endl;
return 0;
} | #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 min_jumps[max(n, k)];
min_jumps[0] = 0;
for (int i = 1; i < k; i++)
min_jumps[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " << i << " " <<
// abs(arr[i]-arr[i-1])+min_jumps[i-1] << endl;
for (int j = 1; j <= k; j++) {
if (min_jumps[i] > abs(arr[i] - arr[i - j]) + min_jumps[i - j])
min_jumps[i] = abs(arr[i] - arr[i - j]) + min_jumps[i - j];
}
}
// for(int i =0; i<n;i++)
cout << min_jumps[n - 1] << endl;
return 0;
} | [
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.add"
] | 962,124 | 962,125 | u010432749 | cpp |
p03161 | //
// main.cpp
// ProjG
//
// Created by Tay Yong Kiat on 14/1/19.
// Copyright © 2019 Tay Yong Kiat. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
int n, x, k, dp[100001];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n && cin >> x; i++) {
a.push_back(x);
}
fill(dp, dp + n, 10000);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; i - j >= 0 && j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1];
return 0;
}
| //============================================================================
// Name : ProjG.cpp
// Author : Yong Kiat
// Version :
// Copyright : By Algotae.
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/stdc++.h>
using namespace std;
int n, x, k, dp[100001];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n && cin >> x; i++) {
a.push_back(x);
}
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; i - j >= 0 && j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,126 | 962,127 | u264397431 | cpp |
p03161 | //
// main.cpp
// ProjG
//
// Created by Tay Yong Kiat on 14/1/19.
// Copyright © 2019 Tay Yong Kiat. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
int n, x, k, dp[100001];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n && cin >> x; i++) {
a.push_back(x);
}
fill(dp, dp + n, 10000);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; i - j >= 0 && j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1];
return 0;
}
| //============================================================================
// Name : ProjG.cpp
// Author : Yong Kiat
// Version :
// Copyright : By Algotae.
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bits/stdc++.h>
using namespace std;
int n, x, k, dp[100001];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n && cin >> x; i++) {
a.push_back(x);
}
fill(dp, dp + n, 1000000001);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; i - j >= 0 && j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,126 | 962,128 | u264397431 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long m_min(long long t[], long long K) {
long long m = INT_MAX;
for (long long i = 0; i < K; i++)
if (t[i] < m)
m = t[i];
return m;
}
int main() {
long long N, K;
long long temp;
cin >> N >> K;
long long arr[N];
long long dp[N];
dp[0] = 0;
for (long long i = 0; i < N; i++)
cin >> arr[i];
for (long long i = 1; i < N; i++) {
if (i < K)
temp = i + 1;
else
temp = K + 1;
long long t[temp - 1];
for (long long j = 1; j < temp; j++) {
t[j - 1] = dp[i - j] + abs(arr[i] - arr[i - j]);
}
dp[i] = m_min(t, temp);
}
cout << dp[N - 1];
} | #include <bits/stdc++.h>
using namespace std;
long long m_min(long long t[], long long K) {
long long m = INT_MAX;
for (long long i = 0; i < K; i++)
if (t[i] < m)
m = t[i];
return m;
}
int main() {
long long N, K;
long long temp;
cin >> N >> K;
long long arr[N];
long long dp[N];
dp[0] = 0;
for (long long i = 0; i < N; i++)
cin >> arr[i];
for (long long i = 1; i < N; i++) {
if (i < K)
temp = i + 1;
else
temp = K + 1;
long long t[temp - 1];
for (long long j = 1; j < temp; j++) {
t[j - 1] = dp[i - j] + abs(arr[i] - arr[i - j]);
}
dp[i] = m_min(t, temp - 1);
}
cout << dp[N - 1];
} | [
"assignment.change"
] | 962,131 | 962,132 | u530804336 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int a[100001], f[100001] = {0};
int main() {
int n, m, k, i, j;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= n; i++) {
f[i] = 0x7ffffff;
for (j = 1; j <= min(i - 1, k); j++) {
f[i] = min(abs(a[i - j] - a[i]) + f[i - j], f[i]);
}
}
printf("%d", f[n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100001], f[100001] = {0};
int main() {
int n, m, k, i, j;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 2; i <= n; i++) {
f[i] = 0x7fffffff;
for (j = 1; j <= min(i - 1, k); j++) {
f[i] = min(abs(a[i - j] - a[i]) + f[i - j], f[i]);
}
}
printf("%d", f[n]);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,137 | 962,136 | u547898034 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a temperature expressed as an integer ranging from -273 to 5526
cin >> t;
cin.ignore();
h.push_back(t);
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int mincost = 10000;
for (int j = 0; j < k; j++) {
if (j == i)
break;
mincost = min(mincost, cost[i - (j + 1)] + abs(h[i] - h[i - (j + 1)]));
}
cost[i] = mincost;
}
cout << cost[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a temperature expressed as an integer ranging from -273 to 5526
cin >> t;
cin.ignore();
h.push_back(t);
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int mincost = 1000000000;
for (int j = 0; j < k; j++) {
if (j == i)
break;
mincost = min(mincost, cost[i - (j + 1)] + abs(h[i] - h[i - (j + 1)]));
}
cost[i] = mincost;
}
cout << cost[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 962,140 | 962,139 | u103094881 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a temperature expressed as an integer ranging from -273 to 5526
cin >> t;
cin.ignore();
h.push_back(t);
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int mincost = 10000;
for (int j = 0; j < k; j++) {
if (j > i - 1)
break;
mincost = min(mincost, cost[i - (j + 1)] + abs(h[i] - h[i - (j + 1)]));
}
cost[i] = mincost;
}
cout << cost[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a temperature expressed as an integer ranging from -273 to 5526
cin >> t;
cin.ignore();
h.push_back(t);
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int mincost = 1000000000;
for (int j = 0; j < k; j++) {
if (j == i)
break;
mincost = min(mincost, cost[i - (j + 1)] + abs(h[i] - h[i - (j + 1)]));
}
cost[i] = mincost;
}
cout << cost[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,141 | 962,139 | u103094881 | cpp |
p03161 | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#ifdef __APPLE__
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " ";
__f(comma + 1, args...);
}
#else
#define debug(...)
#endif
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i)
os << v[i] << " ";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it : v)
os << it << " ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.ff << " " << v.ss;
return os;
}
const int mod = 1e9 + 7;
const int inf = 2e18;
const int ninf = -2e18;
int dp[100005];
int pow(int a, int b, int m) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef __APPLE__
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
time_t t1, t2;
t1 = clock();
int n, k;
cin >> n >> k;
int hs[n + 1];
for (int i = 1; i <= n; i++) {
cin >> hs[i];
}
dp[1] = 0;
dp[2] = abs(hs[2] - hs[1]);
for (int i = 3; i <= n; i++) {
int count = 0;
int j = 0;
int tempi = 1;
int val = i - k;
j = max(tempi, val);
int minil = 100000;
while (j < i) {
minil = min(minil, (dp[j] + abs(hs[j] - hs[i])));
j++;
}
dp[i] = minil;
}
cout << dp[n] << endl;
t2 = clock();
cerr << endl << t2 - t1 << endl;
return 0;
}
| /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#ifdef __APPLE__
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " ";
__f(comma + 1, args...);
}
#else
#define debug(...)
#endif
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i)
os << v[i] << " ";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it : v)
os << it << " ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.ff << " " << v.ss;
return os;
}
const int mod = 1e9 + 7;
const int inf = 2e18;
const int ninf = -2e18;
int dp[100005];
int pow(int a, int b, int m) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef __APPLE__
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
time_t t1, t2;
t1 = clock();
int n, k;
cin >> n >> k;
int hs[n + 1];
for (int i = 1; i <= n; i++) {
cin >> hs[i];
}
dp[1] = 0;
dp[2] = abs(hs[2] - hs[1]);
for (int i = 3; i <= n; i++) {
int count = 0;
int j = 0;
int tempi = 1;
int val = i - k;
j = max(tempi, val);
int minil = inf;
while (j < i) {
minil = min(minil, (dp[j] + abs(hs[j] - hs[i])));
j++;
}
dp[i] = minil;
}
cout << dp[n] << endl;
t2 = clock();
cerr << endl << t2 - t1 << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,144 | 962,145 | u368039995 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long long x[],
long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] = ans[i - j] + abs(h[i - j] - h[i]);
}
}
sort(x, x + 110);
ans[i] = x[0]; //配列xの最小値を代入
return ans[i];
}
int main() {
//入力関係
long n;
cin >> n;
long k;
cin >> k;
long long h[110000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long ans[110000];
// dp配列の初項,第2項
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
long long x[110]; // i<=kであるようなans[i+1]の候補となる配列
for (long i = 2; i < n; i++) {
for (int i = 0; i < 110; i++) {
x[i] = 110000;
}
ans[i] = dp_Func(h, i, k, x, ans);
}
cout << ans[n - 1] << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long long x[],
long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] = ans[i - j] + abs(h[i - j] - h[i]);
}
}
sort(x, x + 110);
ans[i] = x[0]; //配列xの最小値を代入
return ans[i];
}
int main() {
//入力関係
long n;
cin >> n;
long k;
cin >> k;
long long h[110000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long ans[110000];
// dp配列の初項,第2項
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
long long x[110]; // i<=kであるようなans[i+1]の候補となる配列
for (long i = 2; i < n; i++) {
for (int i = 0; i < 110; i++) {
x[i] = 11000000000;
}
ans[i] = dp_Func(h, i, k, x, ans);
}
cout << ans[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change"
] | 962,146 | 962,147 | u123896133 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long x[], long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] = ans[i - j] + abs(h[i - j] - h[i]);
}
}
sort(x, x + 110);
ans[i] = x[0]; //配列xの最小値を代入
return ans[i];
}
int main() {
//入力関係
long n;
cin >> n;
long k;
cin >> k;
long long h[110000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long ans[110000];
// dp配列の初項,第2項
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
long x[110]; // i<=kであるようなans[i+1]の候補となる配列
for (long i = 2; i < n; i++) {
for (int i = 0; i < 110; i++) {
x[i] = 110000;
}
ans[i] = dp_Func(h, i, k, x, ans);
}
cout << ans[n - 1] << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long long x[],
long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] = ans[i - j] + abs(h[i - j] - h[i]);
}
}
sort(x, x + 110);
ans[i] = x[0]; //配列xの最小値を代入
return ans[i];
}
int main() {
//入力関係
long n;
cin >> n;
long k;
cin >> k;
long long h[110000];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long ans[110000];
// dp配列の初項,第2項
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
long long x[110]; // i<=kであるようなans[i+1]の候補となる配列
for (long i = 2; i < n; i++) {
for (int i = 0; i < 110; i++) {
x[i] = 11000000000;
}
ans[i] = dp_Func(h, i, k, x, ans);
}
cout << ans[n - 1] << endl;
} | [
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 962,148 | 962,147 | u123896133 | cpp |
p03161 | /* ~created by Roh@n M@he$hwari~ */
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, j, k;
cin >> n >> k;
int dp[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INT_MAX;
}
dp[0] = 0, dp[1] = abs(h[1] - h[0]);
for (i = k - 1; i < n; i++)
for (j = k; j > 0; j--) {
if (i - j >= 0)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
// for(i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1] << endl;
return 0;
}
| /* ~created by Roh@n M@he$hwari~ */
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, j, k;
cin >> n >> k;
int dp[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INT_MAX;
}
dp[0] = 0, dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++)
for (j = k; j > 0; j--) {
if (i - j >= 0)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
// for(i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 962,151 | 962,152 | u042763058 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define ll long long
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
typedef long long ui64;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
i64 n, ans = 0, k;
// vi64 v;
cin >> n >> k;
vi64 v(n + 1);
for1(i, n) { cin >> v[i]; }
i64 dp[100000];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(v[i] - v[i - 1]);
for (int j = 2; j <= k && j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define ll long long
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
typedef long long ui64;
template <class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template <class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
int main() {
i64 n, ans = 0, k;
// vi64 v;
cin >> n >> k;
vi64 v(n + 1);
for1(i, n) { cin >> v[i]; }
i64 dp[100000];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(v[i] - v[i - 1]);
for (int j = 2; j <= k && j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
cout << dp[n];
return 0;
}
| [
"expression.operation.binary.remove"
] | 962,153 | 962,154 | u114047445 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
int N, K, h[100002], dp[100002];
int main() {
scanf("%d %d %d", &N, &K, &h[1]);
for (int i = 2; i <= N; i++) {
scanf("%d", &h[i]);
dp[i] = 1e9;
for (int j = i - 1; j >= max(0, i - K); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
printf("%d\n", dp[N]);
} | #include "bits/stdc++.h"
using namespace std;
int N, K, h[100002], dp[100002];
int main() {
scanf("%d %d %d", &N, &K, &h[1]);
for (int i = 2; i <= N; i++) {
scanf("%d", &h[i]);
dp[i] = 1e9;
for (int j = i - 1; j >= max(1, i - K); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
printf("%d\n", dp[N]);
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,157 | 962,158 | u051773060 | cpp |
p03161 | // In the name of ALLAH the most merciful the most beneficial
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#define sc(x) scanf("%d", &x)
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORd(i, a, b) for (int i = a; i > b; i--)
#define ff first
#define ss second
#define sz(x) x.size()
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int con = 1e5 + 8;
static const int INF = 0x3f3f3f3f;
static const int MOD = 998244353;
int main() {
int ans[con];
FOR(i, 0, con)
ans[i] = 100000;
int N, k;
sc(N);
sc(k);
int arr[N + 1];
FOR(i, 1, N + 1) { sc(arr[i]); }
ans[1] = 0;
ans[2] = abs(arr[2] - arr[1]);
// Filling uptill first k
FOR(i, 3, k + 1) {
FOR(j, 1, i) { ans[i] = min(ans[i], ans[j] + abs(arr[j] - arr[i])); }
}
FOR(i, k + 1, N + 1) {
FOR(j, i - k, i) { ans[i] = min(ans[i], ans[j] + abs(arr[j] - arr[i])); }
}
cout << ans[N];
}
| // In the name of ALLAH the most merciful the most beneficial
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#define sc(x) scanf("%d", &x)
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORd(i, a, b) for (int i = a; i > b; i--)
#define ff first
#define ss second
#define sz(x) x.size()
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int con = 1e5 + 8;
static const int INF = 0x3f3f3f3f;
static const int MOD = 998244353;
int main() {
int ans[con];
FOR(i, 0, con)
ans[i] = 1000000000;
int N, k;
sc(N);
sc(k);
int arr[N + 1];
FOR(i, 1, N + 1) { sc(arr[i]); }
ans[1] = 0;
ans[2] = abs(arr[2] - arr[1]);
// Filling uptill first k
FOR(i, 3, k + 1) {
FOR(j, 1, i) { ans[i] = min(ans[i], ans[j] + abs(arr[j] - arr[i])); }
}
FOR(i, k + 1, N + 1) {
FOR(j, i - k, i) { ans[i] = min(ans[i], ans[j] + abs(arr[j] - arr[i])); }
}
cout << ans[N];
}
| [
"literal.number.change",
"assignment.value.change"
] | 962,159 | 962,160 | u436364432 | cpp |
p03161 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vector<ll> a(n);
a[0] = 0;
for (ll i = 1; i < n; i++) {
ll mi = (1 << 31);
for (ll j = i - 1; j >= 0 && j >= i - k; j--) {
mi = min((abs(h[i] - h[j]) + a[j]), mi);
}
a[i] = mi;
}
cout << a[n - 1] << endl;
/* a[1]=abs(h[1]-h[0]);
if(n==2){cout<<a[1];return 0;}
for(int i=2;i<n;i++){
a[i]=min((abs(h[i]-h[i-1])+a[i-1]),abs(h[i]-h[i-2])+a[i-2]);
}
cout<<a[n-1]<<endl;*/
return 0;
} |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vector<ll> a(n);
a[0] = 0;
for (ll i = 1; i < n; i++) {
ll mi = 1e+14;
for (ll j = i - 1; j >= 0 && j >= i - k; j--) {
mi = min((abs(h[i] - h[j]) + a[j]), mi);
}
a[i] = mi;
}
cout << a[n - 1] << endl;
/* a[1]=abs(h[1]-h[0]);
if(n==2){cout<<a[1];return 0;}
for(int i=2;i<n;i++){
a[i]=min((abs(h[i]-h[i-1])+a[i-1]),abs(h[i]-h[i-2])+a[i-2]);
}
cout<<a[n-1]<<endl;*/
return 0;
}
| [
"variable_declaration.value.change"
] | 962,165 | 962,166 | u031448582 | cpp |
p03161 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vector<ll> a(n);
a[0] = 0;
for (ll i = 1; i < n; i++) {
ll mi = (1 << 31);
for (ll j = i - 1; j >= 0 && j >= i - k; j--) {
mi = min((abs(h[i] - h[j]) + a[j]), mi);
}
a[i] = mi;
}
cout << a[n - 1] << endl;
/* a[1]=abs(h[1]-h[0]);
if(n==2){cout<<a[1];return 0;}
for(int i=2;i<n;i++){
a[i]=min((abs(h[i]-h[i-1])+a[i-1]),abs(h[i]-h[i-2])+a[i-2]);
}
cout<<a[n-1]<<endl;*/
return 0;
} | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vector<ll> a(n);
a[0] = 0;
for (ll i = 1; i < n; i++) {
ll mi = (1ll << 32);
for (ll j = i - 1; j >= 0 && j >= i - k; j--) {
mi = min((abs(h[i] - h[j]) + a[j]), mi);
}
a[i] = mi;
}
cout << a[n - 1] << endl;
/* a[1]=abs(h[1]-h[0]);
if(n==2){cout<<a[1];return 0;}
for(int i=2;i<n;i++){
a[i]=min((abs(h[i]-h[i-1])+a[i-1]),abs(h[i]-h[i-2])+a[i-2]);
}
cout<<a[n-1]<<endl;*/
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 962,165 | 962,169 | u031448582 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 100010;
int n, k;
int h[N], cost[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 1; i <= n; ++i) {
cost[i] = inf;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = i - 1; j > 0 && i - j <= k; --j) {
cost[i] = min(cost[i], abs(h[i] - h[j]));
}
}
cout << cost[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 100010;
int n, k;
int h[N], cost[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 1; i <= n; ++i) {
cost[i] = inf;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = i - 1; j > 0 && i - j <= k; --j) {
cost[i] = min(cost[i], cost[j] + abs(h[i] - h[j]));
}
}
cout << cost[n] << endl;
} | [
"assignment.change"
] | 962,171 | 962,172 | u118354813 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
int n, k, arr[MAX], dp[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
for (int j = 1; i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(arr[i + j] - arr[i]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
int n, k, arr[MAX], dp[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k && i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(arr[i + j] - arr[i]));
}
}
cout << dp[n - 1] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 962,173 | 962,174 | u386030504 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long int
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
const int N = 1e5 + 5;
int n, h[N], cache[N], k;
int dp(int pos) {
if (pos == n)
return 0;
if (pos == n - 1)
return abs(h[pos] - h[n]);
int &ans = cache[pos];
if (ans != -1)
return ans;
ans = 1e15;
for (int i = pos + 1; i <= (pos + k); i++)
ans = min(dp(i) + abs(h[pos] - h[i]), ans);
return ans;
}
int32_t main() {
IOS;
memset(cache, -1, sizeof cache);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
cout << dp(1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long int
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
const int N = 1e5 + 5;
int n, h[N], cache[N], k;
int dp(int pos) {
if (pos == n)
return 0;
if (pos == n - 1)
return abs(h[pos] - h[n]);
int &ans = cache[pos];
if (ans != -1)
return ans;
ans = 1e15;
for (int i = pos + 1; i <= min(n, (pos + k)); i++)
ans = min(dp(i) + abs(h[pos] - h[i]), ans);
return ans;
}
int32_t main() {
IOS;
memset(cache, -1, sizeof cache);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
cout << dp(1);
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 962,175 | 962,176 | u791542693 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n, k;
cin >> n >> k;
ll a[10010];
rep(i, 0, n) cin >> a[i];
ll dp[100010];
rep(i, 0, n + 1) dp[i] = inf;
dp[0] = 0;
rep(i, 0, n) {
rep(j, 1, k + 1) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n, k;
cin >> n >> k;
ll a[100010];
rep(i, 0, n) cin >> a[i];
ll dp[100010];
rep(i, 0, n) dp[i] = inf;
dp[0] = 0;
rep(i, 0, n) {
rep(j, 1, k + 1) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 962,185 | 962,183 | u075865455 | cpp |
p03161 | #include <bits/stdc++.h>
#define adj_list vector<vi>
#define endl "\n"
#define INF_INT 2e9
#define INF_LL 2e18
#define matmax 25
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define pi pair<int, int>
#define pii pair<int, pair<int, int>>
#define pl pair<ll, ll>
#define pll pair<ll, pair<ll, ll>>
#define vi vector<int>
#define vl vector<ll>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
typedef long long int ll;
int lsone(int n) { return (n & -n); }
ll pow1(ll a, ll b) {
if (b == 0)
return 1ll;
else if (b == 1)
return a;
else {
ll x = pow1(a, b / 2);
x *= x;
x %= mod;
if (b % 2) {
x *= a;
x %= mod;
}
return x;
}
}
ll n, h[110000], dp[110000], k;
int main() {
fastio;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = 1e18;
for (int j = i - 1; j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define adj_list vector<vi>
#define endl "\n"
#define INF_INT 2e9
#define INF_LL 2e18
#define matmax 25
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define pi pair<int, int>
#define pii pair<int, pair<int, int>>
#define pl pair<ll, ll>
#define pll pair<ll, pair<ll, ll>>
#define vi vector<int>
#define vl vector<ll>
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
typedef long long int ll;
int lsone(int n) { return (n & -n); }
ll pow1(ll a, ll b) {
if (b == 0)
return 1ll;
else if (b == 1)
return a;
else {
ll x = pow1(a, b / 2);
x *= x;
x %= mod;
if (b % 2) {
x *= a;
x %= mod;
}
return x;
}
}
ll n, h[110000], dp[110000], k;
int main() {
fastio;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = 1e18;
for (int j = i - 1; j >= max(1ll, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 962,188 | 962,189 | u492711014 | cpp |
p03161 | #include <iostream>
#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
// const int MOD = 10e9+7;
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
signed main() {
int N, K;
cin >> N, K;
int h[N];
int dp[100100];
REP(i, N) cin >> h[i];
fill(dp, dp + N, INF);
dp[0] = 0;
REP(i, N) {
// dp[i]はi+1番目のところに行きつくまでの最短コスト
FOR(j, 1, K + 1)
if (i + j <= N) dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
cout << dp[N - 1] << endl;
}
| #include <iostream>
#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
// const int MOD = 10e9+7;
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
signed main() {
int N, K;
cin >> N >> K;
int h[N];
int dp[100100];
REP(i, N) cin >> h[i];
fill(dp, dp + N, INF);
dp[0] = 0;
REP(i, N) {
// dp[i]はi+1番目のところに行きつくまでの最短コスト
FOR(j, 1, K + 1)
if (i + j <= N) dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
cout << dp[N - 1] << endl;
}
| [] | 962,190 | 962,191 | u904833081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 100100;
constexpr int INF = 1e9 + 5;
int n, k;
int arr[MAX_N];
int dp[MAX_N];
int main() {
scanf(" %d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf(" %d", &arr[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = -1;
for (int j = 1; j <= k; ++j) {
if (i - j < 0)
continue;
if (dp[i - j] == -1)
continue;
int cur = dp[i - j] + abs(arr[i] - arr[i - j]);
if (dp[i] == -1 || cur < dp[i]) {
dp[i] = cur;
}
}
}
printf("%d\n", dp[n]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 100100;
constexpr int INF = 1e9 + 5;
int n, k;
int arr[MAX_N];
int dp[MAX_N];
int main() {
scanf(" %d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf(" %d", &arr[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = -1;
for (int j = 1; j <= k; ++j) {
if (i - j <= 0)
continue;
if (dp[i - j] == -1)
continue;
int cur = dp[i - j] + abs(arr[i] - arr[i - j]);
if (dp[i] == -1 || cur < dp[i]) {
dp[i] = cur;
}
}
}
printf("%d\n", dp[n]);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,192 | 962,193 | u928667792 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, h[100000], dp[100000];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
int tmp = 99999;
for (int j = 1; j <= i && j <= k; j++) {
tmp = min(tmp, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = tmp;
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, h[100000], dp[100000];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
int tmp = INT_MAX;
for (int j = 1; j <= i && j <= k; j++) {
tmp = min(tmp, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = tmp;
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,196 | 962,195 | u565219356 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int r = 1e5 + 1;
int a[r], dp[r], n, k;
int solve(int idx) {
if (idx >= n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ret = INT_MAX;
for (int i = 1; i <= k; i++)
if (idx + i <= n)
ret = min(ret, abs(a[idx] - a[idx + i]) + solve(i + idx));
return dp[idx] = ret;
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(0) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int r = 1e5 + 1;
int a[r], dp[r], n, k;
int solve(int idx) {
if (idx >= n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ret = INT_MAX;
for (int i = 1; i <= k; i++)
if (idx + i < n)
ret = min(ret, abs(a[idx] - a[idx + i]) + solve(i + idx));
return dp[idx] = ret;
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
cout << solve(0) << '\n';
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,197 | 962,198 | u173976156 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int H[N];
int dp[N];
const int C = 1000000000;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int temp;
dp[0] = 0;
for (int i = 1; i < min(N - 1, K); i++) {
temp = C;
for (int j = 0; j < i; j++) {
temp = min(temp, dp[j] + abs(H[i] - H[j]));
}
dp[i] = temp; // cout<<dp[i]<<endl;
}
if (N <= K) {
cout << dp[N - 1] << endl;
return 0;
}
for (int i = K; i < N; i++) {
temp = C;
for (int j = 1; j <= K; j++) {
temp = min(temp, dp[i - j] + abs(H[i] - H[i - j]));
}
dp[i] = temp;
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int H[N];
int dp[N];
const int C = 1000000000;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int temp;
dp[0] = 0;
for (int i = 1; i < min(N, K); i++) {
temp = C;
for (int j = 0; j < i; j++) {
temp = min(temp, dp[j] + abs(H[i] - H[j]));
}
dp[i] = temp; // cout<<dp[i]<<endl;
}
if (N <= K) {
cout << dp[N - 1] << endl;
return 0;
}
for (int i = K; i < N; i++) {
temp = C;
for (int j = 1; j <= K; j++) {
temp = min(temp, dp[i - j] + abs(H[i] - H[i - j]));
}
dp[i] = temp;
}
cout << dp[N - 1] << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,201 | 962,202 | u977554186 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long dp[1000007];
const long long inf = 100000000007;
int main() {
long long x, n, k;
cin >> n >> k;
while (n--)
cin >> x, v.push_back(x);
dp[1] = abs(v[1] - v[0]);
for (long long i = 2; i <= k; i++) {
dp[i] = abs(v[i] - v[0]);
for (long long j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
for (long long i = k + 1; i <= v.size(); i++) {
dp[i] = inf;
for (long long j = k; k > 0; k--) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i - j] - v[i]));
}
}
cout << dp[v.size() - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long dp[1000007];
const long long inf = 100000000007;
int main() {
long long x, n, k;
cin >> n >> k;
while (n--)
cin >> x, v.push_back(x);
dp[1] = abs(v[1] - v[0]);
for (long long i = 2; i <= k; i++) {
dp[i] = abs(v[i] - v[0]);
for (long long j = 1; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
for (long long i = k + 1; i <= v.size(); i++) {
dp[i] = inf;
for (long long j = k; j > 0; j--) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i - j] - v[i]));
}
}
cout << dp[v.size() - 1] << endl;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,211 | 962,212 | u622635644 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 0x3f3f3f3f;
int arr[N], dp[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, 0x3f, sizeof dp);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 0x3f3f3f3f;
int arr[N], dp[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, 0x3f, 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], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n] << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 962,213 | 962,214 | u276999104 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define ii pair<ll, ll>
#define vii vector<ii>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
ll modpow(ll base, ll exp, ll modulus) {
base %= modulus;
ll result = 1;
while (exp > 0) {
if (exp & 1)
result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
f(i, 0, n) cin >> a[i];
ll dp[n] = {0};
ll mn;
f(i, 1, n) {
mn = dp[i - 1] + abs(a[i] - a[i - 1]);
for (ll j = i - 1; j >= max(0LL, i - k); i--)
mn = min(mn, dp[j] + abs(a[i] - a[j]));
dp[i] = mn;
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define ii pair<ll, ll>
#define vii vector<ii>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
ll modpow(ll base, ll exp, ll modulus) {
base %= modulus;
ll result = 1;
while (exp > 0) {
if (exp & 1)
result = (result * base) % modulus;
base = (base * base) % modulus;
exp >>= 1;
}
return result;
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
f(i, 0, n) cin >> a[i];
ll dp[n] = {0};
ll mn;
f(i, 1, n) {
mn = dp[i - 1] + abs(a[i] - a[i - 1]);
for (ll j = i - 1; j >= max(0LL, i - k); j--)
mn = min(mn, dp[j] + abs(a[i] - a[j]));
dp[i] = mn;
}
cout << dp[n - 1];
return 0;
}
| [
"identifier.change"
] | 962,217 | 962,218 | u410283759 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define fore(i, ii, iii) for (int i = ii; i < iii; i++)
const int N = 1e5 + 15, INF = 1e9;
int n, k, dp[N], h[N];
int f(int x) {
if (x == 0)
return 0;
if (x == 1)
return abs(h[1] - h[0]);
if (dp[x - 1] >= 0)
return dp[x - 1];
int r = INF;
fore(i, 1, k + 1) r = min(r, f(x - i) + abs(h[x] - h[x - i]));
dp[x - 1] = r;
return dp[x - 1];
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
fore(i, 0, n) { cin >> h[i]; }
memset(dp, -1, sizeof dp);
cout << f(n - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fore(i, ii, iii) for (int i = ii; i < iii; i++)
const int N = 1e5 + 15, INF = 1e9;
int n, k, dp[N], h[N];
int f(int x) {
if (x == 0)
return 0;
if (x < k)
return abs(h[x] - h[0]);
if (dp[x - 1] >= 0)
return dp[x - 1];
int r = INF;
fore(i, 1, k + 1) r = min(r, f(x - i) + abs(h[x] - h[x - i]));
dp[x - 1] = r;
return dp[x - 1];
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
fore(i, 0, n) { cin >> h[i]; }
memset(dp, -1, sizeof dp);
cout << f(n - 1) << endl;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 962,219 | 962,220 | u056052461 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e18;
for (lint i = 1; i <= K; i++) {
if (n - i < 0)
break;
dp[n] = min(dp[n], ans(n - i) + abs(h[n] - h[n - i]));
}
}
return dp[n];
}
int main() {
cin >> N >> K;
for (lint i = 0; i < N; i++)
dp[i] = 1e5;
for (lint i = 0; i < N; i++)
cin >> h[i];
cout << ans(N - 1) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e18;
for (lint i = 1; i <= K; i++) {
if (n - i < 0)
break;
dp[n] = min(dp[n], ans(n - i) + abs(h[n] - h[n - i]));
}
}
return dp[n];
}
int main() {
cin >> N >> K;
for (lint i = 0; i < N; i++)
dp[i] = -1;
for (lint i = 0; i < N; i++)
cin >> h[i];
cout << ans(N - 1) << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 962,224 | 962,225 | u021423660 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e5;
for (int i = 1; i <= K; i++) {
if (n - i < 0)
break;
dp[n] = min(dp[n], ans(n - i) + abs(h[n] - h[n - i]));
}
}
return dp[n];
}
int main() {
cin >> N >> K;
for (lint i = 0; i < N; i++)
dp[i] = -1;
for (lint i = 0; i < N; i++)
cin >> h[i];
cout << ans(N - 1) << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e18;
for (lint i = 1; i <= K; i++) {
if (n - i < 0)
break;
dp[n] = min(dp[n], ans(n - i) + abs(h[n] - h[n - i]));
}
}
return dp[n];
}
int main() {
cin >> N >> K;
for (lint i = 0; i < N; i++)
dp[i] = -1;
for (lint i = 0; i < N; i++)
cin >> h[i];
cout << ans(N - 1) << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 962,226 | 962,225 | u021423660 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
long long n, k, a[100005], dp[100005], Min;
int main() {
cin >> n >> k;
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++) {
Min = 10005;
for (int j = 0; j < i; j++) {
if (i > k && j == 0)
j = i - k;
Min = min(Min, dp[j] + abs(a[i] - a[j]));
}
dp[i] = Min;
}
cout << dp[n - 1];
} | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
long long n, k, a[100005], dp[100005], Min;
int main() {
cin >> n >> k;
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++) {
Min = 2147483647;
for (int j = 0; j < i; j++) {
if (i > k && j == 0)
j = i - k;
Min = min(Min, dp[j] + abs(a[i] - a[j]));
}
dp[i] = Min;
}
cout << dp[n - 1];
} | [
"literal.number.change",
"assignment.value.change"
] | 962,229 | 962,228 | u527057233 | cpp |
p03161 | #include <iostream>
#include <vector>
#define ma 1000000000
int mod(int a) {
if (a >= 0)
return a;
else
return -a;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
b[0] = 0;
b[1] = mod(a[1] - a[0]);
for (int i = 2; i <= k; i++)
b[i] = mod(a[i] - a[0]);
for (int i = k + 1; i < n; i++) {
int t = ma;
for (int k1 = 1; k1 <= k; k1++) {
if (t > b[i - k1] + mod(a[i] - a[i - k1]))
t = b[i - k1] + mod(a[i] - a[i - k1]);
}
b[i] = t;
}
cout << b[n - 1];
}
| #include <iostream>
#include <vector>
#define ma 1000000000
int mod(int a) {
if (a >= 0)
return a;
else
return -a;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
b[0] = 0;
b[1] = mod(a[1] - a[0]);
for (int i = 2; i <= k && i < n; i++)
b[i] = mod(a[i] - a[0]);
for (int i = k + 1; i < n; i++) {
int t = ma;
for (int k1 = 1; k1 <= k; k1++) {
if (t > b[i - k1] + mod(a[i] - a[i - k1]))
t = b[i - k1] + mod(a[i] - a[i - k1]);
}
b[i] = t;
}
cout << b[n - 1];
}
| [
"control_flow.loop.for.condition.change"
] | 962,232 | 962,233 | u784120136 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h[100005], dp[100005], N, K;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int lvl = 2; lvl < N; lvl++) {
dp[lvl] = dp[lvl - 1] + abs(h[lvl] - h[lvl - 1]);
for (int jmp = 2; jmp <= K; jmp++)
dp[lvl] = min(dp[lvl], dp[lvl - jmp] + abs(h[lvl] - h[lvl - jmp]));
}
cout << dp[N - 1] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h[100005], dp[100005], N, K;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int lvl = 2; lvl < N; lvl++) {
dp[lvl] = dp[lvl - 1] + abs(h[lvl] - h[lvl - 1]);
for (int jmp = 2; jmp <= K && jmp <= lvl; jmp++)
dp[lvl] = min(dp[lvl], dp[lvl - jmp] + abs(h[lvl] - h[lvl - jmp]));
}
cout << dp[N - 1] << "\n";
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 962,234 | 962,235 | u297303800 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
const LL MAX = 100005;
const LL INF = 1000 * 1000 * 1000 + 9;
LL n, k, DP[MAX] = {}, stone[MAX] = {};
LL calc(LL idx) {
if (DP[idx] != INF)
return DP[idx];
else if (idx == n - 1)
return DP[idx] = 0;
else if (idx > n - 1)
return INF;
else {
LL MIN = INF;
for (LL i0 = 1; i0 <= k; i0++) {
if (idx + i0 > n - 1)
break;
MIN = min(MIN, calc(DP[idx + i0] + abs(stone[idx + i0] - stone[idx])));
}
return DP[idx] = MIN;
}
}
int main(void) {
cin >> n >> k;
for (LL i0 = 0; i0 < n; i0++) {
cin >> stone[i0];
DP[i0] = INF;
}
cout << calc(0) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
const LL MAX = 100005;
const LL INF = 1000 * 1000 * 1000 + 9;
LL n, k, DP[MAX] = {}, stone[MAX] = {};
LL calc(LL idx) {
if (DP[idx] != INF)
return DP[idx];
else if (idx == n - 1)
return DP[idx] = 0;
else if (idx > n - 1)
return INF;
else {
LL MIN = INF;
for (LL i0 = 1; i0 <= k; i0++) {
if (idx + i0 > n - 1)
break;
MIN = min(MIN, calc(idx + i0) + abs(stone[idx + i0] - stone[idx]));
}
return DP[idx] = MIN;
}
}
int main(void) {
cin >> n >> k;
for (LL i0 = 0; i0 < n; i0++) {
cin >> stone[i0];
DP[i0] = INF;
}
cout << calc(0) << endl;
return 0;
} | [
"expression.operation.binary.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,238 | 962,239 | u562293097 | cpp |
p03161 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147483647
#define lINF 9223372036854775807
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
typedef long long int ll;
ll n, k, h[111111], m[111111];
ll dp(int i) {
if (m[i] != -1)
return m[i];
if (i == n - 1)
return 0;
vector<ll> v;
for (int j = 0; j < k; j++) {
if (i + j + 1 <= n)
v.push_back(dp(i + j + 1) + abs(h[i] - h[i + j + 1]));
}
return m[i] = *min_element(v.begin(), v.end());
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
m[i] = -1;
}
cout << dp(0) << endl;
return 0;
} |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147483647
#define lINF 9223372036854775807
#define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define ARDEB(i, X) cout << #X << "[" << i << "]: " << X[i] << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define ARDEB(i, X) \
{}
#define END \
{}
#endif
typedef long long int ll;
ll n, k, h[111111], m[111111];
ll dp(int i) {
if (m[i] != -1)
return m[i];
if (i == n - 1)
return 0;
vector<ll> v;
for (int j = 0; j < k; j++) {
if (i + j + 1 < n)
v.push_back(dp(i + j + 1) + abs(h[i] - h[i + j + 1]));
}
return m[i] = *min_element(v.begin(), v.end());
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
m[i] = -1;
}
cout << dp(0) << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,240 | 962,241 | u901561754 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
template <typename T> void cmax(T &a, T b) { a = max(a, b); }
template <typename T> void cmin(T &a, T b) { a = min(a, b); }
signed main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 10, INF);
dp[0] = 0;
rep(i, n) loop(j, 1, k + 1) cmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define loop(i, x, n) for (int i = (x); i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
template <typename T> void cmax(T &a, T b) { a = max(a, b); }
template <typename T> void cmin(T &a, T b) { a = min(a, b); }
signed main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 200, INF);
dp[0] = 0;
rep(i, n) loop(j, 1, k + 1) cmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,242 | 962,243 | u093420647 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 120), h(n + 120);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
a[0] = 0;
a[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int m = 10001;
for (int j = 1; j <= k; j++) {
if (i - j < 0) {
break;
}
m = min(m, a[i - j] + abs(h[i] - h[i - j]));
}
// cout << i << " " << m << endl;
a[i] = m;
}
cout << a[n - 1];
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 120), h(n + 120);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
a[0] = 0;
a[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int m = 1e9 + 1;
for (int j = 1; j <= k; j++) {
if (i - j < 0) {
break;
}
m = min(m, a[i - j] + abs(h[i] - h[i - j]));
}
// cout << i << " " << m << endl;
a[i] = m;
}
cout << a[n - 1];
return 0;
} | [
"literal.number.change"
] | 962,244 | 962,245 | u388552482 | cpp |
p03161 | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_limits;
// cout.precision(numeric_limits<double>::digits10 + 1);
const int N = 1e5 + 1;
int n, m, k, p, l, q, r, t, cnt = 1, ans = 1, x, y, c = 0, z;
//---------------------------------------
int a[N];
int32_t main() {
// https://codeforces.com/contest/1099/problem/F
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i <= N; i++)
dp[i] = 1e12;
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j > i)
continue;
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_limits;
// cout.precision(numeric_limits<double>::digits10 + 1);
const int N = 1e5 + 1;
int n, m, k, p, l, q, r, t, cnt = 1, ans = 1, x, y, c = 0, z;
//---------------------------------------
int a[N];
int32_t main() {
// https://codeforces.com/contest/1099/problem/F
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[N];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; i++)
dp[i] = 1e12;
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j > i)
continue;
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
cout << dp[n - 1];
return 0;
} | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,246 | 962,247 | u221357439 | cpp |
p03161 | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_limits;
// cout.precision(numeric_limits<double>::digits10 + 1);
const int N = 1e5 + 1;
int n, m, k, p, l, q, r, t, cnt = 1, ans = 1, x, y, c = 0, z;
//---------------------------------------
int a[N];
int32_t main() {
// https://codeforces.com/contest/1099/problem/F
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i >= N; i++)
dp[i] = 1e12;
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j > i)
continue;
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_limits;
// cout.precision(numeric_limits<double>::digits10 + 1);
const int N = 1e5 + 1;
int n, m, k, p, l, q, r, t, cnt = 1, ans = 1, x, y, c = 0, z;
//---------------------------------------
int a[N];
int32_t main() {
// https://codeforces.com/contest/1099/problem/F
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[N];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; i++)
dp[i] = 1e12;
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j > i)
continue;
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
cout << dp[n - 1];
return 0;
} | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,248 | 962,247 | u221357439 | cpp |
p03161 | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_limits;
// cout.precision(numeric_limits<double>::digits10 + 1);
const int N = 1e5 + 1;
int n, m, k, p, l, q, r, t, cnt = 1, ans = 1, x, y, c = 0, z;
//---------------------------------------
int a[N];
int32_t main() {
// https://codeforces.com/contest/1099/problem/F
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i >= N; i++)
dp[i] = N;
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j > i)
continue;
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_limits;
// cout.precision(numeric_limits<double>::digits10 + 1);
const int N = 1e5 + 1;
int n, m, k, p, l, q, r, t, cnt = 1, ans = 1, x, y, c = 0, z;
//---------------------------------------
int a[N];
int32_t main() {
// https://codeforces.com/contest/1099/problem/F
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[N];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < N; i++)
dp[i] = 1e12;
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j > i)
continue;
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
cout << dp[n - 1];
return 0;
} | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 962,249 | 962,247 | u221357439 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int h[100010];
ll cost[100010];
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++)
cost[i] = 1 << 10;
cost[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i; (i - j <= k) && 0 <= j; j--) {
cost[i] = min(cost[i], cost[j] + abs(h[i] - h[j]));
}
}
cout << cost[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int h[100010];
ll cost[100010];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
cost[i] = 10000000000;
cost[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i; (i - j <= k) && 0 <= j; j--) {
cost[i] = min(cost[i], cost[j] + abs(h[i] - h[j]));
}
}
cout << cost[n - 1] << endl;
}
| [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 962,253 | 962,251 | u898749314 | cpp |
p03161 | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
long long h[(int)1e5 + 5];
long long dp[(int)1e5 + 5];
int main() {
IOS int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
long long mn = LLONG_MAX;
for (int j = i - 1; j >= i - k; j--) {
mn = min(mn, dp[j] + abs(h[i] - h[j]));
}
dp[i] = mn;
}
// for(int i=0; i<n; i++) cout << dp[i] << endl;
cout << dp[n - 1];
return 0;
}
| // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
long long h[(int)1e5 + 5];
long long dp[(int)1e5 + 5];
int main() {
IOS int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
long long mn = LLONG_MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
mn = min(mn, dp[j] + abs(h[i] - h[j]));
}
dp[i] = mn;
}
// for(int i=0; i<n; i++) cout << dp[i] << endl;
cout << dp[n - 1];
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 962,257 | 962,258 | u832023241 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define scan(x) \
do { \
while ((x = getchar()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar()); x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(), a.end()), a.end())
#define all(a) a.begin(), a.end()
#define println printf("\n");
#define readln(x) getline(cin, x);
#define pb push_back
#define endl "\n"
#define MOD 1000000007
#define mp make_pair
#define fastio \
cin.tie(0); \
cin.sync_with_stdio(0);
#define MAXN 100005
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int, int> umii;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> triple;
typedef int8_t byte;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fpow(ll b, ll exp, ll mod) {
if (exp == 0)
return 1;
ll t = fpow(b, exp / 2, mod);
if (exp & 1)
return t * t % mod * b % mod;
return t * t % mod;
}
ll divmod(ll i, ll j, ll mod) {
i %= mod, j %= mod;
return i * fpow(j, mod - 2, mod) % mod;
}
int len, arr[MAXN], K;
ll dp[MAXN];
ll solve(int idx) {
if (idx == 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
ll ans = LONG_MAX;
for (int i = idx - 1; i >= idx - K; i--) {
ll nxt = abs(arr[idx] - arr[i]) + solve(i);
ans = min(ans, nxt);
}
return dp[idx] = ans;
}
int main() {
scanf("%d %d", &len, &K);
for (int i = 1; i <= len; i++)
scanf(" %d", &arr[i]);
memset(dp, -1, sizeof dp);
printf("%lld\n", solve(len));
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define scan(x) \
do { \
while ((x = getchar()) < '0') \
; \
for (x -= '0'; '0' <= (_ = getchar()); x = (x << 3) + (x << 1) + _ - '0') \
; \
} while (0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(), a.end()), a.end())
#define all(a) a.begin(), a.end()
#define println printf("\n");
#define readln(x) getline(cin, x);
#define pb push_back
#define endl "\n"
#define MOD 1000000007
#define mp make_pair
#define fastio \
cin.tie(0); \
cin.sync_with_stdio(0);
#define MAXN 100005
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int, int> umii;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> triple;
typedef int8_t byte;
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll fpow(ll b, ll exp, ll mod) {
if (exp == 0)
return 1;
ll t = fpow(b, exp / 2, mod);
if (exp & 1)
return t * t % mod * b % mod;
return t * t % mod;
}
ll divmod(ll i, ll j, ll mod) {
i %= mod, j %= mod;
return i * fpow(j, mod - 2, mod) % mod;
}
int len, arr[MAXN], K;
ll dp[MAXN];
ll solve(int idx) {
if (idx == 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
ll ans = LONG_MAX;
for (int i = idx - 1; i >= max(1, idx - K); i--) {
ll nxt = abs(arr[idx] - arr[i]) + solve(i);
ans = min(ans, nxt);
}
return dp[idx] = ans;
}
int main() {
scanf("%d %d", &len, &K);
for (int i = 1; i <= len; i++)
scanf(" %d", &arr[i]);
memset(dp, -1, sizeof dp);
printf("%lld\n", solve(len));
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 962,264 | 962,265 | u101231452 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = LLONG_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i; j >= max(i - k, 1LL * 0); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = LLONG_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i; j >= max(i - k, 1LL); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,266 | 962,267 | u400673400 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i; j >= max(i - k, 0); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = LLONG_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i; j >= max(i - k, 1LL); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"litera... | 962,268 | 962,267 | u400673400 | 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 + 1, 10000);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++) {
for (int j = i - 1; j >= 1 && j >= i - k; j--)
dp[i] = min(dp[i], dp[j] + abs(h[i - 1] - h[j - 1]));
}
cout << dp[n];
return 0;
} | #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 + 1, INT_MAX - 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
// vector<int> ans;
for (int i = 3; i <= n; i++) {
for (int j = i - 1; j >= 1 && j >= i - k; j--)
dp[i] = min(dp[i], dp[j] + abs(h[i - 1] - h[j - 1]));
}
cout << dp[n];
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 962,273 | 962,274 | u971084072 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define mp std::make_pair
#define ll long long int
#define abs(n) ((n > 0) ? (n) : ((n) * (-1)))
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
#define VREP(v) \
for (std::vector<ll>::iterator itr = (v).begin(); itr != (v).end(); itr++)
#define VALL(v) ((v).begin(), (v).end())
#define errln(v) cerr << (v) << endl;
#define println(v) cout << (v) << endl;
int main(int argc, const char *argv[]) {
ll N, K, h[100010], dp[100010];
cin >> N >> K;
REP(i, N) cin >> h[i];
const ll INF = 2 << 56;
dp[0] = 0;
for (int i = 1; i < N; ++i) {
dp[i] = INF;
for (int j = 1; j <= K && i - j >= 0; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
println(dp[N - 1]);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define mp std::make_pair
#define ll long long int
#define abs(n) ((n > 0) ? (n) : ((n) * (-1)))
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
#define VREP(v) \
for (std::vector<ll>::iterator itr = (v).begin(); itr != (v).end(); itr++)
#define VALL(v) ((v).begin(), (v).end())
#define errln(v) cerr << (v) << endl;
#define println(v) cout << (v) << endl;
int main(int argc, const char *argv[]) {
ll N, K, h[100010], dp[100010];
cin >> N >> K;
REP(i, N) cin >> h[i];
const ll INF = 100000000000;
dp[0] = 0;
for (int i = 1; i < N; ++i) {
dp[i] = INF;
for (int j = 1; j <= K && i - j >= 0; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
println(dp[N - 1]);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 962,275 | 962,276 | u430966577 | cpp |
p03161 | #include <iostream>
#include <math.h>
using namespace std;
int n, k;
int cache[100000] = {0};
int min_cost(int a[]) {
if (n == 1)
return 0;
cache[n - 1] = 0;
cache[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int min = 100000;
for (int j = 1; j <= k; j++) {
if (i + j <= n - 1) {
long long int y = abs(a[i + j] - a[i]) + cache[i + j];
if (y < min)
min = y;
}
}
// long long int x=abs(a[i+2]-a[i])+cache[i+2];
cache[i] = min;
}
return cache[0];
}
int main() {
cin >> n >> k;
int a[n];
int i = 0;
for (i = 0; i < n; i++)
cin >> a[i];
int x = min_cost(a);
cout << x;
} | #include <iostream>
#include <math.h>
using namespace std;
int n, k;
int cache[100000] = {0};
int min_cost(int a[]) {
if (n == 1)
return 0;
cache[n - 1] = 0;
cache[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--) {
long long int min = 100000000000;
for (int j = 1; j <= k; j++) {
if (i + j <= n - 1) {
long long int y = abs(a[i + j] - a[i]) + cache[i + j];
if (y < min)
min = y;
}
}
// long long int x=abs(a[i+2]-a[i])+cache[i+2];
cache[i] = min;
}
return cache[0];
}
int main() {
cin >> n >> k;
int a[n];
int i = 0;
for (i = 0; i < n; i++)
cin >> a[i];
int x = min_cost(a);
cout << x;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,280 | 962,279 | u958810059 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
typedef pair<ll, ll> LLP;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
#define INF 1000000007
#define MOD 1000000007
#define ARRAY_MAX 100005
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(ARRAY_MAX, 0);
vector<ll> dp(ARRAY_MAX, INF);
REP(i, n) { cin >> a[i + 1]; }
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i <= n; i++) { // k段前から
for (ll j = 1; j <= k; j++) { // j段に行く
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
typedef pair<ll, ll> LLP;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
#define INF 1000000007
#define MOD 1000000007
#define ARRAY_MAX 100005
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(ARRAY_MAX, 0);
vector<ll> dp(ARRAY_MAX, INF);
REP(i, n) { cin >> a[i + 1]; }
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i <= n; i++) { // n段に行く
for (ll j = 1; j <= k; j++) { // k段前から
if (i - j > 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,281 | 962,282 | u504142483 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.