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 <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 959,023 | 959,024 | u731665172 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 959,025 | 959,024 | u731665172 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 959,023 | 959,026 | u731665172 | cpp |
p03161 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 959,025 | 959,026 | u731665172 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define LONGMAX 1e18
#define MOD 1000000007
#define mp make_pair
#define endl "\n"
#define test() \
ull t; ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define LONGMAX 1e18
#define MOD 1000000007
#define mp make_pair
#define endl "\n"
#define test() \
ull t; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,039 | 959,040 | u744208278 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define LONGMAX 1e18
#define MOD 1000000007
#define mp make_pair
#define endl "\n"
#define test() \
ull t; ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define LONGMAX 1e18
#define MOD 1000000007
#define mp make_pair
#define endl "\n"
#define test() \
ull t; ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 959,041 | 959,040 | u744208278 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define LONGMAX 1e18
#define MOD 1000000007
#define mp make_pair
#define endl "\n"
#define test() \
ull t; ... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define LONGMAX 1e18
#define MOD 1000000007
#define mp make_pair
#define endl "\n"
#define test() \
ull t; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 959,043 | 959,040 | u744208278 | cpp |
p03161 | // B - Frog 2
#include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
#define chmin(x, y) x = min(x, y)
int main() {
int INF = 1e+9, N, K;
cin >> N >> K;
vector<int> H(N), dp(N, INF);
rp(i, 0, N) cin >> H[i]; // i:[0,N-1]
dp[0] = 0;
rp(i, 1, N) { ... | // B - Frog 2
#include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
#define chmin(x, y) x = min(x, y)
int main() {
int INF = 1e+9, N, K;
cin >> N >> K;
vector<int> H(N), dp(N, INF);
rp(i, 0, N) cin >> H[i]; // i:[0,N-1]
dp[0] = 0;
rp(i, 1, N) { ... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.change"
] | 959,044 | 959,045 | u525065967 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define please return
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define please return
... | [
"literal.number.change",
"call.arguments.change"
] | 959,048 | 959,049 | u407213771 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define please return
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define please return
... | [
"literal.number.change",
"call.arguments.change"
] | 959,050 | 959,049 | u407213771 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mk make_pair
#define pb push_back
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll h[n + 1];
h[0] = 0;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
ll dp[n + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mk make_pair
#define pb push_back
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
ll h[n + 1];
h[0] = 0;
int k;
cin >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
ll dp[n + ... | [
"literal.number.change",
"assignment.value.change"
] | 959,057 | 959,058 | u507641224 | cpp |
p03161 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
deque<long long> heights;
deque<long long> costs;
costs.push_back(0);
long long height;
cin >> height;
heights.pus... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
deque<long long> heights;
deque<long long> costs;
costs.push_back(0);
long long height;
cin >> height;
heights.pus... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 958,593 | 958,594 | u535668860 | cpp |
p03161 | #include <iostream>
#define mxn 100010
#define inf 10001
using namespace std;
int ar[mxn], dp[mxn];
int solve(int n, int k) {
if (n == 1)
return 0;
if (n < 1)
return inf;
if (dp[n] != -1)
return dp[n];
int ans = 100010;
for (int i = 1; i <= k; ++i)
ans = min(ans, solve(n - i, k) + abs(ar[n] ... | #include <iostream>
#define mxn 100010
#define inf 10001
using namespace std;
int ar[mxn], dp[mxn];
int solve(int n, int k) {
if (n == 1)
return 0;
if (n < 1)
return inf;
if (dp[n] != -1)
return dp[n];
int ans = (1 << 30);
for (int i = 1; i <= k; ++i)
ans = min(ans, solve(n - i, k) + abs(ar[... | [] | 958,601 | 958,602 | u907329403 | cpp |
p03161 | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
#define INF (int)1e4 + 10
using namespace std;
int ar[mxn], dp[mxn];
// simple recursive
int solve(int n, int k) {
if (n == 0)
return 0;
if (n < 0)
return INF;
if (dp[n] != -1)
return dp[n];
int ans = INF;
for (int i = 1; i <= k; ++i) {
... | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
#define INF (int)1e4 + 10
using namespace std;
int ar[mxn], dp[mxn];
// simple recursive
int solve(int n, int k) {
if (n == 0)
return 0;
if (n < 0)
return INF;
if (dp[n] != -1)
return dp[n];
int ans = INT_MAX;
for (int i = 1; i <= k; ++i) {
... | [
"variable_declaration.value.change",
"identifier.change"
] | 958,603 | 958,604 | u907329403 | cpp |
p03161 | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
using namespace std;
int ar[mxn], dp[mxn];
// simple recursive
int solve(int n, int k) {
if (n == 0)
return 0;
if (n < 0)
return mxn;
if (dp[n] != -1)
return dp[n];
int ans = mxn;
for (int i = 1; i <= k; ++i) {
ans = min(ans, solve(n - i... | #include <bits/stdc++.h>
#define mxn (int)1e5 + 10
using namespace std;
int ar[mxn], dp[mxn];
// simple recursive
int solve(int n, int k) {
if (n == 0)
return 0;
if (n < 0)
return mxn;
if (dp[n] != -1)
return dp[n];
int ans = INT_MAX;
for (int i = 1; i <= k; ++i) {
ans = min(ans, solve(n... | [
"variable_declaration.value.change",
"identifier.change"
] | 958,605 | 958,606 | u907329403 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define PI 3.14159265358979323846
#define MOD 1000000007
#define INF (int)1e9
using namespace std;
using namespace __gnu_pbds;
// typedef tree<TYPE, null_type, less<TYPE>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set; typedef tree<TYPE... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define PI 3.14159265358979323846
#define MOD 1000000007
#define INF (int)1e9
using namespace std;
using namespace __gnu_pbds;
// typedef tree<TYPE, null_type, less<TYPE>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set; typedef tree<TYPE... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 958,613 | 958,614 | u027479217 | cpp |
p03161 | #include "bits/stdc++.h";
using namespace std;
// int minCostFrom(int curr, const vector<int>& h, int K, vector<int>& memo) {
// int N = h.size();
// if (curr == N - 1) {
// return 0;
// }
// if (memo[curr] >= 0) {
// return memo[curr];
// }
//
// int minTemp = 1e9;
// for (int k = ... | #include "bits/stdc++.h"
using namespace std;
// int minCostFrom(int curr, const vector<int>& h, int K, vector<int>& memo) {
// int N = h.size();
// if (curr == N - 1) {
// return 0;
// }
// if (memo[curr] >= 0) {
// return memo[curr];
// }
//
// int minTemp = 1e9;
// for (int k = 1... | [] | 958,619 | 958,620 | u138886316 | cpp |
p03161 | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int MOD = 1e9 + 7... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <bits/stdc++.h>
#include <cstdint>
#include <limits>
#include <queue>
#include <type_traits>
using namespace std;
int MOD = 1e9 + 7... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 958,628 | 958,629 | u759162415 | cpp |
p03161 | // Includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdlib>
#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 <sta... | // Includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdlib>
#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 <sta... | [
"literal.number.change",
"variable_declaration.value.change"
] | 958,634 | 958,635 | u200456154 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define pp pair<int, int>
#define rep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define pp pair<int, int>
#define rep(i, n) ... | [
"assignment.change"
] | 958,638 | 958,639 | u443971699 | cpp |
p03161 | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define speedhack \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define fromfile ... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define speedhack \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define fromfile ... | [] | 958,646 | 958,647 | u537077363 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define trace(it, mp) for (auto it = (mp).begin(); it != (mp).end(); it++)
#define fr(i, n) for (ll i = 0; i < n; i++)
#define mod 1000000000
using namespace std;
// covert number to string to_string(x);
ll h(ll a[], ll n, ll k) {
ll dp[n + 1];
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define trace(it, mp) for (auto it = (mp).begin(); it != (mp).end(); it++)
#define fr(i, n) for (ll i = 0; i < n; i++)
#define mod 1000000000
using namespace std;
// covert number to string to_string(x);
ll h(ll a[], ll n, ll k) {
ll dp[n + 1];
... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"function.return_value.change"
] | 958,654 | 958,655 | u667598279 | cpp |
p03161 | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | [
"call.remove"
] | 958,661 | 958,662 | u745008216 | cpp |
p03161 | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | [
"literal.number.change",
"assignment.value.change"
] | 958,663 | 958,662 | u745008216 | cpp |
p03161 | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | [
"call.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 958,661 | 958,664 | u745008216 | cpp |
p03161 | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | #include <bits/stdc++.h>
const unsigned int M = 1000000007;
#define all(v) (v).begin(), (v).end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define mpp make_pair
#define int long long
#define N 100002
#define endl "\n"
#define fr(i, n) for (int i = 0; i < n; i++)
int power(int x, int y) {
int res = 1;... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 958,663 | 958,664 | u745008216 | cpp |
p03161 | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dep(i, a, b) for (int i = a; i >= b; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
const long long INF = 1e18, MAXN = 1e5, MOD = 1e9 + 7, N = 1000010;
typedef long lo... | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; i++)
#define dep(i, a, b) for (int i = a; i >= b; i--)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
const long long INF = 1e18, MAXN = 1e5, MOD = 1e9 + 7, N = 1000010;
typedef long lo... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 958,670 | 958,671 | u809054673 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define llu unsigned long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define eb emplace_back
#define M 1000000007
#define vi vector<int>
#define vlli vector<lli>
#define pi pair<int, int>
#define mp make_pair
#define mapi map<int, int>
i... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define llu unsigned long long int
#define fo(i, n) for (int i = 0; i < n; i++)
#define eb emplace_back
#define M 1000000007
#define vi vector<int>
#define vlli vector<lli>
#define pi pair<int, int>
#define mp make_pair
#define mapi map<int, int>
i... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 958,693 | 958,692 | u308644372 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 0;
return 0;
}
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int val[N];
for (int i = 0; i < N; i++) {
val[i] = INT_MAX;
}
val[0] = 0;
for (int i = 1; i < N; i+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (N == 1) {
cout << 0;
return 0;
}
int h[N];
for (int i = 0; i < N; i++) {
cin >> h[i];
}
int val[N];
for (int i = 0; i < N; i++) {
val[i] = INT_MAX;
}
val[0] = 0;
for (int i = 1; i < N; i+... | [] | 958,694 | 958,695 | u608574730 | cpp |
p03161 | // A - Frog 1 / ATCODER
// Time Limit: 2 sec / Memory Limit: 1024 MB
// Score :
// 100
// points
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll p = 1; p <= n; p++) {
cin >> a[p];
}
ll dp[100002] = {0};
dp[2] = abs(a[2] - a[1... | // A - Frog 1 / ATCODER
// Time Limit: 2 sec / Memory Limit: 1024 MB
// Score :
// 100
// points
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll p = 1; p <= n; p++) {
cin >> a[p];
}
ll dp[100002] = {0};
dp[2] = abs(a[2] - a[1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 958,696 | 959,061 | u158107532 | cpp |
p03161 | // A - Frog 1 / ATCODER
// Time Limit: 2 sec / Memory Limit: 1024 MB
// Score :
// 100
// points
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll p = 1; p <= n; p++) {
cin >> a[p];
}
ll dp[100002] = {0};
dp[2] = abs(a[2] - a[1... | // A - Frog 1 / ATCODER
// Time Limit: 2 sec / Memory Limit: 1024 MB
// Score :
// 100
// points
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll p = 1; p <= n; p++) {
cin >> a[p];
}
ll dp[100002] = {0};
dp[2] = abs(a[2] - a[1... | [
"control_flow.loop.for.condition.change"
] | 959,062 | 959,061 | u158107532 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, m;
int dp[N], h[N];
int main() {
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 < k; i++) {
m = 1e4;
for (int j = i - 1; j >= 0; j--) {
m = min(m,... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, m;
int dp[N], h[N];
int main() {
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 < k; i++) {
m = 1e9;
for (int j = i - 1; j >= 0; j--) {
m = min(m,... | [
"literal.number.change",
"assignment.value.change"
] | 959,067 | 959,068 | u937892154 | 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.at(i);
if (N - 1 <= K)
cout << abs(h[0] - h[N - 1]) << endl;
else {
vector<int> dp(N);
for (int i = N - 1; N - (K + 1) <= i; i--)
dp[i] = abs(h[N ... | #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.at(i);
if (N - 1 <= K)
cout << abs(h[0] - h[N - 1]) << endl;
else {
vector<int> dp(N);
for (int i = N - 1; N - (K + 1) <= i; i--)
dp[i] = abs(h[N ... | [
"control_flow.loop.for.initializer.change"
] | 959,069 | 959,070 | u101018317 | cpp |
p03161 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#defi... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#defi... | [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 959,086 | 959,087 | u457601965 | cpp |
p03161 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#defi... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#defi... | [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 959,088 | 959,087 | u457601965 | cpp |
p03161 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#defi... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//マクロ
// forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#defi... | [
"expression.operator.compare.change",
"preprocessor.define.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change"
] | 959,089 | 959,087 | u457601965 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | [
"call.remove"
] | 959,090 | 959,091 | u189092937 | cpp |
p03161 | /*input
5 3
10 30 40 50 20
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
#define mpr make_pair
#define MX 1000000007
#define ui unsigned int
#define ll long long
#define ld long dou... | /*input
3 1
10 20 10
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define all(v) (v).begin(), (v).end()
#define mpr make_pair
#define MX 1000000007
#define ui unsigned int
#define ll long long
#define ld long double
#d... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,100 | 959,101 | u383638667 | cpp |
p03161 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int my_abs(int x) { return x < 0 ? -x : x; }
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
unsigned long long dp[1000010];
dp[0] = 0;
dp[1] = my_abs(h[1] - h[0]);
... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int my_abs(int x) { return x < 0 ? -x : x; }
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
unsigned long long dp[100010];
dp[0] = 0;
dp[1] = my_abs(h[1] - h[0]);
f... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.branch.if.condition.change"
] | 959,121 | 959,122 | u341846697 | cpp |
p03161 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int my_abs(int x) { return x < 0 ? -x : x; }
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
unsigned long long dp[100010];
dp[0] = 0;
dp[1] = my_abs(h[1] - h[0]);
f... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int my_abs(int x) { return x < 0 ? -x : x; }
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
unsigned long long dp[100010];
dp[0] = 0;
dp[1] = my_abs(h[1] - h[0]);
f... | [
"control_flow.branch.if.condition.change"
] | 959,123 | 959,122 | u341846697 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
lli dp[10100... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
lli dp[10100... | [
"expression.operation.binary.add"
] | 959,126 | 959,127 | u041513069 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
int start;
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
start = i - k;
if... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
int start;
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[0] = 0;
for (int i = 1; i < n; i++) {
start = i - k;
if... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,132 | 959,133 | u565840775 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define fast \
ios_base::sync_with_st... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define fast \
ios_base::sync_with_st... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,138 | 959,139 | u167289467 | cpp |
p03161 | #include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_wi... | #include <bits/stdc++.h>
//#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_wi... | [
"control_flow.loop.for.condition.change"
] | 959,150 | 959,151 | u524492594 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 100010;
}
dp[0] = 0;
for (int i = 0; i < n; i++) { //今の足場
for (int j = 1; j <= k; j++) { //どこまで飛べるか
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) { //今の足場
for (int j = 1; j <= k; j++) { //どこまで飛べるか
... | [
"literal.number.change",
"assignment.value.change"
] | 959,158 | 959,159 | u255302563 | cpp |
p03161 | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define tin \
cin >> t; \
while (t--)
#define pii pair<int, int>
#define endl '\n'
#define MIN... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define tin \
cin >> t; \
while (t--)
#define pii pair<int, int>
#define endl '\n'
#define MIN... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,164 | 959,165 | u240780567 | cpp |
p03161 | #include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
#define REP(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Code Starts...
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];... | #include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
#define REP(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Code Starts...
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 959,166 | 959,167 | u374180104 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, k, a[100005], dp[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
int b = 100000;
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, k, a[100005], dp[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
int b = 1000000000;
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change"
] | 959,171 | 959,172 | u282636125 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, k, a[100005], dp[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
int b = 100000;
for (i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, k, a[100005], dp[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
int b = 1000000000;
fo... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change"
] | 959,173 | 959,172 | u282636125 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | [
"literal.number.change",
"call.arguments.change"
] | 959,178 | 959,179 | u125205981 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | [
"literal.number.change",
"call.arguments.change"
] | 959,180 | 959,179 | u125205981 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | [
"call.arguments.change"
] | 959,178 | 959,181 | u125205981 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | #include <bits/stdc++.h>
using namespace std;
#define sorted(a) sort(a.begin(), a.end());
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long unsigned int ll;
const long mod = 1e9 + 7;
int main(void) {
#ifdef DEBUG
freopen("input.txt", "r", stdin);
#endif
ios_base... | [
"call.arguments.change"
] | 959,180 | 959,181 | u125205981 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> cost(n + 10, 100000);
vector<ll> height(n + 10);
rep(i, n) cin >> height... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
vector<ll> cost(n + 10, INT_MAX);
vector<ll> height(n + 10);
rep(i, n) cin >> heigh... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 959,188 | 959,189 | u297398560 | cpp |
p03161 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vec(x) vector<x>
#define matrix vector<vector<int>>
#define pii pair<int, int>
#define rep(i, s, e) for (int i = ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vec(x) vector<x>
#define matrix vector<vector<int>>
#define pii pair<int, int>
#define rep(i, s, e) for (int i = ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operator.compare.change",
"misc.off_by_one"
] | 959,196 | 959,197 | u008427588 | cpp |
p03161 | #include <bits/stdc++.h>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double lxd;
#define INF 1000000007
#define mem(dp, a) memset(dp, a, sizeof dp)
#define flash \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double lxd;
#define INF 1000000007
#define mem(dp, a) memset(dp, a, sizeof dp)
#define flash \
ios_base::sync_with_stdio(false); ... | [
"control_flow.loop.for.condition.change"
] | 959,200 | 959,201 | u060759930 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, minimum;
cin >> n >> k;
ll a[n], dp[n];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
minimum = 100000;
for (int j = i - 1; j >= 0 && j >= i - k; j--) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, minimum;
cin >> n >> k;
ll a[n], dp[n];
memset(dp, 0, sizeof(dp));
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
minimum = INT_MAX;
for (int j = i - 1; j >= 0 && j >= i - k; j--)... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,202 | 959,203 | u060759930 | cpp |
p03161 | #include <iostream>
using namespace std;
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; ++i)
ci... | #include <iostream>
using namespace std;
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
int h[N + 10];
for (int i = 0; i < N; ++i)
... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 959,206 | 959,207 | u338931519 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> v[i];
}
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j < i && j <= k; j++) {
dp[i] = m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> v[i];
}
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j < i && j <= k; j++) {
dp[i] = m... | [
"assignment.change"
] | 959,212 | 959,213 | u601414164 | 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];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < N; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= K && i - j >= 0; j++) ... | #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];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < N; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= K && i - j >= 0; j++) ... | [] | 959,219 | 959,220 | u691409224 | cpp |
p03161 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int mod(int x) {
if (x > 0)
return x;
return -x;
}
int main() {
int n, k;
cin >> n >> k;
int h[n], result[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i <= k; i++)
result[i] = mod(h[i] - h[0]);
for (int i = k +... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int mod(int x) {
if (x > 0)
return x;
return -x;
}
int main() {
int n, k;
cin >> n >> k;
int h[n], result[n];
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i <= k && i < n; i++)
result[i] = mod(h[i] - h[0]);
for (in... | [
"control_flow.loop.for.condition.change"
] | 959,225 | 959,226 | u375994730 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
void Frog_2(vector<int> &h, int k) {
int n = h.size();
vector<int> dp(n, inf);
/* dp[i] represents the minimum cost to reach the end when you start at i */
// No out of bound acces due to input constraints
dp[n - 1] = 0;
for (int i... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
void Frog_2(vector<int> &h, int k) {
int n = h.size();
vector<int> dp(n, inf);
/* dp[i] represents the minimum cost to reach the end when you start at i */
// No out of bound acces due to input constraints
dp[n - 1] = 0;
for (int i... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,230 | 959,231 | u800932077 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int h[100010];
int dp[100010];
int main() {
i... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int h[100010];
int dp[100010];
int main() {
i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,232 | 959,233 | u475843109 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100001);
vector<int> dp(100001, 10001);
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int stone = 0; stone < n; stone++) {
for (int jump = 1; jump <= k; jump++) {
if (jump + ston... | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100001);
vector<int> dp(100001, 100001 * 10001);
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int stone = 0; stone < n; stone++) {
for (int jump = 1; jump <= k; jump++) {
if (ju... | [
"assignment.change"
] | 959,237 | 959,235 | u637897856 | cpp |
p03161 | #include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
string s;
int main() {
// 10 30 40 50 20
int n, k;
scanf("%d %d", &n, &k);
int dp[n];
for (int i = 0; i < n; i++)
scanf("%d", &dp[i]);
int a[n] = {};
a[0] = 0;
a[1] ... | #include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
string s;
int main() {
// 10 30 40 50 20
int n, k;
scanf("%d %d", &n, &k);
int dp[n];
for (int i = 0; i < n; i++)
scanf("%d", &dp[i]);
int a[n] = {};
a[0] = 0;
a[1] ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,238 | 959,239 | u163123674 | cpp |
p03161 | #include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
string s;
int main() {
// 10 30 40 50 20
int n, k;
scanf("%d %d", &n, &k);
int dp[n];
for (int i = 0; i < n; i++)
scanf("%d", &dp[i]);
int a[n] = {};
a[0] = 0;
a[1] ... | #include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
string s;
int main() {
// 10 30 40 50 20
int n, k;
scanf("%d %d", &n, &k);
int dp[n];
for (int i = 0; i < n; i++)
scanf("%d", &dp[i]);
int a[n] = {};
a[0] = 0;
a[1] ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,240 | 959,239 | u163123674 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int findcost(int n, int k, vector<int> h) {
int dp[n + 1];
dp[1] = 0;
for (int i = 2; i <= k; i++) {
dp[i] = abs(h[i] - h[1]);
}
for (int j = 1 + k; j <= n; j++) {
int mindp = 10000;
for (int i = 1; i <= k; i++) {
mindp = min(mindp, dp[j - i]... | #include <bits/stdc++.h>
using namespace std;
int findcost(int n, int k, vector<int> h) {
int dp[n + 1];
dp[1] = 0;
for (int i = 2; i <= k; i++) {
dp[i] = abs(h[i] - h[1]);
}
for (int j = 1 + k; j <= n; j++) {
int mindp = INT_MAX;
for (int i = 1; i <= k; i++) {
mindp = min(mindp, dp[j - ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 959,241 | 959,242 | u499126356 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | [
"literal.number.change",
"assignment.value.change"
] | 959,243 | 959,244 | u888863600 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 959,245 | 959,244 | u888863600 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 959,246 | 959,244 | u888863600 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
#define For(i, m, n) for (int i = m; i < n; i++)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define ull unsigned long long
#define lli long long int
#define pb push_back
ll mob = 1000000007;
using namespace std;
int main() {
int n, k;
cin >> n ... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 959,247 | 959,244 | u888863600 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define max1 1000005
#define siz 100000
#define mod 998244353
#define inf 1e18 + 5
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
#define jam(x) cout << "Case #" << x << ": "
typedef pair<ll, ll> pr;
int main() {
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
using namespace std;
#define max1 1000005
#define siz 100000
#define mod 998244353
#define inf 1e18 + 5
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
#define jam(x) cout << "Case #" << x << ": "
typedef pair<ll, ll> pr;
int main() {
ios_base::sync_with_stdio(false);... | [] | 959,256 | 959,257 | u781876525 | cpp |
p03161 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,258 | 959,259 | u154645927 | cpp |
p03161 | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | #pragma gcc optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort(ALL(V)) //小さい方からソート
#define REV(V) reverse(ALL(V)) //リバース
#define RSORT(V) ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 959,260 | 959,259 | u154645927 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = 1e17;
}
dp[n - 1] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll dp[n];
for (int i = 0; i < n; ++i) {
dp[i] = 1e17;
}
dp[n - 1] = 0;
for (... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 959,261 | 959,262 | u139996323 | cpp |
p03161 | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"call.arguments.change"
] | 959,264 | 959,265 | u906639862 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans[n] = {};
for (int i = 1; i < n; ++i) {
ans[i] = INT_MAX;
for (int j = 1; j <= k and (i - j) >= 0; ++j)
ans[i] = min(ans[i], abs(a[i] - a[i - j]) + ans... | #include <bits/stdc++.h>
using namespace std;
main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans[n] = {};
for (int i = 1; i < n; ++i) {
ans[i] = INT_MAX;
for (int j = 1; j <= k and (i - j) >= 0; ++j)
ans[i] = min(ans[i], abs(a[i] - a[i - j]) + ans... | [
"expression.operation.binary.add"
] | 959,271 | 959,272 | u627361172 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = i - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = i - ... | [] | 959,277 | 959,278 | u990149949 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k, i, j;
cin >> N >> k;
int h[N], dp[N];
for (i = 0; i < N; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (i = 0; i < N; i++) {
for (j = 1; (j < k) && ((i + j) < N); j++) {
dp[i + j] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k, i, j;
cin >> N >> k;
int h[N], dp[N];
for (i = 0; i < N; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (i = 0; i < N; i++) {
for (j = 1; (j <= k) && ((i + j) < N); j++) {
dp[i + j]... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,279 | 959,280 | u345094009 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k, i, j;
cin >> N >> k;
int h[N], dp[N];
for (i = 0; i < N; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (i = 0; i < N; i++) {
for (j = 0; (j < k) && ((i + j) < N); j++) {
dp[i + j] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k, i, j;
cin >> N >> k;
int h[N], dp[N];
for (i = 0; i < N; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (i = 0; i < N; i++) {
for (j = 1; (j <= k) && ((i + j) < N); j++) {
dp[i + j]... | [
"literal.number.change",
"assignment.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"
] | 959,281 | 959,280 | u345094009 | cpp |
p03161 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll a[100005], dp[100005];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
for (ll i = 2; i <= n; ++i) {
ll mn = 1e15;
for (ll j = 0; j <= k; ++j) {
if (i - j >= 0) {
mn = min(mn, d... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll a[100005], dp[100005];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
for (ll i = 2; i <= n; ++i) {
ll mn = 1e15;
for (ll j = 1; j <= k; ++j) {
if (i - j > 0) {
mn = min(mn, dp... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,286 | 959,287 | u967326959 | cpp |
p03161 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll a[100005], dp[100005];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
for (ll i = 2; i <= n; ++i) {
ll mn = 1e15;
for (ll j = 1; j <= k; j++) {
if (i - j >= 0) {
mn = min(mn, d... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll a[100005], dp[100005];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
for (ll i = 2; i <= n; ++i) {
ll mn = 1e15;
for (ll j = 1; j <= k; ++j) {
if (i - j > 0) {
mn = min(mn, dp... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,288 | 959,287 | u967326959 | cpp |
p03161 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll a[100005], dp[100005];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
for (ll i = 2; i <= n; ++i) {
ll mn = 1e9;
for (ll j = 1; j <= k; j++) {
if (i - j >= 0) {
mn = min(mn, dp... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll a[100005], dp[100005];
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 1; i <= n; ++i) {
cin >> a[i];
}
for (ll i = 2; i <= n; ++i) {
ll mn = 1e15;
for (ll j = 1; j <= k; ++j) {
if (i - j > 0) {
mn = min(mn, dp... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,289 | 959,287 | u967326959 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD 1000000007
#define nl cout << endl
#define rt int Q[100005] = {0}
#define mp make_pair
#define test() \
... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD 1000000007
#define nl cout << endl
#define rt int Q[100005] = {0}
#define mp make_pair
#define test() \
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 959,290 | 959,291 | u775378453 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
const int inf = 1e9 + 7;
//#define for(i, a, b) for(int i=a; i<b; i++)
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
memset(dp, inf, size... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl "\n"
const int inf = 1e9 + 7;
//#define for(i, a, b) for(int i=a; i<b; i++)
void solve() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
memset(dp, inf, size... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,292 | 959,293 | u515638999 | cpp |
p03161 | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
memset(b, 0x3f, 4 * n);
... | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
memset(b, 0x3f, 4 * n);
... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 959,298 | 959,299 | u951519233 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int N;
int K;
int h[100005];
int dp[100005];
int solve(int idx) {
int &ret = dp[idx];
if (~ret)
return ret;
ret = 0;
if (idx < N - 1)
ret = abs(h[idx + 1] - h[idx]) + solve(idx + 1);
for (int i = 2; i <= K; i++)
if (idx < N - 2)
ret = min(ret,... | #include <bits/stdc++.h>
using namespace std;
int N;
int K;
int h[100005];
int dp[100005];
int solve(int idx) {
int &ret = dp[idx];
if (~ret)
return ret;
ret = 0;
if (idx < N - 1)
ret = abs(h[idx + 1] - h[idx]) + solve(idx + 1);
for (int i = 2; i <= K; i++)
if (idx < N - i)
ret = min(ret,... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 959,306 | 959,307 | u409226959 | cpp |
p03161 | //
// Created by 13783 on 2020/4/1.
//
#include <iostream>
using namespace std;
const int N = 1e5 + 5;
const int K = 100;
int h[N];
int dp[N];
int n;
int k;
const int maxn = 0x3fffffff;
void solve() {
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = maxn;
}
// dp[i]为跳到第i步的最小代价
for (int i = 2; i <= n; i+... | //
// Created by 13783 on 2020/4/1.
//
#include <iostream>
using namespace std;
const int N = 1e5 + 5;
const int K = 100;
int h[N];
int dp[N];
int n;
int k;
const int maxn = 0x3fffffff;
void solve() {
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = maxn;
}
// dp[i]为跳到第i步的最小代价
for (int i = 2; i <= n; i... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 959,311 | 959,312 | u524496896 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif // ONLINE_JUDGE
int n, k;
cin >> n >> k;
int arr[n];
int dp[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif // ONLINE_JUDGE
int n, k;
cin >> n >> k;
int arr[n];
int dp[n];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
... | [
"literal.number.change",
"assignment.value.change"
] | 959,315 | 959,316 | u813942839 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(... | #include <bits/stdc++.h>
using namespace std;
#define ld long double
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 959,317 | 959,318 | u694246224 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9 + 5;
int hs[100100];
ll dp[100100];
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> hs[i];
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
int h = hs[i];
ll m = INF;
for (int k = 1; k ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9 + 5;
int hs[100100];
ll dp[100100];
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> hs[i];
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
int h = hs[i];
ll m = INF;
for (int k = 1; k ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,321 | 959,322 | u740626584 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9 + 1;
int hs[100100];
ll dp[100100];
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> hs[i];
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
int h = hs[i];
ll m = INF;
for (int k = 1; k ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9 + 5;
int hs[100100];
ll dp[100100];
void solve() {
int N, K;
cin >> N >> K;
for (int i = 1; i <= N; ++i)
cin >> hs[i];
dp[1] = 0;
for (int i = 2; i <= N; ++i) {
int h = hs[i];
ll m = INF;
for (int k = 1; k ... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,323 | 959,322 | u740626584 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = llabs(a[0] - a[1]);
for (i = 2; i < n; i++) {
ll m = 100000000000;
for (ll j = 1; j <= k; j++)
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = llabs(a[0] - a[1]);
for (i = 2; i < n; i++) {
ll m = 10000000000000000;
for (ll j = 1; j <= k; j++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,324 | 959,325 | u281069013 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = llabs(a[0] - a[1]);
for (i = 2; i < n; i++) {
ll m = 1000000;
for (ll j = 1; j <= k; j++)
if (i... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll i;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
dp[1] = llabs(a[0] - a[1]);
for (i = 2; i < n; i++) {
ll m = 10000000000000000;
for (ll j = 1; j <= k; j++)
... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 959,327 | 959,325 | u281069013 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio \
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define si size()
#define bk back()
#define popb pop_back()
#define fastio \
ios_base::sync_with_stdio(false)... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.change"
] | 959,330 | 959,331 | u397955542 | cpp |
p03161 | #include <bits/stdc++.h> // Include every standard library
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define input_arr(a, n) ... | #include <bits/stdc++.h> // Include every standard library
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define input_arr(a, n) ... | [] | 959,336 | 959,337 | u939680693 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j;
cin >> n >> k;
vector<int> v(200000, 0);
vector<int> pre(200000, 0);
for (i = 1; i <= n; i++) {
cin >> v[i];
}
int dp[200000];
for (i = 1; i < 200000; i++)
dp[i] = INT_MAX;
dp[1] = 0;
dp[2] = abs(v[2] - v[1]);
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, k, j;
cin >> n >> k;
vector<int> v(200000, 0);
vector<int> pre(200000, 0);
for (i = 1; i <= n; i++) {
cin >> v[i];
}
int dp[200000];
for (i = 1; i < 200000; i++)
dp[i] = INT_MAX;
dp[1] = 0;
dp[2] = abs(v[2] - v[1]);
for (... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 959,340 | 959,341 | u390801047 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 1;
int n, k;
int a[N];
int dp[N];
int solve(int i) {
if (i == 1)
return 0;
if (dp[i] + 1) {
return dp[i];
}
int path, mn = 123456789101;
for (int u = 1; u <= k; u++) {
if (path - u < 1)
continue;
path... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 1;
int n, k;
int a[N];
int dp[N];
int solve(int i) {
if (i == 1)
return 0;
if (dp[i] + 1) {
return dp[i];
}
int path, mn = 123456789101;
for (int u = 1; u <= k; u++) {
if (i - u < 1)
continue;
path = ... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 959,342 | 959,343 | u903920392 | cpp |
p03161 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n, 100000);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n, 1000000000);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for ... | [
"literal.number.change",
"call.arguments.change"
] | 959,346 | 959,345 | u092860766 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, 1e9 + 5);
dp[1] = 0;
for (int i = 1; i < n + 1; i++) {
for (auto j = i + 1; j < i + k + 1; i++) {
if (j <= n) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, 1e9 + 5);
dp[1] = 0;
for (int i = 1; i < n + 1; i++) {
for (auto j = i + 1; j < i + k + 1; j++) {
if (j <= n) {
... | [
"identifier.change"
] | 959,360 | 959,361 | u922651947 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.