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 <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n, k;
std::cin >> n >> k;
int a[n], dp[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= k; j++) {
... | #include <iostream>
int abs(int a) { return (a > 0) ? a : -a; }
int main() {
int n, k;
std::cin >> n >> k;
int a[n], dp[n];
for (int i = 0; i < n; i++)
std::cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 2; j <= k; j++) {
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.bi... | 959,882 | 959,883 | u387880194 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 5;
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fr(i, l, m) for (int i = l; i < m; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll pwr(ll x, ll y)... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 5;
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fr(i, l, m) for (int i = l; i < m; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll pwr(ll x, ll y)... | [
"assignment.change"
] | 959,887 | 959,888 | u131085615 | cpp |
p03161 | #include <bits/stdc++.h>
#define el_cucuy \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
const llong mxn = 1e6 + 7;
const llong mod... | #include <bits/stdc++.h>
#define el_cucuy \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
const llong mxn = 1e6 + 7;
const llong mod... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 959,893 | 959,894 | u122292453 | cpp |
p03161 | #include <bits/stdc++.h>
#define el_cucuy \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
const llong mxn = 1e6 + 7;
const llong mod... | #include <bits/stdc++.h>
#define el_cucuy \
ios_base::sync_with_stdio(0), cout.tie(0); \
cin.tie(0);
#define llong long long
#define pb push_back
#define bpc __builtin_popcount
const llong mxn = 1e6 + 7;
const llong mod... | [
"control_flow.loop.for.initializer.change"
] | 959,895 | 959,896 | u122292453 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
for (int i = 1; i <= k; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
for (int i = 1; i <= k; i++)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,900 | 959,901 | u694116078 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
for (int i = 1; i <= k; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = 0;
for (int j = 2; j <= n; j++) {
for (int i = 1; i <= k; i++)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,902 | 959,901 | u694116078 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> d... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> d... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 959,907 | 959,908 | u340010271 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[100005];
long long dp[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie();
int N, a, k;
cin >> N >> k;
for (int i = 0; i < N + 1; i++)
dp[i] = 100009; // set value
for (int i = 0; i < N; i++) {
cin >> a;
cost[i] = a;
}
dp[... | #include <bits/stdc++.h>
using namespace std;
int cost[100005];
int dp[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie();
int N, a, k;
cin >> N >> k;
for (int i = 0; i < N + 1; i++)
dp[i] = 1000000002; // set value
for (int i = 0; i < N; i++) {
cin >> a;
cost[i] = a;
}
dp[0] = 0;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"assignment.value.change"
] | 959,917 | 959,918 | u507814996 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int cost[100005];
int dp[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie();
int N, a, k;
cin >> N >> k;
for (int i = 0; i < N + 1; i++)
dp[i] = 100009; // set value
for (int i = 0; i < N; i++) {
cin >> a;
cost[i] = a;
}
dp[0] = 0;
f... | #include <bits/stdc++.h>
using namespace std;
int cost[100005];
int dp[100005];
int main() {
ios::sync_with_stdio(0);
cin.tie();
int N, a, k;
cin >> N >> k;
for (int i = 0; i < N + 1; i++)
dp[i] = 1000000002; // set value
for (int i = 0; i < N; i++) {
cin >> a;
cost[i] = a;
}
dp[0] = 0;
... | [
"literal.number.change",
"assignment.value.change"
] | 959,919 | 959,918 | u507814996 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
int main() {
int n, k;
cin >> n >> k;
i64 a[n], dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = 100000;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j ... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
int main() {
int n, k;
cin >> n >> k;
i64 a[n], dp[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = INT_MAX;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,923 | 959,924 | u644295564 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int min_cost(int *arr, int n, int k) {
int *dp = new int[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; ++i) {
int temp = INT_MAX;
for (int j = 1; j <= k && (i - j) >= 0; ++j) {
temp = min(temp, abs(arr[i] - a... | #include <bits/stdc++.h>
using namespace std;
int min_cost(int *arr, int n, int k) {
int *dp = new int[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; ++i) {
int temp = INT_MAX;
for (int j = 1; j <= k && (i - j) > 0; ++j) {
temp = min(temp, abs(arr[i] - ar... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,925 | 959,926 | u169602617 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define flp(i, a, b) for (int i = a; i < b; i++)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define flp(i, a, b) for (int i = a; i < b; i++)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 959,931 | 959,932 | u667598788 | cpp |
p03161 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n], dp[n + 1] = {0};
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 2e9;
for (int j = 1; j <= min(i, k); ++j) {... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n], dp[n + 1] = {0};
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 2e9;
for (int j = 1; j <= min(i, k); ++j) {... | [
"expression.operation.binary.add"
] | 959,933 | 959,934 | u774724188 | cpp |
p03161 | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n], dp[n + 1] = {0};
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 2e9;
for (int j = 1; j < min(i, k); ++j) {
... | #include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n], dp[n + 1] = {0};
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 2e9;
for (int j = 1; j <= min(i, k); ++j) {... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,935 | 959,934 | u774724188 | cpp |
p03161 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,936 | 959,937 | u550014122 | cpp |
p03161 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.add"
] | 959,938 | 959,937 | u550014122 | cpp |
p03161 | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int minimum;
int n, k;
cin >> n >> k;
if (k >= n)
k = n - 1;
int h[n];
int ans[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans[0] = 0;
for (int i = 1; i < k; i++) {
ans[i] = abs(h[0] - h[i]);
}
for ... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
int minimum;
long int n, k;
cin >> n >> k;
if (k >= n)
k = n - 1;
int h[n];
int ans[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ans[0] = 0;
for (int i = 1; i < k; i++) {
ans[i] = abs(h[0] - h[i]);
}
... | [
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,948 | 959,949 | u489264263 | cpp |
p03161 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K;
int h[100001];
long long dp[100001];
long long INF = 1LL << 60;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= N; i++) {
long lon... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K;
int h[100001];
long long dp[100001];
long long INF = 1LL << 60;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[1] - h[2]);
// ループごとにdp[i]を計算
for (int i = 3; i <= N;... | [
"control_flow.loop.for.condition.change"
] | 959,950 | 959,951 | u790272146 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, minn;
cin >> n >> k;
int dp[n], h[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
minn = 32767;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
if (dp[i - j] + abs(h[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
long int minn;
cin >> n >> k;
int dp[n], h[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
minn = 2147483647;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
if (dp[... | [
"literal.number.change",
"assignment.value.change"
] | 959,954 | 959,953 | u421029744 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | [
"control_flow.loop.for.condition.change"
] | 959,959 | 959,960 | u427236648 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 100000000;
typedef long long ll;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n + 5];
rep(i, n) { cin >> h[i]; }
ll dp[n + 5];
for (int i = 0; i < n; i++) {
dp[i] = inf;
}
dp[0]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define inf 10000000000000;
typedef long long ll;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n + 100];
rep(i, n) { cin >> h[i]; }
ll dp[n + 100];
for (int i = 0; i < n; i++) {
dp[i] = inf;
}... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 959,964 | 959,962 | u950411977 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long INF = 1e18;
int main() {
int n, k;
cin >> n >> k;
int h[n + 100];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[100010];
for (int i = 0; i < 10000; i++)
dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1e18;
int main() {
int n, k;
cin >> n >> k;
int h[n + 100];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 959,967 | 959,966 | u566900820 | cpp |
p03161 | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typed... | /*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typed... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,973 | 959,974 | u506295831 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
const int mod1 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); ++i)
const int mod = 1000000007;
const int mod1 = 998244353;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,975 | 959,976 | u480831358 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
memset(dp, 1e9, sizeof(dp));
dp[1] = 0;
for (int i = 2; i <= min(k, n); i++)
for (int j = 1; j < i; j++)
dp[i] = min(dp[i], abs(h[i] -... | #include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
memset(dp, 1234645198452, sizeof(dp));
dp[1] = 0;
for (int i = 2; i <= min(k, n); i++)
for (int j = 1; j < i; j++)
dp[i] = min(dp[i], ... | [
"literal.number.change",
"call.arguments.change"
] | 959,979 | 959,980 | u314693739 | cpp |
p03161 | #include <iostream>
using namespace std;
int DP[100100];
int H[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
DP[i] = 999999999;
}
DP[0] = 0;
for (int i = 1; i < N; i++)
for (int j = i - 1; j >= 0 && i - j <= K; j--)
DP[i] = min(DP[i], DP[j] + abs... | #include <iostream>
using namespace std;
int DP[100100];
int H[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
DP[i] = 999999999;
}
DP[0] = 0;
for (int i = 1; i < N; i++)
for (int j = i - 1; j >= 0 && i - j <= K; j--)
DP[i] = min(DP[i], DP[j] + abs... | [
"expression.operation.binary.add"
] | 959,994 | 959,995 | u538921909 | cpp |
p03161 | #include <iostream>
using namespace std;
int DP[100100];
int H[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
DP[i] = 999999999;
}
DP[0] = 0;
for (int i = 1; i < N; i++)
for (int j = i - 1; j >= 0 && i - j <= K; j--)
DP[i] = min(DP[i], DP[j] + abs... | #include <iostream>
using namespace std;
int DP[100100];
int H[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
DP[i] = 999999999;
}
DP[0] = 0;
for (int i = 1; i < N; i++)
for (int j = i - 1; j >= 0 && i - j <= K; j--)
DP[i] = min(DP[i], DP[j] + abs... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,996 | 959,995 | u538921909 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define f1 first
#define f2 second
#define hell 10000007
#define in for ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define f1 first
#define f2 second
#define hell 10000007
#define in for ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,012 | 960,013 | u246947544 | cpp |
p03161 | #include <iostream>
#define lli long long int
using namespace std;
int main() {
lli n, k;
cin >> n >> k;
lli a[n + 1];
a[0] = 0;
for (lli i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 1] = {0};
dp[2] = abs(a[2] - a[1]);
lli m;
for (lli i = 3; i <= n; i++) {
m = 111111111111111;
for (lli j =... | #include <iostream>
#define lli long long int
using namespace std;
int main() {
lli n, k;
cin >> n >> k;
lli a[n + 1];
a[0] = 0;
for (lli i = 1; i <= n; i++)
cin >> a[i];
lli dp[n + 1] = {0};
dp[2] = abs(a[2] - a[1]);
lli m;
for (lli i = 3; i <= n; i++) {
m = 111111111111111;
for (lli j =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,014 | 960,015 | u882674169 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
using ll = long long;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
using ll = long long;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
i... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change"
] | 960,018 | 960,019 | u616053863 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define inf 1e5 + 10
#define LL long long
int main() {
LL n, k;
cin >> n >> k;
LL h[n];
for (LL i = 0; i < n; i++)
cin >> h[i];
LL dp[n + 1];
memset(dp, inf, sizeof(dp));
// dp[i] --> minimum cost incurred to reach i
for (LL i = 0; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define inf 1e4 + 10
#define LL long long
int main() {
LL n, k;
cin >> n >> k;
LL h[n];
for (LL i = 0; i < n; i++)
cin >> h[i];
LL dp[n + 1];
memset(dp, inf, sizeof(dp));
// dp[i] --> minimum cost incurred to reach i
for (LL i = 0; i <= n; i++) {
... | [
"preprocessor.define.value.change",
"literal.float.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,025 | 960,026 | u266864786 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
#define SUM(x) accumulate(ALL(x), 0);
using namespace... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define DEBUG(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(ALL(x));
#define RSORT(x) sort(RALL(x));
#define SUM(x) accumulate(ALL(x), 0);
using namespace... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"expression.operation.binary.change"
] | 960,030 | 960,031 | u850516963 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
h[0] = 0;
for (int i = 1; i <= n; i++)
cin >> h[i];
int cost[n + 1];
for (int i = 0; i <= n; i++)
cost[i] = 100000;
cost[0] = 0;
cost[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1];
h[0] = 0;
for (int i = 1; i <= n; i++)
cin >> h[i];
long long int cost[n + 1];
for (int i = 0; i <= n; i++)
cost[i] = 1000000000;
cost[0] = 0;
cost[1] = 0;
for (int i = 2; i <= n; i++) {
for... | [
"literal.number.change",
"assignment.value.change"
] | 960,042 | 960,041 | u109133010 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long int h[n + 1], ans[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
ans[i] = 200000;
}
ans[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j + i <= n)
ans[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n + 1], ans[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
ans[i] = INT_MAX;
}
ans[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j + i <= n)
ans[i + j] = mi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,043 | 960,044 | u703327737 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
#define F first
#define S second
#define eb emplace_back
int main() {
// freopen("input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
lli t, q, n, m, i, j, a, b, h, k;
cin >> n >> k;
lli ar[10000... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define mod 1000000007
#define F first
#define S second
#define eb emplace_back
int main() {
// freopen("input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
lli t, q, n, m, i, j, a, b, h, k;
cin >> n >> k;
lli ar[10000... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,045 | 960,046 | u801195984 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
int infinite = 1000000000;
std::cin >> n >> k;
std::vector<int> stones{};
std::vector<int> dp{};
stones.resize(n);
dp.resize(n);
int h;
for (int i{}; i < n; i++) {
std::cin >> h;
stones[i] = h;
dp[i] = infini... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
int infinite = 1000000000;
std::cin >> n >> k;
std::vector<int> stones{};
std::vector<int> dp{};
stones.resize(n);
dp.resize(n);
int h;
for (int i{}; i < n; i++) {
std::cin >> h;
stones[i] = h;
dp[i] = infini... | [
"control_flow.loop.for.condition.change"
] | 960,065 | 960,066 | u252327607 | cpp |
p03161 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define fast_cin() ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define fast_cin() ... | [] | 960,067 | 960,068 | u290208722 | cpp |
p03161 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define fast_cin() ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define pb push_back
#define fast_cin() ... | [
"literal.number.change",
"call.arguments.change"
] | 960,069 | 960,068 | u290208722 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long dp[n + 1];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (long int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (long int j = 1; j <= k; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long dp[n + 1];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (long int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (long int j = 1; j <= k; ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,075 | 960,076 | u803405081 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = 10000000;
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000008;
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 960,079 | 960,078 | u411604061 | cpp |
p03161 | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) ... | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin Header {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define rep(i, n) for (intmax_t i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, b, e) ... | [
"variable_declaration.type.primitive.change"
] | 960,082 | 960,083 | u671257784 | cpp |
p03161 | //<MIHIR KHAMBHATI/>
#include <bits/stdc++.h>
#include <chrono>
using namespace std::chrono;
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// // Declaring ordered_set
// typedef tree<ll, null_type, less<ll>, rb_tree_tag,
// ... | //<MIHIR KHAMBHATI/>
#include <bits/stdc++.h>
#include <chrono>
using namespace std::chrono;
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// // Declaring ordered_set
// typedef tree<ll, null_type, less<ll>, rb_tree_tag,
// ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,092 | 960,093 | u213110772 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define N 100000
#define f(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define po pop_back
#define pb push_back
#define lb lower_bound
#define fi first
#define se second
#define debug(x) cout << #x << " = " << x <... | #include <bits/stdc++.h>
#define ll long long int
#define N 100000
#define f(i, a, b) for (ll i = (ll)a; i <= (ll)b; i++)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define po pop_back
#define pb push_back
#define lb lower_bound
#define fi first
#define se second
#define debug(x) cout << #x << " = " << x <... | [
"literal.number.change",
"call.arguments.change"
] | 960,120 | 960,121 | u773105035 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
for (int i = 0; i < n; i++)
cin >> a[i];
if (n > 2)
dp[0] = 0;
else {
cout << abs(a[1] - a[0]);
return 0;
}
for (int i = 0; i < n; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
for (int i = 0; i < n; i++)
cin >> a[i];
if (n > 2)
dp[0] = 0;
else {
cout << abs(a[1] - a[0]);
return 0;
}
for (int i = 0; i < n; i+... | [
"identifier.change"
] | 960,126 | 960,127 | u703417608 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 1111;
int arr[maxn];
int dp[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
dp[0] = dp[1] = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", ... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 1111;
int arr[maxn];
int dp[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
dp[0] = dp[1] = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", ... | [
"control_flow.branch.if.add"
] | 960,133 | 960,134 | u997668091 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 1111;
int arr[maxn];
int dp[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
memset(dp, 0x3f3f3f, sizeof(dp));
arr[0] = 0x3f3f3f;
dp[0] = dp[0... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 1111;
int arr[maxn];
int dp[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
memset(dp, 0x3f3f3f, sizeof(dp));
arr[0] = 0x3f3f3f;
dp[0] = dp[... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 960,135 | 960,136 | u997668091 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 1111;
int arr[maxn];
int dp[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
memset(dp, 0x3f3f3f, sizeof(dp));
arr[0] = 0x3f3f3f;
dp[0] = dp[0... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 1111;
int arr[maxn];
int dp[maxn];
int main() {
int n, k;
scanf("%d%d", &n, &k);
memset(dp, 0x3f3f3f, sizeof(dp));
arr[0] = 0x3f3f3f;
dp[0] = dp[... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 960,137 | 960,138 | u997668091 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
// b[1]=abs(a[... | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
// b[1]=abs(a[... | [
"assignment.change"
] | 960,139 | 960,140 | u372392968 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
// b[1]=abs(a[... | #include <bits/stdc++.h>
using namespace std;
int c = 0;
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n], ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
b[i] = INT_MAX;
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
b[0] = 0;
// b[1]=abs(a[... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 960,141 | 960,140 | u372392968 | cpp |
p03161 | #include <bits/stdc++.h>
#define lint long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
lint pd[100010];
int h[100010];
int n, k;
long long sapo2(int i) {
if (pd[i] != -1)
return pd[i];
if (i == n)
return pd[i] = 0;
pd[i] = INF;
for (int j = i + 1; j <= i + k && j <= n; j++) {
pd[i] = ... | #include <bits/stdc++.h>
#define lint long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
lint pd[100010];
int h[100010];
int n, k;
long long sapo2(int i) {
if (pd[i] != -1)
return pd[i];
if (i == n)
return pd[i] = 0;
pd[i] = INF;
for (int j = i + 1; j <= i + k && j <= n; j++) {
pd[i] = ... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,147 | 960,148 | u810674239 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[1000001], N, k, h[1000000];
int main() {
int t;
cin >> N >> k;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0, dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i - 1] - h[i]);
for (int j = 1; j <= min... | #include <bits/stdc++.h>
using namespace std;
int dp[1000001], N, k, h[1000000];
int main() {
int t;
cin >> N >> k;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0, dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i - 1] - h[i]);
for (int j = 2; j <= min... | [
"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.remove"
] | 960,151 | 960,152 | u597808771 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int INF = 1e5 + 9;
int main() {
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
vector<int> v(n);
for (int &x : v)
scanf("%d", &x);
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int k;
scanf("%d", &k);
vector<int> v(n);
for (int &x : v)
scanf("%d", &x);
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <... | [
"literal.number.change",
"expression.operation.binary.change"
] | 960,155 | 960,156 | u753187241 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int dp[maxn], arr[maxn];
int main() {
std::ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> arr[i];
dp[i] = 0x3f3f3f;
}
dp[0] = dp[1] = 0;
for (int k = 2; k <= N; k++)
for (in... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int dp[maxn], arr[maxn];
int main() {
std::ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> arr[i];
dp[i] = 0x3f3f3f3f;
}
dp[0] = dp[1] = 0;
for (int k = 2; k <= N; k++)
for (... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 960,157 | 960,158 | u716934273 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int dp[maxn], arr[maxn];
int main() {
std::ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> arr[i];
dp[i] = 0x3f3f3f;
}
dp[0] = dp[1] = 0;
for (int k = 2; k <= N; k++)
for (in... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int dp[maxn], arr[maxn];
int main() {
std::ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> arr[i];
dp[i] = 0x3f3f3f3f;
}
dp[0] = dp[1] = 0;
for (int k = 2; k <= N; k++)
for (... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change"
] | 960,157 | 960,160 | u716934273 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
if (n == 0 || k == 0) {
cout << 0;
return 0;
}
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
vector<int> F(n, 0);
for (int i = 1; i < n; ++i) {
int curr_min = INT_MAX;
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
if (n == 0 || k == 0) {
cout << 0;
return 0;
}
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
vector<int> F(n, 0);
for (int i = 1; i < n; ++i) {
int curr_min = INT_MAX;
for (i... | [] | 960,165 | 960,166 | u002405247 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define de cout << "debuglandınız\n";
ll int N, i, j, K;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> N >> K;
vector<long long int> v(N), dp(N, 99999);
for (i = 0; i < N; i++)
cin >> v[i];
d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define de cout << "debuglandınız\n";
ll int N, i, j, K;
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> N >> K;
vector<long long int> v(N), dp(N, 999999999);
for (i = 0; i < N; i++)
cin >> v[i];... | [
"literal.number.change",
"call.arguments.change"
] | 960,179 | 960,180 | u207337956 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 100000
const int INF = 1e9;
int long dp[MAX_N];
int main() {
int n, k;
cin >> n >> k;
int step[n];
for (int i = 0; i < n; i++) {
cin >> step[i];
}
for (int i = 0; i < n; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 2; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 100000
const int INF = 1e9;
int dp[MAX_N];
int main() {
int n, k;
cin >> n >> k;
int step[n];
for (int i = 0; i < n; i++) {
cin >> step[i];
}
for (int i = 0; i < n; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 960,181 | 960,182 | u158628538 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 1] - h[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int m = 2;
dp[i] = abs(h[i] - h[i + 1]) + dp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 1] - h[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int m = 2;
dp[i] = abs(h[i] - h[i + 1]) + dp[i... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 960,185 | 960,186 | u601256119 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 1] - h[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int m = 2;
dp[i] = abs(h[i] - h[i + 1]) + dp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 1] - h[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int m = 2;
dp[i] = abs(h[i] - h[i + 1]) + dp[i... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,187 | 960,186 | u601256119 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 1] - h[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int m = 2;
dp[i] = abs(h[i] - h[i + 1]) + dp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *h = new int[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = abs(h[n - 1] - h[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int m = 2;
dp[i] = abs(h[i] - h[i + 1]) + dp[i... | [
"identifier.change",
"control_flow.loop.condition.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,188 | 960,186 | u601256119 | cpp |
p03161 | // Nguyen Anh Tu
#include <bits/stdc++.h>
#define FOR(x, a, b) for (int x = a; x <= b; x++)
#define FORD(x, a, b) for (int x = a; x >= b; x--)
#define maxn 100005
#define maxc 1000000007
#define MOD 1000000007
#define reset(x, y) memset(x, y, sizeof(x))
#define task "frog"
#define mp make_pair
#define pb push_back
#def... | // Nguyen Anh Tu
#include <bits/stdc++.h>
#define FOR(x, a, b) for (int x = a; x <= b; x++)
#define FORD(x, a, b) for (int x = a; x >= b; x--)
#define maxn 100005
#define maxc 1000000007
#define MOD 1000000007
#define reset(x, y) memset(x, y, sizeof(x))
#define task "frog"
#define mp make_pair
#define pb push_back
#def... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 960,191 | 960,192 | u522223354 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 10;
const int INF = 1e4 + 10;
int in[maxx];
int dp[maxx];
int main() {
int n, k;
scanf("%d%d", &n, &k);
fill(dp, dp + n, INF);
for (int i = 0; i < n; i++) {
scanf("%d", &in[i]);
}
dp[0] = 0;
dp[1] = abs(in[0] - in[1]);
for (int j =... | #include <bits/stdc++.h>
using namespace std;
const int maxx = 1e6 + 10;
const int INF = 1e9 + 10;
int in[maxx];
int dp[maxx];
int main() {
int n, k;
scanf("%d%d", &n, &k);
fill(dp, dp + n, INF);
for (int i = 0; i < n; i++) {
scanf("%d", &in[i]);
}
dp[0] = 0;
dp[1] = abs(in[0] - in[1]);
for (int j =... | [
"literal.number.change",
"expression.operation.binary.change"
] | 960,193 | 960,194 | u530868041 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
// 2 pointer approach interesting problem
signed 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];... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
// 2 pointer approach interesting problem
signed 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];... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,201 | 960,202 | u598688088 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort(all(v))
#define INF 1000000007
#define fcout cout << fixed << setprecision(15)
type... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort(all(v))
#define INF 1000000007
#define fcout cout << fixed << setprecision(15)
type... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,206 | 960,204 | u681869152 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort(all(v))
#define INF 1000000007
#define fcout cout << fixed << setprecision(15)
type... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define SORT(v) sort(all(v))
#define INF 1000000007
#define fcout cout << fixed << setprecision(15)
type... | [
"variable_declaration.type.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,206 | 960,208 | u681869152 | cpp |
p03161 | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, lli... | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, lli... | [
"call.arguments.add"
] | 960,215 | 960,216 | u376082984 | cpp |
p03161 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include ... | [
"literal.number.change",
"call.arguments.change"
] | 960,223 | 960,224 | u984222407 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int i, j, k;
int n;
int height[int(1e6)];
int cache[int(1e6)];
int dp(int x, int k) {
int miner = 10000;
if (x ==... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int i, j, k;
int n;
int height[int(1e6)];
int cache[int(1e6)];
int dp(int x, int k) {
int miner = INT_MAX;
if (x ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,230 | 960,231 | u915971307 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
ans[1] = 0;
ans[2] = abs(h[2] - h[1]);
int mini = INT_MAX;
for (int i = 3; i <= n; i++) {
mini = INT_MAX;
for (int j = max(0, i - k)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n + 1), ans(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
ans[1] = 0;
ans[2] = abs(h[2] - h[1]);
int mini = INT_MAX;
for (int i = 3; i <= n; i++) {
mini = INT_MAX;
for (int j = max(1, i - k)... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 960,232 | 960,233 | u035413032 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int cost[n];
int h[n];
cost[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cost[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
int x = INT_MAX;
j = 1;
// cout<<"i="<<i<<endl;
if (k < i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int cost[n];
int h[n];
cost[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cost[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
int x = INT_MAX;
j = 1;
// cout<<"i="<<i<<endl;
if (k <= ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 960,234 | 960,235 | u135151538 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int cost[n];
int h[n];
cost[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cost[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
int x = INT_MAX;
j = 1;
// cout<<"i="<<i<<endl;
if (k < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int cost[n];
int h[n];
cost[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cost[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
int x = INT_MAX;
j = 1;
// cout<<"i="<<i<<endl;
if (k <= ... | [
"control_flow.loop.for.condition.change"
] | 960,236 | 960,235 | u135151538 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
u... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be(), (a).en()
using LL = long long;
template <typename T> using V = vector<T>;
using Vi = V<int>;
using Vll = V<LL>;
u... | [
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 960,243 | 960,244 | u129220625 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;... | [
"control_flow.loop.for.condition.change"
] | 960,245 | 960,246 | u796511558 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | [
"assignment.change"
] | 960,252 | 960,253 | u494377156 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
// can use O(K) memory actually
int T, n, k;
const int maxn = 100000 + 5;
const ll INF = 1000000000 + 5;
ll h[maxn];
ll dp[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (in... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
// can use O(K) memory actually
int T, n, k;
const int maxn = 100000 + 5;
const ll INF = 1000000000 + 5;
ll h[maxn];
ll dp[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (in... | [
"identifier.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,259 | 960,260 | u065621181 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
// can use O(K) memory actually
int T, n, k;
const int maxn = 100000 + 5;
const ll INF = 1000000000 + 5;
ll h[maxn];
ll dp[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (in... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
// can use O(K) memory actually
int T, n, k;
const int maxn = 100000 + 5;
const ll INF = 1000000000 + 5;
ll h[maxn];
ll dp[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (in... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,261 | 960,260 | u065621181 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
// can use O(K) memory actually
int T, n, k;
const int maxn = 100000 + 5;
const ll INF = 1000000000 + 5;
ll h[maxn];
ll dp[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (in... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
// can use O(K) memory actually
int T, n, k;
const int maxn = 100000 + 5;
const ll INF = 1000000000 + 5;
ll h[maxn];
ll dp[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (in... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,262 | 960,260 | u065621181 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pi acos(-1)
#define cross(a, b) (conj(a) * (b)).imag()
#define dot(a, b) (conj(a) * (b)).real()
#define vec(a, b) b - a
#define Reka \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pi acos(-1)
#define cross(a, b) (conj(a) * (b)).imag()
#define dot(a, b) (conj(a) * (b)).real()
#define vec(a, b) b - a
#define Reka \
ios_base::sync_with_stdio(0); ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 960,265 | 960,266 | u805875050 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pi acos(-1)
#define cross(a, b) (conj(a) * (b)).imag()
#define dot(a, b) (conj(a) * (b)).real()
#define vec(a, b) b - a
#define Reka \
ios_base::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pi acos(-1)
#define cross(a, b) (conj(a) * (b)).imag()
#define dot(a, b) (conj(a) * (b)).real()
#define vec(a, b) b - a
#define Reka \
ios_base::sync_with_stdio(0); ... | [
"variable_declaration.value.change"
] | 960,267 | 960,266 | u805875050 | cpp |
p03161 | #include <iomanip>
#include <iostream>
#define nmax 100005
using namespace std;
int dp[nmax], p[nmax];
int modul(int x) {
if (x < 0) {
return -x;
}
return x;
}
int cost(int k, int i) { return dp[k] + modul(p[k] - p[i]); }
int main() {
int i, j, n, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> p... | #include <iomanip>
#include <iostream>
#define nmax 100005
using namespace std;
int dp[nmax], p[nmax];
int modul(int x) {
if (x < 0) {
return -x;
}
return x;
}
int cost(int k, int i) { return dp[k] + modul(p[k] - p[i]); }
int main() {
int i, j, n, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> p... | [
"control_flow.loop.for.initializer.change",
"call.add",
"call.arguments.change"
] | 960,268 | 960,269 | u384309758 | cpp |
p03161 | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
int h[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j... | #include <climits>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
int h[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j... | [
"control_flow.loop.for.condition.change"
] | 960,277 | 960,278 | u912318491 | cpp |
p03161 | #include <bits/stdc++.h>
#define FILE
using namespace std;
const int N = 2e5 + 100;
int n, k, h[N];
long long dp[N];
int main() {
#ifdef FILES
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin... | #include <bits/stdc++.h>
#define FILE
using namespace std;
const int N = 2e5 + 100;
int n, k, h[N];
long long dp[N];
int main() {
#ifdef FILEs
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 960,279 | 960,280 | u866968224 | cpp |
p03161 | #include <bits/stdc++.h>
#define FILE
using namespace std;
const int N = 2e5 + 100;
int n, k, h[N];
long long dp[N];
int main() {
#ifdef FILES
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin... | #include <bits/stdc++.h>
#define FILE
using namespace std;
const int N = 2e5 + 100;
int n, k, h[N];
long long dp[N];
int main() {
#ifdef FILEs
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin... | [
"identifier.change",
"misc.opposites",
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 960,281 | 960,280 | u866968224 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define MAX(a, b) (a > b) ? a : b;
#define MIN(a, b) (a < b) ? a : b;
#define IsInteger(a) (fabs(a - round(a)) < 0.00001)
#define swap(a, b) \
{ ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
#define MAX(a, b) (a > b) ? a : b;
#define MIN(a, b) (a < b) ? a : b;
#define IsInteger(a) (fabs(a - round(a)) < 0.00001)
#define swap(a, b) \
{ ... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 960,290 | 960,291 | u900249934 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
// freopen("SNOOKER.inp","r",stdin);
// freopen("SNOOKER.out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
}
/*----------------------------------------------------------------------
-------------------------... | #include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
// freopen("SNOOKER.inp","r",stdin);
// freopen("SNOOKER.out","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
}
/*----------------------------------------------------------------------
-------------------------... | [
"control_flow.loop.for.condition.change"
] | 960,292 | 960,293 | u307631662 | cpp |
p03161 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, x, k;
vector<int> h;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
h.push_back(x);
}
vector<int> rasp(n + 1);
rasp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (i < k) {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, i, x, k;
vector<int> h;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
h.push_back(x);
}
vector<int> rasp(n + 1);
rasp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
if (i + k >= n) ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 960,300 | 960,301 | u972879046 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a, k;
cin >> n >> k;
int dp[123456] = {0}, test[123456] = {0};
for (int h = 0; h < n; h++) {
cin >> a;
test[h] = a;
}
for (int h = 1; h < 123456; h++) {
dp[h] = 12345;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long n, a, k;
cin >> n >> k;
long long dp[123456] = {0}, test[123456] = {0};
for (int h = 0; h < n; h++) {
cin >> a;
test[h] = a;
}
for (int h = 1; h < 123456; h++) {
dp[h] = 123456... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 960,306 | 960,305 | u986568278 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const in... | #include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Would
#define you
const int INF = 999999999;
const in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"call.arguments.change"
] | 960,322 | 960,323 | u539402331 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int N, K;
cin >> N >> K;
int dp[N];
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
dp[i] = 100000;
// cout << a[i] << "\n";
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = i - 1; j >= i - K &... | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long long
int N, K;
cin >> N >> K;
int dp[N];
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
dp[i] = LLONG_MAX;
// cout << a[i] << "\n";
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = i - 1; j >= i - ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,325 | 960,326 | u730651258 | 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 main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
int curMin = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
int curMin = ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,342 | 960,343 | u917793793 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<lo... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<lo... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,344 | 960,345 | u485405254 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return... | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 960,346 | 960,347 | u052332717 | cpp |
p03161 | // be name khoda \\
// #define stream_enable
// #define long_enable
#define debug_enable
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <v... | // be name khoda \\
// #define stream_enable
// #define long_enable
#define debug_enable
#include <algorithm>
#include <cmath>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <v... | [
"call.arguments.add"
] | 960,351 | 960,352 | u780597450 | cpp |
p03161 | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAXN 100010
#define ll long long
const ll INF = 1e18;
int n, k;
ll h[MAXN], f[MAXN];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%lld", &h[i]);
for (int i = 2; i <= n; ++i) {
f[i] = INF;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAXN 100010
#define ll long long
const ll INF = 1e18;
int n, k;
ll h[MAXN], f[MAXN];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%lld", &h[i]);
for (int i = 2; i <= n; ++i) {
f[i] = INF;
... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 960,359 | 960,360 | u487696125 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
vector<int> cost(n);
for (int i = 0; i < n; i++)
scanf("%d", &dp[i]);
int minc;
for (int i = 1; i < n; i++) {
minc = 100000;
for (int j = 1; j <= k && i - j >= 0; j++) {
minc = min(minc, c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n];
vector<int> cost(n);
for (int i = 0; i < n; i++)
scanf("%d", &dp[i]);
int minc;
for (int i = 1; i < n; i++) {
minc = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++) {
minc = min(minc, ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 960,375 | 960,376 | u508355276 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
cin >> N >> k;
int h[N]; // INPUT ARRAY
int ans[N]; // OUTPUT ARRAY
for (int i = 0; i < N; i++) {
cin >> h[i];
ans[i] = INT_MAX;
}
ans[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N, j - i <= k; j++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
cin >> N >> k;
int h[N]; // INPUT ARRAY
int ans[N]; // OUTPUT ARRAY
for (int i = 0; i < N; i++) {
cin >> h[i];
ans[i] = INT_MAX;
}
ans[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N && j - i <= k; j++)
... | [
"control_flow.loop.for.condition.change"
] | 960,386 | 960,387 | u120889780 | cpp |
p03161 | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <random... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <random... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 960,388 | 960,389 | u917972976 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k, temp;
cin >> n >> k;
ll arr[n];
ll res[n][k];
ll min[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
min[i] = 100005;
}
temp = abs(arr[1] - ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, k, temp;
cin >> n >> k;
ll arr[n];
ll res[n][k];
ll min[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
min[i] = 1e16 + 250;
}
temp = abs(arr[1... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 960,399 | 960,400 | u307699432 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair
#define sz size()
#define forf(a, b, c) for (int i = a; i <= b; i... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mkp make_pair
#define sz size()
#define forf(a, b, c) for (int i = a; i <= b; i... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 960,401 | 960,402 | u615763347 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, k, arr[N], dp[N];
int calc(int idx) {
if (idx == n - 1)
return 0;
if (idx > n - 1)
return 1e5;
if (dp[idx] != -1)
return dp[idx];
int mn = 1e5;
for (int i = idx + 1; i <= idx + k && i < n; ++i)
mn = min(mn, abs(arr[... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, k, arr[N], dp[N];
int calc(int idx) {
if (idx == n - 1)
return 0;
if (idx > n - 1)
return 1e5;
if (dp[idx] != -1)
return dp[idx];
int mn = 1e9 + 10;
for (int i = idx + 1; i <= idx + k && i < n; ++i)
mn = min(mn, abs... | [
"literal.number.change"
] | 960,409 | 960,410 | u399756885 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.