problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03161 | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << end... | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << end... | [
"literal.number.change",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 961,377 | 961,378 | u208956581 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define infint 0x7fffffff // 32-bit int
#define ninfint 0x80000000
#define EPS 1e-9
#define mp(A, B) make_pair(A, B)
#define pb push_back
#define pque priority_queue
#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 <... | #include <bits/stdc++.h>
using namespace std;
#define infint 0x7fffffff // 32-bit int
#define ninfint 0x80000000
#define EPS 1e-9
#define mp(A, B) make_pair(A, B)
#define pb push_back
#define pque priority_queue
#define isOn(S, j) (S & (1 << j))
#define setBit(S, j) (S |= (1 << j))
#define clearBit(S, j) (S &= ~(1 <... | [
"control_flow.loop.for.condition.change"
] | 961,383 | 961,384 | u245704078 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespa... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespa... | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,391 | 961,392 | u032692765 | cpp |
p03161 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 100005;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a[N], dp[N], K;
cin >> n >> K;
dp[0] = dp[1] = 0;
for (int i = 1; i ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 100005;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, a[N], dp[N], K;
cin >> n >> K;
dp[1] = 0;
for (int i = 1; i <= n; i+... | [
"assignment.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,395 | 961,396 | u895595177 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(dp[1] - dp[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 1; j <= b; j++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(n[1] - n[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 1; j <= b; j++) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,397 | 961,398 | u759515768 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(dp[1] - dp[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 2; j <= b; j++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n[a + 1];
for (int i = 0; i < a; i++)
cin >> n[i];
int dp[a + 1];
dp[0] = 0;
dp[1] = abs(n[1] - n[0]);
for (int i = 2; i < a; i++) {
dp[i] = dp[i - 1] + abs(n[i] - n[i - 1]);
for (int j = 1; j <= b; j++) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,399 | 961,398 | u759515768 | cpp |
p03161 | // Resting_Prince
#include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define sv(v) \
sort(all(v)); \
reverse(all(... | // Resting_Prince
#include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define sv(v) \
sort(all(v)); \
reverse(all(... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 961,402 | 961,401 | u640930204 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 961,405 | 961,406 | u961528573 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define eb emplace_back
#define dump(x) cout << #x << " = " << (x) << endl
#define chk() cout << "now" << endl;
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 961,407 | 961,406 | u961528573 | cpp |
p03161 | // ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#... | // ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,410 | 961,411 | u909051929 | cpp |
p03161 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 10000... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 10000... | [
"expression.operation.binary.remove"
] | 961,412 | 961,413 | u185736584 | cpp |
p03161 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 10000... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author ExplodingFreeze
*/
#include <fstream>
#include <iostream>
#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 10000... | [
"expression.operation.binary.remove",
"assignment.change"
] | 961,414 | 961,413 | u185736584 | cpp |
p03161 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | [
"preprocessor.define.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,415 | 961,416 | u645188582 | cpp |
p03161 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 961,417 | 961,418 | u141448608 | cpp |
p03161 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, n, i, j, k, x, y, c = 0, m;
ll a[100007];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll mi;
ll res[100007];
res[0] = 0;
res[1] = abs(a[1] - a[0])... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t, n, i, j, k, x, y, c = 0, m;
ll a[100007];
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll mi;
ll res[100007];
res[0] = 0;
res[1] = abs(a[1] - a[0])... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 961,419 | 961,420 | u718495117 | cpp |
p03161 | #include <iostream>
#include <string>
#include <vector>
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); ... | #include <iostream>
#include <string>
#include <vector>
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,427 | 961,428 | u657541767 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + K);
vector<int> cost(N + K, 100000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
for (int i = 0; i < N; i++) {
for (int n = 1; n <= K; n++) {
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + K);
vector<int> cost(N + K, 999999999);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cost[0] = 0;
for (int i = 0; i < N; i++) {
for (int n = ... | [
"import.add",
"literal.number.change",
"call.arguments.change"
] | 961,451 | 961,452 | u356117208 | cpp |
p03161 | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <bits/stdc++.h>
#define ll long long int
#define ironman \
ios_base::sync_with_stdio(false); ... | [
"call.remove"
] | 961,461 | 961,462 | u374444191 | cpp |
p03161 | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb pu... | #include <bits/stdc++.h>
#define hell 1000000007
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb pu... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,465 | 961,466 | u864500649 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ull unsigned long long int
#define ll long long int
#define pb push_back
#define mp make_pair
#define pcc pair<char, char>
#define pii... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ull unsigned long long int
#define ll long long int
#define pb push_back
#define mp make_pair
#define pcc pair<char, char>
#define pii... | [
"control_flow.loop.for.condition.change"
] | 961,469 | 961,470 | u079325146 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 1 << 10;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (auto &x : h) {
cin >> x;
}
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
for (int j = 1; j < min(K + 1, i + 1); +... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int INF = 10000000000;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (auto &x : h) {
cin >> x;
}
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
for (int j = 1; j < min(K + 1, i + 1)... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 961,485 | 961,484 | u142415823 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 1e5 + 10;
const long long INF = 1LL ... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MAX_N = 1e5 + 10;
const long long INF = 1LL ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",... | 961,492 | 961,493 | u835629653 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
const ll INF = 1LL << 60;
// input... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
}
const ll INF = 1LL << 60;
// input... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,505 | 961,506 | u920340928 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[100000];
main() {
memset(d, 0, sizeof(d));
ll int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
d[0] = 0;
for (int i = 1; i < k; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#include <queue>
#include <vector>
#define ll long long
#define inf INT_MAX
ll int d[100000];
main() {
memset(d, 0, sizeof(d));
ll int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
d[0] = 0;
for (int i = 1; i < k; i++) {
... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 961,507 | 961,508 | u131565555 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
const int INF = 100000;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n), h(n, 0);
for (int i = 0; i < n; ++i)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
int cost;
int minimum_cost = INF;
int m;
for (int i = 2; i < n; ++... | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1000000000;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n), h(n, 0);
for (int i = 0; i < n; ++i)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
int cost;
int minimum_cost = INF;
int m;
for (int i = 2; i < n... | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,514 | 961,512 | u207460172 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> DP(N, 0);
DP[1] = abs(h[1] - h[0]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> DP(N, 0);
DP[1] = abs(h[1] - h[0]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 961,515 | 961,516 | u689245321 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> DP(N, 0);
DP[1] = abs(h[1] - h[0]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> DP(N, 0);
DP[1] = abs(h[1] - h[0]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 961,517 | 961,516 | u689245321 | cpp |
p03161 | #include <cmath>
#include <iostream>
#include <limits>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
for (auto &&hi : h)
std::cin >> hi;
std::vector<int> cost(n, std::numeric_limits<int>::max());
cost[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j ... | #include <cmath>
#include <iostream>
#include <limits>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
for (auto &&hi : h)
std::cin >> hi;
std::vector<int> cost(n, std::numeric_limits<int>::max());
cost[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 0; j ... | [
"identifier.change",
"expression.operation.binary.change"
] | 961,525 | 961,524 | u217344789 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 2e18;
for (int j = 1; j <= k; j++) {
if (... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
long long dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = 2e18;
for (int j = 1; j <= k; j++) {
if (... | [] | 961,544 | 961,545 | u436936051 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N + 1], dp[N + 1];
for (int i = 1; i <= N; ++i) {
cin >> h[i];
dp[i] = 100000;
}
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
for (int j = 1; j <= K; ++j) {
if (i - j ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
long long int h[N + 1], dp[N + 1];
for (int i = 1; i <= N; ++i) {
cin >> h[i];
dp[i] = 10000000000;
}
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
for (int j = 1; j <= K; ++j) {
... | [
"literal.number.change",
"assignment.value.change"
] | 961,583 | 961,584 | u041282550 | 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, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end(... | #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, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,590 | 961,591 | u908349502 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, K, i, j, mincost, cost;
int h[100010];
int s[100010] = {};
cin >> N >> K;
mincost = 1e9;
for (i = 1; i <= N; i++) {
cin >> h[i];
}
s[1] = 0, s[2] = abs(h[1] - h[2]);
for (i = 3; i <= N; i++) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, K, i, j, mincost, cost;
int h[100010];
int s[100010] = {};
cin >> N >> K;
mincost = 1e9;
for (i = 1; i <= N; i++) {
cin >> h[i];
}
s[1] = 0, s[2] = abs(h[1] - h[2]);
for (i = 3; i <= N; i++) {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"assignment.change"
] | 961,603 | 961,604 | u841111730 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 961,607 | 961,608 | u461415203 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
long long h[100000];
for (int i = 0; i < N; ++i)
cin >> h[i];
long long dp[100100];
for (int i = 0; i < 100100; ++i)
dp[i] = 1 << 60;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int N, K;
cin >> N >> K;
long long h[100000];
for (int i = 0; i < N; ++i)
cin >> h[i];
long long dp[100100];
for (int i = 0; i < 100100; ++i)
dp[i] = 1LL << 60;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int... | [
"literal.number.type.widen.change"
] | 961,609 | 961,610 | u423405217 | cpp |
p03161 | //配るDPにしたよ
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
long long N, K;
long long h[100110];
long long dp[100110];
const long long inf = 1 << 30;
int main() {
scanf("%Ld %Ld", &N, &... | //配るDPにしたよ
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
long long N, K;
long long h[100110];
long long dp[100110];
const long long inf = 1 << 30;
int main() {
scanf("%Ld %Ld", &N, &... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"io.output.newline.add"
] | 961,631 | 961,632 | u877476774 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
ll dp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 1e18;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j < 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll h[n + 1];
ll dp[n + 1];
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = 1e18;
}
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
for (ll j = 1; j <= k; j++) {
if (i - j <= 0)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,633 | 961,634 | u742642200 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/a.in", "r", stdin);
// freopen("../IO/a.in", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::ci... | #include <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/a.in", "r", stdin);
// freopen("../IO/a.in", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::ci... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 961,639 | 961,640 | u478275206 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"literal.number.change",
"call.arguments.change"
] | 961,646 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,648 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"literal.number.change",
"call.arguments.change"
] | 961,649 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,650 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 961,651 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,652 | 961,647 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,653 | 961,654 | u364018936 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, h[100005], dp[100005], j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = 1e15;
for (j = i - 1; j >= i - k; j--) {
// cout<<" j = "<<j<<" dp = "<<dp[j]<<endl;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, h[100005], dp[100005], j, k;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = 1e15;
// cout<<" i = "<<i<<"\n";
for (j = i - 1; j >= i - k && j >= 1; j--) {
//... | [
"control_flow.loop.for.condition.change"
] | 961,655 | 961,656 | u094898063 | cpp |
p03161 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long INF = 1LL << 60;
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<long long> dp(N, INF);
for (int i = 0; i < N; i++) {
cin >> h[i];
// dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < N; i+... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long INF = 1LL << 60;
int N, K;
cin >> N >> K;
vector<int> h(N);
vector<long long> dp(N + K, INF);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (in... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,659 | 961,660 | u142946678 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 10000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define inf 1000000000000000
#define pb push_back
#define mp make_pair
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"assignment.change"
] | 961,667 | 961,666 | u653046450 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, n) for (int i = a; i < n; i++)
#define pb(v) push_back(v)
int main() {
// code
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n + 3];
dp[0] = 0;
d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, a, n) for (int i = a; i < n; i++)
#define pb(v) push_back(v)
int main() {
// code
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
f(i, 0, n) cin >> a[i];
int dp[n + k + 1];
dp[0] = 0;... | [
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 961,668 | 961,669 | u276156810 | cpp |
p03161 | #if 1
#include <bits/stdc++.h>
using namespace std;
int a[100005], d[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
d[i] = 2e9;
}
d[1] = 0;
d[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
... | #if 1
#include <bits/stdc++.h>
using namespace std;
int a[100005], d[100005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
d[i] = 2e9;
}
d[1] = 0;
d[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 961,670 | 961,671 | u998677610 | cpp |
p03161 | //ライブラリ
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
... | //ライブラリ
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
... | [
"assignment.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change"
] | 961,676 | 961,677 | u823871776 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo ... | #include <bits/stdc++.h>
using namespace std;
#define pb(x) push_back(x)
#define faster ios::sync_with_stdio(false)
#define ll long long int
#define sz 200005
#define mp(x, y) make_pair(x, y)
#define pii pair<long long int, long long int>
#define tor ::iterator
#define letsgo ... | [
"literal.number.change",
"assignment.value.change"
] | 961,683 | 961,681 | u116062521 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
int i, j;
for (i = 0; i < N; i++) {
cin >> h[i];
}
int dp[N] = {0};
int t;
for (i = 1; i < N; i++) {
t = 1000000010;
for (j = max(0, i - K); j < min(i, K); j++) {
if (dp[j] + abs(h[j] - h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N];
int i, j;
for (i = 0; i < N; i++) {
cin >> h[i];
}
int dp[N] = {0};
int t;
for (i = 1; i < N; i++) {
t = 1000000010;
for (j = max(0, i - K); j < i; j++) {
if (dp[j] + abs(h[j] - h[i]) < t... | [
"control_flow.loop.for.condition.change",
"call.remove",
"call.arguments.change"
] | 961,694 | 961,695 | u118646012 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int h[100100];
int n, k;
int dp[100100];
const int INF = 100100;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {... | #include <bits/stdc++.h>
using namespace std;
int h[100100];
int n, k;
int dp[100100];
const int INF = (int)1e18;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= n; i++)
dp[i] = INF;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++... | [
"type_conversion.add"
] | 961,707 | 961,708 | u785442356 | cpp |
p03161 | /*
@author : srinathbalaji_99
*/
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define endl '\n'
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define rep(i, a, b, inc) for (long long i = a; i < b; i += inc)
#define REP(i, n) rep(i, 0, n, 1)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define P... | /*
@author : srinathbalaji_99
*/
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define endl '\n'
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define rep(i, a, b, inc) for (long long i = a; i < b; i += inc)
#define REP(i, n) rep(i, 0, n, 1)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define P... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,713 | 961,714 | u295992428 | cpp |
p03161 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << std::abs(v[n - 1] - v[0]) << "\n";
goto endproc;
}
... |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << std::abs(v[n - 1] - v[0]) << "\n";
goto endproc;
}
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 961,718 | 961,719 | u837286475 | cpp |
p03161 |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << v[n - 1] - v[0] << "\n";
goto endproc;
}
// k番目の足場... |
#include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> v;
v.resize(n);
auto tab = v;
for (auto &e : v)
std::cin >> e;
//一回で端まで飛べるならそれが最適
if (n - 1 <= k) {
std::cout << std::abs(v[n - 1] - v[0]) << "\n";
goto endproc;
}
... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 961,720 | 961,719 | u837286475 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k;
cin >> k;
long long int a[n];
for (long long int i = 0; i < n; i++)
cin >> a[i];
long long int dp[n];
dp[0] = 0;
for (long long int i = 1; i <= k; i++) {
dp[i] = abs(a[i] - a[0]);
// cout... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k;
cin >> k;
long long int a[n];
for (long long int i = 0; i < n; i++)
cin >> a[i];
long long int dp[n];
dp[0] = 0;
for (long long int i = 1; i <= min(k, n); i++) {
dp[i] = abs(a[i] - a[0]);
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change"
] | 961,730 | 961,729 | u510050122 | cpp |
p03161 | #include <iostream>
using namespace std;
long long int arr[(int)1e5 + 1];
long long int dp[(int)1e5 + 1];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
for (int i = 0; i < n; i++) {
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] ... | #include <iostream>
using namespace std;
long long int arr[(int)1e5 + 1];
long long int dp[(int)1e5 + 1];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
for (int i = 0; i < n; i++) {
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 961,733 | 961,734 | u743914381 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, MAX = 100000;
cin >> N >> K;
vector<int> H(N), dp(N, MAX);
dp[0] = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
if (i + j >= N)
brea... | #include <iostream>
#include <vector>
using namespace std;
int main() {
long long N, K, MAX = 100000000000000;
cin >> N >> K;
vector<long long> H(N), dp(N, MAX);
dp[0] = 0;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
if (i +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 961,740 | 961,738 | u789339072 | cpp |
p03161 | #include <iostream>
#include <utility>
using namespace std;
int main() {
int n = 0, k = 0;
cin >> n >> k;
int arr[n + 1] = {0};
cin >> arr[1];
for (int i = 2; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1] = {0};
arr[0] = 1e5;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(ar... | #include <iostream>
#include <utility>
using namespace std;
int main() {
int n = 0, k = 0;
cin >> n >> k;
int arr[n + 1] = {0};
cin >> arr[1];
for (int i = 2; i <= n; i++) {
cin >> arr[i];
}
long long int dp[n + 1] = {0};
arr[0] = 1e5;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(ar... | [
"control_flow.loop.for.condition.change"
] | 961,747 | 961,748 | u223578409 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
long long h[100010];
// DP テーブル
long long dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
//初期化
for (int i = 0; i < 100010; i++)
dp[i] = 100000;
dp[0] = 0;
for (int i = ... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
long long h[100010];
// DP テーブル
long long dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
//初期化
for (int i = 0; i < 100010; i++)
dp[i] = 1LL << 60;
dp[0] = 0;
for (int i... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 961,755 | 961,756 | u189961895 | cpp |
p03161 | #include <iostream>
using namespace std;
int main(void) {
int N;
int K;
long long h[100010];
long long dp[100010];
long long tmp;
long long tnp;
cin >> N >> K;
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 <= min(K, N - 1); i++) {
... | #include <iostream>
using namespace std;
int main(void) {
int N;
int K;
long long h[100010];
long long dp[100010];
long long tmp;
long long tnp;
cin >> N >> K;
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 <= min(K, N - 1); i++) {
... | [
"literal.number.change",
"assignment.value.change"
] | 961,757 | 961,758 | u456213708 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long a[101010], f[101010];
int n, k;
main() {
cin >> n >> k;
for (int i = 2; i <= n; i++)
f[i] = 1e11;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= i - k; j--)
f[i] = min(f[i], f[j] + abs(... | #include <bits/stdc++.h>
using namespace std;
long long a[101010], f[101010];
int n, k;
main() {
cin >> n >> k;
for (int i = 2; i <= n; i++)
f[i] = 1e11;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= i - k && j >= 1; j--)
f[i] = min(f[i], f... | [
"control_flow.loop.for.condition.change"
] | 961,763 | 961,764 | u498792596 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); ... | #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,783 | 961,784 | u624773401 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); ... | #include "bits/stdc++.h"
using namespace std;
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr); ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,785 | 961,784 | u624773401 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n, k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, 1500000009);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, 1500000009);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j < 0)
break;
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,786 | 961,787 | u990764614 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n + 1];
int niza[n + 1];
for (int i = 1; i <= n; i++) {
cin >> niza[i];
dp[i] = INT_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j + 1 <= n)
d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int dp[n + 1];
int niza[n + 1];
for (int i = 1; i <= n; i++) {
cin >> niza[i];
dp[i] = INT_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j <= n)
dp[i ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,794 | 961,795 | u430341757 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j < k; j++) {
if ((i - j) >= 0) {
int z = abs(... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
int z = abs... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,798 | 961,799 | u856936587 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 0;
for (int j = 1; j < k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
int z = abs... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 961,800 | 961,799 | u856936587 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 0;
for (int j = 1; j < k; j++) {
if ((i - j) >= 0) {
int z = abs(h[i] - h[... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int c[n];
c[0] = 0;
for (int i = 1; i < n; i++) {
int x = 1000000000;
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
int z = abs... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,801 | 961,799 | u856936587 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> f(n), a(n);
for (int &i : a)
cin >> i;
for (int i = n - 2; i >= 0; i--) {
f[i] = 1 << 30;
for (int j = 1; j <= k; j++)
if (i + k < n)
f[i] = min(f[i], abs(a[i] - a[i + k]) + f[i + k]);
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> f(n), a(n);
for (int &i : a)
cin >> i;
for (int i = n - 2; i >= 0; i--) {
f[i] = 1 << 30;
for (int j = 1; j <= k; j++)
if (i + j < n)
f[i] = min(f[i], abs(a[i] - a[i + j]) + f[i + j]);
}... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 961,810 | 961,811 | u251828455 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int min(int x, int y) { return (x >= y) ? y : x; }
int main() {
int n, k, h[100005] = {0}, result[100005] = {0}, i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> h[i];
for (i = 1; i < n; i++) {
result[i] = 99999;
for (j = i - 1; j >= 0 && j >= i - k; ... | #include <bits/stdc++.h>
using namespace std;
int min(int x, int y) { return (x >= y) ? y : x; }
int main() {
int n, k, h[100005] = {0}, result[100005] = {0}, i, j;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> h[i];
for (i = 1; i < n; i++) {
result[i] = INT_MAX;
for (j = i - 1; j >= 0 && j >= i - k... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 961,814 | 961,815 | u771788598 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S s... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S s... | [
"expression.operation.unary.arithmetic.remove"
] | 961,816 | 961,817 | u225344943 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S s... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S s... | [
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 961,818 | 961,817 | u225344943 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S s... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define MP make_pair
#define PB push_back
#define P push
#define f first
#define se second
#define S s... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 961,819 | 961,817 | u225344943 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
using namespace std;
int solve(int *dp, int *A, int i, int k) {
if (dp[i] >= 0)
return dp[i];
int mini = INT_MAX;
for (int j = i - k; j < i; j++) {
mini = min(mini, solve(dp, A, j, k) + abs(A[i] - A[j]));
}
dp[i] = mini;
retur... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
using namespace std;
int solve(int *dp, int *A, int i, int k) {
if (dp[i] >= 0)
return dp[i];
int mini = INT_MAX;
for (int j = i - k; j < i; j++) {
mini = min(mini, solve(dp, A, j, k) + abs(A[i] - A[j]));
}
dp[i] = mini;
retur... | [
"assignment.change"
] | 961,837 | 961,838 | u917233175 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100000 + 1];
ll f(ll n, ll a[], ll k) {
if (dp[n] != -1)
return dp[n];
ll t = INT_MAX;
for (ll i = 1; i <= k; i++) {
if ((n - i) >= 0) {
ll c = abs(a[n] - a[n - i]) + f(n - i, a, k);
if (c < t)
t = c;
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[100000 + 1];
ll f(ll n, ll a[], ll k) {
if (dp[n] != -1)
return dp[n];
ll t = INT_MAX;
for (ll i = 1; i <= k; i++) {
if ((n - i) > 0) {
ll c = abs(a[n] - a[n - i]) + f(n - i, a, k);
if (c < t)
t = c;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,839 | 961,840 | u420703524 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <=... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,843 | 961,844 | u611087334 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[10010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= ... | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <=... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,845 | 961,844 | u611087334 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
long long cost[10000] = {};
int calc[10000] = {};
int h[10000] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <= mi... | #include <bits/stdc++.h>
using namespace std;
long long cost[100010] = {};
int calc[100010] = {};
int h[100010] = {};
long long jump(int pos, int k) {
// cout << pos << endl;
if (calc[pos] == 1) {
return cost[pos];
}
if (pos <= 1) {
return 0;
}
long long min_cost = LONG_MAX;
for (int i = 1; i <=... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,846 | 961,844 | u611087334 | cpp |
p03161 | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
long long int dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = 100100;
int N, K;
long long int height[100010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
long long int dp[100010];
for (int i = 0; i < 100010; i++)
dp[i] = 1LL << 60;
int N, K;
long long int height[100010];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - heig... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 961,850 | 961,848 | u942868002 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int ans[n];
ans[0] = 0;
ans[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = i - 1; j >= max(i - k, 0); j--) {
ans[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
long long ans[n];
ans[0] = 0;
ans[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
ans[i] = 1e10;
for (int j = i - 1; j >= max(i - k, 0); j--) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 961,861 | 961,862 | u460878215 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int jump(int n, int K, vector<int> &h, vector<int> &level) {
int L = K;
if (level[n] == -1) {
int BIG_BANG = 1 << 30;
int mini = BIG_BANG;
if (n <= K) {
L = K;
L--;
}
for (int j = 1; j <= L; j++) {
mini = min(mini, abs(h[n] - h[n ... | #include <bits/stdc++.h>
using namespace std;
int jump(int n, int K, vector<int> &h, vector<int> &level) {
int L = K;
if (level[n] == -1) {
const int BIG_BANG = 1 << 30;
int mini = BIG_BANG;
if (n <= K) {
L = n;
L--;
}
for (int j = 1; j <= L; j++) {
mini = min(mini, abs(h[n] ... | [
"assignment.value.change",
"identifier.change"
] | 961,863 | 961,864 | u652790949 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <c... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <c... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,865 | 961,866 | u199371251 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define ri register int
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n... | #include <bits/stdc++.h>
#define ll long long int
#define ri register int
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 961,871 | 961,872 | u938926508 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
using namespace std;
// for (int i = 0; i < N; i++){}
long long N, K;
int main() {
cin >> N >> K;
long long h[N];
long long c[N];
for (long long i = ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
using namespace std;
// for (int i = 0; i < N; i++){}
long long N, K;
int main() {
cin >> N >> K;
long long h[N];
long long c[N];
for (long long i = ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 961,873 | 961,874 | u085853565 | cpp |
p03161 | #include <bits/stdc++.h>
#define JN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mod 1000000007
#define pb push_back
#define mp make_pair
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll frog[n + 2], cost[n + 2];
for (in... | #include <bits/stdc++.h>
#define JN ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mod 1000000007
#define pb push_back
#define mp make_pair
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll frog[n + 2], cost[n + 2];
for (in... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 961,875 | 961,876 | u835865879 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1])... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1])... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,887 | 961,888 | u415754428 | cpp |
p03161 | #include <bits/stdc++.h>
#include <cstdlib>
#define ll long long
#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define MX 100010
using namespace std;
int N, K;
vector<int> h;
vector<int> dp;
int dpm;
int main() {
cin >> N >> K;
h.resize(N);
dp.resize(N);
FOR(i, 0, N) cin >> h[i];
dp[0] = 0;
FOR... | #include <bits/stdc++.h>
#include <cstdlib>
#define ll long long
#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define MX 100010
using namespace std;
int N, K;
vector<int> h;
vector<int> dp;
int dpm;
int main() {
cin >> N >> K;
h.resize(N);
dp.resize(N);
FOR(i, 0, N) cin >> h[i];
dp[0] = 0;
FOR... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,894 | 961,895 | u056863173 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
template <cl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
const int INF = 1e9;
template <cl... | [
"expression.operation.binary.add"
] | 961,896 | 961,897 | u863279562 | cpp |
p03161 | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n;
ll arr[100010];
ll dp[100010];
ll k;... | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n;
ll arr[100010];
ll dp[100010];
ll k;... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,900 | 961,901 | u512803662 | cpp |
p03161 | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n, k;
ll dp[100010];
ll arr[100010];
i... | #include <bits/stdc++.h>
/*
code credits : ਜ਼ੈਲਦਾਰ
dashan jot singh
*/
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define inf LLONG_MAX
#define p pair<ll, ll>
ll n, k;
ll dp[100010];
ll arr[100010];
i... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 961,902 | 961,903 | u512803662 | cpp |
p03161 | #include <bits/stdc++.h>
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pll pair<long long, long long>... | #include <bits/stdc++.h>
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define pll pair<long long, long long>... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 961,904 | 961,905 | u968786273 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i... | [
"literal.number.change",
"call.arguments.change"
] | 961,906 | 961,907 | u076503518 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, a, N) for (int i... | [
"literal.number.change",
"call.arguments.change"
] | 961,908 | 961,907 | u076503518 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#define MAXN 100500
using namespace std;
int n, k;
int minim;
int h[MAXN];
int ans[MAXN];
int ogr;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
ans[1] = 0;
ans[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
if (i ... | #include <algorithm>
#include <iostream>
#define MAXN 100500
using namespace std;
int n, k;
int minim;
int h[MAXN];
int ans[MAXN];
int ogr;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
ans[1] = 0;
ans[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++) {
if (i ... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change"
] | 961,914 | 961,915 | u290335371 | cpp |
p03161 | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operation.binary.remove",
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 961,925 | 961,924 | u050698451 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
const long long INF = 1e16;
long long dp[N];
fill(dp, dp + N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = i - K; j < i; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
const long long INF = 1e16;
long long dp[N];
fill(dp, dp + N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = i - K; j < i; ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 961,926 | 961,927 | u413492096 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100009], f[100009];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
fill(f + 1, f + 1 + n, LONG_MAX);
f[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k && i ... | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100009], f[100009];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
fill(f + 1, f + 1 + n, 1e9 + 9);
f[1] = 0;
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k && i -... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 961,934 | 961,935 | u568218103 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> cost(n, 0);
for (int i = 1; i < n; i++) {
int temp = INT_MAX;
for (int j = 0; j <= k && i - j >= 0; j++)
temp = min(abs(arr[i - j] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> cost(n, 0);
for (int i = 1; i < n; i++) {
int temp = INT_MAX;
for (int j = 1; j <= k && i - j >= 0; j++)
temp = min(abs(arr[i - j] ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 961,938 | 961,939 | u476987752 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.