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() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N, INT_MAX);
dp[0] = 1;
for (int i = 1; i < N; i++) {
for (int j = 1; i - j >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[... | #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];
}
vector<int> dp(N, INT_MAX);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; i - j >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[... | [
"literal.number.change",
"assignment.value.change"
] | 957,919 | 957,920 | u931938233 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
V<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
V<ll> ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
V<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
V<ll> ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 957,923 | 957,924 | u701339058 | cpp |
p03161 | // "It does not matter how slowly you go as long as you do not stop." -
// Confucius
#include <bits/stdc++.h>
using namespace std;
/*
author : Roshan_Mehta
motto : Time Management,Consistency,Patience!!
*/
#define int long long
#ifdef Local_Debug
#define debug(x) cout << #x << " " << x << " "
#define debug1(a) co... | // "It does not matter how slowly you go as long as you do not stop." -
// Confucius
#include <bits/stdc++.h>
using namespace std;
/*
author : Roshan_Mehta
motto : Time Management,Consistency,Patience!!
*/
#define int long long
#ifdef Local_Debug
#define debug(x) cout << #x << " " << x << " "
#define debug1(a) co... | [] | 957,925 | 957,926 | u276036901 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> &h, vector<int> &v, int k = 2) {
int n = h.size();
for (int curr = 0; curr < n; curr++) {
for (int j = curr + 1; j < n and j <= curr + k; j++) {
int d1 = abs(h[curr] - h[curr + j]);
v[j] = min(v[j], v[curr] + d1);
}
}
}
int ... | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> &h, vector<int> &v, int k = 2) {
int n = h.size();
for (int curr = 0; curr < n; curr++) {
for (int j = curr + 1; j < n and j <= curr + k; j++) {
int d1 = abs(h[curr] - h[j]);
v[j] = min(v[j], v[curr] + d1);
}
}
}
int main() ... | [
"expression.operation.binary.remove"
] | 957,932 | 957,933 | u772457931 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define fi(n) for (int i = 0; i < n; i++)
#define fj(n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = n - 1; i >= 0; i--)
#define chlo(i, a, n) for (int i = a; i < n; i++)
#define vi vector<int>
#define vs vector<string>
#define int long long int
#define all(a) (... | #include <bits/stdc++.h>
using namespace std;
#define fi(n) for (int i = 0; i < n; i++)
#define fj(n) for (int j = 0; j < n; j++)
#define fr(n) for (int i = n - 1; i >= 0; i--)
#define chlo(i, a, n) for (int i = a; i < n; i++)
#define vi vector<int>
#define vs vector<string>
#define int long long int
#define all(a) (... | [
"call.remove"
] | 957,936 | 957,937 | u021830179 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mk(arr, n, type) type *arr = new type[n];
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define mk(arr, n, type) type *arr = new type[n];
#define vi vector<int>
#define si set<int>
#define usi unordered_set<int>
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 957,940 | 957,941 | u612541354 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long int dp[100005], ar[100005];
long long int solve(long long int i, long long int n, long long int m) {
if (i == (n - 1))
return 0;
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
long long int mn = INT_MAX;
for (long long int j = 1; j <= ... | #include <bits/stdc++.h>
using namespace std;
long long int dp[100005], ar[100005];
long long int solve(long long int i, long long int n, long long int m) {
if (i == (n - 1))
return 0;
if (i >= n)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
long long int mn = INT_MAX;
for (long long int j = 1;... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 957,948 | 957,949 | u112451354 | cpp |
p03161 | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define N 100005
#define K 200005
#define MOD 998244353
#define ll long long int
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, 100000000);
dp[0] = 0;
... | #include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#define N 100005
#define K 200005
#define MOD 998244353
#define ll long long int
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, 1000000005);
dp[0] = 0;
... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 957,954 | 957,955 | u232473835 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll, ll>
#define pii pair<ll, pi>
#define pb push_back
#define mk make_pair
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pi pair<ll, ll>
#define pii pair<ll, pi>
#define pb push_back
#define mk make_pair
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> height(n + 1);
... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 957,969 | 957,968 | u675040086 | cpp |
p03161 | /*
Author : Simanta Deb Turja
*/
#include <bits/stdc++.h>
using namespace std;
#define Professor
using ll = long long;
using i64 = unsigned long long;
template <typename T> inline T Min(T a, T b, T c) { return min(a, min(b, c)); }
template <typename T> inline T Min(T a, T b, T c, T d) {
return min(a, min(b, mi... | /*
Author : Simanta Deb Turja
*/
#include <bits/stdc++.h>
using namespace std;
#define Professor
using ll = long long;
using i64 = unsigned long long;
template <typename T> inline T Min(T a, T b, T c) { return min(a, min(b, c)); }
template <typename T> inline T Min(T a, T b, T c, T d) {
return min(a, min(b, mi... | [
"call.arguments.change"
] | 957,970 | 957,971 | u095814925 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n + 1, 0);
for (ll i = 1; i <= n; i++) {
cin >> h.at(i);
}
vector<ll> dp(n + 1, 1000000000);
dp.at(0... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define p_q priority_queue
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n + 1, 0);
for (ll i = 1; i <= n; i++) {
cin >> h.at(i);
}
vector<ll> dp(n + 1, 1000000000);
dp.at(0... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,978 | 957,979 | u830237447 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vbool = vector<bool>;
using vvbool =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define vv(T) vector<vector<T>>
using namespace std;
using ll = long long;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vbool = vector<bool>;
using vvbool =... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 957,984 | 957,985 | u229213815 | cpp |
p03161 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef l... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef l... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 957,986 | 957,987 | u274420084 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define MAX_N 1e5 + 10
#define inf 10000000
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vbl;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1], dp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define MAX_N 1e5 + 10
#define inf 10000000
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vbl;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1], dp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,989 | 957,990 | u748761968 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 10007
#define chk(d) cout << d << endl
using namespace std;
int main() {
int n, m, k;
cin >> n >> k;
vector<in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 1e9 + 7
#define chk(d) cout << d << endl
using namespace std;
int main() {
int n, m, k;
cin >> n >> k;
vector<... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 957,993 | 957,994 | u590683594 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 100007
#define chk(d) cout << d << endl
using namespace std;
int main() {
long int n, m, k;
cin >> n >> k;
vec... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define chk(d) cout << d << endl
using namespace std;
int main() {
long int n, m, k;
cin >> n >> k;
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 958,000 | 958,002 | u590683594 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 10007
#define chk(d) cout << d << endl
using namespace std;
int main() {
long int n, m, k;
cin >> n >> k;
vect... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define chk(d) cout << d << endl
using namespace std;
int main() {
long int n, m, k;
cin >> n >> k;
... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 958,001 | 958,002 | u590683594 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 10007
#define chk(d) cout << d << endl
using namespace std;
int main() {
int n, m, k;
cin >> n >> k;
vector<in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define f(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define chk(d) cout << d << endl
using namespace std;
int main() {
long int n, m, k;
cin >> n >> k;
... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.widen.change"
] | 958,003 | 958,002 | u590683594 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
int dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 100000;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k && j <= i; j++) {
dp[i] = min(dp[i... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
long long int dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 1000000000;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k && j <= i; j++) {
dp... | [
"literal.number.change",
"assignment.value.change"
] | 958,010 | 958,011 | u842473278 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,016 | 958,017 | u298272335 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,018 | 958,017 | u298272335 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
static long long int n, a[100010], b[100010], k;
cin >> n >> k;
fill(b, b + n, 100000);
cin >> a[0];
b[0] = 0;
for (long long int i = 1; i < n; i++) {
cin >> a[i];
for (int j = 1; j <= k; j++) {
if (i - j < 0) {
break;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
static long long int n, a[1000010], b[1000010], k;
cin >> n >> k;
fill(b, b + n, 10000000000);
cin >> a[0];
b[0] = 0;
for (long long int i = 1; i < n; i++) {
cin >> a[i];
for (long long int j = 1; j <= k; j++) {
if (i - j < 0) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change"
] | 958,022 | 958,020 | u417303453 | cpp |
p03161 | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<ll, ll> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl... | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<ll, ll> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,027 | 958,028 | u292500766 | cpp |
p03161 | // Created by the_solver...
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) f... | // Created by the_solver...
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) f... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,029 | 958,030 | u419699727 | cpp |
p03161 | // Created by the_solver...
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) f... | // Created by the_solver...
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) f... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,029 | 958,031 | u419699727 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<int> cost(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
cost.at(i) = 1000;
}
cost.at(0) = 0;
if (N > K) {
for (int i = 1; i < K; i++) {
for (int j = i; j > 0; j--) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<int> cost(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
cost.at(i) = 10000000000;
}
cost.at(0) = 0;
if (N > K) {
for (int i = 1; i < K; i++) {
for (int j = i; j > 0; j--) {... | [
"literal.number.change",
"assignment.value.change"
] | 958,032 | 958,033 | u507351098 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n, i, x, k;
cin >> n >> k;
li dp[n + 1] = {0}, h[n + 1] = {0};
for (i = 1; i <= n; i++) {
cin >> h[i];
}
dp[0] = dp[1] = 0;
dp[2] = abs(h[2] ... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
li n, i, x, k;
cin >> n >> k;
li dp[n + 1] = {0}, h[n + 1] = {0};
for (i = 1; i <= n; i++) {
cin >> h[i];
}
dp[0] = dp[1] = 0;
dp[2] = abs(h[2] -... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,039 | 958,040 | u774966777 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
cin >> n >> k;
int a[n + 1], dp[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
int mn = 1e09;
for (j = i - 1; j >= max(0, i - k); j--) {
mn = min(mn,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
cin >> n >> k;
int a[n + 1], dp[n + 1];
for (i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++) {
int mn = 1e09;
for (j = i - 1; j >= max(1, i - k); j--) {
mn = min(mn,... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,042 | 958,043 | u629369127 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll frog1(ll d[], ll b) {
// if b==0 no steps to jump
if (b <= 1)
return 0;
// he may jump 1 or 2 steps
// with minimum cosst
int p = abs(d[b - 1] - d[b - 2]) + frog1(d, b - 1);
int r = (b <= 2) ? 10000 : abs(d[b - 1] - d[b ... | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
ll frog1(ll d[], ll b) {
// if b==0 no steps to jump
if (b <= 1)
return 0;
// he may jump 1 or 2 steps
// with minimum cosst
int p = abs(d[b - 1] - d[b - 2]) + frog1(d, b - 1);
int r = (b <= 2) ? 10000 : abs(d[b - 1] - d[b ... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 958,048 | 958,049 | u278997427 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define mi 100000
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int a[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i];
c[0] = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MOD 1000000007
#define mi 1000000000
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int a[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i];
c[0] = 0;
for (i... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 958,052 | 958,053 | u101591379 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int i, j;
int dp[n];
for (i = 0; i < n; i++) {
dp[i] = 0;
cin >> arr[i];
}
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - 1; j >= i - k; j--) {
int a1 = abs(arr[i] - arr[j]) + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
int i, j;
int dp[n];
for (i = 0; i < n; i++) {
dp[i] = 0;
cin >> arr[i];
}
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - 1; j >= i - k && j >= 0; j--) {
int a1 = abs(arr[i] - ... | [
"control_flow.loop.for.condition.change"
] | 958,056 | 958,057 | u610655627 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[1] = 0;
for (int i = 2; i <= k && i <= n; i++) {
dp[i] = dp[1] = abs(a[i] - a[1]);
}
for (int i = k + 1;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int dp[n + 1];
dp[1] = 0;
for (int i = 2; i <= k && i <= n; i++) {
dp[i] = dp[1] + abs(a[i] - a[1]);
}
for (int i = k + 1;... | [
"assignment.value.change"
] | 958,062 | 958,063 | u748516141 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
int main() {
ll n, i, j, cnt = 1, k = 1, w1, w2, w3, t, a, b, c, d, e, s, r;
/* freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
cin >> n >> k;
ll h[n];
ll dp[n];
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
int main() {
ll n, i, j, cnt = 1, k = 1, w1, w2, w3, t, a, b, c, d, e, s, r;
/* freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);*/
cin >> n >> k;
ll h[n];
ll dp[n];
for (i = 0; i < n; i++) ... | [
"literal.number.change",
"assignment.value.change"
] | 958,066 | 958,067 | u097163034 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
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];
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
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];
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,076 | 958,077 | u326660998 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
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];
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
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];
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,078 | 958,077 | u326660998 | cpp |
p03161 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int frog(vector<int> h, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int m = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - j >= 1) {
int op = abs(h[i] - h[i - j]) + dp[i - j];
... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int frog(vector<int> h, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int m = INT_MAX;
for (int j = 1; j < k + 1; j++) {
if (i - j >= 1) {
int op = abs(h[i] - h[i - j]) + dp[i - j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 958,086 | 958,087 | u831213405 | cpp |
p03161 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int frog(vector<int> h, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int m = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - k >= 1) {
int op = abs(h[i] - h[i - j]) + dp[i - j];
... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int frog(vector<int> h, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int m = INT_MAX;
for (int j = 1; j < k + 1; j++) {
if (i - j >= 1) {
int op = abs(h[i] - h[i - j]) + dp[i - j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 958,088 | 958,087 | u831213405 | cpp |
p03161 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int frog(vector<int> h, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int m = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - k >= 1) {
int op = abs(h[i] - h[i - k]) + dp[i - k];
... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int frog(vector<int> h, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int m = INT_MAX;
for (int j = 1; j < k + 1; j++) {
if (i - j >= 1) {
int op = abs(h[i] - h[i - j]) + dp[i - j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.opera... | 958,089 | 958,087 | u831213405 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n;
cin >> k;
vector<int> v(n);
vector<int> arr(n); // stores minimum energy to reach ith pillar
arr[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v[... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n;
cin >> k;
vector<int> v(n);
vector<int> arr(n); // stores minimum energy to reach ith pillar
arr[0] = 0;
for (int i = 0; i < n; i++) {
cin >> v[... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,090 | 958,091 | u831340327 | cpp |
p03161 | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb p... | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ones(x) (ll) __builtin_popcount(x)
#define fs first
#define sc second
#define pb p... | [] | 958,094 | 958,095 | u896379188 | cpp |
p03161 | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>... | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>... | [
"call.remove"
] | 958,102 | 958,103 | u721374917 | cpp |
p03161 | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>... | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>... | [
"call.remove"
] | 958,104 | 958,105 | u721374917 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N), dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 1; i < N; i++) {
if (i == 1) {
dp[1] = abs(h[1] - h[0]);
continue;
}
int MIN = 100000;
int k = min(i, K)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N), dp(N, 0);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 1; i < N; i++) {
if (i == 1) {
dp[1] = abs(h[1] - h[0]);
continue;
}
int MIN = 1000000000;
int k = min(i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,112 | 958,113 | u401686269 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define MAX 100007
#define MOD 1000000007
long long frog(long long arr[], int n, int k) {
long long output[n + 1];
for (int i = 0; i < n; i++)
output[i] = INT_MAX;
output[0] = 0;
for (int i = 1; i < k; i++) {
for (int j = i - 1; j >= 0; j--) {
if (out... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100007
#define MOD 1000000007
long long frog(long long arr[], int n, int k) {
long long output[n + 1];
for (int i = 0; i < n; i++)
output[i] = INT_MAX;
output[0] = 0;
for (int i = 1; i < min(k, n); i++) {
for (int j = i - 1; j >= 0; j--) {
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 958,114 | 958,115 | u070400236 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using namespace std;
int n, k, a[100005], dp[100005];
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++) {
int b1 = 100000;
for (int j = 1; j <= k; j++) {
if (i -... | #include <algorithm>
#include <iostream>
using namespace std;
int n, k, a[100005], dp[100005];
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++) {
int b1 = 1000000005;
for (int j = 1; j <= k; j++) {
if ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,128 | 958,129 | u193834181 | 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] = {};
for (int i = 0; i < n; i++) {
dp[i] = 100000;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
fo... | #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] = {};
for (int i = 0; i < n; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
f... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,130 | 958,131 | u248172048 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
int x;
for (int i = 2; i < n; i++) {
x = IN... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
int x;
for (int i = 2; i < n; i++) {
x = IN... | [
"control_flow.loop.for.condition.change"
] | 958,142 | 958,143 | u407977226 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(n);
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int cos = 10000... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dp(n);
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int cos = INT_M... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,144 | 958,145 | u407977226 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int stones[n];
for (int i = 0; i < n; i++) {
cin >> stones[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[i] = mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int stones[n];
for (int i = 0; i < n; i++) {
cin >> stones[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = mi... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 958,146 | 958,147 | u034682738 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
#define unomap unordered_map
#define fi first
#define se second
#define pb push_back
#define mp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
#define unomap unordered_map
#define fi first
#define se second
#define pb push_back
#define mp... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,148 | 958,149 | u503230266 | cpp |
p03161 | #include <bits/stdc++.h>
#include <bitset>
#include <map>
#include <set>
#define rep(i, a, b) for (i = a; i < b; i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define lli long long int
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define db double
#define M 1000000007
#def... | #include <bits/stdc++.h>
#include <bitset>
#include <map>
#include <set>
#define rep(i, a, b) for (i = a; i < b; i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define lli long long int
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define db double
#define M 1000000007
#def... | [
"control_flow.loop.for.condition.change"
] | 958,152 | 958,153 | u529781102 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int frog(std::vector<int> v, int n, int k) {
int dp[100001] = {0};
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i <= n; i++) {
int ans = INT_MAX;
for (int j = 1; j <= k; j++) {
int a1 = 0;
if ((i - j) > 0) {
a1 = dp[i - j] + abs(v... | #include <bits/stdc++.h>
using namespace std;
int frog(std::vector<int> v, int n, int k) {
int dp[100001] = {0};
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i <= n; i++) {
int ans = INT_MAX;
for (int j = 1; j <= k; j++) {
int a1 = 0;
if ((i - j) >= 0) {
a1 = dp[i - j] + abs(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.continue.remove",
"control_flow.break.add"
] | 958,154 | 958,155 | u004244461 | cpp |
p03161 | #include <bits/stdc++.h>
#define endl "\n"
#define ioss \
ios::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
//#define int long long
typedef long long ll;
usin... | #include <bits/stdc++.h>
#define endl "\n"
#define ioss \
ios::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
//#define int long long
typedef long long ll;
usin... | [
"literal.number.change",
"assignment.value.change"
] | 958,158 | 958,159 | u849815280 | cpp |
p03161 | /*
Author: Qaseem Hasan alias Mikepayne14(Codeforces,Atcoder)
qaseem_hasan_ (Codechef,HackerRank,HackerEarth)
*/
#include <bits/stdc++.h>
using namespace std;
//---------------------------------------------------------
typedef long long int ll;
typedef unsigned long long int ull;
typedef ve... | /*
Author: Qaseem Hasan alias Mikepayne14(Codeforces,Atcoder)
qaseem_hasan_ (Codechef,HackerRank,HackerEarth)
*/
#include <bits/stdc++.h>
using namespace std;
//---------------------------------------------------------
typedef long long int ll;
typedef unsigned long long int ull;
typedef ve... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,173 | 958,174 | u649440112 | cpp |
p03161 | // INCLUDE
//------------------------------------------
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
// DEFINE
//------------------------------------------
#define ll long long
#define ALLv(a) (a).begin(), (a).... | // INCLUDE
//------------------------------------------
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
// DEFINE
//------------------------------------------
#define ll long long
#define ALLv(a) (a).begin(), (a).... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,179 | 958,180 | u334644046 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
#define N_MAX 100000
long long dp[N_MAX + 1];
long long N, K;
vector<long long> h;
int main(void) {
cin >> N >> K;
h.resize(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N + 1; i++)
dp[i] = N_MAX;
dp[0] = 0;
fo... | #include <iostream>
#include <vector>
using namespace std;
#define N_MAX 100000
long long dp[N_MAX + 1];
long long N, K;
vector<long long> h;
int main(void) {
cin >> N >> K;
h.resize(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
for (int i = 0; i < N + 1; i++)
dp[i] = 1000000000;
dp[0] = 0;
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 958,181 | 958,182 | u271951875 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int mn = INT_MAX;
int f(int a[], int n, int i, int c, int k) {
int cst[n];
cst[0] = 0;
cst[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int m = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) < 0)
break;
int u = abs(a[i] ... | #include <bits/stdc++.h>
using namespace std;
int mn = INT_MAX;
int f(int a[], int n, int i, int c, int k) {
int cst[n];
cst[0] = 0;
cst[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int m = INT_MAX;
for (int j = 1; j <= k; j++) {
if ((i - j) < 0)
break;
int u = abs(a[i] ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 958,183 | 958,184 | u082587844 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
/*bool subseq(string s,string t){
ll y=0;
for(ll i=0;y<s.size()&& i<t.size();i++){
if(s[y]==t[i]){
y++;
}
}
if(y==s.size())
return true;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void solve(ll a[], ll n, ll k) {
vector<ll> dp(n + 1, 100000000005);
ll c = 1;
dp[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = i - 1; c <= k && j >= 0; j--) {
dp[i] = min(dp[i], d... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"assignment.value.change"
] | 958,187 | 958,186 | u408648220 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
/*bool subseq(string s,string t){
ll y=0;
for(ll i=0;y<s.size()&& i<t.size();i++){
if(s[y]==t[i]){
y++;
}
}
if(y==s.size())
return true;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
void solve(ll a[], ll n, ll k) {
vector<ll> dp(n + 1, 100000000005);
ll c = 1;
dp[0] = 0;
for (ll i = 1; i < n; i++) {
for (ll j = i - 1; c <= k && j >= 0; j--) {
dp[i] = min(dp[i], d... | [
"literal.number.change",
"call.arguments.change"
] | 958,188 | 958,186 | u408648220 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long int
#define IOS ios_base::sync_with_stdio(false), cin.tie(NULL);
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define rf(j, b, a) for (int j = b; j >= a; j--)
#define frr(k, a, b) for (int k = a; k <= b; k++)
#define mp make_pair
#define pb push_back
#define MOD 100000... | #include <bits/stdc++.h>
#define int long long int
#define IOS ios_base::sync_with_stdio(false), cin.tie(NULL);
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define rf(j, b, a) for (int j = b; j >= a; j--)
#define frr(k, a, b) for (int k = a; k <= b; k++)
#define mp make_pair
#define pb push_back
#define MOD 100000... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,192 | 958,193 | u553066935 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9;
int main() {
long long int n, k, i, j, p;
cin >> n >> k;
long long int ar[n];
for (i = 0; i < n; i++) {
cin >> ar[i];
}
long long int dp[n];
memset(dp, mod, sizeof(dp));
dp[0] = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; j <=... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main() {
long long int n, k, i, j, p;
cin >> n >> k;
long long int ar[n];
for (i = 0; i < n; i++) {
cin >> ar[i];
}
long long int dp[n];
memset(dp, mod, sizeof(dp));
dp[0] = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; ... | [
"assignment.change"
] | 958,194 | 958,195 | u010509890 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long dp[100010];
int main() {
int N, K;
int h[100015];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
for (int... | #include <bits/stdc++.h>
using namespace std;
long long dp[100010];
int main() {
int N, K;
int h[100015];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = LLONG_MAX;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
for (i... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 958,200 | 958,201 | u530497183 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int x(int arr[], int dp[], int n, int k) {
dp[0] = 0;
for (int i = 0; i < k; i++)
dp[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
// cout<<arr[i];
int m = INT_MAX;
for (int j = i - k; j < i; j++)
m = min(m, dp[j] + abs(arr[j] - arr[i]... | #include <bits/stdc++.h>
using namespace std;
int x(int arr[], int dp[], int n, int k) {
dp[0] = 0;
for (int i = 0; i < k; i++)
dp[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
// cout<<arr[i];
int m = INT_MAX;
for (int j = i - k; j < i; j++)
m = min(m, dp[j] + abs(arr[j] - arr[i]... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 958,204 | 958,205 | u802332845 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll x = 1; x <= n; x++) {
cin >> ar[x];
}
ll dp[n + 1];
dp[1] = 0;
dp[2] = abs(ar[2] - ar[1]);
for (ll x = 3; x <= n; x++) {
ll r = INT_MAX;
for (ll y = x - 1; y ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
ll ar[n + 1];
for (ll x = 1; x <= n; x++) {
cin >> ar[x];
}
ll dp[n + 1];
dp[1] = 0;
dp[2] = abs(ar[2] - ar[1]);
for (ll x = 3; x <= n; x++) {
ll r = INT_MAX;
for (ll y = x - 1; y ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,225 | 958,226 | u460674262 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ld long double
#define M 1000000000
void printprecise(double l, ll precision) {
std::cout << std::fixed;
std::cout << std::setprecision(precision);
std::cout << l;
}
ll gcd(ll a, ll b) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ld long double
#define M 1000000000
void printprecise(double l, ll precision) {
std::cout << std::fixed;
std::cout << std::setprecision(precision);
std::cout << l;
}
ll gcd(ll a, ll b) {
if ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,229 | 958,228 | u460674262 | cpp |
p03161 | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace ... | #include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace ... | [
"expression.operation.binary.add"
] | 958,240 | 958,241 | u543083821 | cpp |
p03161 | #include <iostream>
#define INF 1000001
using namespace std;
int main() {
int n = 0, k = 0, buf1 = 0;
cin >> n >> k;
int *dp = new int[n + 1];
dp[0] = 0;
dp[1] = 0;
int *h = new int[k + 1];
h[0] = INF;
for (int i = 1; i < n + 1; ++i) {
cin >> buf1;
h[i] = buf1;
}
for (int i = 2; i < n + 1; ... | #include <iostream>
#define INF 1000001
using namespace std;
int main() {
int n = 0, k = 0, buf1 = 0;
cin >> n >> k;
int *dp = new int[n + 1];
dp[0] = 0;
dp[1] = 0;
int *h = new int[n + 1];
h[0] = INF;
for (int i = 1; i < n + 1; ++i) {
cin >> buf1;
h[i] = buf1;
}
for (int i = 2; i < n + 1; ... | [
"identifier.change",
"expression.operation.binary.change"
] | 958,254 | 958,255 | u545767478 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[100005];
int helper(int arr[], int i, int n, int k) {
if (i == n - 1) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
int ans = 100000;
for (int j = 1; j <= k; j++) {
if (i + j < n) {
ans = min(ans, helper(arr, i + j, n, k) + abs(ar... | #include <bits/stdc++.h>
using namespace std;
int dp[100005];
int helper(int arr[], int i, int n, int k) {
if (i == n - 1) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
int ans = 1e9;
for (int j = 1; j <= k; j++) {
if (i + j < n) {
ans = min(ans, helper(arr, i + j, n, k) + abs(arr[i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,262 | 958,263 | u214732904 | 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, 1e9 + 7);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K + 1; j++) {
if (j - i < 0)
break;
... | #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, 1e9 + 7);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K + 1; j++) {
if (i - j < 0)
break;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 958,271 | 958,272 | u832995587 | 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, 1e9 + 7);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K + 1; j++) {
if (j - 1 < 0)
break;
... | #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, 1e9 + 7);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K + 1; j++) {
if (i - j < 0)
break;
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,273 | 958,272 | u832995587 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
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> d(n, LONG_MAX);
d[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long n, k;
cin >> n >> k;
vector<long> h(n);
for (long i = 0; i < n; i++)
cin >> h[i];
vector<long> d(n, LONG_MAX);
d[0] = 0;
for (long i = 1; i < n; i++) {
for (long j = 0; j < k; j+... | [
"variable_declaration.type.primitive.change",
"control_flow.loop.for.initializer.change"
] | 958,281 | 958,282 | u812793098 | cpp |
p03161 | // Created by:Coding_lover(17-06-2020 09:50:41)
#include <bits/stdc++.h>
#define ll long long
#define FASTER \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | // Created by:Coding_lover(17-06-2020 09:50:41)
#include <bits/stdc++.h>
#define ll long long
#define FASTER \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [] | 958,286 | 958,287 | u408960947 | cpp |
p03161 | #include <climits>
#include <iostream>
using namespace std;
int min_cost(int height[], int n, int k) {
int dp[n];
dp[0] = 0;
for (int i = 2; 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(height[i] - height[i - j]));
}
}
retu... | #include <climits>
#include <iostream>
using namespace std;
int min_cost(int height[], int n, int k) {
int dp[n];
dp[0] = 0;
for (int 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(height[i] - height[i - j]));
}
}
retu... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 958,290 | 958,291 | u959838921 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int min(ll a, ll b) {
if (a < b)
return a;
return b;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n, 0);
int dp[100001];
for (int i = 0; i < 100001; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int min(ll a, ll b) {
if (a < b)
return a;
return b;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n, 0);
int dp[100001];
for (int i = 0; i < 100001; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
... | [
"control_flow.loop.for.condition.change"
] | 958,292 | 958,293 | u475972732 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k;
vector<int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
for (int i = n - 1; i >= 0; i--) {
dp[i] = INT_MAX;
for (int j = i + 1; j <= i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k;
vector<int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
for (int i = n - 2; i >= 0; i--) {
dp[i] = INT_MAX;
for (int j = i + 1; j <= i ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,294 | 958,295 | u845776743 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k;
vector<int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
for (int i = n - 1; i >= 0; i--) {
dp[i] = INT_MAX;
for (int j = i + 1; j <= i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, k;
vector<int> v;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
for (int i = n - 2; i >= 0; i--) {
dp[i] = INT_MAX;
for (int j = i + 1; j <= i ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 958,296 | 958,295 | u845776743 | cpp |
p03161 | #include <bits/stdc++.h>
#define input_vector(v, n) \
for (long long i = 0; i < n; i++) { \
cin >> v[i]; \
}
#define fastIO ... | #include <bits/stdc++.h>
#define input_vector(v, n) \
for (long long i = 0; i < n; i++) { \
cin >> v[i]; \
}
#define fastIO ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,320 | 958,321 | u249211191 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main() {
int n, k, h[100500];
cin >> n >> k;
rep(i, n) cin >> h[i];
int cost[100500] = {};
for (int i = 1; i < 100000; i++)
cost[i] = 2000... | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main() {
int n, k, h[100500];
cin >> n >> k;
rep(i, n) cin >> h[i];
int cost[100500] = {};
for (int i = 1; i < 100500; i++)
cost[i] = 1e9;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 958,322 | 958,323 | u018372223 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define M 10000... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define M 10000... | [
"control_flow.branch.if.condition.change"
] | 958,326 | 958,327 | u386025735 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll f(int h[], int n, int k) {
ll dp[n + 1] = {0};
dp[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++) {
ll inc = INT_MAX;
for (int j = 1; j <= min(j, k); j++) {
inc = min(inc, dp[i - j] + (ll)abs(h[i - 1] - h[i - j - 1]));... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll f(int h[], int n, int k) {
ll dp[n + 1] = {0};
dp[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++) {
ll inc = INT_MAX;
for (int j = 1; j <= min(i - 1, k); j++) {
inc = min(inc, dp[i - j] + (ll)abs(h[i - 1] - h[i - j - 1... | [
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 958,331 | 958,329 | u803248534 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for... | [
"variable_declaration.type.primitive.change",
"assignment.change"
] | 958,337 | 958,338 | u675446829 | cpp |
p03161 | #include <bits/stdc++.h>
typedef long long int ll;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define p... | #include <bits/stdc++.h>
typedef long long int ll;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define p... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,339 | 958,340 | u607303480 | cpp |
p03161 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef ... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef ... | [
"literal.number.type.widen.change"
] | 958,341 | 958,342 | u261538386 | cpp |
p03161 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef ... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus < 201703L
#pragma GCC target("avx")
#else
#pragma GCC target("avx2")
#endif
#endif
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef ... | [
"variable_declaration.type.change",
"literal.number.type.widen.change",
"literal.number.change",
"expression.operation.binary.change"
] | 958,343 | 958,342 | u261538386 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/********************************************************************/
#define M1 1000000007
#define M3 1000000009
#define M2 998244353
#define ll long long
#define pll pair<ll, ll>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPR(i, a, b) for (ll i = b - 1; i ... | #include <bits/stdc++.h>
using namespace std;
/********************************************************************/
#define M1 1000000007
#define M3 1000000009
#define M2 998244353
#define ll long long
#define pll pair<ll, ll>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPR(i, a, b) for (ll i = b - 1; i ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,351 | 958,350 | u228592906 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n, k;
cin >> n >> k;
ll dp[100005];
ll h[100005];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
dp[0] = 0;
if (k == 1) {
ll ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
ll n, k;
cin >> n >> k;
ll dp[100005];
ll h[100005];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
dp[i] = -1;
}
dp[0] = 0;
if (k == 1) {
ll ans = 0;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,352 | 958,353 | u491044700 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 958,358 | 958,359 | u038190565 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,360 | 958,359 | u038190565 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,361 | 958,359 | u038190565 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,362 | 958,359 | u038190565 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,363 | 958,359 | u038190565 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
long n;
long k;
cin >> n;
cin >> k;
vector<long> nums(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
nums[i] = x;
}
vector<long> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(nums[0] - nums[1]);
for (long i = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,364 | 958,359 | u038190565 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, h[1000200], dp[1000020], k;
long long fun(long long n) {
if (n <= 1)
return 0;
if (dp[n] != -1)
return dp[n];
dp[n] = fun(n - 1) + abs(h[n - 1] - h[n]);
for (long long x = n - 1; x >= n - k; x--)
dp[n] = min(dp[n], fun(x) + abs(h[n] - h[x]))... | #include <bits/stdc++.h>
using namespace std;
long long n, h[1000200], dp[1000020], k;
long long fun(long long n) {
if (n <= 1)
return 0;
if (dp[n] != -1)
return dp[n];
dp[n] = fun(n - 1) + abs(h[n - 1] - h[n]);
for (long long x = n - 1; x >= n - k && x > 0; x--)
dp[n] = min(dp[n], fun(x) + abs(h[n]... | [
"control_flow.loop.for.condition.change"
] | 958,365 | 958,366 | u152986325 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, h[100020], dp[100020], k;
long long fun(long long n) {
if (n <= 1)
return 0;
if (dp[n] != -1)
return dp[n];
dp[n] = fun(n - 1) + abs(h[n - 1] - h[n]);
for (long long x = n - 1; x >= n - k; x--)
dp[n] = min(dp[n], fun(x) + abs(h[n] - h[x]));
... | #include <bits/stdc++.h>
using namespace std;
long long n, h[1000200], dp[1000020], k;
long long fun(long long n) {
if (n <= 1)
return 0;
if (dp[n] != -1)
return dp[n];
dp[n] = fun(n - 1) + abs(h[n - 1] - h[n]);
for (long long x = n - 1; x >= n - k && x > 0; x--)
dp[n] = min(dp[n], fun(x) + abs(h[n]... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change"
] | 958,367 | 958,366 | u152986325 | cpp |
p03161 | using namespace std;
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define INFINITE 1e9 + 5
#define MOD 1000000007
#define MAXN 100001
#define pll pair<ll, ll>
#define pii pair<int, int>
int dp[MAXN];
int arr[MAXN];
int num, m;
int func(int ind) {
if (ind == num) {
return 0;... | using namespace std;
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define INFINITE 1e9 + 5
#define MOD 1000000007
#define MAXN 100001
#define pll pair<ll, ll>
#define pii pair<int, int>
int dp[MAXN];
int arr[MAXN];
int num, m;
int func(int ind) {
if (ind == num) {
return 0;... | [
"call.add",
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 958,368 | 958,369 | u836655051 | cpp |
p03161 | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | ///=======================///
/// coder: Andy - Tohrumi ///
///=======================///
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(); ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"call.add",
"call.arguments.add"
] | 958,370 | 958,371 | u340424586 | cpp |
p03161 | #include <bits/stdc++.h>
#include <sstream>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define rep(i, a, b) for (ll i = a; i <= b; ++i)
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define ull unsigned long long int
#define ll long long
#define all(a) a.begin(), a.end()
using namespa... | #include <bits/stdc++.h>
#include <sstream>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define rep(i, a, b) for (ll i = a; i <= b; ++i)
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define ull unsigned long long int
#define ll long long
#define all(a) a.begin(), a.end()
using namespa... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 958,376 | 958,377 | u513210134 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
ll dp[n + 1];
for (ll i = 0; i <= n; i++) {
dp[i] = 0;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
dp[i] = 1000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
ll dp[n + 1];
for (ll i = 0; i <= n; i++) {
dp[i] = 0;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
dp[i] = LLON... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,378 | 958,379 | u288901204 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
ll dp[n + 1];
for (ll i = 0; i <= n; i++) {
dp[i] = 0;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
dp[i] = 1000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
ll dp[n + 1];
for (ll i = 0; i <= n; i++) {
dp[i] = 0;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
dp[i] = LLON... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,380 | 958,379 | u288901204 | cpp |
p03161 | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long int N, K;
cin >> N >> K;
int h[N], cost[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int j = 2; j < N; j++) {
cost... | #include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N], cost[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int j = 2; j < N; j++) {
cost[j] =... | [
"variable_declaration.type.narrow.change",
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 958,386 | 958,387 | u214864255 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.