problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
int main() {
LL n, k;
cin >> n >> k;
LL a[n];
for (LL i = 0; i < n; i++)
cin >> a[i];
LL dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (LL i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (LL j = i - 1; j >= (i - k); 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;
typedef long long int LL;
int main() {
LL n, k;
cin >> n >> k;
LL a[n];
for (LL i = 0; i < n; i++)
cin >> a[i];
LL dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (LL i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (LL j = i - 1; j >= (i - k) && j >= 0; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 960,427 | 960,428 | u479016132 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
int main() {
int dp[100007], H[100007], n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> H[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j + i < n && j <= k; j++)
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i] - H[j]));
}
cout << dp[n - 1];
return 0;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_set>
#include <vector>
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
int main() {
int dp[100007], H[100007], n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> H[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j + i < n && j <= k; j++)
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i] - H[i + j]));
}
cout << dp[n - 1];
return 0;
} | [
"assignment.change"
] | 960,429 | 960,430 | u096424346 | cpp |
p03161 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int h[n];
int dp[n];
REP(i, n) {
scanf("%d", &h[i]);
dp[i] = INF;
}
dp[0] = 0;
REP(i, n) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(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++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long int ll;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int h[n];
int dp[n + k];
REP(i, n) {
scanf("%d", &h[i]);
dp[i] = INF;
}
dp[0] = 0;
REP(i, n) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
} | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 960,463 | 960,464 | u283907492 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define N 100001
#define MAX 1500000000
int ans[N];
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[i] = MAX;
}
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {
ans[i] = min((ans[i - j] + abs(a[i] - a[i - j])), ans[i]);
}
}
cout << ans[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
#define N 100001
#define MAX 1500000000
int ans[N];
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
ans[i] = MAX;
}
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= min(i, k); j++) {
ans[i] = min((ans[i - j] + abs(a[i] - a[i - j])), ans[i]);
}
}
cout << ans[n - 1];
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 960,465 | 960,466 | u243359841 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define MAX 20000000
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
int main() {
int n, k, x, dp[MAX];
vi v;
cin >> n >> k;
REP(i, n) {
cin >> x;
v.pb(x);
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
FOR(i, 2, n) {
dp[i] = MAX;
for (int j = i - 1; j >= max(i - k, 0); j--) {
if (dp[i] > dp[j] + abs(v[i] - v[j])) {
dp[i] = dp[j] + abs(v[i] - v[j]);
}
}
}
// cout<<dp[n-1]<<endl;
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MAX 20000000000LL
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
int main() {
ll n, k, x, dp[1000000];
vi v;
cin >> n >> k;
REP(i, n) {
cin >> x;
v.pb(x);
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
FOR(i, 2, n) {
dp[i] = MAX;
for (int j = i - 1; j >= max(i - k, 0LL); j--) {
if (dp[i] > dp[j] + abs(v[i] - v[j])) {
dp[i] = dp[j] + abs(v[i] - v[j]);
}
}
}
// cout<<dp[n-1]<<endl;
cout << dp[n - 1] << endl;
return 0;
} | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"literal.number.type.widen.change"
] | 960,472 | 960,473 | u843250043 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
const int inf = 0x3f3f3f3f;
using namespace std;
int main() {
int n, temp;
cin >> n >> temp;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1, inf);
dp[1] = 0;
dp[2] = arr[2] - arr[1];
for (int i = 3; i <= n; i++) {
for (int k = i - 1; k >= max(1, i - temp); k--) {
dp[i] = min(dp[k] + abs(arr[i] - arr[k]), dp[i]);
}
}
cout << dp[n];
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
const int inf = 0x3f3f3f3f;
using namespace std;
int main() {
int n, temp;
cin >> n >> temp;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1, inf);
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
for (int k = i - 1; k >= max(1, i - temp); k--) {
dp[i] = min(dp[k] + abs(arr[i] - arr[k]), dp[i]);
}
}
cout << dp[n];
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 960,474 | 960,475 | u241738997 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define fr(i, a) for (ll i = 0LL; i < a; i++)
#define fab(i, a, b) for (ll i = a; i <= b; i++)
#define fba(i, a, b) for (ll i = b; i >= a; i--)
#define rf(i, a) for (ll i = a; i >= 0; i--)
#define sup \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define MX 10000000007
#define MAX 10000007
#define endl "\n"
#define ui unsigned int
#define ull unsigned long long int
#define ll long long int
#define V1 vector<ll> v
#define V2 vector<int> v
#define VP1 vector<pair<ll, ll>> vp
#define VP2 vector<pair<int, int>> vp
#define pb push_back
ll dp[MAX];
ll mod(ll a, ll b) { return a > b ? a - b : b - a; }
ll frog2(ll i, ll h[], ll k) {
ll j, minn = MX;
if (i < 0)
return 0;
if (dp[i] != -1)
return dp[i];
else {
fab(j, 1, k) {
if (i >= 1)
minn = min(minn, mod(h[i], h[i - j]) + frog2(i - j, h, k));
else
minn = mod(h[i], h[0]) + frog2(i - j, h, k);
}
dp[i] = minn;
return dp[i];
}
}
int main() {
sup;
ll n, k, cost;
cin >> n >> k;
ll h[n];
fr(i, n) cin >> h[i];
for (ll i = 0LL; i < MAX; i++)
dp[i] = -1;
cost = frog2(n - 1, h, k);
cout << cost << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fr(i, a) for (ll i = 0LL; i < a; i++)
#define fab(i, a, b) for (ll i = a; i <= b; i++)
#define fba(i, a, b) for (ll i = b; i >= a; i--)
#define rf(i, a) for (ll i = a; i >= 0; i--)
#define sup \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define MX 10000000007
#define MAX 10000007
#define endl "\n"
#define ui unsigned int
#define ull unsigned long long int
#define ll long long int
#define V1 vector<ll> v
#define V2 vector<int> v
#define VP1 vector<pair<ll, ll>> vp
#define VP2 vector<pair<int, int>> vp
#define pb push_back
ll dp[MAX];
ll mod(ll a, ll b) { return a > b ? a - b : b - a; }
ll frog2(ll i, ll h[], ll k) {
ll j, minn = MX;
if (i < 0)
return 0;
if (dp[i] != -1)
return dp[i];
else {
fab(j, 1, k) {
if ((i - j) > 0)
minn = min(minn, mod(h[i], h[i - j]) + frog2(i - j, h, k));
else
minn = mod(h[i], h[0]) + frog2(i - j, h, k);
}
dp[i] = minn;
return dp[i];
}
}
int main() {
sup;
ll n, k, cost;
cin >> n >> k;
ll h[n];
fr(i, n) cin >> h[i];
for (ll i = 0LL; i < MAX; i++)
dp[i] = -1;
cost = frog2(n - 1, h, k);
cout << cost << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 960,476 | 960,477 | u124059719 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define lsc(x) scanf("%lld", &x)
#define sc(x) scanf("%d", &x)
#define lpr(x) printf("%lld ", x)
#define pr(x) printf("%d ", x)
#define n_l printf("\n")
#define VI vector<int>
#define VII vector<long long int>
#define MI map<int, int>
#define PI pair<int, int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define mset(x, y) memset(x, y, sizeof(x))
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define fr(i, a, n) for (int i = a; i <= n; i++)
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
const int N = (int)1e6 + 5;
const int mod = 1000000007;
typedef long long ll;
// order_of_key (val): returns the no. of values strictly less than val
// find_by_order (k): returns the kth largest element iterator.(0-based)
// vector<int>::iterator itr=lower_bound(v.begin(),v.end(),x);
// s.substr(pos[0-indexed], len(default=till end))
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
ll dp[N], a[N];
int main() {
int n;
sc(n);
int k;
sc(k);
fr(i, 1, n) lsc(a[i]);
fr(i, 2, n) dp[i] = mod * 1LL * mod;
fr(i, 2, n) {
for (int j = i - 1; j >= max(0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
lpr(dp[n]);
n_l;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define lsc(x) scanf("%lld", &x)
#define sc(x) scanf("%d", &x)
#define lpr(x) printf("%lld ", x)
#define pr(x) printf("%d ", x)
#define n_l printf("\n")
#define VI vector<int>
#define VII vector<long long int>
#define MI map<int, int>
#define PI pair<int, int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define mset(x, y) memset(x, y, sizeof(x))
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define fr(i, a, n) for (int i = a; i <= n; i++)
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
const int N = (int)1e6 + 5;
const int mod = 1000000007;
typedef long long ll;
// order_of_key (val): returns the no. of values strictly less than val
// find_by_order (k): returns the kth largest element iterator.(0-based)
// vector<int>::iterator itr=lower_bound(v.begin(),v.end(),x);
// s.substr(pos[0-indexed], len(default=till end))
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
ll dp[N], a[N];
int main() {
int n;
sc(n);
int k;
sc(k);
fr(i, 1, n) lsc(a[i]);
fr(i, 2, n) dp[i] = mod * 1LL * mod;
fr(i, 2, n) {
for (int j = i - 1; j >= max(1, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
lpr(dp[n]);
n_l;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,478 | 960,479 | u562608561 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/*inline void fastRead_int(int &x)
{
register int c = getchar_unlocked();
x=0;
int neg = 0;
for(;((c<48 || c>57) && c!='-'); c=getchar_unlocked());
if(c=='-'){
neg = 1;
c = getchar_unlocked();
}
for(; c>47 && c<58;c=getchar_unlocked())
x = (x<<1)+(x<<3)+c-48;
if(neg) x = -x;
}
*/
int min_cost(int a[], int n, int k) {
int cost[n];
cost[n - 1] = 0;
cost[n - 2] = abs(a[n - 2] - a[n - 1]);
for (int i = n - 3; i >= 0; i--) {
cost[i] = (abs(a[i] - a[i + 1])) + cost[i + 1];
for (int j = i + 2; j <= i + k; j++)
cost[i] = min(abs(a[i] - a[j]) + cost[j], cost[i]);
}
return cost[0];
}
int main() {
int n, k;
cin >> n >> k;
// fastRead_int(n); fastRead_int(k);
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i]; // fastRead_int(a[i]);
cout << min_cost(a, n, k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/*inline void fastRead_int(int &x)
{
register int c = getchar_unlocked();
x=0;
int neg = 0;
for(;((c<48 || c>57) && c!='-'); c=getchar_unlocked());
if(c=='-'){
neg = 1;
c = getchar_unlocked();
}
for(; c>47 && c<58;c=getchar_unlocked())
x = (x<<1)+(x<<3)+c-48;
if(neg) x = -x;
}
*/
int min_cost(int a[], int n, int k) {
int cost[n];
cost[n - 1] = 0;
cost[n - 2] = abs(a[n - 2] - a[n - 1]);
for (int i = n - 3; i >= 0; i--) {
cost[i] = (abs(a[i] - a[i + 1])) + cost[i + 1];
for (int j = i + 2; j < n && j <= i + k; j++)
cost[i] = min(abs(a[i] - a[j]) + cost[j], cost[i]);
}
return cost[0];
}
int main() {
int n, k;
cin >> n >> k;
// fastRead_int(n); fastRead_int(k);
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i]; // fastRead_int(a[i]);
cout << min_cost(a, n, k) << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 960,480 | 960,481 | u509559852 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100010];
int main() {
int N;
cin >> N;
int K;
cin >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100010];
int main() {
int N;
cin >> N;
int K;
cin >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 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"
] | 960,492 | 960,493 | u147556624 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100010];
int main() {
int N;
cin >> N;
int K;
cin >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100100];
int main() {
int N;
cin >> N;
int K;
cin >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100100; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"expression.off_by_one"
] | 960,494 | 960,495 | u147556624 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100010];
int main() {
int N;
cin >> N;
int K;
cin >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100100];
int main() {
int N;
cin >> N;
int K;
cin >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100100; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"expression.off_by_one"
] | 960,496 | 960,495 | u147556624 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i < n; i++) {
for (int j = 1; i - j >= 1 && j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; i - j >= 1 && j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n];
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,501 | 960,502 | u402262779 | cpp |
p03161 | // frog2
#include <bits/stdc++.h>
using namespace std;
long long int memo[100005];
long long int h[100005];
long long int n, k;
long long int call(long long int i) {
if (i < 0)
return 0;
if (i == 0) {
return 0;
}
if (memo[i] != -1)
return memo[i];
if (i > 1 && i <= k) {
return abs(h[i] - h[1]);
}
long long int ans = INT_MAX;
for (long long int j = 1; j <= k; j++) {
ans = min(ans, call(i - j) + abs(h[i] - h[i - j]));
}
memo[i] = ans;
return memo[i];
}
int main() {
cin >> n >> k;
for (long long int i = 1; i <= n; i++) {
cin >> h[i];
}
for (long long int i = 1; i <= n; i++) {
memo[i] = -1;
}
cout << call(n);
return 0;
} | // frog2
#include <bits/stdc++.h>
using namespace std;
long long int memo[100005];
long long int h[100005];
long long int n, k;
long long int call(long long int i) {
if (i < 0)
return 0;
if (i == 0 || i == 1) {
return 0;
}
if (memo[i] != -1)
return memo[i];
if (i > 1 && i <= k) {
return abs(h[i] - h[1]);
}
long long int ans = INT_MAX;
for (long long int j = 1; j <= k; j++) {
ans = min(ans, call(i - j) + abs(h[i] - h[i - j]));
}
memo[i] = ans;
return memo[i];
}
int main() {
cin >> n >> k;
for (long long int i = 1; i <= n; i++) {
cin >> h[i];
}
for (long long int i = 1; i <= n; i++) {
memo[i] = -1;
}
cout << call(n);
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 960,507 | 960,508 | u537207678 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fs first
#define ss second
inline int Scan() {
int x = 0;
int f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
template <typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
// call by reference is used in x
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
//////////////////////////////////////end of
///template//////////////////////////////////////
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
rep(i, 1, n + 1) cin >> a[i];
a[0] = 0;
vector<int> dp(n + 1, 100005);
dp[1] = 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(a[i - j] - a[i]));
}
// cout << dp[i] << endl;
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fs first
#define ss second
inline int Scan() {
int x = 0;
int f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
template <typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
// call by reference is used in x
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
//////////////////////////////////////end of
///template//////////////////////////////////////
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
rep(i, 1, n + 1) cin >> a[i];
a[0] = 0;
vector<int> dp(n + 1, INT_MAX);
dp[1] = 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(a[i - j] - a[i]));
}
// cout << dp[i] << endl;
}
cout << dp[n] << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 960,515 | 960,516 | u157281173 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int ans(vector<int> &v, int n, int i, int k) {
if (i == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int mn = INT_MAX;
for (int j = i - 1; j >= i - k; j--) {
int p = ans(v, n, j, k) + abs(v[j] - v[i]);
mn = min(p, mn);
}
return dp[i] = mn;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < 1000000; i++)
dp[i] = -1;
int a = ans(v, n, n - 1, k);
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int ans(vector<int> &v, int n, int i, int k) {
if (i == 0)
return 0;
if (dp[i] != -1)
return dp[i];
int mn = INT_MAX;
for (int j = i - 1; j >= max(0, i - k); j--) {
int p = ans(v, n, j, k) + abs(v[j] - v[i]);
mn = min(p, mn);
}
return dp[i] = mn;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
for (int i = 0; i < 1000000; i++)
dp[i] = -1;
int a = ans(v, n, n - 1, k);
cout << a;
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 960,517 | 960,518 | u649143883 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
long long n, k, h;
cin >> n >> k;
long long a[n + 1], i, dp[n + 1], j;
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++) {
h = 1e5;
for (j = 1; j <= k && j <= i; j++)
h = min(abs(a[i] - a[i - j]) + dp[i - j], h);
dp[i] = h;
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
long long n, k, h;
cin >> n >> k;
long long a[n + 1], i, dp[n + 1], j;
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++) {
h = 1e10;
for (j = 1; j <= k && j <= i; j++)
h = min(abs(a[i] - a[i - j]) + dp[i - j], h);
dp[i] = h;
}
cout << dp[n - 1];
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 960,519 | 960,520 | u310427537 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
long long n, k, h;
cin >> n >> k;
long long a[n + 1], i, dp[n + 1], j;
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++) {
h = 1e10;
for (j = 1; j <= k; j++)
h = min(abs(a[i] - a[i - j]) + dp[i - j], h);
dp[i] = h;
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
long long n, k, h;
cin >> n >> k;
long long a[n + 1], i, dp[n + 1], j;
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++) {
h = 1e10;
for (j = 1; j <= k && j <= i; j++)
h = min(abs(a[i] - a[i - j]) + dp[i - j], h);
dp[i] = h;
}
cout << dp[n - 1];
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 960,521 | 960,520 | u310427537 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
long long n, k, h;
cin >> n >> k;
long long a[n + 1], i, dp[n + 1], j;
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++) {
h = 1e10;
for (j = 1; j <= k, j <= i; j++)
h = min(abs(a[i] - a[i - k]) + dp[i - k], h);
dp[i] = h;
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
// sort(s.begin(),s.end(),sortbysec);
// s.push_back(make_pair(x,y));
}
int main() {
vector<pair<long long, long long>> ve;
long long n, k, h;
cin >> n >> k;
long long a[n + 1], i, dp[n + 1], j;
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++) {
h = 1e10;
for (j = 1; j <= k && j <= i; j++)
h = min(abs(a[i] - a[i - j]) + dp[i - j], h);
dp[i] = h;
}
cout << dp[n - 1];
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"identifier.change"
] | 960,522 | 960,520 | u310427537 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N];
int a[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i == 1)
continue;
dp[i] = 1e9;
for (int j = i - 1; j >= i - k; j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
printf("%d\n", dp[n]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N];
int a[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i == 1)
continue;
dp[i] = 1e9;
for (int j = i - 1; j >= i - k && j >= 1; 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"
] | 960,523 | 960,524 | u874608540 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = 100020;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = min(min1, d[i + j] + abs(h[i] - h[i + j]));
// cout << "i: " << i<< " j: " << j << " POM1 :" << d[i+j] +
// abs(h[i]-h[i+j]) << endl;
}
return min1;
}
int main() {
int n;
cin >> n >> k;
int h[100020];
for (int i = 0; i < n; i++) {
cin >> h[i];
d[i] = -1;
}
cout << resi(h, 0, n) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = min(min1, d[i + j] + abs(h[i] - h[i + j]));
// cout << "i: " << i<< " j: " << j << " POM1 :" << d[i+j] +
// abs(h[i]-h[i+j]) << endl;
}
return min1;
}
int main() {
int n;
cin >> n >> k;
int h[100020];
for (int i = 0; i < n; i++) {
cin >> h[i];
d[i] = -1;
}
cout << resi(h, 0, n) << endl;
// for(int i = 0; i < n; i ++)
// cout << "d"<< i<< " " << d[i] << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,529 | 960,528 | u295938193 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = 10005;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = min(min1, d[i + j] + abs(h[i] - h[i + j]));
// cout << "i: " << i<< " j: " << j << " POM1 :" << d[i+j] +
// abs(h[i]-h[i+j]) << endl;
}
return d[i] = min1;
}
int main() {
int n;
cin >> n >> k;
int h[100020];
for (int i = 0; i < n; i++) {
cin >> h[i];
d[i] = -1;
}
cout << resi(h, 0, n) << endl;
// for(int i = 0; i < n; i ++)
// cout << "d"<< i<< " " << d[i] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int d[100020];
int k;
int resi(int h[], int i, int n) {
if (i == n - 1)
return 0;
int min1 = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j > n - 1) {
continue;
}
if (d[i + j] == -1) {
d[i + j] = resi(h, i + j, n);
}
min1 = min(min1, d[i + j] + abs(h[i] - h[i + j]));
// cout << "i: " << i<< " j: " << j << " POM1 :" << d[i+j] +
// abs(h[i]-h[i+j]) << endl;
}
return d[i] = min1;
}
int main() {
int n;
cin >> n >> k;
int h[100020];
for (int i = 0; i < n; i++) {
cin >> h[i];
d[i] = -1;
}
cout << resi(h, 0, n) << endl;
// for(int i = 0; i < n; i ++)
// cout << "d"<< i<< " " << d[i] << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,532 | 960,531 | u013064880 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h.at(i);
vector<int> pro(N, 0);
rep(i, N) {
if (i == 0)
continue;
else if (i <= K) {
pro[i] = abs(h[0] - h[i]);
} else if (i > K) {
int prov = 10000100000000000000;
rep2(j, i - K, i) prov = min(prov, pro[j] + abs(h[i] - h[j]));
pro[i] = prov;
}
}
cout << pro[N - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h.at(i);
vector<int> pro(N, 0);
rep(i, N) {
if (i == 0)
continue;
else if (i <= K) {
pro[i] = abs(h[0] - h[i]);
} else if (i > K) {
int prov = 10000100000000;
rep2(j, i - K, i) prov = min(prov, pro[j] + abs(h[i] - h[j]));
pro[i] = prov;
}
}
cout << pro[N - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,533 | 960,534 | u170513117 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
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 B[n];
for (int i = 0; i < n; i++) {
B[i] = INT_MAX;
}
B[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; i++) {
if (j < n) {
B[j] = min(B[j], A[i] + abs(A[i] - A[j]));
}
}
}
cout << B[n - 1] << endl;
} | #include <bits/stdc++.h>
#include <iostream>
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 B[n];
for (int i = 0; i < n; i++) {
B[i] = INT_MAX;
}
B[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
B[j] = min(B[j], B[i] + abs(A[i] - A[j]));
}
}
}
cout << B[n - 1] << endl;
} | [
"identifier.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,543 | 960,544 | u782253358 | cpp |
p03161 | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define EPS 1e-6
#define INF 1000000000
// MAXIMIZAR f(x) == MINIMIZAR -f(x)
#define _ \
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), \
cout.precision(15);
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define FORC(i, a, b) for (int i = int(a); i >= int(b); i--)
#define pb push_back
#define fi first
#define se second
#define debug(x) cout << (#x) << " = " << x << "\n";
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
clock_t t_;
using namespace std;
template <class T> void print(T s) { cout << s << "\n"; }
template <class T> void emax(T &a, T b) { a = (a < b ? b : a); };
template <class T> void emin(T &a, T b) { a = (a > b ? b : a); }
template <class T> void printC(T s) {
for (auto &x : s) {
cout << x << " ";
}
cout << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define maxn 100005
#define mod 1000000007
const int inf = 1e9 + 5;
int main(int argc, const char *argv[]) {
#ifdef input
freopen("input.txt", "r", stdin);
#endif
#ifdef output
freopen("output.txt", "w", stdout);
#endif
t_ = clock();
int n, k;
cin >> n >> k;
vi info(n);
for (auto &i : info) {
cin >> i;
}
vi dp(n + 1, inf);
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(info[i - 1] - info[j - 1]));
}
}
print(dp[n]);
t_ = clock() - t_;
cerr << setprecision(9) << fixed << ((float)t_ / CLOCKS_PER_SEC) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define EPS 1e-6
#define INF 1000000000
// MAXIMIZAR f(x) == MINIMIZAR -f(x)
#define _ \
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), \
cout.precision(15);
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define FORC(i, a, b) for (int i = int(a); i >= int(b); i--)
#define pb push_back
#define fi first
#define se second
#define debug(x) cout << (#x) << " = " << x << "\n";
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
clock_t t_;
using namespace std;
template <class T> void print(T s) { cout << s << "\n"; }
template <class T> void emax(T &a, T b) { a = (a < b ? b : a); };
template <class T> void emin(T &a, T b) { a = (a > b ? b : a); }
template <class T> void printC(T s) {
for (auto &x : s) {
cout << x << " ";
}
cout << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define maxn 100005
#define mod 1000000007
const int inf = 1e9 + 5;
int main(int argc, const char *argv[]) {
#ifdef input
freopen("input.txt", "r", stdin);
#endif
#ifdef output
freopen("output.txt", "w", stdout);
#endif
t_ = clock();
int n, k;
cin >> n >> k;
vi info(n);
for (auto &i : info) {
cin >> i;
}
vi dp(n + 1, inf);
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n && j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(info[i - 1] - info[j - 1]));
}
}
print(dp[n]);
t_ = clock() - t_;
cerr << setprecision(9) << fixed << ((float)t_ / CLOCKS_PER_SEC) << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 960,547 | 960,548 | u077971896 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
using namespace std;
using ll = long long;
constexpr ll INF = 1000000011;
int main() {
int N, K;
int h[100007] = {};
int dp[100007] = {};
int k;
cin >> N >> K;
fill_n(dp, N + 1, INF);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 1; i <= N; i++) {
for (int k = 1; k <= K && i + k <= N; k++) {
dp[i + K] = min(dp[i] + abs(h[i] - h[i + k]), dp[i + k]);
}
}
cout << dp[N] << endl;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <utility>
using namespace std;
using ll = long long;
constexpr ll INF = 1000000011;
int main() {
int N, K;
int h[100007] = {};
ll dp[100007] = {};
int k;
cin >> N >> K;
fill_n(dp, N + 1, INF);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 1; i <= N; i++) {
for (int k = 1; k <= K && i + k <= N; k++) {
dp[i + k] = min(dp[i] + abs(h[i] - h[i + k]), dp[i + k]);
}
}
cout << dp[N] << endl;
} | [
"variable_declaration.type.change",
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 960,552 | 960,553 | u924293285 | cpp |
p03161 | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i < b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pii>
using namespace std;
ll dp[100005];
int main() {
SPEED;
ll n, k, i, s, j;
cin >> n >> k;
ll a[n + 1];
Fr(i, 0, n) { cin >> a[i + 1]; }
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = LONG_MAX;
for (j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i < b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pii>
using namespace std;
ll dp[100005];
int main() {
SPEED;
ll n, k, i, s, j;
cin >> n >> k;
ll a[n + 1];
Fr(i, 0, n) { cin >> a[i + 1]; }
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = LONG_MAX;
for (j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,558 | 960,559 | u016266807 | cpp |
p03161 | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i < b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pii>
using namespace std;
ll dp[100005];
int main() {
SPEED;
ll n, k, i, s, j;
cin >> n >> k;
ll a[n + 1];
Fr(i, 0, n) { cin >> a[i + 1]; }
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i < b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vpii vector<pii>
using namespace std;
ll dp[100005];
int main() {
SPEED;
ll n, k, i, s, j;
cin >> n >> k;
ll a[n + 1];
Fr(i, 0, n) { cin >> a[i + 1]; }
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = LONG_MAX;
for (j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,560 | 960,559 | u016266807 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[114514];
signed main() {
int n, k;
cin >> n >> k;
vector<int> h;
h.pb(0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.pb(x);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int tmp = inf;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
tmp = min(tmp, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = tmp;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[114514];
signed main() {
int n, k;
cin >> n >> k;
vector<int> h;
h.pb(0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
h.pb(x);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int tmp = LINF;
for (int j = 1; j <= k; j++) {
if (i - j <= 0)
continue;
tmp = min(tmp, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = tmp;
}
cout << dp[n] << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,561 | 960,562 | u335590796 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(n, 10000), num(n);
for (int &i : num) {
cin >> i;
}
dp.at(0) = 0;
dp.at(1) = abs(num.at(1) - num.at(0));
for (int i = 2; i < n; ++i) {
for (int j = 1; j <= k && i - j >= 0; ++j) {
dp.at(i) = min(abs(num.at(i) - num.at(i - j)) + dp.at(i - j), dp.at(i));
}
}
cout << dp.back();
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(n, 1e9), num(n);
for (int &i : num) {
cin >> i;
}
dp.at(0) = 0;
dp.at(1) = abs(num.at(1) - num.at(0));
for (int i = 2; i < n; ++i) {
for (int j = 1; j <= k && i - j >= 0; ++j) {
dp.at(i) = min(abs(num.at(i) - num.at(i - j)) + dp.at(i - j), dp.at(i));
}
}
cout << dp.back();
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 960,563 | 960,564 | u161857456 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// cout << << endl;
// cin >> ;
int main() {
ll x = 0, g = 0, n, k, w, l, ans, ptr = 0;
string s, s1, s2;
cin >> n >> k;
VI h(n);
VI dp(n, INF);
dp[0] = 0;
rep(i, n) { cin >> h[i]; }
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < k; j++) {
if (i + j + 1 < n)
dp[i + j + 1] =
min(dp[i + j + 1] + abs(h[i] - h[i + j + 1]), dp[i + j + 1]);
else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// cout << << endl;
// cin >> ;
int main() {
ll x = 0, g = 0, n, k, w, l, ans, ptr = 0;
string s, s1, s2;
cin >> n >> k;
VI h(n);
VI dp(n, INF);
dp[0] = 0;
rep(i, n) { cin >> h[i]; }
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < k; j++) {
if (i + j + 1 < n)
dp[i + j + 1] = min(dp[i] + abs(h[i] - h[i + j + 1]), dp[i + j + 1]);
else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 960,565 | 960,566 | u718774863 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// cout << << endl;
// cin >> ;
int main() {
ll x = 0, g = 0, n, k, w, l, ans, ptr = 0;
string s, s1, s2;
cin >> n >> k;
VI h(n);
VI dp(n, INF);
dp[0] = 0;
rep(i, n) { cin >> h[i]; }
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < k; j++) {
if (i + j + 1 < n)
dp[i + j + 1] =
min(dp[i + j] + abs(h[i] - h[i + j + 1]), dp[i + j + 1]);
else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// cout << << endl;
// cin >> ;
int main() {
ll x = 0, g = 0, n, k, w, l, ans, ptr = 0;
string s, s1, s2;
cin >> n >> k;
VI h(n);
VI dp(n, INF);
dp[0] = 0;
rep(i, n) { cin >> h[i]; }
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < k; j++) {
if (i + j + 1 < n)
dp[i + j + 1] = min(dp[i] + abs(h[i] - h[i + j + 1]), dp[i + j + 1]);
else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 960,567 | 960,566 | u718774863 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> A, int k) {
int n = A.size();
if (n <= 1)
return 0;
if (n == 2)
return abs(A[0] - A[1]);
int dp[n];
memset(dp, 0, sizeof(dp));
dp[n - 1] = 0;
dp[n - 2] = abs(A[n - 1] - A[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int mini = INT_MAX;
for (int j = 1; j <= k && i + j < n; j++) {
mini = min(mini, abs(A[i] - A[i + j] + dp[i + j]));
}
dp[i] = mini;
}
return dp[0];
}
int main() {
int N, k;
cin >> N >> k;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
cout << frog(A, k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> A, int k) {
int n = A.size();
if (n <= 1)
return 0;
if (n == 2)
return abs(A[0] - A[1]);
int dp[n];
memset(dp, 0, sizeof(dp));
dp[n - 1] = 0;
dp[n - 2] = abs(A[n - 1] - A[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int mini = INT_MAX;
for (int j = 1; j <= k && i + j < n; j++) {
mini = min(mini, abs(A[i] - A[i + j]) + dp[i + j]);
}
dp[i] = mini;
}
return dp[0];
}
int main() {
int N, k;
cin >> N >> k;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
cout << frog(A, k);
return 0;
} | [
"call.arguments.change"
] | 960,578 | 960,579 | u487934164 | cpp |
p03161 | #undef __STRICT_ANSI__
#include <bits/stdc++.h>
using namespace std;
int pd[100001], n, v[100001], k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> v[i];
pd[1] = 0;
for (int i = 2; i <= n; i++) {
pd[i] = INT_MAX;
for (int j = 1; j <= k; j++)
pd[i] = min(pd[i], pd[i - j] + abs(v[i - j] - v[i]));
}
cout << pd[n];
return 0;
}
| #undef __STRICT_ANSI__
#include <bits/stdc++.h>
using namespace std;
int pd[100001], n, v[100001], k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> v[i];
pd[1] = 0;
for (int i = 2; i <= n; i++) {
pd[i] = INT_MAX;
for (int j = 1; j <= k; j++)
if (i > j)
pd[i] = min(pd[i], pd[i - j] + abs(v[i - j] - v[i]));
}
cout << pd[n];
return 0;
}
| [
"control_flow.branch.if.add"
] | 960,580 | 960,581 | u909915106 | cpp |
p03161 | #include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define ii pair<int, int>
#define MAX int(1e5) + 5
#define qi queue<int>
#define si stack<int>
#define mii map<int, int>
#define msi map<string, int>
#define fr first
#define sc second
#define all(x) x.begin(), x.end()
using namespace std;
int n, arr[MAX], dp[MAX], k;
const int INF = 1e9 + 5;
int main(int argc, char **argv) {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = INF;
}
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], dp[i] + abs(arr[i] - arr[j]));
}
cout << dp[n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define ii pair<int, int>
#define MAX int(1e5) + 5
#define qi queue<int>
#define si stack<int>
#define mii map<int, int>
#define msi map<string, int>
#define fr first
#define sc second
#define all(x) x.begin(), x.end()
using namespace std;
int n, arr[MAX], dp[MAX], k;
const int INF = 1e9 + 5;
int main(int argc, char **argv) {
ios::sync_with_stdio(0);
cin.tie(0);
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = 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(arr[i] - arr[j]));
}
cout << dp[n - 1] << '\n';
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 960,586 | 960,587 | u210781861 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1000000;
for (int j = min(i, k); j > 0; j--)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[j]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1000000000;
for (int j = min(i, k); j > 0; j--)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
// cout<<dp[i]<<" ";
}
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,590 | 960,589 | u700279502 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
ll score[n + k];
rep(i, n + k) score[i] = pow(10, 5);
score[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
score[i + j] = min(score[i + j], score[i] + abs(h[i] - h[i + j]));
}
}
cout << score[n - 1];
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
ll score[n + k];
rep(i, n + k) score[i] = pow(10, 10);
score[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
score[i + j] = min(score[i + j], score[i] + abs(h[i] - h[i + j]));
}
}
cout << score[n - 1];
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 960,601 | 960,602 | u233107306 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define traceloop(x, a) \
{ \
for (ll i = 0; i < x; i++) \
cerr << a[i] << " "; \
cerr << endl; \
}
ll ab(ll x) { return x > 0LL ? x : -x; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n, 99999);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = i - 1; j >= max(0LL, i - k); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define traceloop(x, a) \
{ \
for (ll i = 0; i < x; i++) \
cerr << a[i] << " "; \
cerr << endl; \
}
ll ab(ll x) { return x > 0LL ? x : -x; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = i - 1; j >= max(0LL, i - k); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n - 1];
return 0;
}
| [
"call.arguments.change"
] | 960,613 | 960,614 | u460103207 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define traceloop(x, a) \
{ \
for (ll i = 0; i < x; i++) \
cerr << a[i] << " "; \
cerr << endl; \
}
ll ab(ll x) { return x > 0LL ? x : -x; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n, 99999);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= max(0LL, i - k); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define traceloop(x, a) \
{ \
for (ll i = 0; i < x; i++) \
cerr << a[i] << " "; \
cerr << endl; \
}
ll ab(ll x) { return x > 0LL ? x : -x; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = i - 1; j >= max(0LL, i - k); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n - 1];
return 0;
}
| [
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 960,615 | 960,614 | u460103207 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define traceloop(x, a) \
{ \
for (ll i = 0; i < x; i++) \
cerr << a[i] << " "; \
cerr << endl; \
}
ll ab(ll x) { return x > 0LL ? x : -x; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n, 99999);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + k; j++)
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define pii pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define traceloop(x, a) \
{ \
for (ll i = 0; i < x; i++) \
cerr << a[i] << " "; \
cerr << endl; \
}
ll ab(ll x) { return x > 0LL ? x : -x; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + k; j++)
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
cout << dp[n - 1];
return 0;
}
| [
"call.arguments.change"
] | 960,616 | 960,617 | u460103207 | cpp |
p03161 | // Author - Sumit
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ps push
#define pb push_back
#define INF 100005
#define MOD 1000000007
#define mp make_pair
#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 all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define itr ::iterator it
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
void solve() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, 0, n) cin >> a[i];
int ar[n];
// memset(ar,INF,sizeof(ar));
ar[0] = 0;
ar[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
// ar[i] = min(ar[i-1]+abs(a[i]-a[i-1]),ar[i-2]+abs(a[i]-a[i-2]));
ar[i] = INF;
rep(j, 1, k + 1) {
if ((i - j) >= 0) {
// cout<<(i-j)<<" ";
ar[i] = min(ar[i], ar[i - j] + abs(a[i] - a[i - j]));
}
}
}
// cout<<endl;
// for(auto x:ar){
// cout<<x<<" ";
// }cout<<endl;
debug(ar[n - 1]);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
WL(t) { solve(); }
} | // Author - Sumit
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ps push
#define pb push_back
#define INF 1000000005
#define MOD 1000000007
#define mp make_pair
#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 all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define itr ::iterator it
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
void solve() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, 0, n) cin >> a[i];
int ar[n];
// memset(ar,INF,sizeof(ar));
ar[0] = 0;
ar[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
// ar[i] = min(ar[i-1]+abs(a[i]-a[i-1]),ar[i-2]+abs(a[i]-a[i-2]));
ar[i] = INF;
rep(j, 1, k + 1) {
if ((i - j) >= 0) {
// cout<<(i-j)<<" ";
ar[i] = min(ar[i], ar[i - j] + abs(a[i] - a[i - j]));
}
}
}
// cout<<endl;
// for(auto x:ar){
// cout<<x<<" ";
// }cout<<endl;
debug(ar[n - 1]);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
WL(t) { solve(); }
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 960,627 | 960,626 | u734641744 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[1] - h[0]);
int bot = max(0, i - K);
for (int j = i - 2; j >= bot; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[N - 1];
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
int bot = max(0, i - K);
for (int j = i - 2; j >= bot; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[N - 1];
return 0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 960,628 | 960,629 | u387888262 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[1] - h[0]);
int bot = max(0, i - K);
for (int j = i - 2; j >= bot; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[N - 1];
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 0);
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
int bot = max(0, i - K);
for (int j = i - 2; j >= bot; j--) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[N - 1];
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 960,630 | 960,629 | u387888262 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int f[101000];
int h[101000];
int main() {
scanf("%d%d", &n, &k);
for (int i = k + 1; i <= k + n; i++) {
scanf("%d", &h[i]);
f[i] = 10000;
}
f[k + 1] = 0;
for (int i = k + 2; i <= k + n; i++)
for (int j = 1; j <= k; j++)
if (i - j >= k + 1)
f[i] = min(f[i], f[i - j] + abs(h[i] - h[i - j]));
printf("%d", f[k + n]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
int f[101000];
int h[101000];
int main() {
scanf("%d%d", &n, &k);
for (int i = k + 1; i <= k + n; i++) {
scanf("%d", &h[i]);
f[i] = 2e9;
}
f[k + 1] = 0;
for (int i = k + 2; i <= k + n; i++)
for (int j = 1; j <= k; j++)
if (i - j >= k + 1)
f[i] = min(f[i], f[i - j] + abs(h[i] - h[i - j]));
printf("%d", f[k + n]);
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 960,635 | 960,636 | u402724915 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, k;
cin >> n >> k;
int f[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
f[i] = INT_MAX;
}
f[0] = 0;
f[1] = abs(h[0] - h[1]);
f[2] = f[1] + abs(h[1] - h[2]);
if (k != 1)
f[2] = min(abs(h[0] - h[2]), f[1] + abs(h[1] - h[2]));
for (i = 3; i < n; i++) {
for (j = i - 1; j >= i - k && i >= 0; j--)
f[i] = min(f[i], f[j] + abs(h[i] - h[j]));
}
cout << f[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, k;
cin >> n >> k;
int f[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
f[i] = INT_MAX;
}
f[0] = 0;
f[1] = abs(h[0] - h[1]);
f[2] = f[1] + abs(h[1] - h[2]);
if (k != 1)
f[2] = min(abs(h[0] - h[2]), f[1] + abs(h[1] - h[2]));
for (i = 3; i < n; i++) {
for (j = i - 1; j >= i - k && j >= 0; j--) {
f[i] = min(f[i], f[j] + abs(h[i] - h[j]));
// cout<<j<<" ";
}
}
cout << f[n - 1];
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 960,644 | 960,645 | u818660467 | cpp |
p03161 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j < n; j++) {
b[i] = min(b[i], b[i - j] + abs(a[i - j] - a[i]));
}
}
cout << b[n];
return 0;
} | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j != i; j++) {
b[i] = min(b[i], b[i - j] + abs(a[i - j] - a[i]));
}
}
cout << b[n];
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 960,646 | 960,647 | u798562499 | cpp |
p03161 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j <= n; j++) {
b[i] = min(b[i], b[i - j] + abs(a[i - j] - a[i]));
}
}
cout << b[n];
return 0;
} | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int a[100005], b[100005];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
b[0] = b[1] = 0;
for (int i = 2; i <= n; i++) {
b[i] = INT_MAX;
for (int j = 1; j <= m && j != i; j++) {
b[i] = min(b[i], b[i - j] + abs(a[i - j] - a[i]));
}
}
cout << b[n];
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 960,648 | 960,647 | u798562499 | cpp |
p03161 | #include <bits/stdc++.h>
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define setDP(arr) memset(arr, -1, sizeof arr)
#define Clear(arr) memset(arr, 0, sizeof arr)
#define li(x) x.size() - 1
#define oo 1000000000
#define inf 1000000000000000000
#define M 1000000007
#define M2 1000000009
#define pii pair<ll, ll>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
const int SQRTN = 320;
const int LOGN = 20;
const double PI = acos(-1);
int n, k = 3;
int a[N];
int dp[N];
int main() {
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = oo;
for (int j = 1; j < k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define setDP(arr) memset(arr, -1, sizeof arr)
#define Clear(arr) memset(arr, 0, sizeof arr)
#define li(x) x.size() - 1
#define oo 1000000000
#define inf 1000000000000000000
#define M 1000000007
#define M2 1000000009
#define pii pair<ll, ll>
using namespace std;
typedef long long ll;
const int N = 2e5 + 100;
const int SQRTN = 320;
const int LOGN = 20;
const double PI = acos(-1);
int n, k = 3;
int a[N];
int dp[N];
int main() {
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = oo;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,655 | 960,656 | u129986190 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mx = 1000010;
long long a[mx], cost[mx], h[mx], f = 1e18 + 10;
main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cost[1] = 0;
for (int i = 2; i <= n; i++) {
cost[i] = f;
for (int j = k; j >= 1; j--) {
if (i - j > 0) {
cost[i] = min(cost[i], abs(h[i] - h[i - j]) + cost[i - j]);
}
}
}
cout << cost[n] << f;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int mx = 1000010;
long long a[mx], cost[mx], h[mx], f = 1e18 + 10;
main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cost[1] = 0;
for (int i = 2; i <= n; i++) {
cost[i] = f;
for (int j = k; j >= 1; j--) {
if (i - j > 0) {
cost[i] = min(cost[i], abs(h[i] - h[i - j]) + cost[i - j]);
}
}
}
cout << cost[n];
return 0;
}
| [
"expression.operation.binary.remove"
] | 960,683 | 960,684 | u298620601 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int k;
int h[100005];
int dp[100005] = {};
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
int minimum = 100000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
minimum = min(minimum, dp[i - j] + abs(h[i - j] - h[i]));
}
dp[i] = minimum;
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int k;
int h[100005];
int dp[100005] = {};
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
int minimum = 1000000000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
minimum = min(minimum, dp[i - j] + abs(h[i - j] - h[i]));
}
dp[i] = minimum;
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 960,700 | 960,699 | u317976413 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int h[100005] = {};
int dp[100005] = {};
int until;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
until = 1;
for (int i = 2; i < n; i++) {
until = 1;
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 2; j <= k; j++) {
if (i - j < 0)
break;
if (abs(h[i] - h[i - j] + dp[i - j]) <
abs(h[i] - h[i - until]) + dp[i - until]) {
dp[i] = abs(h[i] - h[i - j]) + dp[i - j];
until = j;
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int h[100005] = {};
int dp[100005] = {};
int until;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
until = 1;
for (int i = 2; i < n; i++) {
until = 1;
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 2; j <= k; j++) {
if (i - j < 0)
break;
if (abs(h[i] - h[i - j]) + dp[i - j] <
abs(h[i] - h[i - until]) + dp[i - until]) {
dp[i] = abs(h[i] - h[i - j]) + dp[i - j];
until = j;
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 960,701 | 960,702 | u935028161 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int k;
int h[100010];
long long dp[100010];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - k]));
}
/*
if(i >= 2){
dp[i] = min(dp[i],dp[i-2] + abs(h[i] - h[i-2]));
}
*/
}
cout << dp[n - 1] << "\n";
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int k;
int h[100010];
long long dp[100010];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
/*
if(i >= 2){
dp[i] = min(dp[i],dp[i-2] + abs(h[i] - h[i-2]));
}
*/
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,703 | 960,704 | u809287016 | cpp |
p03161 | // Author - Saikat_7
#include <bits/stdc++.h>
using namespace std;
#define fl(i, a, b) for (int i = a; i < b; i++)
#define trav(i, cont) for (const auto &i : cont)
#define cs(x) cout << x << " "
#define cn(x) cout << x << " " << endl
#define ll long long int
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007 // 998244353
#define inf 1e17
const int mx = 2000005; // 2* (10 to power 5);
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
// cin>>tc;
while (tc-- > 0) {
int n, k;
cin >> n >> k;
ll dp[n + 1] = {0}, arr[n + 1] = {0};
for (int i = 1; i <= n; i++) {
cin >> arr[i];
// cout<<arr[i];
}
dp[0] = 0;
dp[1] = 0;
// cout<<dp[2];
// dp[2]=abs(arr[2]-arr[1]);
for (int i = 2; i <= n; i++) {
ll max1 = 100000;
for (int j = max(1, i - k); j < i; j++) {
max1 = min(max1, dp[j] + abs(arr[i] - arr[j]));
}
dp[i] = max1;
// cout<<dp[i]<<endl;
}
cout << dp[n];
}
return 0;
} | // Author - Saikat_7
#include <bits/stdc++.h>
using namespace std;
#define fl(i, a, b) for (int i = a; i < b; i++)
#define trav(i, cont) for (const auto &i : cont)
#define cs(x) cout << x << " "
#define cn(x) cout << x << " " << endl
#define ll long long int
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007 // 998244353
#define inf 1e17
const int mx = 2000005; // 2* (10 to power 5);
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int tc = 1;
// cin>>tc;
while (tc-- > 0) {
int n, k;
cin >> n >> k;
ll dp[n + 1] = {0}, arr[n + 1] = {0};
for (int i = 1; i <= n; i++) {
cin >> arr[i];
// cout<<arr[i];
}
dp[0] = 0;
dp[1] = 0;
// cout<<dp[2];
// dp[2]=abs(arr[2]-arr[1]);
for (int i = 2; i <= n; i++) {
ll max1 = inf;
for (int j = max(1, i - k); j < i; j++) {
max1 = min(max1, dp[j] + abs(arr[i] - arr[j]));
}
dp[i] = max1;
// cout<<dp[i]<<endl;
}
cout << dp[n];
}
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,705 | 960,706 | u426260736 | cpp |
p03161 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> d(n, 1e+9);
d[0] = 0;
d[1] = abs(h[0] - h[1]);
rep2(i, 2, n) {
int start = max(0, i - k);
rep2(j, start, i - 1) { d[i] = min(abs(h[i] - h[j]) + d[j], d[i]); }
}
cout << d[n - 1] << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define PI acos(-1);
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> d(n, 1e+9);
d[0] = 0;
d[1] = abs(h[0] - h[1]);
rep2(i, 2, n) {
int start = max(0, i - k);
rep2(j, start, i) { d[i] = min(abs(h[i] - h[j]) + d[j], d[i]); }
}
cout << d[n - 1] << endl;
} | [
"expression.operation.binary.remove"
] | 960,707 | 960,708 | u661738979 | 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 mod 1000000007
#define mod1 998244353
#define lli long long int
#define plli pair<lli, lli>
#define REP(i, a, b) for (lli i = a; i < b; i++)
#define REPI(i, a, b) for (lli i = b - 1; i >= a; i--)
#define F first
#define S second
#define PB push_back
#define DB pop_back
#define MP make_pair
#define MT make_tuple
#define G(a, b) get<a>(b)
typedef vector<plli> vii; // three data type shortcuts. They may look cryptic
typedef vector<lli> vi;
#define o_set \
tree<int, nulli_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setlli \
tree<lli, nulli_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
lli modI(lli a, lli m);
lli gcd(lli a, lli b);
lli powM(lli x, unsigned lli y, unsigned lli m);
void pairsort(int a[], int b[], int n);
void pairsortlli(lli a[], lli b[], lli n);
lli logint(lli x, lli y);
void Miden(lli **p1, lli n);
void Mmult(lli **p1, lli **p2, lli **ans, lli x, lli y, lli z, lli m);
void Mpow(lli **p1, lli **ans, lli n, lli y, lli m);
plli Egcd(lli x, lli y);
#define LSOne(S) (S & (-S))
class SegmentTree { // the segment tree is stored like a heap array
private:
vector<lli> st;
string A; // recall that vi is: typedef vector<int> vi;
lli n;
lli left(lli p) { return (p << 1) + 1; } // same as binary heap operations
lli right(lli p) { return (p << 1) + 2; }
void build(lli p, lli L, lli R) { // O(n log n)
if (L == R) // as L == R, either one is fine
st[p] = 1; // store the index
else { // recursively compute the values
build(left(p), L, (L + R) / 2);
build(right(p), (L + R) / 2 + 1, R);
lli p1 = st[left(p)], p2 = st[right(p)];
st[p] = (A[p1] <= A[p2]) ? p1 : p2;
}
}
lli rmq(lli p, lli L, lli R, lli i, lli j) { // O(log n)
if (i > R || j < L)
return -1; // current segment outside query range
if (L >= i && R <= j)
return st[p]; // inside query range
// compute the min position in the left and right part of the interval
lli p1 = rmq(left(p), L, (L + R) / 2, i, j);
lli p2 = rmq(right(p), (L + R) / 2 + 1, R, i, j);
if (p1 == -1)
return p2; // if we try to access segment outside query
if (p2 == -1)
return p1; // same as above
return (A[p1] <= A[p2]) ? p1 : p2;
} // as as in build routine
lli update_point(lli p, lli L, lli R, lli idx, lli new_value) {
// this update code is still preliminary, i == j
// must be able to update range in the future!
lli i = idx, j = idx;
// if the current interval does not intersect
// the update interval, return this st node value!
if (i > R || j < L)
return st[p];
// if the current interval is included in the update range,
// update that st[node]
if (L == i && R == j) {
A[i] = new_value; // update the underlying array
return st[p] = L; // this index
}
// compute the minimum position in the
// left and right part of the interval
lli p1, p2;
p1 = update_point(left(p), L, (L + R) / 2, idx, new_value);
p2 = update_point(right(p), (L + R) / 2 + 1, R, idx, new_value);
// return the position where the overall minimum is
return st[p] = (A[p1] <= A[p2]) ? p1 : p2;
}
public:
SegmentTree(string _A) {
A = _A;
n = (lli)A.length(); // copy content for local usage
st.assign(4 * n, 0); // create large enough vector of zeroes
build(0, 0, n - 1); // recursive build
}
lli rmq(lli i, lli j) { return rmq(0, 0, n - 1, i, j); } // overloading
lli update_point(lli idx, lli new_value) {
return update_point(0, 0, n - 1, idx, new_value);
}
};
class FenwickTree {
private:
vector<lli> ft;
public:
FenwickTree() {}
// initialization: n + 1 zeroes, ignore index 0
FenwickTree(lli n) { ft.assign(n + 1, 0); }
lli rsq(lli b) { // returns RSQ(1, b)
lli sum = 0;
for (; b; b -= LSOne(b))
sum += ft[b];
return sum;
}
lli rsq(lli a, lli b) { // returns RSQ(a, b)
return rsq(b) - (a == 1 ? 0 : rsq(a - 1));
}
// adjusts value of the k-th element by v (v can be +ve/inc or -ve/dec)
void adjust(lli k, lli v) { // note: n = ft.size() - 1
for (; k < (lli)ft.size(); k += LSOne(k))
ft[k] += v;
}
};
class UnionFind { // OOP style
public:
vector<lli> p, rank, setSize; // remember: vi is vector<int>
lli numSets;
UnionFind(lli N) {
setSize.assign(N, 1);
numSets = N;
rank.assign(N, 0);
p.assign(N, 0);
for (lli i = 0; i < N; i++)
p[i] = i;
}
lli findSet(lli i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); }
bool isSameSet(lli i, lli j) { return findSet(i) == findSet(j); }
void unionSet(lli i, lli j) {
if (!isSameSet(i, j)) {
numSets--;
lli x = findSet(i), y = findSet(j);
// rank is used to keep the tree short
if (rank[x] > rank[y]) {
p[y] = x;
setSize[x] += setSize[y];
} else {
p[x] = y;
setSize[y] += setSize[x];
if (rank[x] == rank[y])
rank[y]++;
}
}
}
lli numDisjointSets() { return numSets; }
lli sizeOfSet(lli i) { return setSize[findSet(i)]; }
};
lli gcd(lli x, lli y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
plli Egcd(lli x, lli y) {
if (x == 0)
return MP(0, 1);
plli t = Egcd(y % x, x);
return MP(t.S - t.F * (y / x), t.F);
}
lli pow(lli x, lli y, lli m) {
if (y == 0)
return 1;
lli p = pow(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
lli modI(lli a, lli m) {
lli m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
lli q = a / m;
lli t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
void pairsort(int a[], int b[], int n) {
pair<int, int> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
void pairsortlli(lli a[], lli b[], lli n) {
pair<lli, lli> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
lli logint(lli x, lli y) {
lli ans = 0;
lli a = 1;
for (lli i = 0; i <= x; i++) {
if (x < a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
void Miden(lli **p1, lli n) {
lli(*x)[n] = (lli(*)[n])p1;
REP(i, 0, n) {
REP(j, 0, n) { x[i][j] = 0; }
x[i][i] = 1;
}
return;
}
void Mmult(lli **p1, lli **p2, lli **ans, lli x, lli y, lli z, lli m) {
lli(*a)[y] = (lli(*)[y])p1;
lli(*b)[z] = (lli(*)[z])p2;
lli(*c)[z] = (lli(*)[z])ans;
REP(i, 0, x) {
REP(j, 0, z) {
c[i][j] = 0;
REP(k, 0, y) {
c[i][j] += a[i][k] * b[k][j];
c[i][j] %= m;
}
}
}
return;
}
void Mpow(lli **p1, lli **ans, lli n, lli y, lli m) {
if (y == 0) {
Miden(ans, n);
return;
}
lli t[n][n];
Mpow(p1, (lli **)t, n, y / 2, m);
lli z[n][n];
Mmult((lli **)t, (lli **)t, (lli **)z, n, n, n, m);
if (y % 2) {
Mmult((lli **)z, p1, ans, n, n, n, m);
} else {
Miden((lli **)t, n);
Mmult((lli **)z, (lli **)t, ans, n, n, n, m);
}
return;
}
int main() {
lli n, k;
cin >> n >> k;
lli a[n];
REP(i, 0, n)
cin >> a[i];
lli dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
REP(i, 2, n) {
dp[i] = abs(a[i] - a[i - 1]) + dp[i - 1];
lli p = max(0, (int)(i - k));
REP(j, p, i - 2)
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
cout << dp[n - 1] << endl;
}
| #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 mod 1000000007
#define mod1 998244353
#define lli long long int
#define plli pair<lli, lli>
#define REP(i, a, b) for (lli i = a; i < b; i++)
#define REPI(i, a, b) for (lli i = b - 1; i >= a; i--)
#define F first
#define S second
#define PB push_back
#define DB pop_back
#define MP make_pair
#define MT make_tuple
#define G(a, b) get<a>(b)
typedef vector<plli> vii; // three data type shortcuts. They may look cryptic
typedef vector<lli> vi;
#define o_set \
tree<int, nulli_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setlli \
tree<lli, nulli_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
lli modI(lli a, lli m);
lli gcd(lli a, lli b);
lli powM(lli x, unsigned lli y, unsigned lli m);
void pairsort(int a[], int b[], int n);
void pairsortlli(lli a[], lli b[], lli n);
lli logint(lli x, lli y);
void Miden(lli **p1, lli n);
void Mmult(lli **p1, lli **p2, lli **ans, lli x, lli y, lli z, lli m);
void Mpow(lli **p1, lli **ans, lli n, lli y, lli m);
plli Egcd(lli x, lli y);
#define LSOne(S) (S & (-S))
class SegmentTree { // the segment tree is stored like a heap array
private:
vector<lli> st;
string A; // recall that vi is: typedef vector<int> vi;
lli n;
lli left(lli p) { return (p << 1) + 1; } // same as binary heap operations
lli right(lli p) { return (p << 1) + 2; }
void build(lli p, lli L, lli R) { // O(n log n)
if (L == R) // as L == R, either one is fine
st[p] = 1; // store the index
else { // recursively compute the values
build(left(p), L, (L + R) / 2);
build(right(p), (L + R) / 2 + 1, R);
lli p1 = st[left(p)], p2 = st[right(p)];
st[p] = (A[p1] <= A[p2]) ? p1 : p2;
}
}
lli rmq(lli p, lli L, lli R, lli i, lli j) { // O(log n)
if (i > R || j < L)
return -1; // current segment outside query range
if (L >= i && R <= j)
return st[p]; // inside query range
// compute the min position in the left and right part of the interval
lli p1 = rmq(left(p), L, (L + R) / 2, i, j);
lli p2 = rmq(right(p), (L + R) / 2 + 1, R, i, j);
if (p1 == -1)
return p2; // if we try to access segment outside query
if (p2 == -1)
return p1; // same as above
return (A[p1] <= A[p2]) ? p1 : p2;
} // as as in build routine
lli update_point(lli p, lli L, lli R, lli idx, lli new_value) {
// this update code is still preliminary, i == j
// must be able to update range in the future!
lli i = idx, j = idx;
// if the current interval does not intersect
// the update interval, return this st node value!
if (i > R || j < L)
return st[p];
// if the current interval is included in the update range,
// update that st[node]
if (L == i && R == j) {
A[i] = new_value; // update the underlying array
return st[p] = L; // this index
}
// compute the minimum position in the
// left and right part of the interval
lli p1, p2;
p1 = update_point(left(p), L, (L + R) / 2, idx, new_value);
p2 = update_point(right(p), (L + R) / 2 + 1, R, idx, new_value);
// return the position where the overall minimum is
return st[p] = (A[p1] <= A[p2]) ? p1 : p2;
}
public:
SegmentTree(string _A) {
A = _A;
n = (lli)A.length(); // copy content for local usage
st.assign(4 * n, 0); // create large enough vector of zeroes
build(0, 0, n - 1); // recursive build
}
lli rmq(lli i, lli j) { return rmq(0, 0, n - 1, i, j); } // overloading
lli update_point(lli idx, lli new_value) {
return update_point(0, 0, n - 1, idx, new_value);
}
};
class FenwickTree {
private:
vector<lli> ft;
public:
FenwickTree() {}
// initialization: n + 1 zeroes, ignore index 0
FenwickTree(lli n) { ft.assign(n + 1, 0); }
lli rsq(lli b) { // returns RSQ(1, b)
lli sum = 0;
for (; b; b -= LSOne(b))
sum += ft[b];
return sum;
}
lli rsq(lli a, lli b) { // returns RSQ(a, b)
return rsq(b) - (a == 1 ? 0 : rsq(a - 1));
}
// adjusts value of the k-th element by v (v can be +ve/inc or -ve/dec)
void adjust(lli k, lli v) { // note: n = ft.size() - 1
for (; k < (lli)ft.size(); k += LSOne(k))
ft[k] += v;
}
};
class UnionFind { // OOP style
public:
vector<lli> p, rank, setSize; // remember: vi is vector<int>
lli numSets;
UnionFind(lli N) {
setSize.assign(N, 1);
numSets = N;
rank.assign(N, 0);
p.assign(N, 0);
for (lli i = 0; i < N; i++)
p[i] = i;
}
lli findSet(lli i) { return (p[i] == i) ? i : (p[i] = findSet(p[i])); }
bool isSameSet(lli i, lli j) { return findSet(i) == findSet(j); }
void unionSet(lli i, lli j) {
if (!isSameSet(i, j)) {
numSets--;
lli x = findSet(i), y = findSet(j);
// rank is used to keep the tree short
if (rank[x] > rank[y]) {
p[y] = x;
setSize[x] += setSize[y];
} else {
p[x] = y;
setSize[y] += setSize[x];
if (rank[x] == rank[y])
rank[y]++;
}
}
}
lli numDisjointSets() { return numSets; }
lli sizeOfSet(lli i) { return setSize[findSet(i)]; }
};
lli gcd(lli x, lli y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
plli Egcd(lli x, lli y) {
if (x == 0)
return MP(0, 1);
plli t = Egcd(y % x, x);
return MP(t.S - t.F * (y / x), t.F);
}
lli pow(lli x, lli y, lli m) {
if (y == 0)
return 1;
lli p = pow(x, y / 2, m) % m;
p = (p * p) % m;
return (y % 2 == 0) ? p : (x * p) % m;
}
lli modI(lli a, lli m) {
lli m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
lli q = a / m;
lli t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
void pairsort(int a[], int b[], int n) {
pair<int, int> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
void pairsortlli(lli a[], lli b[], lli n) {
pair<lli, lli> v[n];
REP(i, 0, n) {
v[i].F = a[i];
v[i].S = b[i];
}
sort(v, v + n);
REP(i, 0, n) {
a[i] = v[i].F;
b[i] = v[i].S;
}
}
lli logint(lli x, lli y) {
lli ans = 0;
lli a = 1;
for (lli i = 0; i <= x; i++) {
if (x < a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
void Miden(lli **p1, lli n) {
lli(*x)[n] = (lli(*)[n])p1;
REP(i, 0, n) {
REP(j, 0, n) { x[i][j] = 0; }
x[i][i] = 1;
}
return;
}
void Mmult(lli **p1, lli **p2, lli **ans, lli x, lli y, lli z, lli m) {
lli(*a)[y] = (lli(*)[y])p1;
lli(*b)[z] = (lli(*)[z])p2;
lli(*c)[z] = (lli(*)[z])ans;
REP(i, 0, x) {
REP(j, 0, z) {
c[i][j] = 0;
REP(k, 0, y) {
c[i][j] += a[i][k] * b[k][j];
c[i][j] %= m;
}
}
}
return;
}
void Mpow(lli **p1, lli **ans, lli n, lli y, lli m) {
if (y == 0) {
Miden(ans, n);
return;
}
lli t[n][n];
Mpow(p1, (lli **)t, n, y / 2, m);
lli z[n][n];
Mmult((lli **)t, (lli **)t, (lli **)z, n, n, n, m);
if (y % 2) {
Mmult((lli **)z, p1, ans, n, n, n, m);
} else {
Miden((lli **)t, n);
Mmult((lli **)z, (lli **)t, ans, n, n, n, m);
}
return;
}
int main() {
lli n, k;
cin >> n >> k;
lli a[n];
REP(i, 0, n)
cin >> a[i];
lli dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
REP(i, 2, n) {
dp[i] = abs(a[i] - a[i - 1]) + dp[i - 1];
lli p = max(0, (int)(i - k));
REP(j, p, i - 1)
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,709 | 960,710 | u194447791 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(v) \
SORT(v); \
(v).erase(unique((v).begin(), (v).end()), (v).end())
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 1e9 + 7;
const ll INF = 1LL << 60;
//ここから書き始める
int main() {
cout << setprecision(10);
int n, k, A[100000];
cin >> n >> k;
rep(i, n) cin >> A[i];
vector<ll> dp(n, INF);
dp[0] = 0;
For(i, 1, n) {
For(j, k + 1, j++) {
if (i - j >= 0) {
chmin(dp[i], dp[i - j] + abs(A[i] - A[i - j]));
}
}
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(v) \
SORT(v); \
(v).erase(unique((v).begin(), (v).end()), (v).end())
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 1e9 + 7;
const ll INF = 1LL << 60;
//ここから書き始める
int main() {
cout << setprecision(10);
int n, k, A[100000];
cin >> n >> k;
rep(i, n) cin >> A[i];
vector<ll> dp(n, INF);
dp[0] = 0;
For(i, 1, n) {
For(j, 1, k + 1) {
if (i - j >= 0) {
chmin(dp[i], dp[i - j] + abs(A[i] - A[i - j]));
}
}
}
cout << dp[n - 1] << endl;
}
| [
"call.arguments.add",
"call.arguments.change"
] | 960,711 | 960,712 | u298620933 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(v) \
SORT(v); \
(v).erase(unique((v).begin(), (v).end()), (v).end())
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 1e9 + 7;
const ll INF = 1LL << 60;
//ここから書き始める
int main() {
cout << setprecision(10);
ll n, k;
cin >> n >> k;
vector<ll> h(110010);
rep(i, n) cin >> h[i];
vector<ll> dp(110010, INF);
dp[0] = 0;
rep(i, n) {
For(j, 1, k) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(v) \
SORT(v); \
(v).erase(unique((v).begin(), (v).end()), (v).end())
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 1e9 + 7;
const ll INF = 1LL << 60;
//ここから書き始める
int main() {
cout << setprecision(10);
ll n, k;
cin >> n >> k;
vector<ll> h(110010);
rep(i, n) cin >> h[i];
vector<ll> dp(110010, INF);
dp[0] = 0;
rep(i, n) {
For(j, 1, k + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[n - 1] << endl;
}
| [
"expression.operation.binary.add"
] | 960,713 | 960,714 | u298620933 | cpp |
p03161 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long n, a[1000005], f[1000005], k;
int main() {
cin >> n >> k;
for (long i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[1] - a[2]);
for (long i = 3; i <= n; i++) {
f[i] = 99999;
for (long j = 1; j <= k; j++) {
if (i - j <= 0)
break;
f[i] = min(f[i], f[i - j] + abs(a[i] - a[i - j]));
}
}
cout << f[n];
return 0;
}
| #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long n, a[1000005], f[1000005], k;
int main() {
cin >> n >> k;
for (long i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
f[2] = abs(a[1] - a[2]);
for (long i = 3; i <= n; i++) {
f[i] = 9999999999;
for (long j = 1; j <= k; j++) {
if (i - j <= 0)
break;
f[i] = min(f[i], f[i - j] + abs(a[i] - a[i - j]));
}
}
cout << f[n];
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 960,717 | 960,716 | u777021364 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 100000;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
if (i - j - 1 < 0)
continue;
ll c;
c = a[i] - a[i - j - 1];
if (c < 0)
c = -c;
b[i] = min(b[i - j - 1] + c, b[i]);
}
}
cout << b[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 1e9 + 5;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
if (i - j - 1 < 0)
continue;
ll c;
c = a[i] - a[i - j - 1];
if (c < 0)
c = -c;
b[i] = min(b[i - j - 1] + c, b[i]);
}
}
cout << b[n - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,719 | 960,720 | u330689597 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 10005;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
if (i - j - 1 < 0)
continue;
ll c;
c = a[i] - a[i - j - 1];
if (c < 0)
c = -c;
b[i] = min(b[i - j - 1] + c, b[i]);
}
}
cout << b[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll b[n];
for (ll i = 0; i < n; i++)
b[i] = 1e9 + 5;
b[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < k; j++) {
if (i - j - 1 < 0)
continue;
ll c;
c = a[i] - a[i - j - 1];
if (c < 0)
c = -c;
b[i] = min(b[i - j - 1] + c, b[i]);
}
}
cout << b[n - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,721 | 960,720 | u330689597 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long ar[n + 1] = {0};
long long arr[n + 1] = {0};
for (long long i = 1; i <= n; i++) {
cin >> ar[i];
}
// arr[1]=ar[1];
for (long long i = 2; i <= n; i++) {
/*cout<<(abs(ar[i]-ar[i-1])+arr[i-1])<<" ";
cout<<(abs(ar[i]-ar[i-2])+arr[i-2])<<endl;*/
long long z = k;
long long mi = 9999999999;
for (long long j = i; j > 0 && z > 0; j--, z--) {
mi = min(mi, (abs(ar[i] - ar[j - 1]) + arr[j - 1]));
}
arr[i] = mi;
}
cout << arr[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long ar[n + 1] = {0};
long long arr[n + 1] = {0};
for (long long i = 1; i <= n; i++) {
cin >> ar[i];
}
// arr[1]=ar[1];
for (long long i = 2; i <= n; i++) {
/*cout<<(abs(ar[i]-ar[i-1])+arr[i-1])<<" ";
cout<<(abs(ar[i]-ar[i-2])+arr[i-2])<<endl;*/
long long z = k;
long long mi = 9999999999;
for (long long j = i; j > 1 && z > 0; j--, z--) {
mi = min(mi, (abs(ar[i] - ar[j - 1]) + arr[j - 1]));
}
arr[i] = mi;
}
cout << arr[n] << endl;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,728 | 960,729 | u951790655 | cpp |
p03161 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; i < t; ++j)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
int main() {
int N, K;
cin >> N >> K;
int h[N];
rep(i, N) { cin >> h[i]; }
int cost[N];
cost[0] = 0;
srep(i, 1, N) {
int mincost = 99999999;
rep2(j, K) {
int ind = i - (j + 1);
if (ind > 0) {
mincost = min(mincost, abs(h[i] - h[ind]) + cost[ind]);
}
}
cost[i] = mincost;
}
cout << cost[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; i < t; ++j)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
rep(j, sz(v)) i >> v[j];
return i;
}
template <typename T> string join(const v(T) & v) {
stringstream s;
rep(i, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
if (sz(v))
o << join(v);
return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
ll res(0);
for (auto &&x : a)
res += x;
return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
const int MX = 200005;
int main() {
int N, K;
cin >> N >> K;
int h[N];
rep(i, N) { cin >> h[i]; }
int cost[N];
cost[0] = 0;
srep(i, 1, N) {
int mincost = INF;
rep2(j, K) {
int ind = i - (j + 1);
if (ind > -1) {
mincost = min(mincost, abs(h[i] - h[ind]) + cost[ind]);
}
}
cost[i] = mincost;
}
cout << cost[N - 1] << endl;
return 0;
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,730 | 960,731 | u340293807 | cpp |
p03161 | #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll long long
const ll inf = 1e9;
const int mod = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
ll b[100005];
int k, n, a[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
b[0] = 0;
b[1] = 0;
for (int i = 2; i <= n; i++) {
ll mn = 10000 * inf;
for (int j = 1; j <= k; j++) {
if (i - k > 0)
mn = min((ll)abs(a[i] - a[i - j]) + b[i - j], mn);
}
b[i] = mn;
}
cout << b[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#pragma GCC optimize("-O3")
#define ll long long
const ll inf = 1e9;
const int mod = 1e9 + 7;
using namespace std;
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
ll b[100005];
int k, n, a[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
b[0] = 0;
b[1] = 0;
for (int i = 2; i <= n; i++) {
ll mn = 10000 * inf;
for (int j = 1; j <= k; j++) {
if (i - j > 0)
mn = min((ll)abs(a[i] - a[i - j]) + b[i - j], mn);
}
b[i] = mn;
}
cout << b[n] << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 960,732 | 960,733 | u865920681 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
int h[100005];
int dp[100005];
cin >> n >> K;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int minc = 100000;
for (int k = 1; k <= K; k++) {
if (i - k <= 0)
break;
minc = min(minc, dp[i - k] + abs(h[i] - h[i - k]));
}
dp[i] = minc;
}
cout << dp[n] << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, K;
int h[100005];
int dp[100005];
cin >> n >> K;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int minc = 10000000000;
for (int k = 1; k <= K; k++) {
if (i - k <= 0)
break;
minc = min(minc, dp[i - k] + abs(h[i] - h[i - k]));
}
dp[i] = minc;
}
cout << dp[n] << "\n";
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 960,736 | 960,737 | u570165549 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mex = 1e5 + 1;
#define ll long long
#define test \
int t; \
cin >> t; \
while (t--)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fo(i, a, n) for (int i = a; i < n; i++)
#define rfo(i, a, b) for (int i = a; i >= b; i--)
#define bg begin()
#define en end()
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define veci vector<int>
#define veclli vector<long long int>
#define all(x) x.begin(), x.end()
#define sci(x) scanf("%d", &x);
#define scc(x) scanf("%c", &x);
#define scs(x) scanf("%s", x);
#define sclli(x) scanf("%lld", &x);
#define pii pair<int, int>
#define plli pair<long long int, lont long int>
#define foit(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define debug(arr, n) \
for (int i = 0; i < n; i++) \
printf("%d ", arr);
#define sz(x) x.size()
int main() {
fast int n, k;
cin >> n >> k;
int arr[n], dp[n];
fo(i, 0, n) cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
fo(i, 2, n) {
dp[i] = 1e9;
fo(j, max(i - k, 0), i) dp[i] =
min(dp[i - k] + abs(arr[i] - arr[i - k]), dp[i]);
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mex = 1e5 + 1;
#define ll long long
#define test \
int t; \
cin >> t; \
while (t--)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fo(i, a, n) for (int i = a; i < n; i++)
#define rfo(i, a, b) for (int i = a; i >= b; i--)
#define bg begin()
#define en end()
#define fi first
#define se second
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define veci vector<int>
#define veclli vector<long long int>
#define all(x) x.begin(), x.end()
#define sci(x) scanf("%d", &x);
#define scc(x) scanf("%c", &x);
#define scs(x) scanf("%s", x);
#define sclli(x) scanf("%lld", &x);
#define pii pair<int, int>
#define plli pair<long long int, lont long int>
#define foit(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define debug(arr, n) \
for (int i = 0; i < n; i++) \
printf("%d ", arr);
#define sz(x) x.size()
int main() {
fast int n, k;
cin >> n >> k;
int arr[n], dp[n];
fo(i, 0, n) cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
fo(i, 2, n) {
dp[i] = 1e9;
fo(j, max(i - k, 0), i) dp[i] = min(dp[j] + abs(arr[i] - arr[j]), dp[i]);
}
cout << dp[n - 1];
} | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,738 | 960,739 | u468743462 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k; j++)
if (i - j >= 0)
F[i] = min(F[i - j] + abs(h[i] - h[i - j]), F[i]);
}
cout << F[n] << endl;
return 0;
}
| #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k; j++)
if (i - j > 0)
F[i] = min(F[i - j] + abs(h[i] - h[i - j]), F[i]);
else
break;
}
cout << F[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"
] | 960,740 | 960,741 | u802278034 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k; j++)
if (i - j >= 0)
F[i] = min(F[i - j] + abs(h[i] - h[i - j]), F[i]);
}
cout << F[n] << endl;
return 0;
}
| #include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
long long n, k, tmp, h[10000000], F[10000000];
int main() {
// freopen("FROG2.INP","r",stdin);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 2; i <= n; i++) {
F[i] = 10E15;
for (int j = 1; j <= k; j++)
if (i - j > 0)
F[i] = min(F[i - j] + abs(h[i] - h[i - j]), F[i]);
}
cout << F[n] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,740 | 960,742 | u802278034 | cpp |
p03161 | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<ll> dp(n, INF);
REP(i, n) {
cin >> a[i];
if (i != 0) {
if (i <= 1) {
for (int j = 0; j != i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
} else {
for (int j = i - 1; j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
} else {
dp[0] = 0;
}
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPEACH(i, k) for (auto &i : k)
#define all(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<ll> dp(n, INF);
REP(i, n) {
cin >> a[i];
if (i != 0) {
if (i <= k) {
for (int j = 0; j != i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
} else {
for (int j = i - 1; j >= i - k; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
} else {
dp[0] = 0;
}
}
cout << dp[n - 1] << endl;
}
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 960,745 | 960,746 | u118875091 | cpp |
p03161 | #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod 1000000007
#define pb push_back
using namespace std;
typedef pair<int, int> pi;
int main() {
fastIO int test = 1;
// cin >> test;
while (test--) {
int n, k;
cin >> n >> k;
int i, j, arr_h[n];
f(i, 0, n) cin >> arr_h[i];
int cost[n];
f(i, 0, n) cost[i] = INT_MAX;
cost[0] = 0;
f(i, 1, min(k + 1, n - 1)) { cost[i] = abs(arr_h[i] - arr_h[0]); }
int mini, temp;
f(i, 2, n) {
mini = INT_MAX;
f(j, 1, k + 1) {
if (i - j < 1)
break;
temp = cost[i - j] + abs(arr_h[i] - arr_h[i - j]);
if (mini > temp)
mini = temp;
}
cost[i] = min(cost[i], mini);
}
cout << cost[n - 1];
}
return 0;
}
| #include <bits/stdc++.h>
#define fastIO \
ios::sync_with_stdio(false); \
cin.tie(0);
#define ll long long
#define f(i, l, r) for (i = l; i < r; i++)
#define fd(i, l, r) for (i = l; i > r; i--)
#define mod 1000000007
#define pb push_back
using namespace std;
typedef pair<int, int> pi;
int main() {
fastIO int test = 1;
// cin >> test;
while (test--) {
int n, k;
cin >> n >> k;
int i, j, arr_h[n];
f(i, 0, n) cin >> arr_h[i];
int cost[n];
f(i, 0, n) cost[i] = INT_MAX;
cost[0] = 0;
f(i, 1, min(k + 1, n)) { cost[i] = abs(arr_h[i] - arr_h[0]); }
int mini, temp;
f(i, 2, n) {
// cout << "HI";
mini = INT_MAX;
f(j, 1, k + 1) {
if (i - j < 1)
break;
temp = cost[i - j] + abs(arr_h[i] - arr_h[i - j]);
if (mini > temp)
mini = temp;
}
cost[i] = min(cost[i], mini);
}
cout << cost[n - 1];
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 960,759 | 960,760 | u390664767 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define vbi vector<bool>
#define mod 1000000007
#define INF 1000000000
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define sd second
#define ft first
#define ms(x, v) memset(x, v, sizeof x)
#define endl '\n'
#define cnl cout << endl;
#define frr(i, b) for (ll i = 0; i < b; i++)
#define fb(i, b) for (ll i = b - 1; i >= 0; i--)
#define pi 3.141592653589793238
ll i, j, k;
long long dp[1000000];
void solve() {
ll n;
cin >> n;
ll k;
cin >> k;
vl v(n);
ll z = 0;
for (i = 0; i < n; i++)
cin >> v[i];
for (i = 1; i < n; i++) {
ll mx = 100000;
for (j = 1; j <= k; j++) {
if ((i - j) >= 0)
mx = min((dp[max(z, i - j)] + abs(v[i] - v[max(z, i - j)])), mx);
else
break;
}
dp[i] = mx;
// cout<<dp[i]<<" ";
}
// cnl;
cout << dp[n - 1] << endl;
}
signed main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> pll;
#define vbi vector<bool>
#define mod 1000000007
#define INF 1000000000
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define sd second
#define ft first
#define ms(x, v) memset(x, v, sizeof x)
#define endl '\n'
#define cnl cout << endl;
#define frr(i, b) for (ll i = 0; i < b; i++)
#define fb(i, b) for (ll i = b - 1; i >= 0; i--)
#define pi 3.141592653589793238
ll i, j, k;
long long dp[1000000];
void solve() {
ll n;
cin >> n;
ll k;
cin >> k;
vl v(n);
ll z = 0;
for (i = 0; i < n; i++)
cin >> v[i];
for (i = 1; i < n; i++) {
ll mx = 1e18;
for (j = 1; j <= k; j++) {
if ((i - j) >= 0)
mx = min((dp[max(z, i - j)] + abs(v[i] - v[max(z, i - j)])), mx);
else
break;
}
dp[i] = mx;
// cout<<dp[i]<<" ";
}
// cnl;
cout << dp[n - 1] << endl;
}
signed main() {
solve();
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,763 | 960,764 | u126288554 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define PI 3.14159265358979323846
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MAX 1000
using namespace std;
// ll gcd(ll n,ll m){
// if(m==0)
// return n;
// if(n<m)
// swap(n,m);
// while(n%m!=0)
// {
// ll temp=n;
// n=m;
// m=temp%m;
// }
// return m;
//}
// bool sortbysec(pair<int,int> &a,pair<int,int> &b)
//{
// return (a.second < b.second);
//}
int main() {
ll n, i, j, k;
cin >> n >> k;
ll h[n];
for (i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - 1; j >= i - k; j--) {
dp[i] = min(dp[i], abs(h[i] - h[j]) + dp[j]);
}
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define PI 3.14159265358979323846
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define MAX 1000
using namespace std;
// ll gcd(ll n,ll m){
// if(m==0)
// return n;
// if(n<m)
// swap(n,m);
// while(n%m!=0)
// {
// ll temp=n;
// n=m;
// m=temp%m;
// }
// return m;
//}
// bool sortbysec(pair<int,int> &a,pair<int,int> &b)
//{
// return (a.second < b.second);
//}
int main() {
ll n, i, j, k;
cin >> n >> k;
ll h[n];
for (i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[i], abs(h[i] - h[j]) + dp[j]);
}
}
cout << dp[n - 1];
}
| [
"control_flow.loop.for.condition.change"
] | 960,767 | 960,768 | u492894170 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5, INF = 3e5 + 5;
int a[Nmax], dp[Nmax];
int N, K;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> a[i];
memset(dp, INF, sizeof(dp));
dp[1] = a[1];
for (int i = 2; i <= N; ++i)
for (int j = 1; j <= min(i - 1, K); ++j)
if (i - j == 1)
dp[i] = min(dp[i], abs(a[i - j] - a[i]));
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
cout << dp[N];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5, INF = 2e5 + 5;
int a[Nmax], dp[Nmax];
int N, K;
int main() {
ios_base::sync_with_stdio(0);
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> a[i];
memset(dp, INF, sizeof(dp));
dp[1] = a[1];
for (int i = 2; i <= N; ++i)
for (int j = 1; j <= min(i - 1, K); ++j)
if (i - j == 1)
dp[i] = min(dp[i], abs(a[i - j] - a[i]));
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
cout << dp[N];
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 960,772 | 960,773 | u361594188 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
int k;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[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 - k] + abs(arr[i] - arr[i - j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
int k;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[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(arr[i] - arr[i - j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,779 | 960,780 | u881011075 | cpp |
p03161 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forr(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define forin(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define dbg(x) cerr << #x << " " << x << "\n";
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
#define maxs(x, y) (x = max(x, y))
#define sz(x) (int)(x).size()
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const int MAX = 100001;
int dp[MAX] = {};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vi h(n);
forn(i, n) {
cin >> h[i];
dp[i] = MAX;
}
dp[0] = 0;
forn(i, n) {
for1(j, k) {
if (i - j >= 0)
mins(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forr(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define forin(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define dbg(x) cerr << #x << " " << x << "\n";
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
#define maxs(x, y) (x = max(x, y))
#define sz(x) (int)(x).size()
#define mins(x, y) (x = min(x, y))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
const int MAX = 100001;
int dp[MAX] = {};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vi h(n);
forn(i, n) {
cin >> h[i];
dp[i] = 1000000007;
}
dp[0] = 0;
forn(i, n) {
for1(j, k) {
if (i - j >= 0)
mins(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[n - 1];
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 960,785 | 960,786 | u333759455 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int dp[n];
int h[n];
int x;
int mind = 1e4 + 1;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = k; j > 0; j--) {
if (i - j >= 0) {
x = h[i] - h[i - j];
mind = min(mind, dp[i - j] + abs(x));
}
}
dp[i] = mind;
mind = 1e4 + 1;
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n, k;
cin >> n >> k;
int dp[n];
int h[n];
int x;
int mind = 1e10 + 24;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = k; j > 0; j--) {
if (i - j >= 0) {
x = h[i] - h[i - j];
mind = min(mind, dp[i - j] + abs(x));
}
}
dp[i] = mind;
mind = 1e10 + 24;
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 960,792 | 960,793 | u402184396 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define filename "lynext"
#define freop \
freopen(filename ".cik", "w", stdout); \
freopen(filename ".gir", "r", stdin)
const long long int N = ((long long int)1e5) + 5;
const long long int M = ((long long int)1e3) + 5;
const long long int llinf = (long long int)1e18;
const int inf = INT_MAX;
typedef long long int lli;
lli dp[N];
lli n;
lli k;
lli h[N];
lli f(lli i) {
if (dp[i] != -1)
return dp[i];
if (i == n)
return 0;
if (i == n - 1)
return abs(h[n] - h[i]);
lli t = llinf;
for (int j = i + 1; j <= i + k; j++)
t = min(t, f(j) + abs(h[i] - h[j]));
return dp[i] = t;
}
int main() {
fast;
// freop;
cin >> n >> k;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << f(1) << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define filename "lynext"
#define freop \
freopen(filename ".cik", "w", stdout); \
freopen(filename ".gir", "r", stdin)
const long long int N = ((long long int)1e5) + 5;
const long long int M = ((long long int)1e3) + 5;
const long long int llinf = (long long int)1e18;
const int inf = INT_MAX;
typedef long long int lli;
lli dp[N];
lli n;
lli k;
lli h[N];
lli f(lli i) {
if (dp[i] != -1)
return dp[i];
if (i == n)
return 0;
if (i == n - 1)
return abs(h[n] - h[i]);
lli t = llinf;
for (int j = i + 1; j <= min(i + k, n); j++)
t = min(t, f(j) + abs(h[i] - h[j]));
return dp[i] = t;
}
int main() {
fast;
// freop;
cin >> n >> k;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << f(1) << "\n";
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 960,799 | 960,800 | u997979021 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 29;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
int N;
Graph G;
vector<int> res;
ll h[100010];
ll dp[100100];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, K;
cin >> N >> K;
rep(i, N) cin >> h[i];
rep(i, 100100) dp[i] = LLINF;
dp[0] = 0;
REP(i, 1, N) {
REP(j, 1, K) {
if (i >= j)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 29;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
int N;
Graph G;
vector<int> res;
ll h[100010];
ll dp[100100];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, K;
cin >> N >> K;
rep(i, N) cin >> h[i];
rep(i, 100100) dp[i] = LLINF;
dp[0] = 0;
REP(i, 1, N) {
REP(j, 1, K + 1) {
if (i >= j)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
}
| [
"expression.operation.binary.add"
] | 960,805 | 960,806 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 30;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
int64_t power(int64_t x, int64_t n, int64_t mod) {
int64_t ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
vector<int> sieve_of_eratosthenes(int n) {
vector<int> primes(n);
for (int i = 2; i < n; ++i)
primes[i] = i;
for (int i = 2; i * i < n; ++i)
if (primes[i])
for (int j = i * i; j < n; j += i)
primes[j] = 0;
return primes;
}
struct Dice {
int s[6];
int &top() { return s[0]; }
int &south() { return s[1]; }
int &east() { return s[2]; }
int &west() { return s[3]; }
int &north() { return s[4]; }
int &bottom() { return s[5]; }
void roll(char c) {
// the view from above
// N
// W E
// S
string b("EWNSRL");
int v[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4},
{0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};
for (int k = 0; k < 6; k++) {
if (b[k] != c)
continue;
int t = s[v[k][0]];
s[v[k][0]] = s[v[k][1]];
s[v[k][1]] = s[v[k][2]];
s[v[k][2]] = s[v[k][3]];
s[v[k][3]] = t;
}
}
using ll = long long;
ll hash() {
ll res = 0;
for (int i = 0; i < 6; i++)
res = res * 256 + s[i];
return res;
}
bool operator==(const Dice &d) const {
for (int i = 0; i < 6; i++)
if (s[i] != d.s[i])
return 0;
return 1;
}
};
vector<Dice> makeDices(Dice d) {
vector<Dice> res;
for (int i = 0; i < 6; i++) {
Dice t(d);
if (i == 1)
t.roll('N');
if (i == 2)
t.roll('S');
if (i == 3)
t.roll('S'), t.roll('S');
if (i == 4)
t.roll('L');
if (i == 5)
t.roll('R');
for (int k = 0; k < 4; k++) {
res.push_back(t);
t.roll('E');
}
}
return res;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
using Graph = vector<vector<int>>;
// 深さ優先探索
vector<bool> seen;
void gdfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v])
continue; // next_v が探索済だったらスルー
gdfs(G, next_v); // 再帰的に探索
}
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string MINUSINF = "-";
void Cmax(string &a, string b) {
if (a == MINUSINF)
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
ll dp[100100];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
dp[0] = 0;
REP(i, 1, 100100) dp[i] = LLINF;
rep(i, N) { REP(j, 1, K) chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 30;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
int64_t power(int64_t x, int64_t n, int64_t mod) {
int64_t ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
vector<int> sieve_of_eratosthenes(int n) {
vector<int> primes(n);
for (int i = 2; i < n; ++i)
primes[i] = i;
for (int i = 2; i * i < n; ++i)
if (primes[i])
for (int j = i * i; j < n; j += i)
primes[j] = 0;
return primes;
}
struct Dice {
int s[6];
int &top() { return s[0]; }
int &south() { return s[1]; }
int &east() { return s[2]; }
int &west() { return s[3]; }
int &north() { return s[4]; }
int &bottom() { return s[5]; }
void roll(char c) {
// the view from above
// N
// W E
// S
string b("EWNSRL");
int v[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4},
{0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};
for (int k = 0; k < 6; k++) {
if (b[k] != c)
continue;
int t = s[v[k][0]];
s[v[k][0]] = s[v[k][1]];
s[v[k][1]] = s[v[k][2]];
s[v[k][2]] = s[v[k][3]];
s[v[k][3]] = t;
}
}
using ll = long long;
ll hash() {
ll res = 0;
for (int i = 0; i < 6; i++)
res = res * 256 + s[i];
return res;
}
bool operator==(const Dice &d) const {
for (int i = 0; i < 6; i++)
if (s[i] != d.s[i])
return 0;
return 1;
}
};
vector<Dice> makeDices(Dice d) {
vector<Dice> res;
for (int i = 0; i < 6; i++) {
Dice t(d);
if (i == 1)
t.roll('N');
if (i == 2)
t.roll('S');
if (i == 3)
t.roll('S'), t.roll('S');
if (i == 4)
t.roll('L');
if (i == 5)
t.roll('R');
for (int k = 0; k < 4; k++) {
res.push_back(t);
t.roll('E');
}
}
return res;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
// 多次元 vector 生成
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
using Graph = vector<vector<int>>;
// 深さ優先探索
vector<bool> seen;
void gdfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto next_v : G[v]) {
if (seen[next_v])
continue; // next_v が探索済だったらスルー
gdfs(G, next_v); // 再帰的に探索
}
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string MINUSINF = "-";
void Cmax(string &a, string b) {
if (a == MINUSINF)
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b)
a = b;
}
}
ll dp[100100];
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
dp[0] = 0;
REP(i, 1, 100100) dp[i] = LLINF;
rep(i, N) { REP(j, 1, K + 1) chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
cout << dp[N - 1] << endl;
}
| [
"expression.operation.binary.add"
] | 960,807 | 960,808 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<int> par, rank;
UnionFind(int n) : par(n, -1), rank(n, 0) {}
void init(int n) { par.assign(n, -1), rank.assign(n, 0); }
int root(int x) {
if (par[x] == -1)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(N);
rep(i, N) dp[i] = INF;
dp[0] = 0;
REP(i, 1, N) {
REP(j, 1, K) {
if (i > j)
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<int> par, rank;
UnionFind(int n) : par(n, -1), rank(n, 0) {}
void init(int n) { par.assign(n, -1), rank.assign(n, 0); }
int root(int x) {
if (par[x] == -1)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(N);
rep(i, N) dp[i] = INF;
dp[0] = 0;
REP(i, 1, N) {
REP(j, 1, K + 1) {
if (i >= j)
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,809 | 960,810 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<int> par, rank;
UnionFind(int n) : par(n, -1), rank(n, 0) {}
void init(int n) { par.assign(n, -1), rank.assign(n, 0); }
int root(int x) {
if (par[x] == -1)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(N);
rep(i, N) dp[i] = INF;
dp[0] = 0;
REP(i, 1, N) {
REP(j, 1, K) if (i > j) chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--)
#define reprev(i, n) reprrev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll INF = 1LL << 60;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
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;
}
struct UnionFind {
vector<int> par, rank;
UnionFind(int n) : par(n, -1), rank(n, 0) {}
void init(int n) { par.assign(n, -1), rank.assign(n, 0); }
int root(int x) {
if (par[x] == -1)
return x;
else
return par[x] = root(par[x]);
}
bool issame(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y])
swap(x, y);
if (rank[x] == rank[y])
++rank[x];
par[y] = x;
return true;
}
};
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(N);
rep(i, N) dp[i] = INF;
dp[0] = 0;
REP(i, 1, N) {
REP(j, 1, K + 1) {
if (i >= j)
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,811 | 960,810 | u135572611 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(100010, 0);
vector<ll> dp(100010, 1 << 9);
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
}
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j > 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(100010, 0);
vector<ll> dp(100010, 1000000007);
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
}
dp[0] = 0;
dp[1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j > 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,812 | 960,813 | u561186440 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = 1000000000000000;
for (int j = i - 1; j >= 0 && j >= (i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1] = {0};
for (int i = 2; i <= n; i++) {
dp[i] = 1000000000000000;
for (int j = i - 1; j >= 1 && j >= (i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,820 | 960,821 | u792088162 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[i]<<endl;
for (ll j = max((ll)1, i - k + 1); j <= i - 1; j++) { // if(i-j<=0)break;
dp[i] = min(dp[j] + abs(ar[i] - ar[j]), dp[i]);
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[i]<<endl;
for (ll j = max((ll)1, i - k); j <= i - 1; j++) { // if(i-j<=0)break;
dp[i] = min(dp[j] + abs(ar[i] - ar[j]), dp[i]);
}
}
cout << dp[n];
} | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 960,822 | 960,823 | u096117579 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[i]<<endl;
for (ll j = (1, i - k); j <= i - 1; j++) { // if(i-j<=0)break;
dp[i] = min(dp[j] + abs(ar[i] - ar[j]), dp[i]);
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll dp[n + 1];
for (ll i = 1; i <= n; i++)
dp[i] = (ll)1e18;
dp[1] = 0;
for (ll i = 2; i <= n; i++) { // cout<<dp[i]<<endl;
for (ll j = max((ll)1, i - k); j <= i - 1; j++) { // if(i-j<=0)break;
dp[i] = min(dp[j] + abs(ar[i] - ar[j]), dp[i]);
}
}
cout << dp[n];
} | [
"call.add",
"control_flow.loop.for.initializer.change",
"type_conversion.add"
] | 960,824 | 960,823 | u096117579 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define chmin(x, y) \
if (x > y) \
x = y
#define chmax(x, y) \
if (x < y) \
x = y
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
ll inf = 100100100100;
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vi v(n);
rep(i, n) cin >> v[i];
vi dp(n, inf);
dp[0] = 0;
REP(i, 1, n) {
REP(j, 1, k) {
if (i - k < 0)
break;
chmin(dp[i], dp[i - k] + abs(v[i] - v[i - k]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k) - v.begin()
#define chmin(x, y) \
if (x > y) \
x = y
#define chmax(x, y) \
if (x < y) \
x = y
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
ll inf = 100100100100;
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vi v(n);
rep(i, n) cin >> v[i];
vi dp(n, inf);
dp[0] = 0;
REP(i, 1, n) {
REP(j, 1, k + 1) {
if (i - j < 0)
break;
chmin(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
cout << dp[n - 1] << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,834 | 960,835 | u422633119 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int long long
const int N = 1e5 + 5;
const int INF = 1e9 + 5;
vector<int> dp(N, INF);
int main() {
int n, k;
scanf("%d", &n);
cin >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1 + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int long long
const int N = 1e5 + 5;
const int INF = 1e9 + 5;
vector<int> dp(N, INF);
int main() {
int n, k;
scanf("%d", &n);
cin >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 960,850 | 960,851 | u535136478 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int long long
const int N = 1e5 + 5;
const int INF = 1e9 + 5;
vector<int> dp(N, INF);
int main() {
int n, k;
scanf("%d", &n);
cin >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[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], dp[i] + abs(a[i] - a[j]));
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
//#define int long long
const int N = 1e5 + 5;
const int INF = 1e9 + 5;
vector<int> dp(N, INF);
int main() {
int n, k;
scanf("%d", &n);
cin >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
printf("%d\n", dp[n - 1]);
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,852 | 960,851 | u535136478 | cpp |
p03161 | /******************************************************************************
Online C Compiler.
Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define long long int
int main() {
int q = 1;
// cin>>q;
while (q--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
dp[i] = INT_MAX;
for (int i = 3; i <= n; i++)
for (int j = 1; j <= k; j++)
dp[i] = min(dp[i], (abs(a[i] - a[i - j]) + dp[i - j]));
cout << dp[n];
}
}
| /******************************************************************************
Online C Compiler.
Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define long long int
int main() {
int q = 1;
// cin>>q;
while (q--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
dp[i] = INT_MAX;
for (int i = 3; i <= n; i++)
for (int j = 1; j < i && j <= k; j++)
dp[i] = min(dp[i], (abs(a[i] - a[i - j]) + dp[i - j]));
cout << dp[n];
}
}
| [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 960,853 | 960,854 | u054341054 | 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];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 1e+9;
for (int i = 1; i < min(k, n); i++)
for (int j = 0; j < i; j++)
dp[i] = max(dp[i], dp[j] + abs(arr[i] - arr[j]));
for (int i = k; i < n; i++)
for (int j = i - k; j < i; j++)
dp[i] = max(dp[i], dp[j] + abs(arr[i] - arr[j]));
cout << dp[n - 1] << endl;
} | #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];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 1e+9;
for (int i = 1; i < min(k, n); i++)
for (int j = 0; j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
for (int i = k; i < n; i++)
for (int j = i - k; j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
cout << dp[n - 1] << endl;
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 960,859 | 960,858 | u227478170 | cpp |
p03161 | // PLUS ULTRA
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define mp make_pair
#define forn(i, st, n) for (int i = st; i < n; i++)
#define nfor(i, st, n) for (int i = st; i >= n; i--)
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 10, mod = 1000000007;
int main() {
SPEED;
int n, k;
cin >> n >> k;
ll h[n];
forn(i, 0, n) { cin >> h[i]; }
ll dp[n];
dp[0] = 0;
// forn(i,1,min(k+1,n)){
// dp[i] = abs(h[i] - h[0]);
// forn(j,1,i){
// dp[i] = min(dp[i] , dp[i-1] + abs(h[i] - h[j]));
// }
// }
forn(i, k, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
nfor(j, i - 2, max(i - k, 0)) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| // PLUS ULTRA
#include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define mp make_pair
#define forn(i, st, n) for (int i = st; i < n; i++)
#define nfor(i, st, n) for (int i = st; i >= n; i--)
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 10, mod = 1000000007;
int main() {
SPEED;
int n, k;
cin >> n >> k;
ll h[n];
forn(i, 0, n) { cin >> h[i]; }
ll dp[n];
dp[0] = 0;
// forn(i,1,min(k+1,n)){
// dp[i] = abs(h[i] - h[0]);
// forn(j,1,i){
// dp[i] = min(dp[i] , dp[i-1] + abs(h[i] - h[j]));
// }
// }
forn(i, 1, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
nfor(j, i - 2, max(i - k, 0)) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [] | 960,860 | 960,861 | u141684774 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#define INF 2000000000
using namespace std;
int n, k;
int h[100000];
int dp[100001];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++) {
dp[i + 1] = min(dp[i + 1], dp[i - j] + abs(h[i - j] - h[i + 1]));
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#define INF 2000000000
using namespace std;
int n, k;
int h[100000];
int dp[100001];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k && i >= j; j++) {
dp[i + 1] = min(dp[i + 1], dp[i - j] + abs(h[i - j] - h[i + 1]));
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 960,862 | 960,863 | u110996038 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v1(n), v2(n, INT_MAX);
v2[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v1[i];
}
for (int i = 1; i < n; i++) {
int count = 4;
int j = i - 1;
while (j >= 0 && count != 0) {
v2[i] = min(v2[i], abs(v1[i] - v1[j]) + v2[j]);
j--;
count--;
}
}
cout << v2[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v1(n), v2(n, INT_MAX);
v2[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v1[i];
}
for (int i = 1; i < n; i++) {
int count = k;
int j = i - 1;
while (j >= 0 && count != 0) {
v2[i] = min(v2[i], abs(v1[i] - v1[j]) + v2[j]);
j--;
count--;
}
}
cout << v2[n - 1];
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,878 | 960,879 | u398129514 | cpp |
p03161 | #include <bits/stdc++.h>
#define w while
#define loop(i, l, r) for (int i = l; i < r; i++)
#define ci cin >>
#define co cout <<
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
loop(i, 0, n) {
ci a[i];
dp[i] = INT_MAX;
}
// if(k>n){
// cout<<"0";
// }
// else {
dp[0] = 0;
loop(i, 0, n) {
loop(j, i + 1, i + k + 1) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
//}
co dp[n - 1];
}
}
| #include <bits/stdc++.h>
#define w while
#define loop(i, l, r) for (int i = l; i < r; i++)
#define ci cin >>
#define co cout <<
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
loop(i, 0, n) {
ci a[i];
dp[i] = INT_MAX;
}
// if(k>n){
// cout<<"0";
// }
// else {
dp[0] = 0;
loop(i, 0, n) {
loop(j, i + 1, i + k + 1) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
//}
}
co dp[n - 1];
}
| [] | 960,882 | 960,883 | u409832451 | cpp |
p03161 | #include <iostream>
#define int long long
using namespace std;
main() {
int a, i, b, j;
cin >> a >> b;
int aa[a + 5], cost[a + 5];
for (i = 0; i < a; i++) {
cin >> aa[i];
cost[i] = 100000;
}
cost[0] = 0;
cost[1] = abs(aa[1] - aa[0]);
for (i = 2; i < a; i++) {
for (j = 1; j <= b; j++) {
if (i - j < 0)
break;
cost[i] = min(cost[i - j] + abs(aa[i] - aa[i - j]), cost[i]);
// cout<<cost[i]<<endl;
}
// cout<<cost[i]<<endl;
}
cout << cost[a - 1] << endl;
}
| #include <iostream>
#define int long long
using namespace std;
main() {
int a, i, b, j;
cin >> a >> b;
int aa[a + 5], cost[a + 5];
for (i = 0; i < a; i++) {
cin >> aa[i];
cost[i] = 10000000000000000;
}
cost[0] = 0;
cost[1] = abs(aa[1] - aa[0]);
for (i = 2; i < a; i++) {
for (j = 1; j <= b; j++) {
if (i - j < 0)
break;
cost[i] = min(cost[i - j] + abs(aa[i] - aa[i - j]), cost[i]);
// cout<<cost[i]<<endl;
}
// cout<<cost[i]<<endl;
}
cout << cost[a - 1] << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 960,890 | 960,891 | u910753524 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n], dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int c = 100000;
for (int j = i - 1; j > max(-1, i - k - 1); j--) {
c = min(c, dp[j] + abs(arr[i] - arr[j]));
}
dp[i] = c;
}
cout << dp[n - 1] << '\n';
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int arr[n], dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int c = INT_MAX;
for (int j = i - 1; j > max(-1, i - k - 1); j--) {
c = min(c, dp[j] + abs(arr[i] - arr[j]));
}
dp[i] = c;
}
cout << dp[n - 1] << '\n';
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,901 | 960,902 | u715350216 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
using namespace std;
int dps(int x, int dp[], int vi[], int arr[], int k) {
if (x <= 0)
return 0;
if (vi[x] == 1)
return dp[x];
vi[x] = 1;
int maxa = pow(10, 8);
for (int l = 1; l < min(x + 1, k + 1); l++) {
maxa = min((dps(x - l, dp, vi, arr, k) + abs(arr[x] - arr[x - l])), maxa);
}
dp[x] = maxa;
return dp[x];
}
int main(void) {
int n, k;
cin >> n >> k;
int arr[n];
int dp[n];
int vi[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = 0;
vi[i] = 0;
}
cout << dps(2, dp, vi, arr, k);
} | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
using namespace std;
int dps(int x, int dp[], int vi[], int arr[], int k) {
if (x <= 0)
return 0;
if (vi[x] == 1)
return dp[x];
vi[x] = 1;
int maxa = pow(10, 9);
for (int l = 1; l < min(x + 1, k + 1); l++) {
maxa = min((dps(x - l, dp, vi, arr, k) + abs(arr[x] - arr[x - l])), maxa);
}
dp[x] = maxa;
return dp[x];
}
int main(void) {
int n, k;
cin >> n >> k;
int arr[n];
int dp[n];
int vi[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = 0;
vi[i] = 0;
}
cout << dps(n - 1, dp, vi, arr, k);
} | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 960,909 | 960,908 | u086976605 | cpp |
p03161 | #include <bits/stdc++.h>
#define input(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
input(a, n);
int dp[n + 1];
memset(dp, 0, sizeof(0));
dp[n] = 0;
dp[n - 1] = abs(a[n - 2] - a[n - 1]);
for (int i = n - 2; i > 0; i--) {
dp[i] = a[i - 1];
for (int j = i + 1; j <= i + k & j <= n; j++)
dp[i] = min(dp[i], dp[j] + abs(a[j - 1] - a[i - 1]));
}
cout << dp[1];
} | #include <bits/stdc++.h>
#define input(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[n];
input(a, n);
int dp[n + 1];
memset(dp, 0, sizeof(0));
dp[n] = 0;
dp[n - 1] = abs(a[n - 2] - a[n - 1]);
for (int i = n - 2; i > 0; i--) {
dp[i] = INT_MAX;
for (int j = i + 1; j <= i + k & j <= n; j++)
dp[i] = min(dp[i], dp[j] + abs(a[j - 1] - a[i - 1]));
}
cout << dp[1];
} | [
"assignment.value.change"
] | 960,912 | 960,913 | u807795697 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
#define pp pair<pii, pii>
const int hell = 1000000007;
int solve() {
int n, k;
cin >> n >> k;
vi a(n);
rep(i, 0, n) cin >> a[i];
int dp[n] = {0};
// rep(i,0,n)dp[i]=1e9+5;
rep(i, 1, k) { dp[i] = abs(a[i] - a[0]); }
rep(i, k, n) {
int mn = hell;
rep(j, i - k, i) mn = min(mn, dp[j] + abs(a[i] - a[j]));
dp[i] = mn;
}
cout << dp[n - 1];
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
#define pp pair<pii, pii>
const int hell = 1000000007;
int solve() {
int n, k;
cin >> n >> k;
vi a(n);
rep(i, 0, n) cin >> a[i];
int dp[n] = {0};
// rep(i,0,n)dp[i]=1e9+5;
rep(i, 1, min(k, n)) { dp[i] = abs(a[i] - a[0]); }
rep(i, k, n) {
int mn = hell;
rep(j, i - k, i) mn = min(mn, dp[j] + abs(a[i] - a[j]));
dp[i] = mn;
}
cout << dp[n - 1];
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
// << (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| [
"call.add",
"call.arguments.add"
] | 960,914 | 960,915 | u240509821 | cpp |
p03161 | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define maximum INT_MAX
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const long long inf = 1e11 + 5;
bool isPrime(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
ll factorial(ll n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); }
ll power(ll x, ll y) {
ll res = 1;
x = x;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
ll ncr(ll n, ll r) {
ll res = 1;
if (r > n)
return 0;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ll max(ll a, ll b) {
ll ans = a > b ? a : b;
return ans;
}
ll min(ll a, ll b) {
ll ans = a < b ? a : b;
return ans;
}
// void print_set(vector<int> a)
// {
// cout<<a.size()<<"\n";
// for(auto x: a)
// {
// cout<<x<<' ';
// }
// cout<<"\n";
// }
void solve() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j < k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
/*
void extendEuclid(int A, int B)
{
if(B==0)
{
x=1;
y=0;
}
else
{
extendEuclid(B, A%B);
int temp=x;
x=y;
y=temp-(A/B)*y;
}
}
int modularExponentiation(int X, int n, int M)
{
int result=1;
while(n>0)
{
if(n%2==1)
{
result=(x*result)%M;
}
else
{
x=x*x%M;
}
n=n/2;
return result;
}
}
int modInv(int A, int M)
{
extendEuclid(A, M)
return (x%M+M)%M;
}
int main()
{
int arr[4];
std::cin>>arr;
int A=arr[0], B=arr[1], C=arr[2], M=arr[3];
int D=modInv(C, M);
int E=modularExponentiation(A, B, M);
int ans=(D*E)%M;
std::cout<<ans;
}*/
/*int totalMultiples(int x, int a, int b, int c)
{
int un=x/a + x/b + x/c;
int in=x/lcm(a, b) + x/lcm(b, c) + x/lcm(a, c)
int fin=x/lcm(lcm(a, b), c)
int result=un-in+fin;
return result;
}
int binarySearch(vector<int> arr, int n)
{
int low=0;
int high=arr.size()-1;
while(low<high)
{
int mid=(high+low)/2;
if(arr[mid]<=n)
{
high=mid;
}
else
{
low=mid+1;
}
}
return low;
}
*/
/* Fast Factorization using Seive */
/*
int minPrime[n + 1];
for (int i = 2; i * i <= n; ++i) {
if (minPrime[i] == 0) { //If i is prime
for (int j = i * i; j <= n; j += i) {
if (minPrime[j] == 0) {
minPrime[j] = i;
}
}
}
}
for (int i = 2; i <= n; ++i) {
if (minPrime[i] == 0) {
minPrime[i] = i;
}
}
vector<int> factorize(int n) {
vector<int> res;
while (n != 1) {
res.push_back(minPrime[n]);
n /= minPrime[n];
}
return res;
}
*/ | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define maximum INT_MAX
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const long long inf = 1e11 + 5;
bool isPrime(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
ll factorial(ll n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); }
ll power(ll x, ll y) {
ll res = 1;
x = x;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
ll ncr(ll n, ll r) {
ll res = 1;
if (r > n)
return 0;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ll max(ll a, ll b) {
ll ans = a > b ? a : b;
return ans;
}
ll min(ll a, ll b) {
ll ans = a < b ? a : b;
return ans;
}
// void print_set(vector<int> a)
// {
// cout<<a.size()<<"\n";
// for(auto x: a)
// {
// cout<<x<<' ';
// }
// cout<<"\n";
// }
void solve() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
/*
void extendEuclid(int A, int B)
{
if(B==0)
{
x=1;
y=0;
}
else
{
extendEuclid(B, A%B);
int temp=x;
x=y;
y=temp-(A/B)*y;
}
}
int modularExponentiation(int X, int n, int M)
{
int result=1;
while(n>0)
{
if(n%2==1)
{
result=(x*result)%M;
}
else
{
x=x*x%M;
}
n=n/2;
return result;
}
}
int modInv(int A, int M)
{
extendEuclid(A, M)
return (x%M+M)%M;
}
int main()
{
int arr[4];
std::cin>>arr;
int A=arr[0], B=arr[1], C=arr[2], M=arr[3];
int D=modInv(C, M);
int E=modularExponentiation(A, B, M);
int ans=(D*E)%M;
std::cout<<ans;
}*/
/*int totalMultiples(int x, int a, int b, int c)
{
int un=x/a + x/b + x/c;
int in=x/lcm(a, b) + x/lcm(b, c) + x/lcm(a, c)
int fin=x/lcm(lcm(a, b), c)
int result=un-in+fin;
return result;
}
int binarySearch(vector<int> arr, int n)
{
int low=0;
int high=arr.size()-1;
while(low<high)
{
int mid=(high+low)/2;
if(arr[mid]<=n)
{
high=mid;
}
else
{
low=mid+1;
}
}
return low;
}
*/
/* Fast Factorization using Seive */
/*
int minPrime[n + 1];
for (int i = 2; i * i <= n; ++i) {
if (minPrime[i] == 0) { //If i is prime
for (int j = i * i; j <= n; j += i) {
if (minPrime[j] == 0) {
minPrime[j] = i;
}
}
}
}
for (int i = 2; i <= n; ++i) {
if (minPrime[i] == 0) {
minPrime[i] = i;
}
}
vector<int> factorize(int n) {
vector<int> res;
while (n != 1) {
res.push_back(minPrime[n]);
n /= minPrime[n];
}
return res;
}
*/ | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,916 | 960,917 | u128189308 | cpp |
p03161 | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define maximum INT_MAX
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const long long inf = 1e11 + 5;
bool isPrime(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
ll factorial(ll n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); }
ll power(ll x, ll y) {
ll res = 1;
x = x;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
ll ncr(ll n, ll r) {
ll res = 1;
if (r > n)
return 0;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ll max(ll a, ll b) {
ll ans = a > b ? a : b;
return ans;
}
ll min(ll a, ll b) {
ll ans = a < b ? a : b;
return ans;
}
// void print_set(vector<int> a)
// {
// cout<<a.size()<<"\n";
// for(auto x: a)
// {
// cout<<x<<' ';
// }
// cout<<"\n";
// }
void solve() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
/*
void extendEuclid(int A, int B)
{
if(B==0)
{
x=1;
y=0;
}
else
{
extendEuclid(B, A%B);
int temp=x;
x=y;
y=temp-(A/B)*y;
}
}
int modularExponentiation(int X, int n, int M)
{
int result=1;
while(n>0)
{
if(n%2==1)
{
result=(x*result)%M;
}
else
{
x=x*x%M;
}
n=n/2;
return result;
}
}
int modInv(int A, int M)
{
extendEuclid(A, M)
return (x%M+M)%M;
}
int main()
{
int arr[4];
std::cin>>arr;
int A=arr[0], B=arr[1], C=arr[2], M=arr[3];
int D=modInv(C, M);
int E=modularExponentiation(A, B, M);
int ans=(D*E)%M;
std::cout<<ans;
}*/
/*int totalMultiples(int x, int a, int b, int c)
{
int un=x/a + x/b + x/c;
int in=x/lcm(a, b) + x/lcm(b, c) + x/lcm(a, c)
int fin=x/lcm(lcm(a, b), c)
int result=un-in+fin;
return result;
}
int binarySearch(vector<int> arr, int n)
{
int low=0;
int high=arr.size()-1;
while(low<high)
{
int mid=(high+low)/2;
if(arr[mid]<=n)
{
high=mid;
}
else
{
low=mid+1;
}
}
return low;
}
*/
/* Fast Factorization using Seive */
/*
int minPrime[n + 1];
for (int i = 2; i * i <= n; ++i) {
if (minPrime[i] == 0) { //If i is prime
for (int j = i * i; j <= n; j += i) {
if (minPrime[j] == 0) {
minPrime[j] = i;
}
}
}
}
for (int i = 2; i <= n; ++i) {
if (minPrime[i] == 0) {
minPrime[i] = i;
}
}
vector<int> factorize(int n) {
vector<int> res;
while (n != 1) {
res.push_back(minPrime[n]);
n /= minPrime[n];
}
return res;
}
*/ | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\n'
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define maximum INT_MAX
using namespace std;
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const long long inf = 1e11 + 5;
bool isPrime(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
ll factorial(ll n) { return (n == 1 || n == 0) ? 1 : n * factorial(n - 1); }
ll power(ll x, ll y) {
ll res = 1;
x = x;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
ll ncr(ll n, ll r) {
ll res = 1;
if (r > n)
return 0;
if (r > n - r)
r = n - r;
for (ll i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll lcm(ll a, ll b) { return (a / gcd(a, b) * b); }
ll max(ll a, ll b) {
ll ans = a > b ? a : b;
return ans;
}
ll min(ll a, ll b) {
ll ans = a < b ? a : b;
return ans;
}
// void print_set(vector<int> a)
// {
// cout<<a.size()<<"\n";
// for(auto x: a)
// {
// cout<<x<<' ';
// }
// cout<<"\n";
// }
void solve() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
/*
void extendEuclid(int A, int B)
{
if(B==0)
{
x=1;
y=0;
}
else
{
extendEuclid(B, A%B);
int temp=x;
x=y;
y=temp-(A/B)*y;
}
}
int modularExponentiation(int X, int n, int M)
{
int result=1;
while(n>0)
{
if(n%2==1)
{
result=(x*result)%M;
}
else
{
x=x*x%M;
}
n=n/2;
return result;
}
}
int modInv(int A, int M)
{
extendEuclid(A, M)
return (x%M+M)%M;
}
int main()
{
int arr[4];
std::cin>>arr;
int A=arr[0], B=arr[1], C=arr[2], M=arr[3];
int D=modInv(C, M);
int E=modularExponentiation(A, B, M);
int ans=(D*E)%M;
std::cout<<ans;
}*/
/*int totalMultiples(int x, int a, int b, int c)
{
int un=x/a + x/b + x/c;
int in=x/lcm(a, b) + x/lcm(b, c) + x/lcm(a, c)
int fin=x/lcm(lcm(a, b), c)
int result=un-in+fin;
return result;
}
int binarySearch(vector<int> arr, int n)
{
int low=0;
int high=arr.size()-1;
while(low<high)
{
int mid=(high+low)/2;
if(arr[mid]<=n)
{
high=mid;
}
else
{
low=mid+1;
}
}
return low;
}
*/
/* Fast Factorization using Seive */
/*
int minPrime[n + 1];
for (int i = 2; i * i <= n; ++i) {
if (minPrime[i] == 0) { //If i is prime
for (int j = i * i; j <= n; j += i) {
if (minPrime[j] == 0) {
minPrime[j] = i;
}
}
}
}
for (int i = 2; i <= n; ++i) {
if (minPrime[i] == 0) {
minPrime[i] = i;
}
}
vector<int> factorize(int n) {
vector<int> res;
while (n != 1) {
res.push_back(minPrime[n]);
n /= minPrime[n];
}
return res;
}
*/ | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,918 | 960,917 | u128189308 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.