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 <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll INF = 1 << 60;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[100000];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n - 1) {
dp[i + 1] = min(dp[i + 1], ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
int main() {
ll n;
cin >> n;
ll INF = 10000000000;
vector<ll> v(n);
rep(i, n) cin >> v[i];
ll dp[100000];
rep(i, n) dp[i] = INF;
dp[0] = 0;
rep(i, n - 1) {
dp[i + 1] = min(dp[i + ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 951,815 | 951,814 | u264265458 | cpp |
p03160 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); ... | [
"call.arguments.change"
] | 951,816 | 951,817 | u264265458 | cpp |
p03160 | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); ... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); ... | [
"call.arguments.change"
] | 951,816 | 951,818 | u264265458 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int ans, n;
int dp[100005];
int jump(int a[], int i) {
if (i >= n)
return 1001001001;
;
if (i == n - 1)
return 0;
if (dp[i] != -1) {
return dp[i];
}
dp[i] = min(abs(a[i] - a[i + 1]) + jump(a, i + 1),
abs(a[i] - a[i + 2]) + jump(a, ... | #include <bits/stdc++.h>
using namespace std;
int ans, n;
long long dp[100005];
long long jump(int a[], int i) {
if (i >= n)
return 1001001001;
if (i == n - 1)
return 0;
if (dp[i] != -1) {
return dp[i];
}
dp[i] = min(abs(a[i] - a[i + 1]) + jump(a, i + 1),
abs(a[i] - a[i + 2]) + ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 951,819 | 951,820 | u174314384 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n + 1, 0);
dp[0] = 0;
dp[1] = 0;
dp[2] = dp[1] + abs(v[1] - v[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<int> dp(n + 1, 0);
dp[0] = 0;
dp[1] = 0;
dp[2] = dp[1] + abs(v[1] - v[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min(d... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,825 | 951,826 | u601414164 | cpp |
p03160 | /*maximum subarray sum
* kadane algo space optimize dp
*/
#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;
for (int i = 1; i < n; i++) {
int opt = INT_MAX, opt2 = INT_MAX;
opt = dp[i - 1... | /*maximum subarray sum
* kadane algo space optimize dp
*/
#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;
for (int i = 1; i < n; i++) {
int opt = INT_MAX, opt2 = INT_MAX;
opt = dp[i - 1... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 951,827 | 951,828 | u129880691 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int MAX_INT = 2000000000;
int dp[100001];
int h[1000... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pi;
typedef long long ll;
const int MAX_INT = 2000000000;
int dp[100001];
int h[1000... | [] | 951,831 | 951,832 | u117022482 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll lo... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll lo... | [
"expression.operation.binary.remove",
"assignment.add"
] | 951,833 | 951,834 | u763558684 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, inf = 0x3f3f3f3f;
int n, h[N], dp[N];
int main() {
cin >> n;
for (int i = 2; i < N; i++)
dp[i] = inf;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[min(i + 2, n)] =
min(dp[min(i + 2, n)], dp[... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, inf = 0x3f3f3f3f;
int n, h[N], dp[N];
int main() {
cin >> n;
for (int i = 2; i < N; i++)
dp[i] = inf;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i < n; i++) {
dp[min(i + 2, n)] =
min(dp[min(i + 2, n)], dp[... | [
"call.remove",
"call.add"
] | 951,835 | 951,836 | u942678409 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog1dp(int h[], int n) {
int mindp[n + 1];
mindp[0] = 0;
mindp[1] = 0;
mindp[2] = abs(h[2] - h[1]);
for (int i = 2; i <= n; i++) {
mindp[i] = min(mindp[i - 1] + abs(h[i] - h[i - 1]),
mindp[i - 2] + abs(h[i] - h[i - 2]));
}
return ... | #include <bits/stdc++.h>
using namespace std;
int frog1dp(int h[], int n) {
int mindp[n + 1];
mindp[0] = 0;
mindp[1] = 0;
mindp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
mindp[i] = min(mindp[i - 1] + abs(h[i] - h[i - 1]),
mindp[i - 2] + abs(h[i] - h[i - 2]));
}
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"literal.string.change",
"call.arguments.change"
] | 951,841 | 951,842 | u844872846 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
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;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 951,843 | 951,844 | u700970062 | cpp |
p03160 | // I can't tell you what it really is,
// I can only tell you what it feels like.
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define F first
#define S second
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define fo(i, n) for (int i = 1; i <= n; ++i)
#define all(v) v.begin(), v.end()
#defin... | // I can't tell you what it really is,
// I can only tell you what it feels like.
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define F first
#define S second
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define fo(i, n) for (int i = 1; i <= n; ++i)
#define all(v) v.begin(), v.end()
#defin... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 951,847 | 951,848 | u450009898 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N, 10000);
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j == N)
break;
dp[i... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(N, 1000000000);
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= 2; j++) {
if (i + j == N)
break;
... | [
"literal.number.change",
"call.arguments.change"
] | 951,853 | 951,854 | u109489258 | cpp |
p03160 | #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld,... | #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld,... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,855 | 951,856 | u249899006 | cpp |
p03160 | #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld,... | #include "bits/stdc++.h" // template by Benq
using namespace std; // Debug template credit: Benq, ramchandra
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using ull = unsigned ll;
using pi = pair<ll, ll>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using pld = pair<ld,... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 951,857 | 951,856 | u249899006 | 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; // first stone
if (n > 1) // imp
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | #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];
long int dp[n];
dp[0] = 0; // first stone
if (n > 1) // imp
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr... | [
"variable_declaration.type.widen.change",
"call.add",
"call.arguments.change"
] | 951,858 | 951,859 | u997020717 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P... | [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 951,860 | 951,861 | u828388155 | cpp |
p03160 | #include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> dp(n, INT16_MAX);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i] + abs(h[i] - h... | #include <climits>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<long long> dp(n, 100000000000);
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i] + abs... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 951,862 | 951,863 | u110383054 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[101000];
int main() {
int n;
scanf("%d", &n);
vector<int> a(1 << n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {... | #include <bits/stdc++.h>
using namespace std;
int dp[101000];
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
... | [
"expression.operation.binary.remove"
] | 951,868 | 951,869 | u779663511 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[10001];
int main() {
int n;
scanf("%d", &n);
vector<int> a(1 << n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
... | #include <bits/stdc++.h>
using namespace std;
int dp[101000];
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
memset(dp, 0, sizeof dp);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
int op1 = INT_MAX, op2 = INT_MAX;
if (i >= 1) {
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove"
] | 951,870 | 951,869 | u779663511 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
vector<int> v(t);
for (int i = 0; i < t; ++i)
cin >> v[i];
int dp[t + 1];
dp[0] = 0;
dp[1] = v[1] - v[0];
for (int i = 2; i < t; ++i)
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i - 2] - v... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
vector<int> v(t);
for (int i = 0; i < t; ++i)
cin >> v[i];
int dp[t + 1];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < t; ++i)
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i - 2... | [
"call.add",
"call.arguments.change"
] | 951,871 | 951,872 | u843295336 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int input[n];
for (int i = 0; i < n; i++) {
cin >> input[i];
}
// 10, 30, 40, 20
// 0, 20, 30 30
int dp[n];
dp[0] = 0;
dp[1] = abs(input[2] - input[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(d... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int input[n];
for (int i = 0; i < n; i++) {
cin >> input[i];
}
// 10, 30, 40, 20
// 0, 20, 30 30
int dp[n + 1];
dp[0] = 0;
dp[1] = abs(input[1] - input[0]);
for (int i = 2; i < n; i++) {
dp[i] = m... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,873 | 951,874 | u982131228 | cpp |
p03160 | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int lon... | [
"expression.operation.binary.remove",
"assignment.add"
] | 951,875 | 951,876 | u314476982 | cpp |
p03160 | /*
Educational Dp Contest Atcoder
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbd... | /*
Educational Dp Contest Atcoder
*/
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbd... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 951,877 | 951,878 | u314476982 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#defi... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#defi... | [
"assignment.change"
] | 951,879 | 951,880 | u748931010 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#defi... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define mod 1000000007
#define dd double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#defi... | [
"expression.operation.binary.remove",
"assignment.change"
] | 951,881 | 951,880 | u748931010 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> &dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] == -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[... | #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> &dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] == -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 951,882 | 951,883 | u437546797 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] != -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[i... | #include <bits/stdc++.h>
using namespace std;
int minHeight(int arr[], vector<int> &dp, int index) {
int len = dp.size();
if (index >= len) {
return 0;
}
if (dp[index] == -1) {
int t1, t2;
dp[index] =
min(abs(arr[index] - arr[index - 1]) + minHeight(arr, dp, index - 1),
abs(arr[... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 951,884 | 951,883 | u437546797 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1], i, j;
for (i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
for (i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= 2 && (i + j) <= n; j++) {
dp[j] = min(dp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1], i, j;
for (i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
for (i = 0; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= 2 && (i + j) <= n; j++) {
dp[i + j] = mi... | [
"assignment.change"
] | 951,887 | 951,888 | u051694454 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int h[]) {
int dp[n] = {INT_MAX};
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
return dp[n - 1];
}
int main() {
int n;
c... | #include <bits/stdc++.h>
using namespace std;
int frog(int n, int h[]) {
int dp[n] = {INT_MAX};
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
return dp[n - 1];
}
int main() {
int n;
cin ... | [] | 951,891 | 951,892 | u103298438 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
//////////////////
#ifdef DEBUG
#include "debug.h"
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTIO... | #include <bits/stdc++.h>
using namespace std;
//////////////////
#ifdef DEBUG
#include "debug.h"
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTIO... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,893 | 951,894 | u592610268 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = height[1] - height[0];
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 1] - height[i - 3]) + dp[i - 2]));
}
return... | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = abs(height[1] - height[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 1] - height[i - 3]) + dp[i - 2]));
}
r... | [
"call.add",
"call.arguments.change"
] | 951,897 | 951,898 | u337524871 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = height[1] - height[0];
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 2] - height[i - 3]) + dp[i - 2]));
}
return... | #include <bits/stdc++.h>
using namespace std;
int minSteps(int height[], int n) {
int dp[100005] = {0};
dp[2] = abs(height[1] - height[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min((abs(height[i - 1] - height[i - 2]) + dp[i - 1]),
(abs(height[i - 1] - height[i - 3]) + dp[i - 2]));
}
r... | [
"call.add",
"call.arguments.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 951,899 | 951,898 | u337524871 | cpp |
p03160 | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b ... | #include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
ll mod(ll a, ll b) {
ll ret = a % b;
if (ret < 0)
ret += b;
return ret;
}
ll modpow(ll a, ll b, ll c) {
ll res = 1;
while (b ... | [
"call.add",
"call.arguments.change"
] | 951,902 | 951,903 | u201553784 | cpp |
p03160 | // Program.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frC(i, n) for (int i = 0; (i < (n)) && (c); ++i)
#define frA(i, a, n) for (int i = a; i <= (n); ++i)
#define frD(i, a, n) for (... | // Program.cpp
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define frC(i, n) for (int i = 0; (i < (n)) && (c); ++i)
#define frA(i, a, n) for (int i = a; i <= (n); ++i)
#define frD(i, a, n) for (... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 951,907 | 951,908 | u701566212 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 0; i < n; i++) {
dp[i] = min(dp[i - 1] + ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> as(n, 0);
for (auto &a : as)
cin >> a;
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(as[1] - as[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change"
] | 951,909 | 951,910 | u067151927 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e5 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j <... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j <... | [
"literal.number.change",
"expression.operation.binary.change"
] | 951,917 | 951,918 | u358973239 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e5 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j <... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j <... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 951,920 | 951,918 | u358973239 | cpp |
p03160 | #include "bits/stdc++.h"
#define ll long long
#define inf 1e9
using namespace std;
int main() {
ll n;
cin >> n;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n - 2; i++) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n) {
... | #include "bits/stdc++.h"
#define ll long long
#define inf 1e9
using namespace std;
int main() {
ll n;
cin >> n;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n) {
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 951,930 | 951,931 | u165543937 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
bool compare(string &a, string &b) { return a.length() > b.length(); }
void solve() {
int n;
cin >> n;
ll a[n];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> dp(n + 1);
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
... | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
bool compare(string &a, string &b) { return a.length() > b.length(); }
void solve() {
int n;
cin >> n;
ll a[n];
for (int i = 1; i <= n; i++)
cin >> a[i];
vector<ll> dp(n + 1);
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
... | [
"call.arguments.change",
"call.add"
] | 951,932 | 951,933 | u500482384 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int arr[100005];
int dp[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll mi = 0;
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 2] + abs(arr[i] -... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int arr[100005];
int dp[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
ll mi = 0;
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 2] + abs(arr[i] -... | [
"expression.operation.binary.add"
] | 951,934 | 951,935 | u500482384 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = arr[2] - arr[1];
for (int i = 3; i <= n; i++)
dp[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
if (n == 0 || n == 1)
cout << 0 << endl;
else {
int dp[n + 1];
dp[0] = 1, dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
... | [
"call.add",
"call.arguments.change"
] | 951,936 | 951,937 | u733347296 | 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];
memset(dp, 0, sizeof(dp));
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2... | #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];
memset(dp, 0, sizeof(dp));
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2... | [
"expression.operation.binary.add"
] | 951,942 | 951,943 | u696991379 | cpp |
p03160 | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
int main(void) {
int N;
cin >> N... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};
vector<vector<int>> graph;
bool sort_sec(const pair<int, int> &a, const pair<int, int> &b) {
if (a.second < b.second) {
return true;
}
return false;
}
int main(void) {
int N;
cin >> N... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change"
] | 951,944 | 951,945 | u150155436 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n];
vector<int> v(n);
for (auto &x : v)
cin >> x;
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 - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n];
vector<int> v(n);
for (auto &x : v)
cin >> x;
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 - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
c... | [
"expression.operation.binary.add"
] | 951,946 | 951,947 | u217317073 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
typedef pair<int, int> P;
signed main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N);
dp[0] = h[0];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int INF = 1e9 + 7;
typedef pair<int, int> P;
signed main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
... | [] | 951,948 | 951,949 | u237390401 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n;
cin >> n;
vector<long int> c(n, 0);
for (int i = 1; i < n; i++) {
cin >> c[i];
}
vector<long int> dp(n, 100000000);
dp[0] = 0;
dp[1] = abs(c[0]);
for (int i = 2; i < n; i++) {
if (dp[i - 1] + abs(c[i - 1] - c[i]) < d... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long int n;
cin >> n;
vector<long int> c(n, 0);
for (int i = 0; i < n; i++) {
cin >> c[i];
}
vector<long int> dp(n, 100000000);
dp[0] = 0;
dp[1] = abs(c[1] - c[0]);
for (int i = 2; i < n; i++) {
if (dp[i - 1] + abs(c[i - 1] - c[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.change"
] | 951,956 | 951,957 | u632118923 | cpp |
p03160 | #include <iostream>
#define inf 1e9
using namespace std;
int solve(int arr[], int n) {
int dp[n + 1]; // minimum cost to reach the ith stone
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(arr[i] - arr[i - 1] + dp[i - 1]);
int option2 = (i == 2) ? inf : abs(arr[i] - arr[i - 2] + dp[i - 2]);
... | #include <iostream>
#define inf 1e9
using namespace std;
int solve(int arr[], int n) {
int dp[n + 1]; // minimum cost to reach the ith stone
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(arr[i] - arr[i - 1]) + dp[i - 1];
int option2 = (i == 2) ? inf : abs(arr[i] - arr[i - 2]) + dp[i - 2];
... | [
"call.arguments.change"
] | 951,958 | 951,959 | u189511022 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int n;
vector<int> h;
int dp[100001];
int v[100001];
int s1(int i) {
if (i == n - 1) {
return abs(h[n] - h[i]);
}
if (i == n - 2) {
return min(abs(h[n] - h[n - 2]),
abs(h[n - 1] - h[n - 2]) + abs(h[n... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int n;
vector<int> h;
int dp[100001];
int v[100001];
int s1(int i) {
if (i == n - 1) {
return abs(h[n] - h[i]);
}
if (i == n - 2) {
return min(
abs(h[n] - h[n - 2]),
abs(h[n] - h[n - 1]) +
... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 951,962 | 951,963 | u976563729 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = v[1] - v[0];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(v[1] - v[0... | [
"call.add",
"call.arguments.change"
] | 951,968 | 951,969 | u109156113 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = v[1] - v[0];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(v[1] - v[0... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 951,970 | 951,969 | u109156113 | cpp |
p03160 | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | /*
___mennat khoday ra azz o va jall ke taatash mojebe ghorbat ast o be shokr
andarash mazide nemat.
___har nafasi ke foro miravad momedde hayatast o chon bar miayad mofarrahe zat.
___pas dar har nafasi 2 nemat mojod ast o bar har nematy shokry vajeb.
___az dast o zabane ke barayad ?
___kaz ohdeye shokrash be dar ayad... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 951,971 | 951,972 | u232873057 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int p = 0;
int q = arr[1] - arr[0];
for (int i = 2; i < N; i++) {
int temp = min(abs(arr[i] - arr[i - 2]) + p, abs(arr[i] - arr[i - 1]) + q);
p = q;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int p = 0;
int q = abs(arr[1] - arr[0]);
for (int i = 2; i < N; i++) {
int temp = min(abs(arr[i] - arr[i - 2]) + p, abs(arr[i] - arr[i - 1]) + q);
p... | [
"call.add",
"call.arguments.change"
] | 951,973 | 951,974 | u259733964 | cpp |
p03160 | #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;
#define ordered_set \
tree<ll, null_type, less_equal<ll>, rb_tree_tag, \
... | #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;
#define ordered_set \
tree<ll, null_type, less_equal<ll>, rb_tree_tag, \
... | [] | 951,977 | 951,978 | u206663422 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
long a = 0, b = abs(arr[1] - arr[0]), c;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;... | #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];
}
long a = 0, b = abs(arr[1] - arr[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 951,979 | 951,980 | u653611614 | 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];
}
long a = 0, b = abs(arr[1] - arr[0]), c;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
... | #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];
}
long a = 0, b = abs(arr[1] - arr[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b =... | [
"variable_declaration.value.change"
] | 951,981 | 951,980 | u653611614 | 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 a = 0, b = abs(arr[1] - arr[0]), c;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b = c;
... | #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];
}
long a = 0, b = abs(arr[1] - arr[0]), c = b;
for (int i = 2; i < n; i++) {
c = min(a + abs(arr[i] - arr[i - 2]), b + abs(arr[i] - arr[i - 1]));
a = b;
b =... | [
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 951,982 | 951,980 | u653611614 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll a[200005];
ll b[200005];
ll h[200005];
ll dp[200005];
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = h[0];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll a[200005];
ll b[200005];
ll h[200005];
ll dp[200005];
typedef pair<int, int> P;
int main() {
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp... | [] | 951,994 | 951,995 | u077051605 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int a[1000000];
int getans(int i, int n) {
if (i == 0) {
return dp[i] = 0;
}
if (dp[i] != -1) {
return dp[i];
}
int cost = abs(a[i] - a[i + 1]) + getans(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + getans(i + ... | #include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int a[1000000];
int getans(int i, int n) {
if (i == n) {
return dp[i] = 0;
}
if (dp[i] != -1) {
return dp[i];
}
int cost = abs(a[i] - a[i + 1]) + getans(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + getans(i + ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 951,998 | 951,999 | u181739580 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 952,007 | 952,008 | u845142924 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 3; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(v[i]... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vector<ll> dp(n, 0);
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(v[i]... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,009 | 952,010 | u192243254 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i ... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i ... | [
"call.add",
"call.arguments.change"
] | 952,015 | 952,016 | u296160120 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (auto &i : arr)
cin >> i;
vector<int> ans(n);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ans[i] = min(abs(arr[i] - arr[i - 1]) + ans[i - 1],
ans[i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (auto &i : arr)
cin >> i;
vector<int> ans(n);
ans[0] = 0;
ans[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
ans[i] = min(abs(arr[i] - arr[i - 1]) + ans[i - 1],
ans[i - ... | [
"identifier.change",
"io.output.change"
] | 952,019 | 952,020 | u756206025 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> st(n);
vector<int> cost(n, 0);
for (int i = 0; i < n; i++) {
cin >> st[i];
}
cost[0] = 0;
cost[1] = abs(st[1] - st[0]);
for (int i = 2; i < n; i++) {
cost[i] = min(cost[i - 1] + abs(st[i] - st[i - 1]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> st(n);
vector<int> cost(n, 0);
for (int i = 0; i < n; i++) {
cin >> st[i];
}
cost[0] = 0;
cost[1] = abs(st[1] - st[0]);
for (int i = 2; i < n; i++) {
cost[i] = min(cost[i - 1] + abs(st[i] - st[i - 1]),
... | [] | 952,021 | 952,022 | u047452604 | cpp |
p03160 | // Lets go to the next level
// AIM CM at CF *__* asap
// Hit A,B,C and D faster and reach Candidate Master
// Remember you were also a novice when you started,
// hence never be rude to anyone who wants to learn something
// Never open a ranklist untill and unless you are done with solving problems,
// wastes 3/4 minu... | #include <bits/stdc++.h>
using namespace std;
#define mod (int)1000000007
#define MOD (int)10000000007
// Big two primes
#define X 1001100011100001111ll
#define M 26388279066623ll
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for0e(i, n) for (int i = 0; i <= n; i++)
#define fo... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 952,025 | 952,026 | u923715191 | cpp |
p03160 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int i, j, n, m, dp;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int mod(int a) {
if (a < 0)
return a * (-1);
return a;
}
int steps(int *A, int n, int N)... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int i, j, n, m, dp;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int mod(int a) {
if (a < 0)
return a * (-1);
return a;
}
int steps(int *A, int n, int N)... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 952,027 | 952,028 | u245521778 | cpp |
p03160 | /*input
4
10 30 40 20
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
... | /*input
2
10 10
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#inclu... | [] | 952,032 | 952,033 | u751790772 | cpp |
p03160 | #include <stdio.h>
int abs(int);
int min(int, int);
void output(int, int *);
int main() {
int n;
int h[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
int dp[100000] = {};
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++) {
if (i == 0) {
dp[... | #include <stdio.h>
int abs(int);
int min(int, int);
void output(int, int *);
int main() {
int n;
int h[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
int dp[100000] = {};
for (int i = 0; i < n; i++)
dp[i] = -1;
for (int i = 0; i < n; i++) {
if (i == 0) {
dp[... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,036 | 952,037 | u691912637 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change",
"literal.number.change",
"io.output.change"
] | 952,038 | 952,039 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"io.output.change"
] | 952,040 | 952,039 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | [
"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"
] | 952,038 | 952,041 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | #include <bits/stdc++.h>
using namespace std;
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int dp[1000... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,040 | 952,041 | u987745066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pub(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define getl(s) getline(cin, s);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define mod 1000000007
#define pub(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define getl(s) getline(cin, s);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >>... | [
"assignment.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,042 | 952,043 | u142335552 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[... | #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,046 | 952,047 | u370304992 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = arr[2] - arr[1];
for (int i = 2; i <= n; i++) {
dp[i] = min(dp[i - 1... | #include <bits/stdc++.h>
using namespace std;
int dp[100001] = {}, arr[100001] = {};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0, dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[... | [
"call.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,048 | 952,047 | u370304992 | cpp |
p03160 | /** "Ever tried.
Ever failed.
No matter.
Try Again.
Fail again.
Fail better.**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define o... | /** "Ever tried.
Ever failed.
No matter.
Try Again.
Fail again.
Fail better.**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define endl "\n"
#define o... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,049 | 952,050 | u973466769 | cpp |
p03160 | #include <cmath>
#include <iostream>
#define INF 2147483637
int main() {
int n;
int d[100005] = {INF};
int h[100005] = {0};
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::cin >> h[i];
}
d[2] = abs(h[1] - h[2]);
d[1] = 0;
for (int i = 2; i <= n; i++) {
d[i] = std::min(d[i - 1] + std::abs... | #include <cmath>
#include <iostream>
#define INF 2147483637
int main() {
int n;
int d[100005] = {INF};
int h[100005] = {0};
std::cin >> n;
for (int i = 1; i <= n; i++) {
std::cin >> h[i];
}
d[2] = abs(h[1] - h[2]);
d[1] = 0;
for (int i = 3; i <= n; i++) {
d[i] = std::min(d[i - 1] + std::abs... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,055 | 952,056 | u708220166 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int h[100010] = {0}, d[100010] = {0}, n;
cin >> n;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int h[100010] = {0}, d[100010] = {0}, n;
cin >> n;... | [
"call.add",
"call.arguments.change"
] | 952,057 | 952,058 | u916678430 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
dp[0] = 0;
for (int i = 0; i <= n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,079 | 952,080 | u395808707 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
dp[0] = 0;
for (int i = 0; i <= n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int height[n + 1];
for (int i = 0; i < n; i++) {
cin >> height[i];
}
vector<int> dp(n + 2, 1e9);
dp[0] = 0;
for (int i = 0; i <= n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[... | [] | 952,081 | 952,080 | u395808707 | cpp |
p03160 | #include "bits/stdc++.h"
using namespace std;
#define ub upper_bound
#define sum(a) accumulate(all(a), 0ll)
#define lb lower_bound
#define all(v) begin(v), end(v)
#define allr(v) rbegin(v), rend(v)
#define sort_dec(v) sort(all(v), [](auto e1, auto e2) { return e1 > e2; })
#define For(n) for (ll i = 0; i < n; i++)
#def... | #include "bits/stdc++.h"
using namespace std;
#define ub upper_bound
#define sum(a) accumulate(all(a), 0ll)
#define lb lower_bound
#define all(v) begin(v), end(v)
#define allr(v) rbegin(v), rend(v)
#define sort_dec(v) sort(all(v), [](auto e1, auto e2) { return e1 > e2; })
#define For(n) for (ll i = 0; i < n; i++)
#def... | [] | 952,085 | 952,086 | u689408308 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i... | #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];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)... | [
"assignment.change"
] | 952,087 | 952,088 | u510784445 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = a[1] - a[0];
for (int i = 2; i < n;... | #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];
}
if (n == 0)
cout << 0;
else if (n == 1)
cout << abs(a[1] - a[0]);
else {
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)... | [
"call.add",
"call.arguments.change"
] | 952,089 | 952,088 | u510784445 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int d[n];
for (int i = 0; i < n; i++)
d[i] = 10001;
d[0] = 0;
for (int i = 0; i < n; i++) {
int j = i + 1;
int k = i + 2;
if (j < n)
d[j] = min(d[j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int d[n];
for (int i = 0; i < n; i++)
d[i] = 1e9 + 5;
d[0] = 0;
for (int i = 0; i < n; i++) {
int j = i + 1;
int k = i + 2;
if (j < n)
d[j] = min(d... | [
"literal.number.change",
"assignment.value.change",
"assignment.change"
] | 952,090 | 952,091 | u001462978 | cpp |
p03160 | // Abhinav ---IIIT_A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < (int)n; ++i)
#define vpii vector<pair<int, int>>
#define vi vector<int>
#define mpii map<pair<int, int>, int>
#de... | // Abhinav ---IIIT_A
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < (int)n; ++i)
#define vpii vector<pair<int, int>>
#define vi vector<int>
#define mpii map<pair<int, int>, int>
#de... | [
"literal.number.change",
"variable_declaration.value.change"
] | 952,092 | 952,093 | u587202199 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2... | [
"identifier.change",
"io.output.change"
] | 952,098 | 952,099 | u323531048 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> score(N);
score[0] = 0;
score[1] = abs(h[1] - h[0]) + score[0];
for (int i = 2; i < N; i++) {
score[i] = min(score[i - 2] + abs(h[i] - h[i - 2... | [
"identifier.change",
"io.output.change"
] | 952,100 | 952,099 | u323531048 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
void debug() { cout << endl; }
template <typename T, typename... Args> void debug(T x, Args... args) {
cout << x << " ";
debug(args...);
}
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef l... | #include <bits/stdc++.h>
using namespace std;
void debug() { cout << endl; }
template <typename T, typename... Args> void debug(T x, Args... args) {
cout << x << " ";
debug(args...);
}
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define pb push_back
#define F first
#define S second
#define endl "\n"
typedef l... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,106 | 952,107 | u921552251 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {(int)1e9};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 3; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) +... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {(int)1e9};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) +... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,108 | 952,109 | u846964991 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {0};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) + dp[i -... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ht[n + 1] = {(int)1e9};
for (int i = 1; i <= n; i++)
cin >> ht[i];
int dp[n + 2] = {0};
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = min(abs(ht[i] - ht[i - 1]) + dp[i - 1],
abs(ht[i] - ht[i - 2]) +... | [
"type_conversion.add"
] | 952,110 | 952,109 | u846964991 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int func(int i, int ht[], int dp[]) {
if (i == 1)
return 0;
if (i < 1)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
int pos1 = abs(ht[i] - ht[i - 1]) + func(i - 1, ht, dp);
int pos2 = abs(ht[i] - ht[i - 2]) + func(i - 2, ht, dp);
return dp[i] = min... | #include <bits/stdc++.h>
using namespace std;
int func(int i, int ht[], int dp[]) {
if (i == 1)
return 0;
if (i < 1)
return 1e9;
if (dp[i] != -1)
return dp[i];
int pos1 = abs(ht[i] - ht[i - 1]) + func(i - 1, ht, dp);
int pos2 = abs(ht[i] - ht[i - 2]) + func(i - 2, ht, dp);
return dp[i] = min(pos... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 952,111 | 952,112 | u846964991 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i, n) for (int i = 1; i <= n; i++)
#define RED(i, n) for (int i = n; i > 0; i--)
#define REPS(i, n) for (int i = 1; (i * i) <= n; i++)
#de... | [] | 952,113 | 952,114 | u463602788 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define NIL 0
#define INF 1e18
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define pb push_back
#define F first
#define S second
#d... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define NIL 0
#define INF 1e18
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define pb push_back
#define F first
#define S second
#d... | [
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 952,115 | 952,116 | u695206817 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] +... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] +... | [
"expression.operation.binary.add"
] | 952,117 | 952,118 | u695206817 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#define ll long long
#define pb push_back
#define vi vector<int>
#define si set<int>
#define msi multiset<int>
#define vll vector<ll>
#define ff first
#define ss second
#define pii pair<int, int>
#define mp make_pair
#define all(a) a.begin(), a.end()
#defin... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#define ll long long
#define pb push_back
#define vi vector<int>
#define si set<int>
#define msi multiset<int>
#define vll vector<ll>
#define ff first
#define ss second
#define pii pair<int, int>
#define mp make_pair
#define all(a) a.begin(), a.end()
#defin... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 952,121 | 952,122 | u099821811 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int array[n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(array[1] - array[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(array[i] - array[i - 1]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int array[n];
for (int i = 0; i < n; i++) {
cin >> array[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(array[1] - array[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(array[i] - array[i - 1]),
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 952,123 | 952,124 | u213987341 | cpp |
p03160 | #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>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
vector<int> h(... | #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>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
ve... | [] | 952,130 | 952,131 | u005006157 | cpp |
p03160 | #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>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #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>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"expression.operation.binary.add"
] | 952,132 | 952,133 | u005006157 | cpp |
p03160 | #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>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | #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>;
int INF = 1001001001;
int n;
vector<int> h(100010);
vector<int> dp(100010);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
... | [
"variable_declaration.add"
] | 952,134 | 952,133 | u005006157 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, h[100000], dp[100000];
cin >> n;
for (int i = 1; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 2]) + dp[i - 2], abs(h[i] - h[i - 1]) + dp[... | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n, h[100000], dp[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 2]) + dp[i - 2], abs(h[i] - h[i - 1]) + dp[... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,135 | 952,136 | u899084195 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.