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 8
values |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long> h(n);
vector<long long> jump(n, 1e14);
for (int i = 0; i < n; ++i)
cin >> h[i];
jump[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<long long> h(n);
vector<long long> jump(n, 1e14);
for (int i = 0; i < n; ++i)
cin >> h[i];
jump[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,944 | 961,945 | u628380758 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 10000;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 10000000000... | [
"literal.number.change",
"assignment.value.change"
] | 961,949 | 961,950 | u067888645 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 10000;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n] = {0};
dp[0] = 0;
for (int i = 1; i < min(k, n); i++) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = k; i < n; i++) {
dp[i] = 10000000000... | [
"literal.number.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,951 | 961,950 | u067888645 | cpp |
p03161 | #include <cstdio>
int d[100000], dp[100000];
int dist(int x, int y) { return (x > y) ? (x - y) : (y - x); }
int min(int x, int y) { return (x > y) ? y : x; }
int max(int x, int y) { return (x > y) ? x : y; }
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &d[i]);
for (i... | #include <cstdio>
int d[100000], dp[100000];
int dist(int x, int y) { return (x > y) ? (x - y) : (y - x); }
int min(int x, int y) { return (x > y) ? y : x; }
int max(int x, int y) { return (x > y) ? x : y; }
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%d", &d[i]);
for (i... | [
"call.arguments.change"
] | 961,952 | 961,953 | u350561621 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mx... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mx... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,954 | 961,955 | u895045773 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mx... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define NL '\n'
#define mem(a, b) memset(a, b, sizeof(a))
#define rep(ii, aa, bb) for (ll(ii) = ll(aa); (ii) < (ll)(bb); ++(ii))
#define _fastIO() ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
const int mxx = 1e5 + 9;
int n, k, a[mxx], dp[mx... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,954 | 961,956 | u895045773 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[100005], num[100005];
int main() {
cin.tie(), cout.tie();
memset(dp, 23333, sizeof(dp));
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i - k; j <= i - 1; j+... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[100005], num[100005];
int main() {
cin.tie(), cout.tie();
memset(dp, 233333, sizeof(dp));
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> num[i];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = max(1, i - k); j <= ... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"call.add"
] | 961,957 | 961,958 | u332820511 | cpp |
p03161 | /*
|** In the name of Allah, most gracious, most merciful **|
* * ****
* * * *
* * * *
* * * *
** *** *** ... | /*
|** In the name of Allah, most gracious, most merciful **|
* * ****
* * * *
* * * *
* * * *
** *** *** ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,962 | 961,963 | u203289196 | cpp |
p03161 | #include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N, K;
int dp[100100];
int h[100100];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
dp[i] = INF;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = max(0, i - K); ... | #include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N, K;
long long dp[100100];
int h[100100];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
dp[i] = INF;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = max(0, i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 961,964 | 961,965 | u775623741 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
static int N, K;
static int stones[100004];
static int rem[100004];
using namespace std;
int solotion(int i) {
if (i >= N - 1) {
return 0;
}
if (rem[i] != -1) {
return rem[i];
}
int first = abs(stones[i] - stones[i + 1]) ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
static int N, K;
static int stones[100004];
static int rem[100004];
using namespace std;
int solotion(int i) {
if (i >= N - 1) {
return 0;
}
if (rem[i] != -1) {
return rem[i];
}
int first = abs(stones[i] - stones[i + 1]) ... | [
"assignment.change"
] | 961,966 | 961,967 | u237573822 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define forn(i, n) for (int i = 0; i < n; i++)
#define mp makepair
#define pb push_back
int main() {
int n, k;
int arr[100000 + 7];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define forn(i, n) for (int i = 0; i < n; i++)
#define mp makepair
#define pb push_back
int main() {
int n, k;
int arr[100000 + 7];
... | [
"assignment.change"
] | 961,969 | 961,970 | u985355615 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, h[100000], dp[100000], k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= i; j++) {
dp[i] = min(dp[i], dp[i ... | #include <bits/stdc++.h>
using namespace std;
int n, h[100000], dp[100000], k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= i; j++) {
dp[i] = min(dp[i], dp[i ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 961,971 | 961,972 | u265206075 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, arr[100009], dp[100009], k;
long long bt(int id) {
long long &ret = dp[id];
if (ret != -1)
return ret;
if (id + 1 < n) {
ret = 10000000009;
for (int i = 1; i <= k; i++) {
if (id + i < n)
ret = min(ret, bt(id + i) + abs(arr[id] - ... | #include <bits/stdc++.h>
using namespace std;
long long n, arr[100009], dp[100009], k;
long long bt(int id) {
long long &ret = dp[id];
if (ret != -1)
return ret;
if (id + 1 < n) {
ret = 1000000000000009ll;
for (int i = 1; i <= k; i++) {
if (id + i < n)
ret = min(ret, bt(id + i) + abs(arr... | [
"literal.number.change",
"assignment.value.change"
] | 961,973 | 961,974 | u382971323 | cpp |
p03161 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i(a); i <= (b); ++i)
#define gc getchar()
struct Reader {
template <class T> inline operator T() {
T w;
char c, p = 0;
for (; !isdigit(c = gc); c == '-' && (p = 1))
;
for (w = c & 15; isdigit(c = gc); w = w * 10 + (c & 15))
;
retu... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i(a); i <= (b); ++i)
#define gc getchar()
struct Reader {
template <class T> inline operator T() {
T w;
char c, p = 0;
for (; !isdigit(c = gc); c == '-' && (p = 1))
;
for (w = c & 15; isdigit(c = gc); w = w * 10 + (c & 15))
;
retu... | [
"control_flow.loop.for.condition.change"
] | 961,977 | 961,978 | u616158789 | cpp |
p03161 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <vector>
//#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#incl... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 961,979 | 961,980 | u043443359 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = i; j > max(i - k, -1); j--) {
dp[i] = min(dp[j] + abs(h[j] - h... | #include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= max(i - k, 0); j--) {
dp[i] = min(dp[j] + abs(h[j]... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"call.arguments.change"
] | 961,982 | 961,983 | u385306891 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323
#define debug(x) cout << "Case " << x << ": "
#define For(i, n) for (long long i = 0; i < n; i++)
#define Frabs(i, a, b) for (long long i = a; i < b; i++)
#define Frabr(i, a, b)... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define PI 3.14159265358979323
#define debug(x) cout << "Case " << x << ": "
#define For(i, n) for (long long i = 0; i < n; i++)
#define Frabs(i, a, b) for (long long i = a; i < b; i++)
#define Frabr(i, a, b)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,986 | 961,987 | u431173823 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<ll, ll>
#define vi vector<ll>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pf(n) printf("%lld\n", n)
#define sf(n) scanf("%lld", &n)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<ll, ll>
#define vi vector<ll>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define pf(n) printf("%lld\n", n)
#define sf(n) scanf("%lld", &n)
#define fast ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 961,991 | 961,992 | u501976062 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,000 | 962,001 | u704549083 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= j + ... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <... | [
"literal.string.change",
"call.arguments.change",
"call.arguments.add",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,002 | 962,001 | u704549083 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
// int moreGcd
int N = 0;
int K = 0;
vector<int> h;
int main() {
cin >> N;
cin >> K;
int t = 0;
h.push_back(0);
for (int i = 0; i < N; i++) {
cin >> t;
h.push_back(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <random>
#include <string>
#include <vector>
using namespace std;
// int moreGcd
int N = 0;
int K = 0;
vector<int> h;
//何がだめなのか全くわからん
int main() {
cin >> N;
cin >> K;
int t = 0;
h.push_back(0);
for (int i = 0; i < N; i++) {
cin >> t;... | [
"literal.number.change",
"call.arguments.change"
] | 962,015 | 962,011 | u048791623 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 100007;
const long long INF = 100000009;
long long A[N], D[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> A[i], D[i] = INF;
D[1] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= i + k + 1; ++j) {
D... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000007;
const long long INF = 1000000009;
long long A[N], D[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i)
cin >> A[i], D[i] = INF;
D[1] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= i + k; ++j) {
D[j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,029 | 962,030 | u588613695 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 3; i <= n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j... | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i <= n; i++) {
dp[i] = 1e9;
for (int j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,031 | 962,032 | u552951622 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int array[n];
for (int x = 0; x < n; x++) {
cin >> array[x];
}
int dp[n];
dp[0] = 0;
for (int x = 0; x <= k; x++) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int array[n];
for (int x = 0; x < n; x++) {
cin >> array[x];
}
int dp[n];
dp[0] = 0;
for (int x = 0; x <= k && x < n; x... | [
"control_flow.loop.for.condition.change"
] | 962,033 | 962,034 | u859774897 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 962,035 | 962,036 | u152129372 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> c(n, 1e+9);
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> c(n, 1e+9);
c[0] = 0;
c[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,037 | 962,038 | u376817785 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n), dp(n, 100007);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < n; i++) {
if (i < k) {
for (int j = 1; j < i + 1; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long> vec(n), dp(n, 10000000000);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < n; i++) {
if (i < k) {
for (int j = 1; j < i + 1; j++)... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 962,039 | 962,040 | u823444917 | cpp |
p03161 | /*input
5 3
10 30 40 50 20
*/
/**
* B Frog 2
* @author: Raj
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi>
#define pii pair<i... | /*input
5 3
10 30 40 50 20
*/
/**
* B Frog 2
* @author: Raj
*/
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#define endl '\n'
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi>
#define pii pair<i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,045 | 962,046 | u436403625 | cpp |
p03161 | /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = 10001;
for (int j = 1; j <= min(i, k); ++j) {
dis... | /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = INT_MAX;
for (int j = 1; j <= min(i, k); ++j) {
d... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,047 | 962,048 | u013751809 | cpp |
p03161 | /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = 1001;
for (int j = 1; j <= min(i, k); ++j) {
dis[... | /*=======Kaihatsu========*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
int dis[n] = {0};
dis[0] = 0;
for (int i = 1; i < n; ++i) {
dis[i] = INT_MAX;
for (int j = 1; j <= min(i, k); ++j) {
d... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,049 | 962,048 | u013751809 | cpp |
p03161 | #include <iostream>
using namespace std;
int N, K;
int H[100005];
int DP[100005];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 1; i < N; i++) {
DP[i] = 1e9;
for (int j = 1; j < min(i, K + 1); j++)
DP[i] = min(DP[i], DP[i - j] + abs(H[i] - H[i - j]));
}
... | #include <iostream>
using namespace std;
int N, K;
int H[100005];
int DP[100005];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> H[i];
for (int i = 1; i < N; i++) {
DP[i] = 1e9;
for (int j = 1; j < min(i + 1, K + 1); j++)
DP[i] = min(DP[i], DP[i - j] + abs(H[i] - H[i - j]));
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 962,050 | 962,051 | u462369736 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &x : a) {
cin >> x;
}
vector<int> dp(n, 1e9 + 2);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
int cur = i + j;
if (cur < n) {
dp[cur] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &x : a) {
cin >> x;
}
vector<int> dp(n, 1e9 + 2);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
int cur = i + j;
if (cur < n) {
dp[cur] ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,052 | 962,053 | u770383589 | cpp |
p03161 | /*
Author : Pranav_Raut.
*/
#include <bits/stdc++.h>
using namespace std;
#define input(arr, n) \
for (ll i = 0; i < n; i++) { \
cin >> arr[i]; ... | /*
Author : Pranav_Raut.
*/
#include <bits/stdc++.h>
using namespace std;
#define input(arr, n) \
for (ll i = 0; i < n; i++) { \
cin >> arr[i]; ... | [
"assignment.change"
] | 962,061 | 962,062 | u743925717 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return LONG_MAX;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return 1e16;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i + j... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 962,065 | 962,066 | u840404068 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return LONG_MAX;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, k, a[100105];
ll dp[100105];
ll mini(ll arr[]);
ll rec(int i = 0) {
if (i >= n)
return 1e16;
if (i == n - 1)
return 0;
if (dp[i] + 1)
return dp[i];
ll ch[101];
for (int j = 1; j <= k; j++) {
ch[j - 1] = abs(a[i] - a[i + j... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change",
"literal.number.change",
"assignment.value.change"
] | 962,067 | 962,066 | u840404068 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 10005;
for (int j = 1; j <= min... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 1001001001;
for (int j = 1; j <... | [
"literal.number.change",
"assignment.value.change"
] | 962,072 | 962,073 | u049031340 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a[100001], res[100001], mn, j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
res[1] = 0;
res[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
mn = res[i - 1] + abs(a[i] - a[i - 1]);
for (j = 2; j <= k; j++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, a[100001], res[100001], mn, j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
scanf("%d", &a[i]);
res[1] = 0;
res[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++) {
mn = res[i - 1] + abs(a[i] - a[i - 1]);
for (j = 2; j <= k && i - j... | [
"control_flow.loop.for.condition.change"
] | 962,076 | 962,077 | u843774006 | cpp |
p03161 | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define maxval 100005
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n, k;
scanf("%d %d", &n, &k);
vector<int> h(n + 1);
vector<int> dp(n + 1, 1e5);
for ... | // Author : Rifayat Samee (Sanzee)
// Problem :
// Algorithm:
/*
*/
#include <bits/stdc++.h>
using namespace std;
#define maxval 100005
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n, k;
scanf("%d %d", &n, &k);
vector<int> h(n + 1);
vector<int> dp(n + 1, 1e9);
for ... | [
"literal.number.change",
"call.arguments.change"
] | 962,078 | 962,079 | u926505307 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,089 | 962,090 | u784576081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n, k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,091 | 962,090 | u784576081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long int n, dp[100002], k;
long long int h[100002];
long long int solve(long long int index) {
if (index == n - 1)
return 0;
if (dp[index] != -1)
return dp[index];
long long int ans = 100;
for (int i = index + 1; i <= min(n - 1, index + k); i++)
ans... | #include <bits/stdc++.h>
using namespace std;
long long int n, dp[100002], k;
long long int h[100002];
long long int solve(long long int index) {
if (index == n - 1)
return 0;
if (dp[index] != -1)
return dp[index];
long long int ans = 1e9;
for (int i = index + 1; i <= min(n - 1, index + k); i++)
ans... | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,092 | 962,093 | u711948228 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (1 + k <= n) {
cout << a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n <= 1 + k) {
cout << a... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 962,096 | 962,097 | u790502959 | cpp |
p03161 | #include <climits>
#include <fstream>
#include <iostream>
#include <vector>
#define NMAX 100001
using namespace std;
int DP[NMAX], n, initial[NMAX], k;
void read() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> initial[i];
}
}
void solve() {
for (int i = 2; i <= n; i++) {
DP[i] = INT_MAX;
... | #include <climits>
#include <fstream>
#include <iostream>
#include <vector>
#define NMAX 100001
using namespace std;
int DP[NMAX], n, initial[NMAX], k;
void read() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> initial[i];
}
}
void solve() {
for (int i = 2; i <= n; i++) {
DP[i] = INT_MAX;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,098 | 962,099 | u389532053 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
long long int dp[n + 1];
for (long long int i = 0; i <= n; i++) {
dp[i] = 1e9 + 5;
}
dp[1] = 0;
for (long ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
long long int dp[n + 1];
for (long long int i = 0; i <= n; i++) {
dp[i] = 1e9 + 5;
}
dp[1] = 0;
for (long ... | [
"literal.number.change"
] | 962,100 | 962,101 | u450781785 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,105 | 962,106 | u610253537 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
ll a, b, c, d, e;
ll N, H, K, W;
ll dp[10000100];
ll h[10000100];
void input() {
cin >> N;
cin >> K;
for (int i = 1; i <= N; i++) {
int hi;
cin... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,107 | 962,106 | u610253537 | cpp |
p03161 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace ::std;
vector<int> v, a;
#define INT_MAX 2100000000
signed main() {
int n, k;
cin >> n;
cin >> k;
v.resize(n);
a.resize(n, INT_MAX);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <fstream>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace ::std;
vector<int> v, a;
#define INT_MAX 2100000000
signed main() {
int n, k;
cin >> n;
cin >> k;
v.resize(n);
a.resize(n, INT_MAX);
for (int i = 0; i < n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,112 | 962,113 | u095384223 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i+... | #include "bits/stdc++.h"
using namespace std;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i+... | [
"control_flow.loop.for.condition.change"
] | 962,114 | 962,115 | u523141528 | cpp |
p03161 | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change"
] | 962,120 | 962,121 | u054106284 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
for (int i = 1; i < k; i++)
min_jumps[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
min_jumps[i] = INT_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[max(n, k)];
min_jumps[0] = 0;
for (int i = 1; i < k; i++)
min_jumps[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
min_jumps[i... | [
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.add"
] | 962,124 | 962,125 | u010432749 | cpp |
p03161 | //
// main.cpp
// ProjG
//
// Created by Tay Yong Kiat on 14/1/19.
// Copyright © 2019 Tay Yong Kiat. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
int n, x, k, dp[100001];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n... | //============================================================================
// Name : ProjG.cpp
// Author : Yong Kiat
// Version :
// Copyright : By Algotae.
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bit... | [
"literal.number.change",
"call.arguments.change"
] | 962,126 | 962,127 | u264397431 | cpp |
p03161 | //
// main.cpp
// ProjG
//
// Created by Tay Yong Kiat on 14/1/19.
// Copyright © 2019 Tay Yong Kiat. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
int n, x, k, dp[100001];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n... | //============================================================================
// Name : ProjG.cpp
// Author : Yong Kiat
// Version :
// Copyright : By Algotae.
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <bit... | [
"literal.number.change",
"call.arguments.change"
] | 962,126 | 962,128 | u264397431 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long m_min(long long t[], long long K) {
long long m = INT_MAX;
for (long long i = 0; i < K; i++)
if (t[i] < m)
m = t[i];
return m;
}
int main() {
long long N, K;
long long temp;
cin >> N >> K;
long long arr[N];
long long dp[N];
dp[0] = 0;... | #include <bits/stdc++.h>
using namespace std;
long long m_min(long long t[], long long K) {
long long m = INT_MAX;
for (long long i = 0; i < K; i++)
if (t[i] < m)
m = t[i];
return m;
}
int main() {
long long N, K;
long long temp;
cin >> N >> K;
long long arr[N];
long long dp[N];
dp[0] = 0;... | [
"assignment.change"
] | 962,131 | 962,132 | u530804336 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int a[100001], f[100001] = {0};
int main() {
int n, m, k, i, j;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= n; i++) {
f[i] = 0x7ffffff;
for (j = 1; j <= min(i - 1, k); j++) {
f[i] = min(abs(a[i - j] - ... | #include <bits/stdc++.h>
using namespace std;
int a[100001], f[100001] = {0};
int main() {
int n, m, k, i, j;
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (i = 2; i <= n; i++) {
f[i] = 0x7fffffff;
for (j = 1; j <= min(i - 1, k); j++) {
f[i] = min(abs(a[i - j] -... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,137 | 962,136 | u547898034 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a tempe... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a tempe... | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,140 | 962,139 | u103094881 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a tempe... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n; // the number of temperatures to analyse
int k;
vector<int> h;
int cost[1000000];
cin >> n;
cin.ignore();
cin >> k;
cin.ignore();
for (int i = 0; i < n; i++) {
int t; // a tempe... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,141 | 962,139 | u103094881 | cpp |
p03161 | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma G... | /*author : Yashvardhan
Saturday, January 12, 2019
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#define vpi vector<pi>
#define ff first
#define ss second
#pragma comment(linker, "/stack:200000000")
#pragma G... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,144 | 962,145 | u368039995 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long long x[],
long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long long x[],
long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] ... | [
"literal.number.change",
"assignment.value.change"
] | 962,146 | 962,147 | u123896133 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long x[], long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] = ans[i - j] + abs(h[i ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
// dp用関数
long long dp_Func(long long h[], long i, long k, long long x[],
long long ans[]) {
for (long j = 1; j <= k; j++) {
if (i >= j) {
x[j] ... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 962,148 | 962,147 | u123896133 | cpp |
p03161 | /* ~created by Roh@n M@he$hwari~ */
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, j, k;
cin >> n >> k;
int dp[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INT_MAX;
}
dp[0] = 0, dp[1] = abs(h[1] - h[0]);
for (i... | /* ~created by Roh@n M@he$hwari~ */
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, j, k;
cin >> n >> k;
int dp[n], h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INT_MAX;
}
dp[0] = 0, dp[1] = abs(h[1] - h[0]);
for (i... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 962,151 | 962,152 | u042763058 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (i... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (i... | [
"expression.operation.binary.remove"
] | 962,153 | 962,154 | u114047445 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
int N, K, h[100002], dp[100002];
int main() {
scanf("%d %d %d", &N, &K, &h[1]);
for (int i = 2; i <= N; i++) {
scanf("%d", &h[i]);
dp[i] = 1e9;
for (int j = i - 1; j >= max(0, i - K); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
pri... | #include "bits/stdc++.h"
using namespace std;
int N, K, h[100002], dp[100002];
int main() {
scanf("%d %d %d", &N, &K, &h[1]);
for (int i = 2; i <= N; i++) {
scanf("%d", &h[i]);
dp[i] = 1e9;
for (int j = i - 1; j >= max(1, i - K); j--) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
pri... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,157 | 962,158 | u051773060 | cpp |
p03161 | // In the name of ALLAH the most merciful the most beneficial
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#define sc(x) scanf("%d", &x)
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORd(i, a, b) for (int i = a; ... | // In the name of ALLAH the most merciful the most beneficial
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#define sc(x) scanf("%d", &x)
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORd(i, a, b) for (int i = a; ... | [
"literal.number.change",
"assignment.value.change"
] | 962,159 | 962,160 | u436364432 | cpp |
p03161 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vecto... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vect... | [
"variable_declaration.value.change"
] | 962,165 | 962,166 | u031448582 | cpp |
p03161 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vecto... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
typedef int long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
h[i] = x;
}
vecto... | [
"literal.number.change",
"expression.operation.binary.change"
] | 962,165 | 962,169 | u031448582 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 100010;
int n, k;
int h[N], cost[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 1; i <= n; ++i) {
cost[i] = inf;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (in... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int N = 100010;
int n, k;
int h[N], cost[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 1; i <= n; ++i) {
cost[i] = inf;
}
cost[1] = 0;
for (int i = 2; i <= n; ++i) {
for (in... | [
"assignment.change"
] | 962,171 | 962,172 | u118354813 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
int n, k, arr[MAX], dp[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
fo... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
int n, k, arr[MAX], dp[MAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
fo... | [
"control_flow.loop.for.condition.change"
] | 962,173 | 962,174 | u386030504 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 962,175 | 962,176 | u791542693 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n, k;
cin >> n >> k;
ll a[10010];
rep(i, 0, n) cin >> a[i];
ll dp[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p;
const int inf = (1 << 30);
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rrep(i, a, n) for (int i = (a - 1); i >= n; i--)
int main() {
ll n, k;
cin >> n >> k;
ll a[100010];
rep(i, 0, n) cin >> a[i];
ll dp... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 962,185 | 962,183 | u075865455 | cpp |
p03161 | #include <bits/stdc++.h>
#define adj_list vector<vi>
#define endl "\n"
#define INF_INT 2e9
#define INF_LL 2e18
#define matmax 25
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define pi pair<int, int>
#define pii pair<int, pair<int, int>>
#define pl pair<ll, ll>
#define pll pair<ll, pair<ll, ll>>
#de... | #include <bits/stdc++.h>
#define adj_list vector<vi>
#define endl "\n"
#define INF_INT 2e9
#define INF_LL 2e18
#define matmax 25
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define pi pair<int, int>
#define pii pair<int, pair<int, int>>
#define pl pair<ll, ll>
#define pll pair<ll, pair<ll, ll>>
#de... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 962,188 | 962,189 | u492711014 | cpp |
p03161 | #include <iostream>
#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
// const int MOD = 10e9+7;
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
retur... | #include <iostream>
#define int long long
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
// const int MOD = 10e9+7;
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
retur... | [] | 962,190 | 962,191 | u904833081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 100100;
constexpr int INF = 1e9 + 5;
int n, k;
int arr[MAX_N];
int dp[MAX_N];
int main() {
scanf(" %d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf(" %d", &arr[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = -1;
... | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX_N = 100100;
constexpr int INF = 1e9 + 5;
int n, k;
int arr[MAX_N];
int dp[MAX_N];
int main() {
scanf(" %d %d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf(" %d", &arr[i]);
}
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = -1;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,192 | 962,193 | u928667792 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, h[100000], dp[100000];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
int tmp = 99999;
for (int j = 1; j <= i && j <= k; j++) {
tmp = min(tmp, dp[i - j] + abs(h[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, h[100000], dp[100000];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
int tmp = INT_MAX;
for (int j = 1; j <= i && j <= k; j++) {
tmp = min(tmp, dp[i - j] + abs(h[... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,196 | 962,195 | u565219356 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int r = 1e5 + 1;
int a[r], dp[r], n, k;
int solve(int idx) {
if (idx >= n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ret = INT_MAX;
for (int i = 1; i <= k; i++)
if (idx + i <= n)
ret = min(ret, abs(a[idx] - a[idx + i]) + solve(i + ... | #include <bits/stdc++.h>
using namespace std;
const int r = 1e5 + 1;
int a[r], dp[r], n, k;
int solve(int idx) {
if (idx >= n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ret = INT_MAX;
for (int i = 1; i <= k; i++)
if (idx + i < n)
ret = min(ret, abs(a[idx] - a[idx + i]) + solve(i + i... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,197 | 962,198 | u173976156 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int H[N];
int dp[N];
const int C = 1000000000;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int temp;
dp[0] = 0;
for (int i = 1; i < min(N - 1, K); i++) {
temp = C;
for (int j = 0; j < i; j++) {
tem... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int H[N];
int dp[N];
const int C = 1000000000;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
int temp;
dp[0] = 0;
for (int i = 1; i < min(N, K); i++) {
temp = C;
for (int j = 0; j < i; j++) {
temp = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,201 | 962,202 | u977554186 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long dp[1000007];
const long long inf = 100000000007;
int main() {
long long x, n, k;
cin >> n >> k;
while (n--)
cin >> x, v.push_back(x);
dp[1] = abs(v[1] - v[0]);
for (long long i = 2; i <= k; i++) {
dp[i] = abs(v[i] - v[0]... | #include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long dp[1000007];
const long long inf = 100000000007;
int main() {
long long x, n, k;
cin >> n >> k;
while (n--)
cin >> x, v.push_back(x);
dp[1] = abs(v[1] - v[0]);
for (long long i = 2; i <= k; i++) {
dp[i] = abs(v[i] - v[0]... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,211 | 962,212 | u622635644 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 0x3f3f3f3f;
int arr[N], dp[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, 0x3f, sizeof dp);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, INF = 0x3f3f3f3f;
int arr[N], dp[N];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
memset(dp, 0x3f, sizeof dp);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k && i - j ... | [
"control_flow.loop.for.condition.change"
] | 962,213 | 962,214 | u276999104 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define ii pair<ll, ll>
#define vii vector<ii>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
ll modpow(ll base, ll exp, ll modulus) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, b) for (ll i = a; i < b; i++)
#define mod 1000000007
#define ii pair<ll, ll>
#define vii vector<ii>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
ll modpow(ll base, ll exp, ll modulus) ... | [
"identifier.change"
] | 962,217 | 962,218 | u410283759 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define fore(i, ii, iii) for (int i = ii; i < iii; i++)
const int N = 1e5 + 15, INF = 1e9;
int n, k, dp[N], h[N];
int f(int x) {
if (x == 0)
return 0;
if (x == 1)
return abs(h[1] - h[0]);
if (dp[x - 1] >= 0)
return dp[x - 1];
int r = INF;
fore(i, 1,... | #include <bits/stdc++.h>
using namespace std;
#define fore(i, ii, iii) for (int i = ii; i < iii; i++)
const int N = 1e5 + 15, INF = 1e9;
int n, k, dp[N], h[N];
int f(int x) {
if (x == 0)
return 0;
if (x < k)
return abs(h[x] - h[0]);
if (dp[x - 1] >= 0)
return dp[x - 1];
int r = INF;
fore(i, 1, ... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 962,219 | 962,220 | u056052461 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e18;
for (lint i = 1; i <= ... | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e18;
for (lint i = 1; i <= ... | [
"literal.number.change",
"assignment.value.change"
] | 962,224 | 962,225 | u021423660 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e5;
for (int i = 1; i <= K;... | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
lint N, K;
lint h[100010];
lint dp[100010];
lint ans(lint n) {
if (dp[n] != -1)
return dp[n];
if (n == 0)
dp[n] = 0;
else if (n == 1)
dp[n] = abs(h[1] - h[0]);
else {
dp[n] = 1e18;
for (lint i = 1; i <= ... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 962,226 | 962,225 | u021423660 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
long long n, k, a[100005], dp[100005], Min;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
Min = 10005;
for (int j = 0; j < i; j++... | #include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
long long n, k, a[100005], dp[100005], Min;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
Min = 2147483647;
for (int j = 0; j < i... | [
"literal.number.change",
"assignment.value.change"
] | 962,229 | 962,228 | u527057233 | cpp |
p03161 | #include <iostream>
#include <vector>
#define ma 1000000000
int mod(int a) {
if (a >= 0)
return a;
else
return -a;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
b[0] = 0;
b[1] = mod(a[1] - a[0]... | #include <iostream>
#include <vector>
#define ma 1000000000
int mod(int a) {
if (a >= 0)
return a;
else
return -a;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
b[0] = 0;
b[1] = mod(a[1] - a[0]... | [
"control_flow.loop.for.condition.change"
] | 962,232 | 962,233 | u784120136 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h[100005], dp[100005], N, K;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int lvl = 2; lvl < N; lvl++) {
dp[lvl] = dp[lvl - 1] + abs(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h[100005], dp[100005], N, K;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int lvl = 2; lvl < N; lvl++) {
dp[lvl] = dp[lvl - 1] + abs(... | [
"control_flow.loop.for.condition.change"
] | 962,234 | 962,235 | u297303800 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
const LL MAX = 100005;
const LL INF = 1000 * 1000 * 1000 + 9;
LL n, k, DP[MAX] = {}, stone[MAX] = {};
LL calc(LL idx) {
if (DP[idx] != INF)
return DP[idx];
else if (idx == n - 1)
return DP[idx] = 0;
e... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
const LL MAX = 100005;
const LL INF = 1000 * 1000 * 1000 + 9;
LL n, k, DP[MAX] = {}, stone[MAX] = {};
LL calc(LL idx) {
if (DP[idx] != INF)
return DP[idx];
else if (idx == n - 1)
return DP[idx] = 0;
e... | [
"expression.operation.binary.remove",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,238 | 962,239 | u562293097 | cpp |
p03161 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,240 | 962,241 | u901561754 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,242 | 962,243 | u093420647 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 120), h(n + 120);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
a[0] = 0;
a[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int m = 10001;
for (int j =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n + 120), h(n + 120);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
a[0] = 0;
a[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int m = 1e9 + 1;
for (int j... | [
"literal.number.change"
] | 962,244 | 962,245 | u388552482 | cpp |
p03161 | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_li... | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_li... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,246 | 962,247 | u221357439 | cpp |
p03161 | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_li... | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_li... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,248 | 962,247 | u221357439 | cpp |
p03161 | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_li... | #include <bits/stdc++.h>
// Rohit Sharma, jammu. make aarsh proud.
#define int long long int
#define pb push_back
#define M 1000000007
#define gcd(a, b) __gcd(a, b)
#define rep(k, n) for (int i = k; i < n; i++)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define MOD 1000000007
using namespace std;
using std::numeric_li... | [
"identifier.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 962,249 | 962,247 | u221357439 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int h[100010];
ll cost[100010];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
cost[i] = 1 << 10;
cost[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i; (i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int h[100010];
ll cost[100010];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
cost[i] = 10000000000;
cost[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i; ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 962,253 | 962,251 | u898749314 | cpp |
p03161 | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
long long h[(int)1e5 +... | // In the name of God
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define debug(x) cout << #x ": " << x << endl;
long long h[(int)1e5 +... | [
"control_flow.loop.for.condition.change"
] | 962,257 | 962,258 | u832023241 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define scan(x) ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define scan(x) ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 962,264 | 962,265 | u101231452 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = LLONG_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for ... | #include <bits/stdc++.h>
using namespace std;
long long n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = LLONG_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,266 | 962,267 | u400673400 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j =... | #include <bits/stdc++.h>
using namespace std;
long long n, k, h[100005], dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = LLONG_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change",
"litera... | 962,268 | 962,267 | u400673400 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n + 1, 10000);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++) {
for (int j = i - 1; j >= 1 && j >= i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n + 1, INT_MAX - 1);
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[1] - h[0]);
// vector<int> ans;
for (int i = 3; i <= n; i++) {
for (int j ... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 962,273 | 962,274 | u971084072 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define mp std::make_pair
#define ll long long int
#define abs(n) ((n > 0) ? (n) : ((n) * (-1)))
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
#define VREP(v) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define mp std::make_pair
#define ll long long int
#define abs(n) ((n > 0) ? (n) : ((n) * (-1)))
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, (n)-1)
#define VREP(v) ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 962,275 | 962,276 | u430966577 | cpp |
p03161 | #include <iostream>
#include <math.h>
using namespace std;
int n, k;
int cache[100000] = {0};
int min_cost(int a[]) {
if (n == 1)
return 0;
cache[n - 1] = 0;
cache[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int min = 100000;
for (int j = 1; j <= k; j++) {
if (i + j ... | #include <iostream>
#include <math.h>
using namespace std;
int n, k;
int cache[100000] = {0};
int min_cost(int a[]) {
if (n == 1)
return 0;
cache[n - 1] = 0;
cache[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--) {
long long int min = 100000000000;
for (int j = 1; j <= k; j++) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,280 | 962,279 | u958810059 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,281 | 962,282 | u504142483 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.