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 <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] =... | #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] =... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 958,388 | 958,387 | u214864255 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return (a < b) ? a : b; }
int abso(int a) {
if (a < 0)
return a * (-1);
return a;
}
int main() {
int n, k;
cin >> n >> k;
long long int a[n], b[n];
int mini = 100001;
b[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[... | #include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return (a < b) ? a : b; }
int abso(int a) {
if (a < 0)
return a * (-1);
return a;
}
int main() {
int n, k;
cin >> n >> k;
long long int a[n], b[n];
unsigned long long int mini = 10000000001;
b[0] = 0;
for (int i = 0; i < n; i++) {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,389 | 958,390 | u182263149 | cpp |
p03161 | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | // Harjot Singh Student NIT JALANDHAR
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"variable_declaration.name.change",
"identifier.change",
"variable_declaration.type.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,391 | 958,392 | u487912105 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define M 1000000007
#define pb push_back
#define boost \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define M 1000000007
#define pb push_back
#define boost \
ios::sync_with_stdio(false); \
cin.tie(0); ... | [
"variable_declaration.value.change"
] | 958,404 | 958,405 | u371335822 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - k) < 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) < 0)
... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,406 | 958,407 | u131496190 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[M... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> tup;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[M... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 958,414 | 958,415 | u119477929 | cpp |
p03161 | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end... | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end... | [
"call.remove"
] | 958,422 | 958,423 | u491084584 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 999999999999;
int main() {
int n, k;
cin >> n >> k;
int a[n + 5];
ll dp[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = maxn;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 9999999999999;
int main() {
int n, k;
cin >> n >> k;
int a[n + 5];
ll dp[n + 5];
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = maxn;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 958,426 | 958,427 | u795353302 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int DP[100001];
signed main() {
int n, k;
cin >> n >> k;
int H[n + 1];
for (int i = 1; i <= n; i++)
cin >> H[i];
DP[n] = 0;
DP[n - 1] = abs(H[n] - H[n - 1]);
for (int i = n - 2; i >= 1; i--) {
DP[i] = INT_MAX;
int g = i +... | #include <bits/stdc++.h>
#define int long long int
using namespace std;
int DP[100001];
signed main() {
int n, k;
cin >> n >> k;
int H[n + 1];
for (int i = 1; i <= n; i++)
cin >> H[i];
DP[n] = 0;
DP[n - 1] = abs(H[n] - H[n - 1]);
for (int i = n - 2; i >= 1; i--) {
DP[i] = INT_MAX;
int g = min... | [
"call.add",
"call.arguments.add"
] | 958,428 | 958,429 | u795378930 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int getMinimumCost(int *arr, int i, int n, int k) {
int cost[n];
cost[0] = 0;
cost[1] = abs(arr[0] - arr[1]) + cost[0];
int minimum;
for (int i = 2; i < n; i++) {
minimum = abs(arr[i - 1] - arr[i]) + cost[i - 1];
for (int j = i - 2; j != -1 && j >= i - k; ... |
#include <bits/stdc++.h>
using namespace std;
int getMinimumCost(int *arr, int i, int n, int k) {
int cost[n];
cost[0] = 0;
cost[1] = abs(arr[0] - arr[1]) + cost[0];
int minimum;
for (int i = 2; i < n; i++) {
minimum = abs(arr[i - 1] - arr[i]) + cost[i - 1];
for (int j = i - 2; j != -1 && j >= i - k;... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 958,432 | 958,433 | u102364535 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chkMin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int num;
int k;
cin >> num >> k;
long long dp[num];
long long h[num];
for (int i = 0; i < num; i++)
cin >> h[i];
for (int... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chkMin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int num;
int k;
cin >> num >> k;
long long dp[num + k];
long long h[num + k];
for (int i = 0; i < num; i++)
cin >> h[i];
... | [
"control_flow.loop.for.condition.change"
] | 958,442 | 958,443 | u367131219 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long double LD;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b... | #include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
typedef long double LD;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P = pair<int, int>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 958,455 | 958,456 | u825601908 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f(i, x, n) \
; \
for (ll i = x; i < n; i++)
int main() {
ll n, k;
cin >> n >> k;
ll H[n];
f(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f(i, x, n) \
; \
for (ll i = x; i < n; i++)
int main() {
ll n, k;
cin >> n >> k;
ll H[n];
f(... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 958,457 | 958,458 | u097652443 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define vll vector<ll>
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define f(i, n) for (int i = 0; i < n; ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ff first
#define ss second
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define vll vector<ll>
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define f(i, n) for (int i = 0; i < n; ++i)
... | [
"literal.number.change",
"assignment.value.change"
] | 958,459 | 958,460 | u741958141 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,465 | 958,466 | u381652180 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int stone[n];
int cam[n];
for (int i = 0; i < n; i++) {
int a;
cin >> a;
stone[i] = a;
}
cam[0] = 0;
for (int i = 1; i < n; i++) {
int g = 1;
int c2 = 100000;
while (g <= k && i - g >= 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int stone[n];
int cam[n];
for (int i = 0; i < n; i++) {
int a;
cin >> a;
stone[i] = a;
}
cam[0] = 0;
for (int i = 1; i < n; i++) {
int g = 1;
int c2 = 1000000000;
while (g <= k && i - g >= 0) {
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,467 | 958,468 | u318991795 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int n, k, a[100010], dp[100010];
int main() {
scanf("%d%d", &n, &k);
memset(dp, 63, sizeof(dp));
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
dp[1] = 0;
for (int i ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int n, k, a[100010], dp[100010];
int main() {
scanf("%d%d", &n, &k);
memset(dp, 63, sizeof(dp));
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
}
dp[1] = 0;
for (int i ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,469 | 958,470 | u207528513 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(100000);
dp[0] = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(2147483647);
dp[0] = 0;
for (int i ... | [
"literal.number.change",
"call.arguments.change"
] | 958,481 | 958,482 | u136910493 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(10000);
dp[0] = 0;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(2147483647);
dp[0] = 0;
for (int i ... | [
"literal.number.change",
"call.arguments.change"
] | 958,483 | 958,482 | u136910493 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100001> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100001> dp;
dp.fill(10000);
dp[0] = 0;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
int k;
cin >> n >> k;
array<int, 100000> stone;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
stone[i] = x;
}
array<int, 100000> dp;
dp.fill(2147483647);
dp[0] = 0;
for (int i ... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.off_by_one"
] | 958,484 | 958,482 | u136910493 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,489 | 958,490 | u681559222 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one"
] | 958,491 | 958,490 | u681559222 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,492 | 958,490 | u681559222 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define F(i, a, b) for (i = a; i <= b; i++)
#define RF(i, a, b) for (i = a; i >= b; i--)
#define sz(a) sizeof(a)
using namespace std;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef unordered_map<int, ... | #include <bits/stdc++.h>
#define ll long long
#define F(i, a, b) for (i = a; i <= b; i++)
#define RF(i, a, b) for (i = a; i >= b; i--)
#define sz(a) sizeof(a)
using namespace std;
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef unordered_map<int, ... | [
"expression.operation.binary.add"
] | 958,493 | 958,494 | u488674276 | cpp |
p03161 | #pragma GCC optimize( \
"Ofast") // Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio ... | #pragma GCC optimize( \
"Ofast") // Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define fastio ... | [
"call.arguments.change"
] | 958,495 | 958,496 | u990746416 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int x = 999;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
long long int x ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,506 | 958,507 | u526313609 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int x = 999;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
vector<long long int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[1] = fabs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
long long int x ... | [
"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,508 | 958,507 | u526313609 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
f... | [
"call.add",
"call.arguments.change"
] | 958,509 | 958,510 | u990210936 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = v[1] - v[0];
for (i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i, x;
vector<ll> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
ll dp[n + 7];
for (i = 0; i < n + 7; i++) {
dp[i] = LLONG_MAX;
}
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
f... | [
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,511 | 958,510 | u990210936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int NMAX = 100000;
int MAX = 10000;
int main() {
int N, K;
cin >> N >> K;
int h[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
h[i] = 0;
for (int i = 1; i <= N; i++)
cin >> h[i];
int dp[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
dp[i] = MAX;
dp... | #include <bits/stdc++.h>
using namespace std;
int NMAX = 100000;
int MAX = 1000000000;
int main() {
int N, K;
cin >> N >> K;
int h[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
h[i] = 0;
for (int i = 1; i <= N; i++)
cin >> h[i];
int dp[NMAX + 1];
for (int i = 0; i <= NMAX; i++)
dp[i] = MAX;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,512 | 958,513 | u153849197 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | [
"literal.number.change",
"call.arguments.change"
] | 958,514 | 958,515 | u088608223 | cpp |
p03161 | /********************************************/ /**
****** Author: Shivam Kejriwal
******************
****** Handle: techno_phyle
... | /********************************************/ /**
****** Author: Shivam Kejriwal
******************
****** Handle: techno_phyle
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 958,518 | 958,519 | u790460842 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO ... | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO ... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,522 | 958,523 | u850655153 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO ... | #include "bits/stdc++.h"
using namespace std;
#define F first
#define S second
#define show(x) cout << #x << " " << x << " ";
#define f(i, j, k) for (int i = j; i <= k; i++)
#define fr(i, j, k) for (int i = j; i >= k; i--)
#define ll long long
#define all(A) A.begin(), A.end()
#define FIO ... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 958,524 | 958,523 | u850655153 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define ma 1e18
int main() {
lli n, i, j, k;
lli dp[100001];
for (i = 3; i <= 100000; i++) {
dp[i] = ma;
}
dp[0] = 0;
dp[1] = 0;
cin >> n >> k;
lli a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] -... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define ma 1e18
int main() {
lli n, i, j, k;
lli dp[100001];
for (i = 3; i <= 100000; i++) {
dp[i] = ma;
}
dp[0] = 0;
dp[1] = 0;
cin >> n >> k;
lli a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[2] = abs(a[2] -... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,525 | 958,526 | u696946433 | cpp |
p03161 | // B.cpp
// Date: 24:01:17 19 05 2020
// Author: bonelord
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << "[(" << __LINE__ << ") " << #x << " ]: " << x << "\n"
#define dbg_arr(x, sz) \
cerr << "[(" << __LINE__ << ") |" << sz << "| " << #x <<... | // B.cpp
// Date: 24:01:17 19 05 2020
// Author: bonelord
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << "[(" << __LINE__ << ") " << #x << " ]: " << x << "\n"
#define dbg_arr(x, sz) \
cerr << "[(" << __LINE__ << ") |" << sz << "| " << #x <<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,527 | 958,528 | u169961099 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long int dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j]... | #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 int dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = m... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,531 | 958,532 | u043951827 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = m... | #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 int dp[n];
fill(dp, dp + n, 1e9);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= min(k, n - i - 1); j++) {
dp[i + j] = m... | [
"expression.operation.binary.remove",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,533 | 958,532 | u043951827 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min... | [] | 958,534 | 958,535 | u130433563 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= min... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,536 | 958,535 | u130433563 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
int solve(vector<int> ar, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = inf;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(ar[i] - ar[j]) + dp[j]);
}
}
return ... | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
int solve(vector<int> ar, int n, int k) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = inf;
for (int j = i - 1; j >= 1 && (i - j) <= k; j--) {
dp[i] = min(dp[i], abs(ar[i] - ar[j]) + dp[j]);
}
}
return ... | [
"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,541 | 958,542 | u581270308 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n, k;
scanf("%d", &n);
scanf("%d", &k);
vector<int> h(n);
for (int &x : h) {
scanf("%d", &x);
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 958,547 | 958,548 | u306697932 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, *p, *dp;
cin >> n;
cin >> k;
p = new long long[n];
for (long long y = 0; y < n; y++) {
cin >> p[y];
}
dp = new long long[n];
dp[0] = 0;
dp[1] = abs(p[1] - p[0]);
for (long long i = 2; i < n; i++) {
long long minimo =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, *p, *dp;
cin >> n;
cin >> k;
p = new long long[n];
for (long long y = 0; y < n; y++) {
cin >> p[y];
}
dp = new long long[n];
dp[0] = 0;
dp[1] = abs(p[1] - p[0]);
for (long long i = 2; i < n; i++) {
long long minimo =... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 958,551 | 958,552 | u341690718 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define i_os ... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define i_os ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 958,557 | 958,558 | u785364941 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int h[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + abs(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,563 | 958,564 | u040996097 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, l, i, k, res;
long long dp[100009];
long long a[100009];
long long f(int x) {
if (x == 0)
return 0;
if (dp[x] != LONG_MAX)
return dp[x];
for (int j = 1; j <= k && x - j >= 0; j++)
dp[x] = min(abs(a[x] - a[x - j]) + f(x - j), dp[x]);
return dp[x]... | #include <bits/stdc++.h>
using namespace std;
int n, l, i, k, res;
long long dp[100009];
long long a[100009];
long long f(int x) {
if (x == 0)
return 0;
if (dp[x] != LONG_MAX)
return dp[x];
for (int j = 1; j <= k && x - j >= 0; j++)
dp[x] = min(abs(a[x] - a[x - j]) + f(x - j), dp[x]);
return dp[x]... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,576 | 958,577 | u107882959 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int minn... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
int h[n];
rep(i, n) cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int minn... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,580 | 958,581 | u416458858 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT32_MAX), h(n);
for (int ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT32_MAX), h(n);
for (int ... | [
"control_flow.loop.for.condition.change"
] | 958,697 | 958,698 | u530350853 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 3; i <= n; i++)
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
c... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 958,703 | 958,704 | u422780284 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 3; i <= n; i++)
for (int j = max(0, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
c... | #include <bits/stdc++.h>
using namespace std;
int n, a[100001], dp[100001], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], dp[i] = 1000000000;
dp[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = max(1, i - k); j < i; j++)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
c... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 958,705 | 958,704 | u422780284 | cpp |
p03161 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
void memset(ll *arr, int n, ll value) {
for (int i = 0; i < n; i++) {
arr[i] = value;
}
}
int main() {
ios_base::sync_w... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
typedef long long int ll;
ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }
void memset(ll *arr, int n, ll value) {
for (int i = 0; i < n; i++) {
arr[i] = value;
}
}
int main() {
ios_base::sync_w... | [
"literal.number.change",
"call.arguments.change"
] | 958,708 | 958,709 | u578632265 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int high[MAXN];
int dp[MAXN]; //跳到石头编号为i的最小花费
int n, k;
int main() {
cin >> n >> k;
memset(dp, 0, sizeof(dp))... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
const int MAXN = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int high[MAXN];
int dp[MAXN]; //跳到石头编号为i的最小花费
int n, k;
int main() {
cin >> n >> k;
memset(dp, 0, sizeof(dp))... | [
"control_flow.loop.for.condition.change"
] | 958,717 | 958,718 | u937152385 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
int dp[n];
for (i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - i; j >= max(i - k, 0); j--) {
dp[i] = min(dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int a[n];
int dp[n];
for (i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (j = i - 1; j >= max(i - k, 0); j--) {
dp[i] = min(dp... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 958,721 | 958,722 | u614629416 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = 1e5 + 1;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll h[n], dp[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = 1e16 + 1;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 958,725 | 958,726 | u074479727 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n, k;
cin >> n >> k;
ll int a[n];
for (ll int i = 0; i < n; i++)
cin >> a[i];
ll int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
if (n > 1)
dp[1] = abs(a[1] - a[0]);
// cout<<dp[1]<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll int n, k;
cin >> n >> k;
ll int a[n];
for (ll int i = 0; i < n; i++)
cin >> a[i];
ll int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
if (n > 1)
dp[1] = abs(a[1] - a[0]);
// cout<<dp[1]<... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 958,734 | 958,735 | u322729493 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define MOD 1e9 + 7;
using ll = long long;
using namespace std;
int h[100010];
int dp[100010] = {0};
int main() {
int N, K;
cin >> N >> K;
rep1(i, N) cin >> h[i];
rep1(i, N) {
if (i == 1... | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define MOD 1e9 + 7;
using ll = long long;
using namespace std;
int h[100010];
int dp[100010] = {0};
int main() {
int N, K;
cin >> N >> K;
rep1(i, N) cin >> h[i];
rep1(i, N) {
if (i == 1... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,740 | 958,741 | u099619676 | cpp |
p03161 | /*.....Bismillahir Rahmanir Rahim.....*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#defi... | /*.....Bismillahir Rahmanir Rahim.....*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <unordered_map>
#include <vector>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#defi... | [
"expression.operation.binary.remove"
] | 958,744 | 958,745 | u931901821 | cpp |
p03161 | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | /*
╔═══╦═══╦═══╗
║╔═╗║╔══╩╗╔╗║
║║░║║╚══╗║║║║
║║░║║╔══╝║║║║
║╚═╝║╚══╦╝╚╝║
╚══╗╠═══╩═══╝
░░░╚╝░░░░░░░░
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define PI acos(-1.0)
#define vi vector<int>
#define vii vector<vi>
#define vll vector<ll>
#define mid(s,... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 958,746 | 958,747 | u288568295 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ma 100000
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> ans(n, ma);
ans[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= k; j++) {
if (i + j >= n)
brea... | #include <bits/stdc++.h>
using namespace std;
#define ma 1e9
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> ans(n, ma);
ans[0] = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= k; j++) {
if (i + j == n)
break;
... | [
"preprocessor.define.value.change",
"literal.float.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,748 | 958,749 | u298291365 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int const inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> const w = [&] {
vector<int> w(n);
for (auto &i : w) {
cin >> i;
}
return w;
}();
auto cost = [&](int i, int j... | #include <bits/stdc++.h>
using namespace std;
int const inf = 0x3f3f3f3f;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> const w = [&] {
vector<int> w(n);
for (auto &i : w) {
cin >> i;
}
return w;
}();
auto cost = [&](int i, int j... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,774 | 958,775 | u857390364 | 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 + 1];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT_MAX;
for (int i = 1; i < n; i++) {
for (int j = 0; j < k; j++) {
if (i - k ... | #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 + 1];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT_MAX;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condit... | 958,793 | 958,794 | u527398664 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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 <= n; i++) {
dp[i] = 1e7;
for... | #include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
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 <= n; i++) {
dp[i] = 1e18;
fo... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 958,797 | 958,796 | u862953056 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
ll h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
ll h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,812 | 958,813 | u800717823 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
int h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vi vector<int>
#define vll vector<long long>
#define FOR(n) for (int i = 0; i < n; i++)
#define till(n) for (int i = 1; i <= n; i++)
#define mod 1000000007
using namespace std;
ll h[100005], k;
ll dp[100005];
ll getAns(int n) {
if (n == 0)
... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,814 | 958,813 | u800717823 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); ... | [
"expression.operation.binary.remove"
] | 958,829 | 958,830 | u533654879 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
// ll dp[100001];
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
int dp[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
// dp[i]=-1;
}
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int t = k;
if ... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
// ll dp[100001];
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
ll dp[n + 1];
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
// dp[i]=-1;
}
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int t = k;
if (... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 958,835 | 958,834 | u539406723 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int minCost(vector<int> &heights, int k) {
int n = heights.size();
vector<int> dp(n, 1e9 + 5);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], abs(heights[i] - heights[j... | #include <iostream>
#include <vector>
using namespace std;
int minCost(vector<int> &heights, int k) {
int n = heights.size();
vector<int> dp(n, 1e9 + 5);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], abs(heights[i] - heights[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,841 | 958,842 | u638254110 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++) {
cin >> heights[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < K; j++) ... | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++) {
cin >> heights[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j <= i + K; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,843 | 958,844 | u638254110 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != -1) {
return cost[n];
} else if (k == 1) {
cost[... | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != -1) {
return cost[n];
} else if (k == 1) {
cost[... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,847 | 958,848 | u212696921 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != 9223372036854775807) {
return cost[n];
} else if (k ... | #include <bits/stdc++.h>
using namespace std;
long long a[200010];
long long cost[200010];
long long n, k;
long long solve(long long n) {
long long i, j;
if (n == 1) {
return 0;
} else if (n == 2) {
return abs(a[1] - a[2]);
} else if (cost[n] != -1) {
return cost[n];
} else if (k == 1) {
cost[... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 958,849 | 958,848 | u212696921 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (in... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,852 | 958,853 | u456352227 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> arr[i - 1];
}
int dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[0]);
for (int i = 3; i <= n; i++) {
int temp = INT_MAX;
for (in... | [
"control_flow.loop.for.condition.change"
] | 958,854 | 958,853 | u456352227 | cpp |
p03161 |
#include <iostream>
#define INT_MX 20000
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int heights[n], dp[n];
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[n - 1] = 0;
dp[n - 2] = abs(heights[n - 2] - heights[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MX;
for (i... | #include <iostream>
#define INT_MX 2147483646
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int heights[n], dp[n];
for (int i = 0; i < n; i++)
cin >> heights[i];
dp[n - 1] = 0;
dp[n - 2] = abs(heights[n - 2] - heights[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MX;
fo... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 958,855 | 958,856 | u658659166 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, begin, end) for (int i = begin; i < (end); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int dp[100005];
rep(i, 2, n) {
int diff = abs(a[i] - a[i - 1])... | #include <bits/stdc++.h>
#define rep(i, begin, end) for (int i = begin; i < (end); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
int dp[100005];
rep(i, 1, n) {
int diff = abs(a[i] - a[i - 1])... | [
"literal.number.change",
"call.arguments.change"
] | 958,862 | 958,863 | u259578308 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, k;
cin >> n >> k;
long long h[n + 1], dp[n + 1] = {0}, j;
h[0] = 0;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i == 2)
dp[2] = abs(h[i] - h[i - 1]) + dp[i - 1];
el... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, k;
cin >> n >> k;
long long h[n + 1], dp[n + 1] = {0}, j;
h[0] = 0;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = 0;
for (i = 2; i <= n; i++) {
if (i == 2)
dp[2] = abs(h[i] - h[i - 1]) + dp[i - 1];
el... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,872 | 958,873 | u519412059 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int go(int *a, int n, int k, int *output) {
if (n <= 1)
return 0;
if (output[n - 1] != -1)
return output[n - 1];
int i = 1;
int mn = INT_MAX;
for (int i = 1; i <= k; i++) {
int value = abs(a[0] - a[i]);
int ans = go(a + i, n ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int go(int *a, int n, int k, int *output) {
if (n <= 1)
return 0;
if (output[n - 1] != -1)
return output[n - 1];
int i = 1;
int mn = INT_MAX;
for (i = 1; i <= k && i < n; i++) {
int value = abs(a[0] - a[i]);
int ans = go(a + ... | [
"control_flow.loop.for.condition.change"
] | 958,878 | 958,879 | u774784826 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
// dp [i] denotes the cost to reach step i.
dp[1] = 0;
for (int i = 2; i <= k + 1; i++)
dp[i] = abs(h[i] - h[1]);
for... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
// dp [i] denotes the cost to reach step i.
dp[1] = 0;
for (int i = 2; i <= min(k + 1, n); i++)
dp[i] = abs(h[i] - h... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 958,912 | 958,913 | u333958848 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
// i番目に到達するために必要なコストの最小値をdp[i]とする。
int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = 1000000000;
}
// dpテーブルの初期化
dp[1] = 0;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
// i番目に到達するために必要なコストの最小値をdp[i]とする。
int dp[n + 5];
for (int i = 0; i < n + 5; i++) {
dp[i] = 1000000000;
}
// dpテーブルの初期化
dp[1] = ... | [
"control_flow.loop.for.condition.change"
] | 958,914 | 958,915 | u882039496 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int nature(ll a) { //絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
int main() {
ll N, K, h[N], dp[N], ans;
cin >> N >> K; //足場の個数N//何個先まで飛べるかK
for (ll i = 0; i < N; i++) { //各足場の高さ
cin >> h[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int nature(ll a) { //絶対値を返す
if (a >= 0) {
return (a);
} else {
return (-1 * a);
}
}
int main() {
ll N, K, h[100010], dp[100010], ans;
cin >> N >> K; //足場の個数N//何個先まで飛べるかK
for (ll i = 0; i < N; i++) { //各足場の高さ
cin >> ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 958,930 | 958,931 | u121974081 | cpp |
p03161 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author shadowreaper810
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
const int MOD = 1000000007;
class BFrog2 {
pub... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author shadowreaper810
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
const int MOD = 1000000007;
class BFrog2 {
pub... | [
"assignment.change"
] | 958,942 | 958,943 | u923152767 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[10010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j <= 1)
cont... | #include <bits/stdc++.h>
using namespace std;
int dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j < 0)
cont... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change"
] | 958,946 | 958,947 | u702686470 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[10010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j < 1)
conti... | #include <bits/stdc++.h>
using namespace std;
int dp[100010];
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
for (int i = 0; i < n - 1; ++i) {
dp[i + 1] = dp[i] + abs(h[i + 1] - h[i]);
for (int j = 0; j < k; ++j) {
if (i - j < 0)
cont... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 958,948 | 958,947 | u702686470 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int arr[N];
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int dp[N] = {0};
dp[N - 1] = abs(arr[N - 2] - arr[N - 1]);
for (int i = N - 2; i >= 0; i--) {
int j = i + 1;
int minval = INT_MAX;
while (j < N &... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int arr[N];
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int dp[N] = {0};
dp[N - 2] = abs(arr[N - 2] - arr[N - 1]);
for (int i = N - 2; i >= 0; i--) {
int j = i + 1;
int minval = INT_MAX;
while (j < N &... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 958,957 | 958,958 | u060407800 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, K;
cin >> n >> K;
int height[n];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n, 1e4 + 1);
dp[0] = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod = 998244353;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, K;
cin >> n >> K;
int height[n];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 958,961 | 958,960 | u459654533 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 10... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 20... | [
"literal.number.change",
"assignment.value.change"
] | 958,965 | 958,963 | u125669112 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 10... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K;
vector<int> high(N);
for (int i = 0; i < N; i++) {
cin >> high.at(i);
}
vector<int> cost(N);
cost.at(0) = 0;
cost.at(1) = abs(high.at(1) - high.at(0));
for (int i = 2; i < N; i++) {
M = 73... | [
"literal.number.change",
"assignment.value.change"
] | 958,965 | 958,966 | u125669112 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 10e9;
ll power(ll a, ll b, ll d) {
if (b == 0) {
return 1;
} else if (a % 2 == 0) {
return power((a * a) % d, b / 2, d);
} else {
return (a * power((a * a) % d, (b - 1) / 2, d)) % d;
}
}
ll x, y, z;
void exteneded(ll a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 10e9;
ll power(ll a, ll b, ll d) {
if (b == 0) {
return 1;
} else if (a % 2 == 0) {
return power((a * a) % d, b / 2, d);
} else {
return (a * power((a * a) % d, (b - 1) / 2, d)) % d;
}
}
ll x, y, z;
void exteneded(ll a, ... | [
"literal.number.change",
"call.arguments.change"
] | 958,967 | 958,968 | u295185739 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int dp[200000];
int h[200000];
int n, k;
cin >> n >> k;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int j = 1; j < k + 2; j++) {
dp[j] ... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int dp[200000];
int h[200000];
int n, k;
cin >> n >> k;
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
for (int j = 1; j < k + 2; j++) {
dp[j] ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,973 | 958,974 | u063962277 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1];
arr[0] = 0;
for (long long i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (long long i = 2; i <= n; i++) {
long long ans = 100000000000;
for (l... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 1];
arr[0] = 0;
for (long long i = 1; i <= n; i++)
cin >> arr[i];
long long dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (long long i = 2; i <= n; i++) {
long long ans = 100000000000;
for (l... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change"
] | 958,979 | 958,980 | u426156439 | cpp |
p03161 | #include <assert.h> /*確認*/
#include <ctype.h> /*文字操作*/
#include <limits.h> /*限界*/
#include <math.h> /*計算*/
#include <stdbool.h> /*bool型*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
//---------------------------------------------------
#define rep(i, n) for (int i =... | #include <assert.h> /*確認*/
#include <ctype.h> /*文字操作*/
#include <limits.h> /*限界*/
#include <math.h> /*計算*/
#include <stdbool.h> /*bool型*/
#include <stdio.h> /*入出力*/
#include <stdlib.h> /*標準ライブラリ*/
#include <string.h> /*文字列*/
//---------------------------------------------------
#define rep(i, n) for (int i =... | [
"literal.number.change",
"assignment.value.change"
] | 958,981 | 958,982 | u484407086 | cpp |
p03161 | #include <stdio.h>
#define ABS(a) ((a) > (0) ? (a) : -(a))
long long min(long long a, long long b) { return a > b ? b : a; }
long long rec(long long i, long long *H, long long K, long long *memo) {
if (i == 0)
return memo[0] = 0;
if (i - 2 < 0)
return memo[1] = ABS(H[i - 1] - H[i]);
if (memo[i] != -1)
... | #include <stdio.h>
#define ABS(a) ((a) > (0) ? (a) : -(a))
long long min(long long a, long long b) { return a > b ? b : a; }
long long rec(long long i, long long *H, long long K, long long *memo) {
if (i == 0)
return memo[0] = 0;
if (i - 2 < 0)
return memo[1] = ABS(H[i - 1] - H[i]);
if (memo[i] != -1)
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 958,983 | 958,984 | u020604402 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int mincost(int a[], int n, int k) {
int dp[100001] = {0}, i, j;
for (i = 2; i <= n; i++) {
int x, y;
int ans = abs(a[i] - a[i - 1]) + dp[i - 1];
for (j = 2; j <= k; j++) {
if (i - j > 0)
x = abs(a[i] - a[i - j])... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int mincost(int a[], int n, int k) {
int dp[100001] = {0}, i, j;
for (i = 2; i <= n; i++) {
int x, y;
int ans = abs(a[i] - a[i - 1]) + dp[i - 1];
for (j = 2; j <= k; j++) {
if (i - j > 0) {
x = abs(a[i] - a[i - j... | [] | 958,985 | 958,986 | u994223613 | cpp |
p03161 | #include <iostream>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
LL dp[N];
fill(dp, dp + N, 1 << 61);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j >= 0) {
... | #include <iostream>
using namespace std;
using LL = long long;
int main() {
int N, K;
cin >> N >> K;
int H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
LL dp[N];
fill(dp, dp + N, 1L << 61);
dp[0] = 0L;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j >= 0) ... | [
"literal.number.type.widen.change"
] | 958,999 | 959,000 | u131000248 | cpp |
p03161 | /// *********** Coded by Olium_MdioxideN ***********
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define ext exit(0)
#define fast ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define newl p... | /// *********** Coded by Olium_MdioxideN ***********
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define ext exit(0)
#define fast ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define newl p... | [
"expression.operation.binary.add"
] | 959,003 | 959,004 | u845745781 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i < n +... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i < n +... | [
"assignment.change"
] | 959,005 | 959,006 | u347950677 | cpp |
p03161 | /************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 23 Apr 2020
*/
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NUL... | /************
* @Just Another Source code by: ankit.sangwan1999
* @created on: 23 Apr 2020
*/
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NUL... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,010 | 959,011 | u808647942 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a < b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,012 | 959,013 | u101048376 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[100001];
for (int i = 0; i < N; i++)
cin >> h[i + 1];
int dp[100001];
dp[1] = 0;
for (int i = 2; i <= N; i++) {
int cost[K + 1];
for (int j = 1; j <= K && i - j > 0; j++) {
cost[j] = dp[i - j] + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[100001];
for (int i = 0; i < N; i++)
cin >> h[i + 1];
int dp[100001];
dp[1] = 0;
for (int i = 2; i <= N; i++) {
int cost[K + 1];
for (int j = 1; j <= K && i - j > 0; j++) {
cost[j] = dp[i - j] + ... | [
"variable_declaration.name.change",
"identifier.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.conditio... | 959,014 | 959,015 | u824859165 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 959,016 | 959,017 | u613945234 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mod 1000000007
ll gcd(ll a, ll b) {
if (b > a)
swap(a, b);
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 959,016 | 959,018 | u613945234 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.