problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03161 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; i < n; i++) {
minCost[i] = abs(height[i] - height[i - 1]) + minCost[i - 1];
for (int j = i - 2; j >= i - k; j--)
minCost[i] = min(minCost[i], abs(height[i] - height[j]) + minCost[j]);
}
cout << minCost.back();
return 0;
}
| #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; i < n; i++) {
minCost[i] = abs(height[i] - height[i - 1]) + minCost[i - 1];
for (int j = i - 2; j >= i - k && j >= 0; j--)
minCost[i] = min(minCost[i], abs(height[i] - height[j]) + minCost[j]);
}
cout << minCost.back();
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 957,053 | 957,054 | u812439155 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[i] = a;
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k and i - j >= 0; j++) {
int curr = dp[i - j] + abs(v[i] - v[i - j]);
if (curr < dp[i]) {
dp[i] = curr;
}
}
}
cout << dp[n - 1];
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[i] = a;
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k and i - j >= 0; j++) {
int curr = dp[i - j] + abs(v[i] - v[i - j]);
if (curr < dp[i] or j == 1) {
dp[i] = curr;
}
}
}
cout << dp[n - 1];
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 957,059 | 957,060 | u600929585 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int j[N], dp[N];
for (int i = 0; i < N; i++) {
cin >> j[i];
}
memset(dp, 1000000000, sizeof(dp));
dp[0] = 0;
// dp[1]=abs(j[1]-j[0]);
// int ind,val;
for (int i = 1; i < N; i++) {
for (int r = 1; r <= min(i, K); r++) {
dp[i] = min(dp[i - r] + abs(j[i] - j[i - r]), dp[i]);
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int j[N], dp[N];
for (int i = 0; i < N; i++) {
cin >> j[i];
}
memset(dp, 1000000, sizeof(dp));
dp[0] = 0;
// dp[1]=abs(j[1]-j[0]);
// int ind,val;
for (int i = 1; i < N; i++) {
for (int r = 1; r <= min(i, K); r++) {
dp[i] = min(dp[i - r] + abs(j[i] - j[i - r]), dp[i]);
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 957,063 | 957,064 | u760654905 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= max(0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= max(0, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << "\n";
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,066 | 957,067 | u036426043 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef pair<int, int> ii;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define mod2 998244353
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
#define rep(i, a, b) for (int i = (a); i <= int(b); i++)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define nl "\n"
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
unsigned long long factorial[1000004];
/*factorial[0] = 1;
for (int i = 1; i <= n; i++) {
factorial[i] = (factorial[i - 1] * i) % mod3;
}*/
unsigned long long power(unsigned long long x, int y, int p) {
unsigned long long res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
unsigned long long modInverse(unsigned long long n, int p) {
return power(n, p - 2, p);
}
unsigned long long nc(unsigned long long n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (factorial[n] * modInverse(factorial[r], p) % p *
modInverse(factorial[n - r], p) % p) %
p;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vll h(n + 1);
fo(i, n) { cin >> h[i + 1]; }
vll c(n + 1);
fo(i, n) { c[i + 1] = 10003; }
c[1] = 0;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= min(i + k, n); j++) {
c[j] = min(c[j], c[i] + abs(h[i] - h[j]));
}
}
cout << c[n] << nl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef pair<int, int> ii;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define mod2 998244353
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i = c.begin(); i != c.end(); i++)
#define present(c, x) (c.find(x) != c.end())
#define cpresent(c, x) (find(all(c), x) != c.end())
#define rep(i, a, b) for (int i = (a); i <= int(b); i++)
#define fo(i, n) for (ll i = 0; i < n; i++)
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define Yes cout << "Yes\n"
#define No cout << "No\n"
#define nl "\n"
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
unsigned long long factorial[1000004];
/*factorial[0] = 1;
for (int i = 1; i <= n; i++) {
factorial[i] = (factorial[i - 1] * i) % mod3;
}*/
unsigned long long power(unsigned long long x, int y, int p) {
unsigned long long res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
unsigned long long modInverse(unsigned long long n, int p) {
return power(n, p - 2, p);
}
unsigned long long nc(unsigned long long n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (factorial[n] * modInverse(factorial[r], p) % p *
modInverse(factorial[n - r], p) % p) %
p;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vll h(n + 1);
fo(i, n) { cin >> h[i + 1]; }
vll c(n + 1);
fo(i, n) { c[i + 1] = 1000000007; }
c[1] = 0;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= min(i + k, n); j++) {
c[j] = min(c[j], c[i] + abs(h[i] - h[j]));
}
}
cout << c[n] << nl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 957,068 | 957,069 | u988261213 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1] = {0};
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--)
dp[i] = min(dp[j] + abs(h[i] - h[j]), dp[i]);
}
cout << dp[n];
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 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[j] + abs(h[i] - h[j]), dp[i]);
}
cout << dp[n];
}
int main() {
solve();
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,081 | 957,082 | u960146998 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> in(n);
for (int i = 0; i < n; i++)
cin >> in[i];
vector<int> dp(n, 1e5 + 7);
dp[0] = 0;
for (int i = 1; i < n; i++)
for (int t = (i - k >= 0 ? i - k : 0); t < i; t++)
dp[i] = min(dp[t] + abs(in[i] - in[t]), dp[i]);
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> in(n);
for (int i = 0; i < n; i++)
cin >> in[i];
vector<int> dp(n, 2e9 + 7);
dp[0] = 0;
for (int i = 1; i < n; i++)
for (int t = (i - k >= 0 ? i - k : 0); t < i; t++)
dp[i] = min(dp[t] + abs(in[i] - in[t]), dp[i]);
cout << dp[n - 1] << endl;
} | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,091 | 957,092 | u578026104 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll arr[n];
ll dp[n];
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (ll i = k; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll arr[n];
ll dp[n];
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (ll i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
cout << dp[n - 1];
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change"
] | 957,093 | 957,094 | u893023964 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const string ddd = "Debug\n";
#define de_ar(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i] << " "; \
cout << '\n';
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1; // cin>>t;
while (t--) {
ll n, k;
cin >> n >> k;
ll arr[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (ll i = 2; i < n; i++) {
dp[i] = INF;
for (ll j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
const string ddd = "Debug\n";
#define de_ar(arr, n) \
for (int i = 0; i < n; i++) \
cout << arr[i] << " "; \
cout << '\n';
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1; // cin>>t;
while (t--) {
ll n, k;
cin >> n >> k;
ll arr[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (ll i = 1; i < n; i++) {
dp[i] = INF;
for (ll j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1] << endl;
}
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,098 | 957,099 | u366464757 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n + 1];
for (long i = 1; i <= n; i++)
cin >> a[i];
long long ans[n + 1];
ans[0] = 0;
ans[1] = 0;
for (long i = 2; i <= n; i++) {
ans[i] = INT_MAX;
for (long j = i - 1; j >= 0 and j >= (i - k); j--) {
ans[i] = min(ans[i], ans[j] + abs(a[i] - a[j]));
}
}
cout << ans[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n + 1];
for (long i = 1; i <= n; i++)
cin >> a[i];
long long ans[n + 1];
ans[0] = 0;
ans[1] = 0;
for (long i = 2; i <= n; i++) {
ans[i] = INT_MAX;
for (long j = i - 1; j >= 1 and j >= (i - k); j--) {
ans[i] = min(ans[i], ans[j] + abs(a[i] - a[j]));
}
}
cout << ans[n] << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,102 | 957,103 | u050539031 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef vector<vector<P>> vvP;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
cin >> n >> k;
vl h(n);
rep(i, n) { cin >> h[i]; }
vl dp(n, INF); // dp[i] : 足場iにたどりつく最小コスト
dp[0] = 0;
rep(i, n) {
exrep(j, 1, k) {
if (i + j < n) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
}
}
out(dp[n - 1]);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef vector<vector<P>> vvP;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, k;
cin >> n >> k;
vl h(n);
rep(i, n) { cin >> h[i]; }
vl dp(n, INF); // dp[i] : 足場iにたどりつく最小コスト
dp[0] = 0;
rep(i, n) {
exrep(j, 1, k) {
if (i + j < n) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
}
out(dp[n - 1]);
re0;
} | [] | 957,104 | 957,105 | u828388155 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), 10001);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - j]) + a[i - j], a[i]);
else
break;
}
}
return a[v.size() - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
cout << frog(v, k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), INT_MAX);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - j]) + a[i - j], a[i]);
else
break;
}
}
return a[v.size() - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
cout << frog(v, k);
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 957,106 | 957,107 | u635291249 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), 10001);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - 1]) + a[i - 1], a[i]);
else
break;
}
}
return a[v.size() - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
cout << frog(v, k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int frog(vector<int> v, int k) {
vector<int> a(v.size(), INT_MAX);
a[0] = 0;
for (int i = 1; i < v.size(); i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
a[i] = min(abs(v[i] - v[i - j]) + a[i - j], a[i]);
else
break;
}
}
return a[v.size() - 1];
}
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
cout << frog(v, k);
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 957,108 | 957,107 | u635291249 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
for (int j = 2; j <= min(k, i + i); j++) {
dp[i + 1] = min(dp[i + 1], dp[i + 1 - j] + abs(h[i + 1] - h[i + 1 - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
for (int j = 2; j <= min(k, i + 1); j++) {
dp[i + 1] = min(dp[i + 1], dp[i + 1 - j] + abs(h[i + 1] - h[i + 1 - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,109 | 957,110 | u110383054 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
for (int j = 2; j <= min(k, j + i); j++) {
dp[i + 1] = min(dp[i + 1], dp[i + 1 - j] + abs(h[i + 1] - h[i + 1 - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int *dp = new int[n]; // dp[i]はi番目の足場までの最小コスト
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
for (int j = 2; j <= min(k, i + 1); j++) {
dp[i + 1] = min(dp[i + 1], dp[i + 1 - j] + abs(h[i + 1] - h[i + 1 - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 957,111 | 957,110 | u110383054 | cpp |
p03161 | #include <bits/stdc++.h>
#include <set>
#include <vector>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define test \
int t; \
cin >> t; \
while (t-- > 0)
#define pb push_back
#define pp pop_back
#define mk make_pair
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define ll long long
#define debug(i, x) cout << "Case #" << i << ": " << x << "\n"
#define debug1(i, x, y) cout << "Case #" << i << ": " << x << " " << y << "\n"
#define mx 10000000
#define pi pair<int, int>
#define pl pair<long long, long long>
#define fi first
#define se second
using namespace std;
int main() {
boost
int n,
k;
cin >> n >> k;
int a[n];
fo(i, n) cin >> a[i];
int dp[n + 1];
dp[0] = 0;
fo1(i, n - 1) {
dp[i] = 10000;
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
// cout<<dp[i]<<" ";
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
#include <set>
#include <vector>
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define test \
int t; \
cin >> t; \
while (t-- > 0)
#define pb push_back
#define pp pop_back
#define mk make_pair
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define ll long long
#define debug(i, x) cout << "Case #" << i << ": " << x << "\n"
#define debug1(i, x, y) cout << "Case #" << i << ": " << x << " " << y << "\n"
#define mx 1000000000
#define pi pair<int, int>
#define pl pair<long long, long long>
#define fi first
#define se second
using namespace std;
int main() {
boost int n, k;
cin >> n >> k;
ll a[n];
fo(i, n) cin >> a[i];
ll dp[n];
dp[0] = 0;
fo1(i, n - 1) {
dp[i] = mx;
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1];
} | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,118 | 957,119 | u755542082 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i <= k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k + 1; i < n; i++) {
int temp = 10009;
for (j = 1; j <= k; j++)
temp = min(temp, dp[i - j] + abs(A[i] - A[i - j]));
dp[i] = temp;
}
cout << dp[n - 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i <= k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k + 1; i < n; i++) {
int temp = 1000000009;
for (j = 1; j <= k; j++)
temp = min(temp, dp[i - j] + abs(A[i] - A[i - j]));
dp[i] = temp;
}
cout << dp[n - 1] << endl;
}
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 957,120 | 957,121 | u028218659 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i < k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k; i < n; i++) {
int temp = 10009;
for (j = 1; j <= k; j++)
temp = min(temp, dp[i - j] + abs(A[i] - A[i - j]));
dp[i] = temp;
}
cout << dp[n - 1] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j = 0;
cin >> n >> k;
int A[n], dp[n];
for (i = 0; i < n; i++)
cin >> A[i];
if (k >= n)
cout << abs(A[0] - A[n - 1]) << endl;
else {
for (i = 0; i <= k; i++)
dp[i] = abs(A[i] - A[0]);
for (i = k + 1; i < n; i++) {
int temp = 1000000009;
for (j = 1; j <= k; j++)
temp = min(temp, dp[i - j] + abs(A[i] - A[i - j]));
dp[i] = temp;
}
cout << dp[n - 1] << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.initializer.change",
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 957,122 | 957,121 | u028218659 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
#define vi vector<int>
#define loop(i, n) for (int i = 1; i <= n; i++)
#define loop0(i, n) for (int i = 0; i < n; i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%d", i)
long long int n, k, h[100001], dp[100001];
long long int solve(long long int stone) {
if (stone == n)
return 0;
if (stone > n)
return -1;
if (dp[stone] != -1)
return dp[stone];
if (stone == n - 1)
return dp[stone] = abs(h[n] - h[stone]);
long long int ans = INT_MAX;
loop(i, k) {
ans = min(ans, solve(stone + i) + abs(h[stone] - h[stone + i]));
}
return dp[stone] = ans;
}
int main() {
memset(dp, -1, sizeof(dp));
in(n);
in(k);
loop(i, n) in(h[i]);
cout << solve(1) << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
#define vi vector<int>
#define loop(i, n) for (int i = 1; i <= n; i++)
#define loop0(i, n) for (int i = 0; i < n; i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%d", i)
long long int n, k, h[100001], dp[100001];
long long int solve(long long int stone) {
if (stone == n)
return 0;
if (stone > n)
return INT_MAX;
if (dp[stone] != -1)
return dp[stone];
if (stone == n - 1)
return dp[stone] = abs(h[n] - h[stone]);
long long int ans = INT_MAX;
loop(i, k) {
ans = min(ans, solve(stone + i) + abs(h[stone] - h[stone + i]));
}
return dp[stone] = ans;
}
int main() {
memset(dp, -1, sizeof(dp));
in(n);
in(k);
loop(i, n) in(h[i]);
cout << solve(1) << "\n";
}
| [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 957,133 | 957,134 | u449959834 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N);
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(1000001);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(1000001);
for (int i = 0; i < 1000001; 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;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,139 | 957,136 | u058106405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N);
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(100000);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(100000);
for (int i = 0; i < 100000; 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;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,139 | 957,144 | u058106405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N);
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
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;
}
int main() {
ll N, K;
cin >> N >> K;
vector<ll> h(110000);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(110000);
for (int i = 0; i < 110000; 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;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,139 | 957,145 | u058106405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<long long> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= max(0, i - k); j++) {
dp[i] = min(dp[i], abs(arr[j] - arr[i]) + dp[j]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
vector<long long> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
// for(int i=0; i<n; i++) cout<<arr[i]<<" ";
// cout<<endl;
vector<long long> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - 1; j >= max(0, i - k); j--) {
dp[i] = min(dp[i], abs(arr[j] - arr[i]) + dp[j]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [] | 957,157 | 957,158 | u081697951 | cpp |
p03161 | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100005];
int frog(int a[], int n, int k) {
for (int i = 2; i <= n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--)
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
int a[n] = {0};
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, sizeof dp, 0);
cout << frog(a, n, k) << "\n";
return 0;
} | #include <climits>
#include <cstring>
#include <iostream>
using namespace std;
int dp[100005];
int frog(int a[], int n, int k) {
for (int i = 2; i <= n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--)
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
int a[n + 1] = {0};
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, sizeof dp, 0);
cout << frog(a, n, k) << "\n";
return 0;
} | [
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 957,167 | 957,168 | u320938106 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) \
for (auto it_test : a_1) \
cout << it_test << " ";
#define end cout << endl;
const int MAX = 1000001;
vector<long long> isprime(MAX, true);
vector<long long> prime;
vector<long long> SPF(MAX);
void Seive(int N) {
isprime[0] = isprime[1] = false;
for (long long int i = 2; i < N; i++) {
if (isprime[i]) {
prime.push_back(i);
SPF[i] = i;
}
for (long long int j = 0;
j < (int)prime.size() && i * prime[j] < N && prime[j] <= SPF[i]; j++) {
isprime[i * prime[j]] = false;
SPF[i * prime[j]] = prime[j];
}
}
}
ll expo(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll p = expo(a, b / 2, m) % m;
p = (p * p) % m;
return (b % 2 == 0) ? p : (a * p) % m;
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (auto &i : arr)
cin >> i;
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
cout << dp[n - 1] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) \
for (auto it_test : a_1) \
cout << it_test << " ";
#define end cout << endl;
const int MAX = 1000001;
vector<long long> isprime(MAX, true);
vector<long long> prime;
vector<long long> SPF(MAX);
void Seive(int N) {
isprime[0] = isprime[1] = false;
for (long long int i = 2; i < N; i++) {
if (isprime[i]) {
prime.push_back(i);
SPF[i] = i;
}
for (long long int j = 0;
j < (int)prime.size() && i * prime[j] < N && prime[j] <= SPF[i]; j++) {
isprime[i * prime[j]] = false;
SPF[i * prime[j]] = prime[j];
}
}
}
ll expo(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll p = expo(a, b / 2, m) % m;
p = (p * p) % m;
return (b % 2 == 0) ? p : (a * p) % m;
}
void solve() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (auto &i : arr)
cin >> i;
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k && j <= i; j++)
dp[i] = min(dp[i], abs(arr[i] - arr[i - j]) + dp[i - j]);
}
cout << dp[n - 1] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 957,173 | 957,174 | u806983635 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define po2(z) 1 << (ll)z
#define fr(i, x, n) for (ll i = (ll)(x); i < (ll)(n); ++i)
#define rf(i, x, n) for (ll i = (ll)(x); i >= (ll)(n); --i)
#define modinv(x) powah(x, mod - 2)
#define ncr(n, r) \
(((fact[n] * modinv(fact[n - r])) % mod * modinv(fact[r])) % mod)
#define factorial \
fact.pb(1); \
sidha(i, 1, MAX) fact.pb((fact[i - 1] * i) % mod)
#define TC \
ll test; \
cin >> test; \
while (test--)
#define tej \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mod (ll)1000000007
#define MAX 100005
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
ll dp[n];
fr(i, 0, n) { dp[i] = 1000000007; }
fr(i, 0, n) { cin >> a[i]; }
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = 1; j <= k; j++) {
if (i + j < n) {
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i + j] - a[i]));
}
}
}
cout << dp[n - 2];
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define po2(z) 1 << (ll)z
#define fr(i, x, n) for (ll i = (ll)(x); i < (ll)(n); ++i)
#define rf(i, x, n) for (ll i = (ll)(x); i >= (ll)(n); --i)
#define modinv(x) powah(x, mod - 2)
#define ncr(n, r) \
(((fact[n] * modinv(fact[n - r])) % mod * modinv(fact[r])) % mod)
#define factorial \
fact.pb(1); \
sidha(i, 1, MAX) fact.pb((fact[i - 1] * i) % mod)
#define TC \
ll test; \
cin >> test; \
while (test--)
#define tej \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define mod (ll)1000000007
#define MAX 100005
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
ll dp[n];
fr(i, 0, n) { dp[i] = 1000000007; }
fr(i, 0, n) { cin >> a[i]; }
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = 1; j <= k; j++) {
if (i + j < n) {
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i + j] - a[i]));
}
}
}
cout << dp[n - 1];
}
| [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 957,177 | 957,178 | u600948506 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 100050;
int dp[N];
int n, arr[N];
int rec(int pos) {
if (pos == n + 1)
return 0;
int &ret = dp[pos];
if (ret != -1)
return ret;
ret = 1e9;
ret = min(ret, abs(arr[pos] - arr[pos + 1]) + rec(pos + 1));
if (pos + 2 <= n)
ret = min(ret, abs(arr[pos] - arr[pos + 2]) + rec(pos + 2));
return ret;
}
int main() {
memset(dp, -1, sizeof dp);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
printf("%d\n", rec(1));
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 100050;
int dp[N];
int n, arr[N];
int rec(int pos) {
if (pos == n)
return 0;
int &ret = dp[pos];
if (ret != -1)
return ret;
ret = 1e9;
ret = min(ret, abs(arr[pos] - arr[pos + 1]) + rec(pos + 1));
if (pos + 2 <= n)
ret = min(ret, abs(arr[pos] - arr[pos + 2]) + rec(pos + 2));
return ret;
}
int main() {
memset(dp, -1, sizeof dp);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &arr[i]);
printf("%d\n", rec(1));
}
| [
"expression.operation.binary.remove"
] | 957,179 | 957,181 | u560514115 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[100'000 + 5]; /// dp[i] = min cost to get from 0 to i
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> input(n);
for (int i = 0; i < n; i++)
cin >> input[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 2'000'000'000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - k] + abs(input[i] - input[i - k]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[100'000 + 5]; /// dp[i] = min cost to get from 0 to i
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> input(n);
for (int i = 0; i < n; i++)
cin >> input[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 2'000'000'000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(input[i] - input[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,180 | 957,182 | u829999461 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(as[i] - as[i - 1]);
for (int j = 2; j < min(k, i); j++)
dp[i] = min(dp[i], dp[i - j] + abs(as[i] - as[i - j]));
}
cout << dp[n - 1] << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(as[i] - as[i - 1]);
for (int j = 2; j <= min(k, i); j++)
dp[i] = min(dp[i], dp[i - j] + abs(as[i] - as[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"
] | 957,186 | 957,187 | u067151927 | cpp |
p03160 | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> dp(n, 114514), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(num[i] - num[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(num[i] - num[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> dp(n, 1145141919), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(num[i] - num[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(num[i] - num[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 957,191 | 957,192 | u952437626 | cpp |
p03160 | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n, 114514), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(num[i] - num[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(num[i] - num[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> dp(n, 1145141919), num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(num[i] - num[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(num[i] - num[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change"
] | 957,194 | 957,192 | u952437626 | cpp |
p03161 | #include <bits/stdc++.h>
#define filename "frog"
#define int long long
#define oo 1e9
#define N 25
using namespace std;
int n, k;
int f[N], a[N];
void open() {
// freopen(filename".inp","r",stdin) ;
// freopen(filename".out","w",stdout) ;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void readin() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
void process() {
for (int i = 1; i <= n; i++)
f[i] = oo;
f[1] = 0;
for (int i = 1; i < n; i++)
for (int j = 1; j <= k; j++) {
if (i + j > n)
break;
int pre = f[i] + abs(a[i] - a[j + i]);
f[i + j] = min(f[i + j], pre);
}
}
signed main() {
open();
readin();
process();
cout << f[n];
} | #include <bits/stdc++.h>
#define filename "frog"
#define int long long
#define oo 1e9
#define N 200005
using namespace std;
int n, k;
int f[N], a[N];
void open() {
// freopen(filename".inp","r",stdin) ;
// freopen(filename".out","w",stdout) ;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void readin() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
void process() {
for (int i = 1; i <= n; i++)
f[i] = oo;
f[1] = 0;
for (int i = 1; i < n; i++)
for (int j = 1; j <= k; j++) {
if (i + j > n)
break;
int pre = f[i] + abs(a[i] - a[j + i]);
f[i + j] = min(f[i + j], pre);
}
}
signed main() {
open();
readin();
process();
cout << f[n];
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 957,193 | 957,195 | u416328102 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(0);
ll n, i;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
if (n == 2)
cout << abs(a[1] - a[0]) << "\n";
else {
ll dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1] << "\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(0);
ll n, i;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
if (n == 2)
cout << abs(a[1] - a[0]) << "\n";
else {
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1] << "\n";
}
return 0;
} | [] | 957,196 | 957,198 | u319435722 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
static int dp[1000000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[1000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[N - 1] << endl;
return 0;
} | [
"variable_declaration.specifier.remove",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 957,200 | 957,202 | u863044225 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
} | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
} | [
"call.arguments.add"
] | 957,448 | 957,449 | u838391700 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
} | #include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
printf("%d\n", dp[n - 1]);
} | [
"call.arguments.add"
] | 957,450 | 957,449 | u838391700 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[1000000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[N - 1] << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[1000000];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
}
cout << dp[N - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 957,203 | 957,202 | u863044225 | cpp |
p03161 | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
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;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
int n, k;
cin >> n >> k;
vi h(n);
rep(i, n) cin >> h[i];
vi v(n, inf);
v[0] = 0;
rep(i, n) {
rep1(j, k) { chmin(v[i + j], abs(h[i + j] - h[i]) + v[i]); }
}
cout << v[n - 1] << endl;
return 0;
} | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for (int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
/* ----------------よく使う数字や配列----------------- */
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
/* ----------------------end----------------------- */
/* --------------------テンプレート------------------ */
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;
}
/* ----------------------end----------------------- */
/* --------------------ライブラリ-------------------- */
ll fact(int i) { //階乗
if (i == 0)
return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) { //最大公約数
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { //最小公倍数
return a * b / gcd(a, b);
}
int keta(ll n) { //桁数を求める
if (n == 0)
return 1;
int count = 0;
while (n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) { //各桁の和
ll sum = 0;
while (n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
/* ----------------------end----------------------- */
#pragma endregion
signed main() {
int n, k;
cin >> n >> k;
vi h(n);
rep(i, n) cin >> h[i];
vi v(n + 110, inf);
v[0] = 0;
rep(i, n) {
rep1(j, k) { chmin(v[i + j], abs(h[i + j] - h[i]) + v[i]); }
}
cout << v[n - 1] << endl;
return 0;
} | [
"assignment.change"
] | 957,210 | 957,214 | u608773191 | cpp |
p03161 | // https://atcoder.jp/contests/dp/tasks/dp_a
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vb vector<bool>
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define MOD 1000000007
#define MAX_TIME 1e9
#define nl "\n"
#define sp " "
#define gcd __gcd
#define pf printf
#define sf scanf
#define se(a) a.begin(), a.end()
#define fill(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
ll solve(int n, int k, vi h) {
vll dp(n, MOD);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i + k < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[j]));
}
// if(i + 1< n) dp[i+1] = min(dp[i+1],dp[i]+abs(h[i]-h[i+1]));
// if(i + 2< n) dp[i+2] = min(dp[i+2],dp[i]+abs(h[i]-h[i+2]));
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
vi h(n, 0);
fill(h, n);
cout << solve(n, k, h) << nl;
} | // https://atcoder.jp/contests/dp/tasks/dp_a
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vb vector<bool>
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll, ll>
#define MOD 1000000007
#define MAX_TIME 1e9
#define nl "\n"
#define sp " "
#define gcd __gcd
#define pf printf
#define sf scanf
#define se(a) a.begin(), a.end()
#define fill(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i]
ll solve(int n, int k, vi h) {
vll dp(n, MOD);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j < n)
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
// if(i + 1< n) dp[i+1] = min(dp[i+1],dp[i]+abs(h[i]-h[i+1]));
// if(i + 2< n) dp[i+2] = min(dp[i+2],dp[i]+abs(h[i]-h[i+2]));
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
vi h(n, 0);
fill(h, n);
cout << solve(n, k, h) << nl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 957,453 | 957,454 | u317884892 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[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(h[i] - h[j]));
}
}
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[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(h[i] - h[j]));
}
}
}
cout << dp[n - 1];
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,218 | 957,220 | u629532292 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
for (int j = 2; j < min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
for (int j = 2; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,222 | 957,224 | u339560028 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int niz[MAXN], DP[MAXN], n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> niz[i];
DP[0] = 0;
DP[1] = abs(niz[0] - niz[1]);
for (int i = 1; i < n; i++) {
DP[i] = min(DP[i - 1] + abs(niz[i - 1] - niz[i]),
DP[i - 2] + abs(niz[i] - niz[i - 2]));
}
cout << DP[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int niz[MAXN], DP[MAXN], n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> niz[i];
DP[0] = 0;
DP[1] = abs(niz[0] - niz[1]);
for (int i = 2; i < n; i++) {
DP[i] = min(DP[i - 1] + abs(niz[i - 1] - niz[i]),
DP[i - 2] + abs(niz[i] - niz[i - 2]));
}
cout << DP[n - 1];
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,209 | 957,211 | u185583625 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
for (int j = 2; j < min(i, k); j++) {
dp[i] = min(dp[i], dp[i - k] + abs(a[i - k] - a[i]));
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
int pos = a[0];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i - 1] - a[i]);
for (int j = 2; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - j] - a[i]));
}
}
cout << dp[n - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 957,226 | 957,224 | u339560028 | cpp |
p03161 | /* C program for Merge Sort */
#include <bits/stdc++.h>
using namespace std;
int dp[100001];
int a[100001];
int n;
int k;
long long int mod = 1000000007;
int max_q(int i) {
// cout<<"Function enters"<<endl;
if (i >= n - 1) {
return 0;
}
int m = INT_MAX;
if (dp[i] != -1) {
return dp[i];
}
for (int j = 1; j <= min(k, n - 1); j++) {
m = min(m, abs(a[i] - a[i + j]) + max_q(i + j));
}
dp[i] = m;
// dp[i]=min(abs(a[i]-a[i+1])+max_q(i+1),abs(a[i]-a[i+2])+max_q(i+2));
// dp[i][j][k]=max(dp[i][j][k],longest_sub(i,j,k+1));
return dp[i];
}
int main() {
for (int i = 0; i <= 100000; i++) {
dp[i] = -1;
}
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << max_q(0);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int a[100001];
int n;
int k;
long long int mod = 1000000007;
int max_q(int i) {
// cout<<"Function enters"<<endl;
if (i >= n - 1) {
return 0;
}
int m = INT_MAX;
if (dp[i] != -1) {
return dp[i];
}
for (int j = 1; j <= min(k, n - 1 - i); j++) {
m = min(m, abs(a[i] - a[i + j]) + max_q(i + j));
}
dp[i] = m;
// dp[i]=min(abs(a[i]-a[i+1])+max_q(i+1),abs(a[i]-a[i+2])+max_q(i+2));
// dp[i][j][k]=max(dp[i][j][k],longest_sub(i,j,k+1));
return dp[i];
}
int main() {
for (int i = 0; i <= 100000; i++) {
dp[i] = -1;
}
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << max_q(0);
return 0;
} | [
"control_flow.loop.for.condition.change"
] | 957,460 | 957,461 | u395649803 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 10000000001;
for (int j = 1; j <= K || j <= i; j++) {
int tmp =
abs(stone - stones[(pos - j + K) % K]) + steps[(pos - j + K) % K];
m = min(m, tmp);
}
steps[pos] = m;
stones[pos] = stone;
}
pos = (pos + 1) % K;
}
printf("%d\n", steps[(pos - 1 + K) % K]);
system("pause");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 0x7FFFFFFF;
for (int j = 1; j <= K && j <= i; j++) {
int tmp =
abs(stone - stones[(pos - j + K) % K]) + steps[(pos - j + K) % K];
m = min(m, tmp);
}
steps[pos] = m;
stones[pos] = stone;
}
pos = (pos + 1) % K;
}
printf("%d\n", steps[(pos - 1 + K) % K]);
system("pause");
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 957,464 | 957,465 | u803403788 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[N], dd[N] = {};
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
dd[0] = 0;
dd[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; ++i) {
dd[i] =
min(dd[i - 1] + abs(arr[i] - arr[i - 1]), dd[i - 2] + abs(arr[i - 2]));
}
cout << dd[n - 1];
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[N], dd[N] = {};
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
dd[0] = 0;
dd[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; ++i) {
dd[i] = min(dd[i - 1] + abs(arr[i] - arr[i - 1]),
dd[i - 2] + abs(arr[i] - arr[i - 2]));
}
cout << dd[n - 1];
} | [
"assignment.change"
] | 957,227 | 957,229 | u566755496 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
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]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
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]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
| [
"expression.operation.binary.add"
] | 957,231 | 957,233 | u573738515 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 10001;
for (int j = 1; j <= K && j <= i; j++) {
int tmp =
abs(stone - stones[(pos - j + K) % K]) + steps[(pos - j + K) % K];
m = min(m, tmp);
}
steps[pos] = m;
stones[pos] = stone;
}
pos = (pos + 1) % K;
}
printf("%d\n", steps[(pos - 1 + K) % K]);
system("pause");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 0x7FFFFFFF;
for (int j = 1; j <= K && j <= i; j++) {
int tmp =
abs(stone - stones[(pos - j + K) % K]) + steps[(pos - j + K) % K];
m = min(m, tmp);
}
steps[pos] = m;
stones[pos] = stone;
}
pos = (pos + 1) % K;
}
printf("%d\n", steps[(pos - 1 + K) % K]);
system("pause");
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 957,466 | 957,465 | u803403788 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + (abs(h[i] - h[i - 1]));
if (i > 2)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n;
int main() {
cin >> n;
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]));
if (i > 1)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change"
] | 957,235 | 957,233 | u573738515 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 1; j <= k; j++) {
if (i - j <= 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,468 | 957,469 | u016334391 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 2e5 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for (int i = 3; i <= n; i++) {
if (i <= k) {
min1 = 2e5 + 5;
for (int j = 1; j < i; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
} else {
min1 = 2e5 + 5;
for (int j = 1; j <= k && i - j >= 1; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 1e6 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for (int i = 3; i <= n; i++) {
if (i <= k) {
min1 = 1e10 + 5;
for (int j = 1; j < i; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
} else {
min1 = 1e10 + 5;
for (int j = 1; j <= k && i - j >= 1; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
}
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 957,252 | 957,246 | u690116847 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
h[0] = h[1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = 100000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
h[0] = h[1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = 1000000000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 957,470 | 957,471 | u016334391 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 1e5 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for (int i = 3; i <= n; i++) {
if (i <= k) {
min1 = 1e5 + 5;
for (int j = 1; j < i; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
} else {
min1 = 1e5 + 5;
for (int j = 1; j <= k && i - j >= 1; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
}
}
cout << dp[n];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int nxx = 1e5 + 5;
int arr[nxx], dp[nxx];
int n;
int main() {
cin >> n;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, -1, sizeof(dp));
int min1 = 1e6 + 5;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
int c = 0;
for (int i = 3; i <= n; i++) {
if (i <= k) {
min1 = 1e10 + 5;
for (int j = 1; j < i; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
} else {
min1 = 1e10 + 5;
for (int j = 1; j <= k && i - j >= 1; j++) {
min1 = min(dp[i - j] + abs(arr[i - j] - arr[i]), min1);
}
dp[i] = min1;
}
}
cout << dp[n];
return 0;
} | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 957,254 | 957,246 | u690116847 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define M_PIl 3.141592653589793238462643383279502884L /* pi */
const ll M = 1e9 + 7;
const int MaxM = 100005;
void SieveOfEratosthenes(int n) // all prime <= n
{
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
cout << p << " ";
}
bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); }
bool comp(pair<int, int> a, pair<int, int> b) {
if (a.F == b.F) {
return a.S > b.S;
}
return a.F < b.F;
}
void solve() {
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 100000;
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
}
int main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define M_PIl 3.141592653589793238462643383279502884L /* pi */
const ll M = 1e9 + 7;
const int MaxM = 100005;
void SieveOfEratosthenes(int n) // all prime <= n
{
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
cout << p << " ";
}
bool isPowerOfTwo(int x) { return x && (!(x & (x - 1))); }
bool comp(pair<int, int> a, pair<int, int> b) {
if (a.F == b.F) {
return a.S > b.S;
}
return a.F < b.F;
}
void solve() {
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
}
int main() {
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 957,474 | 957,475 | u485924641 | cpp |
p03160 | /*
TASK: nocows
LANG: C++14
*/
#include "bits/stdc++.h"
typedef long long ll;
typedef long double ld;
using namespace std;
#define finish(x) return cout << x, 0;
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
const string USCAO_TAG = "nocows";
void usaco() {
setIn(USCAO_TAG + ".in");
setOut(USCAO_TAG + ".out");
}
/*
template<typename... Args>
void print(Args... args) {
((std::cout << args << " "), ...);
}
*/
ll a[100001];
ll dp[100001][101];
int main() {
// usaco();
#ifndef ONLINE_JUDGE
// setIn("in.txt");
#endif
int n, k;
cin >> n;
k = 2;
memset(dp, 0x3f3f3f3f, sizeof dp);
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = a[1];
for (int i = k; i >= 1; i--) {
dp[n][i] = abs(a[n] - a[n - i]);
}
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; i - j >= 0; j++) {
for (int q = 1; q <= n - i && q <= 2; q++)
dp[i][j] = min(dp[i][j], dp[i + q][q] + abs(a[i] - a[i - j]));
}
}
ll mn = 1e9;
for (int i = 1; i <= k; i++) {
mn = min(mn, dp[1][i]);
}
cout << mn;
} | /*
TASK: nocows
LANG: C++14
*/
#include "bits/stdc++.h"
typedef long long ll;
typedef long double ld;
using namespace std;
#define finish(x) return cout << x, 0;
void setIn(string s) { freopen(s.c_str(), "r", stdin); }
void setOut(string s) { freopen(s.c_str(), "w", stdout); }
const string USCAO_TAG = "nocows";
void usaco() {
setIn(USCAO_TAG + ".in");
setOut(USCAO_TAG + ".out");
}
/*
template<typename... Args>
void print(Args... args) {
((std::cout << args << " "), ...);
}
*/
ll a[100001];
ll dp[100001][101];
int main() {
// usaco();
#ifndef ONLINE_JUDGE
// setIn("in.txt");
#endif
int n, k;
cin >> n;
k = 2;
memset(dp, 0x3f3f3f3f, sizeof dp);
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = a[1];
for (int i = k; i >= 1; i--) {
dp[n][i] = abs(a[n] - a[n - i]);
}
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; i - j >= 0 && j <= 2; j++) {
for (int q = 1; q <= n - i && q <= 2; q++)
dp[i][j] = min(dp[i][j], dp[i + q][q] + abs(a[i] - a[i - j]));
}
}
ll mn = 1e9;
for (int i = 1; i <= k; i++) {
mn = min(mn, dp[1][i]);
}
cout << mn;
} | [
"control_flow.loop.for.condition.change"
] | 957,259 | 957,261 | u557558723 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update> ordered_set; #define os_find(k)
find_by_order(k) #define os_order(k) order_of_key(k)
*/
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define loop1(i, a, b) for (int i = a; i <= b; i++)
#define rloop(i, a, b) for (int i = a; i > b; i--)
#define rloop1(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define int long long
#define fi first
#define se second
#define ncr(n, r) fact[n] * modInv(fact[r]) * modInv(fact[n - r])
#define modInv(a) binExp(a, mod - 2)
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define make_graph(k) \
int x, y; \
f0(i, 0, k) { \
cin >> x >> y; \
adj[x].pb(y); \
adj[y].pb(x); \
}
#define test \
int t; \
cin >> t; \
while (t--)
bool isPrime(int num) {
bool flag = true;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) {
flag = false;
break;
}
}
return flag;
}
int dp[100005];
signed main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
loop1(i, 1, n) cin >> arr[i];
dp[2] = abs(arr[2] - arr[1]);
loop1(i, 3, n) {
int minn = 100007;
loop1(j, 1, min(i - 1, k)) {
minn = min(dp[i - j] + abs(arr[i] - arr[i - j]), minn);
}
dp[i] = minn;
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update> ordered_set; #define os_find(k)
find_by_order(k) #define os_order(k) order_of_key(k)
*/
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef vector<int> vi;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define loop1(i, a, b) for (int i = a; i <= b; i++)
#define rloop(i, a, b) for (int i = a; i > b; i--)
#define rloop1(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define int long long
#define fi first
#define se second
#define ncr(n, r) fact[n] * modInv(fact[r]) * modInv(fact[n - r])
#define modInv(a) binExp(a, mod - 2)
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define make_graph(k) \
int x, y; \
f0(i, 0, k) { \
cin >> x >> y; \
adj[x].pb(y); \
adj[y].pb(x); \
}
#define test \
int t; \
cin >> t; \
while (t--)
bool isPrime(int num) {
bool flag = true;
for (int i = 2; i <= sqrt(num); i++) {
if (num % i == 0) {
flag = false;
break;
}
}
return flag;
}
int dp[100005];
signed main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
loop1(i, 1, n) cin >> arr[i];
dp[2] = abs(arr[2] - arr[1]);
loop1(i, 3, n) {
int minn = 10000000000007;
loop1(j, 1, min(i - 1, k)) {
minn = min(dp[i - j] + abs(arr[i] - arr[i - j]), minn);
}
dp[i] = minn;
}
cout << dp[n];
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 957,265 | 957,264 | u595525271 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1e9
int main(void) {
int N;
cin >> N;
vector<int> h(N + 2);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N + 2, 10000);
dp[0] = 0;
for (int i = 0; i < N; i++) {
if (dp[i + 1] > dp[i] + abs(h[i] - h[i + 1])) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
}
if (dp[i + 2] > dp[i] + abs(h[i] - h[i + 2])) {
dp[i + 2] = dp[i] + abs(h[i] - h[i + 2]);
}
}
cout << dp[N - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1e9
int main(void) {
int N;
cin >> N;
vector<ll> h(N + 2);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<ll> dp(N + 2, INF);
dp[0] = 0;
for (int i = 0; i < N; i++) {
if (dp[i + 1] > dp[i] + abs(h[i] - h[i + 1])) {
dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]);
}
if (dp[i + 2] > dp[i] + abs(h[i] - h[i + 2])) {
dp[i + 2] = dp[i] + abs(h[i] - h[i + 2]);
}
}
cout << dp[N - 1] << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 957,274 | 957,276 | u511344501 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> cost(n, INF);
cost[0] = 0;
for (int i = 1; i <= n - 1; i++) {
int it = k;
for (int j = 1; j <= it; j++) {
chmin(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
cout << cost[n - 1] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> cost(n, INF);
cost[0] = 0;
for (int i = 1; i <= n - 1; i++) {
int it = min(i, k);
for (int j = 1; j <= it; j++) {
chmin(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
cout << cost[n - 1] << '\n';
return 0;
} | [
"call.add",
"call.arguments.change"
] | 957,476 | 957,477 | u509516894 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int mn = INT_MAX;
for (int j = i - 1; j > i - k && j >= 0; j--)
mn = min(mn, dp[i - j] + abs(arr[i] - arr[j]));
dp[i] = mn;
}
cout << dp[n] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
int mn = INT_MAX;
for (int j = i - 1; j >= i - k && j >= 1; j--)
mn = min(mn, dp[j] + abs(arr[i] - arr[j]));
dp[i] = mn;
}
cout << dp[n] << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"expression.operation.binary.remove"
] | 957,267 | 957,269 | u733347296 | cpp |
p03160 | #include <iostream>
#include <stdlib.h>
using namespace std;
long long n, h[100005], dp[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(dp[2] - dp[1]);
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]));
}
cout << dp[n];
return 0;
}
| #include <iostream>
#include <stdlib.h>
using namespace std;
long long n, h[100005], dp[100005];
int main() {
cin >> n;
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++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n];
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,282 | 957,284 | u749027673 | cpp |
p03160 | #include <iostream>
#include <stdlib.h>
using namespace std;
int n, h[100005], dp[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(dp[2] - dp[1]);
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]));
}
cout << dp[n];
return 0;
}
| #include <iostream>
#include <stdlib.h>
using namespace std;
long long n, h[100005], dp[100005];
int main() {
cin >> n;
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++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n];
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.chan... | 957,286 | 957,284 | u749027673 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define inf 0x3f3f3f3f
int v[100100];
int memo[100100];
int n;
int go(int i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
int ans = 1 << 30;
if (i + 1 <= n - 1)
ans = min(ans, go(i + 1) + abs(v[i + 1] - v[i]));
if (i + 2 <= n - 2)
ans = min(ans, go(i + 2) + abs(v[i + 2] - v[i]));
return memo[i] = ans;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
memset(memo, -1, sizeof(memo));
cout << go(0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define inf 0x3f3f3f3f
int v[100100];
int memo[100100];
int n;
int go(int i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
int ans = 1 << 30;
if (i + 1 <= n - 1)
ans = min(ans, go(i + 1) + abs(v[i + 1] - v[i]));
if (i + 2 <= n - 1)
ans = min(ans, go(i + 2) + abs(v[i + 2] - v[i]));
return memo[i] = ans;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> v[i];
memset(memo, -1, sizeof(memo));
cout << go(0) << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,288 | 957,290 | u975517333 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j > i)
break;
if ((dp[i] > dp[i - j] + Abs(a[i] - a[i - j])))
dp[i] = dp[i - j] + Abs(a[i] - a[i - j]);
}
}
printf("%lld", dp[n]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = LONG_LONG_MAX;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j >= i)
break;
if ((dp[i] > dp[i - j] + Abs(a[i] - a[i - j])))
dp[i] = dp[i - j] + Abs(a[i] - a[i - j]);
}
}
printf("%lld", dp[n]);
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,272 | 957,273 | u530967084 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (int i = 0; i < m; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
int main() {
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int d[n];
d[0] = 0;
d[1] = abs(h[0] - h[1]);
FOR(i, 2, n)
d[i] = min(d[i - 2] + abs(h[i - 2] - h[i]), d[i - 1] + abs(h[i - 1] + h[i]));
cout << d[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m) for (int i = 0; i < m; i++)
#define FOR(i, n, m) for (int i = n; i < m; i++)
#define INF 1000000007
#define INFL (1LL << 60)
#define MOD 998244353
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define ll long long int
#define P pair<ll, ll>
int main() {
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int d[n];
d[0] = 0;
d[1] = abs(h[0] - h[1]);
FOR(i, 2, n)
d[i] = min(d[i - 2] + abs(h[i - 2] - h[i]), d[i - 1] + abs(h[i - 1] - h[i]));
cout << d[n - 1] << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,296 | 957,298 | u773548422 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = LONG_LONG_MAX;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j > i)
break;
if ((dp[i] > dp[i - j] + Abs(a[i] - a[i - j])))
dp[i] = dp[i - j] + Abs(a[i] - a[i - j]);
}
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long n, a[100010], dp[100010], k;
long long Abs(long long u) {
if (u > 0)
return u;
else
return u * (-1);
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = LONG_LONG_MAX;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j >= i)
break;
if ((dp[i] > dp[i - j] + Abs(a[i] - a[i - j])))
dp[i] = dp[i - j] + Abs(a[i] - a[i - j]);
}
}
cout << dp[n] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,275 | 957,277 | u530967084 | cpp |
p03161 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define VECMAX(x) *max_element(ALL(x))
#define VECMIN(x) *min_element(ALL(x))
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MULTIPLE(i, n, k) for (int i = (k); i < (n); i += k + 1) //倍数ループ
// constant
//------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define SIZEOF(x) sizeof(x) / sizeof(x[0])
int main() {
LL n, k;
LL dp[100100];
LL h[100100];
cin >> n >> k;
FOR(i, 1, n + 1) cin >> h[i];
FOR(i, 2, n + 1) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
FOR(j, 2, k + 1) { dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j])); }
}
cout << dp[n];
return 0;
} | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define VECMAX(x) *max_element(ALL(x))
#define VECMIN(x) *min_element(ALL(x))
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define MULTIPLE(i, n, k) for (int i = (k); i < (n); i += k + 1) //倍数ループ
// constant
//------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
#define SIZEOF(x) sizeof(x) / sizeof(x[0])
int main() {
LL n, k;
LL dp[100100];
LL h[100100];
cin >> n >> k;
FOR(i, 1, n + 1) cin >> h[i];
FOR(i, 2, n + 1) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
FOR(j, 2, k + 1) {
if (i > j)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n];
return 0;
}
| [
"control_flow.branch.if.add"
] | 957,482 | 957,483 | u089668660 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans[n];
ans[0] = h[0];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int mi = INT_MAX;
int a = k;
int j = i - 1;
while (a > 0 && j >= 0) {
mi = min(abs(h[i] - h[j]) + ans[j], mi);
j--;
a--;
}
ans[i] = mi;
}
cout << ans[n - 1];
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans[n];
ans[0] = 0;
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int mi = INT_MAX;
int a = k;
int j = i - 1;
while (a > 0 && j >= 0) {
mi = min(abs(h[i] - h[j]) + ans[j], mi);
j--;
a--;
}
ans[i] = mi;
}
cout << ans[n - 1];
}
| [] | 957,279 | 957,281 | u145819223 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define MOD 1000000007
#define sz5 100005
#define sz6 1000005
#define UP upper_bound
#define LB lower_bound
#define F first
#define S second
#define PI pair<int, int>
#define PL pair<ll, ll>
#define VI vector<int>
#define VL vector<ll>
void test_case(void) {}
int main() {
FAST
#ifndef ONLINE_JUDGE
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
ll n,
k, la, lb;
cin >> n >> k;
ll height[n + 5], dp[n + 5];
for (la = 1; la <= n; la++)
cin >> height[la];
dp[0] = dp[1] = 0;
for (la = 2; la <= n; la++) {
dp[la] = INT_MAX;
for (lb = la - 1; lb >= max(0LL, la - k); lb--)
dp[la] = min(dp[la], dp[lb] + abs(height[la] - height[lb]));
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define MOD 1000000007
#define sz5 100005
#define sz6 1000005
#define UP upper_bound
#define LB lower_bound
#define F first
#define S second
#define PI pair<int, int>
#define PL pair<ll, ll>
#define VI vector<int>
#define VL vector<ll>
void test_case(void) {}
int main() {
FAST
#ifndef ONLINE_JUDGE
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
ll n,
k, la, lb;
cin >> n >> k;
ll height[n + 5], dp[n + 5];
for (la = 1; la <= n; la++)
cin >> height[la];
dp[0] = dp[1] = 0;
for (la = 2; la <= n; la++) {
dp[la] = INT_MAX;
for (lb = la - 1; lb >= max(1LL, la - k); lb--)
dp[la] = min(dp[la], dp[lb] + abs(height[la] - height[lb]));
}
cout << dp[n] << endl;
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,283 | 957,285 | u718624899 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100001];
int n;
ll dp[100001];
ll cal(int i) {
if (i > n)
return 0;
if (dp[i] != -1)
return dp[i];
ll ans;
if (i + 1 <= n)
ans = (cal(i + 1) + abs(a[i] - a[i + 1]));
if (i + 2 <= n)
ans = min(ans, cal(i + 2) + abs(a[i] - a[i + 2]));
dp[i] = ans;
return ans;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
ll ans = cal(1);
cout << ans + 1;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[100001];
int n;
ll dp[100001];
ll cal(int i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
ll ans;
if (i + 1 <= n)
ans = (cal(i + 1) + abs(a[i] - a[i + 1]));
if (i + 2 <= n)
ans = min(ans, cal(i + 2) + abs(a[i] - a[i + 2]));
dp[i] = ans;
return ans;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
ll ans = cal(1);
cout << ans;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 957,312 | 957,310 | u845300227 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int absdiff(int a, int b) { return (abs(a - b)); }
int main() {
int n, k;
cin >> n >> k;
vector<int> height;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
height.push_back(temp);
}
vector<int> cost(n, 0);
cost[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
int min_val = 1e9;
for (int j = 1; j <= k and i - j > 0; j++) {
int temp = cost[i - j] + absdiff(height[i - j], height[i]);
min_val = min(min_val, temp);
}
cost[i] = min_val;
}
cout << cost[n - 1];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int absdiff(int a, int b) { return (abs(a - b)); }
int main() {
int n, k;
cin >> n >> k;
vector<int> height;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
height.push_back(temp);
}
vector<int> cost(n, 0);
cost[1] = abs(height[1] - height[0]);
for (int i = 2; i < n; i++) {
int min_val = 1e9;
for (int j = 1; j <= k and i - j >= 0; j++) {
int temp = cost[i - j] + absdiff(height[i - j], height[i]);
min_val = min(min_val, temp);
}
cost[i] = min_val;
}
cout << cost[n - 1];
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,488 | 957,489 | u664656294 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define MOD 1000000007
#define sz5 100005
#define sz6 1000005
#define UP upper_bound
#define LB lower_bound
#define F first
#define S second
#define PI pair<int, int>
#define PL pair<ll, ll>
#define VI vector<int>
#define VL vector<ll>
void test_case(void) {}
int main() {
FAST
#ifndef ONLINE_JUDGE
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
int n,
k, la, lb;
cin >> n >> k;
int height[n + 5], dp[n + 5];
for (la = 1; la <= n; la++)
cin >> height[la];
dp[0] = dp[1] = 0;
for (la = 2; la <= n; la++) {
dp[la] = INT_MAX;
for (lb = la - 1; lb >= max(0, la - k); lb--)
dp[la] = min(dp[la], dp[lb] + abs(height[la] - height[lb]));
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define pb push_back
#define MOD 1000000007
#define sz5 100005
#define sz6 1000005
#define UP upper_bound
#define LB lower_bound
#define F first
#define S second
#define PI pair<int, int>
#define PL pair<ll, ll>
#define VI vector<int>
#define VL vector<ll>
void test_case(void) {}
int main() {
FAST
#ifndef ONLINE_JUDGE
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
#endif
ll n,
k, la, lb;
cin >> n >> k;
ll height[n + 5], dp[n + 5];
for (la = 1; la <= n; la++)
cin >> height[la];
dp[0] = dp[1] = 0;
for (la = 2; la <= n; la++) {
dp[la] = INT_MAX;
for (lb = la - 1; lb >= max(1LL, la - k); lb--)
dp[la] = min(dp[la], dp[lb] + abs(height[la] - height[lb]));
}
cout << dp[n] << endl;
return 0;
} | [
"variable_declaration.type.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.type.widen.change"
] | 957,287 | 957,285 | u718624899 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 100000007);
dp[0] = 0;
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 >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 100000007);
dp[0] = 0;
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] - h[i - j]));
}
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,289 | 957,291 | u150155436 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ll dp[100000];
void solve() {
int n, k;
cin >> n >> k;
vector<int> vi;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
vi.push_back(a);
}
dp[0] = 0;
dp[1] = vi[1] - vi[0];
for (int i = 2; i < k; i++) {
vector<int> v;
for (int j = 1; j <= i; j++) {
int a = dp[i - j] + abs(vi[i] - vi[i - j]);
v.push_back(a);
}
dp[i] = *min_element(v.begin(), v.end());
}
// for(int i=0;i<k;i++) cout<<dp[i]<<" ";
for (int i = k; i < n; i++) {
vector<int> v;
for (int j = 1; j <= k; j++) {
int a = dp[i - j] + abs(vi[i] - vi[i - j]);
v.push_back(a);
}
dp[i] = *min_element(v.begin(), v.end());
}
cout << dp[n - 1] << " ";
}
int main() {
fast;
int m = 1;
// cin>>m;
while (m--) {
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ll dp[100000];
void solve() {
int n, k;
cin >> n >> k;
vector<int> vi;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
vi.push_back(a);
}
dp[0] = 0;
dp[1] = abs(vi[1] - vi[0]);
for (int i = 2; i < k; i++) {
vector<int> v;
for (int j = 1; j <= i; j++) {
int a = dp[i - j] + abs(vi[i] - vi[i - j]);
v.push_back(a);
}
dp[i] = *min_element(v.begin(), v.end());
}
// for(int i=0;i<k;i++) cout<<dp[i]<<" ";
for (int i = k; i < n; i++) {
vector<int> v;
for (int j = 1; j <= k; j++) {
int a = dp[i - j] + abs(vi[i] - vi[i - j]);
v.push_back(a);
}
dp[i] = *min_element(v.begin(), v.end());
}
cout << dp[n - 1] << " ";
}
int main() {
fast;
int m = 1;
// cin>>m;
while (m--) {
solve();
}
} | [
"call.add",
"call.arguments.change"
] | 957,293 | 957,295 | u812603485 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define c(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ffor(n) for (int i = 0; i < n; i++)
typedef vector<int> vi;
typedef vector<float> vf;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<long long> vll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef unordered_map<string, int> umsi;
int32_t main() {
fast_io;
int n, k;
cin >> n >> k;
vi a(n);
c(a, n);
vi dp(n, INT_MAX);
dp[0] = 0;
if (n == 1) {
cout << 0 << lc;
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - k] + abs(a[i] - a[i - j]));
}
cout << dp[n - 1] << lc;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define c(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ffor(n) for (int i = 0; i < n; i++)
typedef vector<int> vi;
typedef vector<float> vf;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<long long> vll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef unordered_map<string, int> umsi;
int32_t main() {
fast_io;
int n, k;
cin >> n >> k;
vi a(n);
c(a, n);
vi dp(n, INT_MAX);
dp[0] = 0;
if (n == 1) {
cout << 0 << lc;
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
cout << dp[n - 1] << lc;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,297 | 957,299 | u900229905 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
int main() {
intl n, k;
cin >> n >> k;
intl a[n + 1];
for (intl i = 0; i < n; i++) {
cin >> a[i];
}
intl dp[n + 1];
dp[0] = 0;
for (intl i = 1; i < n; i++) {
int t = 1;
int m = INT_MAX;
int x = 0;
while (i <= k) {
if (i - t >= 0) {
x = abs(a[i - t] - a[i]) + dp[i - t];
m = min(x, m);
} else {
break;
}
t++;
}
dp[i] = m;
}
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define intl long long
int main() {
intl n, k;
cin >> n >> k;
intl a[n + 1];
for (intl i = 0; i < n; i++) {
cin >> a[i];
}
intl dp[n + 1];
dp[0] = 0;
for (intl i = 1; i < n; i++) {
int t = 1;
int m = INT_MAX;
int x = 0;
while (t <= k) {
if (i - t >= 0) {
x = abs(a[i - t] - a[i]) + dp[i - t];
m = min(x, m);
} else {
break;
}
t++;
}
dp[i] = m;
}
cout << dp[n - 1];
}
| [
"identifier.change",
"control_flow.loop.condition.change"
] | 957,301 | 957,303 | u025753638 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
// DEFINE
#define flash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define double long double
#define endl "\n"
#define ff first
#define ss second
#define gcd(a, b) __gcd(a, b)
#define mem(ar) memset(ar, 0, sizeof ar)
#define ctone(x) __builtin_popcount(x)
#define fr(i, a, b) for (int i = a; i < b; i++)
#define shuf(v) shuffle(v.begin(), v.end(), RNG);
#define time \
cerr << "\nTime elapsed: " << clock() / (double)CLOCKS_PER_SEC << "s\n";
template <typename x, typename y> x max(x a, y b) { return (a > b) ? a : b; }
template <typename x, typename y> x min(x a, y b) { return (a < b) ? a : b; }
int32_t main() {
flash;
int n, k;
cin >> n >> k;
int h[n];
fr(i, 0, n) cin >> h[i];
vector<int> dp(n, 1e5);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= max(0, i - k); j--)
dp[i] = min(dp[j] + abs(h[i] - h[j]), dp[i]);
// dbg(dp[i]);
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// DEFINE
#define flash \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define double long double
#define endl "\n"
#define ff first
#define ss second
#define gcd(a, b) __gcd(a, b)
#define mem(ar) memset(ar, 0, sizeof ar)
#define ctone(x) __builtin_popcount(x)
#define fr(i, a, b) for (int i = a; i < b; i++)
#define shuf(v) shuffle(v.begin(), v.end(), RNG);
#define time \
cerr << "\nTime elapsed: " << clock() / (double)CLOCKS_PER_SEC << "s\n";
template <typename x, typename y> x max(x a, y b) { return (a > b) ? a : b; }
template <typename x, typename y> x min(x a, y b) { return (a < b) ? a : b; }
int32_t main() {
flash;
int n, k;
cin >> n >> k;
int h[n];
fr(i, 0, n) cin >> h[i];
vector<int> dp(n, 1e9);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= max(0, i - k); j--)
dp[i] = min(dp[j] + abs(h[i] - h[j]), dp[i]);
// dbg(dp[i]);
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 957,317 | 957,318 | u032450626 | cpp |
p03161 | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad !
___man be to dami gharar natvanam kard
___va ehsane to ra shomar natvanam kard
####################
___gar bar tane man zaban shavad har moyee
___yek shokre to az hezar natvanam kard
*/
#include <bits/stdc++.h>
#define pb push_back
#define SALI main
#define left(x) ((x)*2)
#define right(x) (((x)*2) + 1)
#define fuck(x) cout << #x << " : " << x << endl;
#define findLowVec(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define findUpVec(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define findLowArr(a, n, x) (lower_bound(a, a + n, x) - a)
#define findUpArr(a, n, x) (upper_bound(a, a + n, x) - a)
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &v) {
out << "[";
for (int i = 0; i < v.size(); i++) {
if (i)
out << ", ";
out << v[i];
}
return out << "]";
}
template <class A, class B>
ostream &operator<<(ostream &out, const set<A, B> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
template <class A> ostream &operator<<(ostream &out, const set<A> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
const int inf = 1e9 + 7;
int32_t SALI() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, inf);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
}
/**< WRITEN BY ALI ADELKHAH */
| /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad !
___man be to dami gharar natvanam kard
___va ehsane to ra shomar natvanam kard
####################
___gar bar tane man zaban shavad har moyee
___yek shokre to az hezar natvanam kard
*/
#include <bits/stdc++.h>
#define pb push_back
#define SALI main
#define left(x) ((x)*2)
#define right(x) (((x)*2) + 1)
#define fuck(x) cout << #x << " : " << x << endl;
#define findLowVec(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define findUpVec(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
#define findLowArr(a, n, x) (lower_bound(a, a + n, x) - a)
#define findUpArr(a, n, x) (upper_bound(a, a + n, x) - a)
#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class A> ostream &operator<<(ostream &out, const vector<A> &v) {
out << "[";
for (int i = 0; i < v.size(); i++) {
if (i)
out << ", ";
out << v[i];
}
return out << "]";
}
template <class A, class B>
ostream &operator<<(ostream &out, const set<A, B> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
template <class A> ostream &operator<<(ostream &out, const set<A> &s) {
out << "[";
for (auto i = s.begin(); i != s.end(); i++) {
out << ", ";
out << *i;
}
return out << "]";
}
const int inf = 1e9 + 7;
int32_t SALI() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, inf);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
}
/**< WRITEN BY ALI ADELKHAH */
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 957,320 | 957,321 | u232873057 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k; j++) {
if (i - j == 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
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.branch.if.condition.change"
] | 957,324 | 957,326 | u332946309 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int solve(int N, vector<int> &heights, vector<int> &dp, int K) {
if (N <= 1 or K == 0)
return 0;
if (N == 2 and K >= 1)
return dp[N] = abs(heights[0] - heights[1]);
if (dp[N] != -1)
return dp[N];
int ans = INT_MAX;
for (int i = 2; i <= K; i++) {
if (N - i < 0)
break;
ans = min(ans, solve(N - i, heights, dp, K) +
abs(heights[N - 1] - heights[N - i]));
}
return dp[N] = ans;
}
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int N, K;
cin >> N >> K;
vector<int> heights(N);
vector<int> dp(N + 1, -1);
for (int i = 0; i < N; i++) {
cin >> heights[i];
}
if (N == 1)
cout << heights[0];
else
cout << solve(N, heights, dp, K) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int solve(int N, vector<int> &heights, vector<int> &dp, int K) {
if (N <= 1 or K == 0)
return 0;
if (N == 2 and K >= 1)
return dp[N] = abs(heights[0] - heights[1]);
if (dp[N] != -1)
return dp[N];
int ans = INT_MAX;
for (int i = 1; i <= K; i++) {
if (N - i - 1 < 0)
break;
ans = min(ans, solve(N - i, heights, dp, K) +
abs(heights[N - 1] - heights[N - i - 1]));
}
return dp[N] = ans;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
vector<int> dp(N + 1, -1);
for (int i = 0; i < N; i++) {
cin >> heights[i];
}
if (N == 1)
cout << heights[0];
else
cout << solve(N, heights, dp, K) << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 957,333 | 957,335 | u828200886 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[10000005];
ll h[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
dp[i] = 1e5;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = max(i - k, 0); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[10000005];
ll h[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
dp[i] = 1e13;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = max(i - k, 0); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"assignment.value.change"
] | 957,341 | 957,339 | u077051605 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
int val = INT_MAX;
for (int j = i - 1; j >= 0 && i - j <= k; j--) {
val = min(val, abs(arr[i] - arr[j]));
}
if (val == INT_MAX)
val = 0;
dp[i] = val;
}
cout << dp[n - 1];
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {0};
for (int i = 0; i < n; i++) {
int val = INT_MAX;
for (int j = i - 1; j >= 0 && i - j <= k; j--) {
val = min(val, dp[j] + abs(arr[i] - arr[j]));
}
if (val == INT_MAX)
val = 0;
dp[i] = val;
}
cout << dp[n - 1];
return 0;
}
| [
"assignment.change"
] | 957,349 | 957,351 | u707252821 | cpp |
p03161 | #include <bits/stdc++.h>
#define N 100005
#define M 10000000000
#define endl "\n"
using namespace std;
int m, k;
int h[N];
long long MAX = 0;
int dp[N];
int minCost(int n) {
if (n == 0)
return 0;
if (dp[n] != -1)
return dp[n];
int option = MAX + 1;
for (int i = n - 1; i >= max(0, n - k); --i) {
option = min(option, abs(h[n] - h[i]) + minCost(i));
// cout << i << " " << abs(h[n] - h[i]) << endl;
}
return dp[n] = option;
}
int32_t main() {
cin >> m >> k;
for (int i = 0; i < m; ++i) {
cin >> h[i];
MAX += h[i];
}
memset(dp, -1, sizeof(dp));
cout << minCost(m - 1) << endl;
} | #include <bits/stdc++.h>
#define N 100005
#define M 10000000000
#define endl "\n"
using namespace std;
int m, k;
int h[N];
long long MAX = 0;
int dp[N];
int minCost(int n) {
if (n == 0)
return 0;
if (dp[n] != -1)
return dp[n];
int option = 1000000001;
for (int i = n - 1; i >= max(0, n - k); --i) {
option = min(option, abs(h[n] - h[i]) + minCost(i));
// cout << i << " " << abs(h[n] - h[i]) << endl;
}
return dp[n] = option;
}
int32_t main() {
cin >> m >> k;
for (int i = 0; i < m; ++i) {
cin >> h[i];
MAX += h[i];
}
memset(dp, -1, sizeof(dp));
cout << minCost(m - 1) << endl;
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 957,361 | 957,363 | u377265926 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define mod 1000000007
#define inf 1e18
ll mod(ll x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll h[n] = {0};
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll dp[n] = {0};
dp[0] = 0;
for (ll i = 2; i < n; i++) {
dp[i] = inf;
}
dp[1] = mod(h[1] - h[0]);
for (ll i = 2; i < n; i++) {
for (ll j = i - k; j < i; j++) {
if (j > 0)
dp[i] = min(dp[j] + mod(h[i] - h[j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define mod 1000000007
#define inf 1e18
ll mod(ll x) {
if (x < 0)
return -x;
else
return x;
}
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll h[n] = {0};
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll dp[n] = {0};
dp[0] = 0;
for (ll i = 2; i < n; i++) {
dp[i] = inf;
}
dp[1] = mod(h[1] - h[0]);
for (ll i = 2; i < n; i++) {
for (ll j = i - k; j < i; j++) {
if (j >= 0)
dp[i] = min(dp[j] + mod(h[i] - h[j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,365 | 957,367 | u012310435 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define inf 1001001
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = inf;
}
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k && i - j >= 0; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define inf 10010011111
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = inf;
}
dp[0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= k && i - j >= 0; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 957,386 | 957,383 | u321492259 | cpp |
p03160 | // @author - Puneet
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vll vector<ll>
#define vvll vector<vll>
#define vld vector<ld>
#define vvld vector<vld>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define endl "\n"
#define flash \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define test \
ll t; \
read(t); \
while (t--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fst first
#define scd second
#define forn(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define for1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define forr(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define forab(i, a, b, c) for (ll(i) = a; (i) <= (b); (i) += (c))
using namespace std;
////////////////////////////////////////////////////////////////// Inputs
///////////////////////////////////////////////////////////////////////////////////////
template <typename T> void read(T &x) { cin >> x; }
template <typename T, typename T0> void read(T &x, T0 &y) { cin >> x >> y; }
template <typename T, typename T0, typename T1> void read(T &x, T0 &y, T1 &z) {
cin >> x >> y >> z;
}
template <typename T, typename T0, typename T1, typename T2>
void read(T &x, T0 &y, T1 &z, T2 &w) {
cin >> x >> y >> z >> w;
}
template <typename T, typename T0> void read(pair<T, T0> &p) {
cin >> p.fst >> p.scd;
}
template <typename T> void read(vector<T> &oneD) {
for (ll i = 0; i < oneD.size(); i++) {
read(oneD[i]);
}
}
template <typename T> void read(T oneD[], int n) {
for (ll i = 0; i < n; i++) {
read(oneD[i]);
}
}
///////////////////////////////////////////////////////////////////////////
///Outputs
///////////////////////////////////////////////////////////////////////////////
template <typename T> void write(T &x) { cout << x << " "; }
template <typename T, typename T0> void write(T &x, T0 &y) {
cout << x << " " << y << "\n";
}
template <typename T, typename T0, typename T1> void write(T &x, T0 &y, T1 &z) {
cout << x << " " << y << " " << z << "\n";
}
template <typename T, typename T0, typename T1, typename T2>
void write(T &x, T0 &y, T1 &z, T2 &w) {
cout << x << " " << y << " " << z << " " << w << "\n";
}
template <typename T, typename T0> void write(pair<T, T0> &p) {
write(p.fst);
write(p.scd);
cout << endl;
}
template <typename T> void write(vector<T> &oneD) {
for (ll i = 0; i < oneD.size(); i++) {
write(oneD[i]);
}
cout << endl;
}
template <typename T> void write(T oneD[], int n) {
for (ll i = 0; i < n; i++) {
write(oneD[i]);
}
cout << endl;
}
template <typename T, typename T0> void write(map<T, T0> &mpp) {
for (auto it : mpp) {
write(it.fst);
cout << ": ";
write(it.scd);
cout << "\n";
}
cout << endl;
}
///////////////////////////////////////////////////////////////////////// Maths
/////////////////////////////////////////////////////////////////////////////////
vll seive;
void Seive() {
const ll maxn = 1000005;
seive.resize(maxn);
forn(i, maxn) seive[i] = i;
seive[1] = -1;
seive[0] = -1;
forab(i, 2, maxn, 1) if (i == seive[i]) for (ll j = 2 * i; j < maxn;
j += i) if (seive[j] == j)
seive[j] = i;
}
ll extended_GCD(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll gcd = extended_GCD(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return gcd;
}
ll power(ll a, ll b, ll m = MOD) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modinv(ll a, ll mod = MOD) {
ll x, y;
extended_GCD(a, mod, x, y);
if (x < 0)
x += mod;
return x;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
flash
ll n;
cin >> n;
vll A(n), dp(n, 0);
read(A);
forr(i, n - 1) {
if (i == (n - 1))
dp[i] = dp[i + 1] + abs(A[i] - A[i + 1]);
else
dp[i] = min(dp[i + 1] + abs(A[i] - A[i + 1]),
dp[i + 2] + abs(A[i] - A[i + 2]));
}
cout << dp[0] << endl;
return 0;
}
| // @author - Puneet
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vll vector<ll>
#define vvll vector<vll>
#define vld vector<ld>
#define vvld vector<vld>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define endl "\n"
#define flash \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define test \
ll t; \
read(t); \
while (t--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fst first
#define scd second
#define forn(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define for1(i, n) for (ll(i) = 1; (i) <= (n); ++(i))
#define forr(i, n) for (ll(i) = (n)-1; (i) >= 0; --(i))
#define forab(i, a, b, c) for (ll(i) = a; (i) <= (b); (i) += (c))
using namespace std;
////////////////////////////////////////////////////////////////// Inputs
///////////////////////////////////////////////////////////////////////////////////////
template <typename T> void read(T &x) { cin >> x; }
template <typename T, typename T0> void read(T &x, T0 &y) { cin >> x >> y; }
template <typename T, typename T0, typename T1> void read(T &x, T0 &y, T1 &z) {
cin >> x >> y >> z;
}
template <typename T, typename T0, typename T1, typename T2>
void read(T &x, T0 &y, T1 &z, T2 &w) {
cin >> x >> y >> z >> w;
}
template <typename T, typename T0> void read(pair<T, T0> &p) {
cin >> p.fst >> p.scd;
}
template <typename T> void read(vector<T> &oneD) {
for (ll i = 0; i < oneD.size(); i++) {
read(oneD[i]);
}
}
template <typename T> void read(T oneD[], int n) {
for (ll i = 0; i < n; i++) {
read(oneD[i]);
}
}
///////////////////////////////////////////////////////////////////////////
///Outputs
///////////////////////////////////////////////////////////////////////////////
template <typename T> void write(T &x) { cout << x << " "; }
template <typename T, typename T0> void write(T &x, T0 &y) {
cout << x << " " << y << "\n";
}
template <typename T, typename T0, typename T1> void write(T &x, T0 &y, T1 &z) {
cout << x << " " << y << " " << z << "\n";
}
template <typename T, typename T0, typename T1, typename T2>
void write(T &x, T0 &y, T1 &z, T2 &w) {
cout << x << " " << y << " " << z << " " << w << "\n";
}
template <typename T, typename T0> void write(pair<T, T0> &p) {
write(p.fst);
write(p.scd);
cout << endl;
}
template <typename T> void write(vector<T> &oneD) {
for (ll i = 0; i < oneD.size(); i++) {
write(oneD[i]);
}
cout << endl;
}
template <typename T> void write(T oneD[], int n) {
for (ll i = 0; i < n; i++) {
write(oneD[i]);
}
cout << endl;
}
template <typename T, typename T0> void write(map<T, T0> &mpp) {
for (auto it : mpp) {
write(it.fst);
cout << ": ";
write(it.scd);
cout << "\n";
}
cout << endl;
}
///////////////////////////////////////////////////////////////////////// Maths
/////////////////////////////////////////////////////////////////////////////////
vll seive;
void Seive() {
const ll maxn = 1000005;
seive.resize(maxn);
forn(i, maxn) seive[i] = i;
seive[1] = -1;
seive[0] = -1;
forab(i, 2, maxn, 1) if (i == seive[i]) for (ll j = 2 * i; j < maxn;
j += i) if (seive[j] == j)
seive[j] = i;
}
ll extended_GCD(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll gcd = extended_GCD(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return gcd;
}
ll power(ll a, ll b, ll m = MOD) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modinv(ll a, ll mod = MOD) {
ll x, y;
extended_GCD(a, mod, x, y);
if (x < 0)
x += mod;
return x;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
flash
ll n;
cin >> n;
vll A(n), dp(n, 0);
read(A);
forr(i, n - 1) {
if (i == (n - 2))
dp[i] = dp[i + 1] + abs(A[i] - A[i + 1]);
else
dp[i] = min(dp[i + 1] + abs(A[i] - A[i + 1]),
dp[i + 2] + abs(A[i] - A[i + 2]));
}
cout << dp[0] << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,314 | 957,319 | u645183672 | cpp |
p03161 | // organize and stay in moment
// Abhinav - IIITA
// I love you Disha
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
int prime[100005], arr[100005], pre[100005];
void seive() {
prime[0] = prime[1] = 1;
for (int i = 2; i < 100005; ++i) {
if (prime[i] == 0)
for (int j = 2 * i; j < 100005; j += i)
prime[j] = 1;
}
}
int32_t main() {
int n;
cin >> n;
int k;
cin >> k;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
int cost[n];
for (int i = 0; i < n; ++i)
cost[i] = LLONG_MAX;
cost[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = i - 1; j >= 0 && i - j >= k; --j) {
cost[i] = min(cost[i], cost[j] + abs(arr[i] - arr[j]));
}
}
cout << cost[n - 1];
return 0;
} | // organize and stay in moment
// Abhinav - IIITA
// I love you Disha
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
int prime[100005], arr[100005], pre[100005];
void seive() {
prime[0] = prime[1] = 1;
for (int i = 2; i < 100005; ++i) {
if (prime[i] == 0)
for (int j = 2 * i; j < 100005; j += i)
prime[j] = 1;
}
}
int32_t main() {
int n;
cin >> n;
int k;
cin >> k;
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
int cost[n];
for (int i = 0; i < n; ++i)
cost[i] = LLONG_MAX;
cost[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = i - 1; j >= 0 && i - j <= k; --j) {
cost[i] = min(cost[i], cost[j] + abs(arr[i] - arr[j]));
}
}
cout << cost[n - 1];
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 957,490 | 957,491 | u587202199 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
ll int gcd(ll int a, ll int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
std::vector<int> v(n);
int dp[n];
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
int val = INT_MAX;
int j = 1;
while (j <= k && i - j < n) {
val = min(dp[i - j] + abs(v[i] - v[i - j]), val);
// cout<<"hi "<<val<<"\n";
j++;
}
dp[i] = val;
// cout<<i<<" "<<dp[i]<<"--"<<dp[i-1]<<"--"<<dp[i-2]<<"\n";
}
cout << dp[n - 1] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
ll int gcd(ll int a, ll int b) { return b ? gcd(b, a % b) : a; }
int main() {
int n, k;
cin >> n >> k;
std::vector<int> v(n);
int dp[n];
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
int val = INT_MAX;
int j = 1;
while (j <= k && i - j >= 0) {
val = min(dp[i - j] + abs(v[i] - v[i - j]), val);
// cout<<"hi "<<val<<"\n";
j++;
}
dp[i] = val;
// cout<<i<<" "<<dp[i]<<"--"<<dp[i-1]<<"--"<<dp[i-2]<<"\n";
}
cout << dp[n - 1] << "\n";
}
| [
"control_flow.loop.for.condition.change"
] | 957,388 | 957,389 | u127202585 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int DN = 1e5 + 5;
int n, a[DN], dp[DN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 3)
dp[i] = min(dp[i], dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
const int DN = 1e5 + 5;
int n, a[DN], dp[DN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2)
dp[i] = min(dp[i], dp[i - 2] + abs(a[i] - a[i - 2]));
}
cout << dp[n];
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,322 | 957,323 | u186612405 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, first, last) for (int i = (first); i < (last); ++i)
#define REP(i, n) FOR(i, 0, n)
#define CLR(a) memset((a), 0, sizeof(a))
#define DUMP(x) std::cerr << #x << " = " << (x) << std::endl;
#define DUMPR(v) \
REP(_i, v.size()) { \
std::cerr << #v << "[" << _i << "] = " << (v[_i]) << std::endl; \
}
#define CIN_VEC(v, N) \
{ \
v.clear(); \
v.reserve(N); \
REP(i, N) { \
typename decltype(v)::value_type x; \
cin >> x; \
v.emplace_back(x); \
} \
};
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_string(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef unsigned long long ull;
typedef unsigned long ul;
static const int NMAX = 100000;
int h[NMAX];
int N;
int dp[NMAX];
const static int INF = 1 << 20;
int main() {
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N) dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
FOR(i, 2, N) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// REP(i,N) DUMP(dp[i]);
cout << dp[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, first, last) for (int i = (first); i < (last); ++i)
#define REP(i, n) FOR(i, 0, n)
#define CLR(a) memset((a), 0, sizeof(a))
#define DUMP(x) std::cerr << #x << " = " << (x) << std::endl;
#define DUMPR(v) \
REP(_i, v.size()) { \
std::cerr << #v << "[" << _i << "] = " << (v[_i]) << std::endl; \
}
#define CIN_VEC(v, N) \
{ \
v.clear(); \
v.reserve(N); \
REP(i, N) { \
typename decltype(v)::value_type x; \
cin >> x; \
v.emplace_back(x); \
} \
};
inline int to_int(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string to_string(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef unsigned long long ull;
typedef unsigned long ul;
static const int NMAX = 100000;
int h[NMAX];
int N;
int dp[NMAX];
const static int INF = 1e9;
int main() {
cin >> N;
REP(i, N) cin >> h[i];
REP(i, N) dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
FOR(i, 2, N) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
// REP(i,N) DUMP(dp[i]);
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 957,325 | 957,329 | u185034753 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
ll gcd(ll ina, ll inb) {
if (ina == 0)
return inb;
if (inb == 0)
return ina;
if (ina == inb)
return ina;
if (ina > inb)
return gcd(ina - inb, inb);
return gcd(ina, inb - ina);
}
ll lcm(ll in1, ll in2) {
ll ans = 1;
ans = (in1 * in2) / gcd(in1, in2);
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
f(i, 0, n) { cin >> a[i]; }
ll dp[n] = {};
f(i1, 0, n) { dp[i1] = 1000000000; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if ((k + 1) >= 2) {
f(j, 2, k + 1) {
f(k1, 0, j) { dp[j] = min(dp[k1] + abs(a[j] - a[k1]), dp[j]); }
}
}
f(i2, k + 1, n) {
f(i3, i2 - k, i2) { dp[i2] = min(dp[i2], dp[i3] + abs(a[i3] - a[i2])); }
}
cout << dp[n - 1] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
ll gcd(ll ina, ll inb) {
if (ina == 0)
return inb;
if (inb == 0)
return ina;
if (ina == inb)
return ina;
if (ina > inb)
return gcd(ina - inb, inb);
return gcd(ina, inb - ina);
}
ll lcm(ll in1, ll in2) {
ll ans = 1;
ans = (in1 * in2) / gcd(in1, in2);
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
f(i, 0, n) { cin >> a[i]; }
ll dp[n] = {};
f(i1, 0, n) { dp[i1] = 1000000000; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if ((k + 1) >= 2) {
f(j, 2, min(k + 1, n)) {
f(k1, 0, j) { dp[j] = min(dp[k1] + abs(a[j] - a[k1]), dp[j]); }
}
}
f(i2, k + 1, n) {
f(i3, i2 - k, i2) { dp[i2] = min(dp[i2], dp[i3] + abs(a[i3] - a[i2])); }
}
cout << dp[n - 1] << "\n";
}
| [
"call.add",
"call.arguments.add"
] | 957,391 | 957,393 | u281567669 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> dp(n, 999);
for (int i = 0; i < n; i++) {
int ele;
cin >> ele;
v[i] = ele;
}
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++) {
int ele;
cin >> ele;
v[i] = ele;
}
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1] << endl;
}
| [
"literal.number.change",
"call.arguments.change"
] | 957,332 | 957,334 | u745631549 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vl vector<long long>;
//#define rep(i,a,b) for(int i=a;i<b;++i)
// typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e5 + 5;
int A[N];
#define INF 10000
int dp[N] = {0};
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
/*void show(vi v,int valeur){
int count=0;
rep(i,0,(int)v.size()){
++count;
cout<<v[i]<<" " ;
if(count==valeur){cout<<"\n";count=0;}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
// ll ans=0;
cin >> n >> k;
rep(i, 0, n) { cin >> A[i]; }
dp[1] = abs(A[1] - A[0]);
dp[0] = 0;
rep(i, 2, n) {
dp[i] = 10000;
for (int j = 1; j <= k; ++j) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
// cout<<dp[i]<<"\n";
}
cout << dp[n - 1];
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vl vector<long long>;
//#define rep(i,a,b) for(int i=a;i<b;++i)
// typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e5 + 5;
int A[N];
#define INF 10000
int dp[N] = {0};
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
/*void show(vi v,int valeur){
int count=0;
rep(i,0,(int)v.size()){
++count;
cout<<v[i]<<" " ;
if(count==valeur){cout<<"\n";count=0;}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
// ll ans=0;
cin >> n >> k;
rep(i, 0, n) { cin >> A[i]; }
dp[1] = abs(A[1] - A[0]);
dp[0] = 0;
rep(i, 2, n) {
dp[i] = 1000000000;
for (int j = 1; j <= k; ++j) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
// cout<<dp[i]<<"\n";
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 957,395 | 957,397 | u751311751 | cpp |
p03161 | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 1000000007
#define pll pair<long long, long long>
using namespace std;
long long power(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
bool prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int dp[100005];
int fun(int n, int a[], int k) {
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = i - 2; j >= max(0ll, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
}
return dp[n - 1];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
cout << fun(n, a, k);
return 0;
} | #include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
#define pb push_back
#define mod 1000000007
#define pll pair<long long, long long>
using namespace std;
long long power(long long a, long long b) {
long long ans = 1;
while (b > 0) {
if (b & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
bool prime(int n) {
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int dp[100005];
int fun(int n, int a[], int k) {
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = i - 1; j >= max(0ll, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
}
return dp[n - 1];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
cout << fun(n, a, k);
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,495 | 957,496 | u828869971 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vl vector<long long>;
//#define rep(i,a,b) for(int i=a;i<b;++i)
// typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e5 + 5;
int A[N];
#define INF 10000
int dp[N] = {0};
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
/*void show(vi v,int valeur){
int count=0;
rep(i,0,(int)v.size()){
++count;
cout<<v[i]<<" " ;
if(count==valeur){cout<<"\n";count=0;}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
// ll ans=0;
cin >> n >> k;
rep(i, 0, n) { cin >> A[i]; }
dp[1] = abs(A[1] - A[0]);
dp[0] = 0;
rep(i, 2, n) {
dp[i] = 1000;
for (int j = 1; j <= k; ++j) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
// cout<<dp[i]<<"\n";
}
cout << dp[n - 1];
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vl vector<long long>;
//#define rep(i,a,b) for(int i=a;i<b;++i)
// typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e5 + 5;
int A[N];
#define INF 10000
int dp[N] = {0};
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
/*void show(vi v,int valeur){
int count=0;
rep(i,0,(int)v.size()){
++count;
cout<<v[i]<<" " ;
if(count==valeur){cout<<"\n";count=0;}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
// ll ans=0;
cin >> n >> k;
rep(i, 0, n) { cin >> A[i]; }
dp[1] = abs(A[1] - A[0]);
dp[0] = 0;
rep(i, 2, n) {
dp[i] = 1000000000;
for (int j = 1; j <= k; ++j) {
if ((i - j) >= 0)
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
// cout<<dp[i]<<"\n";
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 957,399 | 957,397 | u751311751 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) (((a) * (b)) / (__gcd((a), (b))))
#define in_range(x, y, r, c) (x < r && y < c && x >= 0 && y >= 0)
#define setbits(x) __builtin_popcountll(x)
#define unsetend(x) __builtin_ctzll(x)
#define unsetfront(x) __builtin_clzll(x)
#define f first
#define s second
#define pb push_back
#define pf push_front
#define ll long long
#define endl "\n"
#define Endl "\n"
// long long expo(long long a, long long b, long long mod)
// {
// ll ret = 1;
// while (b > 0)
// {
// if (b % 2 == 1)
// ret = (((ret)%mod) * ((a)%mod))%mod;
//
// a = ((a)%mod) * ((a)%mod)%mod;
// b = b / 2;
// }
// return (ret%mod);
// }
// vector<long long> seive()
// {
// long long i,j;
// vector<long long> hash(1000001,1);
// vector<long long> primes;
//
// for(i=2;i*i<=1000000;i++)
// {
// if(hash[i])
// {
// for(j=i*i;j<=1000000;j+=i)
// hash[j]=0;
// }
// }
// for(i=2;i<1000001;i++)
// {
// if(hash[i])
// primes.pb(i);
// }
// return primes;
// }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k, j, i;
cin >> n >> k;
ll h[n + 1];
for (i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (i = 2; i <= n; i++) {
for (j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
} else
break;
}
}
cout << dp[n];
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) (((a) * (b)) / (__gcd((a), (b))))
#define in_range(x, y, r, c) (x < r && y < c && x >= 0 && y >= 0)
#define setbits(x) __builtin_popcountll(x)
#define unsetend(x) __builtin_ctzll(x)
#define unsetfront(x) __builtin_clzll(x)
#define f first
#define s second
#define pb push_back
#define pf push_front
#define ll long long
#define endl "\n"
#define Endl "\n"
// long long expo(long long a, long long b, long long mod)
// {
// ll ret = 1;
// while (b > 0)
// {
// if (b % 2 == 1)
// ret = (((ret)%mod) * ((a)%mod))%mod;
//
// a = ((a)%mod) * ((a)%mod)%mod;
// b = b / 2;
// }
// return (ret%mod);
// }
// vector<long long> seive()
// {
// long long i,j;
// vector<long long> hash(1000001,1);
// vector<long long> primes;
//
// for(i=2;i*i<=1000000;i++)
// {
// if(hash[i])
// {
// for(j=i*i;j<=1000000;j+=i)
// hash[j]=0;
// }
// }
// for(i=2;i<1000001;i++)
// {
// if(hash[i])
// primes.pb(i);
// }
// return primes;
// }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k, j, i;
cin >> n >> k;
ll h[n + 1];
for (i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
for (i = 1; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (i = 2; i <= n; i++) {
for (j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
} else
break;
}
}
cout << dp[n];
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,401 | 957,403 | u597607006 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 1; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " << i << " " <<
// abs(arr[i]-arr[i-1])+min_jumps[i-1] << endl;
if (min_jumps[i] >= abs(arr[i] - arr[i - 1]) + min_jumps[i - 1])
min_jumps[i] = abs(arr[i] - arr[i - 1]) + min_jumps[i - 1];
if (min_jumps[i] >= abs(arr[i] - arr[i - 2]) + min_jumps[i - 2])
min_jumps[i] = abs(arr[i] - arr[i - 2]) + min_jumps[i - 2];
}
// for(int i =0; i<n;i++)
cout << min_jumps[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " << i << " " <<
// abs(arr[i]-arr[i-1])+min_jumps[i-1] << endl;
if (min_jumps[i] > abs(arr[i] - arr[i - 1]) + min_jumps[i - 1])
min_jumps[i] = abs(arr[i] - arr[i - 1]) + min_jumps[i - 1];
if (min_jumps[i] > abs(arr[i] - arr[i - 2]) + min_jumps[i - 2])
min_jumps[i] = abs(arr[i] - arr[i - 2]) + min_jumps[i - 2];
}
// for(int i =0; i<n;i++)
cout << min_jumps[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.branch.if.condition.change"
] | 957,346 | 957,348 | u010432749 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 1; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " << i << " " <<
// abs(arr[i]-arr[i-1])+min_jumps[i-1] << endl;
if (min_jumps[i] > abs(arr[i] - arr[i - 1]) + min_jumps[i - 1])
min_jumps[i] = abs(arr[i] - arr[i - 1]) + min_jumps[i - 1];
if (min_jumps[i] > abs(arr[i] - arr[i - 2]) + min_jumps[i - 2])
min_jumps[i] = abs(arr[i] - arr[i - 2]) + min_jumps[i - 2];
}
// for(int i =0; i<n;i++)
cout << min_jumps[n - 1] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
min_jumps[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
min_jumps[i] = INT_MAX;
// cout << min_jumps[i] << " " << i << " " <<
// abs(arr[i]-arr[i-1])+min_jumps[i-1] << endl;
if (min_jumps[i] > abs(arr[i] - arr[i - 1]) + min_jumps[i - 1])
min_jumps[i] = abs(arr[i] - arr[i - 1]) + min_jumps[i - 1];
if (min_jumps[i] > abs(arr[i] - arr[i - 2]) + min_jumps[i - 2])
min_jumps[i] = abs(arr[i] - arr[i - 2]) + min_jumps[i - 2];
}
// for(int i =0; i<n;i++)
cout << min_jumps[n - 1] << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 957,350 | 957,348 | u010432749 | cpp |
p03161 | //
// Created by Harshit on 20-08-2020.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> H(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> H[i + 1];
}
vector<int> res(n + 1, INT_MAX);
res[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j + i <= n, j <= k; j++) {
res[i + j] = min(res[i + j], res[i] + abs(H[i + j] - H[i]));
}
}
cout << res[n] << endl;
} | //
// Created by Harshit on 20-08-2020.
//
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> H(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> H[i + 1];
}
vector<int> res(n + 1, INT_MAX);
res[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; i + j <= n && j <= k; j++) {
res[i + j] = min(res[i + j], res[i] + abs(H[i + j] - H[i]));
}
}
cout << res[n] << endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.binary.change"
] | 957,407 | 957,409 | u241916882 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define forn(i, x, y) for (int i = x; i < y; ++i)
#define fornr(i, x, y) for (long long i = x; i >= y; --i)
#define testcase \
int _t; \
cin >> _t; \
while (_t--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 2e5;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, k;
cin >> n >> k;
k = 2;
int arr[n];
vector<int> dp(n, INT_MAX);
forn(i, 0, n) { cin >> arr[i]; }
dp[0] = 0;
forn(i, 1, n) {
forn(j, 1, k + 1) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
/*
*/
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define forn(i, x, y) for (int i = x; i < y; ++i)
#define fornr(i, x, y) for (long long i = x; i >= y; --i)
#define testcase \
int _t; \
cin >> _t; \
while (_t--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 2e5;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, k;
cin >> n >> k;
int arr[n];
vector<int> dp(n, INT_MAX);
forn(i, 0, n) { cin >> arr[i]; }
dp[0] = 0;
forn(i, 1, n) {
forn(j, 1, k + 1) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
/*
*/
| [] | 957,411 | 957,412 | u561062659 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
int arr[100001];
int dp[100001];
int solve(int cur) {
if (dp[cur] != -1)
return dp[cur];
if (cur == 1)
return dp[cur] = 0;
int mina = 1e9;
for (int x = 1; x <= k; x++) {
if (cur - k >= 1) {
int temp = abs(arr[cur] - arr[cur - x]) + solve(cur - x);
mina = min(mina, temp);
}
}
return dp[cur] = mina;
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
for (int x = 1; x <= n; x++)
cin >> arr[x];
cout << solve(n);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
int arr[100001];
int dp[100001];
int solve(int cur) {
if (dp[cur] != -1)
return dp[cur];
if (cur == 1)
return dp[cur] = 0;
int mina = 1e9;
for (int x = 1; x <= k; x++) {
if (cur - x >= 1) {
int temp = abs(arr[cur] - arr[cur - x]) + solve(cur - x);
mina = min(mina, temp);
}
}
return dp[cur] = mina;
}
int main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
for (int x = 1; x <= n; x++)
cin >> arr[x];
cout << solve(n);
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 957,504 | 957,505 | u974135483 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.