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 | // In the Name of God
#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> dp(n);
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
for (int i = 3; i < n; i++)
dp[i] = min((dp[i - 1] + abs(h[i] - h[i - 1])),
... | // In the Name of God
#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> dp(n);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++)
dp[i] = min((dp[i - 1] + abs(h[i] - h[i - 1])),
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,484 | 952,483 | u566183836 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n], count[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
count[0] = 0;
count[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
count[i] = min((abs(arr[i - 1] - arr[i]) + count[i -... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n], count[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
count[0] = 0;
count[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
count[i] = min((abs(arr[i - 1] - arr[i]) + count[i -... | [
"expression.operation.binary.add"
] | 952,485 | 952,486 | u566183836 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
// typedef vector<... | [
"control_flow.branch.if.add"
] | 952,489 | 952,490 | u493750228 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,491 | 952,492 | u493750228 | cpp |
p03160 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,493 | 952,492 | u493750228 | cpp |
p03160 | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>... | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <ext/pb_ds/assoc_container.hpp>
#include <vector>
#define str string
#define dbl double
#define ll long long int
#define ull unsigned long long int
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,507 | 952,508 | u721374917 | 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];
}
long long int max[n];
max[0] = 0;
max[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i - 1]... | #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];
}
long long int max[n];
max[0] = 0;
max[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i... | [
"call.add",
"call.arguments.change"
] | 952,513 | 952,514 | u219874809 | 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 max[n];
max[0] = 0;
max[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i - 1] + abs(a[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];
}
long long int max[n];
max[0] = 0;
max[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
max[i] = min(max[i - 2] + abs(a[i] - a[i - 2]),
max[i... | [
"variable_declaration.type.widen.change",
"call.add",
"call.arguments.change"
] | 952,515 | 952,514 | u219874809 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,516 | 952,517 | u070400236 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define RI(i, n) FOR(i, 1, (n))
#define REP(i, n) FOR(i, 0, (n)-1)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int)w.... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,518 | 952,517 | u070400236 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(long int n, int h[]) {
int dp[n + 1] = {0}, i;
for (i = 2; i <= n; i++) {
int op1 = abs(dp[i] - dp[i - 1]) + dp[i - 1];
int op2 = i == 2 ? pow(10, 9) : abs(dp[i] - dp[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
int frog(long int n, int h[]) {
int dp[n + 1] = {0}, i;
for (i = 2; i <= n; i++) {
int op1 = abs(h[i] - h[i - 1]) + dp[i - 1];
int op2 = i == 2 ? pow(10, 9) : abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int main() {
lon... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,531 | 952,532 | u805280969 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n], dp[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a[n], dp[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,534 | 952,535 | u928828066 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
int n;
int arr[N + 1];
int dp[N + 1];
int rec(int i) {
if (i >= n) {
return 0;
}
int &ret = dp[i];
if (ret != -1) {
return ret;
}
ret = 10000;
if (i + 1 <= n) {
ret = min(ret, rec(i + 1) + abs(arr[i + 1] - ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5;
int n;
int arr[N + 1];
int dp[N + 1];
int rec(int i) {
if (i >= n) {
return 0;
}
int &ret = dp[i];
if (ret != -1) {
return ret;
}
ret = 1e9;
if (i + 1 <= n) {
ret = min(ret, rec(i + 1) + abs(arr[i + 1] - ar... | [
"literal.number.change",
"assignment.value.change"
] | 952,536 | 952,537 | u480304423 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define endl "\n"
#define fast \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"call.arguments.change",
"call.add"
] | 952,548 | 952,549 | u344378347 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 952,553 | 952,554 | u088630768 | cpp |
p03160 | // author - shreyanshjn (Shreyansh Jain)
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
/* #define input 1 */
#define... | // author - shreyanshjn (Shreyansh Jain)
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIS;
typedef vector<int> vec;
typedef priority_queue<int> PQ;
/* #define input 1 */
#define... | [
"call.add",
"call.arguments.change"
] | 952,560 | 952,561 | u829019938 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, s = 0, i;
cin >> n;
long long int a[n + 1], dp[n + 1];
a[0] = 0;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = 0;
s = 1;
for (i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]),... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, s = 0, i;
cin >> n;
long long int a[n + 1], dp[n + 1];
a[0] = 1000000000;
for (i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = 0;
s = 1;
for (i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a... | [
"literal.number.change",
"assignment.value.change"
] | 952,564 | 952,565 | u149925261 | cpp |
p03160 | #include <bits/stdc++.h>
#define MAX 100005
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char, char>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tr(container, it) \
for (typeof(... | #include <bits/stdc++.h>
#define MAX 100005
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char, char>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tr(container, it) \
for (typeof(... | [
"call.arguments.add",
"call.arguments.change"
] | 952,566 | 952,567 | u570992262 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define LP(_i, len) for (int _i = 0; _i < len; ++_i)
#define LP2(_i, _l, len) for (int _i = 0, _l = len; _i < _l; ++_i)
#define VLP(v, _itr, _end) \
for (auto _itr = v.begin(), _end... | #include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define LP(_i, len) for (int _i = 0; _i < len; ++_i)
#define LP2(_i, _l, len) for (int _i = 0, _l = len; _i < _l; ++_i)
#define VLP(v, _itr, _end) \
for (auto _itr = v.begin(), _end... | [] | 952,568 | 952,569 | u966647557 | cpp |
p03160 | // Author: Sayantanu
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod = 1e9 + 7;
#define INF 10001
int main() {
// code
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < ... | // Author: Sayantanu
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mod = 1e9 + 7;
#define INF INT_MAX
int main() {
// code
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i ... | [
"preprocessor.define.value.change"
] | 952,570 | 952,571 | u484628261 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog1(int *s, int n) {
int dp[100006];
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; i++) {
int op1 = abs(s[i] - s[i - 1]) + dp[i - 1];
int op2 = (i == 2) ? INT_MAX : abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int ma... | #include <bits/stdc++.h>
using namespace std;
int frog1(int *s, int n) {
int dp[100006];
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; i++) {
int op1 = abs(s[i] - s[i - 1]) + dp[i - 1];
int op2 = (i == 2) ? INT_MAX : abs(s[i] - s[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
return dp[n];
}
int ma... | [
"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,574 | 952,575 | u843286945 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int b[n + 1];
b[0] = 0;
b[1] = a[1] - a[0];
for (int i = 2; i < n; i++) //动态规划
{
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i - 2] + abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
int b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) //动态规划
{
b[i] =
min(b[i - 1] + abs(a[i] - a[i - 1]), b[i - 2] + ab... | [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 952,584 | 952,585 | u816631826 | cpp |
p03160 | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<ll, ll> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl... | #define __USE_MINGW_ANSI_STDIO
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long long ull;
typedef pair<ll, ll> ii;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((int)((v).size()))
#define endl... | [
"call.remove"
] | 952,586 | 952,587 | u816631826 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 3;
vector<ll> dp(N);
ll frog(int n, ll ht[]) {
dp[1] = 0;
dp[2] = ht[1] - ht[0];
for (int i = 3; i <= n; i++) {
dp[i] = min((dp[i - 1] + abs(ht[i - 1] - ht[i - 2])),
(dp[i - 2] + abs(ht[i - 1] - ht[i - 3])... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5 + 3;
vector<ll> dp(N);
ll frog(int n, ll ht[]) {
dp[1] = 0;
dp[2] = abs(ht[1] - ht[0]);
for (int i = 3; i <= n; i++) {
dp[i] = min((dp[i - 1] + abs(ht[i - 1] - ht[i - 2])),
(dp[i - 2] + abs(ht[i - 1] - ht[i ... | [
"call.add",
"call.arguments.change"
] | 952,594 | 952,595 | u043995126 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int q[n + 2];
for (int i = 1; i <= n; i++)
cin >> q[i];
int dp[n + 2];
dp[1] = q[1];
dp[2] = abs(q[1] - q[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(q[i] - q[i - 1]), dp[i - 2] + abs(q[i] - q[i... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int q[n + 2];
for (int i = 1; i <= n; i++)
cin >> q[i];
int dp[n + 2];
dp[1] = 0;
dp[2] = abs(q[1] - q[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(q[i] - q[i - 1]), dp[i - 2] + abs(q[i] - q[i - ... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,596 | 952,597 | u030094335 | cpp |
p03160 | #include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define INF (ll)1e9 // 10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9 + 7) // 10^9+7:合同式の法
#define PI 3.141592653589
#define PB push... | #include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define INF (ll)1e9 // 10^9:∞
#define LLINF (ll)1e12
#define MOD (ll)(1e9 + 7) // 10^9+7:合同式の法
#define PI 3.141592653589
#define PB push... | [
"call.add",
"call.arguments.change"
] | 952,601 | 952,602 | u345693891 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int ans;
int frog(int *a, int i, int n, int *dp) {
// base condition
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
if (i + 1 <= n - 1) {
ans = int(abs(a[i] - a[i + 1])) + frog(a, i + 1, n, dp);
}
if (i + 2 <= n - 1) {
ans = min(ans, in... | #include <bits/stdc++.h>
using namespace std;
int ans;
int frog(int *a, int i, int n, int *dp) {
// base condition
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
if (i + 1 <= n - 1) {
ans = int(abs(a[i] - a[i + 1])) + frog(a, i + 1, n, dp);
}
if (i + 2 <= n - 1) {
ans = min(ans, in... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,606 | 952,607 | u279460160 | cpp |
p03160 | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bits/stdc++.h>
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー... | //コンパイラ最適化用
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
//インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bits/stdc++.h>
#include <bitset> //固定長bit集合
#include <chrono> //実行時間計測
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,608 | 952,609 | u725137652 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<int> dp(N);
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
if (i - 2 >= 1) {
dp.at(i) = min(dp.at(i - 2) + abs(a.at(i) - a.at(i - 2)),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<int> dp(N);
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
if (i - 2 >= 0) {
dp.at(i) = min(dp.at(i - 2) + abs(a.at(i) - a.at(i - 2)),
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,618 | 952,619 | u120586196 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &arr, int n) {
int pre1 = abs(arr[1] - arr[0]), pre2 = 0, ans;
for (int i = 2; i < n; i++) {
ans = min(abs(arr[i] - arr[i - 1]) + pre1, abs(arr[i] - arr[i - 2]) + pre2);
pre2 = pre1;
pre1 = ans;
}
return ans;
}
int main() {
ios_ba... | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &arr, int n) {
int pre1 = abs(arr[1] - arr[0]), pre2 = 0, ans = pre1;
for (int i = 2; i < n; i++) {
ans = min(abs(arr[i] - arr[i - 1]) + pre1, abs(arr[i] - arr[i - 2]) + pre2);
pre2 = pre1;
pre1 = ans;
}
return ans;
}
int main() {
... | [
"variable_declaration.value.change"
] | 952,623 | 952,624 | u462253237 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
int dp[100000];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
}
d... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(100000);
int dp[100000];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
... | [] | 952,627 | 952,628 | u514896542 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
int dp[n];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
}
dp[0] ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(100000);
int dp[100000];
REP(i, n) {
cin >> h[i];
dp[i] = 0;
... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 952,629 | 952,628 | u514896542 | cpp |
p03160 | #include <algorithm>
#include <iostream>
using namespace std;
int dp[100005];
int arr[100005];
int main() {
int n;
cin >> n;
// int arr[n];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
dp[1] = 0;
dp[2] = abs(dp[1] - dp[2]);
for (int i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - a... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[100005];
int arr[100005];
int main() {
int n;
cin >> n;
// int arr[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[i] = min(dp[i - 1] + abs(arr[i] -... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,630 | 952,631 | u602011181 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define MOD 998244353
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define t() ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
#define MOD 998244353
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define t() ... | [
"call.add",
"call.arguments.change"
] | 952,634 | 952,635 | u510279772 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | [] | 952,636 | 952,637 | u147886643 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,638 | 952,639 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,640 | 952,641 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,642 | 952,641 | u109191542 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,643 | 952,641 | u109191542 | 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, 100000);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j]... | #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, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j... | [
"call.arguments.change",
"io.output.change"
] | 952,644 | 952,645 | u480703661 | 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, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j... | #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, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j... | [
"io.output.change"
] | 952,646 | 952,645 | u480703661 | 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, 10000);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j],... | #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, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = std::min(dp[j... | [
"call.arguments.change",
"io.output.change"
] | 952,647 | 952,645 | u480703661 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
}
int ans[n];
ans[0] = 0;
ans[1] = ar[1] - ar[0];
for (int i = 2; i < n; ++i) {
ans[i] = min(ans[i - 2] + abs(ar[i] - ar... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; ++i) {
cin >> ar[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(ar[1] - ar[0]);
for (int i = 2; i < n; ++i) {
ans[i] = min(ans[i - 2] + abs(ar[i]... | [
"call.add",
"call.arguments.change"
] | 952,659 | 952,660 | u187940414 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < ... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,665 | 952,666 | u983563612 | cpp |
p03160 | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (auto &e : v)
cin >> e;
vector<int> dp(n, 1e5 + 7);
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 <climits>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
for (auto &e : v)
cin >> e;
vector<int> dp(n, 1e9 + 5);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,673 | 952,674 | u045815849 | cpp |
p03160 | /* Author- Abhijeet Trigunait */
#include <bits/stdc++.h>
#define lld long long int
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
#define mod 1e9 + 7
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define gcd(x, y) __gcd(x, y)
#define endl '\n'
using... | /* Author- Abhijeet Trigunait */
#include <bits/stdc++.h>
#define lld long long int
#define F first
#define S second
#define P pair<int, int>
#define pb push_back
#define mod 1e9 + 7
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define gcd(x, y) __gcd(x, y)
#define endl '\n'
using... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,680 | 952,681 | u930295008 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of functio... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize( \
"-fno-defer-pop") // to pop argument of functio... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,690 | 952,691 | u838261804 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int count(int n, vector<int> &a) {
int i;
vector<int> dp;
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if (n > 1) {
for (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]));
}
return dp[n - 1]... | #include <bits/stdc++.h>
using namespace std;
int count(int n, vector<int> &a) {
int i;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
if (n > 1) {
for (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]));
}
return dp[n -... | [] | 952,692 | 952,693 | u551907439 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<long long int>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [] | 952,696 | 952,697 | u709648815 | cpp |
p03160 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int T = 0; T < t; T++) {
ll n, ans = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cost[n +... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for (int T = 0; T < t; T++) {
ll n, ans = 0;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll cost[n +... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,700 | 952,701 | u354088598 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll go(vector<ll> arr, int k = 2) {
int n = arr.size();
vector<ll> dp(n, LLONG_MAX);
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i + 1; j <= min(n - 1, i + k); j++)
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll go(vector<ll> arr, int k = 2) {
int n = arr.size();
vector<ll> dp(n, LLONG_MAX);
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--)
for (int j = i + 1; j <= min(n - 1, i + k); j++)
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
... | [
"expression.operation.binary.remove"
] | 952,704 | 952,705 | u869501185 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx], visitado[maxx];
vector<int> peso;
int solve(int k) {
// cout << visitado[k] << " k " << k << " dp[k] " << dp[k] << endl;
if (k == 0)
return 0;
if (k == 1)
return dp[1] = abs(pe... | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx], visitado[maxx];
vector<int> peso;
int solve(int k) {
// cout << visitado[k] << " k " << k << " dp[k] " << dp[k] << endl;
if (k == 0)
return 0;
if (k == 1)
return dp[1] = abs(pe... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,708 | 952,709 | u124853339 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx];
vector<int> peso;
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < n; i++) {
cin >> n;
peso.push_back(n);
}
dp[0] = 0;
dp[1] = dp[0] + abs(peso[0] - peso[1]);
f... | #include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx];
vector<int> peso;
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < x; i++) {
cin >> n;
peso.push_back(n);
}
dp[0] = 0;
dp[1] = dp[0] + abs(peso[0] - peso[1]);
f... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,710 | 952,711 | u124853339 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int dp[N + 100];
for (int i = 0; i < N + 100; i++)
dp[i] = 1000000;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (dp[i] > dp[i -... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
int dp[N + 100];
for (int i = 0; i < N + 100; i++)
dp[i] = 10000000000;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
if (dp[i] > dp... | [
"literal.number.change",
"assignment.value.change"
] | 952,718 | 952,719 | u311671153 | cpp |
p03160 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,722 | 952,723 | u428805520 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *dp = new int[n];
for (int i = 0; i < n; i++)
cin >> a[i];
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... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *a = new int[n];
int *dp = new int[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]... | [
"call.add",
"call.arguments.change"
] | 952,730 | 952,731 | u638369926 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
long long dp[100010];
int main() {
int N, K;
int h[100015];
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
dp[i] = ... | #include <bits/stdc++.h>
using namespace std;
long long dp[100010];
int main() {
int N, K;
int h[100015];
cin >> N;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < 100010; ++i)
dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
dp[i] = min(d... | [
"expression.operation.binary.remove"
] | 952,732 | 952,733 | u530497183 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int x(int arr[], int dp[], int n) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// cout<<arr[i];
dp[i] += min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
}
return dp[n - 1];
}
int... | #include <bits/stdc++.h>
using namespace std;
int x(int arr[], int dp[], int n) {
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
// cout<<arr[i];
dp[i] += min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
// cout<<dp[i]<<" ";
}
... | [
"variable_declaration.value.change"
] | 952,734 | 952,735 | u802332845 | cpp |
p03160 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int... | [
"call.remove"
] | 952,738 | 952,739 | u755357342 | cpp |
p03160 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2 * 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 10;
void printVector(vector<int> s) {
for (int &x : s) {
cout << x << " ";
}
cout << endl;
}
void solve() {
int n;
cin >> n;
vector<int> h(n + 1);
for (int... | [
"call.add",
"call.arguments.change"
] | 952,740 | 952,739 | u755357342 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int fun(int arr[], int n) {
vector<int> dp(n - 1, 0);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (int i = 3; i < n; i++)
dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]),
dp[i - 1] + abs(arr[i - 1] - arr[i]));
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int fun(int arr[], int n) {
vector<int> dp(n, 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 - 2] - arr[i]),
dp[i - 1] + abs(arr[i - 1] - arr[i]));
re... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,741 | 952,742 | u458177232 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
long long N;
cin >> N;
vector<int> h(N);
rep(i, N) { cin >> h[i]; }
vector<long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
long long N;
cin >> N;
vector<long long> h(N);
rep(i, N) { cin >> h[i]; }
vecto... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"call.arguments.change"
] | 952,747 | 952,748 | u422665026 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vv;
#define pb push_back
#define MOD 1000000007
#define INF 1000000000
#define endl '\n'
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
//#ifndef ONL... | #include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef vector<ll> vl;
typedef vector<vl> vv;
#define pb push_back
#define MOD 1000000007
#define INF 1000000000
#define endl '\n'
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
fast();
//#ifndef ONL... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 952,749 | 952,750 | u727230235 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> height[i];
}
vector<int> dp(n + 1);
dp[1] = 0;
dp[2] = height[2] - height[1];
for (int i = 3; i <= n; ++i) {
dp[i] = min(dp[i - 1] + abs(height[i] - h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> height(n + 1, 0);
for (int i = 1; i <= n; ++i) {
cin >> height[i];
}
vector<int> dp(n + 1);
dp[1] = 0;
dp[2] = abs(height[2] - height[1]);
for (int i = 3; i <= n; ++i) {
dp[i] = min(dp[i - 1] + abs(height[i... | [
"call.add",
"call.arguments.change"
] | 952,753 | 952,754 | u478140358 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "0" << endl;
return 0;
}
vector<int> v(n);
for (int &x : v)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
max(dp[i - 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "0" << endl;
return 0;
}
vector<int> v(n);
for (int &x : v)
cin >> x;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 952,757 | 952,758 | u275883197 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#def... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#def... | [
"call.arguments.change"
] | 952,764 | 952,765 | u654115954 | cpp |
p03160 | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) f... | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) f... | [
"call.arguments.change"
] | 952,767 | 952,768 | u555748940 | cpp |
p03160 | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) f... | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 952,769 | 952,768 | u555748940 | cpp |
p03160 | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) f... | // Sha3ban_El-Bay
#include <bits/stdc++.h>
using namespace std;
//======================================================
#define El_Bay \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define forn(i, n) f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 952,770 | 952,768 | u555748940 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll lo... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll lo... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 952,772 | 952,773 | u296273488 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define rev(i, n) for (int i = n; i >= 0; i--)
#define rep_a(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
#define fast ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,774 | 952,775 | u296273488 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
dp[n - 2] = abs(v[n - 2] - v[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MAX... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
if (n == 1)
return 0;
vector<int> dp(n, 0);
dp[n - 2] = abs(v[n - 2] - v[n - 1]);
for (int i = n - 3; i >= 0; i--) {
dp[i] = INT_MAX... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 952,780 | 952,781 | u845776743 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"expression.operation.binary.remove"
] | 952,784 | 952,785 | u832995587 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
//最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000001;
const long long LINF = 1e18;
const int MAX = 510000;
//出力系
#define print(x) cout << x << endl
#... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,786 | 952,785 | u832995587 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int a[50], arr[50], n;
int topdown(int x);
int main() {
int ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
a[i] = -1;
}
ans = topdown(0);
cout << ans;
return 0;
}
int topdown(int x) {
if (a... | #include <cmath>
#include <iostream>
using namespace std;
int a[100000], arr[100000], n;
int topdown(int x);
int main() {
int ans;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
a[i] = -1;
}
ans = topdown(0);
cout << ans;
return 0;
}
int topdown(int x) {... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,787 | 952,788 | u538813479 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
vector<int> v, dp;
void solve() {
int n;
cin >> n;
dp.resize(n, -1);
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
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]... | #include <bits/stdc++.h>
using namespace std;
vector<int> v, dp;
void solve() {
int n;
cin >> n;
dp.resize(n, -1);
v.resize(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
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]... | [] | 952,791 | 952,792 | u053551549 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[100000] = {0};
ll dp[100000] = {0};
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[100000] = {0};
ll dp[100000] = {0};
ll n;
cin >> 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] ... | [] | 952,793 | 952,794 | u360668137 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[10000] = {0};
ll dp[10000] = {0};
ll n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i]... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll a[100000] = {0};
ll dp[100000] = {0};
ll n;
cin >> 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] ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,795 | 952,794 | u360668137 | 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",
"control_flow.branch.if.condition.change"
] | 952,802 | 952,803 | u692550512 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void calc(vector<int> A) {
vector<int> dp(A.size());
dp[0] = 0;
dp[1] = A[1] - A[0];
for (auto i = 2; i < dp.size(); i++) {
dp[i] =
min(abs(A[i] - A[i - 1]) + dp[i - 1], abs(A[i] - A[i - 2]) + dp[i ... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void calc(vector<int> A) {
vector<int> dp(A.size());
dp[0] = 0;
dp[1] = abs(A[1] - A[0]);
for (auto i = 2; i < dp.size(); i++) {
dp[i] =
min(abs(A[i] - A[i - 1]) + dp[i - 1], abs(A[i] - A[i - 2]) + ... | [
"call.add",
"call.arguments.change"
] | 952,806 | 952,807 | u848936919 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#define aut(r, v) for (auto r : v)
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define reu(i, l, u) for (int(i) = (int)(l); (i) < (int)(u); ++(i))
#define aut(r, v) for (auto r : v)
#define each(it, o) for (aut(it, (o).begin()); it != (o).end(); ++it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(... | [
"call.remove"
] | 952,808 | 952,809 | u708599234 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int frog(int arr[], int n) {
int temp[n];
for (int i = 1; i < n; i++) {
temp[i] = 1e6;
}
temp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + 3; j++) {
temp[j] = min(temp[j], abs(arr[i] - arr[j]) + temp[i]);
}
}
return temp[... | #include <bits/stdc++.h>
using namespace std;
int frog(int arr[], int n) {
int temp[n];
for (int i = 1; i < n; i++) {
temp[i] = 1e9;
}
temp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < i + 3; j++) {
temp[j] = min(temp[j], abs(arr[i] - arr[j]) + temp[i]);
}
}
return temp[... | [
"literal.number.change",
"assignment.value.change"
] | 952,811 | 952,812 | u708599234 | cpp |
p03160 | #include <bits/stdc++.h>
#define maxN 100005
long dp[maxN] = {INT_MAX};
long input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
dp[i + j] =
... | #include <bits/stdc++.h>
#define maxN 100005
long dp[maxN] = {INT_MAX};
long input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
dp[i + j] =
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,839 | 952,840 | u110541731 | cpp |
p03160 | #include <bits/stdc++.h>
#define maxN 100005
int dp[maxN] = {INT_MAX};
int input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 3; j++) {
dp[i + j] =
... | #include <bits/stdc++.h>
#define maxN 100005
long dp[maxN] = {INT_MAX};
long input[maxN] = {0};
int main() {
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> input[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
dp[i + j] =
... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,841 | 952,840 | u110541731 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define MX 20000... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define MX 20000... | [
"call.remove"
] | 952,842 | 952,843 | u072203760 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int dp[100010];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (auto &e : h)
cin >> e;
for (int i = 0; i < n; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n - 2; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int dp[100010];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (auto &e : h)
cin >> e;
for (int i = 0; i < n; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; ++i) {
d... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 952,844 | 952,845 | u054652697 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define gcd(a, b) __gcd(a, b)
#define pb push_back
#define sevensins \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define GO ... | #include <bits/stdc++.h>
using namespace std;
#define gcd(a, b) __gcd(a, b)
#define pb push_back
#define sevensins \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define GO ... | [
"literal.number.change",
"call.arguments.change"
] | 952,848 | 952,849 | u913333921 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[1] = abs(h[1] - h[2]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,854 | 952,855 | u880022678 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n + 1);
dp[1] = abs(h[1] - h[2]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + ab... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,856 | 952,855 | u880022678 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e5 + 5;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[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 < n) {
dp[j] = min(dp[j], dp[i... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[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 < n) {
dp[j] = min(dp[j], dp[i... | [
"literal.number.change",
"expression.operation.binary.change"
] | 952,857 | 952,858 | u675040086 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int a[100005];
int dp[100005];
/*int fun(int n){
if (n==0 || n==1){
return 0;
}
if (n==2){
t[n]=abs(a[1]-a[0]);
return abs(a[1]-a[0]);
}
e... | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int a[100005];
int dp[100005];
/*int fun(int n){
if (n==0 || n==1){
return 0;
}
if (n==2){
t[n]=abs(a[1]-a[0]);
return abs(a[1]-a[0]);
}
e... | [
"call.add",
"call.arguments.change"
] | 952,859 | 952,860 | u102044886 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
vector<int> dp(N); // dp[i] を求めるにはdp[i - 1], dp[i - 2]が必要
for (int i = 0; i < N; i++)
cin >> h.at(i);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 1] + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
vector<int> dp(N); // dp[i] を求めるにはdp[i - 1], dp[i - 2]が必要
for (int i = 0; i < N; i++)
cin >> h.at(i);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] =
min(dp[i - 1] + ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,861 | 952,862 | u615258936 | cpp |
p03160 | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
rep(i, n) { cin >> h[i]; }
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
rep(i, n) { cin >> h[i]; }
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
... | [
"expression.operation.binary.add"
] | 952,865 | 952,866 | u483697387 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// #define endl "\n"
ll recurse(ll i, vector<ll> &height, vector<ll> &dp) {
ll n = dp.size();
if (i == n - 1) {
return 0;
}
if (i == n - 1) {
return abs(height[n - 1] - height[n - 2]);
}
if (dp[i] != -1) {
return dp[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// #define endl "\n"
ll recurse(ll i, vector<ll> &height, vector<ll> &dp) {
ll n = dp.size();
if (i == n - 1) {
return 0;
}
if (i == n - 2) {
return abs(height[n - 1] - height[n - 2]);
}
if (dp[i] != -1) {
return dp[i];
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 952,867 | 952,868 | u806351914 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define inf 1e9
int frog(vector<int> a, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(a[i - 1] - a[i]) + dp[n - 1];
int option2 = i == 2 ? inf : abs(a[i -... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
#define inf 1e9
int frog(vector<int> a, int n) {
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int option1 = abs(a[i - 1] - a[i]) + dp[i - 1];
int option2 = i == 2 ? inf : abs(a[i -... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 952,872 | 952,873 | u804215372 | cpp |
p03160 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,874 | 952,875 | u121734488 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--... | [
"call.remove"
] | 952,876 | 952,877 | u142133038 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define pb push_... | #include <bits/stdc++.h>
#define int long long
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define pb push_... | [
"call.remove"
] | 952,882 | 952,883 | u841140330 | cpp |
p03160 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int mod = 998244353;
int main() {
int n;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long 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] ... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int mod = 998244353;
int main() {
int n;
cin >> n;
long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long 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]... | [] | 952,886 | 952,887 | u836207173 | cpp |
p03160 | #include <iostream> // input output stream, cin cout( console in console out)
#include <stdio.h> // standard input output
//#include <cmath.h> // circle math ( sin, con, sinh
#include <algorithm>
#include <iomanip> // input output manipulation
#include <string>
#include <vector>
using namespace std;
#define rep(i, n... | #include <iostream> // input output stream, cin cout( console in console out)
#include <stdio.h> // standard input output
//#include <cmath.h> // circle math ( sin, con, sinh
#include <algorithm>
#include <iomanip> // input output manipulation
#include <string>
#include <vector>
using namespace std;
#define rep(i, n... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 952,890 | 952,891 | u480059652 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.