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 9
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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
int dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| #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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
long long dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| [
"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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
int dp[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| #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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
long long dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| [
"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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
int dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| #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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
long long h[100010];
long long dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| [
"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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
int dp[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| #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 long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
long long h[100010];
long long dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
| [
"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; \
cin >> t; \
while (t--)
#define pb push_back
#define fr(a, n) for (int i = a; i < n; i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int min = INT_MAX;
for (int j = 1; j <= k and i - j > 0; j++) {
int t = dp[i - j] + abs(h[i] - h[i - j]);
min = min < t ? min : t;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
}
| #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; \
cin >> t; \
while (t--)
#define pb push_back
#define fr(a, n) for (int i = a; i < n; i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int min = INT_MAX;
for (int j = 1; j <= k and i - j >= 0; j++) {
int t = dp[i - j] + abs(h[i] - h[i - j]);
min = min < t ? min : t;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
}
| [
"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; \
cin >> t; \
while (t--)
#define pb push_back
#define fr(a, n) for (int i = a; i < n; i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int min = INT_MAX;
for (int j = 1; j <= k and i - j > 0; j++) {
int t = dp[i - k] + abs(h[i] - h[i - j]);
min = min < t ? min : t;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
}
| #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; \
cin >> t; \
while (t--)
#define pb push_back
#define fr(a, n) for (int i = a; i < n; i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int min = INT_MAX;
for (int j = 1; j <= k and i - j >= 0; j++) {
int t = dp[i - j] + abs(h[i] - h[i - j]);
min = min < t ? min : t;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
}
| [
"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; \
cin >> t; \
while (t--)
#define pb push_back
#define fr(a, n) for (int i = a; i < n; i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int min = INT_MAX;
for (int j = 1; j <= k and i - j >= 0; j++) {
int t = dp[i - k] + abs(h[i] - h[i - j]);
min = min < t ? min : t;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
}
| #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; \
cin >> t; \
while (t--)
#define pb push_back
#define fr(a, n) for (int i = a; i < n; i++)
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int k;
cin >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int min = INT_MAX;
for (int j = 1; j <= k and i - j >= 0; j++) {
int t = dp[i - j] + abs(h[i] - h[i - j]);
min = min < t ? min : t;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
}
| [
"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) { // i:[1,N-1]
for (int j = i - 1; j >= i - K; --j) // j:i-k:[i-1,i-K]
chmin(dp[i], dp[j] + abs(H[j] - H[i]));
}
cout << dp[N - 1] << endl;
}
| // 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) { // i:[1,N-1]
for (int j = i - 1; j >= max(0, i - K); --j) // j:i-k:[i-1,max(0,i-K)]
chmin(dp[i], dp[j] + abs(H[j] - H[i]));
}
cout << dp[N - 1] << endl;
}
| [
"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
constexpr auto AC = 0;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n), dp(n, 100000);
dp[0] = 0;
rep(i, n) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j <= k; j++) {
if (j + i > n - 1)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n - 1] << endl;
please AC;
} | #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
constexpr auto AC = 0;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n), dp(n, 1000000000);
dp[0] = 0;
rep(i, n) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j <= k; j++) {
if (j + i > n - 1)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n - 1] << endl;
please AC;
} | [
"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
constexpr auto AC = 0;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n, 100000);
dp[0] = 0;
rep(i, n) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j <= k; j++) {
if (j + i > n - 1)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n - 1] << endl;
please AC;
} | #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
constexpr auto AC = 0;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n), dp(n, 1000000000);
dp[0] = 0;
rep(i, n) cin >> a[i];
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j <= k; j++) {
if (j + i > n - 1)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n - 1] << endl;
please AC;
} | [
"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 + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 100000;
}
dp[0] = 0;
dp[1] = 0;
dp[2] = dp[1] + abs(h[2] - h[1]);
for (ll i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j >= i) {
break;
}
ll c = dp[i - j] + abs(h[i] - h[i - j]);
dp[i] = min(c, dp[i]);
}
}
cout << 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 + 1];
for (int i = 0; i <= n; i++) {
dp[i] = 10000000000000000;
}
dp[0] = 0;
dp[1] = 0;
dp[2] = dp[1] + abs(h[2] - h[1]);
for (ll i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (j >= i) {
break;
}
ll c = dp[i - j] + abs(h[i] - h[i - j]);
dp[i] = min(c, dp[i]);
}
}
cout << 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.push_back(height);
for (int i = 1; i < n; ++i) {
cin >> height;
heights.push_back(height);
costs.push_back(costs[0] + abs(heights[min(i, k)] - heights[0]));
for (int j = 1; j < min(i, k) - 1; ++j) {
costs[min(i, k)] = min(costs[j] + abs(heights[min(i, k)] - heights[j]),
costs[min(i, k)]);
}
if (i >= k) {
costs.pop_front();
heights.pop_front();
}
}
cout << costs.back();
return 0;
}
| #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.push_back(height);
for (int i = 1; i < n; ++i) {
cin >> height;
heights.push_back(height);
costs.push_back(costs[0] + abs(heights[min(i, k)] - heights[0]));
for (int j = 1; j < min(i, k); ++j) {
costs[min(i, k)] = min(costs[j] + abs(heights[min(i, k)] - heights[j]),
costs[min(i, k)]);
}
if (i >= k) {
costs.pop_front();
heights.pop_front();
}
}
cout << costs.back();
return 0;
}
| [
"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] - ar[n - i]));
return dp[n] = ans;
}
int main() {
int n, k;
cin >> n >> k;
fill(dp, dp + mxn, -1);
for (int i = 1; i <= n; ++i)
cin >> ar[i];
cout << solve(n, k);
return 0;
} | #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[n] - ar[n - i]));
return dp[n] = ans;
}
int main() {
int n, k;
cin >> n >> k;
fill(dp, dp + mxn, -1);
for (int i = 1; i <= n; ++i)
cin >> ar[i];
cout << solve(n, k);
return 0;
} | [] | 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) {
ans = min(ans, solve(n - i, k) + abs(ar[n - i] - ar[n]));
}
return dp[n] = ans;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> ar[i];
for (int i = 0; i < mxn; ++i)
dp[i] = -1;
cout << solve(n - 1, k) << '\n';
return 0;
}
| #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) {
ans = min(ans, solve(n - i, k) + abs(ar[n - i] - ar[n]));
}
return dp[n] = ans;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> ar[i];
for (int i = 0; i < mxn; ++i)
dp[i] = -1;
cout << solve(n - 1, k) << '\n';
return 0;
}
| [
"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, k) + abs(ar[n - i] - ar[n]));
}
return dp[n] = ans;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> ar[i];
for (int i = 0; i < mxn; ++i)
dp[i] = -1;
cout << solve(n - 1, k) << '\n';
return 0;
}
| #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 - i, k) + abs(ar[n - i] - ar[n]));
}
return dp[n] = ans;
}
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> ar[i];
for (int i = 0; i < mxn; ++i)
dp[i] = -1;
cout << solve(n - 1, k) << '\n';
return 0;
}
| [
"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, null_type,
// less_equal<TYPE>, rb_tree_tag, tree_order_statistics_node_update>
// indexed_multiset;
int N, K, A[100000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
int dp[100001];
for (int i = N; i >= 0; i--) {
if (i >= N - 1)
dp[i] = 0;
else {
int mn = INT_MAX;
for (int j = i + 1; j < i + K + 1 && j <= N; j++)
mn = min(mn, abs(A[i] - A[j]) + dp[j]);
dp[i] = mn;
}
}
cout << dp[0] << "\n";
return 0;
}
| #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, null_type,
// less_equal<TYPE>, rb_tree_tag, tree_order_statistics_node_update>
// indexed_multiset;
int N, K, A[100000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
int dp[100000];
for (int i = N - 1; i >= 0; i--) {
if (i == N - 1)
dp[i] = 0;
else {
int mn = INT_MAX;
for (int j = i + 1; j < i + K + 1 && j < N; j++)
mn = min(mn, abs(A[i] - A[j]) + dp[j]);
dp[i] = mn;
}
}
cout << dp[0] << "\n";
return 0;
}
| [
"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 = 1; k <= K; ++k) {
// if (curr + k >= N) {
// break;
// }
// int temp = minCostFrom(curr + k, h, K, memo) + abs(h[curr] - h[curr +
// k]); minTemp = min(temp, minTemp);
// }
// memo[curr] = minTemp;
// return minTemp;
//}
void Main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
// vector<int> memo(N, -1);
// int ans = minCostFrom(0, h, K, memo);
// cout << ans << endl;
// return 0;
vector<int> minCost(N, -1);
minCost[N - 1] = 0;
minCost[N - 2] = abs(h[N - 1] - h[N - 2]);
for (int i = N - 3; i >= 0; --i) {
int tempMin = 1e4 * 1e5;
for (int j = 1; j <= K; ++j) {
if (i + j > N - 1) {
break;
}
tempMin = min(tempMin, minCost[i + j] + abs(h[i] - h[j]));
}
minCost[i] = tempMin;
}
cout << minCost[0] << endl;
}
int main() {
Main();
return 0;
} | #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; k <= K; ++k) {
// if (curr + k >= N) {
// break;
// }
// int temp = minCostFrom(curr + k, h, K, memo) + abs(h[curr] - h[curr +
// k]); minTemp = min(temp, minTemp);
// }
// memo[curr] = minTemp;
// return minTemp;
//}
void Main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
// vector<int> memo(N, -1);
// int ans = minCostFrom(0, h, K, memo);
// cout << ans << endl;
// return 0;
vector<int> minCost(N, -1);
minCost[N - 1] = 0;
minCost[N - 2] = abs(h[N - 1] - h[N - 2]);
for (int i = N - 3; i >= 0; --i) {
int tempMin = 1e4 * 1e5;
for (int j = 1; j <= K; ++j) {
if (i + j > N - 1) {
break;
}
tempMin = min(tempMin, minCost[i + j] + abs(h[i] - h[i + j]));
}
minCost[i] = tempMin;
}
cout << minCost[0] << endl;
}
int main() {
Main();
return 0;
} | [] | 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;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
vector<int> dp(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec[i] = x;
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < n; i++) {
if (i >= k) {
dp[i] = dp[i - 1] + abs(vec[i] - vec[i - 1]);
for (int j = 2; j <= k; j++) {
dp[i] = min(dp[i], dp[i - k] + abs(vec[i] - vec[i - k]));
}
} else {
dp[i] = dp[i - 1] + abs(vec[i] - vec[i - 1]);
for (int j = 2; j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
}
}
cout << dp[n - 1] << endl;
}
| #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;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
vector<int> dp(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec[i] = x;
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for (int i = 2; i < n; i++) {
if (i >= k) {
dp[i] = dp[i - 1] + abs(vec[i] - vec[i - 1]);
for (int j = 2; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
} else {
dp[i] = dp[i - 1] + abs(vec[i] - vec[i - 1]);
for (int j = 2; j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(vec[i] - vec[i - j]));
}
}
}
cout << dp[n - 1] << endl;
}
| [
"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 <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
// Defines
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
#define mem(name, value) memset(name, value, sizeof(name))
#define f(i, a) for (int i = 0; i < a; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
typedef vector<string> vs;
int arr[100005], dp[100005];
int n, k;
int calc(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = 1e5;
for (int j = 1; j <= k; ++j) {
if (j + i >= n)
break;
int temp = std::abs(arr[i + j] - arr[i]) + calc(i + j);
ans = min(ans, temp);
}
return dp[i] = ans;
}
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
f(i, n) { cin >> arr[i]; }
mem(dp, -1);
cout << calc(0) << "\n";
return 0;
} | // 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 <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
// Defines
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
#define mem(name, value) memset(name, value, sizeof(name))
#define f(i, a) for (int i = 0; i < a; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
typedef vector<string> vs;
int arr[100005], dp[100005];
int n, k;
int calc(int i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
int ans = 1e9;
for (int j = 1; j <= k; ++j) {
if (j + i >= n)
break;
int temp = std::abs(arr[i + j] - arr[i]) + calc(i + j);
ans = min(ans, temp);
}
return dp[i] = ans;
}
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> k;
f(i, n) { cin >> arr[i]; }
mem(dp, -1);
cout << calc(0) << "\n";
return 0;
} | [
"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) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
ll MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<ll> dp(n);
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n) {
rep2(j, 1, k + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[n - 1] << endl;
return 0;
} | #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) for (int(i) = 0; (i) < (n); (i)++)
#define rep2(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
ll MOD = 1000000007;
int main() {
ll n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<ll> dp(n + k);
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n) {
rep2(j, 1, k + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[n - 1] << endl;
return 0;
} | [
"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 \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define mod int(1e9 + 7)
#define MAXN int(1e9)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, x, l;
int main() {
fromfile;
speedhack;
cin >> n >> x;
vector<int> dp(n + 1, MAXN);
vector<int> h;
h.pb(0); // shifting index
for (int j = 0; j < n; j++) {
cin >> l;
h.pb(l);
}
dp[1] = 0;
for (int k = 2; k <= n; k++) {
for (int j = 1; j <= x; j++) {
if (k - j > 0) {
dp[k] = min(dp[k], dp[k - j] + abs(h[k] - h[k - j]));
}
}
}
cout << dp[n];
} | #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 \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define mod int(1e9 + 7)
#define MAXN int(1e9)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, x, l;
int main() {
// fromfile;
speedhack;
cin >> n >> x;
vector<int> dp(n + 1, MAXN);
vector<int> h;
h.pb(0); // shifting index
for (int j = 0; j < n; j++) {
cin >> l;
h.pb(l);
}
dp[1] = 0;
for (int k = 2; k <= n; k++) {
for (int j = 1; j <= x; j++) {
if (k - j > 0) {
dp[k] = min(dp[k], dp[k - j] + abs(h[k] - h[k - j]));
}
}
}
cout << dp[n];
} | [] | 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];
dp[0] = 0;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(a[i - 1] - a[i - 2]);
else {
dp[i] = abs(a[i - 1] - a[i - 2]) + dp[i - 1];
for (ll j = 2; j < i && j <= k; j++)
dp[i] = min(dp[i], abs(a[i - 1] - a[i - 1 - j]) + dp[i - j]);
}
}
return dp[4];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t, a, b, c, x, y, z, n, m, k, ans;
cin >> n >> k;
ll arr[n];
fr(i, n) { cin >> arr[i]; }
cout << h(arr, n, k);
cerr << '\n'
<< "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
} | #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];
dp[0] = 0;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(a[i - 1] - a[i - 2]);
else {
dp[i] = abs(a[i - 1] - a[i - 2]) + dp[i - 1];
for (ll j = 2; j < i && j <= k; j++)
dp[i] = min(dp[i], abs(a[i - 1] - a[i - 1 - j]) + dp[i - j]);
}
}
return dp[n];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t, a, b, c, x, y, z, n, m, k, ans;
cin >> n >> k;
ll arr[n];
fr(i, n) { cin >> arr[i]; }
cout << h(arr, n, k);
cerr << '\n'
<< "Time elapsed :" << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
} | [
"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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e17;
for (int i = 2; i <= n; i++) {
dp[i] = 1e17;
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| #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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e17;
for (int i = 2; i <= n; i++) {
dp[i] = 1e17;
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| [
"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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e5;
for (int i = 2; i <= n; i++) {
dp[i] = 1e5;
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| #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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e17;
for (int i = 2; i <= n; i++) {
dp[i] = 1e17;
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| [
"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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e17;
for (int i = 2; i <= n; i++) {
dp[i] = 1e17;
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| #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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e17;
for (int i = 2; i <= n; i++) {
dp[i] = 1e17;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| [
"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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e5;
for (int i = 2; i <= n; i++) {
dp[i] = 1e5;
for (int j = 1; j <= k; j++) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| #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;
while (y > 0) {
if (y & 1)
res = x * res;
y = y >> 1;
x = x * x;
}
return res;
}
int power(int x, int y, int mod) {
int res = 1;
while (y > 0) {
if (y & 1)
res = x * res % mod;
y = y >> 1;
x = x * x % mod;
}
return res;
}
using namespace std;
void nik() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
signed main() {
// nik();
int t = 1;
// cin>>t;
while (t--) {
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
int dp[n + 1] = {0};
dp[0] = 1e17;
for (int i = 2; i <= n; i++) {
dp[i] = 1e17;
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
}
cout << dp[n] << endl;
// for(int i:dp)cout<<i<<" ";
}
return 0;
}
| [
"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 long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> stone;
rep(i, 0, n) {
int x;
cin >> x;
stone.pb(x);
}
vector<int> ans;
ans.pb(0);
rep(i, 1, n) ans.pb(100000);
// ans.pb(abs(stone[0]-stone[1]));
rep(i, 0, n) {
int j = i + 1;
while (j < n && j <= i + k) {
ans[j] = min(ans[j], ans[i] + abs(stone[i] - stone[j]));
j++;
}
}
cout << ans.back() << "\n";
return 0;
}
| #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 long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> stone;
rep(i, 0, n) {
int x;
cin >> x;
stone.pb(x);
}
vector<ll> ans;
ans.pb(0);
rep(i, 1, n) ans.pb(INF);
// ans.pb(abs(stone[0]-stone[1]));
rep(i, 0, n) {
int j = i + 1;
while (j < n && j <= i + k) {
ans[j] = min(ans[j], ans[i] + abs(stone[i] - stone[j]));
j++;
}
}
cout << ans.back() << "\n";
return 0;
}
| [
"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>
int main() {
// ios_base::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 + 1];
for (int i = 0; i < n; i++)
b[i] = 100001;
b[0] = 0;
;
int x, diff;
for (int i = 1; i < n; i++) {
x = 1;
while (x <= k && i - x >= 0) {
diff = abs(a[i] - a[i - x]);
b[i] = min(b[i], b[i - x] + diff);
x++;
}
}
cout << b[n - 1];
return 0;
}
| #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>
int main() {
// ios_base::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];
}
lli b[n + 1];
for (int i = 0; i < n; i++)
b[i] = 10000000001;
b[0] = 0;
;
int x, diff;
for (int i = 1; i < n; i++) {
x = 1;
while (x <= k && i - x >= 0) {
diff = abs(a[i] - a[i - x]);
b[i] = min(b[i], b[i - x] + diff);
x++;
}
}
cout << b[n - 1];
return 0;
}
| [
"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++) {
for (int j = i - 1; j >= 0 && i - j <= K; j++) {
val[i] = min(val[i], abs(h[i] - h[j]) + val[j]);
}
}
cout << val[N - 1];
return 0;
} | #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++) {
for (int j = i - 1; j >= 0 && i - j <= K; j--) {
val[i] = min(val[i], abs(h[i] - h[j]) + val[j]);
}
}
cout << val[N - 1];
return 0;
} | [] | 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]);
if (n == 2) {
cout << dp[2] << endl;
return 0;
}
for (ll ka = 3; ka <= n; ka++) {
dp[ka] = 1e10;
for (ll r = 1; r <= k && r <= ka; r++) {
dp[ka] = min(dp[ka], (abs(a[ka] - a[ka - r]) + dp[ka - r]));
}
}
cout << dp[n] << endl;
} | // 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]);
if (n == 2) {
cout << dp[2] << endl;
return 0;
}
for (ll ka = 3; ka <= n; ka++) {
dp[ka] = 1e10;
for (ll r = 1; r <= k && r < ka; r++) {
dp[ka] = min(dp[ka], (abs(a[ka] - a[ka - r]) + dp[ka - r]));
}
}
cout << dp[n] << endl;
} | [
"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]);
if (n == 2) {
cout << dp[2] << endl;
return 0;
}
for (ll ka = 3; ka <= n; ka++) {
dp[ka] = 1e10;
for (ll r = 1; r <= k; r++) {
dp[ka] = min(dp[ka], (abs(a[ka] - a[ka - r]) + dp[ka - r]));
}
}
cout << dp[n] << endl;
} | // 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]);
if (n == 2) {
cout << dp[2] << endl;
return 0;
}
for (ll ka = 3; ka <= n; ka++) {
dp[ka] = 1e10;
for (ll r = 1; r <= k && r < ka; r++) {
dp[ka] = min(dp[ka], (abs(a[ka] - a[ka - r]) + dp[ka - r]));
}
}
cout << dp[n] << endl;
} | [
"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, dp[j] + abs(h[i] - h[j]));
}
dp[i] = m;
}
for (int i = k; i < n; i++) {
m = 1e4;
for (int j = i - 1; j >= i - k; j--) {
m = min(m, dp[j] + abs(h[i] - h[j]));
}
dp[i] = m;
}
cout << dp[n - 1];
}
| #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, dp[j] + abs(h[i] - h[j]));
}
dp[i] = m;
}
for (int i = k; i < n; i++) {
m = 1e9;
for (int j = i - 1; j >= i - k; j--) {
m = min(m, dp[j] + abs(h[i] - h[j]));
}
dp[i] = m;
}
// for (int i = 0; i < n; i++)
// cout << dp[i] << ' ';
cout << dp[n - 1];
}
| [
"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 - 1] - h[i]);
for (int i = N - K; 0 <= i; i--) {
int Min = 10000000000;
for (int j = 1; j <= K; j++) {
if (abs(h[i + j] - h[i]) + dp[i + j] < Min)
Min = abs(h[i + j] - h[i]) + dp[i + j];
}
dp[i] = Min;
}
cout << dp[0] << endl;
}
return 0;
} | #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 - 1] - h[i]);
for (int i = N - K - 2; 0 <= i; i--) {
int Min = 10000000000;
for (int j = 1; j <= K; j++) {
if (abs(h[i + j] - h[i]) + dp[i + j] < Min)
Min = abs(h[i + j] - h[i]) + dp[i + j];
}
dp[i] = Min;
}
cout << dp[0] << endl;
}
return 0;
} | [
"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++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl //出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} //真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } //配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} //最小値更新
signed main() {
in(ll, N);
in(ll, K);
ll inf = INF;
vec(ll, dp, N, inf);
ain(ll, h, N);
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
out(dp[N - 1]);
}
| #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++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl //出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} //真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } //配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} //最小値更新
signed main() {
in(ll, N);
in(ll, K);
ll inf = INF;
vec(ll, dp, 110000, inf);
ain(ll, h, N);
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
out(dp[N - 1]);
}
| [
"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++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl //出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} //真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } //配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} //最小値更新
signed main() {
in(ll, N);
in(ll, K);
ll inf = INF;
vec(ll, dp, N, inf);
ain(ll, h, N);
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
out(dp[N - 1]);
}
| #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++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl //出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} //真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } //配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} //最小値更新
signed main() {
in(ll, N);
in(ll, K);
ll inf = INF;
vec(ll, dp, 110000, inf);
ain(ll, h, N);
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
out(dp[N - 1]);
}
| [
"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++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl //出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} //真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } //配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} //最小値更新
signed main() {
in(ll, N);
in(ll, K);
ll inf = INF;
vec(ll, dp, N, inf);
ain(ll, h, N);
dp[0] = 0;
REP(i, N) {
FOR(j, 1, N + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
out(dp[N - 1]);
}
| #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++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) //最大値を求める
#define MIN(x) *min_element(ALL(x)) //最小値を求める
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
//略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl //出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} //真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } //配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} //最小値更新
signed main() {
in(ll, N);
in(ll, K);
ll inf = INF;
vec(ll, dp, 110000, inf);
ain(ll, h, N);
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
out(dp[N - 1]);
}
| [
"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, arr) for (auto &x : arr)
#define FORS(x, plus, arr) \
for (auto x = begin(arr) + (plus); x != end(arr); ++x)
#define FORREV(x, plus, arr) \
for (auto x = (arr).rbegin() + (plus); x != (arr).rend(); ++x)
#define REE(s_) \
{ \
cout << s_ << '\n'; \
exit(0); \
}
#define GET(arr) \
for (auto &i : (arr)) \
sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int, int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template <class L, class R> ostream &operator<<(ostream &os, map<L, R> P) {
for (auto const &vv : P)
os << "(" << vv.first << "," << vv.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> V) {
os << "[";
for (auto const &vv : V)
os << vv << ",";
os << "]";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[";
for (auto const &vv : V)
os << vv << ",";
os << "]";
return os;
}
template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
os << "(" << P.first << "," << P.second << ")";
return os;
}
inline int fstoi(const string &str) {
auto it = str.begin();
bool neg = 0;
int num = 0;
if (*it == '-')
neg = 1;
else
num = *it - '0';
++it;
while (it < str.end())
num = num * 10 + (*it++ - '0');
if (neg)
num *= -1;
return num;
}
inline void getch(char &x) {
while (x = getchar_unlocked(), x < 33) {
;
}
}
inline void getstr(string &str) {
str.clear();
char cur;
while (cur = getchar_unlocked(), cur < 33) {
;
}
while (cur > 32) {
str += cur;
cur = getchar_unlocked();
}
}
template <typename T> inline bool sc(T &num) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
if (c == EOF)
return false;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
return true;
}
template <typename T, typename... Args> inline void sc(T &num, Args &...args) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
sc(args...);
}
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; // s.find_by_order(),
// s.order_of_key() <- works like
// lower_bound
template <typename T>
using ordered_map =
tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
sc(n);
sc(n, k);
int dp[n];
dp[0] = 0;
int a[n];
GET(a);
FOR(i, 1, n) {
dp[i] = 0x7f7f7f7f;
for (int x = i - 1, kk = k; x >= 0 && kk; --x, --kk) {
dp[i] = min(dp[i], dp[x] + abs(a[i] - a[x]));
}
whatis(i) whatis(dp[i])
}
cout << dp[n - 1] << '\n';
}
| #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, arr) for (auto &x : arr)
#define FORS(x, plus, arr) \
for (auto x = begin(arr) + (plus); x != end(arr); ++x)
#define FORREV(x, plus, arr) \
for (auto x = (arr).rbegin() + (plus); x != (arr).rend(); ++x)
#define REE(s_) \
{ \
cout << s_ << '\n'; \
exit(0); \
}
#define GET(arr) \
for (auto &i : (arr)) \
sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int, int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template <class L, class R> ostream &operator<<(ostream &os, map<L, R> P) {
for (auto const &vv : P)
os << "(" << vv.first << "," << vv.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> V) {
os << "[";
for (auto const &vv : V)
os << vv << ",";
os << "]";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> V) {
os << "[";
for (auto const &vv : V)
os << vv << ",";
os << "]";
return os;
}
template <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {
os << "(" << P.first << "," << P.second << ")";
return os;
}
inline int fstoi(const string &str) {
auto it = str.begin();
bool neg = 0;
int num = 0;
if (*it == '-')
neg = 1;
else
num = *it - '0';
++it;
while (it < str.end())
num = num * 10 + (*it++ - '0');
if (neg)
num *= -1;
return num;
}
inline void getch(char &x) {
while (x = getchar_unlocked(), x < 33) {
;
}
}
inline void getstr(string &str) {
str.clear();
char cur;
while (cur = getchar_unlocked(), cur < 33) {
;
}
while (cur > 32) {
str += cur;
cur = getchar_unlocked();
}
}
template <typename T> inline bool sc(T &num) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
if (c == EOF)
return false;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
return true;
}
template <typename T, typename... Args> inline void sc(T &num, Args &...args) {
bool neg = 0;
int c;
num = 0;
while (c = getchar_unlocked(), c < 33) {
;
}
if (c == '-') {
neg = 1;
c = getchar_unlocked();
}
for (; c > 47; c = getchar_unlocked())
num = num * 10 + c - 48;
if (neg)
num *= -1;
sc(args...);
}
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; // s.find_by_order(),
// s.order_of_key() <- works like
// lower_bound
template <typename T>
using ordered_map =
tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
// sc(n);
sc(n, k);
int dp[n];
dp[0] = 0;
int a[n];
GET(a);
FOR(i, 1, n) {
dp[i] = 0x7f7f7f7f;
for (int x = i - 1, kk = k; x >= 0 && kk; --x, --kk) {
dp[i] = min(dp[i], dp[x] + abs(a[i] - a[x]));
}
whatis(i) whatis(dp[i])
}
cout << dp[n - 1] << '\n';
}
| [
"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 double
#define fi first
#define se second
#define testcases \
int testcases; \
cin >> testcases; \
while (testcases--)
#define printvector(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " "; \
cout << endl
#define printarray(v, n) \
for (int i = 0; i < n; i++) \
cout << v[i] << " "; \
cout << endl
#define inputarray(v, n) \
for (int i = 0; i < n; i++) \
cin >> v[i]
#define debug(i) cout << "debug: " << i << endl
#define pr(i) cout << i << endl
#define timetaken cerr << clock() / double(CLOCKS_PER_SEC) << endl
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define toDigit(a) (a - '0')
ll powmod(ll base, ll exp, ll MOD) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return (res % MOD);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int cal(vector<int> &a, int n, int k) {
vector<int> dp(n + 1, 0);
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(i + 1, k); ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - 1] - a[i - j - 1]));
}
}
return dp[n];
}
int main() {
fast_io;
int n, k;
cin >> n >> k;
vector<int> a(n);
inputarray(a, n);
pr(cal(a, n, k));
return 0;
} | /*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
#define fi first
#define se second
#define testcases \
int testcases; \
cin >> testcases; \
while (testcases--)
#define printvector(v) \
for (int i = 0; i < v.size(); i++) \
cout << v[i] << " "; \
cout << endl
#define printarray(v, n) \
for (int i = 0; i < n; i++) \
cout << v[i] << " "; \
cout << endl
#define inputarray(v, n) \
for (int i = 0; i < n; i++) \
cin >> v[i]
#define debug(i) cout << "debug: " << i << endl
#define pr(i) cout << i << endl
#define timetaken cerr << clock() / double(CLOCKS_PER_SEC) << endl
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define toDigit(a) (a - '0')
ll powmod(ll base, ll exp, ll MOD) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return (res % MOD);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int cal(vector<int> &a, int n, int k) {
vector<int> dp(n + 1, 0);
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = INT_MAX;
for (int j = 1; j <= min(i - 1, k); ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(a[i - 1] - a[i - j - 1]));
}
}
return dp[n];
}
int main() {
fast_io;
int n, k;
cin >> n >> k;
vector<int> a(n);
inputarray(a, n);
pr(cal(a, n, k));
return 0;
} | [
"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]);
for (int i = 2; i < n; i++) {
dp[i] = my_abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 2; j <= k; j++) {
if (i - j >= 0) {
if (my_abs(h[i] - h[i - j] + dp[i - j]) < dp[i])
dp[i] = my_abs(h[i] - h[i - j]) + dp[i - j];
}
}
}
cout << dp[n - 1] << endl;
return 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]);
for (int i = 2; i < n; i++) {
dp[i] = my_abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 2; j <= k; j++) {
if (i - j >= 0) {
if (my_abs(h[i] - h[i - j]) + dp[i - j] < dp[i])
dp[i] = my_abs(h[i] - h[i - j]) + dp[i - j];
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"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]);
for (int i = 2; i < n; i++) {
dp[i] = my_abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 2; j <= k; j++) {
if (i - j >= 0) {
if (my_abs(h[i] - h[i - j] + dp[i - j]) < dp[i])
dp[i] = my_abs(h[i] - h[i - j]) + dp[i - j];
}
}
}
cout << dp[n - 1] << endl;
return 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]);
for (int i = 2; i < n; i++) {
dp[i] = my_abs(h[i] - h[i - 1]) + dp[i - 1];
for (int j = 2; j <= k; j++) {
if (i - j >= 0) {
if (my_abs(h[i] - h[i - j]) + dp[i - j] < dp[i])
dp[i] = my_abs(h[i] - h[i - j]) + dp[i - j];
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"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[101000];
int main() {
lli n, k;
cin >> n >> k;
vector<lli> v;
v.resize(n + k);
REP(i, 0, 101000) dp[i] = INF;
dp[0] = 0;
REP(i, 0, n) cin >> v[i];
REP(i, n, n + k + 10) v[i] = INF;
REP(i, 0, n) {
REP(j, 1, k + 1) dp[i + j] = min(dp[i + j], dp[i] + abs(v[i] - v[i + j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| #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[101000];
int main() {
lli n, k;
cin >> n >> k;
vector<lli> v;
v.resize(n + k + 10);
REP(i, 0, 101000) dp[i] = INF;
dp[0] = 0;
REP(i, 0, n) cin >> v[i];
REP(i, n, n + k + 10) v[i] = INF;
REP(i, 0, n) {
REP(j, 1, k + 1) dp[i + j] = min(dp[i + j], dp[i] + abs(v[i] - v[i + j]));
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"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 (start < 0)
start = 0;
for (int j = start; j < k; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| #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 (start < 0)
start = 0;
for (int j = start; j < i; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n - 1] << "\n";
return 0;
}
| [
"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_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define debug(x) cerr << #x << " -> " << x << '\n'
#define debug2(x, y) \
cerr << #x << " -> " << x << " " << #y << " -> " << y << '\n'
#define debug3(x, y, z) \
cerr << #x << " -> " << x << " " << #y << " -> " << y << " " << #z << " -> " \
<< z << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
using ordered_set = tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename T> struct CMP {
bool operator()(const T &lhs, const T &rhs) const { return lhs < rhs; }
};
template <typename T> T power(T a, T n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = (res * a);
a = (a * a);
n >>= 1;
}
return res;
}
template <typename T> T power(T a, T n, long long mm) {
T res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % mm;
a = (a * a) % mm;
n >>= 1;
}
return res;
}
const ll N = 2e5 + 7;
const ll MOD = 1e9 + 7;
const ll INF = 2e14 + 7;
ll height[N], dp[N];
ll get_height(int i) {
if (i < 0)
return INF;
return height[i];
}
int k;
ll solve(int n) {
if (n <= 0)
return 0;
if (dp[n] != -1)
return dp[n];
ll ans = INF;
for (int i = 1; i <= k; i++) {
ans = min(ans, solve(n - 1) + abs(get_height(n) - get_height(n - 1)));
}
return dp[n] = ans;
}
void testcase() {
int n;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> height[i];
}
memset(dp, -1, sizeof(dp));
ll ans = solve(n - 1);
cout << ans << '\n';
}
signed main() {
fast;
int t = 1;
// cin>>t;
while (t--) {
testcase();
}
return 0;
}
| #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_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define debug(x) cerr << #x << " -> " << x << '\n'
#define debug2(x, y) \
cerr << #x << " -> " << x << " " << #y << " -> " << y << '\n'
#define debug3(x, y, z) \
cerr << #x << " -> " << x << " " << #y << " -> " << y << " " << #z << " -> " \
<< z << '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
using ordered_set = tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename T> struct CMP {
bool operator()(const T &lhs, const T &rhs) const { return lhs < rhs; }
};
template <typename T> T power(T a, T n) {
T res = 1;
while (n > 0) {
if (n & 1)
res = (res * a);
a = (a * a);
n >>= 1;
}
return res;
}
template <typename T> T power(T a, T n, long long mm) {
T res = 1;
while (n > 0) {
if (n & 1)
res = (res * a) % mm;
a = (a * a) % mm;
n >>= 1;
}
return res;
}
const ll N = 2e5 + 7;
const ll MOD = 1e9 + 7;
const ll INF = 2e14 + 7;
ll height[N], dp[N];
ll get_height(int i) {
if (i < 0)
return INF;
return height[i];
}
int k;
ll solve(int n) {
if (n <= 0)
return 0;
if (dp[n] != -1)
return dp[n];
ll ans = INF;
for (int i = 1; i <= k; i++) {
ans = min(ans, solve(n - i) + abs(get_height(n) - get_height(n - i)));
}
return dp[n] = ans;
}
void testcase() {
int n;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> height[i];
}
memset(dp, -1, sizeof(dp));
ll ans = solve(n - 1);
cout << ans << '\n';
}
signed main() {
fast;
int t = 1;
// cin>>t;
while (t--) {
testcase();
}
return 0;
}
| [
"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_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
cout << fixed << setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll, ll>
#define vpl vector<pll>
#define vvl vector<vector<ll>>
#define vvpl vector<vector<pll>>
#define ff first
#define ss second
#define pqueue priority_queue<ll>
#define pdqueue priority_queue<ll, vl, greater<ll>>
#define mem(a, b) memset(a, b, sizeof(a));
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
//#define x ff
//#define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &a : v)
is >> a;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v)
os << t << " ";
return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
return os << v.first << " " << v.second;
}
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll kv;
ll t, n, x, y, h, k, z, p, q, w, r;
string s, s1, s2;
// vvl v;
// vl vis,d;
int main() {
IOS;
cin >> n >> k;
vl v(n);
cin >> v;
vl a(n, 0);
for (int i = 1; i < n; i++) {
kv = inf * inf;
for (int j = i - 1; j >= i - k; j--)
kv = min(kv, a[j] + abs(v[i] - v[j]));
a[i] = kv;
}
cout << a[n - 1];
return 0;
}
| #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_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
cout << fixed << setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll, ll>
#define vpl vector<pll>
#define vvl vector<vector<ll>>
#define vvpl vector<vector<pll>>
#define ff first
#define ss second
#define pqueue priority_queue<ll>
#define pdqueue priority_queue<ll, vl, greater<ll>>
#define mem(a, b) memset(a, b, sizeof(a));
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
//#define x ff
//#define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &a : v)
is >> a;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v)
os << t << " ";
return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
return os << v.first << " " << v.second;
}
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll kv;
ll t, n, x, y, h, k, z, p, q, w, r;
string s, s1, s2;
// vvl v;
// vl vis,d;
int main() {
IOS;
cin >> n >> k;
vl v(n);
cin >> v;
vl a(n, 0);
for (int i = 1; i < n; i++) {
kv = inf * inf;
for (int j = i - 1; j >= i - k && j >= 0; j--)
kv = min(kv, a[j] + abs(v[i] - v[j]));
a[i] = kv;
}
cout << a[n - 1];
return 0;
}
| [
"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 (i + j > n)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #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++) { //どこまで飛べるか
if (i + j > n)
break;
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"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 1000000000
#define flash ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
using namespace std;
int dp[100001] = {-1};
int func(int n, int k, int arr[]) {
// cout<<n<<" "<<dp[n]<<endl;
if (n <= 0)
return 0;
if (n == 1)
return abs(arr[1] - arr[0]);
if (dp[n] != -1)
return dp[n];
int m = MIN;
for (int i = 1; i <= k; i++) {
if (n - i > 0)
m = min(func(n - i, k, arr) + abs(arr[n] - arr[n - i]), m);
}
// cout<<n<<" "<<dp[n]<<endl;
dp[n] = m;
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
memset(dp, -1, sizeof(dp));
cout << func(n - 1, k, arr);
} | #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 1000000000
#define flash ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
using namespace std;
int dp[100001] = {-1};
int func(int n, int k, int arr[]) {
// cout<<n<<" "<<dp[n]<<endl;
if (n <= 0)
return 0;
if (n == 1)
return abs(arr[1] - arr[0]);
if (dp[n] != -1)
return dp[n];
int m = MIN;
for (int i = 1; i <= k; i++) {
if (n - i >= 0)
m = min(func(n - i, k, arr) + abs(arr[n] - arr[n - i]), m);
}
// cout<<n<<" "<<dp[n]<<endl;
dp[n] = m;
return dp[n];
}
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
memset(dp, -1, sizeof(dp));
cout << func(n - 1, k, arr);
} | [
"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];
vector<ll> dp(n, inf); // it stores the min cost incurred so far...
dp[0] = 0; // cost at stone 1 is 0...
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i >= j)
dp[i] = min(dp[j], dp[i - j] + abs(v[i] - v[i - j]));
}
cout << dp[n - 1] << endl;
// Code Ends...
return 0;
}
| #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];
vector<ll> dp(n, inf); // it stores the min cost incurred so far...
dp[0] = 0; // cost at stone 1 is 0...
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i >= j)
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
cout << dp[n - 1] << endl;
// Code Ends...
return 0;
}
| [
"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 (int j = 1; j <= k; j++) {
if (i - j > 0)
b = min(b, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = b;
}
cout << dp[n] << endl;
return 0;
} | #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;
for (int j = 1; j <= k; j++) {
if (i - j >= 1)
b = min(b, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = b;
}
cout << dp[n] << endl;
return 0;
} | [
"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 (int j = 1; j <= k; j++) {
if (i - j >= 0)
b = min(b, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = b;
}
cout << dp[n] << endl;
return 0;
} | #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;
for (int j = 1; j <= k; j++) {
if (i - j >= 1)
b = min(b, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = b;
}
cout << dp[n] << endl;
return 0;
} | [
"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::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<ll> dp(N, 10000);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #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::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<ll> dp(N, 1000000000);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"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::sync_with_stdio(false);
cin.tie(0);
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, 10000);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #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::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<ll> dp(N, 1000000000);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"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::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<ll> dp(N, 10000);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #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::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<ll> dp(N, INFINITY);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"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::sync_with_stdio(false);
cin.tie(0);
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, 10000);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #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::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> H(N, 0);
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<ll> dp(N, INFINITY);
dp[0] = 0;
for (int i = 1; i < N; ++i) {
int k = max(0, i - K);
for (int j = k; j < i; ++j) {
dp[i] = min(dp[i], abs(H[i] - H[j]) + dp[j]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"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[i + 1];
cost[1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = i + 1; j <= i + k; j++) {
if (j <= n)
cost[j] = min(cost[i] + abs(height[j] - height[i]), cost[j]);
}
}
cout << cost[n] << endl;
} | #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 >> height[i + 1];
cost[1] = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = i + 1; j <= i + k; j++) {
if (j <= n)
cost[j] = min(cost[i] + abs(height[j] - height[i]), cost[j]);
}
}
cout << cost[n] << endl;
} | [
"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 = s; i < e; i++)
#define rrep(i, e, s) for (int i = e; i >= s; i--)
#define MOD 1000000007
#define pb push_back
#define ff first
#define ss second
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
// find_by_order(k-1) returns iterator to kth element starting from 0; Returns
// the kth smallest element order_of_key(k) returns count of elements strictly
// smaller than k;Returns the number of elements less than k erase,insert same
// as normal set
const int mxn = 1e5 + 13;
int n, k;
int h[mxn];
int dp[mxn];
int func(int idx) {
if (idx >= n)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = 1e18;
if (idx < n - 1) {
for (int i = 1; i <= k && i < n; i++) {
ans = min(ans, abs(h[idx + i] - h[idx]) + func(idx + i));
}
} else if (idx == n - 1) {
ans = 0;
}
return dp[idx] = ans;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
memset(dp, -1, sizeof(dp));
int ans = func(0);
// for(int i=0;i<n;i++){
// trace(dp[i]);
// }
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int t = 1;
// cin>>t;
while (t--) {
solve();
}
} | #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 = s; i < e; i++)
#define rrep(i, e, s) for (int i = e; i >= s; i--)
#define MOD 1000000007
#define pb push_back
#define ff first
#define ss second
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
// find_by_order(k-1) returns iterator to kth element starting from 0; Returns
// the kth smallest element order_of_key(k) returns count of elements strictly
// smaller than k;Returns the number of elements less than k erase,insert same
// as normal set
const int mxn = 1e5 + 13;
int n, k;
int h[mxn];
int dp[mxn];
int func(int idx) {
if (idx >= n)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = 1e18;
if (idx < n - 1) {
for (int i = 1; i <= k && idx + i <= n - 1; i++) {
ans = min(ans, abs(h[idx + i] - h[idx]) + func(idx + i));
}
} else if (idx == n - 1) {
ans = 0;
}
return dp[idx] = ans;
}
void solve() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
memset(dp, -1, sizeof(dp));
int ans = func(0);
// if(ans==1e18) ans=0;
// for(int i=0;i<n;i++){
// trace(dp[i]);
// }
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
int t = 1;
// cin>>t;
while (t--) {
solve();
}
} | [
"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); \
cin.tie(0); \
cout.tie(0);
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define f(i, n) for (ll i = 0; i < n; i++)
#define fo(i, x, n) for (ll i = x; i <= n; i++)
#define pb(x) push_back(x)
#define tr(c, it) for (((c).begin())it = (c).begin(); it != (c).end(); it++)
#define test \
ll t; \
cin >> t;
#define fls fflush(stdout);
int main() {
ll n, k;
cin >> n >> k;
ll height[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
ll mn;
for (ll i = 2; i < k + 1; i++) {
mn = INT_MAX;
for (ll j = i - 1; j >= 0; j--) {
mn = min(mn, dp[j] + abs(height[j] - height[i]));
dp[i] = mn;
}
}
for (ll i = k + 1; i < n; i++) {
mn = INT_MAX;
for (ll j = i - 1; j >= i - k; j--) {
mn = min(mn, dp[j] + abs(height[j] - height[i]));
dp[i] = mn;
}
}
// for(ll i=0;i<n;i++)cout<<dp[i]<<" ";cout<<endl;
cout << dp[n - 1] << endl;
return 0;
}
| #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); \
cin.tie(0); \
cout.tie(0);
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define f(i, n) for (ll i = 0; i < n; i++)
#define fo(i, x, n) for (ll i = x; i <= n; i++)
#define pb(x) push_back(x)
#define tr(c, it) for (((c).begin())it = (c).begin(); it != (c).end(); it++)
#define test \
ll t; \
cin >> t;
#define fls fflush(stdout);
int main() {
ll n, k;
cin >> n >> k;
ll height[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> height[i];
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
ll mn;
for (ll i = 2; i < k + 1 && i < n; i++) {
mn = INT_MAX;
for (ll j = i - 1; j >= 0; j--) {
mn = min(mn, dp[j] + abs(height[j] - height[i]));
dp[i] = mn;
}
}
for (ll i = k + 1; i < n; i++) {
mn = INT_MAX;
for (ll j = i - 1; j >= i - k; j--) {
mn = min(mn, dp[j] + abs(height[j] - height[i]));
dp[i] = mn;
}
}
// for(ll i=0;i<n;i++)cout<<dp[i]<<" ";cout<<endl;
cout << dp[n - 1] << endl;
return 0;
}
| [
"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--) {
minimum = min(ll(minimum), dp[j] + abs(a[j] - a[i]));
}
dp[i] = minimum;
}
cout << dp[n - 1];
return 0;
}
| #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--) {
minimum = min(ll(minimum), dp[j] + abs(a[j] - a[i]));
}
dp[i] = minimum;
}
cout << dp[n - 1];
return 0;
}
| [
"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)
cin >> h[i];
long long dp[N];
for (int i = 0; i < N; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= K; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | #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)
cin >> h[i];
long long dp[N + 110];
for (int i = 0; i < N; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= K; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
} | [
"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] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
}
cout << dp[n] << endl;
} | #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] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
cout << dp[n] << endl;
} | [
"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++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[j]));
}
}
cout << dp[N - 1] << endl;
} | #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++) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[N - 1] << endl;
} | [] | 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 + 1; i < n; i++) {
int min = INT_MAX;
for (int j = i - k; j < i; j++) {
int flag = result[j] + mod(h[i] - h[j]);
if (min > flag)
min = flag;
}
result[i] = min;
}
cout << result[n - 1];
return 0;
}
| #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 (int i = k + 1; i < n; i++) {
int min = INT_MAX;
for (int j = i - k; j < i; j++) {
int flag = result[j] + mod(h[i] - h[j]);
if (min > flag)
min = flag;
}
result[i] = min;
}
cout << result[n - 1];
return 0;
}
| [
"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 = n - 3; i >= 0; i--) {
for (int j = i + 1; j <= i + k; j++) {
if (j >= n)
continue;
dp[i] = min(dp[i], abs(h[j] - h[i]) + dp[j]);
}
}
cout << dp.front() << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (auto &ele : h)
cin >> ele;
Frog_2(h, k);
return 0;
}
| #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 = n - 2; i >= 0; i--) {
for (int j = i + 1; j <= i + k; j++) {
if (j >= n)
continue;
dp[i] = min(dp[i], abs(h[j] - h[i]) + dp[j]);
}
}
cout << dp.front() << endl;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (auto &ele : h)
cin >> ele;
Frog_2(h, k);
return 0;
}
| [
"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() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
dp[i + 1] = mod;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[j - i] - h[i]));
}
}
cout << dp[N - 1] << endl;
} | #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() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
dp[i + 1] = mod;
}
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[j + i] - h[i]));
}
}
cout << dp[N - 1] << endl;
} | [
"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 + stone >= n)
break;
dp[stone + jump] =
min(dp[stone + jump], dp[stone] + abs(h[stone + jump] - h[stone]));
}
}
cout << dp[n - 1];
return 0;
} | #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 (jump + stone >= n)
break;
dp[stone + jump] =
min(dp[stone + jump], dp[stone] + abs(h[stone + jump] - h[stone]));
}
}
cout << dp[n - 1];
return 0;
} | [
"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] = abs(dp[0] - dp[1]);
for (int i = 2; i < n; i++) {
a[i] = INT_MAX;
for (int j = i - 1; j >= i - k && j > 0; j--) {
a[i] = min(a[i], abs(dp[i] - dp[j]) + a[j]);
}
}
cout << a[n - 1];
return 0;
}
| #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] = abs(dp[0] - dp[1]);
for (int i = 2; i < n; i++) {
a[i] = INT_MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
a[i] = min(a[i], abs(dp[i] - dp[j]) + a[j]);
}
}
cout << a[n - 1];
return 0;
}
| [
"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] = abs(dp[0] - dp[1]);
for (int i = 2; i < n; i++) {
a[i] = INT_MAX;
for (int j = i - 1; j > i - k; j--) {
a[i] = min(a[i], abs(dp[i] - dp[j]) + a[j]);
}
}
cout << a[n - 1];
return 0;
}
| #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] = abs(dp[0] - dp[1]);
for (int i = 2; i < n; i++) {
a[i] = INT_MAX;
for (int j = i - 1; j >= i - k && j >= 0; j--) {
a[i] = min(a[i], abs(dp[i] - dp[j]) + a[j]);
}
}
cout << a[n - 1];
return 0;
}
| [
"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] + abs(h[j - i] - h[j]));
}
dp[j] = mindp;
}
return dp[n];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
if (n == 1) {
cout << 0 << endl;
return 0;
}
if (k >= n - 1) {
cout << abs(h[n] - h[1]) << endl;
return 0;
}
cout << findcost(n, k, h) << endl;
return 0;
} | #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 - i] + abs(h[j - i] - h[j]));
}
dp[j] = mindp;
}
return dp[n];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
if (n == 1) {
cout << 0 << endl;
return 0;
}
if (k >= n - 1) {
cout << abs(h[n] - h[1]) << endl;
return 0;
}
cout << findcost(n, k, h) << endl;
return 0;
} | [
"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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
ll dp[100006];
FOR(i, n + 1) dp[i] = 101117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
ll dp[100006];
FOR(i, n + 1) dp[i] = 1010000117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
int dp[100006];
FOR(i, n + 1) dp[i] = 101117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
ll dp[100006];
FOR(i, n + 1) dp[i] = 1010000117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
int dp[100006];
FOR(i, n + 1) dp[i] = 11117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
ll dp[100006];
FOR(i, n + 1) dp[i] = 1010000117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
int dp[100006];
FOR(i, n + 1) dp[i] = 10007;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| #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 >> k;
int a[n];
FOR(i, n) cin >> a[i];
ll dp[100006];
FOR(i, n + 1) dp[i] = 1010000117;
dp[0] = 0;
FOR(i, n) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
| [
"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);
cin.tie(NULL);
cout.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n, inf);
ll k1 = k;
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i - 1; j >= 0, k1 > 0; k1--, j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
k1 = k;
}
cout << dp[n - 1] << endl;
} | #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);
cin.tie(NULL);
cout.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n, inf);
ll k1 = k;
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i - 1; (j >= 0 && k1 > 0); k1--, j--) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
k1 = k;
}
cout << dp[n - 1] << endl;
} | [] | 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) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
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 int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(a, b);
Vi h(a + 10);
VIN(h)
int dp[a + 10];
REP(i, a) dp[i] = INF;
dp[0] = 0;
REP(i, a) {
FOR(j, 1, b + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
OUT(dp[a - 1]);
} | #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) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
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 int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(a, b);
Vi h(a + 10000);
VIN(h)
int dp[a + 10000];
REP(i, a) dp[i] = INF;
dp[0] = 0;
REP(i, a) {
FOR(j, 1, b + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
OUT(dp[a - 1]);
} | [
"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) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
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 int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(a, b);
Vi h(a);
VIN(h)
int dp[a + 10];
REP(i, a) dp[i] = INF;
dp[0] = 0;
REP(i, a) {
FOR(j, 1, b + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
OUT(dp[a - 1]);
} | #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) \
SORT(V); \
REV(V) //大きい方からソート
#define NPN(V) next_permutation(ALL(V)) //順列
#define pb(n) push_back(n)
#define endl '\n'
#define Endl '\n'
#define DUMP(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define yes(n) cout << ((n) ? "yes" : "no") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define RAPID \
cin.tie(0); \
ios::sync_with_stdio(false)
#define VSUM(V) accumulate(ALL(V), 0)
#define MID(a, b, c) (a) < (b) && (b) < (c)
#define MIDe(a, b, c) (a) <= (b) && (b) <= (c)
#define IN(n) cin >> n
#define IN2(a, b) cin >> a >> b
#define IN3(a, b, c) cin >> a >> b >> c
#define IN4(a, b, c, d) cin >> a >> b >> c >> d
#define VIN(V) \
for (int i = 0; i < (V).size(); i++) { \
cin >> (V).at(i); \
}
#define OUT(n) cout << n << endl
#define VOUT(V) \
REP(i, (V).size()) { cout << (V)[i] << endl; }
#define VOUT2(V) \
REP(i, (V).size()) { cout << (V)[i] << " "; } \
cout << endl;
// 型マクロ定義
#define int long long
#define P pair<ll, ll>
#define Vi vector<ll>
#define VVi vector<vector<ll>>
#define Vd vector<double>
#define Vb vector<bool>
#define Vs vector<string>
#define Vc vector<char>
#define M map<ll, ll>
#define S set<ll>
#define PQ priority_queue<ll>
#define PQG priority_queue < ll, V, greater<ll>
//
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 int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; } //最大公約数
int lcm(int a, int b) { return a * b / gcd(a, b); }
string toStrUp(string str) {
char diff = 'A' - 'a';
REP(i, str.size()) str[i] += diff;
return str;
}
string gCh(string str, int key) { return str.substr(key, 1); }
signed main() {
RAPID;
// デフォルト変数定義
int n = 0, m = 0, a = 0, b = 0, c = 0, d = 0, x = 0, y = 0, z = 0;
string s = "", t = "";
//
// ここから
IN2(a, b);
Vi h(a + 10000);
VIN(h)
int dp[a + 10000];
REP(i, a) dp[i] = INF;
dp[0] = 0;
REP(i, a) {
FOR(j, 1, b + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
OUT(dp[a - 1]);
} | [
"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 (int i = 2; i <= k + 1; ++i) {
dp[n - i] = abs(a[n - 1] - a[n - i]);
}
for (int i = n - 3; i >= 0; i--) {
for (int j = 1; j <= k; ++j) {
dp[i] = min(dp[i], abs(a[i] - a[i + j]) + dp[i + j]);
}
}
cout << dp[0];
return 0;
} | #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 (int i = 2; i <= k + 1; ++i) {
dp[n - i] = abs(a[n - 1] - a[n - i]);
}
for (int i = n - k - 2; i >= 0; i--) {
for (int j = 1; j <= k; ++j) {
dp[i] = min(dp[i], abs(a[i] - a[i + j]) + dp[i + j]);
}
}
cout << dp[0];
return 0;
} | [
"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 = l; i <= r; i++)
#define rb(i, r, l) for (int i = r; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
ll max(ll a, ll b) {
if (a > b)
return a;
else
return b;
}
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
ll lowbit(ll x) { return x & (-x); }
ll prime(ll x) {
if (x <= 1)
return false;
for (int i = 2; i <= int(sqrt(x)); i++) {
if (x % i == 0)
return false;
}
return true;
}
bool cmp(ll a, ll b) { return a > b; }
ll gcd(ll a, ll b) {
ll r;
while (b > 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
ll powmod(ll a, ll b, ll mod) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
inline ll read() {
char c = getchar();
ll w = 1;
ll x = 0;
while (!isdigit(c))
(c == '-') && (w = -w), c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
x *= w;
}
void fl(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
const int dx[8] = {-1, 1, 0, 0, -1, 1, -1, 1},
dy[8] = {0, 0, -1, 1, -1, -1, 1, 1};
#define N 100010
ll dp[N], a[N];
int main() {
fast;
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
dp[i] = bql;
for (int j = max(i - k, 0); j <= i - 1; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << endl;
return 0;
} /*『你强归你强，Siyuan比你强』*/ | #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 = l; i <= r; i++)
#define rb(i, r, l) for (int i = r; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
ll max(ll a, ll b) {
if (a > b)
return a;
else
return b;
}
ll min(ll a, ll b) {
if (a < b)
return a;
else
return b;
}
ll lowbit(ll x) { return x & (-x); }
ll prime(ll x) {
if (x <= 1)
return false;
for (int i = 2; i <= int(sqrt(x)); i++) {
if (x % i == 0)
return false;
}
return true;
}
bool cmp(ll a, ll b) { return a > b; }
ll gcd(ll a, ll b) {
ll r;
while (b > 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
ll powmod(ll a, ll b, ll mod) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
inline ll read() {
char c = getchar();
ll w = 1;
ll x = 0;
while (!isdigit(c))
(c == '-') && (w = -w), c = getchar();
while (isdigit(c))
x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
x *= w;
}
void fl(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
const int dx[8] = {-1, 1, 0, 0, -1, 1, -1, 1},
dy[8] = {0, 0, -1, 1, -1, -1, 1, 1};
#define N 100010
ll dp[N], a[N];
int main() {
fast;
ll n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (int i = 3; i <= n; i++) {
dp[i] = 1e17;
for (int j = max(i - k, 1); j <= i - 1; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << endl;
return 0;
} /*『你强归你强，Siyuan比你强』*/ | [
"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[i - j]);
}
cout << ans[n];
} | #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[i - j]);
}
cout << ans[n - 1];
} | [
"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 - 1, jump = 0; j >= 0, jump < k; j--, jump++) {
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #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 - 1, jump = 0; j >= 0 && jump < k; j--, jump++) {
dp[i] = min(dp[i], abs(a[i] - a[j]) + dp[j]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [] | 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] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[N - 1];
return 0;
} | #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] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[N - 1];
return 0;
} | [
"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] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[N - 1];
return 0;
} | #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] = min(dp[i] + abs(h[i] - h[i + j]), dp[i + j]);
}
}
cout << dp[N - 1];
return 0;
} | [
"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, dp[i - j] + abs(a[i] - a[i - j]));
}
}
dp[i] = mn;
}
cout << dp[n];
return 0;
} | #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[i - j] + abs(a[i] - a[i - j]));
}
}
dp[i] = mn;
}
cout << dp[n];
return 0;
} | [
"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, dp[i - j] + abs(a[i] - a[i - j]));
}
}
dp[i] = mn;
}
cout << dp[n];
return 0;
} | #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[i - j] + abs(a[i] - a[i - j]));
}
}
dp[i] = mn;
}
cout << dp[n];
return 0;
} | [
"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[i - j] + abs(a[i] - a[i - j]));
}
}
dp[i] = mn;
}
cout << dp[n];
return 0;
} | #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[i - j] + abs(a[i] - a[i - j]));
}
}
dp[i] = mn;
}
cout << dp[n];
return 0;
} | [
"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() \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define s(ar, n) sort(ar, ar + n)
#define rs(ar, n) sort(ar, ar + n, greater<int>())
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define cn(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ov(a, n) \
for (int i = n - 1; i >= 0; i--) \
cout << a[i] << " "; \
nl
#define ovp(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i].ff << " " << a[i].ss << endl;
#define maxa(ar, N) *max_element(ar, ar + N)
#define mina(ar, N) *min_element(ar, ar + N)
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pii;
ll powe(ll n, ll m) {
if (m == 0)
return 1;
ll t = powe(n, m / 2);
if (m % 2 == 0)
return (t * t);
return (((t * t)) * n);
}
ll mpowe(ll n, ll m) {
if (m == 0)
return 1;
ll t = mpowe(n, m / 2);
t %= MOD;
if (m % 2 == 0)
return (t * t) % MOD;
return (((t * t) % MOD) * n) % MOD;
}
ll logtwo(ll n) {
if (n == 1)
return 0;
return logtwo(n / 2) + 1;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/*void build(ll node,ll start,ll end)
{
if(start==end)
{
tree[node]=a[start];
}
else
{
ll mid = (start+end)/2;
build(2*node+1,start,mid);
build(2*node+2,mid+1,end);
tree[node]=gcd(tree[2*node+1],tree[2*node+2]);
}
}
void update(ll tree[],ll node,ll start,ll end,ll idx)
{
if(start==end)
{
tree[node] = max(0LL,tree[node]-1);
}
else
{
ll mid = (start+end)/2;
if(start<=idx && mid>=idx)
{
update(tree,2*node+1,start,mid,idx);
}
else
{
update(tree,2*node+2,mid+1,end,idx);
}
tree[node] = tree[2*node+1]+tree[2*node+2];
}
}
ll query(ll node,ll start,ll end,ll l,ll r)
{
if(r<start || l>end)
{
return 0;
}
if(l<=start && r>=end)
{
return tree[node];
}
ll mid = (start+end)/2;
ll p1 = query(2*node+1,start,mid,l,r);
ll p2 = query(2*node+2,mid+1,end,l,r);
return gcd(p1,p2);
}
*/
std::vector<ll> path;
void dfs(int x, std::vector<ll> v[], int visited[]) {
visited[x] = 1;
path.pb(x);
for (int i = 0; i < v[x].size(); i++) {
if (!visited[v[x][i]]) {
dfs(v[x][i], v, visited);
path.pb(x);
}
}
}
std::vector<ll> v;
int go(ll a, ll b) {
if (a == b) {
v.pb(a);
return 1;
}
if (a > b)
return 0;
else {
int f = go(2 * a, b);
if (f == 1) {
v.pb(a);
return 1;
}
f = go(10 * a + 1, b);
if (f == 1) {
v.pb(a);
return 1;
}
return 0;
}
}
int main() {
fastio();
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {0};
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
ll x = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 1; j <= k && i - j >= 0; j++) {
x = min(dp[i - j] + abs(a[i] - a[i - j]), x);
}
dp[i] = x;
}
cout << dp[n] << endl;
} | #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() \
int t; \
cin >> t; \
while (t--)
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define s(ar, n) sort(ar, ar + n)
#define rs(ar, n) sort(ar, ar + n, greater<int>())
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define cn(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ov(a, n) \
for (int i = n - 1; i >= 0; i--) \
cout << a[i] << " "; \
nl
#define ovp(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i].ff << " " << a[i].ss << endl;
#define maxa(ar, N) *max_element(ar, ar + N)
#define mina(ar, N) *min_element(ar, ar + N)
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
typedef pair<int, int> pii;
ll powe(ll n, ll m) {
if (m == 0)
return 1;
ll t = powe(n, m / 2);
if (m % 2 == 0)
return (t * t);
return (((t * t)) * n);
}
ll mpowe(ll n, ll m) {
if (m == 0)
return 1;
ll t = mpowe(n, m / 2);
t %= MOD;
if (m % 2 == 0)
return (t * t) % MOD;
return (((t * t) % MOD) * n) % MOD;
}
ll logtwo(ll n) {
if (n == 1)
return 0;
return logtwo(n / 2) + 1;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/*void build(ll node,ll start,ll end)
{
if(start==end)
{
tree[node]=a[start];
}
else
{
ll mid = (start+end)/2;
build(2*node+1,start,mid);
build(2*node+2,mid+1,end);
tree[node]=gcd(tree[2*node+1],tree[2*node+2]);
}
}
void update(ll tree[],ll node,ll start,ll end,ll idx)
{
if(start==end)
{
tree[node] = max(0LL,tree[node]-1);
}
else
{
ll mid = (start+end)/2;
if(start<=idx && mid>=idx)
{
update(tree,2*node+1,start,mid,idx);
}
else
{
update(tree,2*node+2,mid+1,end,idx);
}
tree[node] = tree[2*node+1]+tree[2*node+2];
}
}
ll query(ll node,ll start,ll end,ll l,ll r)
{
if(r<start || l>end)
{
return 0;
}
if(l<=start && r>=end)
{
return tree[node];
}
ll mid = (start+end)/2;
ll p1 = query(2*node+1,start,mid,l,r);
ll p2 = query(2*node+2,mid+1,end,l,r);
return gcd(p1,p2);
}
*/
std::vector<ll> path;
void dfs(int x, std::vector<ll> v[], int visited[]) {
visited[x] = 1;
path.pb(x);
for (int i = 0; i < v[x].size(); i++) {
if (!visited[v[x][i]]) {
dfs(v[x][i], v, visited);
path.pb(x);
}
}
}
std::vector<ll> v;
int go(ll a, ll b) {
if (a == b) {
v.pb(a);
return 1;
}
if (a > b)
return 0;
else {
int f = go(2 * a, b);
if (f == 1) {
v.pb(a);
return 1;
}
f = go(10 * a + 1, b);
if (f == 1) {
v.pb(a);
return 1;
}
return 0;
}
}
int main() {
fastio();
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1] = {0};
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
ll x = dp[i - 1] + abs(a[i] - a[i - 1]);
for (int j = 1; j <= k && j < i; j++) {
x = min(dp[i - j] + abs(a[i] - a[i - j]), x);
}
dp[i] = x;
}
cout << dp[n] << endl;
} | [
"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, sizeof(dp));
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 1; i < n; i++) {
for (int jump = 1; i - jump >= 1 && jump <= k; jump++) {
dp[i] = min(dp[i - jump] + abs(arr[i] - arr[i - jump]), dp[i]);
}
}
// for(int i=0;i<n;i++) cout<<dp[i]<<endl;
cout << dp[n - 1];
}
signed main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | #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, sizeof(dp));
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 1; i < n; i++) {
for (int jump = 1; i - jump >= 0 && jump <= k; jump++) {
dp[i] = min(dp[i - jump] + abs(arr[i] - arr[i - jump]), dp[i]);
}
}
// for(int i=0;i<n;i++) cout<<dp[i]<<endl;
cout << dp[n - 1];
}
signed main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
} | [
"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);
b[0] = 0;
for (int i = 1; i < k; i++)
b[i] = abs(a[i] - a[0]);
for (int i = k; i < n; i++) {
for (int j = i - k; j < i; j++) {
b[i] = min(b[i], b[j] + abs(a[i] - a[j]));
}
}
cout << b[n - 1] << endl;
return 0;
} | #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);
b[0] = 0;
for (int i = 1; i < min(k, n); i++)
b[i] = abs(a[i] - a[0]);
for (int i = k; i < n; i++) {
for (int j = i - k; j < i; j++) {
b[i] = min(b[i], b[j] + abs(a[i] - a[j]));
}
}
cout << b[n - 1] << endl;
return 0;
} | [
"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, abs(h[idx + i] - h[idx]) + solve(idx + i));
return ret;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cout << solve(0);
return 0;
}
| #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, abs(h[idx + i] - h[idx]) + solve(idx + i));
return ret;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cout << solve(0);
return 0;
}
| [
"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++) {
for (int j = 1; j <= k && i >= j; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n];
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
solve();
return 0;
} | //
// 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++) {
for (int j = 1; j <= k && i > j; j++) {
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
}
cout << dp[n];
}
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
solve();
return 0;
} | [
"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];
}
dp[0] = 0;
for (int j = 1; j <= k && j < n; ++j)
dp[j] = abs(arr[j] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 101000;
for (int j = 1; j <= k; ++j) {
if (i - j < 0)
break;
int pos = dp[i - j] + abs(arr[i] - arr[i - j]);
dp[i] = min(dp[i], pos);
}
}
// for(auto it : dp) cout<<it<<endl;
cout << dp[n - 1] << endl;
return 0;
}
| #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];
}
dp[0] = 0;
for (int j = 1; j <= k && j < n; ++j)
dp[j] = abs(arr[j] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = 1010000000;
for (int j = 1; j <= k; ++j) {
if (i - j < 0)
break;
int pos = dp[i - j] + abs(arr[i] - arr[i - j]);
dp[i] = min(dp[i], pos);
}
}
// for(auto it : dp) cout<<it<<endl;
cout << dp[n - 1] << endl;
return 0;
}
| [
"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(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define sd(t) scanf("%d", &(t))
#define rep(i, a, b) for (int i = a; i < b; i++)
#define hii cout << "hii" << endl
#define okay cout << "okay" << endl
#define hey cout << "hey" << endl
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const unordered_map<T, S> &v) {
for (auto i : v)
os << '(' << i.first << "=>" << i.second << ')' << ' ';
return os;
}
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <class Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <class Arg1, class... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *sep = strchr(names + 1, ',');
cerr.write(names, sep - names) << " : " << arg1 << " ";
__f(sep + 1, args...);
}
#else
#define trace(...) 0
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
"avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE
const int N = 2e5 + 10;
int arr[N];
vector<int> adj[N];
int dp[N];
int brr[N];
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("jjj.txt", "w", stdout);
#endif
}
clock_t time_p = clock();
void starboy1299() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void solve() {
int n, k;
cin >> n >> k;
rep(i, 0, n) { cin >> arr[i]; }
memset(dp, -1, sizeof(dp));
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 1; i < n; i++) {
dp[i] = dp[i - 1] + abs(arr[i - 1] - arr[i]);
for (int j = k; j > 0; j--) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - k] + abs(arr[i] - arr[i - k]));
}
}
cout << dp[n - 1] << endl;
}
int32_t main() {
// fast();
int t = 1;
// cin>> t;
while (t--)
solve();
// starboy1299();
} | #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(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define sd(t) scanf("%d", &(t))
#define rep(i, a, b) for (int i = a; i < b; i++)
#define hii cout << "hii" << endl
#define okay cout << "okay" << endl
#define hey cout << "hey" << endl
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
for (T i : v)
os << i << ' ';
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <class T, class S>
ostream &operator<<(ostream &os, const unordered_map<T, S> &v) {
for (auto i : v)
os << '(' << i.first << "=>" << i.second << ')' << ' ';
return os;
}
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <class Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <class Arg1, class... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *sep = strchr(names + 1, ',');
cerr.write(names, sep - names) << " : " << arg1 << " ";
__f(sep + 1, args...);
}
#else
#define trace(...) 0
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target( \
"avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif // ifndef ONLINE_JUDGE
const int N = 2e5 + 10;
int arr[N];
vector<int> adj[N];
int dp[N];
int brr[N];
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("jjj.txt", "w", stdout);
#endif
}
clock_t time_p = clock();
void starboy1299() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
void solve() {
int n, k;
cin >> n >> k;
rep(i, 0, n) { cin >> arr[i]; }
memset(dp, -1, sizeof(dp));
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(arr[i - 1] - arr[i]);
for (int j = k; j > 0; j--) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n - 1] << endl;
}
int32_t main() {
// fast();
int t = 1;
// cin>> t;
while (t--)
solve();
// starboy1299();
} | [
"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 <= K; ++k) {
if (0 <= i - k) {
ll x = dp[i - k] + abs(h - hs[i - k]);
m = min(m, x);
}
}
dp[i] = m;
}
cout << dp[N] << endl;
}
int main() {
solve();
return 0;
}
| #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 <= K; ++k) {
if (0 < i - k) {
ll x = dp[i - k] + abs(h - hs[i - k]);
m = min(m, x);
}
}
dp[i] = m;
}
cout << dp[N] << endl;
}
int main() {
solve();
return 0;
}
| [
"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 <= K; ++k) {
if (0 <= i - k) {
ll x = dp[i - k] + abs(h - hs[i - k]);
m = min(m, x);
}
}
dp[i] = m;
}
cout << dp[N] << endl;
}
int main() {
solve();
return 0;
}
| #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 <= K; ++k) {
if (0 < i - k) {
ll x = dp[i - k] + abs(h - hs[i - k]);
m = min(m, x);
}
}
dp[i] = m;
}
cout << dp[N] << endl;
}
int main() {
solve();
return 0;
}
| [
"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++)
if (i - j > 0)
m = min(dp[i - j] + llabs(a[i - j] - a[i]), m);
dp[i] = m;
}
cout << dp[n - 1] << endl;
}
| #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++)
if (i - j >= 0)
m = min(dp[i - j] + llabs(a[i - j] - a[i]), m);
dp[i] = m;
}
cout << dp[n - 1] << endl;
}
| [
"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 - j > 0)
m = min(dp[i - j] + llabs(a[i - j] - a[i]), m);
dp[i] = m;
}
cout << dp[n - 1] << endl;
}
| #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++)
if (i - j >= 0)
m = min(dp[i - j] + llabs(a[i - j] - a[i]), m);
dp[i] = m;
}
cout << dp[n - 1] << endl;
}
| [
"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); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
#define emp empty()
#define beg begin()
#define en end()
#define ump unordered_map
#define forl(i, a, n) for (int i = a; i < n; i++)
#define rfor(i, n, a) for (int i = n; i >= a; i--)
#define fore(i, a, n) for (int i = a; i <= n; i++)
#define len length()
const int N = 1e9 + 7;
const int MAX = 1e5 + 7;
int mem[MAX];
// recursive solution
// extend same solution of a to this by simulating for k jumps
int step(int pos, int k, int n, int arr[]) {
if (pos == n - 1)
return 0;
if (mem[pos] != -1)
return mem[pos];
int val = MAX;
forl(i, 1, k + 1) {
if (pos + i <= n - 1)
val = min(val, step(pos + i, k, n, arr) + abs(arr[pos] - arr[pos + i]));
else
break;
}
return mem[pos] = val;
}
// dp-- O(n*k)--- n dp states and for each dp state k possiblity
// recursion O(k^n) ---- for every i there are k posiblities
int main() {
int n, k;
cin >> n >> k;
int arr[n];
forl(i, 0, n) cin >> arr[i];
memset(mem, -1, sizeof(mem));
cout << step(0, k, n, arr) << endl;
;
// iterative approach
// int dp[n];
// //dp[i] means minimum cost to reach (0..i) from 0
// forl(i,0,n) dp[i]=N;
// dp[0]=0;
// forl(i,1,n)
// {
// fore(j,1,2)
// {
// if(i-j>=0) dp[i]=min(dp[i],dp[i-j]+abs(arr[i]-arr[i-j]));
// }
// }
// cout<<dp[n-1]<<endl;
}
| #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); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define lb lower_bound
#define ub upper_bound
#define emp empty()
#define beg begin()
#define en end()
#define ump unordered_map
#define forl(i, a, n) for (int i = a; i < n; i++)
#define rfor(i, n, a) for (int i = n; i >= a; i--)
#define fore(i, a, n) for (int i = a; i <= n; i++)
#define len length()
const int N = 1e9 + 7;
const int MAX = 1e5 + 7;
ll mem[MAX];
// recursive solution
// extend same solution of a to this by simulating for k jumps
ll step(int pos, int k, int n, int arr[]) {
if (pos == n - 1)
return 0;
if (mem[pos] != -1)
return mem[pos];
ll val = N;
forl(i, 1, k + 1) {
if (pos + i <= n - 1)
val = min(val, step(pos + i, k, n, arr) + abs(arr[pos] - arr[pos + i]));
else
break;
}
return mem[pos] = val;
}
// dp-- O(n*k)--- n dp states and for each dp state k possiblity
// recursion O(k^n) ---- for every i there are k posiblities
int main() {
int n, k;
cin >> n >> k;
int arr[n];
forl(i, 0, n) cin >> arr[i];
memset(mem, -1, sizeof(mem));
cout << step(0, k, n, arr) << endl;
// iterative approach
// int dp[n];
// //dp[i] means minimum cost to reach (0..i) from 0
// forl(i,0,n) dp[i]=N;
// dp[0]=0;
// forl(i,1,n)
// {
// fore(j,1,2)
// {
// if(i-j>=0) dp[i]=min(dp[i],dp[i-j]+abs(arr[i]-arr[i-j]));
// }
// }
// cout<<dp[n-1]<<endl;
}
| [
"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) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
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, INT16_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i - j >= 0)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
cout << dp[n - 1];
}
| #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) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> dp(n, INT32_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i - j >= 0)
dp[i] = min(dp[i - j] + abs(h[i] - h[i - j]), dp[i]);
}
cout << dp[n - 1];
}
| [] | 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 (i = 3; i <= n; i++) {
for (j = 1; j <= k && j <= i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
cout << dp[n];
} | #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 (i = 3; i <= n; i++) {
for (j = 1; j <= k && j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
cout << dp[n];
} | [
"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 = solve(i - u) + abs(a[i] - a[i - u]);
mn = min(mn, path);
}
return dp[i] = mn;
}
main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
memset(dp, -1, sizeof(dp));
cout << solve(n);
}
| #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 = solve(i - u) + abs(a[i] - a[i - u]);
mn = min(mn, path);
}
return dp[i] = mn;
}
main() {
scanf("%lld%lld", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
memset(dp, -1, sizeof(dp));
cout << solve(n);
}
| [
"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 j = i - 1; j >= i - k; j--) {
if (j >= 0) {
dp[i] = min(dp[i], (dp[j] + abs(a[i] - a[j])));
}
}
}
cout << dp[n - 1] << endl;
}
| #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 (int j = i - 1; j >= i - k; j--) {
if (j >= 0) {
dp[i] = min(dp[i], (dp[j] + abs(a[i] - a[j])));
}
}
}
cout << dp[n - 1] << endl;
}
| [
"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) {
dp[j] = min(dp[j], dp[i] + abs(h[j - 1] - h[i - 1]));
}
}
}
cout << dp[n];
return 0;
} | #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) {
dp[j] = min(dp[j], dp[i] + abs(h[j - 1] - h[i - 1]));
}
}
}
cout << dp[n];
return 0;
} | [
"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.