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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll arr[n + 1];
arr[0] = 0;
for (int i = 1; i <= n; i++)
cin >> arr[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = 10000000000;
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n];
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll arr[n + 1];
arr[0] = 0;
for (int i = 1; i <= n; i++)
cin >> arr[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = 1000000000000;
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 1)
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
cout << dp[n];
}
| [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 962,283 | 962,284 | u885151856 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int N, a, K;
vector<int> v, rez;
int main() {
cin >> N >> K;
rez.insert(rez.begin(), N, 10001);
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
int br;
rez[0] = 0;
for (int i = 1; i < N; i++) {
br = i;
for (int j = i - 1; j >= 0 && j >= i - K; j--) {
rez[i] = min(rez[i], abs(v[j] - v[i]) + rez[j]);
}
}
cout << rez[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int N, a, K;
vector<int> v, rez;
int main() {
cin >> N >> K;
rez.insert(rez.begin(), N, 1000000005);
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
int br;
rez[0] = 0;
for (int i = 1; i < N; i++) {
br = i;
for (int j = i - 1; j >= 0 && j >= i - K; j--) {
rez[i] = min(rez[i], abs(v[j] - v[i]) + rez[j]);
}
}
cout << rez[N - 1];
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,287 | 962,288 | u717974610 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int h[1000000];
int main() {
int N, K;
cin >> N >> K;
cin >> h[1];
for (int i = 2; i <= N; i++) {
cin >> h[i];
dp[i] = INT_MAX;
for (int j = i - 1, cnt = 1; j >= 0 && cnt <= K; j--, cnt++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[N] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int h[1000000];
int main() {
int N, K;
cin >> N >> K;
cin >> h[1];
for (int i = 2; i <= N; i++) {
cin >> h[i];
dp[i] = INT_MAX;
for (int j = i - 1, cnt = 1; j >= 1 && cnt <= K; j--, cnt++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[N] << endl;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,289 | 962,290 | u937063359 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define lli long long int
#define pb push_back
#define mp make_pair
#define fo(i, n) for (i = 0; i < (n); i++)
#define endl "\n"
#define mod 1000000007
long long int i, j;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
lli n, k;
cin >> n >> k;
int a[n], b[n];
fo(i, n) {
cin >> a[i];
b[i] = mod;
}
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int t = mod;
for (int l = i - 1; l > i - 1 - k && l > 0; l--) {
// b[i]=min(abs(a[i]-a[i-1])+b[i-1],abs(a[i]-a[i-2])+b[i-2]);
t = min(t, b[l] + abs(a[i] - a[l]));
// cout<<t<<" ";
}
b[i] = t;
// cout<<a[i]<<" "<<endl;
}
cout << b[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define lli long long int
#define pb push_back
#define mp make_pair
#define fo(i, n) for (i = 0; i < (n); i++)
#define endl "\n"
#define mod 1000000007
long long int i, j;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
lli n, k;
cin >> n >> k;
int a[n], b[n];
fo(i, n) {
cin >> a[i];
b[i] = mod;
}
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
int t = mod;
for (int l = i - 1; l > i - 1 - k && l >= 0; l--) {
// b[i]=min(abs(a[i]-a[i-1])+b[i-1],abs(a[i]-a[i-2])+b[i-2]);
t = min(t, b[l] + abs(a[i] - a[l]));
// cout<<t<<" ";
}
b[i] = t;
// cout<<a[i]<<" "<<endl;
}
cout << b[n - 1];
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,295 | 962,296 | u221917024 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(ll i, ll k, ll a[], ll n, vector<ll> &dp) {
if (dp[i] != -1) {
return dp[i];
}
ll c = LONG_LONG_MAX;
for (ll j = 1; j <= k; j++) {
if (i < n - j) {
c = min(c, abs(a[i] - a[i + 1]) + solve(i + 1, k, a, n, dp));
}
}
dp[i] = c;
return dp[i];
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n, -1);
dp[n - 1] = 0;
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
cout << solve(0, k, a, n, dp);
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(ll i, ll k, ll a[], ll n, vector<ll> &dp) {
if (dp[i] != -1) {
return dp[i];
}
ll c = LONG_LONG_MAX;
for (ll j = 1; j <= k; j++) {
if (i < n - j) {
c = min(c, abs(a[i] - a[i + j]) + solve(i + j, k, a, n, dp));
}
}
dp[i] = c;
return dp[i];
}
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n, -1);
dp[n - 1] = 0;
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
cout << solve(0, k, a, n, dp);
} | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,297 | 962,298 | u785762524 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sc(n) scanf("%d", &n)
#define scl(n) scanf("%lld", &n)
#define pr(n) printf("%d", n)
#define prl(n) printf("%lld", n)
#define nl printf("\n")
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
ll pow1(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = ans * a;
}
a = a * a;
b = b >> 1;
}
return ans;
}
ll dp[100005];
int main() {
ll n, i, j, k;
cin >> n >> k;
ll h[n + 1];
for (i = 1; i <= n; i++)
cin >> h[i];
dp[2] = abs(h[2] - h[1]);
dp[1] = 0;
for (i = 3; i <= n; i++)
for (j = 1; j <= k && j <= i; j++) {
if (j == 1)
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
else
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
// cout<<i<<" "<<dp[i]<<endl;
}
cout << dp[n] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sc(n) scanf("%d", &n)
#define scl(n) scanf("%lld", &n)
#define pr(n) printf("%d", n)
#define prl(n) printf("%lld", n)
#define nl printf("\n")
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
ll pow1(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = ans * a;
}
a = a * a;
b = b >> 1;
}
return ans;
}
ll dp[100005];
int main() {
ll n, i, j, k;
cin >> n >> k;
ll h[n + 1];
for (i = 1; i <= n; i++)
cin >> h[i];
dp[2] = abs(h[2] - h[1]);
dp[1] = 0;
for (i = 3; i <= n; i++)
for (j = 1; j <= k && j < i; j++) {
if (j == 1)
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
else
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
// cout<<i<<" "<<dp[i]<<endl;
}
cout << dp[n] << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,299 | 962,300 | u630567900 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
LL n, k;
LL h[100000];
LL c[100000];
cin >> n >> k;
for (LL i = 0; i < n; i++) {
cin >> h[i];
}
c[0] = 0;
for (LL i = 1; i < n; i++) {
LL min = 100000;
for (LL m = 1; m <= k; m++) {
if (i - m < 0) {
break;
}
LL dist = abs(h[i] - h[i - m]) + c[i - m];
if (dist < min)
min = dist;
}
c[i] = min;
}
std::cout << c[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int main() {
LL n, k;
LL h[100000];
LL c[100000];
cin >> n >> k;
for (LL i = 0; i < n; i++) {
cin >> h[i];
}
c[0] = 0;
for (LL i = 1; i < n; i++) {
LL min = 1000000000000000;
for (LL m = 1; m <= k; m++) {
if (i - m < 0) {
break;
}
LL dist = abs(h[i] - h[i - m]) + c[i - m];
if (dist < min)
min = dist;
}
c[i] = min;
}
std::cout << c[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 962,305 | 962,306 | u649423108 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int n, k, h[N];
int f[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = n - 1; i >= 1; i--) {
f[i] = inf;
for (int j = 1; j <= min(n - i, k); j++)
f[i] = min(f[i], f[i + j] + abs(h[i] - h[i + 1]));
}
cout << f[1];
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int inf = 1e9 + 10;
int n, k, h[N];
int f[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = n - 1; i >= 1; i--) {
f[i] = inf;
for (int j = 1; j <= min(n - i, k); j++)
f[i] = min(f[i], f[i + j] + abs(h[i] - h[i + j]));
}
cout << f[1];
}
| [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,310 | 962,311 | u596976719 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) \
vector<vector<type>> c(m, vector<type>(n)); \
for (auto &r : c) \
for (auto &i : r) \
cin >> i;
#define rep(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define rrep(i, a, n) for (int i = (a), i##_len = (n); i > i##_len; --i)
#define each(x, y) for (auto &(x) : (y))
#define var(type, ...) \
type __VA_ARGS__; \
Scan(__VA_ARGS__);
template <typename T> void Scan(T &t) { cin >> t; }
template <typename First, typename... Rest>
void Scan(First &first, Rest &...rest) {
cin >> first;
Scan(rest...);
}
#define vec(type, c, n) \
vector<type> c(n); \
for (auto &i : c) \
cin >> i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
#define mt make_tuple
inline string zero(int a, string s, char c = '0') {
return string(a - len(s), c) + s;
}
inline string zero(int a, int t, char c = '0') {
return zero(a, to_string(t), c);
}
inline string zero(int a, ll t, char c = '0') {
return zero(a, to_string(t), c);
}
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a, b) \
if (a < b) \
a = b
#define chmin(a, b) \
if (a > b) \
a = b
template <class T> inline void print(T t) { cout << t << '\n'; }
template <class H, class... T> inline void print(H h, T... t) {
cout << h << " ";
print(t...);
}
#define MAX int(1e5 + 10)
#define INF ll(1e5)
ll n, k, h[MAX], v[MAX];
void solve() {
cin >> n >> k;
rep(i, 0, n) cin >> h[i];
fill(v, v + n, INF);
v[0] = 0;
rep(i, 1, n) {
rep(j, 1, min(ll(i) + 1, k + 1)) {
chmin(v[i], abs(h[i] - h[i - j]) + v[i - j]);
}
}
print(v[n - 1]);
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) \
vector<vector<type>> c(m, vector<type>(n)); \
for (auto &r : c) \
for (auto &i : r) \
cin >> i;
#define rep(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define rrep(i, a, n) for (int i = (a), i##_len = (n); i > i##_len; --i)
#define each(x, y) for (auto &(x) : (y))
#define var(type, ...) \
type __VA_ARGS__; \
Scan(__VA_ARGS__);
template <typename T> void Scan(T &t) { cin >> t; }
template <typename First, typename... Rest>
void Scan(First &first, Rest &...rest) {
cin >> first;
Scan(rest...);
}
#define vec(type, c, n) \
vector<type> c(n); \
for (auto &i : c) \
cin >> i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
#define mt make_tuple
inline string zero(int a, string s, char c = '0') {
return string(a - len(s), c) + s;
}
inline string zero(int a, int t, char c = '0') {
return zero(a, to_string(t), c);
}
inline string zero(int a, ll t, char c = '0') {
return zero(a, to_string(t), c);
}
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a, b) \
if (a < b) \
a = b
#define chmin(a, b) \
if (a > b) \
a = b
template <class T> inline void print(T t) { cout << t << '\n'; }
template <class H, class... T> inline void print(H h, T... t) {
cout << h << " ";
print(t...);
}
#define MAX int(1e5 + 10)
#define INF ll(1e9)
ll n, k, h[MAX], v[MAX];
void solve() {
cin >> n >> k;
rep(i, 0, n) cin >> h[i];
fill(v, v + n, INF);
v[0] = 0;
rep(i, 1, n) {
rep(j, 1, min(ll(i) + 1, k + 1)) {
chmin(v[i], abs(h[i] - h[i - j]) + v[i - j]);
}
}
print(v[n - 1]);
}
int main() {
solve();
return 0;
}
| [
"preprocessor.define.value.change",
"literal.float.change"
] | 962,318 | 962,319 | u889914341 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT16_MAX;
for (int j = 1; j <= k & j <= i; j++) {
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
}
// for(int i=0;i<n;i++){
// cout<<dp[i]<<endl;
// }
cout << dp[n - 1];
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT32_MAX;
for (int j = 1; j <= k & j <= i; j++) {
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - j]);
}
}
// for(int i=0;i<n;i++){
// cout<<dp[i]<<endl;
// }
cout << dp[n - 1];
} | [
"assignment.value.change",
"identifier.change"
] | 962,320 | 962,321 | u826345451 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
int h[100000];
long long d[100000];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
memset(d, 0, 100000);
for (int i = 1; i < n; i++) {
long long w = d[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 1; j <= k; j++)
w = min(d[i - j] + abs(h[i] - h[i - j]), w);
d[i] = w;
}
cout << d[n - 1] << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string.h>
using namespace std;
int h[100000];
long long d[100000];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
memset(d, 0, 100000);
for (int i = 1; i < n; i++) {
long long w = d[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 1; j <= min(k, i); j++)
w = min(d[i - j] + abs(h[i] - h[i - j]), w);
d[i] = w;
}
cout << d[n - 1] << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 962,325 | 962,326 | u597243424 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
long long int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i < k)
for (int j = 1; j < i; ++j)
dp[i] = min(dp[i - j - 1] + abs(h[i - j - 1] - h[i]), dp[i]);
else
for (int j = i - k; j < i - 1; ++j)
dp[i] = min(dp[i - j - 1] + abs(h[i - j - 1] - h[i]), dp[i]);
}
cout << dp[n - 1];
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; ++i)
cin >> h[i];
long long int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i < k)
for (int j = 1; j < i; ++j)
dp[i] = min(dp[i - j - 1] + abs(h[i - j - 1] - h[i]), dp[i]);
else
for (int j = 1; j < k; ++j)
dp[i] = min(dp[i - j - 1] + abs(h[i - j - 1] - h[i]), dp[i]);
}
cout << dp[n - 1];
} | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"identifier.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.cond... | 962,329 | 962,330 | u696394763 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 100000;
for (int k = 1; k <= K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++)
Cost[i] = select_k(i, min(K, i - 1));
cout << Cost[N] << endl;
}
int main() {
cin >> N >> K;
for (int i = 1; i <= N; i++)
cin >> h[i];
solve();
} | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 10000000000;
for (int k = 1; k <= K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++)
Cost[i] = select_k(i, min(K, i - 1));
cout << Cost[N] << endl;
}
int main() {
cin >> N >> K;
for (int i = 1; i <= N; i++)
cin >> h[i];
solve();
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 962,333 | 962,334 | u718394671 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 100000;
for (int k = 0; k < K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++)
Cost[i] = select_k(i, min(K, i));
cout << Cost[N] << endl;
}
int main() {
cin >> N >> K;
for (int i = 1; i <= N; i++)
cin >> h[i];
solve();
} | #include <cmath>
#include <iostream>
using namespace std;
int N, K, h[100000 + 5], Cost[100000 + 5] = {0};
int select_k(int i, int K) {
int cost = 10000000000;
for (int k = 1; k <= K; k++)
cost = min(cost, abs(h[i] - h[i - k]) + Cost[i - k]);
return cost;
}
void solve() {
Cost[1] = 0;
Cost[2] = abs(h[2] - h[1]);
for (int i = 3; i <= N; i++)
Cost[i] = select_k(i, min(K, i - 1));
cout << Cost[N] << endl;
}
int main() {
cin >> N >> K;
for (int i = 1; i <= N; i++)
cin >> h[i];
solve();
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.change"
] | 962,335 | 962,334 | u718394671 | cpp |
p03161 | #include <iostream>
using namespace std;
const int maxN = 100000;
const int64_t inf = (1LL << 50);
int h[maxN];
int64_t dp[maxN];
int main() {
int n, k;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
fill(dp, dp + n, inf);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - k; j < i; j++) {
if (j >= 0)
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | #include <iostream>
using namespace std;
const int maxN = 100000;
const int64_t inf = (1LL << 50);
int h[maxN];
int64_t dp[maxN];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
fill(dp, dp + n, inf);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = i - k; j < i; j++) {
if (j >= 0)
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 962,336 | 962,337 | u602850810 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define f(n) for (ll i = 0; i < n; i++)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define tr(c, it) for (((c).begin())it = (c).begin(); it != (c).end(); it++)
#define sz(c) (c).size()
#define all(c) (c).begin(), (c).end()
#define sl(a) scanf("%lld", &a);
#define TH 1000
#define F first
#define S second
#define N 100005
ll MOD = pow(10, 9) + 7;
ll INF = 1ll << 60;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int h[n + 1];
h[0] = -1;
rep(i, 1, n + 1) { scanf("%d", &h[i]); }
ll dp[n + 1];
rep(i, 0, n + 1) dp[i] = INF;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
rep(i, 3, n + 1) {
for (ll j = max(1, abs(k - i)); j < i; j++) {
dp[i] = min(dp[i], abs(h[j] - h[i]) + dp[j]);
}
}
printf("%lld", dp[n]);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repb(i, a, b) for (ll i = a; i >= b; i--)
#define f(n) for (ll i = 0; i < n; i++)
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define tr(c, it) for (((c).begin())it = (c).begin(); it != (c).end(); it++)
#define sz(c) (c).size()
#define all(c) (c).begin(), (c).end()
#define sl(a) scanf("%lld", &a);
#define TH 1000
#define F first
#define S second
#define N 100005
ll MOD = pow(10, 9) + 7;
ll INF = 1ll << 60;
int main() {
int n, k;
scanf("%d%d", &n, &k);
int h[n + 1];
h[0] = -1;
rep(i, 1, n + 1) { scanf("%d", &h[i]); }
ll dp[n + 1];
rep(i, 0, n + 1) dp[i] = INF;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
rep(i, 3, n + 1) {
for (ll j = max(1, i - k); j < i; j++) {
dp[i] = min(dp[i], abs(h[j] - h[i]) + dp[j]);
}
}
printf("%lld", dp[n]);
}
| [
"control_flow.loop.for.initializer.change",
"call.remove",
"call.arguments.change"
] | 962,338 | 962,339 | u192404631 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
//#define int ll
int n, k, h[100001], dp[100001];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
if (i >= j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod = 1e9 + 7;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
//#define int ll
int n, k, h[100001], dp[100001];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++) {
if (i > j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n];
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,344 | 962,345 | u192208612 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k, dp[100010], a[100010];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 30000;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= i && j <= k; j++) {
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, k, dp[100010], a[100010];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
dp[i] = 1000000010;
}
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= i && j <= k; j++) {
dp[i] = min(dp[i - j] + abs(a[i] - a[i - j]), dp[i]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 962,346 | 962,347 | u635992896 | cpp |
p03161 | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
const ll MAX_N = 1e5;
ll N, K;
ll h[MAX_N];
ll dp[MAX_N + 1]; // メモ化テーブル
// i番目以降の品物から重さの総和がj以下になるように選ぶ
void rec(ll i) {
if (i == 0)
dp[i] = 0;
else if (i <= K)
dp[i] = abs(h[i] - h[0]);
else {
ll ans = 1e4;
for (ll j = 1; j <= K; ++j) {
ll tmp = dp[i - j] + abs(h[i] - h[i - j]);
if (tmp < ans)
ans = tmp;
}
dp[i] = ans;
}
return;
}
int main() {
// 入力
cin >> N >> K;
for (ll i = 0; i < N; ++i)
cin >> h[i];
// 解法
// まだ調べていないことを表す-1でメモ化テーブルを初期化
memset(dp, -1, sizeof(dp));
REP(i, N) rec(i);
// REP(i,N) printf("%d\n", dp[i]);
printf("%d\n", dp[N - 1]);
}
| /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
const ll MAX_N = 1e5;
ll N, K;
ll h[MAX_N];
ll dp[MAX_N + 1]; // メモ化テーブル
// i番目以降の品物から重さの総和がj以下になるように選ぶ
void rec(ll i) {
if (i == 0)
dp[i] = 0;
else if (i <= K)
dp[i] = abs(h[i] - h[0]);
else {
ll ans = 1e9;
for (ll j = 1; j <= K; ++j) {
ll tmp = dp[i - j] + abs(h[i] - h[i - j]);
if (tmp < ans)
ans = tmp;
}
dp[i] = ans;
}
return;
}
int main() {
// 入力
cin >> N >> K;
for (ll i = 0; i < N; ++i)
cin >> h[i];
// 解法
// まだ調べていないことを表す-1でメモ化テーブルを初期化
memset(dp, -1, sizeof(dp));
REP(i, N) rec(i);
// REP(i,N) printf("%d\n", dp[i]);
printf("%d\n", dp[N - 1]);
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 962,350 | 962,351 | u757738907 | cpp |
p03161 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int Maxn = 110000;
int n, h[Maxn], f[Maxn], k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
memset(f, 0x3f, sizeof(f)), f[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = 1; j < i && j <= k; j++)
f[i] = min(f[i], f[i - j] + abs(h[i] - h[j]));
printf("%d", f[n]);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
const int Maxn = 110000;
int n, h[Maxn], f[Maxn], k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
memset(f, 0x3f, sizeof(f)), f[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = 1; j < i && j <= k; j++)
f[i] = min(f[i], f[i - j] + abs(h[i] - h[i - j]));
printf("%d", f[n]);
}
| [
"assignment.change"
] | 962,358 | 962,359 | u360800499 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(i - k, 0ll); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(i - k, 1ll); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,360 | 962,361 | u505087895 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1 << 60);
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(i - k, 0ll); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(i - k, 1ll); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n];
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,362 | 962,361 | u505087895 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
int n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1 << 30);
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(i - k, 0); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
long long n, dp[100002], v[100002], k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = (1ll << 60);
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(i - k, 1ll); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
}
cout << dp[n];
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"call.arguments.change"
] | 962,364 | 962,361 | u505087895 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define forall(i, j, n) for (int i = j; i < n; i++)
#define all(c) c.begin(), c.end()
#define tr(container, it) \
for (__typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define rt(container, it) \
for (__typeof(container.rbegin()) it = container.rbegin(); \
it != container.rend(); it++)
#define present(container, element) (container.find(element) != container.end())
#define cpresetn(container, element) (find(all(container)), element) != container.end())
#define sz(a) int((a).size())
#define pb(a) push_back(a)
#define si(n) scanf("%d", &n)
#define sll(n) scanf("%lld", &n)
#define pi(n) 0 * printf("%d\n", n)
#define pll(n) 0 * printf("%lld\n", n)
#define SET(container, value) memset(container, value, sizeof container)
#define MP make_pair
#define F first
#define S second
#define scan_all(...) __s(__VA_ARGS__)
template <typename Arg1> void __s(Arg1 &&arg1) { cin >> arg1; }
template <typename Arg1, typename... Args>
void __s(Arg1 &&arg1, Args &&...args) {
cin >> arg1;
__s(args...);
}
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << 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...);
}
std::vector<std::string> tokenize(const std::string &s,
const std::string &delims) {
std::vector<std::string> tokens;
size_t offset = 0;
while (true) {
size_t nonDelim = s.find_first_not_of(delims, offset);
if (nonDelim == std::string::npos) {
break; // Nothing left.
}
size_t delim = s.find_first_of(delims, nonDelim);
// Finish tokenizing if this is the last token,
// or we've found enough tokens.
if (delim == std::string::npos) {
tokens.push_back(s.substr(nonDelim));
break;
}
tokens.push_back(s.substr(nonDelim, delim - nonDelim));
offset = delim;
}
return tokens;
}
int main() {
int n, k;
si(n);
si(k);
vector<ll> dp(n + 1), h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
vector<ll> temp;
int temp_idx = 1;
while ((temp_idx <= k) && (i - temp_idx >= 0)) {
temp.pb(dp[i - temp_idx] + llabs(h[i - temp_idx] - h[i]));
temp_idx++;
}
dp[i] = *min_element(all(temp));
}
cout << dp[n] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, n) for (int i = 0; i < n; i++)
#define forall(i, j, n) for (int i = j; i < n; i++)
#define all(c) c.begin(), c.end()
#define tr(container, it) \
for (__typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
#define rt(container, it) \
for (__typeof(container.rbegin()) it = container.rbegin(); \
it != container.rend(); it++)
#define present(container, element) (container.find(element) != container.end())
#define cpresetn(container, element) (find(all(container)), element) != container.end())
#define sz(a) int((a).size())
#define pb(a) push_back(a)
#define si(n) scanf("%d", &n)
#define sll(n) scanf("%lld", &n)
#define pi(n) 0 * printf("%d\n", n)
#define pll(n) 0 * printf("%lld\n", n)
#define SET(container, value) memset(container, value, sizeof container)
#define MP make_pair
#define F first
#define S second
#define scan_all(...) __s(__VA_ARGS__)
template <typename Arg1> void __s(Arg1 &&arg1) { cin >> arg1; }
template <typename Arg1, typename... Args>
void __s(Arg1 &&arg1, Args &&...args) {
cin >> arg1;
__s(args...);
}
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << 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...);
}
std::vector<std::string> tokenize(const std::string &s,
const std::string &delims) {
std::vector<std::string> tokens;
size_t offset = 0;
while (true) {
size_t nonDelim = s.find_first_not_of(delims, offset);
if (nonDelim == std::string::npos) {
break; // Nothing left.
}
size_t delim = s.find_first_of(delims, nonDelim);
// Finish tokenizing if this is the last token,
// or we've found enough tokens.
if (delim == std::string::npos) {
tokens.push_back(s.substr(nonDelim));
break;
}
tokens.push_back(s.substr(nonDelim, delim - nonDelim));
offset = delim;
}
return tokens;
}
int main() {
int n, k;
si(n);
si(k);
vector<ll> dp(n + 1), h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
vector<ll> temp;
int temp_idx = 1;
while ((temp_idx <= k) && (i - temp_idx >= 1)) {
temp.pb(dp[i - temp_idx] + llabs(h[i - temp_idx] - h[i]));
temp_idx++;
}
dp[i] = *min_element(all(temp));
}
cout << dp[n] << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.condition.change"
] | 962,365 | 962,366 | u289277024 | cpp |
p03161 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 1e5 + 6;
const int INF = 1e19 + 8;
int n, k;
int h[MAX], dp[MAX];
signed main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 2; i < MAX; i++) {
dp[i] = INF;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i >= j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n];
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX = 1e5 + 6;
const int INF = 1e19 + 8;
int n, k;
int h[MAX], dp[MAX];
signed main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
for (int i = 2; i < MAX; i++) {
dp[i] = INF;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i > j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n];
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,369 | 962,370 | u161997524 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair
#define all(o) (o).begin(), (o).end()
#define mset(m, v) memset(m, v, sizeof(m))
#define fr(i, n) for (lli i = 0; i < n; ++i)
#define rep(i, a, b) for (lli i = a; i <= b; ++i)
#define per(i, a, b) for (lli i = a; i >= b; i--)
#define remin(a, b) (a = min((a), (b)))
#define remax(a, b) (a = max((a), (b)))
#define sz(x) (lli)(x).size()
#define endl '\n'
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> ii;
typedef vector<lli> vi;
typedef vector<ii> vii;
typedef vector<vi> graph;
long long MOD = 1000000007;
long double EPS = 1e-9;
#define debarr(a, n) \
cout << #a << " : "; \
for (int i = 0; i < n; i++) \
cerr << a[i] << " "; \
cerr << endl;
#define debmat(mat, row, col) \
cout << #mat << " :\n"; \
for (int i = 0; i < row; i++) { \
for (int j = 0; j < col; j++) \
cerr << mat[i][j] << " "; \
cerr << endl; \
}
#define pr(...) dbs(#__VA_ARGS__, __VA_ARGS__)
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, const unordered_set<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const unordered_map<S, T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, const set<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, const multiset<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const map<S, T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> void dbs(string str, T t) {
cerr << str << " : " << t << "\n";
}
template <class T, class... S> void dbs(string str, T t, S... s) {
int idx = str.find(',');
cerr << str.substr(0, idx) << " : " << t << ",";
dbs(str.substr(idx + 1), s...);
}
template <class T> void prc(T a, T b) {
cerr << "[";
for (T i = a; i != b; ++i) {
if (i != a)
cerr << ", ";
cerr << *i;
}
cerr << "]\n";
}
lli binpow(lli b, lli p, lli mod) {
lli ans = 1;
b %= mod;
for (; p; p >>= 1) {
if (p & 1)
ans = ans * b % mod;
b = b * b % mod;
}
return ans;
}
void pre() {}
void solve() {
lli n, k;
cin >> n >> k;
lli arr[n + 1];
fr(i, n) cin >> arr[i];
lli dp[n + 1];
fr(i, n + 1) dp[i] = MOD * MOD;
dp[0] = 0;
rep(i, 0, n - 1) {
rep(j, 1, k) { remin(dp[i + j], dp[i] + abs(arr[i] - arr[i + j])); }
}
cout << dp[n - 1] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);
pre();
lli t = 1; // cin>>t;
for (lli i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair
#define all(o) (o).begin(), (o).end()
#define mset(m, v) memset(m, v, sizeof(m))
#define fr(i, n) for (lli i = 0; i < n; ++i)
#define rep(i, a, b) for (lli i = a; i <= b; ++i)
#define per(i, a, b) for (lli i = a; i >= b; i--)
#define remin(a, b) (a = min((a), (b)))
#define remax(a, b) (a = max((a), (b)))
#define sz(x) (lli)(x).size()
#define endl '\n'
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> ii;
typedef vector<lli> vi;
typedef vector<ii> vii;
typedef vector<vi> graph;
long long MOD = 1000000007;
long double EPS = 1e-9;
#define debarr(a, n) \
cout << #a << " : "; \
for (int i = 0; i < n; i++) \
cerr << a[i] << " "; \
cerr << endl;
#define debmat(mat, row, col) \
cout << #mat << " :\n"; \
for (int i = 0; i < row; i++) { \
for (int j = 0; j < col; j++) \
cerr << mat[i][j] << " "; \
cerr << endl; \
}
#define pr(...) dbs(#__VA_ARGS__, __VA_ARGS__)
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, const unordered_set<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const unordered_map<S, T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, const set<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> ostream &operator<<(ostream &os, const multiset<T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const map<S, T> &p) {
os << "[ ";
for (auto &it : p)
os << it << " ";
return os << "]";
}
template <class T> void dbs(string str, T t) {
cerr << str << " : " << t << "\n";
}
template <class T, class... S> void dbs(string str, T t, S... s) {
int idx = str.find(',');
cerr << str.substr(0, idx) << " : " << t << ",";
dbs(str.substr(idx + 1), s...);
}
template <class T> void prc(T a, T b) {
cerr << "[";
for (T i = a; i != b; ++i) {
if (i != a)
cerr << ", ";
cerr << *i;
}
cerr << "]\n";
}
lli binpow(lli b, lli p, lli mod) {
lli ans = 1;
b %= mod;
for (; p; p >>= 1) {
if (p & 1)
ans = ans * b % mod;
b = b * b % mod;
}
return ans;
}
void pre() {}
void solve() {
lli n, k;
cin >> n >> k;
lli arr[n + k + 1];
fr(i, n) cin >> arr[i];
lli dp[n + k + 1];
fr(i, n + 1) dp[i] = MOD * MOD;
dp[0] = 0;
rep(i, 0, n - 1) {
rep(j, 1, k) { remin(dp[i + j], dp[i] + abs(arr[i] - arr[i + j])); }
}
cout << dp[n - 1] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);
pre();
lli t = 1; // cin>>t;
for (lli i = 1; i <= t; i++) {
// cout<<"Case #"<<i<<": ";
solve();
}
}
| [
"expression.operation.binary.add",
"variable_declaration.array_dimensions.change"
] | 962,373 | 962,374 | u473487547 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define otp(n) cout << n;
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define ctv(v) rep(i, (v).size()) ct(v[i])
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define repo(i, o, n) for (int i = o; i < n; i++)
#define repm(i, n) for (int i = n - 1; i >= 0; i--)
#define repv(i, v) for (int i = 0; i < (v).size(); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sperase(v, n) (v).erase(remove(all(v), n), (v).end());
#define vdelete(v) (v).erase(unique(all(v)), (v).end());
#define pb(n) push_back(n);
int n, k, h[100000], dp[100000];
main() {
cin >> n >> k;
rep(i, n) {
cin >> h[i];
dp[i] = 20000;
}
dp[0] = 0;
rep(i, n) {
repo(j, i + 1, min(n, i + k + 1)) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
ct(dp[n - 1])
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define otp(n) cout << n;
#define ct(n) cout << n << endl;
#define cts(n) cout << n << " ";
#define cte cout << endl;
#define ctv(v) rep(i, (v).size()) ct(v[i])
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define repo(i, o, n) for (int i = o; i < n; i++)
#define repm(i, n) for (int i = n - 1; i >= 0; i--)
#define repv(i, v) for (int i = 0; i < (v).size(); i++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sperase(v, n) (v).erase(remove(all(v), n), (v).end());
#define vdelete(v) (v).erase(unique(all(v)), (v).end());
#define pb(n) push_back(n);
int n, k, h[100000], dp[100000];
main() {
cin >> n >> k;
rep(i, n) {
cin >> h[i];
dp[i] = 1000000000000000000;
}
dp[0] = 0;
rep(i, n - 1) {
repo(j, i + 1, min(n, i + k + 1)) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
ct(dp[n - 1])
}
| [
"literal.number.change",
"assignment.value.change"
] | 962,375 | 962,376 | u721367699 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100005
#define MAX_H 10000
int main() {
ll N, K;
int h[MAX];
int cost[MAX];
scanf("%lld", &N);
scanf("%lld", &K);
for (ll i = 0; i < N; i++) {
int k;
scanf("%d", &k);
h[i] = k;
}
cost[0] = 0;
for (ll i = 1; i < K; i++) {
int mini = MAX_H;
for (ll l = 0; l < i; l++) {
mini = min(mini, abs(h[i] - h[i - l - 1]) + cost[i - l - 1]);
}
cost[i] = mini;
}
for (ll i = K; i < N; i++) {
int mini = MAX_H;
for (int l = 0; l < K; l++) {
mini = min(mini, abs(h[i] - h[i - l - 1]) + cost[i - l - 1]);
}
cost[i] = mini;
}
cout << cost[N - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 100005
#define MAX_H 10000 * 1000000
int main() {
ll N, K;
int h[MAX];
ll cost[MAX];
scanf("%lld", &N);
scanf("%lld", &K);
for (ll i = 0; i < N; i++) {
int k;
scanf("%d", &k);
h[i] = k;
}
cost[0] = 0;
for (ll i = 1; i < K; i++) {
ll mini = MAX_H;
for (ll l = 0; l < i; l++) {
mini = min(mini, abs(h[i] - h[i - l - 1]) + cost[i - l - 1]);
}
cost[i] = mini;
}
for (ll i = K; i < N; i++) {
ll mini = MAX_H;
for (int l = 0; l < K; l++) {
mini = min(mini, abs(h[i] - h[i - l - 1]) + cost[i - l - 1]);
}
cost[i] = mini;
}
cout << cost[N - 1];
return 0;
}
| [
"variable_declaration.type.change"
] | 962,396 | 962,395 | u297590902 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int A[100002];
int F[100002];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> A[i];
}
F[1] = 0;
F[2] = (int)abs(A[2] - A[1]);
for (int i = 3; i <= n; ++i) {
int min = F[i - 1] + abs(A[i] - A[i - 1]);
for (int j = 2; j <= k; ++j) {
int a = max(0, i - j);
int x = F[a] + abs(A[i] - A[a]);
if (x < min) {
min = x;
}
}
F[i] = min;
}
cout << F[n];
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int A[100002];
int F[100002];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> A[i];
}
F[1] = 0;
F[2] = (int)abs(A[2] - A[1]);
for (int i = 3; i <= n; ++i) {
int min = F[i - 1] + abs(A[i] - A[i - 1]);
for (int j = 2; j <= k; ++j) {
int a = max(1, i - j);
int x = F[a] + abs(A[i] - A[a]);
if (x < min) {
min = x;
}
}
F[i] = min;
}
cout << F[n];
return 0;
} | [
"literal.number.change",
"call.arguments.change"
] | 962,409 | 962,410 | u722318795 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, m;
long long a[100005], dp[100005];
int main(int argc, const char *argv[]) {
// freopen("/Users/danya.smelskiy/Documents/Danya/Resources/input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i == 1)
continue;
dp[i] = 1e18;
for (int j = i - 1; j >= 0 && j >= i - m; --j) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << '\n';
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int n, m;
long long a[100005], dp[100005];
int main(int argc, const char *argv[]) {
// freopen("/Users/danya.smelskiy/Documents/Danya/Resources/input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i == 1)
continue;
dp[i] = 1e18;
for (int j = i - 1; j > 0 && j >= i - m; --j) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << '\n';
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,413 | 962,414 | u301704561 | cpp |
p03161 | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define submitStage int TCF = 1;
#define testStage int TCF = 1000;
#define testMyStupedCode TCF--
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void ReadFromFile(string name, string extention) {
string fullPath = name + "." + extention;
freopen(fullPath.c_str(), "r", stdin);
}
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
inline char C() {
char c;
scanf("%c", &c);
return c;
}
inline ll power(ll x, ll p, ll m) {
ll res = 1;
while (p) {
if (p & 1)
res = (res * x) % m;
x = (x * x) % m;
p >>= 1;
}
return res;
}
long double ModLog(long double base, long double x) {
return (logl(x) / logl(base));
}
const int N = 1e6;
int n, k;
int dp[N];
int a[N];
int solve(int idx) {
if (idx == n - 1)
return 0;
int &ret = dp[idx];
if (~ret)
return ret;
ret = 1e9 + 5;
for (int i = 1; i <= k; ++i)
if (idx + i < n)
ret = min(ret, abs(a[idx] - a[idx + i]) + solve(idx + i));
return ret;
}
int main() {
memset(dp, -1, sizeof(dp));
n = D();
for (int i = 0; i < n; ++i)
a[i] = D();
printf("%d", solve(0));
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
#define ll long long
#define submitStage int TCF = 1;
#define testStage int TCF = 1000;
#define testMyStupedCode TCF--
void FastInputOutput() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void ReadFromFile(string name, string extention) {
string fullPath = name + "." + extention;
freopen(fullPath.c_str(), "r", stdin);
}
inline int D() {
int t;
scanf("%d", &t);
return t;
}
inline ll LLD() {
ll t;
scanf("%lld", &t);
return t;
}
inline char C() {
char c;
scanf("%c", &c);
return c;
}
inline ll power(ll x, ll p, ll m) {
ll res = 1;
while (p) {
if (p & 1)
res = (res * x) % m;
x = (x * x) % m;
p >>= 1;
}
return res;
}
long double ModLog(long double base, long double x) {
return (logl(x) / logl(base));
}
const int N = 1e6;
int n, k;
int dp[N];
int a[N];
int solve(int idx) {
if (idx == n - 1)
return 0;
int &ret = dp[idx];
if (~ret)
return ret;
ret = 1e9 + 5;
for (int i = 1; i <= k; ++i)
if (idx + i < n)
ret = min(ret, abs(a[idx] - a[idx + i]) + solve(idx + i));
return ret;
}
int main() {
memset(dp, -1, sizeof(dp));
n = D(), k = D();
for (int i = 0; i < n; ++i)
a[i] = D();
printf("%d", solve(0));
}
| [] | 962,421 | 962,422 | u841802158 | cpp |
p03161 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
LL dp[100001];
for (int i = 0; i < n; ++i) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + abs(h[i - 1] - h[i]);
for (int j = 2; j <= k; ++j) {
if (j <= i)
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] + h[i]));
}
}
cout << dp[n - 1] << endl;
} | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 31;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
LL dp[100001];
for (int i = 0; i < n; ++i) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; ++i) {
dp[i] = dp[i - 1] + abs(h[i - 1] - h[i]);
for (int j = 2; j <= k; ++j) {
if (j <= i)
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[n - 1] << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,425 | 962,426 | u999803454 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
ll mi = INT_MAX;
for (ll j = 1; j <= k; j++) {
if (i >= j)
mi = min(mi, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = mi;
}
cout << dp[n];
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n >> k;
ll a[n + 1];
for (ll i = 1; i <= n; i++)
cin >> a[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
ll mi = INT_MAX;
for (ll j = 1; j <= k; j++) {
if (i > j)
mi = min(mi, dp[i - j] + abs(a[i] - a[i - j]));
}
dp[i] = mi;
}
cout << dp[n];
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 962,427 | 962,428 | u962242502 | cpp |
p03161 | #include <iostream>
#define INF 1000000000
using namespace std;
int intAbs(int x) {
if (x < 0)
return x * -1;
return x;
}
int solve(int pos, int N, int DP[], int stones[], int K = 2) {
if (DP[pos] != INF)
return DP[pos];
int ret = INF;
if (pos > N)
return INF;
if (N == (pos + 1))
return 0;
for (int i = 1; i <= K; i++) {
if (i + pos < N) {
ret = min(ret, solve(pos + i, N, DP, stones) +
intAbs(stones[pos + i] - stones[pos]));
// cout<<pos<<","<<ret<<endl;
}
}
return DP[pos] = ret;
}
int main() {
int N, K;
cin >> N >> K;
int bestValue[N] = {};
int stones[N];
for (int i = 0; i < N; i++) {
cin >> stones[i];
bestValue[i] = INF;
}
cout << solve(0, N, bestValue, stones, K) << "\n";
return 0;
} | #include <iostream>
#define INF 1000000000
using namespace std;
int intAbs(int x) {
if (x < 0)
return x * -1;
return x;
}
int solve(int pos, int N, int DP[], int stones[], int K = 2) {
if (DP[pos] != INF)
return DP[pos];
int ret = INF;
if (pos > N)
return INF;
if (N == (pos + 1))
return 0;
for (int i = 1; i <= K; i++) {
if (i + pos < N) {
ret = min(ret, solve(pos + i, N, DP, stones, K) +
intAbs(stones[pos + i] - stones[pos]));
// cout<<pos<<","<<ret<<endl;
}
}
return DP[pos] = ret;
}
int main() {
int N, K;
cin >> N >> K;
int bestValue[N] = {};
int stones[N];
for (int i = 0; i < N; i++) {
cin >> stones[i];
bestValue[i] = INF;
}
cout << solve(0, N, bestValue, stones, K) << "\n";
return 0;
} | [
"call.arguments.add"
] | 962,429 | 962,430 | u981186088 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int dp[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int cnt = k;
dp[i] = 2e9;
for (int j = i - 1; j >= 0, cnt--; j--)
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
cout << dp[n - 1] << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int dp[100010];
int32_t main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int cnt = k;
dp[i] = 2e9;
for (int j = i - 1; j >= 0 && cnt--; j--)
dp[i] = min(dp[i], dp[j] + abs(a[j] - a[i]));
}
cout << dp[n - 1] << endl;
} | [
"control_flow.loop.for.condition.change"
] | 962,433 | 962,434 | u552706598 | 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[100010];
// DPテーブル
long long dp[100010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
//初期化（最小化問題なので、INFに初期化）
for (int i = 0; i < 100100; ++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 <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[100100];
// DPテーブル
long long dp[100100];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i)
cin >> h[i];
//初期化（最小化問題なので、INFに初期化）
for (int i = 0; i < 100100; ++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;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 962,435 | 962,436 | u794707792 | cpp |
p03161 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> h(n);
REP(i, n) cin >> h[i];
vector<ll> dp(n);
REP(i, n - 1) {
dp[i] = linf;
dp[0] = 0;
}
REP(i, n) {
FOR(j, 1, k + 1) {
if (i + j <= n - 1) {
dp[i + j] = min(dp[i] + abs(h[i + j] - h[i]), dp[i + j]);
} else
continue;
}
}
print(dp[n - 1]);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
typedef pair<int, int> P;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> h(n);
REP(i, n) cin >> h[i];
vector<ll> dp(n);
REP(i, n) {
dp[i] = linf;
dp[0] = 0;
}
REP(i, n) {
FOR(j, 1, k + 1) {
if (i + j <= n - 1) {
dp[i + j] = min(dp[i] + abs(h[i + j] - h[i]), dp[i + j]);
} else
continue;
}
}
print(dp[n - 1]);
return 0;
} | [
"expression.operation.binary.remove"
] | 962,437 | 962,438 | u601825761 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
long long dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 100000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(vis[i] - vis[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
long long dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 1000000000000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(vis[i] - vis[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"literal.number.change",
"assignment.value.change"
] | 962,439 | 962,440 | u684203905 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 100000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(vis[i] - vis[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int vis[n];
long long dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> vis[i];
}
for (int i = 1; i < n; i++) {
dp[i] = 1000000000000;
for (int j = 1; j <= k; j++) {
if (i - j < 0)
continue;
dp[i] = min(dp[i], dp[i - j] + abs(vis[i] - vis[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 962,441 | 962,440 | u684203905 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
int a[N], dp[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 2; i <= n; ++i) {
dp[i] = N;
for (int j = max(1LL, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
int a[N], dp[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 2; i <= n; ++i) {
dp[i] = MOD;
for (int j = max(1LL, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change"
] | 962,442 | 962,443 | u915276406 | cpp |
p03161 | #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
int a[N], dp[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 2; i <= n; ++i) {
dp[i] = N;
for (int j = max(1LL, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n];
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
int a[N], dp[N];
int32_t main() {
IOS;
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
for (int i = 2; i <= n; ++i) {
dp[i] = MOD;
for (int j = max(1LL, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n] << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"io.output.newline.add"
] | 962,444 | 962,443 | u915276406 | 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 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 1; k <= K; k++) {
chmin(dp[i + k], dp[i + k] + abs(h[i] - h[i + k]));
}
}
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 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 1; k <= K; k++) {
chmin(dp[i + k], dp[i] + abs(h[i] - h[i + k]));
}
}
cout << dp[N - 1] << endl;
}
| [
"expression.operation.binary.remove"
] | 962,445 | 962,446 | u627981695 | 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 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int k = 1; k <= K; k++) {
chmin(dp[i + k], dp[i + k] + abs(h[i] - h[i + k]));
}
}
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 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N, K;
long long h[100010];
// DPテーブル
long long dp[100010];
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 1; k <= K; k++) {
chmin(dp[i + k], dp[i] + abs(h[i] - h[i + k]));
}
}
cout << dp[N - 1] << endl;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.remove"
] | 962,447 | 962,446 | u627981695 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> answer(n, INT_MAX);
answer[0] = 0;
if (n > 1) {
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
if (j == 1)
answer[i] = abs(height[j] - height[i]) + answer[i - j];
else
answer[i] =
min(abs(height[i] - height[i - j]) + answer[i - j], answer[i]);
}
}
}
}
cout << answer[n - 1];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> answer(n, INT_MAX);
answer[0] = 0;
if (n > 1) {
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if ((i - j) >= 0) {
if (j == 1)
answer[i] = abs(height[i - j] - height[i]) + answer[i - j];
else
answer[i] =
min(abs(height[i] - height[i - j]) + answer[i - j], answer[i]);
}
}
}
}
cout << answer[n - 1];
return 0;
}
| [
"assignment.change"
] | 962,454 | 962,455 | u667099228 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[1000010], ar[1000100], n, k;
ll frog(ll i) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
ll &kk = dp[i];
ll l = 0, a = 0, f = 1;
kk = frog(i + 1) + abs(ar[i] - ar[i + 1]);
for (ll j = 2; j <= k; j++) {
if (j + i <= n) {
kk = min(kk, frog(i + j) + abs(ar[i] - ar[j]));
}
}
// cout<<i<<" "<<kk<<endl ;
return kk;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll kk = frog(1);
// for(ll i = 1 ; i <= n ; i++) cout<<dp[i]<<" " ;
// cout<<endl ;
cout << kk << endl;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[1000010], ar[1000100], n, k;
ll frog(ll i) {
if (i == n)
return 0LL;
if (dp[i] != -1)
return dp[i];
ll &kk = dp[i];
ll l = 0, a = 0, f = 1;
kk = frog(i + 1) + abs(ar[i] - ar[i + 1]);
for (ll j = 2; j <= k; j++) {
if (j + i <= n) {
kk = min(kk, frog(i + j) + abs(ar[i] - ar[i + j]));
}
}
// cout<<i<<" "<<kk<<endl ;
return kk;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (ll i = 1; i <= n; i++)
cin >> ar[i];
ll kk = frog(1);
// for(ll i = 1 ; i <= n ; i++) cout<<dp[i]<<" " ;
// cout<<endl ;
cout << kk << endl;
}
| [
"literal.number.type.widen.change"
] | 962,462 | 962,463 | u939340226 | cpp |
p03161 | #include <bits/stdc++.h>
#include <utility>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fore(i, init, n) for (int i = init; i <= n; i++)
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define fs first
#define sc second
#define INF (1LL << 61)
#define FIN \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int MAXN = 1e5 + 5;
int n, k, h[MAXN], dp[MAXN];
int main() {
cin >> n >> k;
fore(i, 1, n) cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = 1e5;
for (int i = 2; i <= n; i++) {
for (int j = k; j >= 1; j--) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
// for(int i = 1; i <= n; i++) cout << dp[i] << " ";
cout << dp[n];
}
/*
10 1
40 10 20 70 80 10 20 70 80 60
*/ | #include <bits/stdc++.h>
#include <utility>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fore(i, init, n) for (int i = init; i <= n; i++)
#define pb(a) push_back(a)
#define mk(a, b) make_pair(a, b)
#define fs first
#define sc second
#define INF (1LL << 61)
#define FIN \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int MAXN = 1e5 + 5;
int n, k, h[MAXN], dp[MAXN];
int main() {
cin >> n >> k;
fore(i, 1, n) cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++)
dp[i] = 1e9;
for (int i = 2; i <= n; i++) {
for (int j = k; j >= 1; j--) {
if (i - j >= 1) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n];
}
| [
"literal.number.change",
"assignment.value.change"
] | 962,466 | 962,467 | u244125528 | cpp |
p03161 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <iostream>
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
const int MAXN = 1e5 + 7;
template <typename T> inline T read() {
T res = 0, flag = 1;
char in = getchar();
while (!isdigit(in)) {
if (in == '-')
flag = -1;
in = getchar();
}
while (isdigit(in)) {
res = (res << 1) + (res << 3) + in - '0';
in = getchar();
}
return res * flag;
}
template <typename T> inline void chkmax(T &a, T b) {
if (a < b)
a = b;
}
template <typename T> inline void chkmin(T &a, T b) {
if (a > b)
a = b;
}
int dp[MAXN], h[MAXN], n, k;
inline void solve() {
n = read<int>();
k = read<int>();
for (int i = 1; i <= n; ++i)
h[i] = read<int>();
memset(dp, 0x3f, sizeof dp);
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; ++i)
for (int j = 1; j <= i && j <= k; ++j)
chkmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
printf("%d\n", dp[n]);
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <iostream>
#define mp make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
const int MAXN = 1e5 + 7;
template <typename T> inline T read() {
T res = 0, flag = 1;
char in = getchar();
while (!isdigit(in)) {
if (in == '-')
flag = -1;
in = getchar();
}
while (isdigit(in)) {
res = (res << 1) + (res << 3) + in - '0';
in = getchar();
}
return res * flag;
}
template <typename T> inline void chkmax(T &a, T b) {
if (a < b)
a = b;
}
template <typename T> inline void chkmin(T &a, T b) {
if (a > b)
a = b;
}
int dp[MAXN], h[MAXN], n, k;
inline void solve() {
n = read<int>();
k = read<int>();
for (int i = 1; i <= n; ++i)
h[i] = read<int>();
memset(dp, 0x3f, sizeof dp);
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; ++i)
for (int j = 1; j < i && j <= k; ++j)
chkmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
printf("%d\n", dp[n]);
}
int main() {
solve();
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 962,468 | 962,469 | u939372094 | cpp |
p03161 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!(ch >= '0' && ch <= '9')) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * f;
}
const int N = 100005;
int n, k, h[N], dp[N];
int main() {
n = read(), k = read();
;
rep(i, 1, n) h[i] = read();
dp[1] = 0;
rep(i, 2, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
rep(j, i - k, i - 2) dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
printf("%d\n", dp[n]);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (!(ch >= '0' && ch <= '9')) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * f;
}
const int N = 100005;
int n, k, h[N], dp[N];
int main() {
n = read(), k = read();
;
rep(i, 1, n) h[i] = read();
dp[1] = 0;
rep(i, 2, n) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
rep(j, max(1, i - k), i - 2) dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
printf("%d\n", dp[n]);
return 0;
}
| [
"call.add",
"call.arguments.change"
] | 962,470 | 962,471 | u021294378 | cpp |
p03161 | #include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
ll dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
ll m = 100000;
for (int k = 1; k <= K; k++) {
if (k <= i) {
ll tmp = dp[i - k] +
(h[i] - h[i - k] > 0 ? h[i] - h[i - k] : h[i - k] - h[i]);
if (tmp < m)
m = tmp;
}
}
dp[i] = m;
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <climits>
#include <iostream>
using namespace std;
typedef long long ll;
int main(int argc, const char *argv[]) {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
ll dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
ll m = LLONG_MAX;
for (int k = 1; k <= K; k++) {
if (k <= i) {
ll tmp = dp[i - k] +
(h[i] - h[i - k] > 0 ? h[i] - h[i - k] : h[i - k] - h[i]);
if (tmp < m)
m = tmp;
}
}
dp[i] = m;
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 962,472 | 962,473 | u248670554 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 10000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000000000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,485 | 962,484 | u763115743 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000000000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,486 | 962,484 | u763115743 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 10000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1 << 30);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,485 | 962,487 | u763115743 | cpp |
p03161 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1000);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N, 0), dp(N, 1 << 30);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int j = 1; j < N; j++) {
for (int k = 1; k <= K; k++) {
if (j - k < 0) {
continue;
}
dp[j] = min(dp[j], abs(h[j] - h[j - k]) + dp[j - k]);
}
}
cout << dp[N - 1] << endl;
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 962,486 | 962,487 | u763115743 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int j;
cin >> j;
vector<int> vec;
int dp[n + 20];
for (int i = 0; i < n; i++) {
int h;
cin >> h;
vec.push_back(h);
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int k = 1; k <= j; k++)
if (abs(vec[i] - vec[i + k]) + dp[i] < dp[i + k])
dp[i + k] = abs(vec[i] - vec[i + k]) + dp[i];
}
printf("%d\n", dp[n - 1]);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int j;
cin >> j;
vector<int> vec;
int dp[n + 300];
for (int i = 0; i < n; i++) {
int h;
cin >> h;
vec.push_back(h);
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int k = 1; k <= j; k++)
if (abs(vec[i] - vec[i + k]) + dp[i] < dp[i + k])
dp[i + k] = abs(vec[i] - vec[i + k]) + dp[i];
}
printf("%d\n", dp[n - 1]);
} | [
"literal.number.change",
"expression.operation.binary.change"
] | 962,490 | 962,491 | u713582551 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int> dp(n + 1, 1000000000);
dp[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = i - 1; j >= i - k; j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
cout << dp[n];
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int> dp(n + 1, 1000000000);
dp[1] = 0;
for (int i = 2; i <= n; i++)
for (int j = i - 1; j >= max(i - k, 1); j--)
dp[i] = min(dp[i], dp[j] + abs(v[i] - v[j]));
cout << dp[n];
return 0;
}
| [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 962,492 | 962,493 | u088237968 | cpp |
p03161 | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define rep(i, l, r) for (int i = l; i < r; i++)
#define SSTR(x) \
static_cast<std::ostringstream &>((std::ostringstream() << std::dec << x)) \
.str()
#define fastout \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
const int INF = (int)1e9 + 7;
const long long LLINF = (long long)1e18 + 7;
void kekek() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef EBUCHKA
freopen("in.txt", "r", stdin), freopen("out.txt", "w", stdout);
#endif
}
int main() {
kekek();
int n, k;
cin >> n >> k;
vector<int> h(n);
vector<int> dp(n);
if (n == 1) {
cout << 0;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = INF;
for (int j = 1; j <= min(i, k); j++)
dp[i] = min(dp[i], dp[i - k] + abs(h[i] - h[j]));
}
/*for (int i = 0; i < n; i++) {
cout << dp[i] << ' ';
}
cout << endl;*/
cout << dp[n - 1];
} | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define rep(i, l, r) for (int i = l; i < r; i++)
#define SSTR(x) \
static_cast<std::ostringstream &>((std::ostringstream() << std::dec << x)) \
.str()
#define fastout \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
const int INF = (int)1e9 + 7;
const long long LLINF = (long long)1e18 + 7;
void kekek() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef EBUCHKA
freopen("in.txt", "r", stdin), freopen("out.txt", "w", stdout);
#endif
}
int main() {
kekek();
int n, k;
cin >> n >> k;
vector<int> h(n);
vector<int> dp(n);
if (n == 1) {
cout << 0;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = INF;
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,494 | 962,495 | u258498090 | cpp |
p03161 | #include <iostream>
#include <stdlib.h>
using namespace std;
int n, k, i, j, h[10000], b[10000];
int tmp;
int main() {
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> h[i];
}
b[1] = h[1];
for (i = 2; i <= n; i++) {
tmp = 99999;
for (j = 1; j <= k; j++) {
if (i > j) {
tmp = min(b[i - j] + abs(h[i] - h[i - j]), tmp);
} else {
break;
}
}
b[i] = tmp;
}
cout << b[n] - b[1];
return 0;
}
| #include <iostream>
#include <stdlib.h>
using namespace std;
long n, k, i, j, h[100001], b[100001];
long tmp;
int main() {
// freopen("frog2.inp","r",stdin);
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> h[i];
}
b[1] = h[1];
for (i = 2; i <= n; i++) {
tmp = 999999999;
for (j = 1; j <= k; j++) {
if (i > j) {
tmp = min(b[i - j] + abs(h[i] - h[i - j]), tmp);
} else {
break;
}
}
b[i] = tmp;
}
cout << b[n] - b[1];
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change"
] | 962,506 | 962,505 | u997459040 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
if (i == (n - 1)) {
cout << dp[n - 1];
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
if (i == (n - 1)) {
cout << dp[n - 1];
}
}
return 0;
}
| [
"expression.operation.binary.remove"
] | 962,507 | 962,508 | u799165954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = k; i < n; i++) {
for (j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
if (i == (n - 1)) {
cout << dp[n - 1];
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
if (i == (n - 1)) {
cout << dp[n - 1];
}
}
return 0;
}
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 962,509 | 962,508 | u799165954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = min(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
if (i == (n - 1)) {
cout << dp[n - 1];
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int i, j, n, k;
cin >> n >> k;
int h[n];
long long dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
for (i = 0; i < n; i++) {
dp[i] = 1000000010;
}
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[j] - h[i]));
}
if (i == (n - 1)) {
cout << dp[n - 1];
}
}
return 0;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 962,510 | 962,508 | u799165954 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + (abs(h[i] - h[i - j])));
}
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + (abs(h[i] - h[i - j])));
}
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,519 | 962,520 | u573738515 | cpp |
p03161 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 0; j < k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - k] + (abs(h[i] - h[i - k])));
}
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int dp[MAX], h[MAX];
int n, k;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[i] = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + (abs(h[i] - h[i - j])));
}
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
cout << dp[n - 1];
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"... | 962,522 | 962,520 | u573738515 | cpp |
p03161 | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> N >> K;
for (int i = 0; i < N + 2; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < N; i++)
for (int q = 1; q <= K; q++)
dp[i + K] = min(dp[i + K], abs(a[i] - a[i + K]) + dp[i]);
cout << dp[N - 1] << endl;
} | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> N >> K;
for (int i = 0; i < N + 2; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < N; i++)
for (int q = 1; q <= K; q++)
dp[i + q] = min(dp[i + q], abs(a[i] - a[i + q]) + dp[i]);
cout << dp[N - 1] << endl;
} | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change",
"call.arguments.change"
] | 962,525 | 962,526 | u895243133 | cpp |
p03161 | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> N >> K;
for (int i = 0; i < N + 2; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < N; i++)
for (int q = 0; q < K; q++)
dp[i + K] = min(dp[i + K], abs(a[i] - a[i + K]) + dp[i]);
cout << dp[N - 1] << endl;
} | /*
ID: mckibbe1
TASK: money
LANG: C++11
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
int dp[100111], a[100111];
int main() {
// freopen("file.in", "r", stdin);
// freopen("file.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie();
int N, K;
cin >> N >> K;
for (int i = 0; i < N + 2; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < N; i++)
for (int q = 1; q <= K; q++)
dp[i + q] = min(dp[i + q], abs(a[i] - a[i + q]) + dp[i]);
cout << dp[N - 1] << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"identifier.change",
... | 962,527 | 962,526 | u895243133 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
int x = n;
while (n--)
cin >> arr[n - x - 1][0] >> arr[n - x - 1][1] >> arr[n - x - 1][2];
int dp[n][3];
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
int a, b, c;
a = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
b = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2]);
c = arr[i][2] + max(dp[i - 1][0], dp[i - 1][1]);
dp[i][0] = a;
dp[i][1] = b;
dp[i][2] = c;
}
cout << max(dp[n - 1][2], max(dp[n - 1][0], dp[n - 1][1]));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n][3];
int x = n;
while (x--)
cin >> arr[n - x - 1][0] >> arr[n - x - 1][1] >> arr[n - x - 1][2];
int dp[n][3];
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
int a, b, c;
a = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
b = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2]);
c = arr[i][2] + max(dp[i - 1][0], dp[i - 1][1]);
dp[i][0] = a;
dp[i][1] = b;
dp[i][2] = c;
}
cout << max(dp[n - 1][2], max(dp[n - 1][0], dp[n - 1][1]));
} | [
"identifier.change",
"control_flow.loop.condition.change"
] | 962,532 | 962,533 | u936953256 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define kk
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define ff first
#define ss second
#define ll int
#define inf 1000000000
typedef pair<int, int> pi;
int dp[100001][3];
void solve() {
int n;
cin >> n;
int a, b, c;
cin >> a >> b >> c;
dp[1][0] = a, dp[1][1] = b, dp[1][2] = c;
for (int i = 2; i <= n; i++) {
cin >> a >> b >> c;
dp[i][0] = a + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max({dp[n][0], dp[n][1], dp[n][2]}) << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef kk
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int T = 1;
// cin>>T;
while (T--) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
//#define kk
#define FOR(i, n) for (int i = 1; i <= n; i++)
#define ff first
#define ss second
#define ll int
#define inf 1000000000
typedef pair<int, int> pi;
int dp[100001][3];
void solve() {
int n;
cin >> n;
int a, b, c;
cin >> a >> b >> c;
dp[1][0] = a, dp[1][1] = b, dp[1][2] = c;
for (int i = 2; i <= n; i++) {
cin >> a >> b >> c;
dp[i][0] = a + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max({dp[n][0], dp[n][1], dp[n][2]}) << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifdef kk
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int T = 1;
// cin>>T;
while (T--) {
solve();
}
}
| [] | 962,537 | 962,538 | u842610029 | cpp |
p03162 | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*
1) long long vs int overflow
2) read question carefully
*/
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define umapii unordered_map<int, int>
#define umapll unordered_map<ll, ll>
#define mapll map<ll, ll>
#define mapii map<int, int>
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vs vector<string>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define vvi vector<vi>
#define vvll vector<vll>
#define all(v) (v).begin(), (v).end()
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define debug(x) cerr << #x << " : " << x << endl;
#define debuga(A, N) \
cerr << #A << " : ["; \
for (int i = 0; i < N; i++) \
cerr << A[i] << " "; \
cerr << "]\n";
#define debuga2(A, N, M) \
cerr << #A << " : \n"; \
for (int i = 0; i < N; i++) { \
cerr << "["; \
for (int j = 0; j < M; ++j) \
cerr << A[i][j] << " "; \
cerr << "]\n"; \
}
#define debugp(p) \
cerr << #p << " : " \
<< "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v) \
cerr << #v << " : " \
<< "["; \
for (int i = 0; i < (v).size(); i++) \
cerr << v[i] << " "; \
cerr << "]\n";
#define debugv2(v) \
cerr << #v << " : \n"; \
for (int i = 0; i < v.size(); i++) { \
cerr << "["; \
for (int j = 0; j < (v[0].size()); ++j) \
cerr << v[i][j] << " "; \
cerr << "]\n"; \
}
#define debugs(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << *itr << " "; \
cerr << "]\n";
#define debugm(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << "(" << itr->first << "," << itr->second << ") "; \
cerr << "]\n";
const ll mod = 1000000007;
/*STL:
(1) PRIORITY_QUEUE pq:
-> priority_queue < int > pq; // max_heap
-> priority_queue < int , vector < int > , greater < int > > pq; //
min_heap
-> pq.top() --> returns the maximum or minimum element
-> pq.push() --> push element into the queue
-> pq.pop() --> remove top most element
-> pq.empty() --> checks whether queue is empty or not
*/
ll modexp(ll x, ll ex) {
ll ans = 1ll;
while (ex > 0) {
if (ex & 1ll)
ans = (ans * x) % mod;
ex >>= 1ll;
x = (x * x) % mod;
}
return ans;
}
const int inf = 1e9 + 7;
const int N = 1e5 + 7;
int dp[N][3];
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1), c(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[1][0] = a[1];
dp[1][1] = b[1];
dp[1][2] = c[1];
for (int i = 1; i <= n; i++) {
if (i + 1 > n)
break;
dp[i + 1][0] = min(dp[i][1], dp[i][2]) + a[i + 1];
dp[i + 1][1] = min(dp[i][0], dp[i][2]) + b[i + 1];
dp[i + 1][2] = min(dp[i][0], dp[i][1]) + c[i + 1];
}
cout << min({dp[n][0], dp[n][1], dp[n][2]}) << '\n';
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*
1) long long vs int overflow
2) read question carefully
*/
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define umapii unordered_map<int, int>
#define umapll unordered_map<ll, ll>
#define mapll map<ll, ll>
#define mapii map<int, int>
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vs vector<string>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define vvi vector<vi>
#define vvll vector<vll>
#define all(v) (v).begin(), (v).end()
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define debug(x) cerr << #x << " : " << x << endl;
#define debuga(A, N) \
cerr << #A << " : ["; \
for (int i = 0; i < N; i++) \
cerr << A[i] << " "; \
cerr << "]\n";
#define debuga2(A, N, M) \
cerr << #A << " : \n"; \
for (int i = 0; i < N; i++) { \
cerr << "["; \
for (int j = 0; j < M; ++j) \
cerr << A[i][j] << " "; \
cerr << "]\n"; \
}
#define debugp(p) \
cerr << #p << " : " \
<< "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v) \
cerr << #v << " : " \
<< "["; \
for (int i = 0; i < (v).size(); i++) \
cerr << v[i] << " "; \
cerr << "]\n";
#define debugv2(v) \
cerr << #v << " : \n"; \
for (int i = 0; i < v.size(); i++) { \
cerr << "["; \
for (int j = 0; j < (v[0].size()); ++j) \
cerr << v[i][j] << " "; \
cerr << "]\n"; \
}
#define debugs(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << *itr << " "; \
cerr << "]\n";
#define debugm(m) \
cerr << #m << " : [ "; \
for (auto itr = m.begin(); itr != m.end(); itr++) \
cerr << "(" << itr->first << "," << itr->second << ") "; \
cerr << "]\n";
const ll mod = 1000000007;
/*STL:
(1) PRIORITY_QUEUE pq:
-> priority_queue < int > pq; // max_heap
-> priority_queue < int , vector < int > , greater < int > > pq; //
max_heap
-> pq.top() --> returns the maximum or maximum element
-> pq.push() --> push element into the queue
-> pq.pop() --> remove top most element
-> pq.empty() --> checks whether queue is empty or not
*/
ll modexp(ll x, ll ex) {
ll ans = 1ll;
while (ex > 0) {
if (ex & 1ll)
ans = (ans * x) % mod;
ex >>= 1ll;
x = (x * x) % mod;
}
return ans;
}
const int inf = 1e9 + 7;
const int N = 1e5 + 7;
int dp[N][3];
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> a(n + 1), b(n + 1), c(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[1][0] = a[1];
dp[1][1] = b[1];
dp[1][2] = c[1];
for (int i = 1; i <= n; i++) {
if (i + 1 > n)
break;
dp[i + 1][0] = max(dp[i][1], dp[i][2]) + a[i + 1];
dp[i + 1][1] = max(dp[i][0], dp[i][2]) + b[i + 1];
dp[i + 1][2] = max(dp[i][0], dp[i][1]) + c[i + 1];
}
cout << max({dp[n][0], dp[n][1], dp[n][2]}) << '\n';
} | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 962,541 | 962,542 | u448290027 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0), bs(n, 0), cs(n, 0);
for (int i = 0; i < n; i++) {
cin >> as[i];
cin >> bs[i];
cin >> cs[i];
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = as[0];
dp[0][1] = bs[0];
dp[0][2] = cs[0];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1] + bs[i], dp[i - 1][2] + cs[i]);
dp[i][1] = max(dp[i - 1][2] + cs[i], dp[i - 1][0] + as[i]);
dp[i][2] = max(dp[i - 1][0] + as[i], dp[i - 1][1] + bs[i]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2])) << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0), bs(n, 0), cs(n, 0);
for (int i = 0; i < n; i++) {
cin >> as[i];
cin >> bs[i];
cin >> cs[i];
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = as[0];
dp[0][1] = bs[0];
dp[0][2] = cs[0];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1] + as[i], dp[i - 1][2] + as[i]);
dp[i][1] = max(dp[i - 1][2] + bs[i], dp[i - 1][0] + bs[i]);
dp[i][2] = max(dp[i - 1][0] + cs[i], dp[i - 1][1] + cs[i]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2])) << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,551 | 962,552 | u067151927 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll n;
ll func(ll a[][4]) {
ll h[n + 1][4];
h[1][1] = a[1][1];
h[1][2] = a[1][2];
h[1][3] = a[1][3];
for (ll i = 2; i <= n; i++) {
h[i][1] = a[i][1] + max(h[i - 1][2], h[i - 1][3]);
h[i][2] = a[i][2] + max(h[i - 1][3], h[i - 1][1]);
h[i][3] = a[i][3] + max(h[i - 1][3], h[i - 1][2]);
}
cout << max(h[n][1], max(h[n][2], h[n][3]));
}
int32_t main() {
IOS;
cin >> n;
ll a[n + 1][4];
for (ll i = 1; i <= n; i++) {
cin >> a[i][1] >> a[i][2] >> a[i][3];
}
func(a);
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll n;
void func(ll a[][4]) {
ll h[n + 1][4];
h[1][1] = a[1][1];
h[1][2] = a[1][2];
h[1][3] = a[1][3];
for (ll i = 2; i <= n; i++) {
h[i][1] = a[i][1] + max(h[i - 1][2], h[i - 1][3]);
h[i][2] = a[i][2] + max(h[i - 1][3], h[i - 1][1]);
h[i][3] = a[i][3] + max(h[i - 1][1], h[i - 1][2]);
}
cout << max(h[n][1], max(h[n][2], h[n][3]));
}
int32_t main() {
IOS;
cin >> n;
ll a[n + 1][4];
for (ll i = 1; i <= n; i++) {
cin >> a[i][1] >> a[i][2] >> a[i][3];
}
func(a);
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,559 | 962,558 | u767554325 | cpp |
p03162 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
int p, q, r; // p is max happiness acheived if i do a today
int t1, t2, t3;
cin >> t1 >> t2 >> t3;
p = max(b, c) + t1;
q = max(a, c) + t2;
r = max(a, b) + t3;
a = p;
b = q;
c = r;
}
cout << max(a, (b, c));
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
int n;
cin >> n;
int a = 0, b = 0, c = 0;
for (int i = 0; i < n; i++) {
int p, q, r; // p is max happiness acheived if i do a today
int t1, t2, t3;
cin >> t1 >> t2 >> t3;
p = max(b, c) + t1;
q = max(a, c) + t2;
r = max(a, b) + t3;
a = p;
b = q;
c = r;
}
cout << max(a, max(b, c));
}
| [
"call.add",
"call.arguments.change"
] | 962,581 | 962,582 | u468529789 | cpp |
p03162 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long 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;
}
int main() {
int n;
cin >> n;
vector<vector<int>> data(n, vector<int>(3));
REP(i, n) {
REP(j, 3) { cin >> data[i][j]; }
}
vector<vector<ll>> dp(100010, vector<ll>(3));
REP(i, n) {
REP(j, 3) {
REP(k, 3) {
if (j != k)
chmax(dp[i + 1][k], dp[i][j] + data[i][k]);
}
}
}
ll ans = 0;
REP(i, n) ans = max(ans, dp[n][i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long 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;
}
int main() {
int n;
cin >> n;
vector<vector<int>> data(n, vector<int>(3));
REP(i, n) {
REP(j, 3) { cin >> data[i][j]; }
}
vector<vector<ll>> dp(100010, vector<ll>(3));
REP(i, n) {
REP(j, 3) {
REP(k, 3) {
if (j != k)
chmax(dp[i + 1][k], dp[i][j] + data[i][k]);
}
}
}
ll ans = 0;
REP(i, 3) ans = max(ans, dp[n][i]);
cout << ans << endl;
} | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 962,583 | 962,584 | u242717212 | cpp |
p03162 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vl vector<long long>;
//#define rep(i,a,b) for(int i=a;i<b;++i)
// typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e5 + 5;
int A[N];
int B[N];
int C[N];
#define INF 10000
ll dp[N][4];
// int dp[N][N][N]={0};
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
/*void show(vi v,int valeur){
int count=0;
rep(i,0,(int)v.size()){
++count;
cout<<v[i]<<" " ;
if(count==valeur){cout<<"\n";count=0;}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n;
rep(i, 0, n) { cin >> A[i] >> B[i] >> C[i]; }
if (n == 1) {
cout << max(A[0], max(B[0], C[0]));
return 0;
}
dp[n - 1][1] = A[n - 1];
dp[n - 2][2] = B[n - 1];
dp[n - 1][3] = C[n - 1];
for (int j = (n - 2); j >= 0; --j) {
dp[j][1] = max(dp[j + 1][2], dp[j + 1][3]) + A[j];
dp[j][2] = max(dp[j + 1][1], dp[j + 1][3]) + B[j];
dp[j][3] = max(dp[j + 1][2], dp[j + 1][1]) + C[j];
}
cout << max(dp[0][1], max(dp[0][2], dp[0][3]));
return 0;
}
| //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vl vector<long long>;
//#define rep(i,a,b) for(int i=a;i<b;++i)
// typedef vector<ii> vii;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e5 + 5;
int A[N];
int B[N];
int C[N];
#define INF 10000
ll dp[N][4];
// int dp[N][N][N]={0};
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
/*void show(vi v,int valeur){
int count=0;
rep(i,0,(int)v.size()){
++count;
cout<<v[i]<<" " ;
if(count==valeur){cout<<"\n";count=0;}
}
}*/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n;
rep(i, 0, n) { cin >> A[i] >> B[i] >> C[i]; }
if (n == 1) {
cout << max(A[0], max(B[0], C[0]));
return 0;
}
dp[n - 1][1] = A[n - 1];
dp[n - 1][2] = B[n - 1];
dp[n - 1][3] = C[n - 1];
for (int j = (n - 2); j >= 0; --j) {
dp[j][1] = max(dp[j + 1][2], dp[j + 1][3]) + A[j];
dp[j][2] = max(dp[j + 1][1], dp[j + 1][3]) + B[j];
dp[j][3] = max(dp[j + 1][2], dp[j + 1][1]) + C[j];
}
cout << max(dp[0][1], max(dp[0][2], dp[0][3]));
return 0;
}
| [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 962,589 | 962,590 | u751311751 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[100009][3], dp[100009][3];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (ll i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (ll i = 1; i < n; i++)
for (ll j = 0; j < n; j++) {
ll &r = dp[i][j];
if (j != 0)
r = max(r, dp[i - 1][0]);
if (j != 1)
r = max(r, dp[i - 1][1]);
if (j != 2)
r = max(r, dp[i - 1][2]);
r += a[i][j];
}
n--;
cout << max(dp[n][0], max(dp[n][1], dp[n][2]));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[100009][3], dp[100009][3];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
for (ll i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (ll i = 1; i < n; i++)
for (ll j = 0; j < 3; j++) {
ll &r = dp[i][j];
if (j != 0)
r = max(r, dp[i - 1][0]);
if (j != 1)
r = max(r, dp[i - 1][1]);
if (j != 2)
r = max(r, dp[i - 1][2]);
r += a[i][j];
}
n--;
cout << max(dp[n][0], max(dp[n][1], dp[n][2]));
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,591 | 962,592 | u731311090 | cpp |
p03162 | // if Ans is to like maximize or minimize after a particular day without having
// to take any consecutive same element O(N * choices^2)
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define input freopen("1.txt", "r", stdin);
#define output freopen("output.txt", "w", stdout);
#define ll long long int
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define vi vector<int>
#define vii vector<vi>
#define vl vector<ll>
#define vll vector<vl>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define vpi vector<pii>
#define vpl vector<pll>
using namespace std;
const int p = 1e9 + 7;
const int maxn = 1e5 + 2;
int DP[maxn][3];
int cost[maxn][3];
void solve(int cur, int N) {
if (cur == N) {
cout << max({DP[N][0], DP[N][1], DP[N][2]}) << "\n";
return;
}
DP[++cur][0] =
max(DP[cur - 1][1] + cost[cur][0], DP[cur - 1][2] + cost[cur][0]);
DP[cur][1] =
max(DP[cur - 1][0] + cost[cur][1], DP[cur - 1][2] + cost[cur][1]);
DP[cur][2] =
max(DP[cur - 1][0] + cost[cur][2], DP[cur - 1][1] + cost[cur][2]);
solve(cur, N);
}
int main() {
fast
// input output
int t = 1;
// cin>>t;
int N;
cin >> N;
DP[0][0] = DP[0][1] = DP[0][2] = 0;
for (int i = 1; i <= N; i++) {
DP[i][0] = DP[i][1] = DP[i][2] = 0;
cin >> cost[i][0] >> cost[i][1] >> cost[i][2];
}
while (t--)
solve(0, N);
return 0;
} | // if Ans is to like maximize or minimize after a particular day without having
// to take any consecutive same element O(N * choices^2)
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define input freopen("1.txt", "r", stdin);
#define output freopen("output.txt", "w", stdout);
#define ll long long int
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define vi vector<int>
#define vii vector<vi>
#define vl vector<ll>
#define vll vector<vl>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define vpi vector<pii>
#define vpl vector<pll>
using namespace std;
const int p = 1e9 + 7;
const int maxn = 1e5 + 2;
int DP[maxn][3];
int cost[maxn][3];
void solve(int cur, int N) {
if (cur == N) {
cout << max({DP[N][0], DP[N][1], DP[N][2]}) << "\n";
return;
}
++cur;
DP[cur][0] =
max(DP[cur - 1][1] + cost[cur][0], DP[cur - 1][2] + cost[cur][0]);
DP[cur][1] =
max(DP[cur - 1][0] + cost[cur][1], DP[cur - 1][2] + cost[cur][1]);
DP[cur][2] =
max(DP[cur - 1][0] + cost[cur][2], DP[cur - 1][1] + cost[cur][2]);
solve(cur, N);
}
int main() {
fast
// input output
int t = 1;
// cin>>t;
int N;
cin >> N;
DP[0][0] = DP[0][1] = DP[0][2] = 0;
for (int i = 1; i <= N; i++) {
DP[i][0] = DP[i][1] = DP[i][2] = 0;
cin >> cost[i][0] >> cost[i][1] >> cost[i][2];
}
while (t--)
solve(0, N);
// for(int i = 0; i <= N; i++) cout << DP[i][0] << " " << DP[i][1] << " " <<
// DP[i][2] <<"\n";
return 0;
} | [
"expression.unary.arithmetic.add"
] | 962,599 | 962,600 | u954133007 | cpp |
p03162 | // https://atcoder.jp/contests/dp/tasks/dp_c
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i > b; i--)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
using namespace std;
const int mod = 1000000007;
const int maxn = 200000;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
f(i, 0, n) cin >> a[i] >> b[i] >> c[i];
vector<vector<ll>> dp(n, vector<ll>(3));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][1] = c[0];
f(i, 1, n) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2])) << endl;
} | // https://atcoder.jp/contests/dp/tasks/dp_c
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i > b; i--)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
using namespace std;
const int mod = 1000000007;
const int maxn = 200000;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
f(i, 0, n) cin >> a[i] >> b[i] >> c[i];
vector<vector<ll>> dp(n, vector<ll>(3, 0));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
f(i, 1, n) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2])) << endl;
} | [
"call.arguments.add",
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,601 | 962,602 | u434035301 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(3));
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
dp[0][0] = a[0];
dp[0][1] = a[1];
dp[0][2] = a[2];
for (int i = 0; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
for (int j = 0; j < 3; j++) {
dp[i][j] = max(dp[i - 1][(j + 1) % 3], dp[i - 1][(j + 2) % 3]) + a[j];
}
}
int ans = max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> dp(n, vector<int>(3, 0));
vector<int> a(3);
cin >> a[0] >> a[1] >> a[2];
dp[0][0] = a[0];
dp[0][1] = a[1];
dp[0][2] = a[2];
for (int i = 1; i < n; i++) {
cin >> a[0] >> a[1] >> a[2];
for (int j = 0; j < 3; j++) {
dp[i][j] = max(dp[i - 1][(j + 1) % 3], dp[i - 1][(j + 2) % 3]) + a[j];
}
}
int ans = max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
cout << ans << endl;
}
| [
"call.arguments.add",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 962,605 | 962,606 | u204158532 | cpp |
p03162 | #include <stdio.h>
long long int arr[100005][3];
long long int dp[1000005][3];
long long int n;
long long int max(long long int a, long long int b) {
if (a >= b)
return a;
else {
return b;
}
}
long long int happy(long long int n) {
for (long long int i = n - 1; i >= 0; i--) {
for (long long int j = 0; j < 3; j++) {
if (i == n - 1)
dp[i][j] = arr[i][j];
else {
if (j == 0) {
dp[i][j] = arr[i][j] + max(dp[i + 1][1], dp[i + 1][2]);
}
if (j == 1) {
dp[i][j] = arr[i][j] + max(dp[i + 1][0], dp[i + 1][2]);
}
if (j == 2) {
dp[i][j] = arr[i][j] + max(dp[i + 1][1], dp[i + 1][0]);
}
}
}
}
}
int main() {
long long int n;
scanf("%lld", &n);
for (long long int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
scanf("%lld", &arr[i][j]);
}
}
happy(n);
long long int ans;
if ((dp[0][0] >= dp[0][1]) && (dp[0][0] >= dp[0][1]))
ans = dp[0][0];
else if ((dp[0][1] >= dp[0][0]) && (dp[0][1] >= dp[0][2]))
ans = dp[0][1];
else {
ans = dp[0][2];
}
printf("%lld", ans);
} | #include <stdio.h>
long long int arr[100005][3];
long long int dp[1000005][3];
long long int n;
long long int max(long long int a, long long int b) {
if (a >= b)
return a;
else {
return b;
}
}
long long int happy(long long int n) {
for (long long int i = n - 1; i >= 0; i--) {
for (long long int j = 0; j < 3; j++) {
if (i == n - 1)
dp[i][j] = arr[i][j];
else {
if (j == 0) {
dp[i][j] = arr[i][j] + max(dp[i + 1][1], dp[i + 1][2]);
}
if (j == 1) {
dp[i][j] = arr[i][j] + max(dp[i + 1][0], dp[i + 1][2]);
}
if (j == 2) {
dp[i][j] = arr[i][j] + max(dp[i + 1][1], dp[i + 1][0]);
}
}
}
}
}
int main() {
long long int n;
scanf("%lld", &n);
for (long long int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
scanf("%lld", &arr[i][j]);
}
}
happy(n);
long long int ans;
if ((dp[0][0] >= dp[0][1]) && (dp[0][0] >= dp[0][2]))
ans = dp[0][0];
else if ((dp[0][1] >= dp[0][0]) && (dp[0][1] >= dp[0][2]))
ans = dp[0][1];
else {
ans = dp[0][2];
}
printf("%lld", ans);
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 962,609 | 962,610 | u320525899 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
ll dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][0] = b[i] + max(dp[i - 1][2], dp[i - 1][0]);
dp[i][0] = c[i] + max(dp[i - 1][1], dp[i - 1][0]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
ll dp[n][3];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][2], dp[i - 1][0]);
dp[i][2] = c[i] + max(dp[i - 1][1], dp[i - 1][0]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,615 | 962,616 | u659210268 | cpp |
p03162 | #include "bits/stdc++.h"
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
int32_t main() {
Fast_IO int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(3));
for (auto &it : arr) {
for (auto &i : it)
cin >> i;
}
vector<vector<int>> dp(n + 1, vector<int>(3));
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (i != j) {
dp[i][k] = max(dp[i][k], dp[i - 1][j] + arr[i - 1][k]);
}
}
}
}
cout << max({dp[n][0], dp[n][1], dp[n][2]});
} | #include "bits/stdc++.h"
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long
int32_t main() {
Fast_IO int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(3));
for (auto &it : arr) {
for (auto &i : it)
cin >> i;
}
vector<vector<int>> dp(n + 1, vector<int>(3));
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i][j] = max(dp[i][j], dp[i - 1][k] + arr[i - 1][j]);
}
}
}
}
cout << max({dp[n][0], dp[n][1], dp[n][2]});
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,617 | 962,618 | u961487195 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int32_t main() {
Fast_IO
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int in[3];
int ou[3];
vector<int> dp(3, 0);
for (int ii = 0; ii < n; ii++) {
vector<int> dpo(3, 0);
for (int j = 0; j < 3; j++) {
cin >> in[j];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i != j) {
dpo[j] = max(dpo[j], dp[i] + in[j]);
}
}
}
dp = dpo;
}
cout << max({dp[0], dp[1], dp[2]});
} | #include <bits/stdc++.h>
using namespace std;
#define Fast_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int32_t main() {
Fast_IO
#ifdef __WIN32
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int in[3];
int ou[3];
vector<int> dp(3, 0);
for (int ii = 0; ii < n; ii++) {
vector<int> dpo(3, 0);
for (int j = 0; j < 3; j++) {
cin >> in[j];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i != j) {
dpo[j] = max(dpo[j], dp[i] + in[j]);
}
}
}
dp = dpo;
}
cout << max({dp[0], dp[1], dp[2]});
} | [] | 962,619 | 962,620 | u961487195 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][0] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][0] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
}
| [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,621 | 962,622 | u108976315 | cpp |
p03162 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 0; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][0] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][0] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a, b, c;
for (int i = 0; i < n; i++) {
int temp1, temp2, temp3;
cin >> temp1 >> temp2 >> temp3;
a.push_back(temp1);
b.push_back(temp2);
c.push_back(temp3);
}
vector<vector<int>> dp(n, vector<int>(3, 0));
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,623 | 962,622 | u108976315 | cpp |
p03162 | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define inf 100000000000000
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define _it iterator
#define all(_x) _x.begin(), _x.end()
#define f first
#define s second
#define pb push_back
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
#define ar array
const ll maxN = 1e5 + 5, N = 1e3 + 5;
ar<ll, 3> a[maxN], dp[maxN];
ll n;
void solve() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
dp[0][0] = a[0][0], dp[0][1] = a[0][1], dp[0][2] = a[0][2];
for (ll i = 1; i < n; i++) {
dp[i][0] = a[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = a[i][1] + max(dp[i - 1][2], dp[i - 1][0]);
dp[i][2] = a[i][2] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max({dp[n - 1][0], dp[n - 1][1], dp[n - 2][0]});
}
int main() {
// mahakal(),fast;
ll t = 1;
// cin>> t ;
while (t--)
solve();
return 0;
} | /* ꧁༒☬महाकाल☬༒꧂ ꧁༒ঔमहाकालঔ༒꧂
ঔৣमहाकालᴳᵒᵈঔৣ
*/
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T, typename cmp=less<T>> using oset =tree<T, null_type,
// cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define mod 1000000007
#define inf 100000000000000
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define _it iterator
#define all(_x) _x.begin(), _x.end()
#define f first
#define s second
#define pb push_back
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
}
#define ar array
const ll maxN = 1e5 + 5, N = 1e3 + 5;
ar<ll, 3> a[maxN], dp[maxN];
ll n;
void solve() {
cin >> n;
for (ll i = 0; i < n; i++)
cin >> a[i][0] >> a[i][1] >> a[i][2];
dp[0][0] = a[0][0], dp[0][1] = a[0][1], dp[0][2] = a[0][2];
for (ll i = 1; i < n; i++) {
dp[i][0] = a[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = a[i][1] + max(dp[i - 1][2], dp[i - 1][0]);
dp[i][2] = a[i][2] + max(dp[i - 1][0], dp[i - 1][1]);
}
// for(ll i=0;i<n ;i++){
// cerr<<dp[i][0]<<" "<<dp[i][1]<<" "<<dp[i][2]<<endl;
// }
cout << max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]});
}
int main() {
// mahakal(),fast;
ll t = 1;
// cin>> t ;
while (t--)
solve();
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 962,630 | 962,631 | u364129544 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> dp(n);
for (int days = 0; days < n; ++days) {
vector<int> c(3);
vector<int> new_dp(n, 0);
for (int i = 0; i < 3; ++i) {
cin >> c[i];
}
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
if (j != i)
new_dp[j] = max(new_dp[j], dp[i] + c[j]);
}
}
dp = new_dp;
}
cout << max({dp[0], dp[1], dp[2]}) << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> dp(3);
for (int days = 0; days < n; ++days) {
vector<int> c(3);
vector<int> new_dp(3, 0);
for (int i = 0; i < 3; ++i) {
cin >> c[i];
}
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
if (j != i)
new_dp[j] = max(new_dp[j], dp[i] + c[j]);
}
}
dp = new_dp;
}
cout << max({dp[0], dp[1], dp[2]}) << '\n';
}
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 962,632 | 962,633 | u470383136 | cpp |
p03162 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int vac[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> vac[i][j];
}
}
int dp[n][3];
dp[0][0] = vac[0][0];
dp[0][1] = vac[0][1];
dp[0][2] = vac[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1] + vac[i][0], dp[i - 1][2] + vac[i][0]);
dp[i][1] = max(dp[i - 1][0] + vac[i][1], dp[i - 1][2] + vac[i][1]);
dp[i][2] = max(dp[i - 1][0] + vac[i][2], dp[i - 1][0] + vac[i][2]);
}
int k = max(dp[n - 1][0], dp[n - 1][1]);
cout << max(k, dp[n - 1][2]);
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int vac[n][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> vac[i][j];
}
}
int dp[n][3];
dp[0][0] = vac[0][0];
dp[0][1] = vac[0][1];
dp[0][2] = vac[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1] + vac[i][0], dp[i - 1][2] + vac[i][0]);
dp[i][1] = max(dp[i - 1][0] + vac[i][1], dp[i - 1][2] + vac[i][1]);
dp[i][2] = max(dp[i - 1][0] + vac[i][2], dp[i - 1][1] + vac[i][2]);
}
int k = max(dp[n - 1][0], dp[n - 1][1]);
cout << max(k, dp[n - 1][2]);
return 0;
}
| [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,639 | 962,640 | u666207305 | cpp |
p03162 | // Created by Krishna Ashok
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout << #x << "=" << x << '\n'
#define ll long long
#define pr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#define fin \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define MOD 1000000007
const int INF = 1e9;
void solve() {
int n, a[3];
cin >> n;
ll dp[n + 1][3];
memset(dp, 0LL, sizeof(dp));
for (int i = 1; i <= n; i++) {
cin >> a[0] >> a[1] >> a[2];
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
dp[i][j] = max(dp[i][j], dp[i - 1][j] + a[k]);
}
}
}
// for(int i=1;i<=n;i++){
// for(int x:dp[i]) cout<<x<<" ";
// cout<<"\n";
// }
cout << max(dp[n][0], max(dp[n][1], dp[n][2])) << "\n";
}
int main() {
fin;
solve();
// cout<<solve()<<"\n";
return 0;
} | // Created by Krishna Ashok
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cout << #x << "=" << x << '\n'
#define ll long long
#define pr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#define fin \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define MOD 1000000007
const int INF = 1e9;
void solve() {
int n, a[3];
cin >> n;
ll dp[n + 1][3];
memset(dp, 0LL, sizeof(dp));
// cin>>dp[0][0]>>dp[0][1]>>dp[0][2];
for (int i = 1; i <= n; i++) {
cin >> a[0] >> a[1] >> a[2];
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[j]);
}
}
}
// for(int i=0;i<=n;i++){
// for(int x:dp[i]) cout<<x<<" ";
// cout<<"\n";
// }
cout << max(dp[n][0], max(dp[n][1], dp[n][2])) << "\n";
}
int main() {
fin;
solve();
// cout<<solve()<<"\n";
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,641 | 962,642 | u701311264 | cpp |
p03162 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<vector<long long int>> v(n);
vector<long long int> at(n);
vector<long long int> bt(n);
vector<long long int> ct(n);
for (long long int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
v[i].push_back(a);
v[i].push_back(b);
v[i].push_back(c);
}
at[0] = v[0][0];
bt[0] = v[0][1];
ct[0] = v[0][2];
for (long long int i = 1; i < n; i++) {
at[i] = max(bt[i - 1] + v[i][1], ct[i - 1] + v[i][2]);
bt[i] = max(at[i - 1] + v[i][0], ct[i - 1] + v[i][2]);
ct[i] = max(at[i - 1] + v[i][0], bt[i - 1] + v[i][1]);
}
long long ans = max(at[n - 1], bt[n - 1]);
cout << max(ans, ct[n - 1]);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<vector<long long int>> v(n);
vector<long long int> at(n);
vector<long long int> bt(n);
vector<long long int> ct(n);
for (long long int i = 0; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
v[i].push_back(a);
v[i].push_back(b);
v[i].push_back(c);
}
at[0] = v[0][0];
bt[0] = v[0][1];
ct[0] = v[0][2];
for (long long int i = 1; i < n; i++) {
at[i] = max(bt[i - 1] + v[i][0], ct[i - 1] + v[i][0]);
bt[i] = max(at[i - 1] + v[i][1], ct[i - 1] + v[i][1]);
ct[i] = max(at[i - 1] + v[i][2], bt[i - 1] + v[i][2]);
}
long long ans = max(at[n - 1], bt[n - 1]);
cout << max(ans, ct[n - 1]);
return 0;
}
| [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.add"
] | 962,643 | 962,644 | u583063982 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define f first
#define se second
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
typedef long long ll;
void solve() {
int N;
cin >> N;
vector<int> dp(3);
for (int i = 1; i <= N; ++i) {
vector<int> c(3);
vector<int> dp2(3, 0);
for (int i = 0; i < N; ++i)
cin >> c[i];
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
if (i != j) {
dp2[j] = max(dp2[j], dp[i] + c[j]);
}
}
}
dp = dp2;
}
cout << max(dp[0], max(dp[1], dp[2])) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// int t;
// cin>>t;
// while(t--)
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb(s) push_back(s)
#define mp(a, b) make_pair(a, b)
#define f first
#define se second
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PI 3.14159265358979323846264338327950L
#define MOD 1000000007
typedef long long ll;
void solve() {
int N;
cin >> N;
vector<int> dp(3);
for (int i = 1; i <= N; ++i) {
vector<int> c(3);
vector<int> dp2(3, 0);
for (int i = 0; i < 3; ++i)
cin >> c[i];
for (int i = 0; i < 3; ++i) {
for (int j = 0; j < 3; ++j) {
if (i != j) {
dp2[j] = max(dp2[j], dp[i] + c[j]);
}
}
}
dp = dp2;
}
cout << max(dp[0], max(dp[1], dp[2])) << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// int t;
// cin>>t;
// while(t--)
solve();
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,645 | 962,646 | u051484887 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vector<vector<int>> h(n, vector<int>(3));
rep(i, n) {
rep(j, 3) { cin >> h.at(i).at(j); }
}
vector<vector<int>> dp(n, vector<int>(3, 0));
rep(i, n) {
if (i == 0) {
rep(l, n) { dp.at(0).at(l) = h.at(0).at(l); }
continue;
}
rep(j, 3) {
rep(k, 3) {
if (k != j) {
dp.at(i).at(j) =
max(dp.at(i).at(j), dp.at(i - 1).at(k) + h.at(i).at(j));
}
}
}
}
int ans = 0;
rep(i, 3) { ans = max(ans, dp.at(n - 1).at(i)); }
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main() {
int n;
cin >> n;
vector<vector<int>> h(n, vector<int>(3));
rep(i, n) {
rep(j, 3) { cin >> h.at(i).at(j); }
}
vector<vector<int>> dp(n, vector<int>(3, 0));
rep(i, n) {
if (i == 0) {
rep(l, 3) { dp.at(0).at(l) = h.at(0).at(l); }
continue;
}
rep(j, 3) {
rep(k, 3) {
if (k != j) {
dp.at(i).at(j) =
max(dp.at(i).at(j), dp.at(i - 1).at(k) + h.at(i).at(j));
}
}
}
}
int ans = 0;
rep(i, 3) { ans = max(ans, dp.at(n - 1).at(i)); }
cout << ans << endl;
} | [] | 962,649 | 962,650 | u886613668 | cpp |
p03162 | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1e9 + 5
using namespace std;
int solve() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; day++) {
vector<int> new_dp(3);
vector<int> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
new_dp[j] = max(new_dp[j], dp[i] + a[j]);
}
}
}
dp = new_dp;
}
return max({dp[0], dp[1], dp[2]});
}
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
/*
int t;
cin >> t;
while (t--)
*/
cout << solve() << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1e9 + 5
using namespace std;
int solve() {
int n;
cin >> n;
vector<int> dp(3);
for (int day = 0; day < n; day++) {
vector<int> new_dp(3);
vector<int> a(3);
for (int i = 0; i < 3; i++) {
cin >> a[i];
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (i != j) {
new_dp[j] = max(new_dp[j], dp[i] + a[j]);
}
}
}
dp = new_dp;
}
return max({dp[0], dp[1], dp[2]});
}
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
/*
int t;
cin >> t;
while (t--)
*/
cout << solve() << "\n";
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 962,651 | 962,652 | u237185366 | cpp |
p03162 | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 200005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vvll ds(3, vll(n));
rep(i, n) rep(j, 3) cin >> ds[j][i];
vvll dp(n + 1, vll(3, 0));
rep(i, n) {
if (i == 0) {
rep(j, 3) dp[i + 1][j] = ds[j][i];
} else {
rep(j, 3) rep(k, 3) {
if (j != k) {
chmax(dp[i + 1][j], dp[i][k] + ds[k][j]);
}
}
}
}
ll ans = max({dp[n][0], dp[n][1], dp[n][2]});
cout << ans << endl;
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 200005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vvll ds(3, vll(n));
rep(i, n) rep(j, 3) cin >> ds[j][i];
vvll dp(n + 1, vll(3, 0));
rep(i, n) {
if (i == 0) {
rep(j, 3) dp[i + 1][j] = ds[j][i];
} else {
rep(j, 3) rep(k, 3) {
if (j != k) {
chmax(dp[i + 1][j], dp[i][k] + ds[j][i]);
}
}
}
}
ll ans = max({dp[n][0], dp[n][1], dp[n][2]});
cout << ans << endl;
return 0;
}
| [
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 962,660 | 962,661 | u714724786 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define x first
#define y second
using pii = pair<int, int>;
using ld = long double;
const int mxn = 1e5 + 5;
const int mod = 1e9 + 7;
int a[mxn], b[mxn], c[mxn], dp[mxn][3];
int32_t main() {
IOS int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][1] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]}) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define x first
#define y second
using pii = pair<int, int>;
using ld = long double;
const int mxn = 1e5 + 5;
const int mod = 1e9 + 7;
int a[mxn], b[mxn], c[mxn], dp[mxn][3];
int32_t main() {
IOS int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i] >> c[i];
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]}) << endl;
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 962,662 | 962,663 | u041396154 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define pii pair<int, int>
#define fi first
#define se second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define deb(x) cout << #x << ' ' << x << endl
#define clock \
cerr << 1000 * (double)clock() / (double)CLOCKS_PER_SEC << "ms" << endl;
void INPUT() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 1e5 + 5;
int a[N][3], n;
int cache[N][3];
int dp(int idx, int prev) {
if (idx >= n)
return 0;
if (cache[idx][prev] != -1)
return cache[idx][prev];
int ans = 0;
forn(i, 0, 3) {
if (i != prev)
ans = max(ans, a[idx][i] + dp(idx + 1, i));
}
cache[idx][prev] = ans;
return ans;
}
int32_t main() {
IOS INPUT();
cin >> n;
memset(cache, -1, sizeof(cache));
forn(i, 0, n) { forn(j, 0, 3) cin >> a[i][j]; }
int ans = 0;
forn(i, 0, 3) { ans = max(ans, a[0][i] + dp(1, i)); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define pii pair<int, int>
#define fi first
#define se second
#define forn(i, a, b) for (int i = a; i < b; i++)
#define deb(x) cout << #x << ' ' << x << endl
#define clock \
cerr << 1000 * (double)clock() / (double)CLOCKS_PER_SEC << "ms" << endl;
void INPUT() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 1e5 + 5;
int a[N][3], n;
int cache[N][3];
int dp(int idx, int prev) {
if (idx >= n)
return 0;
if (cache[idx][prev] != -1)
return cache[idx][prev];
int ans = 0;
forn(i, 0, 3) {
if (i != prev)
ans = max(ans, a[idx][i] + dp(idx + 1, i));
}
cache[idx][prev] = ans;
return ans;
}
int32_t main() {
IOS // INPUT();
cin >>
n;
memset(cache, -1, sizeof(cache));
forn(i, 0, n) { forn(j, 0, 3) cin >> a[i][j]; }
int ans = 0;
forn(i, 0, 3) { ans = max(ans, a[0][i] + dp(1, i)); }
cout << ans << endl;
return 0;
} | [
"variable_declaration.remove"
] | 962,664 | 962,665 | u041396154 | cpp |
p03162 | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ ██╔╝███████║██╔████╔██║██║ ██║ ╚████╔╝ ██║╚██╔╝██║██╔══██║
██╔╝ ██║╚██╔╝██║██║ ██║██║ ██║██║ ██║ ██╔╝ ██╔══██║██║╚██╔╝██║██║ ██║
╚██╔╝ ██║ ╚═╝ ██║██║ ██║ ██║ ██║ ╚═╝ ██║╚██████╔╝╚██████╔╝██████╔╝██╗██║
██║ ██║██║ ╚═╝ ██║██████╔╝ ██║ ╚═╝ ╚═╝╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝
╚═════╝ ╚═════╝ ╚═════╝ ╚═╝╚═╝ ╚═╝ ╚═╝╚═╝ ╚═╝╚═════╝ ╚═╝
“Nobody but you have to believe in your dreams to make
them a reality.” ― Germany Kent
*/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define Ma7moud_7amdy \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define Open_Sesame Open()
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define clr(arr, x) memset(arr, x, sizeof arr)
#define endl "\n"
#define Accepted 0
#define watch(x) cout << #x << " = " << x << endl;
#define un_map unordered_map
#define RT(x) return cout << (x), 0;
#define sc(a) scanf("%d", &a)
#define scll(x) scanf("%I64d", &x)
#define scan(s) scanf("%[^\n]%*c", &s)
#define pr(s) printf("%s", s.c_str()); // print string
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = -1e-2;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll mod = 998244353;
const int Mx = INT_MAX;
const int Mn = INT_MIN;
const ll MX = LLONG_MAX;
const ll MN = LLONG_MIN;
const int N = 1e5 + 5;
void Open() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
}
struct Vacation {
int Swim, bugs, homework;
};
int n;
vector<Vacation> v;
int mem[N][4];
int solve(int idx = 0, int prev = 0) {
if (idx == n)
return 0;
int &ret = mem[idx][prev];
if (~ret)
return ret;
ret = 0;
if (prev != 1)
ret = max(ret, solve(idx + 1, 1) + v[idx].Swim);
if (prev != 2)
ret = max(ret, solve(idx + 1, 2) + v[idx].bugs);
if (prev != 3)
ret = max(ret, solve(idx + 1, 3) + v[idx].homework);
return ret;
}
int main() {
Ma7moud_7amdy;
Open_Sesame;
clr(mem, -1);
cin >> n;
v = vector<Vacation>(n);
for (int i = 0; i < n; i++)
cin >> v[i].Swim >> v[i].bugs >> v[i].homework;
cout << solve();
}
| /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ ██╔╝███████║██╔████╔██║██║ ██║ ╚████╔╝ ██║╚██╔╝██║██╔══██║
██╔╝ ██║╚██╔╝██║██║ ██║██║ ██║██║ ██║ ██╔╝ ██╔══██║██║╚██╔╝██║██║ ██║
╚██╔╝ ██║ ╚═╝ ██║██║ ██║ ██║ ██║ ╚═╝ ██║╚██████╔╝╚██████╔╝██████╔╝██╗██║
██║ ██║██║ ╚═╝ ██║██████╔╝ ██║ ╚═╝ ╚═╝╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝
╚═════╝ ╚═════╝ ╚═════╝ ╚═╝╚═╝ ╚═╝ ╚═╝╚═╝ ╚═╝╚═════╝ ╚═╝
“Nobody but you have to believe in your dreams to make
them a reality.” ― Germany Kent
*/
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define Ma7moud_7amdy \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define Open_Sesame Open()
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define clr(arr, x) memset(arr, x, sizeof arr)
#define endl "\n"
#define Accepted 0
#define watch(x) cout << #x << " = " << x << endl;
#define un_map unordered_map
#define RT(x) return cout << (x), 0;
#define sc(a) scanf("%d", &a)
#define scll(x) scanf("%I64d", &x)
#define scan(s) scanf("%[^\n]%*c", &s)
#define pr(s) printf("%s", s.c_str()); // print string
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = -1e-2;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll mod = 998244353;
const int Mx = INT_MAX;
const int Mn = INT_MIN;
const ll MX = LLONG_MAX;
const ll MN = LLONG_MIN;
const int N = 1e5 + 5;
void Open() {
#ifndef ONLINE_JUDGE
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
#endif
}
struct Vacation {
int Swim, bugs, homework;
};
int n;
vector<Vacation> v;
int mem[N][4];
int solve(int idx = 0, int prev = 0) {
if (idx == n)
return 0;
int &ret = mem[idx][prev];
if (~ret)
return ret;
ret = 0;
if (prev != 1)
ret = max(ret, solve(idx + 1, 1) + v[idx].Swim);
if (prev != 2)
ret = max(ret, solve(idx + 1, 2) + v[idx].bugs);
if (prev != 3)
ret = max(ret, solve(idx + 1, 3) + v[idx].homework);
return ret;
}
int main() {
Ma7moud_7amdy;
// Open_Sesame;
clr(mem, -1);
cin >> n;
v = vector<Vacation>(n);
for (int i = 0; i < n; i++)
cin >> v[i].Swim >> v[i].bugs >> v[i].homework;
cout << solve();
}
| [] | 962,670 | 962,671 | u801961010 | cpp |
p03162 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int h[10010][3], dp[100100][3];
int main() {
int n;
cin >> n;
rep(i, n) rep(j, 3) cin >> h[i][j];
rep(i, n) rep(j, 3) rep(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][j], dp[i][j] + h[i][k]);
}
// rep(i, n + 1)
// {
// rep(j, 3) cout << dp[i][j] << " ";
// cout << endl;
// }
int ans = 0;
rep(i, 3) ans = max(ans, dp[n][i]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int h[100100][3], dp[100100][3];
int main() {
int n;
cin >> n;
rep(i, n) rep(j, 3) cin >> h[i][j];
rep(i, n) rep(j, 3) rep(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + h[i][k]);
}
// rep(i, n + 1)
// {
// rep(j, 3) cout << dp[i][j] << " ";
// cout << endl;
// }
int ans = 0;
rep(i, 3) ans = max(ans, dp[n][i]);
cout << ans << endl;
return 0;
} | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 962,677 | 962,676 | u420190011 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size - 1; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = -INT_MIN;
}
}
dp[0][0] = array[0][0];
dp[0][1] = array[0][1];
dp[0][2] = array[0][2];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i + 1][k] = max(dp[i + 1][k], array[i + 1][k] + dp[i][j]);
}
}
}
}
if (size == 1) {
int big = dp[0][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[0][i]);
}
cout << big;
} else {
int big = dp[size - 1][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[size - 1][i]);
}
cout << big;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = -INT_MIN;
}
}
dp[0][0] = array[0][0];
dp[0][1] = array[0][1];
dp[0][2] = array[0][2];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i + 1][k] = max(dp[i + 1][k], array[i + 1][k] + dp[i][j]);
}
}
}
}
if (size == 1) {
int big = dp[0][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[0][i]);
}
cout << big;
} else {
int big = dp[size - 1][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[size - 1][i]);
}
cout << big;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 962,678 | 962,679 | u223168630 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size - 1; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = INT_MIN;
}
}
dp[0][0] = array[0][0];
dp[0][1] = array[0][1];
dp[0][2] = array[0][2];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i + 1][k] = max(dp[i + 1][k], array[i + 1][k] + dp[i][j]);
}
}
}
}
if (size == 1) {
int big = dp[0][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[0][i]);
}
cout << big;
} else {
int big = dp[size - 1][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[size - 1][i]);
}
cout << big;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = -INT_MIN;
}
}
dp[0][0] = array[0][0];
dp[0][1] = array[0][1];
dp[0][2] = array[0][2];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i + 1][k] = max(dp[i + 1][k], array[i + 1][k] + dp[i][j]);
}
}
}
}
if (size == 1) {
int big = dp[0][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[0][i]);
}
cout << big;
} else {
int big = dp[size - 1][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[size - 1][i]);
}
cout << big;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.unary.add"
] | 962,680 | 962,679 | u223168630 | cpp |
p03162 | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size - 1; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = INT_MIN;
}
}
dp[0][0] = array[0][0];
dp[0][1] = array[0][1];
dp[0][2] = array[0][2];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i + 1][k] = max(dp[i + 1][k], array[i + 1][k] + dp[i][j]);
}
}
}
}
if (size == 1) {
int big = array[0][0];
for (int i = 0; i < 3; i++) {
big = max(big, array[0][i]);
}
cout << big;
} else {
int big = dp[size - 1][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[size - 1][i]);
}
cout << big;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin >> size;
int array[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
int next;
cin >> next;
array[i][j] = next;
}
}
int dp[size][3];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
dp[i][j] = -INT_MIN;
}
}
dp[0][0] = array[0][0];
dp[0][1] = array[0][1];
dp[0][2] = array[0][2];
for (int i = 0; i < size; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (k != j) {
dp[i + 1][k] = max(dp[i + 1][k], array[i + 1][k] + dp[i][j]);
}
}
}
}
if (size == 1) {
int big = dp[0][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[0][i]);
}
cout << big;
} else {
int big = dp[size - 1][0];
for (int i = 0; i < 3; i++) {
big = max(big, dp[size - 1][i]);
}
cout << big;
}
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operation.unary.add",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 962,681 | 962,679 | u223168630 | cpp |
p03162 | // https: //atcoder.jp/contests/dp/tasks/dp_c
#include <iostream>
#include <tuple>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::tuple<int, int, int>> days(n + 1);
for (int i = 1; i <= n; ++i) {
int a, b, c;
std::cin >> a >> b >> c;
days[i] = std::make_tuple(a, b, c);
}
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(4, 0));
dp[1][1] = std::get<0>(days[1]);
dp[1][2] = std::get<1>(days[1]);
dp[1][3] = std::get<2>(days[1]);
for (int i = 2; i <= n; ++i) {
dp[i][1] = std::get<0>(days[i]) + std::max(dp[i - 1][2], dp[i - 2][3]);
dp[i][2] = std::get<1>(days[i]) + std::max(dp[i - 1][1], dp[i - 1][3]);
dp[i][3] = std::get<2>(days[i]) + std::max(dp[i - 1][1], dp[i - 1][2]);
// std::cout << dp[i][1] << " " << dp[i][2] << " " << dp[i][3] << '\n';
}
std::cout << std::max(dp[n][1], std::max(dp[n][2], dp[n][3])) << '\n';
return 0;
} | // https: //atcoder.jp/contests/dp/tasks/dp_c
#include <iostream>
#include <tuple>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::tuple<int, int, int>> days(n + 1);
for (int i = 1; i <= n; ++i) {
int a, b, c;
std::cin >> a >> b >> c;
days[i] = std::make_tuple(a, b, c);
}
std::vector<std::vector<int>> dp(n + 1, std::vector<int>(4, 0));
dp[1][1] = std::get<0>(days[1]);
dp[1][2] = std::get<1>(days[1]);
dp[1][3] = std::get<2>(days[1]);
for (int i = 2; i <= n; ++i) {
dp[i][1] = std::get<0>(days[i]) + std::max(dp[i - 1][2], dp[i - 1][3]);
dp[i][2] = std::get<1>(days[i]) + std::max(dp[i - 1][1], dp[i - 1][3]);
dp[i][3] = std::get<2>(days[i]) + std::max(dp[i - 1][1], dp[i - 1][2]);
// std::cout << dp[i][1] << " " << dp[i][2] << " " << dp[i][3] << '\n';
}
std::cout << std::max(dp[n][1], std::max(dp[n][2], dp[n][3])) << '\n';
return 0;
} | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 962,682 | 962,683 | u001468394 | cpp |
p03162 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int arr[100001][3];
int dp[100001][3];
int32_t main() {
FIO;
int n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> arr[i][j];
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = arr[i][1] + max(dp[i - 1][0], dp[i - 1][1]);
}
int ans = max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]});
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
int arr[100000][3];
int dp[100000][3];
int32_t main() {
FIO;
int n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> arr[i][j];
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = arr[i][2] + max(dp[i - 1][0], dp[i - 1][1]);
}
int ans = max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]});
cout << ans;
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 962,686 | 962,687 | u980593902 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.