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>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const ll MOD = 1000 * 1000 * 1000 + 7;
using namespace std;
ll N;
ll k;
ll p[100005];
ll dp[100005];
ll ans[100005];
ll rec(ll idx, ll D) {
ll mini = INT_MAX;
if (idx == D)
return 0;
if (dp[idx] != INT_MAX)
return dp[idx];
for (int j = 1; j <= k; j++) {
if (idx + j <= D)
mini = min(mini, abs(p[idx] - p[idx + j]) + rec(idx + j, D));
}
dp[idx] = mini;
return dp[idx];
}
int main() {
fastio();
cin >> N;
cin >> k;
for (int i = 0; i < N; i++)
cin >> p[i];
fill(dp, dp + N, INT_MAX);
fill(ans, ans + N, INT_MAX);
ll g = rec(0, N);
cout << g;
return 0;
}
| #include <bits/stdc++.h>
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const ll MOD = 1000 * 1000 * 1000 + 7;
using namespace std;
ll N;
ll k;
ll p[100005];
ll dp[100005];
ll ans[100005];
ll rec(ll idx, ll D) {
ll mini = INT_MAX;
if (idx == D)
return 0;
if (dp[idx] != INT_MAX)
return dp[idx];
for (int j = 1; j <= k; j++) {
if (idx + j <= D) {
mini = min(mini, abs(p[idx] - p[idx + j]) + rec(idx + j, D));
}
}
dp[idx] = mini;
return dp[idx];
}
int main() {
fastio();
cin >> N;
cin >> k;
for (int i = 1; i <= N; i++)
cin >> p[i];
fill(dp, dp + N, INT_MAX);
fill(ans, ans + N, INT_MAX);
ll g = rec(1, N);
cout << g;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 960,921 | 960,922 | u494714436 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define R 1000000007
#define M 998244353
int mx = 0, mn = INT32_MAX;
struct maths_util {
vector<long long> fact;
maths_util(int n = 200001, long long q = R) {
fact.resize(n);
fact[0] = 1;
for (int i = 1; i < n; i++)
fact[i] = (fact[i - 1] * i) % q;
}
long long power_mod_q(long long x, long long n, long long q = R) {
if (n == 0)
return 1;
if (n % 2 == 0)
return power_mod_q((x * x) % q, n / 2, q);
else
return (x * power_mod_q((x * x) % q, n / 2, q)) % q;
}
long long inverse_mod_q(long long n, long long q = R) {
return power_mod_q(n, q - 2, q);
}
long long nCr_mod_q(long long n, long long r, long long q = R) {
return (((fact[n] * inverse_mod_q(fact[r], q)) % q) *
inverse_mod_q(fact[n - r], q)) %
q;
}
};
struct dsu {
vector<int> rank, parent;
dsu(int n) {
rank.assign(n, 0);
parent.resize(n);
for (int i = 0; i < n; i++)
parent[i] = i;
}
int find_set(int i) {
if (i == parent[i])
return i;
return parent[i] = find_set(parent[i]);
}
bool is_same_set(int i, int j) {
if (find_set(i) == find_set(j))
return true;
return false;
}
void union_set(int i, int j) {
if (!is_same_set(i, j)) {
int u = find_set(i), v = find_set(j);
if (rank[u] == rank[v]) {
parent[v] = u;
rank[u] += 1;
} else if (rank[u] > rank[v])
parent[v] = u;
else
parent[u] = v;
}
}
};
struct graph {
int v, time, count;
vector<pair<int, int>> *adj;
vector<bool> visited, in_stack, ap;
stack<int> s;
vector<int> color, cc, d, f, l, finish_time, indegree, sccs, topo, outdegree,
pred, child;
graph(int n) {
v = n;
adj = new vector<pair<int, int>>[n];
visited.assign(n, false);
in_stack.assign(n, false);
ap.assign(n, false);
color.assign(n, 0);
cc.assign(n, -1);
d.assign(n, -1);
f.assign(n, -1);
indegree.assign(n, 0);
outdegree.assign(n, 0);
pred.assign(n, -1);
child.assign(n, 0);
time = count = 0;
finish_time.assign(2 * n, -1);
l.assign(n, 0);
}
void add_edge(int u, int v, int w) {
adj[u].push_back(make_pair(v, w));
adj[v].push_back(make_pair(u, w));
}
void dfs() {
color.assign(v, 0);
cc.assign(v, -1);
time = count = 0;
finish_time.assign(2 * v, -1);
visited.assign(v, false);
pred.assign(v, -1);
for (int i = 0; i < v; i++) {
if (color[i] == 0) {
dfs(i);
count++;
}
}
for (int i = 0; i < v; i++)
finish_time[f[i]] = i;
}
void dfs(int i) {
color[i] = 1;
cc[i] = count;
d[i] = time;
time++;
for (auto x : adj[i])
if (color[x.first] == 0) {
pred[x.first] = i;
dfs(x.first);
}
color[i] = 2;
f[i] = time;
time++;
}
void scc() {
graph g_t(v);
for (int i = 0; i < v; i++)
for (auto x : adj[i])
g_t.add_edge(x.first, i, x.second);
dfs();
for (int i = 2 * v - 1; i >= 0; i--) {
if (finish_time[i] != -1 && g_t.color[finish_time[i]] == 0) {
g_t.dfs(finish_time[i]);
g_t.count++;
}
}
sccs = g_t.cc;
count = g_t.count;
}
void topological_sort() {
for (int i = 0; i < v; i++)
if (adj[i].size())
outdegree[i] = adj[i].size();
for (int i = 0; i < v; i++)
for (auto x : adj[i])
indegree[x.first]++;
vector<int> zero;
for (int i = 0; i < v; i++)
if (!indegree[i])
zero.push_back(i);
while (!zero.empty()) {
int v = zero.back();
topo.push_back(v);
zero.pop_back();
for (auto x : adj[v]) {
indegree[x.first]--;
if (!indegree[x.first])
zero.push_back(x.first);
}
}
}
void tarjan() {
for (int i = 0; i < v; i++)
if (!color[i])
tarjan(i);
}
void tarjan(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
s.push(i);
in_stack[i] = true;
for (auto x : adj[i]) {
if (!color[x.first]) {
tarjan(x.first);
l[i] = min(l[i], l[x.first]);
} else if (in_stack[x.first]) {
l[i] = min(l[i], d[x.first]);
}
}
color[i] = 2;
f[i] = time;
time++;
if (d[i] == l[i]) {
while (s.top() != i)
cout << s.top() << ' ', in_stack[s.top()] = false, s.pop();
cout << s.top() << '\n', in_stack[s.top()] = false, s.pop();
}
}
void articulate() {
ap.assign(v, false);
color.assign(v, 0);
child.assign(v, 0);
time = 0;
d.assign(v, -1);
f.assign(v, -1);
l.assign(v, 0);
pred.assign(v, -1);
for (int i = 0; i < v; i++)
if (color[i] == 0) {
articulate(i);
if (child[i] == 1 || child[i] == 0)
ap[i] = false;
}
}
void articulate(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
for (auto x : adj[i]) {
if (pred[i] != x.first && color[x.first] == 1)
l[i] = min(l[i], d[x.first]);
if (!color[x.first]) {
pred[x.first] = i;
child[i]++;
articulate(x.first);
l[i] = min(l[i], l[x.first]);
}
if (l[x.first] >= d[i])
ap[i] = true;
}
f[i] = time;
time++;
color[i] = 2;
}
void bridges() {
time = 0;
f.assign(v, -1);
d.assign(v, -1);
l.assign(v, 0);
color.assign(v, 0);
pred.assign(v, -1);
for (int i = 0; i < v; i++)
if (color[i] == 0)
bridge(i);
}
void bridge(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
for (auto itr = adj[i].begin(); itr != adj[i].end(); itr++) {
if (pred[i] != itr->first && color[itr->first] == 1)
l[i] = min(l[i], d[itr->first]);
if (!color[itr->first]) {
pred[itr->first] = i;
bridge(itr->first);
l[i] = min(l[i], l[itr->first]);
}
if (l[itr->first] > d[i])
itr->second = 1;
}
color[i] = 2;
f[i] = time;
time++;
}
};
struct kmp {
vector<int> lps;
string p, t;
kmp(string &p, string &t) {
this->p = p;
this->t = t;
// PREPROCESSING
lps.assign(p.size(), 0);
lps[0] = 0;
int len = 0, i = 1, j;
while (i < p.size()) {
if (p[i] == p[len])
lps[i++] = ++len;
else if (len)
len = lps[len - 1];
else
lps[i++] = 0;
}
// STRING MATCHING
i = j = 0;
while (i < t.size()) {
if (p[j] == t[i])
j++, i++;
if (j == p.size())
j = lps[j - 1];
else if (i < t.size() && p[j] != t[i]) {
if (j)
j = lps[j - 1];
else
i++;
}
}
}
};
struct segment_tree {
int n;
vector<int> a;
vector<int> tree;
segment_tree(vector<int> &a) {
n = a.size();
this->a = a;
tree.resize(4 * n);
build(0, 0, n - 1);
}
void build(int node, int l, int r) {
if (l == r)
tree[node] = a[l] = a[r];
else {
int mid = (l + r) / 2;
build(2 * node + 1, l, mid);
build(2 * node + 2, mid + 1, r);
tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
}
}
void update(int node, int l, int r, int i, char x) {
if (l == r) {
a[l] = a[r] = x;
tree[node] = a[l] = a[r];
} else {
int mid = (l + r) / 2;
if (i >= l && i <= mid)
update(2 * node + 1, l, mid, i, x);
else
update(2 * node + 2, mid + 1, r, i, x);
tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
}
}
int query(int node, int l, int r, int s, int e) {
if (l == s && r == e)
return tree[node];
else {
int mid = (s + e) / 2;
if (r <= mid)
return query(2 * node + 1, l, r, s, mid);
else if (l > mid)
return query(2 * node + 2, l, r, mid + 1, e);
else
return query(2 * node + 1, l, mid, s, mid) +
query(2 * node + 2, mid + 1, r, mid + 1, e);
}
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> h(n);
vector<long long> c(n, INT32_MAX);
for (int i = 0; i < n; i++)
cin >> h[i];
c[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
for (int j = 1; j <= min(k, n - i); j++)
c[i] = min(c[i], c[i + j] + abs(h[i] - h[i + j]));
}
cout << c[0] << '\n';
// int k, q;
// cin >> k >> q;
// vector<long long> d(k), d_sum(k);
// for(int i = 0; i < k; i++)
// cin >> d[i];
// d_sum[0] = d[0];
// for(int i = 1; i < k; i++)
// d_sum[i] = d_sum[i-1] + d[i];
// while(q--)
// {
// int n, x, m, z = 0;
// long long ans = 0;
// cin >> n >> x >> m;
// vector<long long> d_mod_m(k), a(k + 1);
// for(int i = 0; i < k; i++)
// d_mod_m[i] = d[i] % m;
// for(int i = 0; i < k; i++)
// if(d_mod_m[i] == 0)
// z++;
// ans = ans + (n / k) * z;
// for(int i = 0; i < (n % k); i++)
// if(d_mod_m[i] == 0)
// ans++;
// a[0] = x % m;
// for(int i = 0; i < k; i++)
// a[i + 1] = (x + d_sum[i]) / m;
// for(int i = 0; i < k; i++)
// cout << d_mod_m[i] << ' ';
// cout << '\n';
// for(auto x : a)
// cout << x << ' ';
// cout << '\n';
// }
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define R 1000000007
#define M 998244353
int mx = 0, mn = INT32_MAX;
struct maths_util {
vector<long long> fact;
maths_util(int n = 200001, long long q = R) {
fact.resize(n);
fact[0] = 1;
for (int i = 1; i < n; i++)
fact[i] = (fact[i - 1] * i) % q;
}
long long power_mod_q(long long x, long long n, long long q = R) {
if (n == 0)
return 1;
if (n % 2 == 0)
return power_mod_q((x * x) % q, n / 2, q);
else
return (x * power_mod_q((x * x) % q, n / 2, q)) % q;
}
long long inverse_mod_q(long long n, long long q = R) {
return power_mod_q(n, q - 2, q);
}
long long nCr_mod_q(long long n, long long r, long long q = R) {
return (((fact[n] * inverse_mod_q(fact[r], q)) % q) *
inverse_mod_q(fact[n - r], q)) %
q;
}
};
struct dsu {
vector<int> rank, parent;
dsu(int n) {
rank.assign(n, 0);
parent.resize(n);
for (int i = 0; i < n; i++)
parent[i] = i;
}
int find_set(int i) {
if (i == parent[i])
return i;
return parent[i] = find_set(parent[i]);
}
bool is_same_set(int i, int j) {
if (find_set(i) == find_set(j))
return true;
return false;
}
void union_set(int i, int j) {
if (!is_same_set(i, j)) {
int u = find_set(i), v = find_set(j);
if (rank[u] == rank[v]) {
parent[v] = u;
rank[u] += 1;
} else if (rank[u] > rank[v])
parent[v] = u;
else
parent[u] = v;
}
}
};
struct graph {
int v, time, count;
vector<pair<int, int>> *adj;
vector<bool> visited, in_stack, ap;
stack<int> s;
vector<int> color, cc, d, f, l, finish_time, indegree, sccs, topo, outdegree,
pred, child;
graph(int n) {
v = n;
adj = new vector<pair<int, int>>[n];
visited.assign(n, false);
in_stack.assign(n, false);
ap.assign(n, false);
color.assign(n, 0);
cc.assign(n, -1);
d.assign(n, -1);
f.assign(n, -1);
indegree.assign(n, 0);
outdegree.assign(n, 0);
pred.assign(n, -1);
child.assign(n, 0);
time = count = 0;
finish_time.assign(2 * n, -1);
l.assign(n, 0);
}
void add_edge(int u, int v, int w) {
adj[u].push_back(make_pair(v, w));
adj[v].push_back(make_pair(u, w));
}
void dfs() {
color.assign(v, 0);
cc.assign(v, -1);
time = count = 0;
finish_time.assign(2 * v, -1);
visited.assign(v, false);
pred.assign(v, -1);
for (int i = 0; i < v; i++) {
if (color[i] == 0) {
dfs(i);
count++;
}
}
for (int i = 0; i < v; i++)
finish_time[f[i]] = i;
}
void dfs(int i) {
color[i] = 1;
cc[i] = count;
d[i] = time;
time++;
for (auto x : adj[i])
if (color[x.first] == 0) {
pred[x.first] = i;
dfs(x.first);
}
color[i] = 2;
f[i] = time;
time++;
}
void scc() {
graph g_t(v);
for (int i = 0; i < v; i++)
for (auto x : adj[i])
g_t.add_edge(x.first, i, x.second);
dfs();
for (int i = 2 * v - 1; i >= 0; i--) {
if (finish_time[i] != -1 && g_t.color[finish_time[i]] == 0) {
g_t.dfs(finish_time[i]);
g_t.count++;
}
}
sccs = g_t.cc;
count = g_t.count;
}
void topological_sort() {
for (int i = 0; i < v; i++)
if (adj[i].size())
outdegree[i] = adj[i].size();
for (int i = 0; i < v; i++)
for (auto x : adj[i])
indegree[x.first]++;
vector<int> zero;
for (int i = 0; i < v; i++)
if (!indegree[i])
zero.push_back(i);
while (!zero.empty()) {
int v = zero.back();
topo.push_back(v);
zero.pop_back();
for (auto x : adj[v]) {
indegree[x.first]--;
if (!indegree[x.first])
zero.push_back(x.first);
}
}
}
void tarjan() {
for (int i = 0; i < v; i++)
if (!color[i])
tarjan(i);
}
void tarjan(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
s.push(i);
in_stack[i] = true;
for (auto x : adj[i]) {
if (!color[x.first]) {
tarjan(x.first);
l[i] = min(l[i], l[x.first]);
} else if (in_stack[x.first]) {
l[i] = min(l[i], d[x.first]);
}
}
color[i] = 2;
f[i] = time;
time++;
if (d[i] == l[i]) {
while (s.top() != i)
cout << s.top() << ' ', in_stack[s.top()] = false, s.pop();
cout << s.top() << '\n', in_stack[s.top()] = false, s.pop();
}
}
void articulate() {
ap.assign(v, false);
color.assign(v, 0);
child.assign(v, 0);
time = 0;
d.assign(v, -1);
f.assign(v, -1);
l.assign(v, 0);
pred.assign(v, -1);
for (int i = 0; i < v; i++)
if (color[i] == 0) {
articulate(i);
if (child[i] == 1 || child[i] == 0)
ap[i] = false;
}
}
void articulate(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
for (auto x : adj[i]) {
if (pred[i] != x.first && color[x.first] == 1)
l[i] = min(l[i], d[x.first]);
if (!color[x.first]) {
pred[x.first] = i;
child[i]++;
articulate(x.first);
l[i] = min(l[i], l[x.first]);
}
if (l[x.first] >= d[i])
ap[i] = true;
}
f[i] = time;
time++;
color[i] = 2;
}
void bridges() {
time = 0;
f.assign(v, -1);
d.assign(v, -1);
l.assign(v, 0);
color.assign(v, 0);
pred.assign(v, -1);
for (int i = 0; i < v; i++)
if (color[i] == 0)
bridge(i);
}
void bridge(int i) {
color[i] = 1;
d[i] = time;
time++;
l[i] = d[i];
for (auto itr = adj[i].begin(); itr != adj[i].end(); itr++) {
if (pred[i] != itr->first && color[itr->first] == 1)
l[i] = min(l[i], d[itr->first]);
if (!color[itr->first]) {
pred[itr->first] = i;
bridge(itr->first);
l[i] = min(l[i], l[itr->first]);
}
if (l[itr->first] > d[i])
itr->second = 1;
}
color[i] = 2;
f[i] = time;
time++;
}
};
struct kmp {
vector<int> lps;
string p, t;
kmp(string &p, string &t) {
this->p = p;
this->t = t;
// PREPROCESSING
lps.assign(p.size(), 0);
lps[0] = 0;
int len = 0, i = 1, j;
while (i < p.size()) {
if (p[i] == p[len])
lps[i++] = ++len;
else if (len)
len = lps[len - 1];
else
lps[i++] = 0;
}
// STRING MATCHING
i = j = 0;
while (i < t.size()) {
if (p[j] == t[i])
j++, i++;
if (j == p.size())
j = lps[j - 1];
else if (i < t.size() && p[j] != t[i]) {
if (j)
j = lps[j - 1];
else
i++;
}
}
}
};
struct segment_tree {
int n;
vector<int> a;
vector<int> tree;
segment_tree(vector<int> &a) {
n = a.size();
this->a = a;
tree.resize(4 * n);
build(0, 0, n - 1);
}
void build(int node, int l, int r) {
if (l == r)
tree[node] = a[l] = a[r];
else {
int mid = (l + r) / 2;
build(2 * node + 1, l, mid);
build(2 * node + 2, mid + 1, r);
tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
}
}
void update(int node, int l, int r, int i, char x) {
if (l == r) {
a[l] = a[r] = x;
tree[node] = a[l] = a[r];
} else {
int mid = (l + r) / 2;
if (i >= l && i <= mid)
update(2 * node + 1, l, mid, i, x);
else
update(2 * node + 2, mid + 1, r, i, x);
tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
}
}
int query(int node, int l, int r, int s, int e) {
if (l == s && r == e)
return tree[node];
else {
int mid = (s + e) / 2;
if (r <= mid)
return query(2 * node + 1, l, r, s, mid);
else if (l > mid)
return query(2 * node + 2, l, r, mid + 1, e);
else
return query(2 * node + 1, l, mid, s, mid) +
query(2 * node + 2, mid + 1, r, mid + 1, e);
}
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> h(n);
vector<long long> c(n, INT32_MAX);
for (int i = 0; i < n; i++)
cin >> h[i];
c[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
for (int j = 1; j < min(k + 1, n - i); j++)
c[i] = min(c[i], c[i + j] + abs(h[i] - h[i + j]));
}
cout << c[0] << '\n';
// int k, q;
// cin >> k >> q;
// vector<long long> d(k), d_sum(k);
// for(int i = 0; i < k; i++)
// cin >> d[i];
// d_sum[0] = d[0];
// for(int i = 1; i < k; i++)
// d_sum[i] = d_sum[i-1] + d[i];
// while(q--)
// {
// int n, x, m, z = 0;
// long long ans = 0;
// cin >> n >> x >> m;
// vector<long long> d_mod_m(k), a(k + 1);
// for(int i = 0; i < k; i++)
// d_mod_m[i] = d[i] % m;
// for(int i = 0; i < k; i++)
// if(d_mod_m[i] == 0)
// z++;
// ans = ans + (n / k) * z;
// for(int i = 0; i < (n % k); i++)
// if(d_mod_m[i] == 0)
// ans++;
// a[0] = x % m;
// for(int i = 0; i < k; i++)
// a[i + 1] = (x + d_sum[i]) / m;
// for(int i = 0; i < k; i++)
// cout << d_mod_m[i] << ' ';
// cout << '\n';
// for(auto x : a)
// cout << x << ' ';
// cout << '\n';
// }
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 960,927 | 960,928 | u786837146 | cpp |
p03161 | /*BINH :))*/
#include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long llu;
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ep emplace_back
#define sz(a) (int)a.size()
#define FOR(x, a, b) for (int x = a, u, v; x <= b; x++)
#define FOD(x, a, b) for (int x = a; x >= b; x--)
#define REP(x, a, b) for (int x = a; x < b; x++)
#define RED(x, a, b) for (int x = a; x > b; x--)
#define EL cout << endl
#define maxn 1005
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#pragma GCC optimize("Ofast")
int n, m, k, kc, xa;
int a[100000], f[100000];
int main() {
IO cin >> n >> k;
FOR(i, 1, n) { cin >> a[i]; }
FOR(i, 2, n) {
f[i] = 1e9;
FOR(j, 1, k) {
if (i - j < 0)
break;
f[i] = min(f[i], abs(a[i] - a[i - j]) + f[i - j]);
}
}
cout << f[n];
}
| /*BINH :))*/
#include <bits/stdc++.h>
#include <queue>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long llu;
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ep emplace_back
#define sz(a) (int)a.size()
#define FOR(x, a, b) for (int x = a, u, v; x <= b; x++)
#define FOD(x, a, b) for (int x = a; x >= b; x--)
#define REP(x, a, b) for (int x = a; x < b; x++)
#define RED(x, a, b) for (int x = a; x > b; x--)
#define EL cout << endl
#define maxn 1005
#define vi vector<int>
#define ii pair<int, int>
#define vii vector<ii>
#pragma GCC optimize("Ofast")
ll n, m, k, kc, xa;
ll a[1000000], f[1000000];
int main() {
IO cin >> n >> k;
FOR(i, 1, n) { cin >> a[i]; }
FOR(i, 2, n) {
f[i] = 1e9;
FOR(j, 1, k) {
if (i - j <= 0)
break;
f[i] = min(f[i], abs(a[i] - a[i - j]) + f[i - j]);
}
}
cout << f[n];
}
| [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,936 | 960,937 | u858980719 | cpp |
p03161 | #include <bits/stdc++.h>
#define N 100010
#define pb push_back
#define fi first
#define se second
#define si size()
#define ll long long
#define mp make_pair
#define iter ::iterator
#define all(v) v.begin(), v.end()
#define pp pop_back
#define mapiter map<int, int>::iterator
#define forn(i, n) for (int i = 0; i < n; ++i)
#define forn1(i, n) for (int i = 1; i <= n; ++i)
#define forr(i, n) for (int i = n - 1; i >= 0; --i)
#define forr1(i, n) for (int i = n; i >= 1; --i)
#define r0 return 0
#define barnarnar \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define lld long double
#define elif else if
const ll inf = 1e12 + 7;
const lld EPS = 0.00000001;
const ll modw = 1e9 + 7;
using namespace std;
ll dp[N];
ll a[N];
int main() {
barnarnar int n, k;
cin >> n >> k;
forn1(i, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
ll ans = inf;
for (int j = i - 1, cur = 0; cur < k; cur++, j--)
ans = min(ans, dp[j] + abs(a[j] - a[i]));
dp[i] = ans;
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
#define N 100010
#define pb push_back
#define fi first
#define se second
#define si size()
#define ll long long
#define mp make_pair
#define iter ::iterator
#define all(v) v.begin(), v.end()
#define pp pop_back
#define mapiter map<int, int>::iterator
#define forn(i, n) for (int i = 0; i < n; ++i)
#define forn1(i, n) for (int i = 1; i <= n; ++i)
#define forr(i, n) for (int i = n - 1; i >= 0; --i)
#define forr1(i, n) for (int i = n; i >= 1; --i)
#define r0 return 0
#define barnarnar \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define lld long double
#define elif else if
const ll inf = 1e12 + 7;
const lld EPS = 0.00000001;
const ll modw = 1e9 + 7;
using namespace std;
ll dp[N];
ll a[N];
int main() {
barnarnar int n, k;
cin >> n >> k;
forn1(i, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
ll ans = inf;
for (int j = i - 1, cur = 0; cur < k && j >= 1; cur++, j--)
ans = min(ans, dp[j] + abs(a[j] - a[i]));
dp[i] = ans;
}
cout << dp[n];
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 960,951 | 960,950 | u930689495 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int DP[N];
DP[0] = 0;
DP[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
int tmp = 100000;
for (int j = 1; j <= min(K, i); ++j) {
if (tmp > DP[i - j] + abs(h[i] - h[i - j]))
tmp = DP[i - j] + abs(h[i] - h[i - j]);
}
DP[i] = tmp;
}
cout << DP[N - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int DP[N];
DP[0] = 0;
DP[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
long tmp = 1e9;
for (int j = 1; j <= min(K, i); ++j) {
if (tmp > DP[i - j] + abs(h[i] - h[i - j]))
tmp = DP[i - j] + abs(h[i] - h[i - j]);
}
DP[i] = tmp;
}
cout << DP[N - 1] << endl;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change"
] | 960,952 | 960,953 | u860546679 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
int dp[N];
dp[0] = 0;
for (int i = 1; i < N; ++i) {
if (i < K) {
dp[i] = 100000;
for (int j = 0; j < i; ++j) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
} else {
dp[i] = 100000;
for (int j = i - K; j < i; ++j) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
}
/*
for(int i=0;i<N;++i){
cout<<dp[i]<<" ";
}
cout<<endl;
*/
cout << dp[N - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long h[N];
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
long dp[N];
dp[0] = 0;
for (int i = 1; i < N; ++i) {
if (i < K) {
// cout<<i<<endl;
dp[i] = 1000000000;
for (int j = 0; j < i; ++j) {
// cout<<j<<" ";
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
// cout<<endl;
} else {
// cout<<i<<endl;
dp[i] = 1000000000;
for (int j = i - K; j < i; ++j) {
// cout<<j<<" ";
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
// cout<<endl;
}
}
/*
for(int i=0;i<N;++i){
cout<<dp[i]<<" ";
}
cout<<endl;
*/
cout << dp[N - 1] << endl;
}
| [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 960,957 | 960,955 | u860546679 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, K, h[100010];
int dp[100010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
dp[i] = MM;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i < N; i++) {
for (int j = 0; i + j < N && j < K; j++) {
dp[i + j] = min(dp[i] + abs(h[i + j] - h[i]), dp[i + j]);
}
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int, int>
#define chmax(a, b) (a < b ? a = b : 0)
#define chmin(a, b) (a > b ? a = b : 0)
#define INF (1 << 29) // 536870912
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int N, K, h[100010];
int dp[100010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
dp[i] = MM;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i < N; i++) {
for (int j = 1; i + j < N && j <= K; j++) {
dp[i + j] = min(dp[i] + abs(h[i + j] - h[i]), dp[i + j]);
}
}
cout << dp[N - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 960,961 | 960,962 | u342051078 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int N, K, tmp, min_cost;
cin >> N >> K;
vector<int> h(N), dp(N, 0);
rep(i, N) cin >> h[i];
dp[1] = abs(h[1] - h[0]);
rep2(i, 2, N) {
min_cost = 999999999;
rep2(j, 1, min(i, K + 1)) {
tmp = dp[i - j] + abs(h[i] - h[i - j]);
min_cost = min(min_cost, tmp);
}
dp[i] = min_cost;
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
int main() {
int N, K, tmp, min_cost;
cin >> N >> K;
vector<int> h(N), dp(N, 0);
rep(i, N) cin >> h[i];
dp[1] = abs(h[1] - h[0]);
rep2(i, 2, N) {
min_cost = 999999999;
rep2(j, 1, min(i, K) + 1) {
tmp = dp[i - j] + abs(h[i] - h[i - j]);
min_cost = min(min_cost, tmp);
}
dp[i] = min_cost;
}
cout << dp[N - 1] << endl;
return 0;
} | [
"call.arguments.change"
] | 960,973 | 960,974 | u463775490 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], dp[N];
dp[0] = 0;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 1; i < N; i++) {
dp[i] = 2000000000;
for (int j = 1; j < min(K, i + 1); j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
cout << dp[N - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], dp[N];
dp[0] = 0;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 1; i < N; i++) {
dp[i] = 2000000000;
for (int j = 1; j <= min(K, i); j++)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
cout << dp[N - 1] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,975 | 960,976 | u820224016 | cpp |
p03161 | #include <iostream>
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int ze(int a) {
if (a > 0)
return a;
else
return -a;
}
int main() {
int N, K;
cin >> N >> K;
K = min(N, K);
int h[100004];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int cost[100004];
cost[1] = 0;
cost[2] = ze(h[1] - h[0]);
if (N == 2) {
cout << cost[2] << endl;
return 0;
}
int k = cost[2] + ze(h[2] - h[1]);
int j;
if (K > 1) {
j = ze(h[2] - h[0]);
} else
j = 10000;
cost[3] = min(k, j);
if (N == 3) {
cout << cost[3] << endl;
return 0;
}
for (int i = 4; i <= N; i++) {
int m = 10000;
for (int l = 1; l <= K; l++) {
if (l > i - 1)
break;
int p = cost[i - l] + ze(h[i - 1] - h[i - l - 1]);
if (m > p)
m = p;
}
cost[i] = m;
}
cout << cost[N] << endl;
} | #include <iostream>
using namespace std;
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
int ze(int a) {
if (a > 0)
return a;
else
return -a;
}
int main() {
int N, K;
cin >> N >> K;
K = min(N, K);
int h[100004];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int cost[100004];
cost[1] = 0;
cost[2] = ze(h[1] - h[0]);
if (N == 2) {
cout << cost[2] << endl;
return 0;
}
int k = cost[2] + ze(h[2] - h[1]);
int j;
if (K > 1) {
j = ze(h[2] - h[0]);
} else
j = 10000000;
cost[3] = min(k, j);
if (N == 3) {
cout << cost[3] << endl;
return 0;
}
for (int i = 4; i <= N; i++) {
long int m = 1000002000;
for (int l = 1; l <= K; l++) {
if (l > i - 1)
break;
int p = cost[i - l] + ze(h[i - 1] - h[i - l - 1]);
if (m > p)
m = p;
}
cost[i] = m;
}
cout << cost[N] << endl;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 960,981 | 960,978 | u058186113 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pie acos(-1)
#define loop(i, a, n) for (ll i = a; i < n; i++)
#define trav(a, x) for (auto &a : x)
#define vi vector<int>
#define vl vector<ll>
#define pii pair<ll, ll>
#define endl "\n"
#define w 1e5
const ll q = 1e5 + 2;
vector<ll> dp(q, 1e5);
// dp[i] be minimium cost for reaching ith stone
ll k;
void solve() {
ll n;
cin >> n >> k;
vl a(n + 1);
loop(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
loop(i, 1, n + 1) {
for (ll j = 1; j <= k; j++) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], abs(a[j + i] - a[i]) + dp[i]);
}
}
cout << dp[n];
}
int main() {
// your code goes here
io;
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pie acos(-1)
#define loop(i, a, n) for (ll i = a; i < n; i++)
#define trav(a, x) for (auto &a : x)
#define vi vector<int>
#define vl vector<ll>
#define pii pair<ll, ll>
#define endl "\n"
#define w 1e5
const ll q = 1e5 + 2;
vector<ll> dp(q, 1e12);
// dp[i] be minimium cost for reaching ith stone
ll k;
void solve() {
ll n;
cin >> n >> k;
vl a(n + 1);
loop(i, 1, n + 1) cin >> a[i];
dp[1] = 0;
loop(i, 1, n + 1) {
for (ll j = 1; j <= k; j++) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], abs(a[j + i] - a[i]) + dp[i]);
}
}
cout << dp[n];
}
int main() {
// your code goes here
io;
solve();
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 960,984 | 960,985 | u194186470 | cpp |
p03161 | #include <bits/stdc++.h>
#include <stdio.h>
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define ll long long int
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
using namespace std;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
ll v[n], dp[n];
f(i, 0, n) cin >> v[i];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
f(i, 2, n) {
ll temp = INT_MAX;
for (ll j = 1; j < k + 1 && j < i; j++)
temp = min(dp[i - j] + abs(v[i] - v[i - j]), temp);
dp[i] = temp;
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
#include <stdio.h>
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define ll long long int
#define F first
#define S second
#define f(i, x, n) for (ll i = x; i < n; i++)
using namespace std;
int main() {
ll n, k, sum = 0;
cin >> n >> k;
ll v[n], dp[n];
f(i, 0, n) cin >> v[i];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
f(i, 2, n) {
ll temp = INT_MAX;
for (ll j = 1; j < k + 1 && j <= i; j++)
temp = min(dp[i - j] + abs(v[i] - v[i - j]), temp);
dp[i] = temp;
}
cout << dp[n - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,988 | 960,989 | u080477196 | cpp |
p03161 | #include <bits/stdc++.h>
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;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<long long> dp(N);
for (int i = 0; i < N; i++) {
dp.at(i) = INF;
}
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K; j++) {
if (i >= j)
chmin(dp.at(i), dp.at(i - j) + abs(vec.at(i - j) - vec.at(i)));
}
}
cout << dp.at(N - 1) << endl;
} | #include <bits/stdc++.h>
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;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
vector<long long> dp(N);
for (int i = 0; i < N; i++) {
dp.at(i) = INF;
}
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i >= j)
chmin(dp.at(i), dp.at(i - j) + abs(vec.at(i - j) - vec.at(i)));
}
}
cout << dp.at(N - 1) << endl;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,990 | 960,991 | u128837995 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> stone(n);
for (int i = 0; i < n; i++)
cin >> stone[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j <= i + k; j++)
dp[j] = min(dp[j], dp[i] + abs(stone[j] - stone[i]));
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> stone(n);
for (int i = 0; i < n; i++)
cin >> stone[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (int j = i + 1; j <= i + k; j++)
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(stone[j] - stone[i]));
cout << dp[n - 1];
return 0;
}
| [
"control_flow.branch.if.add"
] | 961,011 | 961,012 | u353919145 | cpp |
p03161 | ////////////////////////////////////
/// Please Give Me AC!!! ///
////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) \
for (int i = 0; i < (int)in.size(); i++) \
cin >> in[i]
#define forout(out) \
for (int i = 0; i < (int)out.size(); i++) \
cout << out[i] << endl
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
forin(h);
vector<int> dp(N, 1e9);
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;
} | ////////////////////////////////////
/// Please Give Me AC!!! ///
////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) \
for (int i = 0; i < (int)in.size(); i++) \
cin >> in[i]
#define forout(out) \
for (int i = 0; i < (int)out.size(); i++) \
cout << out[i] << endl
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
forin(h);
vector<int> dp(N + K, 1e9);
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;
} | [
"assignment.change"
] | 961,013 | 961,014 | u060116081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog1(int N, int a[]) {
int dp[N + 1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2] - a[1]), abs(a[2] - a[0]));
for (int i = 3; i < N; i++) {
dp[i + 1] =
min(dp[i] + abs(a[i] - a[i - 1]), dp[i - 1] + abs(a[i] - a[i - 2]));
}
return dp[N];
}
int frog2(int N, int a[], int k) {
int dp[N + 1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
for (int i = 3; i <= N; i++) {
dp[i] = INT16_MAX;
for (int j = 1; j <= k; j++)
if (i - j - 1 >= 0) {
if (i - j - 1 == 0)
dp[i] = min(dp[i], abs(a[i - 1] - a[i - j - 1]));
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i - 1] - a[i - j - 1]));
}
}
return dp[N];
}
int main() {
int N, k;
cin >> N >> k;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
cout << frog2(N, a, k);
} | #include <bits/stdc++.h>
using namespace std;
int frog1(int N, int a[]) {
int dp[N + 1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
dp[3] = min(dp[2] + abs(a[2] - a[1]), abs(a[2] - a[0]));
for (int i = 3; i < N; i++) {
dp[i + 1] =
min(dp[i] + abs(a[i] - a[i - 1]), dp[i - 1] + abs(a[i] - a[i - 2]));
}
return dp[N];
}
int frog2(int N, int a[], int k) {
int dp[N + 1];
dp[0] = 0;
dp[1] = a[0];
dp[2] = abs(a[1] - a[0]);
for (int i = 3; i <= N; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++)
if (i - j - 1 >= 0) {
if (i - j - 1 == 0)
dp[i] = min(dp[i], abs(a[i - 1] - a[i - j - 1]));
else
dp[i] = min(dp[i], dp[i - j] + abs(a[i - 1] - a[i - j - 1]));
}
}
return dp[N];
}
int main() {
int N, k;
cin >> N >> k;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
cout << frog2(N, a, k);
} | [
"assignment.value.change",
"identifier.change"
] | 961,015 | 961,016 | u810232576 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
ll n, k;
using namespace std;
int main() {
cin >> n >> k;
int arr[n];
int memo[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
memo[i] = 10000;
memo[0] = 0;
// memo[1]=abs(arr[0]-arr[1]);//Queda rebundante. Sigue siendo 10000
for (int i = 0; i < n; i++)
for (int j = 1; j <= k && j + i < n; j++)
memo[j + i] = min(memo[j + i], memo[i] + abs(arr[i] - arr[j + i]));
cout << memo[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
ll n, k;
using namespace std;
int main() {
cin >> n >> k;
int arr[n];
int memo[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++)
memo[i] = INT_MAX;
memo[0] = 0;
// memo[1]=abs(arr[0]-arr[1]);//Queda rebundante. Sigue siendo 10000
for (int i = 0; i < n; i++)
for (int j = 1; j <= k && j + i < n; j++)
memo[j + i] = min(memo[j + i], memo[i] + abs(arr[i] - arr[j + i]));
cout << memo[n - 1] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 961,024 | 961,025 | u863370423 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int m = 110000;
int a, b, c[m], d[m];
int main() {
scanf("%d%d", &a, &b);
for (int i = 0; i < a; i++)
scanf("%d", &c[i]);
memset(d, 0x3f, sizeof(d)), d[1] = 0;
for (int i = 1; i < a; i++)
for (int j = 0; j < i && j <= b; j++)
d[i] = min(d[i], d[i - j] + abs(c[i] - c[i - j]));
printf("%d", d[a]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int m = 110000;
int a, b, c[m], d[m];
int main() {
scanf("%d%d", &a, &b);
for (int i = 1; i <= a; i++)
scanf("%d", &c[i]);
memset(d, 0x3f, sizeof(d)), d[1] = 0;
for (int i = 2; i <= a; i++)
for (int j = 1; j < i && j <= b; j++)
d[i] = min(d[i], d[i - j] + abs(c[i] - c[i - j]));
printf("%d", d[a]);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,027 | 961,028 | u863370423 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using namespace std;
const int inf = 0x3f3f3f3f;
int h[100100];
int dp[100100];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int least = inf;
for (int j = max(0, i - k); j < i; j++) {
least = min(least, dp[j] + abs(h[i] - h[j]));
}
dp[i] = least;
}
cout << dp[n];
}
| #include <algorithm>
#include <iostream>
using namespace std;
const int inf = 0x3f3f3f3f;
int h[100100];
int dp[100100];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int least = inf;
for (int j = max(1, i - k); j < i; j++) {
least = min(least, dp[j] + abs(h[i] - h[j]));
}
dp[i] = least;
}
cout << dp[n];
}
| [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 961,029 | 961,030 | u863370423 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int h;
for (long long int i = 1; i <= n; i++) {
cin >> h;
heights.at(i) = h;
}
dp[1] = 0;
dp[2] = abs(heights[2] - heights[1]);
for (long long int i = 3; i <= n; i++) {
long long int best = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (long long int j = 2; j <= k && j < n; j++)
best = min(best, dp[i - j] + abs(heights[i] - heights[i - j]));
dp[i] = best;
}
cout << dp[n] << endl;
} | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int h;
for (long long int i = 1; i <= n; i++) {
cin >> h;
heights.at(i) = h;
}
dp[1] = 0;
dp[2] = abs(heights[2] - heights[1]);
for (long long int i = 3; i <= n; i++) {
long long int best = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (long long int j = 2; j <= k && j < i; j++)
best = min(best, dp[i - j] + abs(heights[i] - heights[i - j]));
dp[i] = best;
}
cout << dp[n] << endl;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,031 | 961,032 | u504583153 | cpp |
p03161 | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int h;
for (long long int i = 1; i <= n; i++) {
cin >> h;
heights.at(i) = h;
}
dp[1] = 0;
dp[2] = abs(heights[2] - heights[1]);
for (long long int i = 3; i <= n; i++) {
long long int best = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (long long int j = 2; j <= k; j++)
best = min(best, dp[i - j] + abs(heights[i] - heights[i - j]));
dp[i] = best;
}
cout << dp[n] << endl;
} | #include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int h;
for (long long int i = 1; i <= n; i++) {
cin >> h;
heights.at(i) = h;
}
dp[1] = 0;
dp[2] = abs(heights[2] - heights[1]);
for (long long int i = 3; i <= n; i++) {
long long int best = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (long long int j = 2; j <= k && j < i; j++)
best = min(best, dp[i - j] + abs(heights[i] - heights[i - j]));
dp[i] = best;
}
cout << dp[n] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 961,033 | 961,032 | u504583153 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf printf
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sffl(a, b) scanf("%lld %lld", &a, &b) 1073. Square Country
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfffl(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define sffff(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
#define sffffl(a, b, c, d) scanf("%lld %lld %lld %lld", &a, &b, &c, &d)
#define sfffff(a, b, c, d, e) scanf("%d %d %d %d %d", &a, &b, &c, &d, &e)
#define sfffffl(a, b, c, d, e) \
scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e)
#define sfc(a) scanf("%c", &a)
#define pii pair<int, int>
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define pbp(a, b) push_back({a, b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forrev(i, n) for (int i = n - 1; i >= 0; i--)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define forba(i, b, a) for (int i = b; i >= a; i--)
#define stlloop(x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define case1(z) cout << "Case " << z << ": "
#define case2(z) printf("Case %d: ", z)
#define PI acos(-1) // 3.14159265358979323846264338328
#define valid(tx, ty) tx >= 0 && tx < row &&ty >= 0 && ty < col
#define intlim 2147483648
#define N 200005
#define inf 100000008
#define mod 1000000007
/*------------------------------Graph Moves----------------------------*/
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*---------------------------------------------------------------------*/
ll a[N];
ll dp[N];
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n, i, x, y, k, j;
cin >> n >> k;
for1(i, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
y = INT_MAX;
for (j = 1; j <= k; j++) {
x = dp[i - j] + abs(a[i] - a[i - j]);
y = min(y, x);
}
dp[i] = y;
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf printf
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sff(a, b) scanf("%d %d", &a, &b)
#define sffl(a, b) scanf("%lld %lld", &a, &b) 1073. Square Country
#define sfff(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfffl(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define sffff(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
#define sffffl(a, b, c, d) scanf("%lld %lld %lld %lld", &a, &b, &c, &d)
#define sfffff(a, b, c, d, e) scanf("%d %d %d %d %d", &a, &b, &c, &d, &e)
#define sfffffl(a, b, c, d, e) \
scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e)
#define sfc(a) scanf("%c", &a)
#define pii pair<int, int>
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define pbp(a, b) push_back({a, b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define CIN \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define forrev(i, n) for (int i = n - 1; i >= 0; i--)
#define forab(i, a, b) for (int i = a; i <= b; i++)
#define forba(i, b, a) for (int i = b; i >= a; i--)
#define stlloop(x) for (__typeof(x.begin()) it = x.begin(); it != x.end(); it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define case1(z) cout << "Case " << z << ": "
#define case2(z) printf("Case %d: ", z)
#define PI acos(-1) // 3.14159265358979323846264338328
#define valid(tx, ty) tx >= 0 && tx < row &&ty >= 0 && ty < col
#define intlim 2147483648
#define N 200005
#define inf 100000008
#define mod 1000000007
/*------------------------------Graph Moves----------------------------*/
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*---------------------------------------------------------------------*/
ll a[N];
ll dp[N];
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll n, i, x, y, k, j;
cin >> n >> k;
for1(i, n) cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
y = INT_MAX;
for (j = 1; j <= k && j < i; j++) {
x = dp[i - j] + abs(a[i] - a[i - j]);
y = min(y, x);
}
dp[i] = y;
}
cout << dp[n] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,036 | 961,037 | u089230684 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(m, n, c) for (int i = m; i < n; i += c)
const int N = 1e5 + 3;
int ara[N + 2];
pair<int, int> pp[N];
vector<int> vv[4 * N];
set<int> st;
map<ll, ll> mp;
int ara4[N + 3], ara5[30];
int dp[N + 3];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ara[i];
}
for (int i = 0; i < n; i++)
dp[i] = inf;
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= k + i and k + i < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(ara[i] - ara[j]));
}
}
cout << dp[n - 1] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(m, n, c) for (int i = m; i < n; i += c)
const int N = 1e5 + 3;
int ara[N + 2];
pair<int, int> pp[N];
vector<int> vv[4 * N];
set<int> st;
map<ll, ll> mp;
int ara4[N + 3], ara5[30];
int dp[N + 3];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ara[i];
}
for (int i = 0; i < n; i++)
dp[i] = inf;
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= k + i and j < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(ara[i] - ara[j]));
// cout << dp[j] << " ";
}
}
cout << dp[n - 1] << "\n";
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 961,042 | 961,043 | u088630768 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, i, j;
cin >> N >> K;
vector<int> h(N), dp(N, 10001);
for (i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (i = 1; i < N; i++) {
for (j = 1; j <= i && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, i, j;
cin >> N >> K;
vector<int> h(N), dp(N, 1e9 + 1);
for (i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (i = 1; i < N; i++) {
for (j = 1; j <= i && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 961,047 | 961,048 | u257920432 | cpp |
p03161 | /*
It’s Always Darkest Before the Dawn
This Time is that Darkness in you Life
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
const ll mod = 1e9 + 7, di = 998244353, N = 3e5 + 1;
bool IsQuery = false;
ll q = 1, a[N];
map<int, vector<int>> edge;
map<int, bool> occ;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
void solve() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k && i + j < n; j++) {
if (dp[i + j] == -1)
dp[i + j] = dp[i] + abs(a[j] - a[i]);
dp[i + j] = min(dp[i + j], dp[i] + abs(a[j] - a[i]));
}
}
cout << dp[n - 1];
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (IsQuery)
cin >> q;
for (int i = 0; i < q; i++) {
solve();
cout << "\n";
}
return 0;
}
| /*
It’s Always Darkest Before the Dawn
This Time is that Darkness in you Life
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
const ll mod = 1e9 + 7, di = 998244353, N = 3e5 + 1;
bool IsQuery = false;
ll q = 1, a[N];
map<int, vector<int>> edge;
map<int, bool> occ;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
void solve() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k && i + j < n; j++) {
if (dp[i + j] == -1)
dp[i + j] = dp[i] + abs(a[i + j] - a[i]);
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i + j] - a[i]));
}
}
cout << dp[n - 1];
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (IsQuery)
cin >> q;
for (int i = 0; i < q; i++) {
solve();
cout << "\n";
}
return 0;
}
| [
"assignment.change"
] | 961,049 | 961,050 | u092237508 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repab(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//------------------------------------------------------//
int main() {
int n, k;
cin >> n >> k;
vec<int> h(n + 1);
rep(i, n) cin >> h[i + 1];
int dp[n + 1];
rep(i, n + 1) { dp[i] = 0; }
dp[1] = 0;
repab(i, 2, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
if (i >= j)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repab(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ll long long
#define vec vector
#define pb push_back
#define ft first
#define sd second
#define all(vec) vec.begin(), vec.end()
typedef pair<int, int> P;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
//------------------------------------------------------//
int main() {
int n, k;
cin >> n >> k;
vec<int> h(n + 1);
rep(i, n) cin >> h[i + 1];
int dp[n + 1];
rep(i, n + 1) { dp[i] = 0; }
dp[1] = 0;
repab(i, 2, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
if (i - j >= 1)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,051 | 961,052 | u707315894 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int num, k, a[100005];
int dp[100005];
const int oo = 1e8 + 7;
int Min(int a, int b) {
if (a > b)
return b;
else
return a;
}
main() {
cin >> num >> k;
for (int i = 1; i <= num; ++i) {
cin >> a[i];
dp[i] = oo;
}
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= num; i++) {
for (int j = 1; j <= k; j++) {
if (i < j)
continue;
if (i - j == 1)
dp[i] = Min(dp[i], abs(a[i] - a[i - j]));
else
dp[i] = Min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
}
cout << dp[num] << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
int num, k, a[100005];
int dp[100005];
const int oo = 1e9 + 7;
int Min(int a, int b) {
if (a > b)
return b;
else
return a;
}
main() {
cin >> num >> k;
for (int i = 1; i <= num; ++i) {
cin >> a[i];
dp[i] = oo;
}
dp[1] = a[1];
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= num; i++) {
for (int j = 1; j <= k; j++) {
if (i <= j)
continue;
if (i - j == 1)
dp[i] = Min(dp[i], abs(a[i] - a[i - j]));
else
dp[i] = Min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
}
cout << dp[num] << endl;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,064 | 961,063 | u630088972 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f;
ll dp[10000005];
ll a[10000005];
int main() {
int n, k;
cin >> n >> k;
memset(dp, INF, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 0, dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
cout << dp[n];
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f;
ll dp[10000005];
ll a[10000005];
int main() {
int n, k;
cin >> n >> k;
memset(dp, INF, sizeof(dp));
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 0, dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++)
if (i > j)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
cout << dp[n];
} | [
"control_flow.branch.if.add"
] | 961,076 | 961,077 | u816631826 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define Me3za() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0); \
srand(time(NULL))
#define endl "\n"
int n, k;
int l;
int arr[100005];
long long mem[100005];
long long solve(int i, long long cur, int prev) {
if (i >= n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
mem[i] = LLONG_MAX;
for (int j = 1; j <= min(k, n - 1); j++) {
long long sol = solve(i + j, arr[i + j], i) + abs(cur - arr[i + j]);
// cout<<i<<" "<<sol<<" "<<i+j<<" "<<min(k,n-i)<<endl;
mem[i] = min(sol, mem[i]);
}
return mem[i];
}
int main() {
Me3za();
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
memset(mem, -1, sizeof mem);
cout << solve(0, arr[0], 0);
}
| #include <bits/stdc++.h>
using namespace std;
#define Me3za() \
ios_base::sync_with_stdio(0); \
cout.tie(0); \
cin.tie(0); \
srand(time(NULL))
#define endl "\n"
int n, k;
int l;
int arr[100005];
long long mem[100005];
long long solve(int i, long long cur, int prev) {
if (i >= n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
mem[i] = LLONG_MAX;
for (int j = 1; i + j <= min(i + k, n - 1); j++) {
long long sol = solve(i + j, arr[i + j], i) + abs(cur - arr[i + j]);
// cout<<i<<" "<<sol<<" "<<i+j<<" "<<min(k,n-i)<<endl;
mem[i] = min(sol, mem[i]);
}
return mem[i];
}
int main() {
Me3za();
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
memset(mem, -1, sizeof mem);
cout << solve(0, arr[0], 0);
}
| [
"control_flow.loop.for.condition.change"
] | 961,078 | 961,079 | u816631826 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int n, k;
int a[200000];
int dp[200000];
int main() {
int i, j;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = 0x7fffffff;
for (j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
}
printf("%d", dp[n]);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int n, k;
int a[200000];
int dp[200000];
int main() {
int i, j;
scanf("%d %d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = 0x7fffffff;
for (j = max(1, i - k); j < i; j++) {
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
}
printf("%d", dp[n]);
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 961,080 | 961,081 | u816631826 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog2(int *s, int n, int k) {
int dp[100005];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 0 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(s[i] - s[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
int a[100006];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
cout << frog2(a, n, k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int frog2(int *s, int n, int k) {
int dp[100005];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(s[i] - s[j]) + dp[j]);
}
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
int a[100006];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
cout << frog2(a, n, k);
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,082 | 961,083 | u843286945 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
ios ll n, k;
cin >> n >> k;
vector<ll> v(n, 0);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> a(n, LONG_MAX);
a[0] = 0;
a[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 0; j < i + 1 && j < k + 1; j++) {
a[i] = min(a[i], a[i - k] + abs(v[i] - v[i - k]));
}
}
cout << a[n - 1];
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
ios ll n, k;
cin >> n >> k;
vector<ll> v(n, 0);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> a(n, INT_MAX);
a[0] = 0;
a[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 1; j < i + 1 && j < k + 1; j++) {
a[i] = min(a[i], a[i - j] + abs(v[i] - v[i - j]));
}
}
cout << a[n - 1];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,094 | 961,093 | u546186505 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
ios ll n, k;
cin >> n >> k;
vector<ll> v(n, 0);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> a(n, LONG_MAX);
a[0] = 0;
a[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 0; j < i + 1 && j < k + 1; k++) {
a[i] = min(a[i], a[i - k] + abs(v[i] - v[i - k]));
}
}
cout << a[n - 1];
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int main() {
ios ll n, k;
cin >> n >> k;
vector<ll> v(n, 0);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> a(n, INT_MAX);
a[0] = 0;
a[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 1; j < i + 1 && j < k + 1; j++) {
a[i] = min(a[i], a[i - j] + abs(v[i] - v[i - j]));
}
}
cout << a[n - 1];
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"identifier.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,095 | 961,093 | u546186505 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int minima(int i, int a[], int h[], int k) {
int arr[k];
int min = abs(h[i - 1] - h[i]) + a[i - 1];
for (int j = 0; j < k; ++j) {
arr[j] = abs(h[i - j - 1] - h[i]) + a[i - j - 1];
if (arr[j] < min)
min = arr[j];
}
return min;
}
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
int a[n];
for (int i = 0; i <= k; ++i)
a[i] = abs(h[i] - h[0]);
for (int i = k + 1; i < n; ++i)
a[i] = minima(i, a, h, k);
cout << a[n - 1];
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int minima(int i, int a[], int h[], int k) {
int arr[k];
int min = abs(h[i - 1] - h[i]) + a[i - 1];
for (int j = 0; j < k; ++j) {
arr[j] = abs(h[i - j - 1] - h[i]) + a[i - j - 1];
if (arr[j] < min)
min = arr[j];
}
return min;
}
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
int a[n];
for (int i = 0; i <= k && i < n; ++i)
a[i] = abs(h[i] - h[0]);
for (int i = k + 1; i < n; ++i)
a[i] = minima(i, a, h, k);
cout << a[n - 1];
}
| [
"control_flow.loop.for.condition.change"
] | 961,098 | 961,099 | u026731686 | cpp |
p03161 | // Frog-1
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define N (ll)(1e7 + 5)
#define mod (ll)(1e9 + 7)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> dp(n), v(n);
for (auto &x : v)
cin >> x;
dp[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
dp[i] = abs(v[i] - v[i - 1]) + dp[i - 1];
for (ll j = 2; j <= k; j++)
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| // Frog-1
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define N (ll)(1e7 + 5)
#define mod (ll)(1e9 + 7)
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> dp(n), v(n);
for (auto &x : v)
cin >> x;
dp[1] = abs(v[1] - v[0]);
for (ll i = 2; i < n; i++) {
dp[i] = abs(v[i] - v[i - 1]) + dp[i - 1];
for (ll j = 2; j <= min(k, i); j++)
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 961,103 | 961,104 | u355900184 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<int> dp(N);
vector<int> h(N);
for (long long int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (long long int i = 1; i < N; i++) {
for (long long int m = 1; m <= K; m++) {
if (i - m >= 0) {
dp.at(i) = min(dp.at(i), dp.at(i - m) + abs(h.at(i - m) - h.at(i)));
}
}
}
cout << dp.at(N - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<int> dp(N, 2e9);
vector<int> h(N);
for (long long int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (long long int i = 1; i < N; i++) {
for (long long int m = 1; m <= K; m++) {
if (i - m >= 0) {
dp.at(i) = min(dp.at(i), dp.at(i - m) + abs(h.at(i - m) - h.at(i)));
}
}
}
cout << dp.at(N - 1) << endl;
} | [
"call.arguments.add"
] | 961,110 | 961,111 | u120586196 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, k;
cin >> n >> k;
vector<long long int> h(n);
for (i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long int> cost(n);
cost[n - 1] = 0;
cost[n - 2] = abs(h[n - 1] - h[n - 2]);
for (i = n - 3; i >= 0; i--) {
long long int j, temp, min;
min = cost[i + 1] + abs(h[i + 1] - h[i]);
for (j = i + 1; j <= i + k; j++) {
temp = cost[j] + abs(h[j] - h[i]);
if (temp < min) {
min = temp;
}
}
cost[i] = min;
}
cout << cost[0];
return 0;
}
/*
creation time: 16.09.2020 10:56:33
*/
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, i, k;
cin >> n >> k;
vector<long long int> h(n);
for (i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long int> cost(n);
cost[n - 1] = 0;
cost[n - 2] = abs(h[n - 1] - h[n - 2]);
for (i = n - 3; i >= 0; i--) {
long long int j, temp, min;
min = cost[i + 1] + abs(h[i + 1] - h[i]);
for (j = i + 1; j <= i + k && j < n; j++) {
temp = cost[j] + abs(h[j] - h[i]);
if (temp < min) {
min = temp;
}
}
cost[i] = min;
}
cout << cost[0];
return 0;
}
/*
creation time: 16.09.2020 10:56:33
*/
| [
"control_flow.loop.for.condition.change"
] | 961,112 | 961,113 | u158748314 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll h[N];
for (ll i = 0; i < N; i++) {
cin >> h[i];
}
ll dp[N];
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ll temp = i - 1;
ll minm = abs(h[i] - h[i - 1]) + h[i - 1];
while (temp >= 0 && i - temp <= K) {
minm = min(abs(h[i] - h[temp]) + dp[temp], minm);
temp--;
}
dp[i] = minm;
}
cout << dp[N - 1];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> K;
ll h[N];
for (ll i = 0; i < N; i++) {
cin >> h[i];
}
ll dp[N];
dp[0] = 0;
for (ll i = 1; i < N; i++) {
ll temp = i - 1;
ll minm = abs(h[i] - h[i - 1]) + dp[i - 1];
while (temp >= 0 && i - temp <= K) {
minm = min(abs(h[i] - h[temp]) + dp[temp], minm);
temp--;
}
dp[i] = minm;
}
cout << dp[N - 1];
} | [
"identifier.change",
"expression.operation.binary.change"
] | 961,118 | 961,119 | u874861811 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <stack>
#include <string.h>
#include <string>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1 << 30);
int main() {
int n, k, h[110000];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
vector<long> dp(n, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j < k + 1; j++) {
if (i > j)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <stack>
#include <string.h>
#include <string>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1 << 30);
int main() {
int n, k, h[110000];
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
vector<long> dp(n, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j < k + 1; j++) {
if (i >= j)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,132 | 961,133 | u337018543 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll IMF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
ll dp[N];
for (int i = 0; i < N; i++) {
dp[i] = IMF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 1; k <= K; k++) {
if (i + k >= N)
chmin(dp[i + k], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll IMF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
ll dp[N];
for (int i = 0; i < N; i++) {
dp[i] = IMF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 1; k <= K; k++) {
if (i + k < N)
chmin(dp[i + k], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,140 | 961,141 | u109191542 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M = 1000000007;
//------------------------------------------//
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
rep(i, N) cin >> h[i];
vector<ll> dp(N + 1, M);
dp[0] = 0;
for (int i = 0; i < N - K; i++) {
for (int j = 1; j <= K; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M = 1000000007;
//------------------------------------------//
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(100010);
rep(i, N) cin >> h[i];
vector<ll> dp(100010, M);
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
} | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 961,144 | 961,143 | u392973556 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(height[i] - height[i - 1]);
int j = 1;
while (j <= k) {
dp[i] = min(dp[i - j] + abs(height[i] - height[i - j]), dp[i]);
j++;
}
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
int height[n];
for (int i = 0; i < n; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(height[i] - height[i - 1]);
int j = 1;
while (j <= k and i >= j) {
dp[i] = min(dp[i - j] + abs(height[i] - height[i - j]), dp[i]);
j++;
}
}
cout << dp[n - 1];
return 0;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 961,156 | 961,157 | u771595024 | cpp |
p03161 | // Frog 1.cpp : Defines the entry point for the console application.
//
//#include "stdafx.h"
#include <iostream>
using namespace std;
const int G = 1000 * 100 + 10;
int a[G];
long long dp[G];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long m;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
m = 10000;
for (int j = max(0, i - k); j < i; j++) {
m = min(m, dp[j] + abs(a[i] - a[j]));
}
dp[i] = m;
}
cout << dp[n - 1] << endl;
return 0;
}
| // Frog 1.cpp : Defines the entry point for the console application.
//
//#include "stdafx.h"
#include <iostream>
using namespace std;
const int G = 1000 * 100 + 10;
int a[G];
long long dp[G];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long m;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
m = 1000000000000;
for (int j = max(0, i - k); j < i; j++) {
m = min(m, dp[j] + abs(a[i] - a[j]));
}
dp[i] = m;
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 961,158 | 961,159 | u091155617 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N >> K;
V<int> H(N);
rep(i, N) cin >> H.at(i);
V<ll> dp(N);
dp.at(N - 1) = 0;
for (int i = N - 2; i >= N - 1 - K && i > 0; i--)
dp.at(i) = abs(H.at(N - 1) - H.at(i));
for (int i = N - 2 - K; i >= 0; i--) {
ll min = 1000000000;
for (int j = i + 1; j <= i + K && j < N; j++) {
ll cost = dp.at(j) + abs(H.at(j) - H.at(i));
if (cost < min)
min = cost;
}
dp.at(i) = min;
}
cout << dp.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N >> K;
V<int> H(N);
rep(i, N) cin >> H.at(i);
V<ll> dp(N);
dp.at(N - 1) = 0;
for (int i = N - 2; i >= N - 1 - K && i >= 0; i--)
dp.at(i) = abs(H.at(N - 1) - H.at(i));
for (int i = N - 2 - K; i >= 0; i--) {
ll min = 1000000000;
for (int j = i + 1; j <= i + K && j < N; j++) {
ll cost = dp.at(j) + abs(H.at(j) - H.at(i));
if (cost < min)
min = cost;
}
dp.at(i) = min;
}
cout << dp.at(0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,171 | 961,172 | u811542492 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N >> K;
V<int> H(N);
rep(i, N) cin >> H.at(i);
V<ll> dp(N);
dp.at(N - 1) = 0;
for (int i = N - 2; i >= N - 1 - K && i > 0; i--)
dp.at(i) = abs(H.at(N - 1) - H.at(i));
for (int i = N - 2 - K; i >= 0; i--) {
ll min = 1000000000;
for (int j = i + 1; j <= i + K; j++) {
ll cost = dp.at(j) + abs(H.at(j) - H.at(i));
if (cost < min)
min = cost;
}
dp.at(i) = min;
}
cout << dp.at(0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < n; i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = b - 1; i >= int(a); i--)
int main() {
int N, K;
cin >> N >> K;
V<int> H(N);
rep(i, N) cin >> H.at(i);
V<ll> dp(N);
dp.at(N - 1) = 0;
for (int i = N - 2; i >= N - 1 - K && i >= 0; i--)
dp.at(i) = abs(H.at(N - 1) - H.at(i));
for (int i = N - 2 - K; i >= 0; i--) {
ll min = 1000000000;
for (int j = i + 1; j <= i + K && j < N; j++) {
ll cost = dp.at(j) + abs(H.at(j) - H.at(i));
if (cost < min)
min = cost;
}
dp.at(i) = min;
}
cout << dp.at(0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,173 | 961,172 | u811542492 | cpp |
p03161 | #include <bits/stdc++.h>
const int INF = 1e5 + 7;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int check = 0;
dp[i] = INF;
if (i - k < 0)
check = 0;
else
check = i - k;
for (int j = i - 1; j >= check; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
const int INF = 1e9 + 5;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int check;
dp[i] = INF;
if (i - k < 0)
check = 0;
else
check = i - k;
for (int j = i - 1; j >= check; j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 961,174 | 961,175 | u631895856 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int h[100001];
int dp[100001];
int main() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; ++i) {
int k_max = min(i - 1, K);
dp[i] = 10000;
for (int k = 1; k <= k_max; ++k) {
dp[i] = min(abs(h[i] - h[i - k]) + dp[i - k], dp[i]);
}
}
cout << dp[N] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int h[100001];
int dp[100001];
int main() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; ++i) {
int k_max = min(i - 1, K);
dp[i] = 1000000000;
for (int k = 1; k <= k_max; ++k) {
dp[i] = min(abs(h[i] - h[i - k]) + dp[i - k], dp[i]);
}
}
cout << dp[N] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 961,178 | 961,179 | u673928159 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define LM LONG_MAX
#define LS LONG_MIN
#define cfM 998244353
#define ccM 1000000007
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define inf 10000000000000000
#define sp setprecision(9)
int max(int b, int a) {
if (b > a)
return b;
else
return a;
}
int min(int b, int a) {
if (b < a)
return b;
else
return a;
}
int ab(int b) {
if (b < 0)
return (-1 * b);
else
return (b);
}
void print(vector<int> &v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
int32_t main() {
// CHECK IF NEGATIVE INPUT UNSIGNED->SIGNED
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n, inf);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n <= 1)
cout << 0 << endl;
dp[0] = 0;
dp[1] = ab(a[1] - a[0]);
for (int i = 2; i < n; i++) {
// dp[i]=min(ab(a[i]-a[i-1])+dp[i-1],ab(a[i]-a[i-2])+dp[i-2]);
// cout<<i<<dp[i]<<endl;
for (int j = 1; j <= k + 1; j++) {
if (i - j < 0)
continue;
// cout<<dp[i-j]+ab(a[i]-a[j]);
dp[i] = min(dp[i], dp[i - j] + ab(a[i] - a[j]));
}
}
// print(dp);
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define LM LONG_MAX
#define LS LONG_MIN
#define cfM 998244353
#define ccM 1000000007
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define inf 10000000000000000
#define sp setprecision(9)
int max(int b, int a) {
if (b > a)
return b;
else
return a;
}
int min(int b, int a) {
if (b < a)
return b;
else
return a;
}
int ab(int b) {
if (b < 0)
return (-1 * b);
else
return (b);
}
void print(vector<int> &v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
int32_t main() {
// CHECK IF NEGATIVE INPUT UNSIGNED->SIGNED
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n, inf);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n <= 1)
cout << 0 << endl;
dp[0] = 0;
dp[1] = ab(a[1] - a[0]);
for (int i = 2; i < n; i++) {
// dp[i]=min(ab(a[i]-a[i-1])+dp[i-1],ab(a[i]-a[i-2])+dp[i-2]);
// cout<<i<<dp[i]<<endl;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
// cout<<dp[i-j]+ab(a[i]-a[j]);
dp[i] = min(dp[i], dp[i - j] + ab(a[i] - a[i - j]));
}
}
// print(dp);
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,182 | 961,183 | u146209432 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define LM LONG_MAX
#define LS LONG_MIN
#define cfM 998244353
#define ccM 1000000007
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define inf 10000000000000000
#define sp setprecision(9)
int max(int b, int a) {
if (b > a)
return b;
else
return a;
}
int min(int b, int a) {
if (b < a)
return b;
else
return a;
}
int ab(int b) {
if (b < 0)
return (-1 * b);
else
return (b);
}
void print(vector<int> &v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
int32_t main() {
// CHECK IF NEGATIVE INPUT UNSIGNED->SIGNED
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n, inf);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n <= 1)
cout << 0 << endl;
dp[0] = 0;
dp[1] = ab(a[1] - a[0]);
for (int i = 2; i < n; i++) {
// dp[i]=min(ab(a[i]-a[i-1])+dp[i-1],ab(a[i]-a[i-2])+dp[i-2]);
// cout<<i<<dp[i]<<endl;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
// cout<<dp[i-j]+ab(a[i]-a[j]);
dp[i] = min(dp[i], dp[i - j] + ab(a[i] - a[j]));
}
}
// print(dp);
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define F first
#define S second
#define LM LONG_MAX
#define LS LONG_MIN
#define cfM 998244353
#define ccM 1000000007
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define inf 10000000000000000
#define sp setprecision(9)
int max(int b, int a) {
if (b > a)
return b;
else
return a;
}
int min(int b, int a) {
if (b < a)
return b;
else
return a;
}
int ab(int b) {
if (b < 0)
return (-1 * b);
else
return (b);
}
void print(vector<int> &v) {
for (int i = 0; i < v.size(); i++)
cout << v[i] << " ";
cout << endl;
}
int32_t main() {
// CHECK IF NEGATIVE INPUT UNSIGNED->SIGNED
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n, inf);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n <= 1)
cout << 0 << endl;
dp[0] = 0;
dp[1] = ab(a[1] - a[0]);
for (int i = 2; i < n; i++) {
// dp[i]=min(ab(a[i]-a[i-1])+dp[i-1],ab(a[i]-a[i-2])+dp[i-2]);
// cout<<i<<dp[i]<<endl;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
// cout<<dp[i-j]+ab(a[i]-a[j]);
dp[i] = min(dp[i], dp[i - j] + ab(a[i] - a[i - j]));
}
}
// print(dp);
cout << dp[n - 1] << endl;
return 0;
}
| [] | 961,184 | 961,183 | u146209432 | cpp |
p03161 | #include <bits/stdc++.h>
#define FOR0(i, n) for (int i = 0; i < n; i++)
#define FOR(i, j, n) for (int i = j; i < n; i++)
// #define ll long long
// bool isEven(ll n) {return (n%2!=0)?false:true;}
using namespace std;
// atcoder - dp
// b
int a[100005], dp[100005];
int n, k;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
FOR0(i, n) {
cin >> a[i + 1];
dp[i + 1] = -1;
}
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i < n + 1; ++i) {
int ans = INT_MAX;
for (int j = 1; j < k + 1; ++j) {
if (i - j > 0) {
ans = min(ans, abs(a[i + j] - a[i]) + dp[i - j]);
}
}
dp[i] = ans;
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
#define FOR0(i, n) for (int i = 0; i < n; i++)
#define FOR(i, j, n) for (int i = j; i < n; i++)
// #define ll long long
// bool isEven(ll n) {return (n%2!=0)?false:true;}
using namespace std;
// atcoder - dp
// b
int a[100005], dp[100005];
int n, k;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
FOR0(i, n) {
cin >> a[i + 1];
dp[i + 1] = -1;
}
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i < n + 1; ++i) {
int ans = INT_MAX;
for (int j = 1; j < k + 1; ++j) {
if (i - j > 0) {
ans = min(ans, abs(a[i - j] - a[i]) + dp[i - j]);
}
}
dp[i] = ans;
}
cout << dp[n] << endl;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,185 | 961,186 | u533931256 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
} | [
"control_flow.branch.if.add"
] | 961,187 | 961,188 | u157945820 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
/*ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
int main() {
int n, i, j, k;
cin >> n >> k;
vi a(n), m(n);
for (i = 0; i < n; i++) {
cin >> a[i];
m[i] = INT_MAX;
}
m[0] = 0;
m[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
j = 1;
while (j <= k && i - j > 0) {
m[i] = min((abs(a[i - j] - a[i]) + m[i - j]), m[i]);
j++;
}
}
cout << m[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
/*ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
int main() {
int n, i, j, k;
cin >> n >> k;
vi a(n), m(n);
for (i = 0; i < n; i++) {
cin >> a[i];
m[i] = INT_MAX;
}
m[0] = 0;
m[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
j = 1;
while (j <= k && i - j >= 0) {
m[i] = min((abs(a[i - j] - a[i]) + m[i - j]), m[i]);
j++;
}
}
cout << m[n - 1];
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 961,195 | 961,196 | u710527399 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
/*ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
int main() {
int n, i, j, k;
cin >> n >> k;
vi a(n), m(n);
for (i = 0; i < n; i++) {
cin >> a[i];
m[i] = INT_MAX;
}
m[0] = 0;
m[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
j = 1;
while (j <= k || i - j > 0) {
m[i] = min((abs(a[i - j] - a[i]) + m[i - j]), m[i]);
j++;
}
}
cout << m[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
/*ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
int main() {
int n, i, j, k;
cin >> n >> k;
vi a(n), m(n);
for (i = 0; i < n; i++) {
cin >> a[i];
m[i] = INT_MAX;
}
m[0] = 0;
m[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
j = 1;
while (j <= k && i - j >= 0) {
m[i] = min((abs(a[i - j] - a[i]) + m[i - j]), m[i]);
j++;
}
}
cout << m[n - 1];
return 0;
}
| [
"misc.opposites",
"control_flow.loop.condition.change",
"expression.operator.compare.change"
] | 961,197 | 961,196 | u710527399 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell1 1e9 + 7
#define hell2 1e9 + 9
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ll long long
#define ld long double
#define no_of_digits(n) floor(log10(n)) + 1
#define see(x) cout << (#x) << " is " << (x) << endl
#define INF 1e9
using namespace std;
ll mult(ll a, ll b, ll p = hell1) { return ((a % p) * (b % p)) % p; }
ll multbig(ll a, ll b, ll mod = hell1) {
if (a == 0 or b == 0)
return 0;
if (a == 1 or b == 1)
return (a * b) % mod;
ll cur = multbig(a, b / 2, mod);
cur = (2 * cur) % mod;
if (b % 2)
cur = (cur + a) % mod;
return cur;
}
ll add(ll a, ll b, ll p = hell1) {
if (a >= p)
a %= p;
if (b >= p)
b %= p;
if (a + b > p)
return (a + b) % p;
else
return a + b;
}
ll sub(ll a, ll b, ll p = hell1) { return (a % p - b % p + p) % p; }
ll fpow(ll n, ll k, ll p = hell1) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = mult(r, n, p);
n = mult(n, n, p);
}
return r;
}
ll inv(ll a, ll p = hell1) { return fpow(a, p - 2, p); }
ll inv_euclid(ll a, ll m = hell1) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int isPowerof2(ll x) { return (x && !(x & x - 1)); }
ll log2(ll x) {
ll res = 0;
while (x >>= 1)
res++;
return res;
}
// max({a, b, c, d})
vector<ll> adj[200005];
ll update[200005];
ll ans[200005];
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
// Initializing base value to 1, i.e 2^0
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
bool isPerfectSquare(long double x) {
// Find floating point value of
// square root of x.
long double sr = sqrt(x);
// If square root is an integer
return ((sr - floor(sr)) == 0);
}
int main() {
int n, k;
cin >> n >> k;
ll a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INF;
for (int j = i - k; j <= i; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n] << "\n";
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define hell1 1e9 + 7
#define hell2 1e9 + 9
#define pi 3.1415926535
#define ms(s, n) memset(s, n, sizeof(s))
#define prec(n) fixed << setprecision(n)
#define eps 0.000001
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define ll long long
#define ld long double
#define no_of_digits(n) floor(log10(n)) + 1
#define see(x) cout << (#x) << " is " << (x) << endl
#define INF 1e9
using namespace std;
ll mult(ll a, ll b, ll p = hell1) { return ((a % p) * (b % p)) % p; }
ll multbig(ll a, ll b, ll mod = hell1) {
if (a == 0 or b == 0)
return 0;
if (a == 1 or b == 1)
return (a * b) % mod;
ll cur = multbig(a, b / 2, mod);
cur = (2 * cur) % mod;
if (b % 2)
cur = (cur + a) % mod;
return cur;
}
ll add(ll a, ll b, ll p = hell1) {
if (a >= p)
a %= p;
if (b >= p)
b %= p;
if (a + b > p)
return (a + b) % p;
else
return a + b;
}
ll sub(ll a, ll b, ll p = hell1) { return (a % p - b % p + p) % p; }
ll fpow(ll n, ll k, ll p = hell1) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = mult(r, n, p);
n = mult(n, n, p);
}
return r;
}
ll inv(ll a, ll p = hell1) { return fpow(a, p - 2, p); }
ll inv_euclid(ll a, ll m = hell1) {
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
int isPowerof2(ll x) { return (x && !(x & x - 1)); }
ll log2(ll x) {
ll res = 0;
while (x >>= 1)
res++;
return res;
}
// max({a, b, c, d})
vector<ll> adj[200005];
ll update[200005];
ll ans[200005];
int binaryToDecimal(string n) {
string num = n;
int dec_value = 0;
// Initializing base value to 1, i.e 2^0
int base = 1;
int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1')
dec_value += base;
base = base * 2;
}
return dec_value;
}
bool isPerfectSquare(long double x) {
// Find floating point value of
// square root of x.
long double sr = sqrt(x);
// If square root is an integer
return ((sr - floor(sr)) == 0);
}
int main() {
int n, k;
cin >> n >> k;
ll a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INF;
for (int j = max(i - k, 1); j <= i; j++) {
// if(i-k < 1) continue;
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n] << "\n";
}
| [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 961,198 | 961,199 | u962241803 | cpp |
p03161 | #include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
int cost[n + 1];
for (int i = 1; i < n + 1; ++i) {
cin >> h[i];
cost[i] = INT16_MAX;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = i - 1; j >= max(1, i - k); j--) {
cost[i] = min(cost[j] + abs(h[i] - h[j]), cost[i]);
}
}
cout << cost[n];
} | #include <cmath>
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
int cost[n + 1];
for (int i = 1; i < n + 1; ++i) {
cin >> h[i];
cost[i] = INT32_MAX;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = i - 1; j >= max(1, i - k); j--) {
cost[i] = min(cost[j] + abs(h[i] - h[j]), cost[i]);
}
}
cout << cost[n];
} | [
"assignment.value.change",
"identifier.change"
] | 961,200 | 961,201 | u650152779 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
t = 1;
// cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int arr[n];
long long int dp[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = LONG_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= i - k; j--) {
dp[i] = min(dp[j] + abs(arr[i] - arr[j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
t = 1;
// cin >> t;
while (t--) {
int n, k;
cin >> n >> k;
int arr[n];
long long int dp[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
dp[i] = LONG_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= i - k && j >= 0; j--) {
dp[i] = min(dp[j] + abs(arr[i] - arr[j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
}
return 0;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 961,202 | 961,203 | u357433883 | cpp |
p03161 | // aarsh01rsh@gmail.com
// Aarsh Sharma
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef long long int ll;
#define int ll
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;
typedef vector<ll> vll;
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
const ll N = 1e5 + 10;
int32_t main() {
fast_io();
int n, k;
cin >> n >> k;
vll a(n);
f(i, 0, n) cin >> a[i];
if (n == 2) {
cout << abs(a[n - 1] - a[0]);
return 0;
}
vll dp(n);
dp[0] = 0;
// dp[1] = abs(a[1] - a[0]);
// f (i, 2, k) {
// int mini = inf;
// f (j, 1, i+1) {
// if (abs(a[i]-a[i-j]) < mini) {
// mini = abs(a[i]-a[i-j]);
// dp[i] = dp[i-j] + abs(a[i]-a[i-j]);
// }
// }
// dp[i] = mini;
// }
f(i, 1, n) {
int mini = inf;
for (int j = 1; j <= k; j++) {
if (abs(a[i] - a[i - j]) + dp[i - j] < mini) {
mini = abs(a[i] - a[i - j]) + dp[i - j];
}
}
dp[i] = mini;
}
debug(dp);
cout << dp[n - 1];
return 0;
} | // aarsh01rsh@gmail.com
// Aarsh Sharma
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef long long int ll;
#define int ll
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;
typedef vector<ll> vll;
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
const ll N = 1e5 + 10;
int32_t main() {
fast_io();
int n, k;
cin >> n >> k;
vll a(n);
f(i, 0, n) cin >> a[i];
if (n == 2) {
cout << abs(a[n - 1] - a[0]);
return 0;
}
vll dp(n);
dp[0] = 0;
// dp[1] = abs(a[1] - a[0]);
// f (i, 2, k) {
// int mini = inf;
// f (j, 1, i+1) {
// if (abs(a[i]-a[i-j]) < mini) {
// mini = abs(a[i]-a[i-j]);
// dp[i] = dp[i-j] + abs(a[i]-a[i-j]);
// }
// }
// dp[i] = mini;
// }
f(i, 1, n) {
int mini = inf;
for (int j = 1; j <= min(i, k); j++) {
if (abs(a[i] - a[i - j]) + dp[i - j] < mini) {
mini = abs(a[i] - a[i - j]) + dp[i - j];
}
}
dp[i] = mini;
}
debug(dp);
cout << dp[n - 1];
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 961,205 | 961,206 | u065893594 | cpp |
p03161 | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(x) x.begin(), x.end()
#ifdef LOCAL
#include "prettyprint.hpp"
#else
#define debug(...)
#define debuga(arr, n)
#define debugg(grid, n)
#endif
typedef long long int ll;
#define int ll
#define F first
#define S second
#define float double
const int inf = LLONG_MAX;
int get() {
int x;
cin >> x;
return x;
}
void getl(int *ar, int sz) {
for (int i = 0; i < sz; i++)
cin >> ar[i];
}
template <typename T> void print(T x) { cout << x << "\n"; }
template <typename T> void prints(T x) { cout << x << " "; }
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int N = 1e6 + 1;
int h[N], cost[N];
int32_t main() {
fast_io();
int n = get();
int k = get();
getl(h, n);
for (int i = 1; i < n; ++i) {
vi l;
for (int j = 0; j < k; ++j) {
if (i >= j)
l.push_back(cost[i - j] + abs(h[i] - h[i - j]));
}
cost[i] = *min_element(all(l));
}
print(cost[n - 1]);
return 0;
} | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(x) x.begin(), x.end()
#ifdef LOCAL
#include "prettyprint.hpp"
#else
#define debug(...)
#define debuga(arr, n)
#define debugg(grid, n)
#endif
typedef long long int ll;
#define int ll
#define F first
#define S second
#define float double
const int inf = LLONG_MAX;
int get() {
int x;
cin >> x;
return x;
}
void getl(int *ar, int sz) {
for (int i = 0; i < sz; i++)
cin >> ar[i];
}
template <typename T> void print(T x) { cout << x << "\n"; }
template <typename T> void prints(T x) { cout << x << " "; }
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int N = 1e6 + 1;
int h[N], cost[N];
int32_t main() {
fast_io();
int n = get();
int k = get();
getl(h, n);
for (int i = 1; i < n; ++i) {
vi l;
for (int j = 1; j <= k; ++j) {
if (i >= j)
l.push_back(cost[i - j] + abs(h[i] - h[i - j]));
}
cost[i] = *min_element(all(l));
}
print(cost[n - 1]);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,207 | 961,208 | u948698894 | cpp |
p03161 | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(x) x.begin(), x.end()
#ifdef LOCAL
#include "prettyprint.hpp"
#else
#define debug(...)
#define debuga(arr, n)
#define debugg(grid, n)
#endif
typedef long long int ll;
#define int ll
#define F first
#define S second
#define float double
const int inf = LLONG_MAX;
int get() {
int x;
cin >> x;
return x;
}
void getl(int *ar, int sz) {
for (int i = 0; i < sz; i++)
cin >> ar[i];
}
template <typename T> void print(T x) { cout << x << "\n"; }
template <typename T> void prints(T x) { cout << x << " "; }
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int N = 1e6 + 1;
int h[N], cost[N];
int32_t main() {
fast_io();
int n = get();
int k = get();
getl(h, n);
for (int i = 1; i < n; ++i) {
vi l;
for (int j = 0; j < k; ++j) {
if (i >= 1)
l.push_back(cost[i - 1] + abs(h[i] - h[i - 1]));
}
cost[i] = *min_element(all(l));
}
print(cost[n - 1]);
return 0;
} | // kartikay26
#include <bits/stdc++.h>
using namespace std;
#define fast_io() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define all(x) x.begin(), x.end()
#ifdef LOCAL
#include "prettyprint.hpp"
#else
#define debug(...)
#define debuga(arr, n)
#define debugg(grid, n)
#endif
typedef long long int ll;
#define int ll
#define F first
#define S second
#define float double
const int inf = LLONG_MAX;
int get() {
int x;
cin >> x;
return x;
}
void getl(int *ar, int sz) {
for (int i = 0; i < sz; i++)
cin >> ar[i];
}
template <typename T> void print(T x) { cout << x << "\n"; }
template <typename T> void prints(T x) { cout << x << " "; }
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int mod = 1e9 + 7;
const int N = 1e6 + 1;
int h[N], cost[N];
int32_t main() {
fast_io();
int n = get();
int k = get();
getl(h, n);
for (int i = 1; i < n; ++i) {
vi l;
for (int j = 1; j <= k; ++j) {
if (i >= j)
l.push_back(cost[i - j] + abs(h[i] - h[i - j]));
}
cost[i] = *min_element(all(l));
}
print(cost[n - 1]);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",... | 961,209 | 961,208 | u948698894 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pq priority_queue
#define pb push_back
#define mp make_pair
int root(int dsu[], int x) {
while (dsu[x] != x) {
dsu[x] = dsu[dsu[x]];
x = dsu[x];
}
return x;
}
void init(int dsu[], int n) {
for (int i = 0; i <= n; i++) {
dsu[i] = i;
}
}
void un(int dsu[], int x, int y) {
int a = root(dsu, x);
int b = root(dsu, y);
dsu[a] = dsu[b];
}
void printprecise(double l, int precision) {
std::cout << std::fixed;
std::cout << std::setprecision(precision);
std::cout << l << endl;
}
int gcd(int x, int y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
int lcm(int x, int y) { return (x * y) / gcd(x, y); }
main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int cst[n] = {0};
for (int i = 1; i < n; i++) {
cst[i] = 100000;
}
cst[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
cst[j] = min(cst[j], cst[i] + abs(arr[i] - arr[j]));
}
}
cout << cst[n - 1];
}
// #ifndef ONLINE_JUDGE
// cout << "\nTime Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
// #endif
// }
// #ifndef ONLINE_JUDGE
// cout << "\nTime Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
// #endif | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pq priority_queue
#define pb push_back
#define mp make_pair
int root(int dsu[], int x) {
while (dsu[x] != x) {
dsu[x] = dsu[dsu[x]];
x = dsu[x];
}
return x;
}
void init(int dsu[], int n) {
for (int i = 0; i <= n; i++) {
dsu[i] = i;
}
}
void un(int dsu[], int x, int y) {
int a = root(dsu, x);
int b = root(dsu, y);
dsu[a] = dsu[b];
}
void printprecise(double l, int precision) {
std::cout << std::fixed;
std::cout << std::setprecision(precision);
std::cout << l << endl;
}
int gcd(int x, int y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
int lcm(int x, int y) { return (x * y) / gcd(x, y); }
main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int cst[n];
for (int i = 1; i < n; i++) {
cst[i] = 100000000000000;
}
cst[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
cst[j] = min(cst[j], cst[i] + abs(arr[i] - arr[j]));
}
}
cout << cst[n - 1];
}
// #ifndef ONLINE_JUDGE
// cout << "\nTime Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
// #endif
// }
// #ifndef ONLINE_JUDGE
// cout << "\nTime Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
// #endif | [
"literal.number.change",
"assignment.value.change"
] | 961,212 | 961,213 | u092951662 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h> //算術演算子
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 64bit型
#define INF 1050000000;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() // input->compute->output
{
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
int dp[100000 + 10];
rep(i, 100010) { dp[i] = INF; }
dp[0] = 0;
for (int i = 0; i < N; i++) {
rep2(j, 1, K) { dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i])); }
}
cout << dp[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <list>
#include <map>
#include <math.h> //算術演算子
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
typedef long long ll; // 64bit型
#define INF 1050000000;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
#define PRINT(V) \
{ \
for (int i = 0; i < V.size(); i++) { \
cout << V[i] << " "; \
} \
cout << endl; \
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() // input->compute->output
{
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
int dp[100000 + 100];
rep(i, 100100) { dp[i] = INF; }
dp[0] = 0;
for (int i = 0; i < N; i++) {
rep2(j, 1, K + 1) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 961,214 | 961,215 | u966508131 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// DP法
template <class T>
inline bool chmin(T &a, T b) // change minimum
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) // change max
{
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll; // 64bit型
using namespace std;
//無限大の値
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> cost(100010);
REP(i, N) { cin >> cost[i]; }
ll dp[100010];
REP(i, N) { dp[i] = INF; }
dp[0] = 0;
FOR(i, 1, N) {
FOR(j, 1, K) {
if (i >= j) {
chmin(dp[i], dp[i - j] + abs(cost[i] - cost[i - j]));
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
// DP法
template <class T>
inline bool chmin(T &a, T b) // change minimum
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b) // change max
{
if (a < b) {
a = b;
return true;
}
return false;
}
typedef long long ll; // 64bit型
using namespace std;
//無限大の値
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> cost(100010);
REP(i, N) { cin >> cost[i]; }
ll dp[100010];
REP(i, N) { dp[i] = INF; }
dp[0] = 0;
FOR(i, 1, N) {
FOR(j, 1, K + 1) {
if (i >= j) {
chmin(dp[i], dp[i - j] + abs(cost[i] - cost[i - j]));
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 961,216 | 961,217 | u966508131 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
cout << dp[n - 1];
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1];
return 0;
} | [] | 961,218 | 961,219 | u474674098 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7, N = 1e5 + 10;
#define pb push_back
#define f first
#define s second
int n, a[N], dp[N], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0, dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= (i - k); j--)
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7, N = 1e5 + 10;
#define pb push_back
#define f first
#define s second
int n, a[N], dp[N], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0, dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= (i - k) && j >= 1; j--)
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
cout << dp[n] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,220 | 961,221 | u459121100 | cpp |
p03161 | #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int m[n + 1];
int mi;
m[0] = 0;
m[1] = 0;
m[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int j;
if (n - k >= 1)
j = n - k;
else
j = 1;
mi = m[j] + abs(h[j] - h[i]);
m[i] = mi;
j++;
for (j; j < i; j++) {
if (m[j] + abs(h[j] - h[i]) < mi) {
mi = m[j] + abs(h[j] - h[i]);
m[i] = mi;
}
}
}
cout << m[n];
return 0;
}
| #include <climits>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int m[n + 1];
int mi;
m[0] = 0;
m[1] = 0;
m[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
int j;
if (i - k >= 1)
j = i - k;
else
j = 1;
mi = m[j] + abs(h[j] - h[i]);
m[i] = mi;
j++;
for (j; j < i; j++) {
if (m[j] + abs(h[j] - h[i]) < mi) {
mi = m[j] + abs(h[j] - h[i]);
m[i] = mi;
}
}
}
cout << m[n];
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 961,226 | 961,227 | u952656223 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vector<signed> v;
signed main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 999999999;
for (int j = 1; j <= k && j < n; ++j) {
// debg(i-j);
dp[i] = min(dp[i], (dp[i - j] + abs(a[i] - a[i - j])));
}
// debg(dp[i]);
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vector<signed> v;
signed main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 999999999;
for (int j = 1; j <= k && i - j >= 0; ++j) {
// debg(i-j);
dp[i] = min(dp[i], (dp[i - j] + abs(a[i] - a[i - j])));
}
// debg(dp[i]);
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,228 | 961,229 | u423624748 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vector<signed> v;
signed main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 999999999;
for (int j = 1; j <= k && j <= n; ++j) {
// debg(i-j);
dp[i] = min(dp[i], (dp[i - j] + abs(a[i] - a[i - j])));
}
// debg(dp[i]);
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (signed i = 0; i < n; ++i)
#define int long long
#define str string
#define debg(a) cout << #a << ":" << a << endl;
#define print(a) cout << a << endl;
#define end cout << endl;
#define elif else if
int a, b, c, i, j, k, n, m, x, y, z;
str s, t;
vector<signed> v;
signed main() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, n) cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 999999999;
for (int j = 1; j <= k && i - j >= 0; ++j) {
// debg(i-j);
dp[i] = min(dp[i], (dp[i - j] + abs(a[i] - a[i - j])));
}
// debg(dp[i]);
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,230 | 961,229 | u423624748 | cpp |
p03161 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int h[100005], dp[100005], n, k;
int go(int idx) {
// cout << idx << endl;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = 1e9 + 7;
for (int j = 1; j <= k; j++) {
if (idx + j < n) {
ans = min(ans, go(idx + j) + abs(h[idx] - h[idx + j]));
}
}
return dp[idx] = ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[j]));
}
}
}
cout << dp[n - 1] << endl; /*
memset(dp, -1, sizeof dp);
cout << go(0) << endl;*/
return 0;
} | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int h[100005], dp[100005], n, k;
int go(int idx) {
// cout << idx << endl;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = 1e9 + 7;
for (int j = 1; j <= k; j++) {
if (idx + j < n) {
ans = min(ans, go(idx + j) + abs(h[idx] - h[idx + j]));
}
}
return dp[idx] = ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
}
cout << dp[n - 1] << endl; /*
memset(dp, -1, sizeof dp);
cout << go(0) << endl;*/
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,233 | 961,234 | u214622286 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
int arr[100005], dp[100005];
signed main() {
IOS int n, k;
cin >> n >> k;
int temp, dick;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = fabs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
temp = 100000;
for (int j = max(1LL, i - k); j < i; j++) {
dick = fabs(arr[i] - arr[j]);
temp = min(temp, dp[j] + dick);
}
dp[i] = temp;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
int arr[100005], dp[100005];
signed main() {
IOS int n, k;
cin >> n >> k;
int temp, dick;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = fabs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
temp = 100000000000;
for (int j = max(1LL, i - k); j < i; j++) {
dick = fabs(arr[i] - arr[j]);
temp = min(temp, dp[j] + dick);
}
dp[i] = temp;
}
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 961,235 | 961,236 | u834901453 | cpp |
p03161 | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 961,237 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j < K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[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"
] | 961,239 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,240 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 0; j < K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
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;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,241 | 961,238 | u000598325 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n;
int k;
long long arr[100001];
long long dp[100001];
long long bus(int x) {
if (x == n - 1)
return 0;
if (dp[x] != -1)
return dp[x];
dp[x] = abs(arr[x] - arr[x + 1]) + bus(x + 1);
for (int i = 2; i <= k; i++) {
if ((x + i) == n - 1)
break;
dp[x] = min(dp[x], abs(arr[x] - arr[x + 2]) + bus(x + 2));
}
return dp[x];
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n;
cin >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << bus(0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int k;
long long arr[100001];
long long dp[100001];
long long bus(int x) {
if (x >= n - 1)
return 0;
if (dp[x] != -1)
return dp[x];
dp[x] = abs(arr[x] - arr[x + 1]) + bus(x + 1);
for (int i = 2; i <= k; i++) {
if ((x + i) > n - 1)
break;
dp[x] = min(dp[x], abs(arr[x] - arr[x + i]) + bus(x + i));
}
return dp[x];
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n;
cin >> k;
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << bus(0) << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,258 | 961,259 | u552126476 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
const int INF = INT_MAX / 2;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
for (int k = 1; k <= K; k++) {
if (i + k < N)
chmin(dp[i + K], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
const int INF = INT_MAX / 2;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
for (int k = 1; k <= K; k++) {
if (i + k < N)
chmin(dp[i + k], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,260 | 961,261 | u639297580 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
const int INF = INT_MAX / 2;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
for (int k = 1; k <= K; k++) {
if (i + K < N)
chmin(dp[i + K], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
const int INF = INT_MAX / 2;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
for (int k = 1; k <= K; k++) {
if (i + k < N)
chmin(dp[i + k], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,262 | 961,261 | u639297580 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
const int INF = INT_MAX / 2;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
for (int k = 1; k <= K; k++) {
if (i + K < N)
chmin(dp[i + K], dp[i] + abs(h[i + K] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
const int INF = INT_MAX / 2;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) cin >> h[i];
vector<int> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
for (int k = 1; k <= K; k++) {
if (i + k < N)
chmin(dp[i + k], dp[i] + abs(h[i + k] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,263 | 961,261 | u639297580 | cpp |
p03161 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define show(x) cout << #x << " = " << x << endl;
#define yn(f) \
{ \
if (f) \
puts("YES"); \
else \
puts("NO"); \
}
#define yns(f) \
{ \
if (f) \
puts("Yes"); \
else \
puts("No"); \
}
#define show_ary(...) \
{ \
cout << #__VA_ARGS__ << " = "; \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out_ary(...) \
{ \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
using namespace std;
typedef long long int ll;
const ll LINF = 9000000000000000000ll;
const int INF = 2000000000;
const ll MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
k = min(n - 1, k);
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int dp[n];
dp[0] = 0;
int mn;
srep(i, k, 1) {
mn = INF;
rep(j, i) { mn = min(mn, dp[j] + abs(h[j] - h[i])); }
dp[i] = mn;
}
srep(i, n, k) {
mn = INF;
rep(j, k + 1) { mn = min(mn, dp[i - j] + abs(h[i - j] - h[i])); }
dp[i] = mn;
}
cout << dp[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 rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, n, s) for (int i = s; i < (n); ++i)
#define rsrep(i, n, s) for (int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define show(x) cout << #x << " = " << x << endl;
#define yn(f) \
{ \
if (f) \
puts("YES"); \
else \
puts("NO"); \
}
#define yns(f) \
{ \
if (f) \
puts("Yes"); \
else \
puts("No"); \
}
#define show_ary(...) \
{ \
cout << #__VA_ARGS__ << " = "; \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
#define out_ary(...) \
{ \
for (const auto &x : (__VA_ARGS__)) { \
cout << x << " "; \
} \
cout << endl; \
}
using namespace std;
typedef long long int ll;
const ll LINF = 9000000000000000000ll;
const int INF = 2000000000;
const ll MOD = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
k = min(n - 1, k);
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int dp[n];
dp[0] = 0;
int mn;
srep(i, k, 1) {
mn = INF;
rep(j, i) { mn = min(mn, dp[j] + abs(h[i] - h[j])); }
dp[i] = mn;
}
// show_ary(dp);
srep(i, n, k) {
mn = INF;
srep(j, k + 1, 1) { mn = min(mn, dp[i - j] + abs(h[i - j] - h[i])); }
dp[i] = mn;
}
// show_ary(dp);
cout << dp[n - 1] << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.function.change",
"call.arguments.add"
] | 961,272 | 961,273 | u365512540 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ff first
#define ss second
#define pb push_back
const int N = 1e5 + 5;
int a[N], dp[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
dp[i] = 1e9;
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++)
dp[i] = min(abs(a[i] - a[i - j]) + dp[i - j], dp[i]);
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ff first
#define ss second
#define pb push_back
const int N = 1e5 + 5;
int a[N], dp[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 0; i < N; i++)
dp[i] = 1e9;
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k && j < i; j++)
dp[i] = min(abs(a[i] - a[i - j]) + dp[i - j], dp[i]);
}
cout << dp[n] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 961,274 | 961,275 | u179256264 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> cost(N, 0);
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
int res = INT_MAX;
for (int k = 1; k <= K and i - k <= 0; k++) {
res = min(res, cost[i - k] + abs(h[i] - h[i - k]));
}
cost[i] = res;
}
cout << cost[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> cost(N, 0);
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
int res = INT_MAX;
for (int k = 1; k <= K and i - k >= 0; k++) {
res = min(res, cost[i - k] + abs(h[i] - h[i - k]));
}
cost[i] = res;
}
cout << cost[N - 1];
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 961,276 | 961,277 | u275188852 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[100010], num[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
for (int i = 2; i <= n; i++)
dp[i] = 1e9 + 7;
dp[1] = 0;
for (int i = 1; i <= n - k + 1; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(num[i] - num[i + j]));
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[200010], num[200010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
for (int i = 2; i <= n; i++)
dp[i] = 1e9 + 7;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(num[i] - num[i + j]));
}
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,278 | 961,279 | u411270124 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[100010], num[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
for (int i = 2; i <= n; i++)
dp[i] = 1e9 + 7;
dp[1] = 0;
for (int i = 1; i <= n - k; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(num[i] - num[i + j]));
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define input freopen("/Users/shahadat/Desktop/input.txt", "r", stdin)
int const MOD = 1e9 + 7;
using namespace std;
int dp[200010], num[200010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
for (int i = 2; i <= n; i++)
dp[i] = 1e9 + 7;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(num[i] - num[i + j]));
}
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,280 | 961,279 | u411270124 | cpp |
p03161 |
///╔══╗
///╚╗╔╝
///╔╝╚(¯`v´¯)
///╚══╝`.¸.´farzin
#include <bits/stdc++.h>
#define int int64_t
#define pb push_back
#define ibsws ios_base::sync_with_stdio
#define gcd __gcd
#define s second
#define f first
typedef std::pair<int, int> pii;
using namespace std;
const int N = 1e5 + 1e2;
int n, dp[N], h[N], k;
int32_t main() {
ibsws(true == false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1e12;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j + 1) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
}
cout << dp[n - 1];
}
|
///╔══╗
///╚╗╔╝
///╔╝╚(¯`v´¯)
///╚══╝`.¸.´farzin
#include <bits/stdc++.h>
#define int int64_t
#define pb push_back
#define ibsws ios_base::sync_with_stdio
#define gcd __gcd
#define s second
#define f first
typedef std::pair<int, int> pii;
using namespace std;
const int N = 1e5 + 1e2;
int n, dp[N], h[N], k;
int32_t main() {
ibsws(true == false);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1e15;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j + 1 > 0) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
// cout<<i<<' '<<i-j<<'\n';
}
}
}
cout << dp[n - 1];
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,281 | 961,282 | u624848802 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> v, b;
for (long long int i = 0; i < n; i++) {
long long int p;
cin >> p;
v.push_back(p);
}
long long int count = 0, cnt = 0, a = 0;
b.push_back(0);
for (long long int i = 1; i < n; i++) {
long long int mini = 1e5 + 1;
for (long long int j = (0 >= i - k ? 0 : i - k); j < i; j++) {
if (mini > (b[j] + abs(v[i] - v[j])))
mini = b[j] + abs(v[i] - v[j]);
}
// cout<<v[i]<<" "<<mini<<endl;
b.push_back(mini);
}
cout << b[b.size() - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> v, b;
for (long long int i = 0; i < n; i++) {
long long int p;
cin >> p;
v.push_back(p);
}
long long int count = 0, cnt = 0, a = 0;
b.push_back(0);
for (long long int i = 1; i < n; i++) {
long long int mini = 1e12 + 1;
for (long long int j = (0 >= i - k ? 0 : i - k); j < i; j++) {
if (mini >= (b[j] + abs(v[i] - v[j])))
mini = b[j] + abs(v[i] - v[j]);
}
// cout<<v[i]<<" "<<mini<<endl;
b.push_back(mini);
}
cout << b[b.size() - 1];
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,300 | 961,301 | u483145617 | cpp |
p03161 | // boom diggy diggy boom boom
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/
#include <bits/stdc++.h>
#define ull unsigned long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define ll long long
#define ld long double
int power(int x, int y) {
int res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
int ncr(int n, int r) {
int res = 1;
if (r > n - r)
r = n - r;
for (int i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a / gcd(a, b) * b); }
int max(int a, int b) {
int ans = a > b ? a : b;
return ans;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n + 1], b[n + 1] = {};
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 2; i <= n; ++i) {
b[i] = 100000;
int t = k;
for (int j = i - 1; j >= 1; --j) {
if (!t)
break;
int x = abs(a[i] - a[j]) + b[j];
b[i] = min(b[i], x);
t--;
}
}
cout << b[n];
return 0;
} | // boom diggy diggy boom boom
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/
#include <bits/stdc++.h>
#define ull unsigned long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define ll long long
#define ld long double
int power(int x, int y) {
int res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
int ncr(int n, int r) {
int res = 1;
if (r > n - r)
r = n - r;
for (int i = 0; i < r; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a / gcd(a, b) * b); }
int max(int a, int b) {
int ans = a > b ? a : b;
return ans;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ll a[n + 1], b[n + 1] = {};
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 2; i <= n; ++i) {
b[i] = 100000000000000000;
ll t = k;
for (int j = i - 1; j >= 1; --j) {
if (!t)
break;
ll x = abs(a[i] - a[j]) + b[j];
b[i] = min(b[i], x);
t--;
}
}
cout << b[n];
return 0;
} | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 961,307 | 961,308 | u513144254 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, INT_MIN);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] + abs(v[i] - v[i - j]), dp[i]);
}
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] + abs(v[i] - v[i - j]), dp[i]);
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [] | 961,313 | 961,314 | u400267362 | 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[100000];
for (int i = 0; i < 100000; i++)
dp[i] = 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], abs(arr[i] - arr[i - j]) + dp[i - 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[100000];
for (int i = 0; i < 100000; i++)
dp[i] = 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], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
}
cout << dp[n - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,315 | 961,316 | u504035134 | cpp |
p03161 | #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF 1000000000
#define MOD 1000000007
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int &h : H)
cin >> h;
vector<int> dp(N, INF);
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
for (int i = 2; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <chrono>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF 1000000000
#define MOD 1000000007
int main() {
int N, K;
cin >> N >> K;
vector<int> H(N);
for (int &h : H)
cin >> h;
vector<int> dp(N, INF);
dp[0] = 0;
dp[1] = abs(H[1] - H[0]);
for (int i = 2; i < N; i++) {
for (int j = 1; j <= K && j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 961,324 | 961,325 | u290693410 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int mini = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
mini = INT_MAX;
for (int i = 2; i < n; i++) {
// dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]));
int pom = 0;
for (int j = 1; j <= k; j++) {
if (i - j > 0) {
pom = dp[i - j] + abs(h[i] - h[i - j]);
if (pom < mini)
mini = pom;
}
}
dp[i] = mini;
mini = INT_MAX;
}
cout << dp[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int mini = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
mini = INT_MAX;
for (int i = 2; i < n; i++) {
// dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]));
int pom = 0;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
pom = dp[i - j] + abs(h[i] - h[i - j]);
if (pom < mini)
mini = pom;
}
}
dp[i] = mini;
mini = INT_MAX;
}
cout << dp[n - 1];
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,330 | 961,331 | u167245821 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, temp;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
long long int dp[n + 1], ind = 0;
dp[1] = 0;
for (long long int i = 2; i <= n; i++) {
temp = LONG_MAX;
for (long long int j = max(ind, i - k); j < i; j++) {
temp = min(temp, dp[j] + abs(h[j] - h[i]));
}
dp[i] = temp;
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, temp;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
long long int dp[n + 1], ind = 1;
dp[1] = 0;
for (long long int i = 2; i <= n; i++) {
temp = LONG_MAX;
for (long long int j = max(ind, i - k); j < i; j++) {
temp = min(temp, dp[j] + abs(h[j] - h[i]));
}
dp[i] = temp;
}
cout << dp[n];
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,332 | 961,333 | u547420959 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
} | [
"control_flow.loop.for.condition.change"
] | 961,337 | 961,338 | u314035582 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(v[i] - v[j]));
}
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT_MAX), v(n, 0);
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> v[i];
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(v[i] - v[j]));
}
}
cout << dp[n - 1];
} | [
"control_flow.branch.if.add"
] | 961,337 | 961,339 | u314035582 | cpp |
p03161 | #include <bits/stdc++.h>
#define f0(i, a, b) for (int i = a; i <= b; ++i)
#define f1(i, a, b) for (int i = a; i >= b; --i)
#define DEBUG(x) cerr << #x << " = " << x << endl
#define X first
#define Y second
using namespace std;
const long long base = 1e9 + 7;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
const long long MAX_N = 100011;
ll dp[MAX_N];
int Solves() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = base * 1000;
}
dp[1] = 0;
for (int i = 2; i <= k; i++) {
for (int j = 1; j < i; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[j]), dp[i]);
}
}
for (int i = k + 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n];
}
int main() { Solves(); }
| #include <bits/stdc++.h>
#define f0(i, a, b) for (int i = a; i <= b; ++i)
#define f1(i, a, b) for (int i = a; i >= b; --i)
#define DEBUG(x) cerr << #x << " = " << x << endl
#define X first
#define Y second
using namespace std;
const long long base = 1e9 + 7;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<ll, ii> iii;
const long long MAX_N = 100011;
ll dp[MAX_N];
int Solves() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = base * 1000;
}
dp[1] = 0;
for (int i = 2; i <= k; i++) {
for (int j = 1; j < i; j++) {
dp[i] = min(dp[j] + abs(h[i] - h[j]), dp[i]);
}
}
// DEBUG(dp[k]);
for (int i = k + 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
// DEBUG(dp[i]);
}
cout << dp[n];
}
int main() { Solves(); }
| [
"expression.operation.binary.remove"
] | 961,344 | 961,345 | u316398243 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, tmp;
cin >> n >> k;
deque<int> input(k), ans(k);
cin >> input[0];
if (k > n) {
k = n - 1;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
ans[0] = 0;
for (int i = 1; i < k; i++) {
cin >> input[i];
int mn = INT_MAX;
for (int j = i - 1; j >= 0; j--) {
mn = min(mn, abs(input[i] - input[j]) + ans[j]);
}
ans[i] = mn;
}
for (int i = k; i < n; i++) {
cin >> tmp;
int mn = INT_MAX;
for (int j = 0; j < k; j++) {
mn = min(mn, abs(tmp - input[j]) + ans[j]);
}
ans.pop_front();
ans.push_back(mn);
input.pop_front();
input.push_back(tmp);
}
cout << ans[k - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, tmp;
cin >> n >> k;
deque<int> input(k), ans(k);
cin >> input[0];
if (k > n) {
k = n;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
ans[0] = 0;
for (int i = 1; i < k; i++) {
cin >> input[i];
int mn = INT_MAX;
for (int j = i - 1; j >= 0; j--) {
mn = min(mn, abs(input[i] - input[j]) + ans[j]);
}
ans[i] = mn;
}
for (int i = k; i < n; i++) {
cin >> tmp;
int mn = INT_MAX;
for (int j = 0; j < k; j++) {
mn = min(mn, abs(tmp - input[j]) + ans[j]);
}
ans.pop_front();
ans.push_back(mn);
input.pop_front();
input.push_back(tmp);
}
cout << ans[k - 1] << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 961,352 | 961,353 | u564531070 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t;
cin >> n >> k;
vector<int> input(n, 0);
vector<int> score(n, 0);
for (int i = 0; i < n; i++) {
cin >> t;
input[i] = t;
}
for (int i = 1; i < k; i++) {
t = INT_MAX;
for (int j = 1; j <= i; j++) {
t = min(t, abs(input[i] - input[i - j]) + score[i - j]);
}
score[i] = t;
}
for (int i = k; i < n; i++) {
t = INT_MAX;
for (int j = 1; j <= k; j++) {
t = min(t, abs(input[i] - input[i - j]) + score[i - j]);
}
score[i] = t;
}
cout << score[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t;
cin >> n >> k;
vector<int> input(n, 0);
vector<int> score(n, 0);
for (int i = 0; i < n; i++) {
cin >> t;
input[i] = t;
}
for (int i = 1; i < k && i < n; i++) {
t = INT_MAX;
for (int j = 1; j <= i; j++) {
t = min(t, abs(input[i] - input[i - j]) + score[i - j]);
}
score[i] = t;
}
for (int i = k; i < n; i++) {
t = INT_MAX;
for (int j = 1; j <= k; j++) {
t = min(t, abs(input[i] - input[i - j]) + score[i - j]);
}
score[i] = t;
}
cout << score[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 961,354 | 961,355 | u564531070 | cpp |
p03161 | #include <bits/stdtr1c++.h>
// typedef __int128 int128;
// typedef __float128 float128;
using namespace std;
using namespace rel_ops;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef vector<pt> pol;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<ld> vd;
typedef vector<vd> vvd;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
#define pb push_back
int main() {
// freopen("A.in", "r", stdin);
ll N;
cin >> N;
ll K;
cin >> K;
ll h[100010], prev[100010];
for (ll i = 1; i <= N; i++) {
cin >> h[i];
if (i == 1)
continue;
prev[i] = prev[i - 1] + abs(h[i] - h[i - 1]);
for (ll j = 2; j <= K; j++) {
prev[i] = min(prev[i], prev[i - j] + abs(h[i] - h[i - j]));
}
}
cout << prev[N] << endl;
}
| #include <bits/stdtr1c++.h>
// typedef __int128 int128;
// typedef __float128 float128;
using namespace std;
using namespace rel_ops;
typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef vector<pt> pol;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<ld> vd;
typedef vector<vd> vvd;
typedef pair<ll, ll> pii;
typedef vector<pii> vpii;
#define pb push_back
int main() {
// freopen("A.in", "r", stdin);
ll N;
cin >> N;
ll K;
cin >> K;
ll h[100010], prev[100010];
for (ll i = 1; i <= N; i++) {
cin >> h[i];
if (i == 1)
continue;
prev[i] = prev[i - 1] + abs(h[i] - h[i - 1]);
for (ll j = 2; j <= K && i - j > 0; j++) {
prev[i] = min(prev[i], prev[i - j] + abs(h[i] - h[i - j]));
}
}
cout << prev[N] << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 961,360 | 961,361 | u317474337 | cpp |
p03161 | #include <stdio.h>
#define MAX (100000)
#define ABS(NUM) ((NUM > 0) ? (NUM) : ((-1) * (NUM)))
#define MIN(NUM1, NUM2) ((NUM1 > NUM2) ? (NUM2) : (NUM1))
int main(void) {
int n, k, h[MAX] = {};
int i, j;
int step[MAX] = {};
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = 1; i < n; i++) {
step[i] = 0xFFFF;
for (j = 1; j <= k; j++) {
if ((i - j) < 0)
break;
step[i] = MIN((ABS(h[i] - h[i - j]) + step[i - j]), step[i]);
}
}
printf("%d\n", step[--i]);
return (0);
}
| #include <stdio.h>
#define MAX (100000)
#define ABS(NUM) ((NUM > 0) ? (NUM) : ((-1) * (NUM)))
#define MIN(NUM1, NUM2) ((NUM1 > NUM2) ? (NUM2) : (NUM1))
int main(void) {
int n, k, h[MAX] = {};
int i, j;
int step[MAX] = {};
scanf("%d %d", &n, &k);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = 1; i < n; i++) {
step[i] = 0x7FFFFFFF;
for (j = 1; j <= k; j++) {
if ((i - j) < 0)
break;
step[i] = MIN((ABS(h[i] - h[i - j]) + step[i - j]), step[i]);
}
}
printf("%d\n", step[--i]);
return (0);
}
| [
"literal.number.change",
"assignment.value.change"
] | 961,364 | 961,365 | u490101632 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (ull i = start; i < end; i++)
#define N 100001
#define all(v) v.begin(), v.end()
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << " "; \
nl
int main() {
fastio();
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n + 1, 0);
loop(i, 0, n) cin >> v[i];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(v[i] - v[i - 1]);
for (int j = 2; i >= j && j <= k; j++)
dp[i] = min(dp[i], dp[i - k] + abs(v[i] - v[i - k]));
}
cout << dp[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (ull i = start; i < end; i++)
#define N 100001
#define all(v) v.begin(), v.end()
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << " "; \
nl
int main() {
fastio();
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n + 1, 0);
loop(i, 0, n) cin >> v[i];
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(v[i] - v[i - 1]);
for (int j = 2; i >= j && j <= k; j++)
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
cout << dp[n - 1];
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,366 | 961,367 | u129652323 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("frog.txt","r", stdin);
ll n, net, sum, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n + 1];
dp[0] = 0;
dp[1] = dp[0] + abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
ll j = 0;
dp[i] = INT_MAX;
while (j < k) {
if (i - j < 1) {
break;
}
dp[i] = min(dp[i], min((dp[i - j - 1] + abs(a[i] - a[i - j - 1])),
(dp[i - j] + abs(a[i] - a[i - j]))));
j++;
}
if (k <= 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i - 2]);
}
}
if (n == 2) {
cout << (dp[1] - dp[0]);
return 0;
} else if (n < 2) {
cout << 0 << endl;
return 0;
}
cout << dp[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("frog.txt","r", stdin);
ll n, net, sum, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n + 1];
dp[0] = 0;
dp[1] = dp[0] + abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
ll j = 0;
dp[i] = INT_MAX;
while (j < k) {
if (i - j < 1) {
break;
}
dp[i] = min(dp[i], min((dp[i - j - 1] + abs(a[i] - a[i - j - 1])),
(dp[i - j] + abs(a[i] - a[i - j]))));
j++;
}
if (k < 1) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i - 2]);
}
}
if (n == 2) {
cout << (dp[1] - dp[0]);
return 0;
} else if (n < 2) {
cout << 0 << endl;
return 0;
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,368 | 961,369 | u504873850 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
#define int long long
//////////
signed main() {
fastio;
int n, k;
cin >> n, k;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
ans[i] = inf;
int j = i - 1;
while (j >= 0 && i - j <= k) {
ans[i] = min(ans[i], ans[j] + abs(a[j] - a[i]));
--j;
}
}
cout << ans[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 200000000000000
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
#define int long long
//////////
signed main() {
fastio;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
ans[i] = inf;
int j = i - 1;
while (j >= 0 && i - j <= k) {
ans[i] = min(ans[i], ans[j] + abs(a[j] - a[i]));
--j;
}
}
cout << ans[n - 1];
} | [] | 961,374 | 961,375 | u883546077 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.