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 <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], cost[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int j = 2; j < N; j++) {
cost[j] = cost[j - 1] + abs(h[j] - h[j - 1]);
for (int k = 2; k <= K; k++) {
if (cost[j] > cost[j - k] + abs(h[j] - h[j - k]))
cost[j] = cost[j - k] + abs(h[j] - h[j - k]);
}
}
cout << cost[N - 1] << endl;
return 0;
} | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], cost[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int j = 2; j < N; j++) {
cost[j] = cost[j - 1] + abs(h[j] - h[j - 1]);
for (int k = 2; k <= min(j, K); k++) {
if (cost[j] > cost[j - k] + abs(h[j] - h[j - k]))
cost[j] = cost[j - k] + abs(h[j] - h[j - k]);
}
}
cout << cost[N - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 958,388 | 958,387 | u214864255 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return (a < b) ? a : b; }
int abso(int a) {
if (a < 0)
return a * (-1);
return a;
}
int main() {
int n, k;
cin >> n >> k;
long long int a[n], b[n];
int mini = 100001;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = mini;
}
b[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(i, k); j++) {
b[i] = min(b[i], b[i - j] + abso(a[i] - a[i - j]));
}
}
cout << b[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return (a < b) ? a : b; }
int abso(int a) {
if (a < 0)
return a * (-1);
return a;
}
int main() {
int n, k;
cin >> n >> k;
long long int a[n], b[n];
unsigned long long int mini = 10000000001;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[i] = mini;
}
b[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(i, k); j++) {
b[i] = min(b[i], b[i - j] + abso(a[i] - a[i - j]));
}
}
cout << b[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 958,389 | 958,390 | u182263149 | cpp |
p03161 | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long int ll;
int main() {
fastio ll n = 0, k = 0;
cin >> n >> k;
ll arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
ll dp[n];
dp[1] = abs(arr[1] - arr[0]);
dp[0] = 0;
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i >= j) {
dp[i] = min(dp[i - k] + abs(arr[i - k] - arr[i]), dp[i]);
} else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
} | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long int ll;
int main() {
fastio int n = 0, k = 0;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[1] = abs(arr[1] - arr[0]);
dp[0] = 0;
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i >= j) {
dp[i] = min(dp[i - j] + abs(arr[i - j] - arr[i]), dp[i]);
} else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.name.change",
"identifier.change",
"variable_declaration.type.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,391 | 958,392 | u487912105 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define M 1000000007
#define pb push_back
#define boost \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define NAYAN \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
int dp[100001];
int a[100001];
int n, k;
int solve(int i) {
if (i == n)
return 0;
if (i > n)
return 9999999999;
if (dp[i] != -1)
return dp[i];
int x, y;
for (int j = 1; j <= k; j++) {
x = min(x, abs(a[i] - a[i + j]) + solve(i + j));
}
dp[i] = x;
return dp[i];
}
signed main() {
boost
//#ifndef ONLINE_JUDGE
// NAYAN
// #endif
// int n;
cin >>
n >> k;
// int a[n];
memset(dp, -1, sizeof(dp));
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = solve(1);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define M 1000000007
#define pb push_back
#define boost \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define NAYAN \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
int dp[100001];
int a[100001];
int n, k;
int solve(int i) {
if (i == n)
return 0;
if (i > n)
return 9999999999;
if (dp[i] != -1)
return dp[i];
int x = 99999999999999, y;
for (int j = 1; j <= k; j++) {
x = min(x, abs(a[i] - a[i + j]) + solve(i + j));
}
dp[i] = x;
return dp[i];
}
signed main() {
boost
//#ifndef ONLINE_JUDGE
// NAYAN
// #endif
// int n;
cin >>
n >> k;
// int a[n];
memset(dp, -1, sizeof(dp));
int i;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
int ans = solve(1);
cout << ans << endl;
}
| [
"variable_declaration.value.change"
] | 958,404 | 958,405 | u371335822 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - k) < 0)
break;
dp[i] = min(dp[i - k] + abs(a[i] - a[i - k]), dp[i]);
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) < 0)
break;
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n - 1];
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,406 | 958,407 | u131496190 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
for (ll i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N);
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ll temp = 999999999;
for (ll j = 1; j <= K; j++)
temp = min(temp, abs(h[i - j] - h[i]) + dp[i - j]);
dp[i] = temp;
}
// for(ll i = 0; i < N-1; i++) {
// cout << dp[i] <<" " ;
// }
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
template <typename T>
bool next_combination(const T first, const T last, int k) {
const T subset = first + k;
// empty container | k = 0 | k == n
if (first == last || first == subset || last == subset) {
return false;
}
T src = subset;
while (first != src) {
src--;
if (*src < *(last - 1)) {
T dest = subset;
while (*src >= *dest) {
dest++;
}
iter_swap(src, dest);
rotate(src + 1, dest + 1, last);
rotate(subset, subset + (last - dest) - 1, last);
return true;
}
}
// restore
rotate(first, subset, last);
return false;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
for (ll i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N);
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ll temp = 999999999;
for (ll j = 1; j <= min(K, i); j++)
temp = min(temp, abs(h[i - j] - h[i]) + dp[i - j]);
dp[i] = temp;
}
// for(ll i = 0; i < N-1; i++) {
// cout << dp[i] <<" " ;
// }
cout << dp[N - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 958,414 | 958,415 | u119477929 | cpp |
p03161 | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end()
#define pb push_back
#define pii pair<int, int>
#define vpii vector<pii>
#define f first
#define db double
#define s second
#define ll long long
#define ull unsigned long long
#define E '\n'
#define lmax 9223372036854775807;
#define MOD 1000000007
using namespace std;
vi v;
vvi ed;
void dfs(int i) {
v[i] = 1;
aut(j, ed[i]) if (!v[j]) dfs(j);
}
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("code.in", "r", stdin);
freopen("code.out", "w", stdout);
#endif
}
int main() {
Fast_IO();
int t;
// cin>>t;
t = 1;
while (t--) {
int n;
cin >> n;
int k;
cin >> k;
vi arr(n);
vi dp(n, 1e9);
dp[0] = 0;
rep(i, n) cin >> arr[i];
forr(i, 1, n) for (int j = i - 1; j >= 0 && i - j <= k; j--) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
cout << dp[n - 1];
cout << E;
}
return 0;
} | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end()
#define pb push_back
#define pii pair<int, int>
#define vpii vector<pii>
#define f first
#define db double
#define s second
#define ll long long
#define ull unsigned long long
#define E '\n'
#define lmax 9223372036854775807;
#define MOD 1000000007
using namespace std;
vi v;
vvi ed;
void dfs(int i) {
v[i] = 1;
aut(j, ed[i]) if (!v[j]) dfs(j);
}
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("code.in", "r", stdin);
freopen("code.out", "w", stdout);
#endif
}
int main() {
// Fast_IO();
int t;
// cin>>t;
t = 1;
while (t--) {
int n;
cin >> n;
int k;
cin >> k;
vi arr(n);
vi dp(n, 1e9);
dp[0] = 0;
rep(i, n) cin >> arr[i];
forr(i, 1, n) for (int j = i - 1; j >= 0 && i - j <= k; j--) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
cout << dp[n - 1];
cout << E;
}
return 0;
} | [
"call.remove"
] | 958,422 | 958,423 | u491084584 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 999999999999;
int main() {
int n, k;
cin >> n >> k;
int a[n + 5];
ll dp[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = maxn;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (abs(a[j] - a[i]) + dp[i] < dp[j])
dp[j] = abs(a[j] - a[i]) + dp[i];
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 9999999999999;
int main() {
int n, k;
cin >> n >> k;
int a[n + 5];
ll dp[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = maxn;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n && abs(a[j] - a[i]) + dp[i] < dp[j])
dp[j] = abs(a[j] - a[i]) + dp[i];
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 958,426 | 958,427 | u795353302 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int DP[100001];
signed main() {
int n, k;
cin >> n >> k;
int H[n + 1];
for (int i = 1; i <= n; i++)
cin >> H[i];
DP[n] = 0;
DP[n - 1] = abs(H[n] - H[n - 1]);
for (int i = n - 2; i >= 1; i--) {
DP[i] = INT_MAX;
int g = i + k;
for (int j = i + 1; j <= g; j++) {
DP[i] = min(DP[i], abs(H[i] - H[j]) + DP[j]);
}
}
cout << DP[1];
return 0;
} | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int DP[100001];
signed main() {
int n, k;
cin >> n >> k;
int H[n + 1];
for (int i = 1; i <= n; i++)
cin >> H[i];
DP[n] = 0;
DP[n - 1] = abs(H[n] - H[n - 1]);
for (int i = n - 2; i >= 1; i--) {
DP[i] = INT_MAX;
int g = min(i + k, n);
for (int j = i + 1; j <= g; j++) {
DP[i] = min(DP[i], abs(H[i] - H[j]) + DP[j]);
}
}
cout << DP[1];
return 0;
} | [
"call.add",
"call.arguments.add"
] | 958,428 | 958,429 | u795378930 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int getMinimumCost(int *arr, int i, int n, int k) {
int cost[n];
cost[0] = 0;
cost[1] = abs(arr[0] - arr[1]) + cost[0];
int minimum;
for (int i = 2; i < n; i++) {
minimum = abs(arr[i - 1] - arr[i]) + cost[i - 1];
for (int j = i - 2; j != -1 && j >= i - k; j--) {
if (minimum > abs(arr[j] - arr[i]) + cost[i]) {
minimum = abs(arr[j] - arr[i]) + cost[i];
}
}
cost[i] = minimum;
}
return cost[n - 1];
}
int main() {
int n, k;
cin >> n;
cin >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << getMinimumCost(arr, 0, n, k) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int getMinimumCost(int *arr, int i, int n, int k) {
int cost[n];
cost[0] = 0;
cost[1] = abs(arr[0] - arr[1]) + cost[0];
int minimum;
for (int i = 2; i < n; i++) {
minimum = abs(arr[i - 1] - arr[i]) + cost[i - 1];
for (int j = i - 2; j != -1 && j >= i - k; j--) {
if (minimum > abs(arr[j] - arr[i]) + cost[j]) {
minimum = abs(arr[j] - arr[i]) + cost[j];
}
}
cost[i] = minimum;
}
return cost[n - 1];
}
int main() {
int n, k;
cin >> n;
cin >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
cout << getMinimumCost(arr, 0, n, k) << endl;
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 958,432 | 958,433 | u102364535 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chkMin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int num;
int k;
cin >> num >> k;
long long dp[num];
long long h[num];
for (int i = 0; i < num; i++)
cin >> h[i];
for (int i = 0; i < num; i++)
dp[i] = 1LL << 60;
dp[0] = 0;
for (int i = 0; i < num; i++) {
for (int j = 1; j <= k; j++) {
chkMin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[num - 1];
}
| #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chkMin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int num;
int k;
cin >> num >> k;
long long dp[num + k];
long long h[num + k];
for (int i = 0; i < num; i++)
cin >> h[i];
for (int i = 0; i < num + k; i++)
dp[i] = 1LL << 60;
dp[0] = 0;
for (int i = 0; i < num; i++) {
for (int j = 1; j <= k; j++) {
chkMin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[num - 1];
}
| [
"control_flow.loop.for.condition.change"
] | 958,442 | 958,443 | u367131219 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long double LD;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 無限大の値
const long long INF = 1LL << 60;
// DP テーブル
long long dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// 初期条件
dp[0] = 0;
// ループ
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
// 解を得て出力
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long double LD;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 無限大の値
const long long INF = 1LL << 60;
// DP テーブル
long long dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// 初期条件
dp[0] = 0;
// ループ
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
// 解を得て出力
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 958,455 | 958,456 | u825601908 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f(i, x, n) \
; \
for (ll i = x; i < n; i++)
int main() {
ll n, k;
cin >> n >> k;
ll H[n];
f(i, 0, n) cin >> H[i];
if (n == 2) {
cout << abs(H[0] - H[1]);
return 0;
}
ll ans[n];
ans[1] = abs(H[1] - H[0]);
ans[0] = 0;
f(i, 2, n) {
ll x = 200005;
ll y;
if (i > k)
y = i - k;
else
y = 0;
while (y < i) {
x = min(x, ans[y] + abs(H[i] - H[y]));
y++;
}
ans[i] = x;
}
cout << ans[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f(i, x, n) \
; \
for (ll i = x; i < n; i++)
int main() {
ll n, k;
cin >> n >> k;
ll H[n];
f(i, 0, n) cin >> H[i];
if (n == 2) {
cout << abs(H[0] - H[1]);
return 0;
}
ll ans[n];
ans[1] = abs(H[1] - H[0]);
ans[0] = 0;
f(i, 2, n) {
ll x = INT_MAX;
ll y;
if (i > k)
y = i - k;
else
y = 0;
while (y < i) {
x = min(x, ans[y] + abs(H[i] - H[y]));
y++;
}
ans[i] = x;
}
cout << ans[n - 1];
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,457 | 958,458 | u097652443 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define vll vector<ll>
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define f(i, n) for (int i = 0; i < n; ++i)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define MAXN 200001
#define umapi unordered_map<int, int>
#define umapll unordered_map<ll, ll>
int add(int a, int b) {
int temp = a + b;
if (temp < 0)
temp = mod + temp;
else if (temp > mod)
temp = temp % mod;
return temp;
}
int mul(int a, int b) {
ll temp = (1ll * a * b);
if (temp < 0)
temp = mod + temp;
else if (temp >= mod)
temp = temp % mod;
return temp;
}
bool perfect(int x) {
if (x < 0)
return false;
if (x == 0)
return true;
int temp = sqrt(x);
return (temp * temp) == x;
}
ll dp[MAXN];
ll cost(int *A, int n, int k, int curr) {
if (dp[curr] != 10000000001)
return dp[curr];
if (curr > n)
return 10000000001;
if (curr == n)
return 0;
dp[curr] = 10000000001;
rep(i, 1, k) dp[curr] =
min(dp[curr], abs(A[curr] - A[curr + i]) + cost(A, n, k, curr + i));
return dp[curr];
}
void solve() {
int n, A[MAXN], k;
cin >> n >> k;
f(i, n) cin >> A[i + 1];
f(i, n) dp[i + 1] = 10000;
dp[1] = 0;
rep(i, 2, n) {
rep(j, 1, k) {
if (i == 2)
dp[i] = abs(A[i] - A[i - 1]) + dp[i - 1];
else if (i - j >= 1)
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
}
// ll ans=cost(A, n, k, 1);
ll ans = dp[n];
printf("%lld\n", ans);
}
void io() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// io();
// int t; cin>>t;
int tc = 0;
// while(t--)
{
tc++;
// printf("Case #%d: ", tc);
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define vll vector<ll>
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define f(i, n) for (int i = 0; i < n; ++i)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define MAXN 200001
#define umapi unordered_map<int, int>
#define umapll unordered_map<ll, ll>
int add(int a, int b) {
int temp = a + b;
if (temp < 0)
temp = mod + temp;
else if (temp > mod)
temp = temp % mod;
return temp;
}
int mul(int a, int b) {
ll temp = (1ll * a * b);
if (temp < 0)
temp = mod + temp;
else if (temp >= mod)
temp = temp % mod;
return temp;
}
bool perfect(int x) {
if (x < 0)
return false;
if (x == 0)
return true;
int temp = sqrt(x);
return (temp * temp) == x;
}
ll dp[MAXN];
ll cost(int *A, int n, int k, int curr) {
if (dp[curr] != 10000000001)
return dp[curr];
if (curr > n)
return 10000000001;
if (curr == n)
return 0;
dp[curr] = 10000000001;
rep(i, 1, k) dp[curr] =
min(dp[curr], abs(A[curr] - A[curr + i]) + cost(A, n, k, curr + i));
return dp[curr];
}
void solve() {
int n, A[MAXN], k;
cin >> n >> k;
f(i, n) cin >> A[i + 1];
f(i, n) dp[i + 1] = 1000000001;
dp[1] = 0;
rep(i, 2, n) {
rep(j, 1, k) {
if (i == 2)
dp[i] = abs(A[i] - A[i - 1]) + dp[i - 1];
else if (i - j >= 1)
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
}
// ll ans=cost(A, n, k, 1);
ll ans = dp[n];
printf("%lld\n", ans);
}
void io() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// io();
// int t; cin>>t;
int tc = 0;
// while(t--)
{
tc++;
// printf("Case #%d: ", tc);
solve();
}
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 958,459 | 958,460 | u741958141 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vp vector<pii>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define ff first
#define ss second
#define sz(x) ((int)(x).size())
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define pi 3.14159265358979323846 // 20 decimals
#define MOD 1000000007
int32_t main() {
IOS int n, k;
cin >> n >> k;
vi h(n);
for (int &x : h) {
cin >> x;
}
vi dp(n, INT_MAX);
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];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vp vector<pii>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define ff first
#define ss second
#define sz(x) ((int)(x).size())
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define pi 3.14159265358979323846 // 20 decimals
#define MOD 1000000007
int32_t main() {
IOS
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n,
k;
cin >> n >> k;
vi h(n);
for (int &x : h) {
cin >> x;
}
vi dp(n, INT_MAX);
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];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,465 | 958,466 | u381652180 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int stone[n];
int cam[n];
for (int i = 0; i < n; i++) {
int a;
cin >> a;
stone[i] = a;
}
cam[0] = 0;
for (int i = 1; i < n; i++) {
int g = 1;
int c2 = 100000;
while (g <= k && i - g >= 0) {
int c1 = abs(stone[i] - stone[i - g]) + cam[i - g];
if (c1 < c2) {
cam[i] = c1;
c2 = c1;
}
g++;
}
}
cout << cam[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int stone[n];
int cam[n];
for (int i = 0; i < n; i++) {
int a;
cin >> a;
stone[i] = a;
}
cam[0] = 0;
for (int i = 1; i < n; i++) {
int g = 1;
int c2 = 1000000000;
while (g <= k && i - g >= 0) {
int c1 = abs(stone[i] - stone[i - g]) + cam[i - g];
if (c1 < c2) {
cam[i] = c1;
c2 = c1;
}
g++;
}
}
cout << cam[n - 1];
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,467 | 958,468 | u318991795 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int n, k, a[100010], dp[100010];
int main() {
scanf("%d%d", &n, &k);
memset(dp, 63, sizeof(dp));
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = max(1, i - k); j <= k; j++)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
printf("%d\n", dp[n]);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int n, k, a[100010], dp[100010];
int main() {
scanf("%d%d", &n, &k);
memset(dp, 63, sizeof(dp));
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
printf("%d\n", dp[n]);
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,469 | 958,470 | u207528513 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(100000);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + k + 1; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(stone[i] - stone[j]));
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(2147483647);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + k + 1; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(stone[i] - stone[j]));
}
}
}
cout << dp[n - 1];
} | [
"literal.number.change",
"call.arguments.change"
] | 958,481 | 958,482 | u136910493 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(10000);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + k + 1; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(stone[i] - stone[j]));
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(2147483647);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + k + 1; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(stone[i] - stone[j]));
}
}
}
cout << dp[n - 1];
} | [
"literal.number.change",
"call.arguments.change"
] | 958,483 | 958,482 | u136910493 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100001> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100001> dp;
dp.fill(10000);
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(stone[i] - stone[j]));
}
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(2147483647);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + k + 1; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(stone[i] - stone[j]));
}
}
}
cout << dp[n - 1];
} | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 958,484 | 958,482 | u136910493 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(1e5 + 1, -1);
dp[0] = 0;
for (int i = 1; i < k; i++) {
dp[i] = abs(a[0] - a[i]);
}
for (int i = k + 1; i < n; i++) {
int c = INF;
for (int j = 1; j <= k; j++) {
int b = dp[i - j] + abs(a[i] - a[i - j]);
c = min(c, b);
}
dp[i] = c;
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(1e5 + 1, -1);
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(a[0] - a[i]);
}
for (int i = k + 1; i < n; i++) {
int c = INF;
for (int j = 1; j <= k; j++) {
int b = dp[i - j] + abs(a[i] - a[i - j]);
c = min(c, b);
}
dp[i] = c;
}
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"
] | 958,489 | 958,490 | u681559222 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(n + 10, -1);
dp[0] = 0;
for (int i = 1; i < k; i++) {
dp[i] = abs(a[0] - a[i]);
}
for (int i = k + 1; i < n; i++) {
int c = INF;
for (int j = 1; j <= k; j++) {
int b = dp[i - j] + abs(a[i] - a[i - j]);
c = min(c, b);
}
dp[i] = c;
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(1e5 + 1, -1);
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(a[0] - a[i]);
}
for (int i = k + 1; i < n; i++) {
int c = INF;
for (int j = 1; j <= k; j++) {
int b = dp[i - j] + abs(a[i] - a[i - j]);
c = min(c, b);
}
dp[i] = c;
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 958,491 | 958,490 | u681559222 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(n, -1);
dp[0] = 0;
for (int i = 1; i < k; i++) {
dp[i] = abs(a[0] - a[i]);
}
for (int i = k + 1; i < n; i++) {
int c = INF;
for (int j = 1; j <= k; j++) {
int b = dp[i - j] + abs(a[i] - a[i - j]);
c = min(c, b);
}
dp[i] = c;
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> dp(1e5 + 1, -1);
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(a[0] - a[i]);
}
for (int i = k + 1; i < n; i++) {
int c = INF;
for (int j = 1; j <= k; j++) {
int b = dp[i - j] + abs(a[i] - a[i - j]);
c = min(c, b);
}
dp[i] = c;
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,492 | 958,490 | u681559222 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define F(i, a, b) for (i = a; i <= b; i++)
#define RF(i, a, b) for (i = a; i >= b; i--)
#define sz(a) sizeof(a)
using namespace std;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef unordered_map<int, int> umii;
typedef unordered_map<char, int> umci;
void solve() {
int n, i, k;
cin >> n;
int *height_arr = new int[sz(int) * n], *sol = new int[sz(int) * n];
F(i, 0, n - 1)
cin >> height_arr[i];
sol[n - 1] = 0;
RF(i, n - 2, 0) {
sol[i] = INT_MAX;
int j;
F(j, i + 1, i + k) {
if (j >= n)
break;
sol[i] = min(abs(height_arr[j] - height_arr[i]) + sol[j], sol[i]);
}
}
cout << sol[0] << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#else
//#endif
solve();
}
| #include <bits/stdc++.h>
#define ll long long
#define F(i, a, b) for (i = a; i <= b; i++)
#define RF(i, a, b) for (i = a; i >= b; i--)
#define sz(a) sizeof(a)
using namespace std;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef unordered_map<int, int> umii;
typedef unordered_map<char, int> umci;
void solve() {
int n, i, k;
cin >> n >> k;
int *height_arr = new int[sz(int) * n], *sol = new int[sz(int) * n];
F(i, 0, n - 1)
cin >> height_arr[i];
sol[n - 1] = 0;
RF(i, n - 2, 0) {
sol[i] = INT_MAX;
int j;
F(j, i + 1, i + k) {
if (j >= n)
break;
sol[i] = min(abs(height_arr[j] - height_arr[i]) + sol[j], sol[i]);
}
}
cout << sol[0] << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
//#else
//#endif
solve();
}
| [
"expression.operation.binary.add"
] | 958,493 | 958,494 | u488674276 | cpp |
p03161 | #pragma GCC optimize( \
"Ofast") // Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(10);
#define randomINIT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define foo(i, a, n) for (ll i = (a); i <= n; i++)
#define frr(i, a, n) for (ll i = (a); i >= n; i--)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const ll MOD = 1e+9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MAXN = 1e+5 + 7;
vll adj[MAXN];
ll visit[MAXN] = {};
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
//<<-----Declare Variable Here------->>//
int t = 1;
ll n, a[100005];
ll dp[100005];
ll k;
//<<-----Implement Functions Here---->>//
ll solve(ll pos) {
if (pos > n)
return 1e+18;
if (pos == n)
return 0;
if (dp[pos] != -1)
return dp[pos];
ll ans = 1e+18;
for (ll i = 1; i <= k; i++) {
ans = min(ans, abs(a[i + pos] - a[pos] + solve(pos + i)));
}
return dp[pos] = ans;
}
//<<-----Start of Main--------------->>//
void MAIN() {
cin >> n >> k;
for (ll i = 0; i <= n; i++)
dp[i] = -1;
for (ll i = 1; i <= n; i++)
cin >> a[i];
cout << solve(1);
}
int main() {
fastio;
randomINIT;
// cin>>t;
while (t--) {
MAIN();
}
} | #pragma GCC optimize( \
"Ofast") // Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(10);
#define randomINIT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define foo(i, a, n) for (ll i = (a); i <= n; i++)
#define frr(i, a, n) for (ll i = (a); i >= n; i--)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const ll MOD = 1e+9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MAXN = 1e+5 + 7;
vll adj[MAXN];
ll visit[MAXN] = {};
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
//<<-----Declare Variable Here------->>//
int t = 1;
ll n, a[100005];
ll dp[100005];
ll k;
//<<-----Implement Functions Here---->>//
ll solve(ll pos) {
if (pos > n)
return 1e+18;
if (pos == n)
return 0;
if (dp[pos] != -1)
return dp[pos];
ll ans = 1e+18;
for (ll i = 1; i <= k; i++) {
ans = min(ans, abs(a[i + pos] - a[pos]) + solve(pos + i));
}
return dp[pos] = ans;
}
//<<-----Start of Main--------------->>//
void MAIN() {
cin >> n >> k;
for (ll i = 0; i <= n; i++)
dp[i] = -1;
for (ll i = 1; i <= n; i++)
cin >> a[i];
cout << solve(1);
}
int main() {
fastio;
randomINIT;
// cin>>t;
while (t--) {
MAIN();
}
} | [
"call.arguments.change"
] | 958,495 | 958,496 | u990746416 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int x = 999;
for (int j = 1; j <= k && i - j >= 0; j++) {
if (x > (b[i - j] + fabs(a[i - j] - a[i])))
x = b[i - j] + fabs(a[i - j] - a[i]);
}
b[i] = x;
}
cout << b[n - 1];
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
long long int x = 1000000000;
for (int j = 1; j <= k && i - j >= 0; j++) {
if (x > (b[i - j] + fabs(a[i - j] - a[i])))
x = b[i - j] + fabs(a[i - j] - a[i]);
}
b[i] = x;
}
cout << b[n - 1];
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,506 | 958,507 | u526313609 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int x = 999;
for (int j = 0; j < k && i - j >= 0; j++) {
if (x > (b[i - j] + fabs(a[i - j] - a[i])))
x = b[i - j] + fabs(a[i - j] - a[i]);
}
b[i] = x;
}
cout << b[n - 1];
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
long long int x = 1000000000;
for (int j = 1; j <= k && i - j >= 0; j++) {
if (x > (b[i - j] + fabs(a[i - j] - a[i])))
x = b[i - j] + fabs(a[i - j] - a[i]);
}
b[i] = x;
}
cout << b[n - 1];
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,508 | 958,507 | u526313609 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i = 2; i < n; i++) {
for (ll j = i - 1; j >= max((ll)0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (i = 2; i < n; i++) {
for (ll j = i - 1; j >= max((ll)0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
}
| [
"call.add",
"call.arguments.change"
] | 958,509 | 958,510 | u990210936 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i = 2; i < n; i++) {
for (ll j = i - 1; j > max((ll)0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (i = 2; i < n; i++) {
for (ll j = i - 1; j >= max((ll)0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
}
| [
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,511 | 958,510 | u990210936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int NMAX = 100000;
int MAX = 10000;
int main() {
int N, K;
cin >> N >> K;
int h[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
h[i] = 0;
for (int i = 1; i <= N; i++)
cin >> h[i];
int dp[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
dp[i] = MAX;
dp[1] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= K; j++) {
if ((i + j) > N)
continue;
dp[i + j] = min(dp[i + j], abs(h[i] - h[i + j]) + dp[i]);
}
}
cout << dp[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int NMAX = 100000;
int MAX = 1000000000;
int main() {
int N, K;
cin >> N >> K;
int h[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
h[i] = 0;
for (int i = 1; i <= N; i++)
cin >> h[i];
int dp[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
dp[i] = MAX;
dp[1] = 0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= K; j++) {
if ((i + j) > N)
continue;
dp[i + j] = min(dp[i + j], abs(h[i] - h[i + j]) + dp[i]);
}
}
cout << dp[N] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 958,512 | 958,513 | u153849197 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl; \
}
#define mdebug(m) \
{ \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
} \
}
#define Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
vec h(N);
REP(i, N) cin >> h[i];
vec DP(110000, INF);
DP[0] = 0;
FOR(i, 1, N) {
FOR(j, 1, K + 1) {
DP[i + j] = min(DP[i + j], DP[i] + abs(h[i] - h[i + j]));
}
}
Out(DP[N - 1]);
} | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)
#define IREP(i, n) IFOR(i, 0, n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL << (n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) \
{ \
cout << #v << "=" << endl; \
REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \
cout << endl; \
}
#define mdebug(m) \
{ \
cout << #m << "=" << endl; \
REP(i_debug, m.size()) { \
REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \
cout << endl; \
} \
}
#define Return(ans) \
{ \
cout << (ans) << endl; \
return 0; \
}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i];
if (i != v.size() - 1)
cout << endl;
};
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
// int dx[4] = {1,0,-1,0};
// int dy[4] = {0,1,0,-1};
// char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
// const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
vec h(N);
REP(i, N) cin >> h[i];
vec DP(110000, INF);
DP[0] = 0;
FOR(i, 0, N) {
FOR(j, 1, K + 1) {
DP[i + j] = min(DP[i + j], DP[i] + abs(h[i] - h[i + j]));
}
}
Out(DP[N - 1]);
} | [
"literal.number.change",
"call.arguments.change"
] | 958,514 | 958,515 | u088608223 | cpp |
p03161 | /********************************************/ /**
****** Author: Shivam Kejriwal
******************
****** Handle: techno_phyle
******************
***********************************************/
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef long long ll;
#define mod 1000000007
#define N 100010
#define M 200010
#define db(a) cout << a << endl
#define db2(a, b) cout << a << " " << b << endl
#define dbp(a) cout << a.first << " " << a.second << endl
#define adb(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl
#define adbp(a) \
for (auto it : a) \
cout << it.first << " " << it.second << endl
#define pb push_back
#define mp make_pair
typedef pair<double, long> key;
struct comp {
bool operator()(pair<int, int> p1, pair<int, int> p2) {
if (p1.first < p2.first)
return false;
if (p2.first < p1.first)
return true;
return p1.second < p2.second;
};
};
// greater<pair<int,int> , greater<int>>
int main() {
fastIO;
//#ifndef ONLINE_JUDGE
// freopen("../input.txt", "r", stdin);
// freopen("../output.txt","w",stdout);
//#endif
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;
for (int i = 2; i <= n; i++)
dp[i] = INT_MAX;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) < 1)
break;
dp[i] = min(dp[i], abs(a[i] - a[i - k]) + dp[i - k]);
}
}
cout << dp[n] << endl;
return 0;
}
| /********************************************/ /**
****** Author: Shivam Kejriwal
******************
****** Handle: techno_phyle
******************
***********************************************/
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
typedef long long ll;
#define mod 1000000007
#define N 100010
#define M 200010
#define db(a) cout << a << endl
#define db2(a, b) cout << a << " " << b << endl
#define dbp(a) cout << a.first << " " << a.second << endl
#define adb(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl
#define adbp(a) \
for (auto it : a) \
cout << it.first << " " << it.second << endl
#define pb push_back
#define mp make_pair
typedef pair<double, long> key;
struct comp {
bool operator()(pair<int, int> p1, pair<int, int> p2) {
if (p1.first < p2.first)
return false;
if (p2.first < p1.first)
return true;
return p1.second < p2.second;
};
};
// greater<pair<int,int> , greater<int>>
int main() {
fastIO;
//#ifndef ONLINE_JUDGE
// freopen("../input.txt", "r", stdin);
// freopen("../output.txt","w",stdout);
//#endif
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;
for (int i = 2; i <= n; i++)
dp[i] = INT_MAX;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) < 1)
break;
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
}
cout << dp[n] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 958,518 | 958,519 | u790460842 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const int MSIZE = 2e5 + 5;
const int MOD = 1e9 + 7;
int arr[MSIZE];
int dp[MSIZE];
int main() {
FIO int n, k;
cin >> n >> k;
f(i, 0, n - 1) cin >> arr[i];
dp[0] = 0;
f(i, 1, n - 1) {
dp[i] = 1e9 + 7;
fr(j, i - 2, max(i - k, 0)) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const int MSIZE = 2e5 + 5;
const int MOD = 1e9 + 7;
int arr[MSIZE];
int dp[MSIZE];
int main() {
FIO int n, k;
cin >> n >> k;
f(i, 0, n - 1) cin >> arr[i];
dp[0] = 0;
f(i, 1, n - 1) {
dp[i] = 1e9 + 7;
fr(j, i - 1, max(i - k, 0)) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,522 | 958,523 | u850655153 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const int MSIZE = 2e5 + 5;
const int MOD = 1e9 + 7;
int arr[MSIZE];
int dp[MSIZE];
int main() {
FIO int n, k;
cin >> n >> k;
f(i, 0, n - 1) cin >> arr[i];
dp[0] = 0;
f(i, 1, n - 1) {
dp[i] = 1e5;
fr(j, i - 1, max(i - k, 0)) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const int MSIZE = 2e5 + 5;
const int MOD = 1e9 + 7;
int arr[MSIZE];
int dp[MSIZE];
int main() {
FIO int n, k;
cin >> n >> k;
f(i, 0, n - 1) cin >> arr[i];
dp[0] = 0;
f(i, 1, n - 1) {
dp[i] = 1e9 + 7;
fr(j, i - 1, max(i - k, 0)) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 958,524 | 958,523 | u850655153 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define ma 1e18
int main() {
lli n, i, j, k;
lli dp[100001];
for (i = 3; i <= 100000; i++) {
dp[i] = ma;
}
dp[0] = 0;
dp[1] = 0;
cin >> n >> k;
lli a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
for (j = i - 1; j >= 0 && j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
}
cout << dp[n] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define ma 1e18
int main() {
lli n, i, j, k;
lli dp[100001];
for (i = 3; i <= 100000; i++) {
dp[i] = ma;
}
dp[0] = 0;
dp[1] = 0;
cin >> n >> k;
lli a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
for (j = i - 1; j >= 1 && j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
}
cout << dp[n] << "\n";
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,525 | 958,526 | u696946433 | cpp |
p03161 | // B.cpp
// Date: 24:01:17 19 05 2020
// Author: bonelord
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << "[(" << __LINE__ << ") " << #x << " ]: " << x << "\n"
#define dbg_arr(x, sz) \
cerr << "[(" << __LINE__ << ") |" << sz << "| " << #x << " ]:\n"; \
for (size_t i = 0; i < sz; ++i) { \
cerr << "[" << i << "] " << x[i] << " "; \
} \
cerr << endl
void solve() {
int N, K;
cin >> N >> K;
vector<int> h(N + 1);
h[0] = 0;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
vector<int> dp(N + 1, 1e9 + 7);
dp[0] = dp[1] = 0;
for (int i = 2; i <= N; ++i) {
for (int j = 1; j <= K && j <= i; ++j) {
dp[i] = min(dp[i - j] + abs(h[i - j] - h[i]), dp[i]);
}
}
cout << dp[N] << "\n";
}
main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios::fixed);
// int t; cin>>t; while (t--)
solve();
}
| // B.cpp
// Date: 24:01:17 19 05 2020
// Author: bonelord
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << "[(" << __LINE__ << ") " << #x << " ]: " << x << "\n"
#define dbg_arr(x, sz) \
cerr << "[(" << __LINE__ << ") |" << sz << "| " << #x << " ]:\n"; \
for (size_t i = 0; i < sz; ++i) { \
cerr << "[" << i << "] " << x[i] << " "; \
} \
cerr << endl
void solve() {
int N, K;
cin >> N >> K;
vector<int> h(N + 1);
h[0] = 0;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
vector<int> dp(N + 1, 1e9 + 7);
dp[0] = dp[1] = 0;
for (int i = 2; i <= N; ++i) {
for (int j = 1; j <= K && j < i; ++j) {
dp[i] = min(dp[i - j] + abs(h[i - j] - h[i]), dp[i]);
}
}
cout << dp[N] << "\n";
}
main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.setf(ios::fixed);
// int t; cin>>t; while (t--)
solve();
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,527 | 958,528 | u169961099 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long int dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + 1]));
}
}
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 int dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,531 | 958,532 | u043951827 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + 1]));
}
}
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 int dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
| [
"expression.operation.binary.remove",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,533 | 958,532 | u043951827 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(k, i - 1); j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[j]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(k, i - 1); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
} | [] | 958,534 | 958,535 | u130433563 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(k, i - 1); j++)
dp[i] = min(dp[i], dp[i - k] + abs(h[i] - h[k]));
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(k, i - 1); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,536 | 958,535 | u130433563 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
int solve(vector<int> ar, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = inf;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(ar[i] - ar[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
std::vector<int> ar(n + 1);
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
cout << solve(ar, n, k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
int solve(vector<int> ar, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = inf;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(ar[i] - ar[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
std::vector<int> ar(n + 1);
for (int i = 1; i <= n; i++) {
cin >> ar[i];
}
cout << solve(ar, n, k);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,541 | 958,542 | u581270308 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
dp[i] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
}
| [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 958,547 | 958,548 | u306697932 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, *p, *dp;
cin >> n;
cin >> k;
p = new long long[n];
for (long long y = 0; y < n; y++) {
cin >> p[y];
}
dp = new long long[n];
dp[0] = 0;
dp[1] = abs(p[1] - p[0]);
for (long long i = 2; i < n; i++) {
long long minimo = dp[i - 1] + abs(p[i] - p[i - 1]);
for (long long t = 1; t < min(k, n - 1); t++) {
minimo = min(minimo, dp[i - (t + 1)] + abs(p[i] - p[i - (t + 1)]));
}
dp[i] = minimo;
}
cout << dp[n - 1];
delete[] p;
delete[] dp;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, *p, *dp;
cin >> n;
cin >> k;
p = new long long[n];
for (long long y = 0; y < n; y++) {
cin >> p[y];
}
dp = new long long[n];
dp[0] = 0;
dp[1] = abs(p[1] - p[0]);
for (long long i = 2; i < n; i++) {
long long minimo = dp[i - 1] + abs(p[i] - p[i - 1]);
for (long long t = 1; t < min(i, k); t++) {
minimo = min(minimo, dp[i - (t + 1)] + abs(p[i] - p[i - (t + 1)]));
}
dp[i] = minimo;
}
cout << dp[n - 1];
delete[] p;
delete[] dp;
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 958,551 | 958,552 | u341690718 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define i_os \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define INF (ll)1e18 + 100
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define MAX 1e6
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define o_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setll \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
int main() {
ll n, k;
cin >> n >> k;
ll arr[n + 1];
arr[0] = 0;
REP(i, 1, n + 1) cin >> arr[i];
ll dp[n + 1];
REP(i, 1, n + 1) dp[i] = 1e12;
dp[0] = 0;
dp[1] = 0;
REP(i, 2, n + 1) {
REP(j, 1, k + 1) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
// REP(i,1,n+1) cout<<dp[i]<<" ";
// cout<<endl;
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define i_os \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define INF (ll)1e18 + 100
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define MAX 1e6
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define o_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setll \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
typedef tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
int main() {
ll n, k;
cin >> n >> k;
ll arr[n + 1];
arr[0] = 0;
REP(i, 1, n + 1) cin >> arr[i];
ll dp[n + 1];
REP(i, 1, n + 1) dp[i] = 1e12;
dp[0] = 0;
dp[1] = 0;
REP(i, 2, n + 1) {
REP(j, 1, k + 1) {
if (i - j <= 0)
break;
else
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
// REP(i,1,n+1) cout<<dp[i]<<" ";
// cout<<endl;
cout << dp[n] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 958,557 | 958,558 | u785364941 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + abs(h[i - 1] - h[i]);
for (int j = 2; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[n] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + abs(h[i - 1] - h[i]);
for (int j = 2; j <= k; j++) {
if (i - j <= 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[n] << "\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,563 | 958,564 | u040996097 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, l, i, k, res;
long long dp[100009];
long long a[100009];
long long f(int x) {
if (x == 0)
return 0;
if (dp[x] != LONG_MAX)
return dp[x];
for (int j = 1; j <= k && x - j >= 0; j++)
dp[x] = min(abs(a[x] - a[x - j]) + f(x - j), dp[x]);
return dp[x];
}
int main() {
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < 100; i++)
dp[i] = LONG_MAX;
cout << f(n - 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, l, i, k, res;
long long dp[100009];
long long a[100009];
long long f(int x) {
if (x == 0)
return 0;
if (dp[x] != LONG_MAX)
return dp[x];
for (int j = 1; j <= k && x - j >= 0; j++)
dp[x] = min(abs(a[x] - a[x - j]) + f(x - j), dp[x]);
return dp[x];
}
int main() {
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < 100009; i++)
dp[i] = LONG_MAX;
cout << f(n - 1) << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,576 | 958,577 | u107882959 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int minn = 1001001001;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 1) {
minn = min(minn, dp[i - j] + abs(h[i - j] - h[i]));
}
}
dp[i] = minn;
}
// rep(i, n) cout << dp[i] << " ";
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int minn = 1001001001;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
minn = min(minn, dp[i - j] + abs(h[i - j] - h[i]));
}
}
dp[i] = minn;
}
// rep(i, n) cout << dp[i] << " ";
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,580 | 958,581 | u416458858 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT32_MAX), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < k; i++) {
for (int j = 0; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
for (int i = k; i < n; i++) {
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - k + j] + abs(h[i] - h[i - k + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT32_MAX), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < k && i < n; i++) {
for (int j = 0; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
for (int i = k; i < n; i++) {
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - k + j] + abs(h[i] - h[i - k + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 958,697 | 958,698 | u530350853 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 3; i <= n; i++)
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 958,703 | 958,704 | u422780284 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 3; i <= n; i++)
for (int j = max(0, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 958,705 | 958,704 | u422780284 | cpp |
p03161 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
void memset(ll *arr, int n, ll value) {
for (int i = 0; i < n; i++) {
arr[i] = value;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
int *arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll *dp = new ll[n];
memset(dp, n, 99999);
/* for(int i= 0; i<k ; i++)
{
dp[i] = abs(arr[i] - arr[0]) ;
}
for(int i= k; i< n ; i++)
{
for(int j=i-1 ; j>=i-k ; j--)
{
dp[i] = min(dp[i] , dp[j] + abs(arr[i] - arr[j])) ;
}
}*/
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(arr[i] - arr[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
void memset(ll *arr, int n, ll value) {
for (int i = 0; i < n; i++) {
arr[i] = value;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
int *arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll *dp = new ll[n];
memset(dp, n, 1e9 + 5);
/* for(int i= 0; i<k ; i++)
{
dp[i] = abs(arr[i] - arr[0]) ;
}
for(int i= k; i< n ; i++)
{
for(int j=i-1 ; j>=i-k ; j--)
{
dp[i] = min(dp[i] , dp[j] + abs(arr[i] - arr[j])) ;
}
}*/
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(arr[i] - arr[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 958,708 | 958,709 | u578632265 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int high[MAXN];
int dp[MAXN]; //跳到石头编号为i的最小花费
int n, k;
int main() {
cin >> n >> k;
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> high[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(high[i - 1] - high[i]);
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(high[i - j] - high[i]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int high[MAXN];
int dp[MAXN]; //跳到石头编号为i的最小花费
int n, k;
int main() {
cin >> n >> k;
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> high[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(high[i - 1] - high[i]);
for (int j = 1; j <= k && j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(high[i - j] - high[i]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 958,717 | 958,718 | u937152385 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
int dp[n];
for (i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - i; j >= max(i - k, 0); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
int dp[n];
for (i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - 1; j >= max(i - k, 0); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
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"
] | 958,721 | 958,722 | u614629416 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = 1e5 + 1;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n - 1] << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = 1e16 + 1;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n - 1] << "\n";
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 958,725 | 958,726 | u074479727 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n, k;
cin >> n >> k;
ll int a[n];
for (ll int i = 0; i < n; i++)
cin >> a[i];
ll int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
if (n > 1)
dp[1] = abs(a[1] - a[0]);
// cout<<dp[1]<<endl;
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(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n, k;
cin >> n >> k;
ll int a[n];
for (ll int i = 0; i < n; i++)
cin >> a[i];
ll int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
if (n > 1)
dp[1] = abs(a[1] - a[0]);
// cout<<dp[1]<<endl;
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(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,734 | 958,735 | u322729493 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define MOD 1e9 + 7;
using ll = long long;
using namespace std;
int h[100010];
int dp[100010] = {0};
int main() {
int N, K;
cin >> N >> K;
rep1(i, N) cin >> h[i];
rep1(i, N) {
if (i == 1)
dp[i] = 0;
else {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= K && i - j >= 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[N];
cout << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define MOD 1e9 + 7;
using ll = long long;
using namespace std;
int h[100010];
int dp[100010] = {0};
int main() {
int N, K;
cin >> N >> K;
rep1(i, N) cin >> h[i];
rep1(i, N) {
if (i == 1)
dp[i] = 0;
else {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= K && i - j >= 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[N];
cout << "\n";
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,740 | 958,741 | u099619676 | cpp |
p03161 | /*.....Bismillahir Rahmanir Rahim.....*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pii pair<int, int>
using namespace std;
int dp[100005], a[100005];
void solve() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0, dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
// cout << i<< " = ";
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = i - 2, ii = 1; ii < k and j > 0; j--, ii++) {
// cout <<j<<" ";
int h = dp[i - j] + abs(a[i] - a[j]);
// cout << h << " ";
dp[i] = min(dp[i], h);
}
/*cout << endl ;
for (int j=1;j<=i;j++) cout << dp[j]<<" ";
cout << endl ; */
}
cout << dp[n] << endl;
}
signed main() {
solve();
return 0;
}
/*
4 2
10 30 40 20
output: 30
10 4
40 10 20 70 80 10 20 70 80 60
output: 40
*/
| /*.....Bismillahir Rahmanir Rahim.....*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pii pair<int, int>
using namespace std;
int dp[100005], a[100005];
void solve() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0, dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
// cout << i<< " = ";
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = i - 2, ii = 1; ii < k and j > 0; j--, ii++) {
// cout <<j<<" ";
int h = dp[j] + abs(a[i] - a[j]);
// cout << h << " ";
dp[i] = min(dp[i], h);
}
/*cout << endl ;
for (int j=1;j<=i;j++) cout << dp[j]<<" ";
cout << endl ; */
}
cout << dp[n] << endl;
}
signed main() {
solve();
return 0;
}
/*
4 2
10 30 40 20
output: 30
10 4
40 10 20 70 80 10 20 70 80 60
output: 40
*/
| [
"expression.operation.binary.remove"
] | 958,744 | 958,745 | u931901821 | cpp |
p03161 | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s, e) (s + (e - s) / 2)
#define clz(n) __builtin_clzll(n))
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
template <typename T> void printVec(const T &v, char sep = ' ') {
for (auto &i : v)
cout << i << sep;
}
template <typename T> void printVecPair(const T &v, char sep = ' ') {
for (auto &i : v)
cout << i.first << " " << i.second << sep;
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vi h(n);
vll dp(n + 1, 0x3F);
for (int &t : h)
cin >> t;
debug(h);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1];
return 0;
}
| /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s, e) (s + (e - s) / 2)
#define clz(n) __builtin_clzll(n))
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
template <typename T> void printVec(const T &v, char sep = ' ') {
for (auto &i : v)
cout << i << sep;
}
template <typename T> void printVecPair(const T &v, char sep = ' ') {
for (auto &i : v)
cout << i.first << " " << i.second << sep;
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vi h(n);
vll dp(n + 1, MAX);
for (int &t : h)
cin >> t;
debug(h);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 958,746 | 958,747 | u288568295 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ma 100000
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> ans(n, ma);
ans[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= k; j++) {
if (i + j >= n)
break;
ans[i + j] = min(ans[i + j], abs(h[i] - h[i + j]) + ans[i]);
}
}
cout << ans[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ma 1e9
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> ans(n, ma);
ans[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= k; j++) {
if (i + j == n)
break;
ans[i + j] = min(ans[i + j], abs(h[i] - h[i + j]) + ans[i]);
}
}
cout << ans[n - 1] << endl;
} | [
"preprocessor.define.value.change",
"literal.float.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,748 | 958,749 | u298291365 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int const inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> const w = [&] {
vector<int> w(n);
for (auto &i : w) {
cin >> i;
}
return w;
}();
auto cost = [&](int i, int j) { return abs(w[i] - w[j]); };
vector<int> dp(n, inf);
dp[n - 1] = 0;
for (int i = n - 3; i >= 0; i--) {
for (int j = i + 1; j < min(i + k + 1, n); j++) {
dp[i] = min(dp[i], dp[j] + cost(i, j));
}
}
cout << dp[0] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int const inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> const w = [&] {
vector<int> w(n);
for (auto &i : w) {
cin >> i;
}
return w;
}();
auto cost = [&](int i, int j) { return abs(w[i] - w[j]); };
vector<int> dp(n, inf);
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
for (int j = i + 1; j < min(i + k + 1, n); j++) {
dp[i] = min(dp[i], dp[j] + cost(i, j));
}
}
cout << dp[0] << "\n";
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,774 | 958,775 | u857390364 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int dp[n + 1];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT_MAX;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
if (i - k >= 0)
dp[i] = min(dp[i], dp[i - k] + abs(arr[i] - arr[i - k]));
}
}
cout << dp[n - 1] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int dp[n + 1];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT_MAX;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1] << "\n";
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condit... | 958,793 | 958,794 | u527398664 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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;
for (int i = 2; i <= n; i++) {
dp[i] = 1e7;
for (int j = i - 1; j >= max(0ll, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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;
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(a[j] - a[i]));
}
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,797 | 958,796 | u862953056 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
ll h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
return 0;
if (n == 1)
return 0;
if (dp[n] != -1)
return dp[n];
ll ans = INT_MAX / 10;
for (int i = 1; i <= k; i++)
if (n >= i)
ans = min(ans, getAns(n - i) + abs(h[n] - h[n - i]));
// cout << ans << endl;
return dp[n] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i], dp[i] = -1;
cout << getAns(n) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
ll h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
return 0;
if (n == 1)
return 0;
if (dp[n] != -1)
return dp[n];
ll ans = INT_MAX;
for (int i = 1; i <= k; i++)
if (n > i)
ans = min(ans, getAns(n - i) + abs(h[n] - h[n - i]));
// cout << ans << endl;
return dp[n] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i], dp[i] = -1;
cout << getAns(n) << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,812 | 958,813 | u800717823 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
int h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
return 0;
if (n == 1)
return 0;
if (dp[n] != -1)
return dp[n];
ll ans = INT_MAX;
for (int i = 1; i <= k; i++)
if (n >= i)
ans = min(ans, getAns(n - i) + abs(h[n] - h[n - i]));
// cout << ans << endl;
return dp[n] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i], dp[i] = -1;
cout << getAns(n) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
ll h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
return 0;
if (n == 1)
return 0;
if (dp[n] != -1)
return dp[n];
ll ans = INT_MAX;
for (int i = 1; i <= k; i++)
if (n > i)
ans = min(ans, getAns(n - i) + abs(h[n] - h[n - i]));
// cout << ans << endl;
return dp[n] = ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i], dp[i] = -1;
cout << getAns(n) << endl;
return 0;
}
| [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,814 | 958,813 | u800717823 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int32_t main() {
fastio
int n,
k;
cin >> n >> k;
int dp[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[n - 1] = 0;
if (n - 2 >= 0)
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--)
for (int j = i + 1; j < min(n, i + k + 1); j++)
dp[i] = min(abs(a[i] - a[i + j]) + dp[i + j], dp[i]);
cout << dp[0];
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int32_t main() {
fastio
int n,
k;
cin >> n >> k;
int dp[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[n - 1] = 0;
if (n - 2 >= 0)
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--)
for (int j = i + 1; j < min(n, i + k + 1); j++)
dp[i] = min(abs(a[i] - a[j]) + dp[j], dp[i]);
cout << dp[0];
return 0;
} | [
"expression.operation.binary.remove"
] | 958,829 | 958,830 | u533654879 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
// ll dp[100001];
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
int dp[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
// dp[i]=-1;
}
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int t = k;
if (t >= i)
t = i - 1;
int p = INT_MAX;
for (int j = 1; j <= t; j++) {
p = min(p, abs(a[i] - a[i - t]) + dp[i - t]);
}
dp[i] = p;
}
cout << dp[n];
}
| #include <bits/stdc++.h>
#define ll long long int
using namespace std;
// ll dp[100001];
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
ll dp[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
// dp[i]=-1;
}
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int t = k;
if (t >= i)
t = i - 1;
ll p = INT_MAX;
for (int j = 1; j <= t; j++) {
p = min(p, abs(a[i] - a[i - j]) + dp[i - j]);
}
dp[i] = p;
}
cout << dp[n];
}
| [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 958,835 | 958,834 | u539406723 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int minCost(vector<int> &heights, int k) {
int n = heights.size();
vector<int> dp(n, 1e9 + 5);
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], abs(heights[i] - heights[j]) + dp[i]);
}
}
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> heights(n);
for (int i = 0; i < n; i++)
cin >> heights[i];
cout << minCost(heights, k) << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int minCost(vector<int> &heights, int k) {
int n = heights.size();
vector<int> dp(n, 1e9 + 5);
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], abs(heights[i] - heights[j]) + dp[i]);
}
}
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> heights(n);
for (int i = 0; i < n; i++)
cin >> heights[i];
cout << minCost(heights, k) << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,841 | 958,842 | u638254110 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++) {
cin >> heights[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < K; j++) {
if (j < N) {
dp[j] = min(dp[j], abs(heights[i] - heights[j]) + dp[i]);
}
}
}
cout << dp[N - 1] << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++) {
cin >> heights[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], abs(heights[i] - heights[j]) + dp[i]);
}
}
}
cout << dp[N - 1] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,843 | 958,844 | u638254110 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != -1) {
return cost[n];
} else if (k == 1) {
cost[n] = solve(n - 1) + abs(a[n] - a[n - 1]);
return cost[n];
} else if (n <= k) {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= 0; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
} else {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= n - k; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
}
}
int main() {
long long i;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> a[i];
cost[i] = -1;
}
cout << solve(n);
}
| #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != -1) {
return cost[n];
} else if (k == 1) {
cost[n] = solve(n - 1) + abs(a[n] - a[n - 1]);
return cost[n];
} else if (n <= k) {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= 1; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
} else {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= n - k; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
}
}
int main() {
long long i;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> a[i];
cost[i] = -1;
}
cout << solve(n);
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,847 | 958,848 | u212696921 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != 9223372036854775807) {
return cost[n];
} else if (k == 1) {
cost[n] = solve(n - 1) + abs(a[n] - a[n - 1]);
return cost[n];
} else if (n <= k) {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= 0; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
} else {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= n - k; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
}
}
int main() {
long long i;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> a[i];
cost[i] = 9223372036854775807;
}
cout << solve(n);
}
| #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != -1) {
return cost[n];
} else if (k == 1) {
cost[n] = solve(n - 1) + abs(a[n] - a[n - 1]);
return cost[n];
} else if (n <= k) {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= 1; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
} else {
cost[n] = 9223372036854775807;
for (i = n - 1; i >= n - k; i--) {
cost[n] = min(solve(i) + abs(a[n] - a[i]), cost[n]);
}
return cost[n];
}
}
int main() {
long long i;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> a[i];
cost[i] = -1;
}
cout << solve(n);
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 958,849 | 958,848 | u212696921 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (int j = 1; j <= k && (i - 1) > j; j++) {
temp = min(temp, dp[i - j] + abs(arr[i - 1] - arr[i - 1 - j]));
}
dp[i] = temp;
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (int j = 1; j <= k && (i) > j; j++) {
temp = min(temp, dp[i - j] + abs(arr[i - 1] - arr[i - 1 - j]));
}
dp[i] = temp;
}
cout << dp[n];
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,852 | 958,853 | u456352227 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (int j = 1; j <= k; j++) {
temp = min(temp, dp[i - j] + abs(arr[i - 1] - arr[i - 1 - j]));
}
dp[i] = temp;
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (int j = 1; j <= k && (i) > j; j++) {
temp = min(temp, dp[i - j] + abs(arr[i - 1] - arr[i - 1 - j]));
}
dp[i] = temp;
}
cout << dp[n];
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 958,854 | 958,853 | u456352227 | cpp |
p03161 |
#include <iostream>
#define INT_MX 20000
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int heights[n], dp[n];
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[n - 1] = 0;
dp[n - 2] = abs(heights[n - 2] - heights[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MX;
for (int j = k; j > 0; j--) {
if (i + j < n)
dp[i] = min(dp[i], abs(heights[i + j] - heights[i]) + dp[i + j]);
}
}
cout << dp[0];
return 0;
} | #include <iostream>
#define INT_MX 2147483646
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int heights[n], dp[n];
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[n - 1] = 0;
dp[n - 2] = abs(heights[n - 2] - heights[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MX;
for (int j = k; j > 0; j--) {
if (i + j < n)
dp[i] = min(dp[i], abs(heights[i + j] - heights[i]) + dp[i + j]);
}
}
cout << dp[0];
return 0;
}
| [
"preprocessor.define.value.change",
"literal.integer.change"
] | 958,855 | 958,856 | u658659166 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, begin, end) for (int i = begin; i < (end); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int dp[100005];
rep(i, 2, n) {
int diff = abs(a[i] - a[i - 1]);
dp[i] = dp[i - 1] + diff;
rep(j, 2, k + 1) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, begin, end) for (int i = begin; i < (end); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int dp[100005];
rep(i, 1, n) {
int diff = abs(a[i] - a[i - 1]);
dp[i] = dp[i - 1] + diff;
rep(j, 2, k + 1) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 958,862 | 958,863 | u259578308 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, k;
cin >> n >> k;
long long h[n + 1], dp[n + 1] = {0}, j;
h[0] = 0;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i == 2)
dp[2] = abs(h[i] - h[i - 1]) + dp[i - 1];
else {
long long ans = INT_MAX;
for (j = 1; j <= k; j++) {
if (i - j >= 0)
ans = min(ans, abs(h[i] - h[i - j]) + dp[i - j]);
}
dp[i] = ans;
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, k;
cin >> n >> k;
long long h[n + 1], dp[n + 1] = {0}, j;
h[0] = 0;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i == 2)
dp[2] = abs(h[i] - h[i - 1]) + dp[i - 1];
else {
long long ans = INT_MAX;
for (j = 1; j <= k; j++) {
if (i - j > 0)
ans = min(ans, abs(h[i] - h[i - j]) + dp[i - j]);
}
dp[i] = ans;
}
}
cout << dp[n] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,872 | 958,873 | u519412059 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int go(int *a, int n, int k, int *output) {
if (n <= 1)
return 0;
if (output[n - 1] != -1)
return output[n - 1];
int i = 1;
int mn = INT_MAX;
for (int i = 1; i <= k; i++) {
int value = abs(a[0] - a[i]);
int ans = go(a + i, n - i, k, output);
mn = min(ans + value, mn);
}
output[n - 1] = mn;
return mn;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n;
cin >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int output[n];
for (int i = 0; i < n; i++)
output[i] = -1;
int ans = go(a, n, k, output);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int go(int *a, int n, int k, int *output) {
if (n <= 1)
return 0;
if (output[n - 1] != -1)
return output[n - 1];
int i = 1;
int mn = INT_MAX;
for (i = 1; i <= k && i < n; i++) {
int value = abs(a[0] - a[i]);
int ans = go(a + i, n - i, k, output);
mn = min(ans + value, mn);
}
output[n - 1] = mn;
return mn;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n;
cin >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int output[n];
for (int i = 0; i < n; i++)
output[i] = -1;
int ans = go(a, n, k, output);
cout << ans << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 958,878 | 958,879 | u774784826 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
// dp [i] denotes the cost to reach step i.
dp[1] = 0;
for (int i = 2; i <= k + 1; i++)
dp[i] = abs(h[i] - h[1]);
for (int i = k + 2; i <= n; i++) {
int min = INT_MAX;
for (int j = i - 1; j >= i - k; j--) {
if ((abs(h[i] - h[j]) + dp[j]) < min)
min = abs(h[i] - h[j]) + dp[j];
}
dp[i] = min;
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
// dp [i] denotes the cost to reach step i.
dp[1] = 0;
for (int i = 2; i <= min(k + 1, n); i++)
dp[i] = abs(h[i] - h[1]);
for (int i = k + 2; i <= n; i++) {
int min = INT_MAX;
for (int j = i - 1; j >= i - k; j--) {
if ((abs(h[i] - h[j]) + dp[j]) < min)
min = abs(h[i] - h[j]) + dp[j];
}
dp[i] = min;
}
// for(int i=1; i<=n; i++) cout<<dp[i]<<"\t";
// cout<<endl;
cout << dp[n];
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 958,912 | 958,913 | u333958848 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
// i番目に到達するために必要なコストの最小値をdp[i]とする。
int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = 1000000000;
}
// dpテーブルの初期化
dp[1] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(k, n - i); j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j - 1] - h[i - 1]));
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
// i番目に到達するために必要なコストの最小値をdp[i]とする。
int dp[n + 5];
for (int i = 0; i < n + 5; i++) {
dp[i] = 1000000000;
}
// dpテーブルの初期化
dp[1] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(k, n - i); j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j - 1] - h[i - 1]));
}
}
cout << dp[n] << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 958,914 | 958,915 | u882039496 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int nature(ll a) { //絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
int main() {
ll N, K, h[N], dp[N], ans;
cin >> N >> K; //足場の個数N//何個先まで飛べるかK
for (ll i = 0; i < N; i++) { //各足場の高さ
cin >> h[i];
}
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ans = dp[i - 1] + nature(h[i] - h[i - 1]);
for (ll j = 1; j <= min(K, i); j++) {
ans = min(dp[i - j] + nature(h[i] - h[i - j]),
ans); //各足場までの最小コスト
}
dp[i] = ans;
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int nature(ll a) { //絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
int main() {
ll N, K, h[100010], dp[100010], ans;
cin >> N >> K; //足場の個数N//何個先まで飛べるかK
for (ll i = 0; i < N; i++) { //各足場の高さ
cin >> h[i];
}
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ans = dp[i - 1] + nature(h[i] - h[i - 1]);
for (ll j = 1; j <= min(K, i); j++) {
ans = min(dp[i - j] + nature(h[i] - h[i - j]),
ans); //各足場までの最小コスト
}
dp[i] = ans;
}
cout << dp[N - 1] << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 958,930 | 958,931 | u121974081 | cpp |
p03161 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author shadowreaper810
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
const int MOD = 1000000007;
class BFrog2 {
public:
void solve(std::istream &in, std::ostream &out) {
int n, k;
in >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
in >> arr[i];
arr[0] = 1e15;
vector<int> dp(n, 1e15);
dp[1] = 0;
dp[0] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k && i - j >= 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
out << dp[n];
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
BFrog2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
} | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author shadowreaper810
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
const int MOD = 1000000007;
class BFrog2 {
public:
void solve(std::istream &in, std::ostream &out) {
int n, k;
in >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
in >> arr[i];
arr[0] = 1e15;
vector<int> dp(n + 1, 1e15);
dp[1] = 0;
dp[0] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k && i - j >= 1; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
out << dp[n];
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
BFrog2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
} | [
"assignment.change"
] | 958,942 | 958,943 | u923152767 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[10010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j <= 1)
continue;
dp[i + 1] = min(dp[i + 1], dp[i - j] + abs(h[i + 1] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j < 0)
continue;
dp[i + 1] = min(dp[i + 1], dp[i - j] + abs(h[i + 1] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change"
] | 958,946 | 958,947 | u702686470 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[10010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j < 1)
continue;
dp[i + 1] = min(dp[i + 1], dp[i - j] + abs(h[i + 1] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j < 0)
continue;
dp[i + 1] = min(dp[i + 1], dp[i - j] + abs(h[i + 1] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 958,948 | 958,947 | u702686470 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int arr[N];
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int dp[N] = {0};
dp[N - 1] = abs(arr[N - 2] - arr[N - 1]);
for (int i = N - 2; i >= 0; i--) {
int j = i + 1;
int minval = INT_MAX;
while (j < N && j <= i + K) {
minval = min(minval, abs(arr[i] - arr[j]) + dp[j]);
j++;
}
dp[i] = minval;
}
cout << dp[0];
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 dp[N] = {0};
dp[N - 2] = abs(arr[N - 2] - arr[N - 1]);
for (int i = N - 2; i >= 0; i--) {
int j = i + 1;
int minval = INT_MAX;
while (j < N && j <= i + K) {
minval = min(minval, abs(arr[i] - arr[j]) + dp[j]);
j++;
}
dp[i] = minval;
}
cout << dp[0];
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 958,957 | 958,958 | u060407800 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, K;
cin >> n >> K;
int height[n];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n, 1e4 + 1);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= K; j++) {
if (j <= i) {
dp[i] = min(dp[i], dp[i - j] + abs(height[i - j] - height[i]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, K;
cin >> n >> K;
int height[n];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= K; j++) {
if (j <= i) {
dp[i] = min(dp[i], dp[i - j] + abs(height[i - j] - height[i]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 958,961 | 958,960 | u459654533 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 100001;
for (int j = 1; j <= min(i, K); j++) {
M = min(M, cost.at(i - j) + abs(high.at(i) - high.at(i - j)));
}
cost.at(i) = M;
}
cout << cost.at(N - 1);
}
| #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 2000000000;
for (int j = 1; j <= min(i, K); j++) {
M = min(M, cost.at(i - j) + abs(high.at(i) - high.at(i - j)));
}
cost.at(i) = M;
}
cout << cost.at(N - 1);
}
| [
"literal.number.change",
"assignment.value.change"
] | 958,965 | 958,963 | u125669112 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 100001;
for (int j = 1; j <= min(i, K); j++) {
M = min(M, cost.at(i - j) + abs(high.at(i) - high.at(i - j)));
}
cost.at(i) = M;
}
cout << cost.at(N - 1);
}
| #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 732800000000000;
for (int j = 1; j <= min(i, K); j++) {
M = min(M, cost.at(i - j) + abs(high.at(i) - high.at(i - j)));
}
cost.at(i) = M;
}
cout << cost.at(N - 1);
}
| [
"literal.number.change",
"assignment.value.change"
] | 958,965 | 958,966 | u125669112 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 10e9;
ll power(ll a, ll b, ll d) {
if (b == 0) {
return 1;
} else if (a % 2 == 0) {
return power((a * a) % d, b / 2, d);
} else {
return (a * power((a * a) % d, (b - 1) / 2, d)) % d;
}
}
ll x, y, z;
void exteneded(ll a, ll b) {
if (b == 0) {
z = a;
x = 1;
y = 0;
} else {
exteneded(b, a % b);
int tmep = x;
x = y;
y = tmep - (a / b) * y;
}
}
int modInverse(int A, int M) {
A = A % M;
for (int B = 1; B < M; B++)
if ((A * B) % M == 1)
return B;
}
int main() {
ll t, i, j, k, n;
cin >> t >> k;
ll a[t];
for (i = 0; i < t; i++) {
cin >> a[i];
}
// vector<vector<ll>> dp(t+1,vector<ll>(k+1));
vector<ll> ans(t, 100000);
// for(i=0;i<=t;i++){
// for(j=0;j<=k;j++){
// dp[i][j]=100000;
// }
// }
// for(i=0;i<t;i++){
// dp[i][0]=0;
// }
// for(i=t-2;i>=t-k-1;i--){
// dp[t-1][t-1-i]=abs(a[t-1]-a[i]);
// cout<<"i is "<<t-1<<" k is "<<t-1-i<<" value is
// "<<abs(a[t-1]-a[i])<<endl;
// }
// for(i=1;i<=min(k,t-1);i++){
// dp[0][i]=0;
// cout<<"i is "<<0<<" k is "<<i<<" value is "<<dp[0][i]<<endl;
// }
ans[0] = 0;
// for(i=t-2;i>=0;i--){
// for(j=1;j<i;j++){
// cout<<"i is "<<i<<" j is "<<j<<endl;
// dp[i][j]=min(abs(a[i]-a[i-j])+dp[i+j][j],dp[i][j]);
// cout<<"value of dp is "<<dp[i][j]<<endl;
// }
// }
for (i = 1; i < t; i++) {
for (j = 1; j <= min(k, i); j++) {
// cout<<"i is "<<i<<" k is "<<j<<endl;
// dp[i][j]=min(dp[i][j],dp[i])
ans[i] = min(ans[i], ans[i - j] + abs(a[i] - a[i - j]));
// cout<<"ans is "<<ans[i]<<endl;
}
}
// for(i=1;i<=k;i++){
// cout<<"dp is "<<dp[1][i]<<endl;
// }
cout << ans[t - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 10e9;
ll power(ll a, ll b, ll d) {
if (b == 0) {
return 1;
} else if (a % 2 == 0) {
return power((a * a) % d, b / 2, d);
} else {
return (a * power((a * a) % d, (b - 1) / 2, d)) % d;
}
}
ll x, y, z;
void exteneded(ll a, ll b) {
if (b == 0) {
z = a;
x = 1;
y = 0;
} else {
exteneded(b, a % b);
int tmep = x;
x = y;
y = tmep - (a / b) * y;
}
}
int modInverse(int A, int M) {
A = A % M;
for (int B = 1; B < M; B++)
if ((A * B) % M == 1)
return B;
}
int main() {
ll t, i, j, k, n;
cin >> t >> k;
ll a[t];
for (i = 0; i < t; i++) {
cin >> a[i];
}
// vector<vector<ll>> dp(t+1,vector<ll>(k+1));
vector<ll> ans(t, 10e9);
// for(i=0;i<=t;i++){
// for(j=0;j<=k;j++){
// dp[i][j]=100000;
// }
// }
// for(i=0;i<t;i++){
// dp[i][0]=0;
// }
// for(i=t-2;i>=t-k-1;i--){
// dp[t-1][t-1-i]=abs(a[t-1]-a[i]);
// cout<<"i is "<<t-1<<" k is "<<t-1-i<<" value is
// "<<abs(a[t-1]-a[i])<<endl;
// }
// for(i=1;i<=min(k,t-1);i++){
// dp[0][i]=0;
// cout<<"i is "<<0<<" k is "<<i<<" value is "<<dp[0][i]<<endl;
// }
ans[0] = 0;
// for(i=t-2;i>=0;i--){
// for(j=1;j<i;j++){
// cout<<"i is "<<i<<" j is "<<j<<endl;
// dp[i][j]=min(abs(a[i]-a[i-j])+dp[i+j][j],dp[i][j]);
// cout<<"value of dp is "<<dp[i][j]<<endl;
// }
// }
for (i = 1; i < t; i++) {
for (j = 1; j <= min(k, i); j++) {
// cout<<"i is "<<i<<" k is "<<j<<endl;
// dp[i][j]=min(dp[i][j],dp[i])
ans[i] = min(ans[i], ans[i - j] + abs(a[i] - a[i - j]));
// cout<<"ans is "<<ans[i]<<endl;
}
}
// for(i=1;i<=k;i++){
// cout<<"dp is "<<dp[1][i]<<endl;
// }
cout << ans[t - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change"
] | 958,967 | 958,968 | u295185739 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int dp[200000];
int h[200000];
int n, k;
cin >> n >> k;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int j = 1; j < k + 2; j++) {
dp[j] = abs(h[j] - h[1]);
}
if (n < k + 2) {
cout << dp[n] << endl;
} else {
for (int i = k + 2; i < n + 1; i++) {
int min_diff = 50000;
for (int j = 1; j < k + 1; j++) {
int tmp = dp[i - j] + abs(h[i] - h[i - j]);
if (tmp < min_diff) {
min_diff = tmp;
}
}
dp[i] = min_diff;
}
cout << dp[n] << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int dp[200000];
int h[200000];
int n, k;
cin >> n >> k;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int j = 1; j < k + 2; j++) {
dp[j] = abs(h[j] - h[1]);
}
if (n < k + 2) {
cout << dp[n] << endl;
} else {
for (int i = k + 2; i < n + 1; i++) {
int min_diff = 1000000007;
for (int j = 1; j < k + 1; j++) {
int tmp = dp[i - j] + abs(h[i] - h[i - j]);
if (tmp < min_diff) {
min_diff = tmp;
}
}
dp[i] = min_diff;
}
cout << dp[n] << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 958,973 | 958,974 | u063962277 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1];
arr[0] = 0;
for (long long i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (long long i = 2; i <= n; i++) {
long long ans = 100000000000;
for (long long int j = max(0LL, i - k); j < i; j++) {
ans = min(ans, dp[j] + abs(arr[j] - arr[i]));
}
dp[i] = ans;
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1];
arr[0] = 0;
for (long long i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (long long i = 2; i <= n; i++) {
long long ans = 100000000000;
for (long long int j = max(1LL, i - k); j < i; j++) {
ans = min(ans, dp[j] + abs(arr[j] - arr[i]));
}
dp[i] = ans;
}
cout << dp[n];
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 958,979 | 958,980 | u426156439 | cpp |
p03161 | #include <assert.h> /*確認*/
#include <ctype.h> /*文字操作*/
#include <limits.h> /*限界*/
#include <math.h> /*計算*/
#include <stdbool.h> /*bool型*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
//---------------------------------------------------
#define rep(i, n) for (int i = 0; i < (n); i++)
#define max(a, b) ((a > b) ? a : b)
#define ABS(a) (((a) > (0)) ? a : -(a))
#define LL long long
#define MOD 1000000007 // 10^9+7(素数)
//---------------------------------------------------
// bottom up 型のDP
// https://atcoder.jp/contests/dp/tasks/dp_b
LL min(LL a, LL b) {
if (a > b)
return b;
else
return a;
}
int main(void) {
LL N;
LL K;
LL q = 0;
LL ans = 0;
LL H[100000];
LL DP[100000] = {0};
//入力
scanf("%lld %lld", &N, &K);
for (LL i = 0; i < N; i++) {
scanf("%lld", &H[i]);
}
// DPの初期化
DP[0] = 0;
//処理部
for (LL i = 1; i < N; i++) {
//作業用変数qを初期化
q = 100000;
// i-j番目からi番目に飛ぶときの最小値を考える
for (LL j = 1; j <= K && !(i - j < 0); j++) {
q = min(q, DP[i - j] + ABS(H[i - j] - H[i]));
}
// DPの値を更新
DP[i] = q;
}
//出力
ans = DP[N - 1];
printf("%lld\n", ans);
return 0;
}
| #include <assert.h> /*確認*/
#include <ctype.h> /*文字操作*/
#include <limits.h> /*限界*/
#include <math.h> /*計算*/
#include <stdbool.h> /*bool型*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
//---------------------------------------------------
#define rep(i, n) for (int i = 0; i < (n); i++)
#define max(a, b) ((a > b) ? a : b)
#define ABS(a) (((a) > (0)) ? a : -(a))
#define LL long long
#define MOD 1000000007 // 10^9+7(素数)
//---------------------------------------------------
// bottom up 型のDP
// https://atcoder.jp/contests/dp/tasks/dp_b
LL min(LL a, LL b) {
if (a > b)
return b;
else
return a;
}
int main(void) {
LL N;
LL K;
LL q = 0;
LL ans = 0;
LL H[100000];
LL DP[100000] = {0};
//入力
scanf("%lld %lld", &N, &K);
for (LL i = 0; i < N; i++) {
scanf("%lld", &H[i]);
}
// DPの初期化
DP[0] = 0;
//処理部
for (LL i = 1; i < N; i++) {
//作業用変数qを初期化
q = 1000000000;
// i-j番目からi番目に飛ぶときの最小値を考える
for (LL j = 1; j <= K && !(i - j < 0); j++) {
q = min(q, DP[i - j] + ABS(H[i - j] - H[i]));
}
// DPの値を更新
DP[i] = q;
}
//出力
ans = DP[N - 1];
printf("%lld\n", ans);
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 958,981 | 958,982 | u484407086 | cpp |
p03161 | #include <stdio.h>
#define ABS(a) ((a) > (0) ? (a) : -(a))
long long min(long long a, long long b) { return a > b ? b : a; }
long long rec(long long i, long long *H, long long K, long long *memo) {
if (i == 0)
return memo[0] = 0;
if (i - 2 < 0)
return memo[1] = ABS(H[i - 1] - H[i]);
if (memo[i] != -1)
return memo[i];
long long ret = 100000000000;
for (int j = K; 1 <= j; j--) {
// rec(i)は i - j 番目の のカエルから飛んでくるものの内最小値
if (i - j < 0)
continue;
ret = min(rec(i - j, H, K, memo) + ABS(H[i - j] - H[i]), ret);
// printf("%lld %lld\n", i - j, i);
}
return memo[i] = ret;
}
int main(void) {
long long N, K;
long long H[100000];
long long memo[100000];
scanf("%lld %lld", &N, &K);
for (long long i = 0; i < N; i++)
memo[i] = -1;
for (long long i = 0; i < N; i++)
scanf("%lld", &H[i]);
long long ans = rec(2, H, K, memo);
printf("%lld\n", ans);
return 0;
}
| #include <stdio.h>
#define ABS(a) ((a) > (0) ? (a) : -(a))
long long min(long long a, long long b) { return a > b ? b : a; }
long long rec(long long i, long long *H, long long K, long long *memo) {
if (i == 0)
return memo[0] = 0;
if (i - 2 < 0)
return memo[1] = ABS(H[i - 1] - H[i]);
if (memo[i] != -1)
return memo[i];
long long ret = 100000000000;
for (int j = K; 1 <= j; j--) {
// rec(i)は i - j 番目の のカエルから飛んでくるものの内最小値
if (i - j < 0)
continue;
ret = min(rec(i - j, H, K, memo) + ABS(H[i - j] - H[i]), ret);
// printf("%lld %lld\n", i - j, i);
}
return memo[i] = ret;
}
int main(void) {
long long N, K;
long long H[100000];
long long memo[100000];
scanf("%lld %lld", &N, &K);
for (long long i = 0; i < N; i++)
memo[i] = -1;
for (long long i = 0; i < N; i++)
scanf("%lld", &H[i]);
long long ans = rec(N - 1, H, K, memo);
printf("%lld\n", ans);
return 0;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 958,983 | 958,984 | u020604402 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int mincost(int a[], int n, int k) {
int dp[100001] = {0}, i, j;
for (i = 2; i <= n; i++) {
int x, y;
int ans = abs(a[i] - a[i - 1]) + dp[i - 1];
for (j = 2; j <= k; j++) {
if (i - j > 0)
x = abs(a[i] - a[i - j]) + dp[i - j];
ans = min(x, ans);
}
dp[i] = ans;
}
return dp[n];
}
int main() {
int a[100001], i, n, k;
cin >> n >> k;
a[0] = 99999;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
cout << mincost(a, n, k);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int mincost(int a[], int n, int k) {
int dp[100001] = {0}, i, j;
for (i = 2; i <= n; i++) {
int x, y;
int ans = abs(a[i] - a[i - 1]) + dp[i - 1];
for (j = 2; j <= k; j++) {
if (i - j > 0) {
x = abs(a[i] - a[i - j]) + dp[i - j];
ans = min(x, ans);
}
}
dp[i] = ans;
}
return dp[n];
}
int main() {
int a[100001], i, n, k;
cin >> n >> k;
a[0] = 99999;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
cout << mincost(a, n, k);
return 0;
}
| [] | 958,985 | 958,986 | u994223613 | cpp |
p03161 | #include <iostream>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
LL dp[N];
fill(dp, dp + N, 1 << 61);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]));
}
}
}
cout << dp[N - 1] << endl;
} | #include <iostream>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
LL dp[N];
fill(dp, dp + N, 1L << 61);
dp[0] = 0L;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]));
}
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.type.widen.change"
] | 958,999 | 959,000 | u131000248 | cpp |
p03161 | /// *********** Coded by Olium_MdioxideN ***********
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define ext exit(0)
#define fast ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define newl printf("\n")
#define nl '\n'
#define endl '\n'
#define sci(x) scanf("%d", &(x))
#define scll(x) scanf("%lld", &(x))
#define sci2(x, y) scanf("%d %d", &(x), &(y))
#define pr printf
#define forr(i, b, e) for (int(i) = (b); (i) <= (e); (i)++)
#define forrv(i, b, e) for (int(i) = (b); (i) >= (e); (i)--)
#define fors(i, x) for (auto(i) = (x).begin(); (i) != (x).end(); (i)++)
#define F first
#define S second
#define mset0(x) memset((x), 0, sizeof((x)));
#define mset1(x) memset((x), -1, sizeof((x)));
#define bs binary_search
#define all(x) (x).begin(), (x).end()
#define pqmin(x) priority_queue<x, vector<x>, greater<x>>
#define pqmax(x) priority_queue<x>
#define sortd(x) \
sort(all(x)); \
reverse(all(x));
#define vi vector<int>
#define pii pair<int, int>
#define mpii map<int, int>
#define elif else if
#define pi 3.14159265358979323846D
#define gcd(x, y) __gcd(x, y)
#define lcm(x, y) __lcm(x, y)
#define runtime() \
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
#define Int inputInt() // new int input
#define Long inputLong() // new long input
#define Double inputDouble() // new double input
#define String inputString() // new string input
inline int inputInt() {
int tmp;
scanf(" %d", &tmp);
return tmp;
}
inline ll inputLong() {
ll tmp;
scanf(" %lld", &tmp);
return tmp;
}
inline double inputDouble() {
double tmp;
scanf(" %lf", &tmp);
return tmp;
}
inline string inputString() {
char tmpStr[1000010];
scanf(" %s", tmpStr);
return tmpStr;
}
template <typename type> inline type __lcm(type n1, type n2) {
return n1 * (n2 / gcd(n1, n2));
}
ll pow_mod(ll nn, ll pp, ll mm) {
ll res = 1;
while (pp > 0) {
if (pp & 1)
res = (res * nn) % mm;
pp = pp >> 1;
nn = (nn * nn) % mm;
}
return res;
}
#ifndef ONLINE_JUDGE
vector<string> vec_spltr(string s) {
s += ',';
vector<string> res;
while (!s.empty())
res.push_back(s.substr(0, s.find(','))), s = s.substr(s.find(',') + 1);
return res;
}
void dbg_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
dbg_out(args, idx + 1, LINE_NUM, T...);
}
#define debug(...) dbg_out(vec_spltr(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#define in_file freopen("input.txt", "r", stdin)
#define out_file freopen("output.txt", "w", stdout)
#else
#define debug(...) 0
#define in_file 0
#define out_file 0
#endif
class stdout_cus {
short float_prec = 7;
public:
inline stdout_cus operator<<(const int &arg) {
printf("%d", arg);
return *this;
}
inline stdout_cus operator<<(const short &arg) {
printf("%d", arg);
return *this;
}
inline stdout_cus operator<<(const bool &arg) {
printf("%d", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned int &arg) {
printf("%u", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned short &arg) {
printf("%u", arg);
return *this;
}
inline stdout_cus operator<<(const long long &arg) {
printf("%lld", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned long long &arg) {
printf("%llu", arg);
return *this;
}
inline stdout_cus operator<<(const double &arg) {
printf("%.*f", float_prec, arg);
return *this;
}
inline stdout_cus operator<<(const float &arg) {
printf("%.*f", float_prec, arg);
return *this;
}
inline stdout_cus operator<<(const char &arg) {
printf("%c", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned char &arg) {
printf("%c", arg);
return *this;
}
inline stdout_cus operator<<(const char *arg) {
printf("%s", arg);
return *this;
}
inline stdout_cus operator<<(const std::string &arg) {
printf("%s", arg.c_str());
return *this;
}
inline stdout_cus operator<<(const stdout_cus &) { return *this; }
inline void ignore() { fflush(stdout); }
inline stdout_cus precision(short prec) {
float_prec = prec;
return *this;
}
} cout_cus;
class stdin_cus {
public:
inline stdin_cus operator>>(const int &arg) {
scanf(" %d", &arg);
return *this;
}
inline stdin_cus operator>>(const short &arg) {
scanf(" %d", &arg);
return *this;
}
inline stdin_cus operator>>(const bool &arg) {
scanf(" %d", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned int &arg) {
scanf(" %u", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned short &arg) {
scanf(" %u", &arg);
return *this;
}
inline stdin_cus operator>>(const long long &arg) {
scanf(" %lld", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned long long &arg) {
scanf(" %llu", &arg);
return *this;
}
inline stdin_cus operator>>(const double &arg) {
scanf(" %lf", &arg);
return *this;
}
inline stdin_cus operator>>(const float &arg) {
scanf(" %f", &arg);
return *this;
}
inline stdin_cus operator>>(const char &arg) {
scanf(" %c", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned char &arg) {
scanf(" %c", &arg);
return *this;
}
inline stdin_cus operator>>(const char *arg) {
scanf(" %s", arg);
return *this;
}
inline stdin_cus operator>>(std::string &arg) {
char tmp[1000000];
scanf(" %s", tmp);
arg = tmp;
return *this;
}
inline void ignore() { fflush(stdin); }
} cin_cus;
#define cout cout_cus
#define cin cin_cus
#define setprecision cout_cus.precision
/// * * * Main Code Starts Now * * *
#define MOD 10000007
#define MAX 100010
void olium();
int main() {
// in_file;
// out_file;
int t = 1;
// cin >> t;
forr(i, 1, t) {
// cout << "Case " << i << ": ";
olium();
}
return 0;
}
int n, k;
ll a[100009];
ll dp[100009];
ll sol(int idx) {
if (idx >= n)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = INT_MAX;
forr(i, 1, k) {
if (idx + i <= n)
dp[idx] = min(dp[idx], abs(a[idx + i] - a[idx]) + sol(idx + i));
}
return dp[idx];
}
void olium() {
mset1(dp);
mset1(a);
cin >> n;
forr(i, 1, n) { cin >> a[i]; }
cout << sol(1) << nl;
}
| /// *********** Coded by Olium_MdioxideN ***********
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define ext exit(0)
#define fast ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define newl printf("\n")
#define nl '\n'
#define endl '\n'
#define sci(x) scanf("%d", &(x))
#define scll(x) scanf("%lld", &(x))
#define sci2(x, y) scanf("%d %d", &(x), &(y))
#define pr printf
#define forr(i, b, e) for (int(i) = (b); (i) <= (e); (i)++)
#define forrv(i, b, e) for (int(i) = (b); (i) >= (e); (i)--)
#define fors(i, x) for (auto(i) = (x).begin(); (i) != (x).end(); (i)++)
#define F first
#define S second
#define mset0(x) memset((x), 0, sizeof((x)));
#define mset1(x) memset((x), -1, sizeof((x)));
#define bs binary_search
#define all(x) (x).begin(), (x).end()
#define pqmin(x) priority_queue<x, vector<x>, greater<x>>
#define pqmax(x) priority_queue<x>
#define sortd(x) \
sort(all(x)); \
reverse(all(x));
#define vi vector<int>
#define pii pair<int, int>
#define mpii map<int, int>
#define elif else if
#define pi 3.14159265358979323846D
#define gcd(x, y) __gcd(x, y)
#define lcm(x, y) __lcm(x, y)
#define runtime() \
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
#define Int inputInt() // new int input
#define Long inputLong() // new long input
#define Double inputDouble() // new double input
#define String inputString() // new string input
inline int inputInt() {
int tmp;
scanf(" %d", &tmp);
return tmp;
}
inline ll inputLong() {
ll tmp;
scanf(" %lld", &tmp);
return tmp;
}
inline double inputDouble() {
double tmp;
scanf(" %lf", &tmp);
return tmp;
}
inline string inputString() {
char tmpStr[1000010];
scanf(" %s", tmpStr);
return tmpStr;
}
template <typename type> inline type __lcm(type n1, type n2) {
return n1 * (n2 / gcd(n1, n2));
}
ll pow_mod(ll nn, ll pp, ll mm) {
ll res = 1;
while (pp > 0) {
if (pp & 1)
res = (res * nn) % mm;
pp = pp >> 1;
nn = (nn * nn) % mm;
}
return res;
}
#ifndef ONLINE_JUDGE
vector<string> vec_spltr(string s) {
s += ',';
vector<string> res;
while (!s.empty())
res.push_back(s.substr(0, s.find(','))), s = s.substr(s.find(',') + 1);
return res;
}
void dbg_out(vector<string> __attribute__((unused)) args,
__attribute__((unused)) int idx,
__attribute__((unused)) int LINE_NUM) {
cerr << endl;
}
template <typename Head, typename... Tail>
void dbg_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if (idx > 0)
cerr << ", ";
else
cerr << "Line(" << LINE_NUM << ") ";
stringstream ss;
ss << H;
cerr << args[idx] << " = " << ss.str();
dbg_out(args, idx + 1, LINE_NUM, T...);
}
#define debug(...) dbg_out(vec_spltr(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#define in_file freopen("input.txt", "r", stdin)
#define out_file freopen("output.txt", "w", stdout)
#else
#define debug(...) 0
#define in_file 0
#define out_file 0
#endif
class stdout_cus {
short float_prec = 7;
public:
inline stdout_cus operator<<(const int &arg) {
printf("%d", arg);
return *this;
}
inline stdout_cus operator<<(const short &arg) {
printf("%d", arg);
return *this;
}
inline stdout_cus operator<<(const bool &arg) {
printf("%d", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned int &arg) {
printf("%u", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned short &arg) {
printf("%u", arg);
return *this;
}
inline stdout_cus operator<<(const long long &arg) {
printf("%lld", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned long long &arg) {
printf("%llu", arg);
return *this;
}
inline stdout_cus operator<<(const double &arg) {
printf("%.*f", float_prec, arg);
return *this;
}
inline stdout_cus operator<<(const float &arg) {
printf("%.*f", float_prec, arg);
return *this;
}
inline stdout_cus operator<<(const char &arg) {
printf("%c", arg);
return *this;
}
inline stdout_cus operator<<(const unsigned char &arg) {
printf("%c", arg);
return *this;
}
inline stdout_cus operator<<(const char *arg) {
printf("%s", arg);
return *this;
}
inline stdout_cus operator<<(const std::string &arg) {
printf("%s", arg.c_str());
return *this;
}
inline stdout_cus operator<<(const stdout_cus &) { return *this; }
inline void ignore() { fflush(stdout); }
inline stdout_cus precision(short prec) {
float_prec = prec;
return *this;
}
} cout_cus;
class stdin_cus {
public:
inline stdin_cus operator>>(const int &arg) {
scanf(" %d", &arg);
return *this;
}
inline stdin_cus operator>>(const short &arg) {
scanf(" %d", &arg);
return *this;
}
inline stdin_cus operator>>(const bool &arg) {
scanf(" %d", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned int &arg) {
scanf(" %u", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned short &arg) {
scanf(" %u", &arg);
return *this;
}
inline stdin_cus operator>>(const long long &arg) {
scanf(" %lld", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned long long &arg) {
scanf(" %llu", &arg);
return *this;
}
inline stdin_cus operator>>(const double &arg) {
scanf(" %lf", &arg);
return *this;
}
inline stdin_cus operator>>(const float &arg) {
scanf(" %f", &arg);
return *this;
}
inline stdin_cus operator>>(const char &arg) {
scanf(" %c", &arg);
return *this;
}
inline stdin_cus operator>>(const unsigned char &arg) {
scanf(" %c", &arg);
return *this;
}
inline stdin_cus operator>>(const char *arg) {
scanf(" %s", arg);
return *this;
}
inline stdin_cus operator>>(std::string &arg) {
char tmp[1000000];
scanf(" %s", tmp);
arg = tmp;
return *this;
}
inline void ignore() { fflush(stdin); }
} cin_cus;
#define cout cout_cus
#define cin cin_cus
#define setprecision cout_cus.precision
/// * * * Main Code Starts Now * * *
#define MOD 10000007
#define MAX 100010
void olium();
int main() {
// in_file;
// out_file;
int t = 1;
// cin >> t;
forr(i, 1, t) {
// cout << "Case " << i << ": ";
olium();
}
return 0;
}
int n, k;
ll a[100009];
ll dp[100009];
ll sol(int idx) {
if (idx >= n)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = INT_MAX;
forr(i, 1, k) {
if (idx + i <= n)
dp[idx] = min(dp[idx], abs(a[idx + i] - a[idx]) + sol(idx + i));
}
return dp[idx];
}
void olium() {
mset1(dp);
mset1(a);
cin >> n >> k;
forr(i, 1, n) { cin >> a[i]; }
cout << sol(1) << nl;
}
| [
"expression.operation.binary.add"
] | 959,003 | 959,004 | u845745781 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j <= k; j++) {
if (i > j)
dp[i] = fmin(dp[i - j] + abs(h[j] - h[i]), dp[i]);
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i < n + 1; i++) {
for (int j = 1; j <= k; j++) {
if (i > j)
dp[i] = fmin(dp[i - j] + abs(h[i - j] - h[i]), dp[i]);
}
}
cout << dp[n] << endl;
}
| [
"assignment.change"
] | 959,005 | 959,006 | u347950677 | cpp |
p03161 | /************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 23 Apr 2020
*/
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
int DP[100005];
int fun(vector<int> &H, int ind) {
if (DP[ind] != -1) {
return DP[ind];
}
if (ind == 0) {
return 0;
}
int pos1 = INT_MAX, pos2 = INT_MAX;
if (ind - 1 >= 0) {
int val1 = abs(H[ind] - H[ind - 1]);
pos1 = val1 + fun(H, ind - 1);
}
if (ind - 2 >= 0) {
int val2 = abs(H[ind] - H[ind - 2]);
pos2 = val2 + fun(H, ind - 2);
}
return DP[ind] = min(pos1, pos2);
}
/* MEMO
signed main(){
fastio;
int t=1;
// cin>>t;
while(--t>=0){
int n;
cin>>n;
vector<int>H(n);
memset(DP,-1,sizeof(DP));
for(int i=0;i<n;i++) cin>>H[i];
cout<<fun(H,n-1);
}
return 0;
}
*/
/* BOTTOM-UP */
signed main() {
fastio;
int t = 1;
// cin>>t;
while (--t >= 0) {
int n, k;
cin >> n >> k;
vector<int> H(n);
int dp[n];
for (int i = 0; i < n; i++)
cin >> H[i], dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
for (int i = 2; i < n; i++) {
int val1;
for (int j = 1; j <= k; j++) {
if (i - k >= 0) {
val1 = abs(H[i] - H[i - j]);
dp[i] = min(dp[i], dp[i - k] + val1);
}
}
}
cout << dp[n - 1];
}
return 0;
}
| /************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 23 Apr 2020
*/
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
int DP[100005];
int fun(vector<int> &H, int ind) {
if (DP[ind] != -1) {
return DP[ind];
}
if (ind == 0) {
return 0;
}
int pos1 = INT_MAX, pos2 = INT_MAX;
if (ind - 1 >= 0) {
int val1 = abs(H[ind] - H[ind - 1]);
pos1 = val1 + fun(H, ind - 1);
}
if (ind - 2 >= 0) {
int val2 = abs(H[ind] - H[ind - 2]);
pos2 = val2 + fun(H, ind - 2);
}
return DP[ind] = min(pos1, pos2);
}
/* MEMO
signed main(){
fastio;
int t=1;
// cin>>t;
while(--t>=0){
int n;
cin>>n;
vector<int>H(n);
memset(DP,-1,sizeof(DP));
for(int i=0;i<n;i++) cin>>H[i];
cout<<fun(H,n-1);
}
return 0;
}
*/
/* BOTTOM-UP */
signed main() {
fastio;
int t = 1;
// cin>>t;
while (--t >= 0) {
int n, k;
cin >> n >> k;
vector<int> H(n);
int dp[n];
for (int i = 0; i < n; i++)
cin >> H[i], dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
for (int i = 2; i < n; i++) {
int val1;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
val1 = abs(H[i] - H[i - j]);
dp[i] = min(dp[i], dp[i - j] + val1);
}
}
}
cout << dp[n - 1];
}
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,010 | 959,011 | u808647942 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<int> color;
bool dfs(const Graph &G, int v, int cur = 0) {
color[v] = cur;
for (auto next_v : G[v]) {
if (color[next_v] != -1) {
if (color[next_v] == cur)
return false;
continue;
}
if (!dfs(G, next_v, 1 - cur))
return false;
}
return true;
}
const ll INF = 1LL << 60;
int N;
vector<ll> h(1e5 + 10);
vector<ll> dp(1e5 + 10);
int main() {
int N, K;
cin >> N >> K;
rep(i, N) cin >> h[i];
rep(i, 1e5 + 10) dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
vector<int> color;
bool dfs(const Graph &G, int v, int cur = 0) {
color[v] = cur;
for (auto next_v : G[v]) {
if (color[next_v] != -1) {
if (color[next_v] == cur)
return false;
continue;
}
if (!dfs(G, next_v, 1 - cur))
return false;
}
return true;
}
const ll INF = 1LL << 60;
int N;
vector<ll> h(1e5 + 10);
vector<ll> dp(1e5 + 10);
int main() {
int N, K;
cin >> N >> K;
rep(i, N) cin >> h[i];
rep(i, 1e5 + 10) dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,012 | 959,013 | u101048376 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[100001];
for (int i = 0; i < N; i++)
cin >> h[i + 1];
int dp[100001];
dp[1] = 0;
for (int i = 2; i <= N; i++) {
int cost[K + 1];
for (int j = 1; j <= K && i - j > 0; j++) {
cost[j] = dp[i - j] + max(h[i] - h[i - j], h[i - j] - h[i]);
}
int min = cost[1];
for (int j = 2; j <= K && i - K > 0; j++) {
if (min > cost[j])
min = cost[j];
}
dp[i] = min;
}
cout << dp[N] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[100001];
for (int i = 0; i < N; i++)
cin >> h[i + 1];
int dp[100001];
dp[1] = 0;
for (int i = 2; i <= N; i++) {
int cost[K + 1];
for (int j = 1; j <= K && i - j > 0; j++) {
cost[j] = dp[i - j] + max(h[i] - h[i - j], h[i - j] - h[i]);
}
int m = cost[1];
for (int j = 1; j <= K && i - j > 0; j++) {
if (m > cost[j])
m = cost[j];
}
dp[i] = m;
}
cout << dp[N] << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.conditio... | 959,014 | 959,015 | u824859165 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll rep_jijo(ll n, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0) {
ll t = rep_jijo(n, x / 2);
return t * t % mod;
}
return n * rep_jijo(n, x - 1) % mod;
}
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;
}
const long long INF = 1LL << 60;
ll N;
ll h[100010];
// DP テーブル
ll dp[100010];
int main() {
ll N, K;
cin >> N >> K;
rep(i, N) { cin >> h[i]; }
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
// 初期条件
dp[0] = 0;
// ループ
for (int i = 0; i < N; ++i) {
for (ll j = 2; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
// 解を得て出力
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll rep_jijo(ll n, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0) {
ll t = rep_jijo(n, x / 2);
return t * t % mod;
}
return n * rep_jijo(n, x - 1) % mod;
}
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;
}
const long long INF = 1LL << 60;
ll N;
ll h[100100];
// DP テーブル
ll dp[100100];
int main() {
ll N, K;
cin >> N >> K;
rep(i, N) { cin >> h[i]; }
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100100; ++i) {
dp[i] = INF;
}
// 初期条件
dp[0] = 0;
// ループ
for (ll i = 0; i < N; ++i) {
for (ll j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
// 解を得て出力
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 959,016 | 959,017 | u613945234 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll rep_jijo(ll n, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0) {
ll t = rep_jijo(n, x / 2);
return t * t % mod;
}
return n * rep_jijo(n, x - 1) % mod;
}
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;
}
const long long INF = 1LL << 60;
ll N;
ll h[100010];
// DP テーブル
ll dp[100010];
int main() {
ll N, K;
cin >> N >> K;
rep(i, N) { cin >> h[i]; }
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
// 初期条件
dp[0] = 0;
// ループ
for (int i = 0; i < N; ++i) {
for (ll j = 2; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
// 解を得て出力
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll rep_jijo(ll n, ll x) {
if (x == 0)
return 1;
if (x % 2 == 0) {
ll t = rep_jijo(n, x / 2);
return t * t % mod;
}
return n * rep_jijo(n, x - 1) % mod;
}
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;
}
const long long INF = 1LL << 60;
ll N;
ll h[101000];
// DP テーブル
ll dp[101000];
int main() {
ll N, K;
cin >> N >> K;
rep(i, N) { cin >> h[i]; }
// DP テーブル全体を初期化 (最小化問題なので INF に初期化)
for (int i = 0; i < 101000; ++i) {
dp[i] = INF;
}
// 初期条件
dp[0] = 0;
// ループ
for (ll i = 0; i < N; ++i) {
for (ll j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
// 解を得て出力
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 959,016 | 959,018 | u613945234 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.