problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, dp[100010] = {}, h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, dp[100010] = {}, h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] +... | [] | 955,748 | 955,750 | u226749583 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define pb push_back
#define INF INT_MAX
#define mod 1000000007ll
#define fi first
#define se second
#define f(i, p, q) for (int i = p; i < q; i++)
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d %d", &a, &b)
#de... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,756 | 955,758 | u207685829 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
ll n;
cin >> n;
ll a[n + 1];
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
ll n;
cin >> n;
ll a[n + 1];
... | [
"call.add",
"call.arguments.change"
] | 955,759 | 955,760 | u131797876 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
#define lp(i, n) for (ll i = 0; i < n; i++)
using namespace std;
ll min(ll a, ll b) { return a < b ? a : b; }
int main() {
ll n;
cin >> n;
ll h[n];
lp(i, n) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
lp(i, n + 1) {
if (i - 1 > 0)
dp[i] = dp[i - 1] + a... | #include <bits/stdc++.h>
#define ll long long int
#define lp(i, n) for (ll i = 0; i < n; i++)
using namespace std;
ll min(ll a, ll b) { return a < b ? a : b; }
int main() {
ll n;
cin >> n;
ll h[n];
lp(i, n) cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
lp(i, n + 1) {
if (i - 1 >= 0)
dp[i] = dp[i - 1] + ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 955,761 | 955,762 | u005739051 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
int dp[100010];
dp[0] = 0;
dp[1] = abs(b.at(0) - b.at(1));
for (int i = 2; i <= a; i++) {
dp[i] = min(dp[i - 1] + abs(b.at(i - 1) - b... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
int dp[100010];
dp[0] = 0;
dp[1] = abs(b.at(0) - b.at(1));
for (int i = 2; i < a; i++) {
dp[i] = min(dp[i - 1] + abs(b.at(i - 1) - b.... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 955,764 | 955,766 | u341447450 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] + arr[i]),
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,779 | 955,781 | u011986906 | cpp |
p03160 | /*
ID: flashysport101
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector... | /*
ID: flashysport101
LANG: C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector... | [
"expression.operation.binary.add"
] | 955,804 | 955,806 | u758353376 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/*
int chmax(int a, int b){
if(a<b)a=b;
}
void chmin(int a, int b){
if(a>b)a=b;
}
*/
int main(int argc, char **argv) {
int n;
cin >> n;
char hight[n];
int cost[n];
for (int i = 0; i < n; i++) {
int k;
cin >> k;
hight[i] = k;
}
int a;
... | #include <bits/stdc++.h>
using namespace std;
/*
int chmax(int a, int b){
if(a<b)a=b;
}
void chmin(int a, int b){
if(a>b)a=b;
}
*/
int main(int argc, char **argv) {
int n;
cin >> n;
int hight[n];
int cost[n];
for (int i = 0; i < n; i++) {
int k;
cin >> k;
hight[i] = k;
}
int a;
... | [
"variable_declaration.type.primitive.change"
] | 955,810 | 955,811 | u856586005 | cpp |
p03160 | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
ll i, j, k, n, m, a[200007], dp[200007];
int main() {
cin >> n >> k;
for (ll i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
dp[i] = 1e9;
for (j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp... | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
ll i, j, k = 2, n, m, a[200007], dp[200007];
int main() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++) {
dp[i] = 1e9;
for (j = 1; j <= k && i - j > 0; j++) {
dp[i] = min(dp[... | [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 955,821 | 955,823 | u594129396 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
int height[100000], dp[100000];
void read() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> height[i];
}
}
int max(int a, int b) {
if (a < b)
return a;
else
return b;
}
int solve() {
dp[0] = 0;
dp[1] = height[1] - height[0];
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int n;
int height[100000], dp[100000];
void read() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> height[i];
}
}
int max(int a, int b) {
if (a < b)
return a;
else
return b;
}
int solve() {
dp[0] = 0;
dp[1] = abs(height[1] - height[0]);
for (int... | [
"call.add",
"call.arguments.change"
] | 955,825 | 955,826 | u471769750 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[n] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 955,831 | 955,833 | u307571140 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[n] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,834 | 955,833 | u307571140 | cpp |
p03160 | #include <bits/stdc++.h>
#define oo int(1e9)
using namespace std;
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.tie(0);
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
for (int i = 1; i <= n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++)
... | #include <bits/stdc++.h>
#define oo int(1e9)
using namespace std;
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout.tie(0);
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n);
for (int i = 1; i < n; i++)
dp[i] = oo;
for (int i = 0; i < n; i++)
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 955,853 | 955,854 | u601330084 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(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"
] | 955,856 | 955,858 | u870168650 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[1000];
int dp[1000];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
... | [
"literal.number.change",
"variable_declaration.array_dimensions.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"
] | 955,860 | 955,858 | u870168650 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[1000];
int dp[1000];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
if... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[100005];
int dp[100005];
int f(int n) {
if (n == 1) {
return 0;
}
if (n <= 0) {
return INT_MAX;
}
if (dp[n] != -1) {
return dp[n];
}
int ans1 = INT_MAX, ans2 = INT_MAX;
ans1 = abs(arr[n] - arr[n - 1]) + f(n - 1);
... | [
"literal.number.change",
"variable_declaration.array_dimensions.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",
"ex... | 955,861 | 955,858 | u870168650 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
// cout<<arr[i]<<" ";
}
int a = 0;
int b = abs(arr[1] - arr[0]);
int cost = 0;
for (int i = 2; i < n; i++) {
int c1 = a + abs(arr[i] - arr[i - 2]);
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
// cout<<arr[i]<<" ";
}
int a = 0;
int b = abs(arr[1] - arr[0]);
int cost = b;
for (int i = 2; i < n; i++) {
int c1 = a + abs(arr[i] - arr[i - 2]);
int... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 955,621 | 955,622 | u174636610 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; i++) {
int a = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int b = dp[i - 2] + abs(arr[i] - ar... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
// cout<<arr[i]<<" ";
}
// cout<<"\n";
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int a = dp[i - 1] + abs(arr[i] -... | [
"call.add",
"call.arguments.change"
] | 955,623 | 955,624 | u174636610 | cpp |
p03160 | #include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define mem(x, y) memset(x, y, sizeof(x))
#define lli long long int
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define F firs... | #include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define mem(x, y) memset(x, y, sizeof(x))
#define lli long long int
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define F firs... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,625 | 955,626 | u539539244 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
/*### FAST-IO ###*/
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | #include <bits/stdc++.h>
using namespace std;
/*### FAST-IO ###*/
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout... | [
"identifier.change"
] | 955,635 | 955,636 | u470689998 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long int dp[1000000];
int main(void) {
long long int n;
cin >> n;
long long int a[n], i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < 1000000; i++)
dp[i] = -1;
if (n == 2) {
cout << a[0] + a[1] << endl;
return 0;
}
dp[0] = ... | #include <bits/stdc++.h>
using namespace std;
long long int dp[1000000];
int main(void) {
long long int n;
cin >> n;
long long int a[n], i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < 1000000; i++)
dp[i] = -1;
if (n == 2) {
cout << abs(a[0] - a[1]) << endl;
return 0;
}
dp[... | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change",
"call.arguments.change"
] | 955,637 | 955,638 | u917834174 | cpp |
p03160 | #include <iostream>
#include <stdio.h>
using namespace std;
int n, h[100003], f[100003];
void DP() {
f[1] = h[1];
f[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; ++i) {
f[i] =
min(f[i - 1] + abs(h[i] - h[i - 1]), f[i - 2] + abs(h[i] - h[i - 2]));
}
printf("%d", f[n]);
}
int main() {
scanf("%... | #include <iostream>
#include <stdio.h>
using namespace std;
int n, h[100003], f[100003];
void DP() {
f[1] = 0;
f[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; ++i) {
f[i] =
min(f[i - 1] + abs(h[i] - h[i - 1]), f[i - 2] + abs(h[i] - h[i - 2]));
}
printf("%d", f[n]);
}
int main() {
scanf("%d",... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,640 | 955,641 | u177919024 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 1, 100005);
dp[0] = 0;
rep(i, N) {
if (i + 1 < N)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
vector<int> dp(N + 1, 1000000009);
dp[0] = 0;
rep(i, N) {
if (i + 1 < N)
dp[i + 1] = min(dp[i + 1], dp[i] + a... | [
"literal.number.change",
"call.arguments.change"
] | 955,644 | 955,645 | u703503553 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<ll> okay(100005, -1);
vector<ll> arr;
ll ans(ll x) {
if (okay[x - 1] != -1) {
return okay[x - 1];
}
if (x <= 3) {
return okay[x - 1];
}
if (x > 3) {
// cout
okay[x - 1] = min(abs(arr[x - 1] - arr[x... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<ll> okay(100005, -1);
vector<ll> arr;
ll ans(ll x) {
if (okay[x - 1] != -1) {
return okay[x - 1];
}
if (x <= 3) {
return okay[x - 1];
}
if (x > 3) {
// cout
okay[x - 1] = min(abs(arr[x - 1] - arr[x... | [
"call.arguments.change"
] | 955,660 | 955,661 | u415589348 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> dp;
dp.push_back(v[0]);
dp.push_back(abs(v[0] - v[1]));
for (int i = 2; i < n; i++) {
dp.push_back(min(abs(v[i] - v[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> dp;
dp.push_back(0);
dp.push_back(abs(v[0] - v[1]));
for (int i = 2; i < n; i++) {
dp.push_back(min(abs(v[i] - v[i - 2... | [
"call.arguments.change"
] | 955,663 | 955,664 | u552345139 | cpp |
p03160 | //// SHAKALAKA BOOM BOOM ////
#include <bits/stdc++.h>
#define ll long long
#define vi vector<ll>
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define hell 1000000007
#define endl '\n'
#define fl(z, a, b) for (ll z = a; z < b; z++)
#define i... | //// SHAKALAKA BOOM BOOM ////
#include <bits/stdc++.h>
#define ll long long
#define vi vector<ll>
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define hell 1000000007
#define endl '\n'
#define fl(z, a, b) for (ll z = a; z < b; z++)
#define i... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 955,667 | 955,668 | u367501439 | cpp |
p03160 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define pf push_front
#define pob pop_back
#define... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define X first
#define Y second
#define pb push_back
#define pf push_front
#define pob pop_back
#define... | [] | 955,669 | 955,670 | u925215421 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h[i]; // h[i]は足場i+1の高さ。
vector<int> dp(N);
// vector dp[i]には、足場i+1まで到達した場合の最小コストを記入する。
rep(i, N) {
if (i == 0)
dp[0] = 0; /... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i]; // h[i]は足場i+1の高さ。
vector<int> dp(N);
// vector dp[i]には、足場i+1まで到達した場合の最小コストを記入する。
rep(i, N) {
if (i == 0)
dp[0] = 0; //足場1にいると... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 955,671 | 955,672 | u319179101 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++)
cin >> h[i];
vector<long long> sol(n + 1, -1);
sol[0] = 0;
sol[1] = 0;
for (int i = 2; i < n + 1; i++) {
sol[i] = min(abs(h[i] - h[i - 1]) + sol[i - 1],
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n + 1, 0);
for (int i = 1; i < n + 1; i++)
cin >> h[i];
vector<long long> sol(n + 1, -1);
sol[0] = INT_MAX;
sol[1] = 0;
for (int i = 2; i < n + 1; i++) {
sol[i] = min(abs(h[i] - h[i - 1]) + sol[i - 1],
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 955,675 | 955,676 | u941949497 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> dp(n, 1000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long> dp(n, 10000000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)))... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 955,677 | 955,678 | u288432959 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> dp(n, 1000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long> dp(n, 10000000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)))... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 955,679 | 955,678 | u288432959 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<int> dp(n, 1000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)));
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
vector<long> dp(n, 10000000000);
dp.at(0) = 0;
for (int i = 0; i < n - 1; i++) {
dp.at(i + 1) = min(dp.at(i + 1), dp.at(i) + abs(a.at(i) - a.at(i + 1)))... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 955,679 | 955,680 | u288432959 | cpp |
p03160 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"variable_declaration.type.change",
"identifier.change",
"call.arguments.change"
] | 955,681 | 955,683 | u288432959 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define cool \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 955,685 | 955,687 | u581946498 | cpp |
p03160 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int 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] = min(dp[i - 1] + (arr[i] - ar... | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int 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] = min(dp[i - 1] + abs(arr[i] -... | [
"call.add",
"call.arguments.change"
] | 955,689 | 955,691 | u354308480 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.be... | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.be... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"literal.number.change",
"variable_declaration.value.change",
"expression.off_by_one"
] | 955,705 | 955,706 | u215714483 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.be... | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.be... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.newline.add"
] | 955,707 | 955,706 | u215714483 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.be... | #include <bits/stdc++.h>
#define endl '\n'
#define pb push_back
#define ll long long
#define lli long long int
#define li long int
#define ld long double
#define vi vector<int>
#define vlli vector<lli>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define mp(a, b) make_pair(a, b)
#define all(arr) arr.be... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"io.output.newline.add"
] | 955,709 | 955,706 | u215714483 | cpp |
p03160 | #include <bits/stdc++.h>
#define fr first
#define sc second
#define memset(X, Y) memset(X, Y, sizeof X)
#define all(X) X.begin(), X.end()
#define sz size()
#define pb push_back
#define ve vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define Graph vector<vector<int>>
#define Fp co... | #include <bits/stdc++.h>
#define fr first
#define sc second
#define memset(X, Y) memset(X, Y, sizeof X)
#define all(X) X.begin(), X.end()
#define sz size()
#define pb push_back
#define ve vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define Graph vector<vector<int>>
#define Fp co... | [
"literal.number.change"
] | 955,726 | 955,728 | u305865627 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1);
dp[2] = abs(dp[2] - dp[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> arr[i];
vector<int> dp(n + 1);
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
dp[i] = min(dp[i - 1] + abs(arr... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,735 | 955,736 | u241738997 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
ll a[N];
ll dp[N];
int main() {
ios_base::... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
ll a[N];
ll dp[N];
int main() {
ios_base::... | [
"literal.number.change",
"call.arguments.change"
] | 955,740 | 955,741 | u095029955 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
int a[N];
int dp[N];
int main() {
ios_base... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, j, n) for (long long i = j; i <= n; i++)
#define per(i, j, n) for (long long i = j; i >= n; i--)
const ll N = 123456;
const ll mod = 998244353;
const ld eps = 1e-5;
ll a[N];
ll dp[N];
int main() {
ios_base::... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change"
] | 955,742 | 955,741 | u095029955 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if... | [] | 955,744 | 955,745 | u845851868 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int v[n];
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
vector<int> dp(n, INF);
dp[0] = 0;
if (n > 1)
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
scanf("%d", &n);
int v[n];
for (int i = 0; i < n; i++)
scanf("%d", &v[i]);
vector<int> dp(n, INF);
dp[0] = 0;
if (n > 1)
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,757 | 955,763 | u790968697 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iostream>
#include <list> //双方向リスト
#include <map> //連想配列
#include <numeric>
#include <queue>
#include <set> //集合
#include <stack>
#include <string>
#include <tuple>
#include <vector> //動的配列
typedef long long ll;
using namespace std;
... | [
"call.add",
"call.arguments.change",
"assignment.change"
] | 955,765 | 955,767 | u652150585 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 4;
int dp[maxn], h[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1e9;
}
dp[1] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 4;
int dp[maxn], h[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1e9;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 955,769 | 955,770 | u410677737 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
... | [
"call.add",
"call.arguments.change"
] | 955,771 | 955,773 | u631895856 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define INF 1e18
ll modInverse(ll a, ll m);
ll gcd(ll... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vll vector<long long>
#define INF 1e18
ll modInverse(ll a, ll m);
ll gcd(ll... | [
"call.add",
"call.arguments.change"
] | 955,790 | 955,794 | u065898443 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define X first
#define Y second
const int MAXN = 1e5 + 5;
int n, dp[MAXN], arr[MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = arr[1];
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define X first
#define Y second
const int MAXN = 1e5 + 5;
int n, dp[MAXN], arr[MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
dp... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,799 | 955,801 | u328001833 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll n, k = 3;
ll h[100000], memo[100000];
ll dp(ll i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
ll ret = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j < n)
ret = min(ret, dp(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
ll n, k = 2;
ll h[100000], memo[100000];
ll dp(ll i) {
if (i == n - 1)
return 0;
if (memo[i] != -1)
return memo[i];
ll ret = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i + j < n)
ret = min(ret, dp(... | [
"literal.number.change",
"variable_declaration.value.change"
] | 955,803 | 955,805 | u603496599 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define push_back pb
int main() {
int n;
cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] = min(v[i - 1] + abs(dp[i] - dp[i - 1]),
... | #include <bits/stdc++.h>
using namespace std;
#define push_back pb
int main() {
int n;
cin >> n;
std::vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i -... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,807 | 955,812 | u524189874 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pi \
3.1415926535897932384626433832795028841971693993751058209749445923078164062
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#defin... | [
"expression.operation.binary.remove"
] | 955,814 | 955,816 | u186089447 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(N), h(N);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1... | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
vector<int> dp(100010), h(100010);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i ... | [
"variable_declaration.remove"
] | 955,820 | 955,822 | u230804605 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(N), h(N);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1... | #include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(100010), h(100010);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(... | [] | 955,820 | 955,824 | u230804605 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 5000000;
ll way1 = 0, way2 = 0;
ll dp[100000];
ll ans, n;
int main() {
ll in[100000], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> in[i];
}
dp[0] = 0;
dp[1] = in[1] - in[0];
for (i = 2; i < n; i++) {
dp[i] = mi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 5000000;
ll way1 = 0, way2 = 0;
ll dp[100000];
ll ans, n;
int main() {
ll in[100000], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> in[i];
}
dp[0] = 0;
dp[1] = abs(in[1] - in[0]);
for (i = 2; i < n; i++) {
dp[i]... | [
"call.add",
"call.arguments.change"
] | 955,837 | 955,840 | u993656019 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 2]), dp[i - 2] + abs(a[i] - a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,846 | 955,848 | u888060901 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 2]), dp[i - 2] + abs(a[i] - a[i - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long a[n], s = 0, dp[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,850 | 955,848 | u888060901 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 1; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,855 | 955,857 | u869295474 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
... | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
... | [
"call.add",
"call.arguments.change"
] | 955,859 | 955,862 | u645123130 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) rep... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) rep... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 955,865 | 955,867 | u314008046 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) rep... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) rep... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 955,870 | 955,867 | u314008046 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define EPS 10e-9
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define st first
#define nd second
#define sz(v) int(v.size())
#define all(X) (X).begin(), (X).end()
#define ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 955,872 | 955,874 | u333900388 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i - 1 >= 0)
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
if (i - 2 >= 0)
dp[i] = min(dp[i], abs(h[i] - h[i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n], dp[n] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 1; i < n; i++) {
if (i - 1 >= 0)
dp[i] = abs(h[i] - h[i - 1]) + dp[i - 1];
if (i - 2 >= 0)
dp[i] = min(dp[i], abs(h[i] - h[i - ... | [
"call.arguments.change"
] | 955,876 | 955,877 | u345356200 | cpp |
p03160 | /* Problem Description:
A - Frog 1
*/
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <lis... | /* Problem Description:
A - Frog 1
*/
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <lis... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 955,882 | 955,883 | u257470355 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<long long> h;
vector<long long> memo;
long long ans;
long long n;
long long DP(long long v) {
if (v == n - 1) {
return abs(h[v] - h[v - 1]);
}
if (v == n)
return 0;
if (memo[v] != -1)
return memo[v];
long long a1 = abs(h[v + 1] - h[v]);
lon... | #include <bits/stdc++.h>
using namespace std;
vector<long long> h;
vector<long long> memo;
long long ans;
long long n;
long long DP(long long v) {
if (v == n - 1) {
return abs(h[v] - h[v + 1]);
}
if (v == n)
return 0;
if (memo[v] != -1)
return memo[v];
long long a1 = abs(h[v + 1] - h[v]);
lon... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 955,884 | 955,885 | u085897824 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
// long long dp[100001]={0};
long long val = 0;
long long arr[100001];
for (i = 0; i < n; i++)
cin >> arr[i];
/*dp[0]=0;
dp[1]=abs(arr[1]-arr[0]);*/
int temp1 = 0;
int temp2 = abs(arr[1] - arr[0]);
for (i = 2;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i;
cin >> n;
// long long dp[100001]={0};
long long val = 0;
long long arr[100001];
for (i = 0; i < n; i++)
cin >> arr[i];
/*dp[0]=0;
dp[1]=abs(arr[1]-arr[0]);*/
int temp1 = 0;
int temp2 = abs(arr[1] - arr[0]);
val = temp2... | [
"assignment.add"
] | 955,907 | 955,908 | u953182071 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int dp[100001] = {-1};
int a[100001];
int n;
int f(int p) {
if (p == n - 1)
return 0;
if (dp[p] != 0)
return dp[p];
dp[p] = abs(a[p] - a[p + 1]) + f(p + 1);
if (p + 2 < n)
dp[p] = min(dp[p], abs(a[p] - a[p + 2]) + f(p + 2));
return dp[p];
}... | #include <cmath>
#include <iostream>
using namespace std;
int dp[100001] = {-1};
int a[100001];
int n;
int f(int p) {
if (p == n - 1)
return 0;
if (dp[p] != -1)
return dp[p];
dp[p] = abs(a[p] - a[p + 1]) + f(p + 1);
if (p + 2 < n)
dp[p] = min(dp[p], abs(a[p] - a[p + 2]) + f(p + 2));
return dp[p];
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 955,913 | 955,914 | u080344444 | cpp |
p03160 | #include "bits/stdc++.h"
// vector
#define MAX_ELE(vec) *max_element(vec.begin(), vec.end())
#define SORT(vec) sort(vec.begin(), vec.end());
// ---------------------------------------
// string
#define TO_UP(str) transform(str.cbegin(), str.cend(), str.begin(), ::toupper)
// ---------------------------------------
... | #include "bits/stdc++.h"
// vector
#define MAX_ELE(vec) *max_element(vec.begin(), vec.end())
#define SORT(vec) sort(vec.begin(), vec.end());
// ---------------------------------------
// string
#define TO_UP(str) transform(str.cbegin(), str.cend(), str.begin(), ::toupper)
// ---------------------------------------
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 955,931 | 955,932 | u373796790 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
stati... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
stati... | [
"literal.number.change",
"call.arguments.change"
] | 955,938 | 955,936 | u747087681 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
stati... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
stati... | [
"literal.number.change",
"call.arguments.change"
] | 955,939 | 955,936 | u747087681 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fri(i, a, b) for (int i = a; i <= b; ++i)
#define fro(i, a, b) for (int i = a; i >= b; --i)
#define debug(P) cout << #P << " = " << P << endl;
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y)... | #include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fri(i, a, b) for (int i = a; i <= b; ++i)
#define fro(i, a, b) for (int i = a; i >= b; --i)
#define debug(P) cout << #P << " = " << P << endl;
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 955,940 | 955,941 | u925429104 | cpp |
p03160 | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 100000 + 5;
int n, h[MAXN], f[MAXN];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", h + i);
f[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
h[i] =
min(f[i - 2] + abs(h[i] - h[i - 2]), f[i - 1... | #include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 100000 + 5;
int n, h[MAXN], f[MAXN];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", h + i);
f[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
f[i] =
min(f[i - 2] + abs(h[i] - h[i - 2]), f[i - 1... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 955,942 | 955,943 | u384419821 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i <= b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define... | #include <bits/stdc++.h>
#include <iostream>
#define mod 1000000007
#define eps 1e-9
#define PI 3.14159265358979323846
#define F first
#define S second
#define ll long long
#define pb push_back
#define mp make_pair
#define Fr(i, a, b) for (int i = a; i <= b; i++)
#define RF(i, a, b) for (int i = a; i >= b; i--)
#define... | [
"preprocessor.define.value.change"
] | 955,946 | 955,947 | u479971587 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define uniq(x) \
x.erase(unique(x.begin(), x.end()), x.end()) // Unique value find from vector
#define upper(arr, n, fixed) \
upper_bound(arr, arr + n, fi... | #include <bits/stdc++.h>
using namespace std;
#define uniq(x) \
x.erase(unique(x.begin(), x.end()), x.end()) // Unique value find from vector
#define upper(arr, n, fixed) \
upper_bound(arr, arr + n, fi... | [
"literal.number.change",
"function.return_value.change"
] | 955,948 | 955,949 | u093669840 | cpp |
p03160 | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_AB(i, a, b) for (ll i = ll(a); i <= ll(b); ++i)
#define ALL(v) v.begin(), ... | // template
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<long long, long long> LP;
#define INF 999999999
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_AB(i, a, b) for (ll i = ll(a); i <= ll(b); ++i)
#define ALL(v) v.begin(), ... | [
"assignment.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 955,958 | 955,959 | u652057333 | cpp |
p03160 |
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<ll>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x,... |
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<ll>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x,... | [
"call.add",
"call.arguments.change"
] | 955,962 | 955,963 | u495003993 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define sz 100110
#define ll long long int
ll n, c = 0, p, q;
ll num[sz];
ll vis[sz];
ll dp[sz];
ll tani(int pos) {
if (pos >= n)
return 0;
if (vis[pos] == 1)
return dp[pos];
vis[pos] = 1;
return dp[pos] = min(abs(num[pos] - num[pos + 1]) + tani(pos + 1),... | #include <bits/stdc++.h>
using namespace std;
#define sz 100110
#define ll long long int
ll n, c = 0, p, q;
ll num[sz];
ll vis[sz];
ll dp[sz];
ll tani(int pos) {
if (pos >= n)
return 0;
if (vis[pos] == 1)
return dp[pos];
vis[pos] = 1;
return dp[pos] = min(abs(num[pos] - num[pos + 1]) + tani(pos + 1),... | [
"literal.number.change",
"assignment.value.change"
] | 955,964 | 955,965 | u984621967 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2... | [
"expression.operation.binary.add"
] | 955,966 | 955,967 | u400267362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 3; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,968 | 955,967 | u400267362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 3; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i)
cin >> v[i];
vector<int> dp(n, 0);
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 955,969 | 955,967 | u400267362 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
// int res = 0;
for (int i = 2; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
// int res = 0;
for (int i = 2; i < n; i++) {
d... | [] | 955,979 | 955,980 | u167245821 | cpp |
p03160 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#i... | [
"assignment.change"
] | 955,983 | 955,984 | u532065884 | cpp |
p03160 | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#i... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#i... | [
"variable_declaration.type.change",
"assignment.change"
] | 955,985 | 955,984 | u532065884 | cpp |
p03160 | /*----------------
Smit Patel
DA-IICT
----------------*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ins insert
#define fori(i, a, n) for (int i = a; i < n; i++)
#define ford(i, a, n) for (int i = a; i ... | /*----------------
Smit Patel
DA-IICT
----------------*/
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ins insert
#define fori(i, a, n) for (int i = a; i < n; i++)
#define ford(i, a, n) for (int i = a; i ... | [
"literal.number.change",
"call.arguments.change",
"assignment.change"
] | 955,988 | 955,989 | u821117000 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | [
"literal.number.change",
"assignment.value.change"
] | 955,990 | 955,991 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | [
"literal.number.change",
"assignment.value.change"
] | 955,992 | 955,991 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 955,993 | 955,991 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | [
"literal.number.change",
"assignment.value.change"
] | 955,992 | 955,995 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e5;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> h(n), ans(n);
for (int i = 0; i < n; i++)
cin >> h[i];
ans[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
ans[i] = 1e9;
for (int j = 1; j < 2 + 1; j++) {
ans[i] = min(ans[i], abs(h[i] - h[i ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change"
] | 955,993 | 955,995 | u018586085 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N;
vector<lon... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
// 入力
int N;
vector<lon... | [
"expression.operation.binary.remove"
] | 955,999 | 956,000 | u074306398 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
int main() {
int n;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
vector<int> dp(n, -1);
dp[0] = 0;
dp[1] = data[1] - data[0];
for (int i = 1; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(data[... | #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
int main() {
int n;
cin >> n;
vector<int> data(n, 0);
for (int i = 0; i < n; i++) {
cin >> data[i];
}
vector<int> dp(n, -1);
dp[0] = 0;
dp[1] = abs(data[1] - data[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,004 | 956,005 | u647457236 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int h[100001];
cin >> n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define all(v) v.begin(), v.end()
#define reps(__i, a, b) for (int __i = a; i < b; i++)
#define rep(__i, n) reps(__i, 0, n)
const ll INF = (1ll << 60);
const ll MOD = (ll)1e9 + 7;
signed main() {
int n;
int h[100001];
cin >> n;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 956,008 | 956,009 | u218759384 | cpp |
p03160 | #include <bits/stdc++.h>
// #define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vin... | #include <bits/stdc++.h>
// #define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define vin... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 956,021 | 956,022 | u350343918 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,023 | 956,024 | u364018936 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
static const int INF = (1 << 21);
int main(void) {
// Your code here!
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = INF;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
vector<int> dp(N + 1);
dp.at(0) = INF;
dp.at(1) = 0;
for (int i = 2; i <= ... | #include <bits/stdc++.h>
using namespace std;
static const int INF = (1 << 21);
int main(void) {
// Your code here!
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = INF;
for (int i = 0; i < N; i++) {
cin >> h.at(i + 1);
}
vector<int> dp(N + 1);
dp.at(0) = INF;
dp.at(1) = 0;
for (int i = 2; i... | [
"expression.operation.binary.add"
] | 956,037 | 956,038 | u633284019 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,041 | 956,042 | u855866205 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll h[n];
ll d[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
d[i] = 1000000;
}
d[0] = 0;
for (ll i = 1; i < n; i++) {
if (i > 1)
d[i] = min(d[i], d[i - 2] + abs(h[i] - h[i - 2]));
d[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
ll h[n];
ll d[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
d[i] = pow(10, 18);
}
d[0] = 0;
for (ll i = 1; i < n; i++) {
if (i > 1)
d[i] = min(d[i], d[i - 2] + abs(h[i] - h[i - 2]));
d... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.add"
] | 956,049 | 956,050 | u876784108 | cpp |
p03160 |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N - 1]);
for... |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N - 1]);
for... | [
"call.arguments.change"
] | 956,060 | 956,061 | u889784755 | cpp |
p03160 |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N + 1]);
for... |
/// Code Forces - DP Educational Contest
#include <algorithm>
#include <iostream>
#include <string.h>
const int NMAX = 100001;
int h[NMAX];
int DP[NMAX];
int main() {
int N;
std::cin >> N;
for (int i = 1; i <= N; ++i) {
std::cin >> h[i];
}
DP[N] = 0;
DP[N - 1] = std::abs(h[N] - h[N - 1]);
for... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,062 | 956,061 | u889784755 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N;
int h[MAX_N], dp[MAX_N];
int main() {
ios_base::sync_... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
const int MOD = 1e9 + 7;
const ll INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 1e5 + 5;
int N;
int h[MAX_N], dp[MAX_N];
int main() {
ios_base::sync_... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 956,065 | 956,066 | u738069880 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.