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 <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, K, arr[100000], dp[100000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> arr[i];
dp[i] = 1000000001;
}
dp[0] = 0;
int i, j;
for (i = 0; i < N; i++) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N, K, arr[100000], dp[100000];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> arr[i];
dp[i] = 1000000001;
}
dp[0] = 0;
int i, j;
for (i = 0; i < N; i++) {
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 959,364 | 959,365 | u069035199 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define faster ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cint \
int t; \
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define faster ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define cint \
int t; \
cin >> ... | [
"expression.operation.binary.remove"
] | 959,366 | 959,367 | u254775795 | cpp |
p03161 | #include <bits/stdc++.h>
#define F first
#define S second
#define ld long douroote
#define pb push_back
#define ll long long
#define INF 0x7f7f7f7f
#define sc(a) scanf("%d", &a)
#define scll(a) scanf("%I64d", &a)
#define scc(a) scanf(" %c", &a)
#define scs(a) scanf(" %s", a)
#define me(a, b) memset(a, b, sizeof a)
#def... | #include <bits/stdc++.h>
#define F first
#define S second
#define ld long douroote
#define pb push_back
#define ll long long
#define INF 0x7f7f7f7f
#define sc(a) scanf("%d", &a)
#define scll(a) scanf("%I64d", &a)
#define scc(a) scanf(" %c", &a)
#define scs(a) scanf(" %s", a)
#define me(a, b) memset(a, b, sizeof a)
#def... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,368 | 959,369 | u881144265 | cpp |
p03161 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#define ll long long
using namespace std;
ll factorial(ll n) {
if (n == 1 || n == 0)
return 1;
return n * factorial(n - 1);
}
int... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#define ll long long
using namespace std;
ll factorial(ll n) {
if (n == 1 || n == 0)
return 1;
return n * factorial(n - 1);
}
int... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 959,370 | 959,371 | u477542712 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
vector<int> cost(n, 100000);
for (int i = 0; i < n; ++i)
cin >> h[i];
cost[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
cost[j] ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
vector<int> cost(n, INT32_MAX);
for (int i = 0; i < n; ++i)
cin >> h[i];
cost[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n) {
cost[... | [
"call.arguments.change",
"io.output.change"
] | 959,376 | 959,377 | u124430580 | cpp |
p03161 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 200;
const ll inf = 1e14;
int n, k;
ll a[N], mem[N];
ll dp(int i) {
if (i == n - 1)
return 0;
if (i >= n)
return inf;
ll &ret = mem[i];
if (ret != -1)
return ret;
ret = inf;
for (int j = 1; j <= k; j++)
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 200;
const ll inf = 1e14;
int n, k;
ll a[N], mem[N];
ll dp(int i) {
if (i == n - 1)
return 0;
if (i >= n)
return inf;
ll &ret = mem[i];
if (ret != -1)
return ret;
ret = inf;
for (int j = 1; j <= k; j++)
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,378 | 959,379 | u130912106 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define N 100005
#define inf 1e18
using namespace std;
ll binomialCoeff(ll n, ll k);
ll power(ll x, ll y);
ll gcd(ll a, ll b) {
if (b == 0)
return... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define N 100005
#define inf 1e18
using namespace std;
ll binomialCoeff(ll n, ll k);
ll power(ll x, ll y);
ll gcd(ll a, ll b) {
if (b == 0)
return... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change"
] | 959,380 | 959,381 | u304472566 | cpp |
p03161 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], dp[n] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
dp[i] = 1e5;
for (int j = i - 1; j >= max(i - k, 0); j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
cout << d... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], dp[n] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
dp[i] = 1e9;
for (int j = i - 1; j >= max(i - k, 0); j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
cout << d... | [
"literal.number.change",
"assignment.value.change"
] | 959,382 | 959,383 | u851831516 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int a[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> a[i];
long long int dp[n + 2] = {0};
int i = 0, j = 0, q = 0;
for (int i = 2; i <= n; i++) {
long long int mi = 1000000000;
for (j = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int a[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> a[i];
long long int dp[n + 2] = {0};
int i = 0, j = 0, q = 0;
for (int i = 2; i <= n; i++) {
long long int mi = 1000000000;
for (j = 1... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,384 | 959,385 | u452579095 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k;
const int N = 1e5 + 5;
const int INF = 1e8;
int mem[N];
int h[N];
int frog(int i) {
if (i == n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
int ans = INF;
for (int j = 1; j <= k; j++) {
if (i + k < n)
ans = min(ans, abs(h[i] - h[i... | #include <bits/stdc++.h>
using namespace std;
int n, k;
const int N = 1e5 + 5;
const int INF = 2e9;
int mem[N];
int h[N];
int frog(int i) {
if (i == n - 1)
return 0;
if (mem[i] != -1)
return mem[i];
int ans = INF;
for (int j = 1; j <= k; j++) {
if (i + j < n)
ans = min(ans, abs(h[i] - h[i... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 959,388 | 959,387 | u452706738 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100010], h[100010];
int INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100010], h[100010];
int INF = 1LL << 60;
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
f... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 959,389 | 959,390 | u962609087 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100001];
int h[100001];
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100001];
int h[100001];
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 959,391 | 959,392 | u962609087 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1LL << 60
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100001];
int h[100001];
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dp[100001];
int h[100001];
signed main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 959,393 | 959,392 | u962609087 | cpp |
p03161 | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned short int us;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(15);
int n... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned short int us;
#define forn(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(15);
int n... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 959,394 | 959,395 | u179838120 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
int main() {
int n, k;
cin >> n >> k;
long long dp[n + 100];
int h[n + 100];
rep(i, n) { cin >> h[i + 1]; }
dp[1] = 0;
long long cost;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define _GLIBCXX_DEBUG
int main() {
int n, k;
cin >> n >> k;
long long dp[n + 100];
int h[n + 100];
rep(i, n) { cin >> h[i + 1]; }
dp[1] = 0;
long long cost;
for (int i ... | [
"literal.number.change",
"assignment.value.change"
] | 959,405 | 959,404 | u518042385 | cpp |
p03161 | #include "bits/stdc++.h"
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(v) v.begin(), v.end()
#define FS first
#define SC second
#define SZ(a) int((a).size... | #include "bits/stdc++.h"
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(v) v.begin(), v.end()
#define FS first
#define SC second
#define SZ(a) int((a).size... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 959,417 | 959,418 | u313403396 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, mn = 10000;
cin >> n >> m;
int a[n + 1];
for (int k = 1; k <= n; k++)
cin >> a[k];
int d[n + 1];
d[1] = 0;
d[0] = 0;
d[2] = abs(a[1] - a[2]);
for (int k = 3; k <= n; k++) {
mn = 10000;
if (m <= k - 1) {
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, mn = 1000000000;
cin >> n >> m;
int a[n + 1];
for (int k = 1; k <= n; k++)
cin >> a[k];
int d[n + 1];
d[1] = 0;
d[0] = 0;
d[2] = abs(a[1] - a[2]);
for (int k = 3; k <= n; k++) {
mn = 1000000000;
if (m <= k - 1) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 959,419 | 959,420 | u350462185 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j, m;
cin >> n >> k;
int h[n], c[n];
for (i = 0; i < n; i++) {
cin >> h[i];
c[i] = 99999;
}
c[0] = 0;
for (i = 0; i < n - 1; i++) {
for (j = 1; j <= k; j++) {
if (i + j < n) {
m = c[i] + abs(h[i + j] - h[i]);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j, m;
cin >> n >> k;
long int h[n], c[n];
for (i = 0; i < n; i++) {
cin >> h[i];
c[i] = 999999999;
}
c[0] = 0;
for (i = 0; i < n - 1; i++) {
for (j = 1; j <= k; j++) {
if (i + j < n) {
m = c[i] + abs(h[i + j]... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 959,421 | 959,422 | u723607904 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &x : h)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; i++) {
if (j < n) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &x : h)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {... | [
"identifier.change"
] | 959,425 | 959,426 | u700811072 | 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 P = pair<int, int>;
int abs(int a, int b) {
if (a >= b)
return a - b;
else
return b - a;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vect... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int abs(int a, int b) {
if (a >= b)
return a - b;
else
return b - a;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vect... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 959,427 | 959,428 | u164112876 | 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 P = pair<int, int>;
int abs(int a, int b) {
if (a >= b)
return a - b;
else
return b - a;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vect... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int abs(int a, int b) {
if (a >= b)
return a - b;
else
return b - a;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vect... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 959,429 | 959,428 | u164112876 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (int a = 1; a <= n; a++)
cin >> arr[a];
ll dp[n + 1];
dp[1] = 0;
for (int a = 2; a <= k... | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (int a = 1; a <= n; a++)
cin >> arr[a];
ll dp[n + 1];
dp[1] = 0;
for (int a = 2; a <= m... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 959,432 | 959,433 | u064666849 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (int a = 1; a <= n; a++)
cin >> arr[a];
ll dp[n + 1];
dp[1] = 0;
for (int a = 2; a <= k... | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (int a = 1; a <= n; a++)
cin >> arr[a];
ll dp[n + 1];
dp[1] = 0;
for (int a = 2; a <= m... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 959,434 | 959,433 | u064666849 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (ll i = n; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (ll i = n; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool c... | [
"call.add",
"call.arguments.change"
] | 959,437 | 959,438 | u272997285 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
vector<ll> dp(100, 1000000000);
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
for (int j = 1; j <= K; j++) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
vector<ll> dp(100000, 1000000000);
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
for (int j = 1; j <= K; j+... | [
"literal.number.change",
"call.arguments.change"
] | 959,445 | 959,444 | u964763428 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<ll> dp(100, 1000000000);
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
for (int j = 1; j <= K; j++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
vector<ll> dp(100000, 1000000000);
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
for (int j = 1; j <= K; j+... | [
"literal.number.change",
"call.arguments.change"
] | 959,446 | 959,444 | u964763428 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define mo 1000000009
using namespace std;
int main() {
ll n, mini, k;
cin >> n >> k;
ll a[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
mini = 100000;
for (ll j = i - 1; j >= i... | #include <bits/stdc++.h>
#define ll long long
#define mo 1000000009
using namespace std;
int main() {
ll n, mini, k;
cin >> n >> k;
ll a[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
mini = 10000000000;
for (ll j = i - 1; j... | [
"literal.number.change",
"assignment.value.change"
] | 959,456 | 959,457 | u349761723 | cpp |
p03161 | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const l... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const l... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 959,458 | 959,459 | u789157713 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e5 + 11;
typedef long long ll;
ll f[N], h[N];
int main() {
memset(f, 0x3f, sizeof f);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%lld", &h[i]);
f[1] = 0;
for (int i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e5 + 11;
typedef long long ll;
ll f[N], h[N];
int main() {
memset(f, 0x3f, sizeof f);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%lld", &h[i]);
f[1] = 0;
for (int i... | [
"control_flow.loop.for.condition.change"
] | 959,466 | 959,467 | u067001883 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n), dp(n);
rep(i, n) cin >> v[i];
dp[0] = 0;
rep1(i, 2, n) {
dp[i] = LONG_LONG_MAX;
... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
using ll = long long;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> v(n), dp(n);
rep(i, n) cin >> v[i];
dp[0] = 0;
rep1(i, 1, n) {
dp[i] = LONG_LONG_MAX;
... | [
"literal.number.change",
"call.arguments.change"
] | 959,474 | 959,475 | u624118226 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, k, i, j, ans;
long long a[2000001], dp[2000001];
main() {
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
dp[2] = abs(a[2] - a[1]);
for (i = 2; i <= n; i++) {
ans = 1e9;
for (j = 0; j < min(n, k); j++) {
ans = min(ans, dp[i - j] +... | #include <bits/stdc++.h>
using namespace std;
long long n, k, i, j, ans;
long long a[2000001], dp[2000001];
main() {
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
dp[2] = abs(a[2] - a[1]);
for (i = 2; i < n; i++) {
ans = 1e9;
for (j = 0; j < min(i, k); j++) {
ans = min(ans, dp[i - j] + ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"call.arguments.change"
] | 959,489 | 959,490 | u049755721 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long n, k, i, j, ans;
long long a[2000001], dp[2000001];
main() {
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
dp[2] = abs(a[2] - a[1]);
for (i = 2; i <= n; i++) {
ans = 1e9;
for (j = 0; j < k; j++) {
ans = min(ans, dp[i - j] + abs(a[i... | #include <bits/stdc++.h>
using namespace std;
long long n, k, i, j, ans;
long long a[2000001], dp[2000001];
main() {
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
dp[2] = abs(a[2] - a[1]);
for (i = 2; i < n; i++) {
ans = 1e9;
for (j = 0; j < min(i, k); j++) {
ans = min(ans, dp[i - j] + ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.add",
"call.arguments.change"
] | 959,491 | 959,490 | u049755721 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k = 2, a[100001], dp[100001];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
dp[i] = 1e9;
cin >> a[i];
if (i == 1) {
dp[i] = 0;
continue;
}
for (int j = 1; j <= k; j++)
if (i - j > 0)
dp[i] = min(dp[i], dp[i - ... | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
dp[i] = 1e9;
cin >> a[i];
if (i == 1) {
dp[i] = 0;
continue;
}
for (int j = 1; j <= k; j++)
if (i - j > 0)
dp[i] = min(dp[i], dp[i -... | [
"expression.operation.binary.add"
] | 959,492 | 959,493 | u630713695 | cpp |
p03161 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100000);
rep(i, n) cin >> h[i];
vector<int> cost(100000,... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100000);
rep(i, n) cin >> h[i];
vector<int> cost(100000,... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 959,496 | 959,497 | u445457059 | cpp |
p03161 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> cost(n, 1 << 20);... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100000);
rep(i, n) cin >> h[i];
vector<int> cost(100000,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 959,500 | 959,497 | u445457059 | cpp |
p03161 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100000);
rep(i, n) cin >> h[i];
vector<int> cost(100000,... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100000);
rep(i, n) cin >> h[i];
vector<int> cost(100000,... | [
"literal.number.change",
"call.arguments.change"
] | 959,496 | 959,501 | u445457059 | cpp |
p03161 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> cost(n, 1 << 20);... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100000);
rep(i, n) cin >> h[i];
vector<int> cost(100000,... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 959,500 | 959,501 | u445457059 | cpp |
p03161 | #include <bits/stdc++.h>
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define PI 3.141592653589793238462... | #include <bits/stdc++.h>
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define PI 3.141592653589793238462... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,504 | 959,505 | u203396615 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define mx 200005
#define mod 1000000007
#define mxm 999999999999
using namespace std;
ll dp[mx];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a[mx], i, n, k, j;
cin >> n >> k;
for (i = 1; i < n + 1; i++)
cin >> a[i];
dp[1] = 0;
/*dp[2... | #include <bits/stdc++.h>
#define ll long long
#define mx 200005
#define mod 1000000007
#define mxm 999999999999
using namespace std;
ll dp[mx];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a[mx], i, n, k, j;
cin >> n >> k;
for (i = 1; i < n + 1; i++)
cin >> a[i];
dp[1] = 0;
/*dp[2... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,506 | 959,507 | u720296041 | cpp |
p03161 | /*
- 20.3.2
B - Frog 2
Atcoder-Educational DP Contest-B - Frog 2
20.3.2-Atcoder-Educational DP Contest-B - Frog 2-
-
-
-
*/
#include <bits/stdc++.h>
using namespace std;
int f[100010], h[100010];
int n, k;
int main() {
cin >> n >> k >> h[1];
f[1] = 0;
for (... | /*
- 20.3.2
B - Frog 2
Atcoder-Educational DP Contest-B - Frog 2
20.3.2-Atcoder-Educational DP Contest-B - Frog 2-
-
-
-
*/
#include <bits/stdc++.h>
using namespace std;
int f[100010], h[100010];
int n, k;
int main() {
cin >> n >> k >> h[1];
f[1] = 0;
for (... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.add"
] | 959,510 | 959,511 | u244314173 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define trace(x) cerr << #x << " : " << x << endl;
ll max(ll a, ll b) { return (a > b ? a : b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k;
cin >> n >> k;
ll a[n + 1], c[n + 1] = {0};
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define trace(x) cerr << #x << " : " << x << endl;
ll max(ll a, ll b) { return (a > b ? a : b); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k;
cin >> n >> k;
ll a[n + 1], c[n + 1] = {0};
for (int i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,514 | 959,515 | u755134895 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <class T> inline boo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <class T> inline boo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 959,516 | 959,517 | u538125576 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <class T> inline boo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using itn = int;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
template <class T> inline boo... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,518 | 959,519 | u538125576 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 入力
int N, K;
lo... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 入力
int N, K;
lo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,525 | 959,526 | u840823723 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
dp[i] = 100000;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
for (int kk = 1; kk <= k; ++kk) {
if (i - k... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
int arr[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
dp[i] = 10000000000;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
for (int kk = 1; kk <= k; ++kk) {
if (... | [
"literal.number.change",
"assignment.value.change"
] | 959,538 | 959,535 | u012046378 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f first
#define s second
#define Mp make_pair
#define pb push_back
#define Lb lower_bound
#define Ub upper_bound
#define all(x) x.begin(), x.end()
#define fast_io ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int Maxn = 10... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define f first
#define s second
#define Mp make_pair
#define pb push_back
#define Lb lower_bound
#define Ub upper_bound
#define all(x) x.begin(), x.end()
#define fast_io ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int Maxn = 10... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,545 | 959,546 | u608076382 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define NEUT 100000
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int h[MAXN];
int dp[MAXN];
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
h[i] = x;
}
dp[n] = 0;
/*
for(int i = n ... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define NEUT 1000000000
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int h[MAXN];
int dp[MAXN];
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
h[i] = x;
}
dp[n] = 0;
/*
for(int i ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,547 | 959,548 | u670715721 | cpp |
p03161 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | [
"literal.number.change",
"assignment.value.change"
] | 959,557 | 959,558 | u638661457 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1], minarr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
minarr[1] = 0;
minarr[2] = abs(arr[2] - arr[1]);
// cout<<minarr[2]<<minarr[3]<<endl;
for (int i = 3; i <= n; i++) {
minarr[i] = 1000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n + 1], minarr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
minarr[1] = 0;
minarr[2] = abs(arr[2] - arr[1]);
// cout<<minarr[2]<<minarr[3]<<endl;
for (int i = 3; i <= n; i++) {
minarr[i] = INT_... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 959,559 | 959,560 | u977858417 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int N;
long long h[110000];
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
for (int i = 0; i < 110000; ++i)
dp[i] = ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1LL << 60;
int N;
long long h[110000];
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
for (int i = 0; i < 110000; ++i)
dp[i] = ... | [
"assignment.change"
] | 959,563 | 959,564 | u447096097 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
int main() {
int N, K;
cin >> N >> K;
vector<long long> H(N);
for (int i = 0; i < N; ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
int main() {
int N, K;
cin >> N >> K;
vector<long long> H(N);
for (int i = 0; i < N; ... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 959,565 | 959,566 | u055685044 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int min(int &a, int &b) { return a < b ? a : b; }
void pre_calc(int n, int k, vector<int> &V, vector<int> &dp) {
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
int pos = i - j;
if (pos < 0)
break;
dp[i]... | #include <iostream>
#include <vector>
using namespace std;
int min(int &a, int &b) { return a < b ? a : b; }
void pre_calc(int n, int k, vector<int> &V, vector<int> &dp) {
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
int pos = i - j;
if (pos < 0)
break;
dp[i]... | [
"identifier.change",
"call.arguments.change"
] | 959,577 | 959,578 | u358037627 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long int ll;
const int N = 1e5 + 5, M = 1e4 + 5;
int n, k, a[N], memo[N][105];
int solve(int ind, int c) {
if (~memo[ind][c])
return memo[ind][c];
if (ind == n - 1)
return memo[ind][c] = abs(a[ind] - a[ind - c]);
i... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long int ll;
const int N = 1e5 + 5, M = 1e4 + 5;
int n, k, a[N], memo[N][105];
int solve(int ind, int c) {
if (~memo[ind][c])
return memo[ind][c];
if (ind == n - 1)
return memo[ind][c] = abs(a[ind] - a[ind - c]);
i... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 959,579 | 959,580 | u445305910 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long h[n], a[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
a[0] = 0;
a[1] = abs(h[0] - h[1]);
for (long long i = 2; i < k; i++) {
long long s = INT_MAX;
for (long long j = 1; j <= i; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long h[n], a[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
a[0] = 0;
a[1] = abs(h[0] - h[1]);
for (long long i = 2; i < min(n, k); i++) {
long long s = INT_MAX;
for (long long j = 1; j <= i; j... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 959,581 | 959,582 | u746339181 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"variable_declaration.type.change"
] | 959,583 | 959,584 | u195054737 | cpp |
p03161 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
int dp[100000];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 100000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
int dp[100000];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + a... | [
"literal.number.change",
"assignment.value.change"
] | 959,592 | 959,593 | u195054737 | cpp |
p03161 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define all(v) ((v).begin()), ((v).end())
#define rall(v) ((v).rbegin()), ((v).rend())
#define clr(v, line) memset(v, line, sizeof(v))
#define endl '\n'
#define TRACE
#ifdef TRACE
#define trace(...) __... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define all(v) ((v).begin()), ((v).end())
#define rall(v) ((v).rbegin()), ((v).rend())
#define clr(v, line) memset(v, line, sizeof(v))
#define endl '\n'
#define TRACE
#ifdef TRACE
#define trace(...) __... | [
"call.remove"
] | 959,602 | 959,603 | u555865264 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int mem[100050];
int main()
{
int a[100050];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
mem[n - 1] = abs(a[n] - a[n - 1]);
mem[n] = 0;
for (int i = n - 2; i > 0; i--) {
mem[i] = 100050;
for (int j = 1; j <= k; j++) ... | #include <bits/stdc++.h>
using namespace std;
int mem[100050];
int main()
{
int a[100050];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
mem[n - 1] = abs(a[n] - a[n - 1]);
mem[n] = 0;
for (int i = n - 2; i > 0; i--) {
mem[i] = INT_MAX;
for (int j = 1; j <= k; j++)... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,604 | 959,605 | u202518254 | cpp |
p03161 | #include <algorithm>
#include <cstdint>
#include <iostream>
int const NMAX = 100000;
int n, k;
uint32_t h[NMAX];
uint32_t dp[NMAX];
void read() {
std::cin >> n;
std::cin >> k;
for (int i = 0; i < n; ++i)
std::cin >> h[i];
}
inline uint32_t iabs(int x) { return x < 0 ? -x : x; }
void calc() {
dp[0] = 0;
... | #include <algorithm>
#include <cstdint>
#include <iostream>
int const NMAX = 100000;
int n, k;
uint32_t h[NMAX];
uint32_t dp[NMAX];
void read() {
std::cin >> n;
std::cin >> k;
for (int i = 0; i < n; ++i)
std::cin >> h[i];
}
inline uint32_t iabs(int x) { return x < 0 ? -x : x; }
void calc() {
dp[0] = 0;
... | [
"control_flow.loop.for.condition.change"
] | 959,606 | 959,607 | u294638337 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define stuff \
ios::sync_with_stdio(0); \
cin.tie(0)
#define INF 100007
ll abso(ll x) { return (x > 0) ? x : -1 * x; }
int main(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define stuff \
ios::sync_with_stdio(0); \
cin.tie(0)
#define INF 1e9 + 5
ll abso(ll x) { return (x > 0) ? x : -1 * x; }
int main... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 959,608 | 959,609 | u564037510 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int INF = 256;
cin >> N >> K;
vector<int> H(N);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++)
cin >> H.at(i);
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < min(K, i) + 1; j++) {
dp.at(i) = min(dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
int INF = INT_MAX;
cin >> N >> K;
vector<int> H(N);
vector<int> dp(N, INF);
for (int i = 0; i < N; i++)
cin >> H.at(i);
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < min(K, i) + 1; j++) {
dp.at(i) = mi... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,612 | 959,613 | u627325970 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#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> in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#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> in... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 959,614 | 959,615 | u159695843 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#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> in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#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> in... | [
"preprocessor.define.value.change",
"literal.float.change",
"variable_declaration.type.change"
] | 959,616 | 959,615 | u159695843 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
static const int MAX_N = 100000;
static const int MAX_h = 10000;
int main(void) {
int n, k;
int H[MAX_N];
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
// dp[i][j]は足場i-jから足場iに移る場合のiまでの最小コスト
int dp[n][k];
for (int i = 0; ... | #include <cmath>
#include <iostream>
using namespace std;
static const int MAX_N = 100000;
static const int MAX_h = 100000000000;
int main(void) {
int n, k;
int H[MAX_N];
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> H[i];
}
// dp[i][j]は足場i-jから足場iに移る場合のiまでの最小コスト
int dp[n][k];
for (int ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 959,622 | 959,621 | u900688325 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#includ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 959,623 | 959,624 | u640997954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define out(ans) cout << ans << endl
#define in(n) cin >> n
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define floopi(i, j, N) for (ll j = i + 1; j < N; j++)
template <class T> inline bool chmin(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define out(ans) cout << ans << endl
#define in(n) cin >> n
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define floopi(i, j, N) for (ll j = i + 1; j < N; j++)
template <class T> inline bool chmin(T... | [
"assignment.change"
] | 959,636 | 959,637 | u789673251 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define out(ans) cout << ans << endl
#define in(n) cin >> n
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define floopi(i, j, N) for (ll j = i + 1; j < N; j++)
template <class T> inline bool chmin(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define out(ans) cout << ans << endl
#define in(n) cin >> n
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define floopi(i, j, N) for (ll j = i + 1; j < N; j++)
template <class T> inline bool chmin(T... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 959,636 | 959,638 | u789673251 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 959,681 | 959,682 | u103850114 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 959,683 | 959,682 | u103850114 | cpp |
p03161 | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define fi first
#define se second
#define for1(i, n) for (int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for (int i = (int)l; i <= (int)r; ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fored(i, l, r) for (int i = (... | #include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < (int)n; ++i)
#define fi first
#define se second
#define for1(i, n) for (int i = 1; i <= (int)n; ++i)
#define fore(i, l, r) for (int i = (int)l; i <= (int)r; ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fored(i, l, r) for (int i = (... | [
"literal.number.change",
"expression.operation.binary.change"
] | 959,690 | 959,691 | u118290687 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
int dp[100];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
rep(i, 100) dp[i] = 1e6;
dp[0] = 0;
for (int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
typedef long long ll;
int dp[100010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
rep(i, 100010) dp[i] = 1e9;
dp[0] = 0;
fo... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change",
"assignment.value.change"
] | 959,696 | 959,697 | u862412671 | cpp |
p03161 | #include <iostream>
using namespace std;
const int INF = 114514;
int h[100005];
int dp[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i + j >= n)
... | #include <iostream>
using namespace std;
const long long INF = 1145141919810;
int h[100005];
long long dp[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
if (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 959,712 | 959,713 | u590427200 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T b)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> inline bool chmax(T &a, T b)... | [
"control_flow.branch.if.condition.change"
] | 959,722 | 959,723 | u328179672 | cpp |
p03161 | // includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
template <cl... | // includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
template <cl... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,724 | 959,725 | u193690465 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
if (n == 2) {
cout << dp[1] << endl;
return 0;
}
for (int i = 2; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
if (n == 2) {
cout << dp[1] << endl;
return 0;
}
for (int i = 2; i < n; i++) ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,730 | 959,731 | u302818391 | cpp |
p03161 | #include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
int *h = new int[n];
int *dp = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
... | #include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, k;
cin >> n >> k;
int *h = new int[n];
int *dp = new int[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,732 | 959,733 | u534223360 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { c... | #include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { c... | [
"literal.number.change",
"call.arguments.change"
] | 959,734 | 959,735 | u170622357 | cpp |
p03161 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
const int INF = 1e5;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
vector<int> dp(N... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
const int INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
vector<int> dp(N... | [
"literal.number.change",
"variable_declaration.value.change"
] | 959,738 | 959,739 | u811967730 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int6... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int6... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,742 | 959,743 | u785492958 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100000];
int dp[100000];
int recur(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
else {
dp[i] = recur(i + 1) + abs(a[i] - a[i + 1]);
for (int j = 2; j <= k; j++) {
if (i + j < n) {
dp[i] = min(dp[i], r... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100000];
int dp[100000];
int recur(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
else {
dp[i] = recur(i + 1) + abs(a[i] - a[i + 1]);
for (int j = 2; j <= k; j++) {
if (i + j < n) {
dp[i] = min(dp[i], r... | [
"assignment.change"
] | 959,745 | 959,746 | u083367057 | cpp |
p03161 | // https://atcoder.jp/contests/dp/tasks/dp_b
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REPL(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define radrad(a) 180.0 * a / M_PI
#define pow(x) x *x
static const int... | // https://atcoder.jp/contests/dp/tasks/dp_b
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REPL(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define radrad(a) 180.0 * a / M_PI
#define pow(x) x *x
static const int... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.arguments.change"
] | 959,749 | 959,750 | u488878376 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100001], n, k;
ll solve(int arr[], int idx) {
if (idx >= n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = solve(arr, idx + 1) + abs(arr[idx] - arr[idx + 1]);
for (int i = idx + 1; i <= idx + k; i++)
dp[idx] = min(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100001], n, k;
ll solve(int arr[], int idx) {
if (idx >= n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = solve(arr, idx + 1) + abs(arr[idx] - arr[idx + 1]);
for (int i = idx + 1; i <= idx + k && i < n; i++)
dp[id... | [
"control_flow.loop.for.condition.change"
] | 959,761 | 959,762 | u423214530 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector... | #include <bits/stdc++.h>
using namespace ::std;
typedef long long lint;
typedef long long ll;
typedef long double ldouble;
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<double> dvec;
typedef vector<vector<double>> dmat;
typedef vector<vector<vector... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,763 | 959,764 | u127065752 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<long long>
#define endl "\n"
int main() {
ll n, k;
cin >> n >> k;
vi dp(n, INT_MAX), a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
dp[n - 1] = 0;
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
// for(int i=n-3;i>=n-k;i--)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<long long>
#define endl "\n"
int main() {
ll n, k;
cin >> n >> k;
vi dp(n, INT_MAX), a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
dp[n - 1] = 0;
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i... | [
"control_flow.loop.for.condition.change"
] | 959,771 | 959,772 | u511499944 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 1e9;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 0;
for (int i = idx + 1; i <= idx + k; i++)
dp[idx] = min(dp[idx], cal(i) + abs(a[idx] - a[i]));
... | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], dp[100001];
int cal(int idx) {
if (idx == n)
return 0;
if (idx > n)
return 1e9;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = 1e9;
for (int i = idx + 1; i <= idx + k; i++)
dp[idx] = min(dp[idx], cal(i) + abs(a[idx] - a[i]));
... | [
"literal.number.change",
"assignment.value.change"
] | 959,785 | 959,786 | u848964569 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long int
#define vi vector<long long int>
#define vvi vector<vll>
#define vs vector<string>
#define vsf v.begin(),... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#define ll long long int
#define vi vector<long long int>
#define vvi vector<vll>
#define vs vector<string>
#define vsf v.begin(),... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 959,787 | 959,788 | u163525690 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
int a[100010];
int dp[100010] = {0};
int min = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
int a[100010];
int dp[100010] = {0};
int min = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 959,794 | 959,795 | u003026289 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
int a[100010];
int dp[100010] = {0};
int min = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
int a[100010];
int dp[100010] = {0};
int min = 1000000007;
cin >> n >> k;
for (int i = 0; i < n; i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operator.compare.change"
] | 959,797 | 959,795 | u003026289 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int a[100010], f[100010];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
for (int i = 2; i <= n; i++) {
f[i] = 0x7fffffff;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
f... | #include <cmath>
#include <iostream>
using namespace std;
int a[100010], f[100010];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[1] = 0;
for (int i = 2; i <= n; i++) {
f[i] = 0x7fffffff;
for (int j = 1; j <= k; j++) {
if (i - j <= 0)
break;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,800 | 959,801 | u052815054 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define N 40
#define K 300005
#define MOD 1e9 + 7
#define int long long
#def... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define N 40
#define K 300005
#define MOD 1e9 + 7
#define int long long
#def... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,802 | 959,803 | u269279722 | cpp |
p03161 | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int min(int n1, int n2) {
if (n1 > n2)
return n2;
else
return n1;
}
long int reach(int i, int a[], int memo[], int k) {
if (i < 2)
return 100000;
if (i == 2)
return 0;
if (memo[i] != -1)
return memo[i];
else {
int q = 100000, j... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
int min(int n1, int n2) {
if (n1 > n2)
return n2;
else
return n1;
}
long int reach(int i, int a[], int memo[], int k) {
if (i < 2)
return 1000000000;
if (i == 2)
return 0;
if (memo[i] != -1)
return memo[i];
else {
long int q = ... | [
"literal.number.change",
"function.return_value.change",
"variable_declaration.type.widen.change",
"variable_declaration.value.change"
] | 959,810 | 959,811 | u212014611 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 959,817 | 959,816 | u641446860 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N, K;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[10010];
for (int i = 1; i <= N; i++) {
dp[i] = 1e18;
}
dp[1] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
int h[100010];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
int dp[100010];
for (int i = 1; i <= N; i++) {
dp[i] = 1e18;
}
dp[1] = 0;
for (int i = 1; i < N; i++) {
for (int j = ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 959,818 | 959,819 | u376649520 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < k; i++) {
int m = INT_MAX;
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < k && i < n; i++) {
int m = INT_MAX;
for (int j... | [
"control_flow.loop.for.condition.change"
] | 959,824 | 959,825 | u356063349 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < k; i++) {
int m = INT_MAX;
for (int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < k && i < n; i++) {
int m = INT_MAX;
for (int j... | [
"control_flow.loop.for.condition.change"
] | 959,826 | 959,827 | u356063349 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define endl '\n'
#define int long long
typedef long long li;
const int N = 1e5 + 10;
int n;
int a[N];
int dp[N];
int k;
int solve(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != INT_M... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
#define endl '\n'
#define int long long
typedef long long li;
const int N = 1e5 + 10;
int n;
int a[N];
int dp[N];
int k;
int solve(int i) {
if (i >= n - 1)
return 0;
if (dp[i] != INT_M... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,836 | 959,837 | u487128874 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = (a); i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = (a); i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 959,844 | 959,845 | u495903598 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = a; i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, a, b) for (int i = (a); i < (b); ++i)
#define reprev(i, n) for (int i = n - 1; i >= 0; --i)
#define reprrev(i, a, b) for (int i = b - 1; i >= (a); --i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 959,846 | 959,845 | u495903598 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pairll = pair<ll, ll>;
#define ABS(x) ((x) > 0 ? (x) : -(x))
ll gcd(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
if (a < b)
swap(a, b);
ll tmp = a % b;
while (tmp != 0) {
a = b;
b = tmp;
tmp = a % b;
}
return b;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pairll = pair<ll, ll>;
#define ABS(x) ((x) > 0 ? (x) : -(x))
ll gcd(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
if (a < b)
swap(a, b);
ll tmp = a % b;
while (tmp != 0) {
a = b;
b = tmp;
tmp = a % b;
}
return b;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,854 | 959,855 | u195036695 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i < n + 1; i++)
cin >> a[i];
vector<int> dp(n + 1, 0);
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (ll i = 3; i <= n; i++) {
ll b = 100001;
for (ll l = 1; l <= k; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i < n + 1; i++)
cin >> a[i];
vector<int> dp(n + 1, 0);
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (ll i = 3; i <= n; i++) {
ll b = 10000000001;
for (ll l = 1; l <... | [
"literal.number.change",
"variable_declaration.value.change"
] | 959,876 | 959,877 | u287619443 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.