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 | //雋ｰ縺・DP繝ｫ繝ｼ繝・
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = (a); i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repr2(i, a, n) for (int i = (n); i >= (a); i--)
template <typename T, typename U> void Printarray(... | //雋ｰ縺・DP繝ｫ繝ｼ繝・
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, n) for (int i = (a); i < (n); i++)
#define repr(i, n) for (int i = (n); i >= 0; i--)
#define repr2(i, a, n) for (int i = (n); i >= (a); i--)
template <typename T, typename U> void Printarray(... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,144 | 954,145 | u277956366 | cpp |
p03160 | #include <algorithm>
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define vi vector<ll>
#define ff first
#define ss second
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define FORR(i, a, b) for (ll i = a - 1; i > b; i--)
#define MOD 10e9 + 7
#define fastScan ... | #include <algorithm>
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define vi vector<ll>
#define ff first
#define ss second
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define FORR(i, a, b) for (ll i = a - 1; i > b; i--)
#define MOD 10e9 + 7
#define fastScan ... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,148 | 954,149 | u272056775 | 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, 1e6);
dp[1] = 0;
for (int i = 1; i < n + 1; i++) {
for (auto j : {i + 1, i + 2}) {
if (j <= n) {
dp[j] = min(dp[j], dp... | #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, 1e9 + 5);
dp[1] = 0;
for (int i = 1; i < n + 1; i++) {
for (auto j : {i + 1, i + 2}) {
if (j <= n) {
dp[j] = min(dp[j]... | [
"literal.number.change",
"call.arguments.change"
] | 954,150 | 954,151 | u922651947 | cpp |
p03160 | #include <stdio.h>
#include <stdlib.h>
void chmin(int *a, int b) {
if (*a > b) {
*a = b;
}
}
int main(void) {
// Your code here!
int N;
int h[100000];
int N_[100000];
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &h[i]);
}
N_[0] = 0;
for (i = 1; i < N; i++) {
N_[i... | #include <stdio.h>
#include <stdlib.h>
#define MAX 2147483647
void chmin(int *a, int b) {
if (*a > b) {
*a = b;
}
}
int main(void) {
// Your code here!
int N;
int h[100000];
int N_[100000];
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &h[i]);
}
N_[0] = 0;
for (i = 1;... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,154 | 954,155 | u154818015 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li, li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i, l, r) for (li i = l; i <= r; ++i)
#define fr(i, l, r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li, li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i, l, r) for (li i = l; i <= r; ++i)
#define fr(i, l, r... | [
"literal.number.change",
"assignment.value.change"
] | 954,156 | 954,157 | u292043617 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = max(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(ar... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(ar... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,158 | 954,159 | u227478170 | cpp |
p03160 | #include "bits/stdc++.h"
int main() {
int N;
std::cin >> N;
std::vector<int> heights(N);
for (int i = 0; i < N; i++) {
std::cin >> heights[i];
// std::cout << heights[i] << std::endl;
}
// std::cout << heights[0] << "\n";
// std::cout << heights[1] << "\n";
// Writing the dp funcction
const ... | #include "bits/stdc++.h"
int main() {
int N;
std::cin >> N;
std::vector<int> heights(N);
for (int i = 0; i < N; i++) {
std::cin >> heights[i];
// std::cout << heights[i] << std::endl;
}
// std::cout << heights[0] << "\n";
// std::cout << heights[1] << "\n";
// Writing the dp funcction
const ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 954,164 | 954,165 | u090445726 | cpp |
p03160 | #include "bits/stdc++.h"
int main() {
int N;
std::cin >> N;
std::vector<int> heights(N, 0);
for (int i = 0; i < N; i++) {
std::cin >> heights[i];
// std::cout << heights[i] << std::endl;
}
// std::cout << heights[0] << "\n";
// std::cout << heights[1] << "\n";
// Writing the dp funcction
con... | #include "bits/stdc++.h"
int main() {
int N;
std::cin >> N;
std::vector<int> heights(N);
for (int i = 0; i < N; i++) {
std::cin >> heights[i];
// std::cout << heights[i] << std::endl;
}
// std::cout << heights[0] << "\n";
// std::cout << heights[1] << "\n";
// Writing the dp funcction
const ... | [
"call.arguments.change",
"literal.number.change",
"expression.operation.binary.change"
] | 954,166 | 954,165 | u090445726 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
for (ll i = 0; i < n; i++) {
dp[i] = 1000000;
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
for (ll j =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll n, k;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
for (ll i = 0; i < n; i++) {
dp[i] = 100000000000000;
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
for... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,167 | 954,168 | u028307850 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int d[n - 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
d[0] = 0;
d[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
d[i] =
min(d[i - 1] + abs(h[i] - h[i - 1]), d[i - 2] + abs(h[i] - h[i - 2]));
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int d[n];
for (int i = 0; i < n; i++)
cin >> h[i];
d[0] = 0;
d[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++)
d[i] =
min(d[i - 1] + abs(h[i] - h[i - 1]), d[i - 2] + abs(h[i] - h[i - 2]));
cout << ... | [
"expression.operation.binary.remove",
"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"
] | 954,173 | 954,174 | u719855312 | cpp |
p03160 | // ysh_gpta
#include <bits/stdc++.h>
#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<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace ... | // ysh_gpta
#include <bits/stdc++.h>
#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<ll>, rb_tree_tag, tree_order_statistics_node_update>
using namespace ... | [
"call.remove"
] | 954,179 | 954,180 | u898771121 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
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 ch... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define adrep(i, s, n) for (int i = (s); i < (n); i++)
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 ch... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 954,181 | 954,182 | u978535698 | cpp |
p03160 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(1e9);
rep(i, n) { cin >> h.at(i); }
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n, 1e9);
rep(i, n) { cin >> h.at(i); }
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);... | [
"call.arguments.add"
] | 954,183 | 954,184 | u410305445 | cpp |
p03160 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int N;
int main() {
scanf("%d", &N);
vector<int> h(N);
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int N;
int main() {
scanf("%d", &N);
vector<int> h(N);
... | [
"literal.number.change",
"call.arguments.change"
] | 954,196 | 954,197 | u128572736 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 100010
#define endl "\n"
#define abs(a, b) ((a > b) ? a - b : b - a)
typedef long long int ll;
/* End */
int n;
ll a[MAXN];
ll pd[3];
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define MAXN 100010
#define endl "\n"
#define abs(a, b) ((a > b) ? a - b : b - a)
typedef long long int ll;
/* End */
int n;
ll a[MAXN];
ll pd[3];
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i ... | [
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 954,198 | 954,199 | u885423967 | cpp |
p03160 | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | #include <bits/stdc++.h>
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< '\... | [
"literal.number.change"
] | 954,200 | 954,201 | u128189308 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
int main() {
int n;
cin >> n;
vi stones(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> stones[i];
}
vi dp(n + 1);
dp[2] = abs(sto... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
int main() {
int n;
cin >> n;
vi stones(n + 1);
for (int i = 1; i <= n; i++) {
cin >> stones[i];
}
vi dp(n + 1);
dp[2] = abs(stones... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 954,211 | 954,212 | u615813234 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
int main() {
int n;
cin >> n;
vi stones(n + 1);
for (int i = 1; i <= n; i++) {
cin >> stones[i];
}
vi dp(n + 1, 0);
dp[2] = abs(sto... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
int main() {
int n;
cin >> n;
vi stones(n + 1);
for (int i = 1; i <= n; i++) {
cin >> stones[i];
}
vi dp(n + 1);
dp[2] = abs(stones... | [
"call.arguments.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 954,213 | 954,212 | u615813234 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
int main() {
int n;
cin >> n;
vi stones(n + 1);
for (int i = 1; i <= n; i++) {
cin >> stones[i];
}
vi dp(n + 1);
dp[2] = abs(stones... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
#define MOD 1000000007
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
int main() {
int n;
cin >> n;
vi stones(n + 1);
for (int i = 1; i <= n; i++) {
cin >> stones[i];
}
vi dp(n + 1);
dp[2] = abs(stones... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,214 | 954,212 | u615813234 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
int main() {
sp;
////////////////To Remove//////////////
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
///////////////////////////////////////
int n;
c... | #include <bits/stdc++.h>
using namespace std;
#define sp ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
int main() {
sp;
////////////////To Remove//////////////
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
///////////////////////////////////////
int n;
c... | [
"call.add",
"call.arguments.change"
] | 954,217 | 954,218 | u248276426 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define N 100000
int a[N + 1], dp[N + 1];
int main() {
int n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", a + i);
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++)
dp[i] =
max(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] +... | #include <bits/stdc++.h>
using namespace std;
#define N 100000
int a[N + 1], dp[N + 1];
int main() {
int n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", a + i);
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] +... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,227 | 954,228 | u058625538 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
cout << abs(a[1] - a[0]);
return 0;
}
dp[1] = a[1] - a[0];
for (int i = 2; i < n; i++)
dp[i] =
min(abs(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
cout << abs(a[1] - a[0]);
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
dp[i] =
min... | [
"call.add",
"call.arguments.change"
] | 954,231 | 954,232 | u180641794 | 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 v[N];
v[N - 1] = 0;
v[N - 2] = abs(h[N] - h[N - 1]);
for (int i = N - 3; i >= 0; i--) {
v[i] =
min(abs(h[i] - h[i + 1]) + v[i + 1], abs(h[i] - h[i + 2... | #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 v[N];
v[N - 1] = 0;
v[N - 2] = abs(h[N - 1] - h[N - 2]);
for (int i = N - 3; i >= 0; i--) {
v[i] =
min(abs(h[i] - h[i + 1]) + v[i + 1], abs(h[i] - h[i... | [
"assignment.change",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,233 | 954,234 | u169936115 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 10;
const ll INF = 1e4;
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;
int h[MAX];
for (int i = 0; i < N; ++i)
cin >> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX = 1e5 + 10;
const ll INF = 1e9 + 1;
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;
int h[MAX];
for (int i = 0; i < N; ++i)
cin ... | [
"literal.number.change"
] | 954,237 | 954,236 | u378125390 | cpp |
p03160 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 954,238 | 954,239 | u055115268 | cpp |
p03160 |
#include <bits/stdc++.h>
using namespace std;
// Let's just be lazy in typing "typedef"
#define td typedef
// Data types
td long long ll;
td unsigned long long int ull;
td long double ld;
// Containers
td vector<int> vi;
td vector<ll> vll;
td map<int, int> mii;
td map<ll, ll> mll;
td pair<int, int> pii;
td pair<ll,... |
#include <bits/stdc++.h>
using namespace std;
// Let's just be lazy in typing "typedef"
#define td typedef
// Data types
td long long ll;
td unsigned long long int ull;
td long double ld;
// Containers
td vector<int> vi;
td vector<ll> vll;
td map<int, int> mii;
td map<ll, ll> mll;
td pair<int, int> pii;
td pair<ll,... | [
"call.arguments.change"
] | 954,242 | 954,243 | u169184726 | cpp |
p03160 | /* Life is all about calculated risks.
But man am I bad at math. */
#include <algorithm>
#include <iostream>
#include <vector>
#define ll long long int
#define INF 1000000000000
#define MOD 1000000007
#define DEBUG(x) cerr << "> " << #x << ':' << x << endl;
using namespace std;
ll f(ll stone);
ll n, k;
ll h[10... | /* Life is all about calculated risks.
But man am I bad at math. */
#include <algorithm>
#include <iostream>
#include <vector>
#define ll long long int
#define INF 1000000000000
#define MOD 1000000007
#define DEBUG(x) cerr << "> " << #x << ':' << x << endl;
using namespace std;
ll f(ll stone);
ll n, k;
ll h[10... | [
"expression.operation.binary.remove",
"assignment.add"
] | 954,244 | 954,245 | u371435984 | 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];
int dp[n + 1];
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... | #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];
int dp[n + 1];
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... | [
"io.output.change"
] | 954,246 | 954,247 | u379187386 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main() {
int n;
cin >> n;
int ar[n + 1];
for (int i = 1; i <= n; ++i)
cin >> ar[i];
int dp[100010];
memset(dp, 0, sizeof dp);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
for (int i = 2; i <= n; ++i)
dp[i] = min(dp[i - 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main() {
int n;
cin >> n;
int ar[n + 1];
for (int i = 1; i <= n; ++i)
cin >> ar[i];
int dp[100010];
memset(dp, 0, sizeof dp);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
for (int i = 3; i <= n; ++i)
dp[i] = min(dp[i - 1... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,249 | 954,250 | u905126179 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main() {
int n;
cin >> n;
int ar[n + 1];
for (int i = 1; i <= n; ++i)
cin >> ar[i];
int dp[n + 1];
memset(dp, 0, sizeof dp);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
for (int i = 2; i <= n; ++i)
dp[i] = min(dp[i - 1]... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
signed main() {
int n;
cin >> n;
int ar[n + 1];
for (int i = 1; i <= n; ++i)
cin >> ar[i];
int dp[100010];
memset(dp, 0, sizeof dp);
dp[1] = 0;
dp[2] = abs(ar[1] - ar[2]);
for (int i = 3; i <= n; ++i)
dp[i] = min(dp[i - 1... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,251 | 954,250 | u905126179 | cpp |
p03160 | #include <bits/stdc++.h>
#define H 100010
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
vector<int> dp(n, H);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int k = 1; k <= 2; k++) {
if (i >= k)
dp[i] ... | #include <bits/stdc++.h>
#define H 1000000000
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> h(n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
vector<int> dp(n, H);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int k = 1; k <= 2; k++) {
if (i >= k)
dp... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 954,254 | 954,255 | u431658223 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
typedef long long int ll;
ll go(ll *h, ll n, ll index, ll *dp) {
... | #include <bits/stdc++.h>
using namespace std;
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
typedef long long int ll;
ll go(ll *h, ll n, ll index, ll *dp) {
... | [
"call.add",
"call.arguments.change"
] | 954,256 | 954,257 | u678293555 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
vector<i... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
vector<i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 954,262 | 954,263 | u128837995 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define ld long double
//#define mp make_pair
#define vpll vector<pair<ll, ll>>
#define sll set<ll>
#define vll vector<ll>
#define vld vector<ld>
#define vvll vector<v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define ld long double
//#define mp make_pair
#define vpll vector<pair<ll, ll>>
#define sll set<ll>
#define vll vector<ll>
#define vld vector<ld>
#define vvll vector<v... | [
"variable_declaration.remove"
] | 954,266 | 954,267 | u294050910 | 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, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(v) v.begin(), v.end()
#define FS first
#define SC second
#define SZ(a) int((a).size... | #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, a, b) for (int i = (b)-1; i >= (a); --i)
#define ALL(v) v.begin(), v.end()
#define FS first
#define SC second
#define SZ(a) int((a).size... | [
"expression.operation.binary.remove"
] | 954,280 | 954,281 | u313403396 | cpp |
p03160 | #include <bits/stdc++.h>
#define max 10004
using namespace std;
int main() {
long n, h[100005];
cin >> n;
for (long i = 0; i < n; i++)
cin >> h[i];
long dp[100005];
for (long i = 0; i < n; i++)
dp[i] = max;
dp[0] = 0;
dp[1] = dp[0] + abs(h[1] - h[0]);
for (long i = 2; i < n; i++) {
long val... | #include <bits/stdc++.h>
#define max 1000000009
using namespace std;
int main() {
long n, h[100005];
cin >> n;
for (long i = 0; i < n; i++)
cin >> h[i];
long dp[100005];
for (long i = 0; i < n; i++)
dp[i] = max;
dp[0] = 0;
dp[1] = dp[0] + abs(h[1] - h[0]);
for (long i = 2; i < n; i++) {
lon... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 954,288 | 954,289 | u640930204 | cpp |
p03160 | // Resting_Prince
#include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define sv(v) \
sort(all(v)); \
reverse(all(... | // Resting_Prince
#include <bits/stdc++.h>
#define mod 1000000007
#define inf 1e18
#define PI 3.141592653589
#define fi first
#define se second
#define sv(v) \
sort(all(v)); \
reverse(all(... | [] | 954,290 | 954,291 | u640930204 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(100, 0);
dp[0] = 0;
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] +=
min(dp[i - 1] + abs... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(100'000, 0);
dp[0] = 0;
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] +=
min(dp[i - 1] +... | [
"literal.number.change",
"call.arguments.change"
] | 954,304 | 954,305 | u964763428 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
// 型名の省略
typedef unsigned int uint;
typedef long long lint;
typedef unsigned long long ulint;
const int MOD = 1000000007;
const lint INF = 1LL << 60;
const double PI = acos(-1.0);
// cinとcoutの高速化
#define endl "\n"
struct cinacc {
cinacc() {
cin.tie(0);
ios::syn... | #include <bits/stdc++.h>
using namespace std;
// 型名の省略
typedef unsigned int uint;
typedef long long lint;
typedef unsigned long long ulint;
const int MOD = 1000000007;
const lint INF = 1LL << 60;
const double PI = acos(-1.0);
// cinとcoutの高速化
#define endl "\n"
struct cinacc {
cinacc() {
cin.tie(0);
ios::syn... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,306 | 954,307 | u460426711 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"literal.number.change",
"assignment.value.change"
] | 954,310 | 954,311 | u903311413 | cpp |
p03160 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long int ll;
ty... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 954,312 | 954,311 | u903311413 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
int a[1000000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[1000000];
dp[0] = 0;
dp[1] = a[1] - a[0];
for (int i = 2; i < n; i++) {
dp[i] = min((d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << 0 << endl;
return 0;
}
int a[1000000];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[1000000];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = m... | [
"call.add",
"call.arguments.change"
] | 954,316 | 954,317 | u652064866 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> v(n), dp(n);
rep(i, n) cin >> v[i];
dp[0] = v[0];
dp[1] = abs(v[1] - v[0]);
rep1(i, 2, n) dp[i] =
... | #include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = a; i < b; i++)
using ll = long long;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> v(n), dp(n);
rep(i, n) cin >> v[i];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
rep1(i, 2, n) dp[i] =
... | [] | 954,322 | 954,323 | u624118226 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,328 | 954,329 | u265359795 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
int main() {
int N;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,330 | 954,329 | u265359795 | cpp |
p03160 | #include <iostream>
#include <vector>
#define rep(i, x) for (int i = 0; i < x; i++)
using ll = long long;
using namespace std;
int INF = 100100;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
h.push_back(INF);
h.push_back(INF);
vector<int> dp(n + 10, INF); //余裕をもって要素数+10
dp[0] ... | #include <iostream>
#include <vector>
#define rep(i, x) for (int i = 0; i < x; i++)
using ll = long long;
using namespace std;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
h.push_back(INF);
h.push_back(INF);
vector<int> dp(n + 10, INF); //余裕をもって要素数+10
dp... | [
"literal.number.change",
"variable_declaration.value.change"
] | 954,344 | 954,345 | u580923688 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int h[n];
int post[n];
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
post[0] = h[0];
post[1] = abs(h[0] - h[1]);
for (int j = 2; j < n; j++) {
post[j] = min(post[j - 1] + abs(h[j - 1] - h[j]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int h[n];
int post[n];
for (int i = 0; i < n; i++)
scanf("%d", &h[i]);
post[0] = 0;
post[1] = abs(h[0] - h[1]);
for (int j = 2; j < n; j++) {
post[j] = min(post[j - 1] + abs(h[j - 1] - h[j]),
... | [
"expression.operation.binary.add"
] | 954,348 | 954,349 | u379682992 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef... | #include <bits/stdc++.h>
using namespace std;
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,350 | 954,351 | u801891559 | cpp |
p03160 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> cost(n);
cost[0] = 0;
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define _Pi 3.1415926535
#define _MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> cost(n);
cost[0] = 0;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,352 | 954,353 | u445457059 | cpp |
p03160 | #include <iostream>
using namespace std;
int n;
int dp[100005];
int mincost(int a[]) {
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
dp[2] = min(dp[1] + abs(a[1] - a[0]), abs(a[1] - a[0]));
for (int i = 3; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
... | #include <iostream>
using namespace std;
int n;
int dp[100005];
int mincost(int a[]) {
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
dp[2] = min(dp[1] + abs(a[2] - a[1]), abs(a[2] - a[0]));
for (int i = 3; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] - a[i - 1]));
}
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,356 | 954,357 | u186401165 | cpp |
p03160 | #include <bits/stdc++.h>
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define INF (1e10 + 5)
#define F firs... | #include <bits/stdc++.h>
#define FAST_IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define INF (1e10 + 5)
#define F firs... | [
"variable_declaration.remove"
] | 954,363 | 954,364 | u635116981 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(NULL);
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n][2];
dp[0][0] = dp[0][1] = 0;
dp[1][0] = h[1] - h[0];
dp[1][1] = 10000001;
for (int i = 2; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(NULL);
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n][2];
dp[0][0] = dp[0][1] = 0;
dp[1][0] = abs(h[1] - h[0]);
dp[1][1] = 10000001;
for (int i = 2... | [
"call.add",
"call.arguments.change"
] | 954,369 | 954,370 | u675879758 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
using namespace std;
const int maxn = 100100;
ll dp[maxn], h[maxn], n;
int main() {
cin >> n;
cin >> h[1];
for (int i = 2; i <= n; i++) {
cin >> h[i];
if (i == 2)
dp[i] = abs(h[2] - h[1]... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
using namespace std;
const int maxn = 100100;
ll dp[maxn], h[maxn], n;
int main() {
cin >> n;
cin >> h[1];
for (int i = 2; i <= n; i++) {
cin >> h[i];
if (i == 2)
dp[i] = abs(h[2] - h[1]... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 954,371 | 954,372 | u356738755 | cpp |
p03160 | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp mak... | // THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp mak... | [] | 954,373 | 954,374 | u430369139 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 10000;
for (int i = 0; i < n; i++)
for (int j = i; j < min(n, i + 3); j++)
dp[... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n);
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT32_MAX;
for (int i = 0; i < n; i++)
for (int j = i; j < min(n, i + 3); j++)
... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,375 | 954,376 | u185967517 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n];
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = max(dp[i - 2] + abs(arr[i - 2] - arr[i]),
dp[i - 1] + abs(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int dp[n];
int arr[n];
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]),
dp[i - 1] + abs(a... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,383 | 954,384 | u012046378 | cpp |
p03160 | #include <bits/stdc++.h>
#define INF 1000000
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min... | #include <bits/stdc++.h>
#define INF 1e9 + 5
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 954,388 | 954,389 | u643712096 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 954,390 | 954,391 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,393 | 954,391 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,394 | 954,395 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,393 | 954,396 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,393 | 954,397 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 954,398 | 954,399 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,393 | 954,400 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,401 | 954,402 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,403 | 954,404 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespac... | [
"expression.operation.binary.remove"
] | 954,405 | 954,406 | u195054737 | cpp |
p03160 | #include <algorithm>
#include <limits.h>
#include <stdio.h>
#define SIZE 100005
int dp[100005], h[100005];
int main(void) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &h[i]);
dp[0] = INT_MAX;
for (int i = 2; i <= n; i++)
dp[i] = std::min(dp[i - 1] + std::abs(h[i] - h[i - 1]),
... | #include <algorithm>
#include <limits.h>
#include <stdio.h>
#define SIZE 100005
long long int dp[100005], h[100005];
int main(void) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%lld", &h[i]);
dp[0] = INT_MAX;
for (int i = 2; i <= n; i++)
dp[i] = std::min(dp[i - 1] + std::abs(h[i] - ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 954,419 | 954,420 | u563168133 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100007];
long long mem[100007];
long long res = 0;
// long long swim(int i,int lst=a[0])
//{
// if(i == n)
// return a[i];
// if(i>n)
// return 1e10 ;
//// long long &r = mem[i];
//// if(~r)
//// return mem[i];
// res ... | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100007];
long long mem[100007];
long long res = 0;
// long long swim(int i,int lst=a[0])
//{
// if(i == n)
// return a[i];
// if(i>n)
// return 1e10 ;
//// long long &r = mem[i];
//// if(~r)
//// return mem[i];
// res ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 954,427 | 954,428 | u207553808 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[100009], b, c, d, n, dp[100009];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 1; i < n; i++) {
b = abs(a[i] - a[i - 1]) + dp[i - 1];
c = abs(a[i] - a[i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[100009], b, c, d, n, dp[100009];
int main() {
cin >> n;
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++) {
b = abs(a[i] - a[i - 1]) + dp[i - 1];
c = abs(a[i] - a[i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,429 | 954,430 | u706943728 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int h[200000];
int dp[200000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = h[1] - h[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - 2] - ... | #include <bits/stdc++.h>
using namespace std;
int h[200000];
int dp[200000];
int main() {
int n;
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(dp[i - 1] + abs(h[i - 1] - h[i]), dp[i - 2] + abs(h[i - ... | [
"call.add",
"call.arguments.change"
] | 954,433 | 954,434 | u019361658 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define in insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(a) a.begin(), a.end()
#define INF (1 << 28)
typedef long long int ll;
typedef long int l;
typedef pair<int, int> pii;
const double PI = a... | #include <bits/stdc++.h>
using namespace std;
#define in insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(a) a.begin(), a.end()
#define INF (1 << 28)
typedef long long int ll;
typedef long int l;
typedef pair<int, int> pii;
const double PI = a... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change"
] | 954,451 | 954,450 | u565802566 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int solve() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2... | #include <bits/stdc++.h>
using namespace std;
int solve() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2... | [
"expression.operation.binary.remove",
"assignment.change"
] | 954,468 | 954,469 | u727469412 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
long long int cost1(int N, int h[]) {
int cost[N] = {0};
cost[0] = 0;
cost[1] = abs(h[N - 2] - h[N - 1]);
for (int i = 2; i < N; i++) {
cost[i] = min(abs(h[i] - h[i - 1]) + cost[i - 1],
abs(h[i] - h[i - 2]) + cost[i - 2]);
}
//... | #include <cmath>
#include <iostream>
using namespace std;
long long int cost1(int N, int h[]) {
int cost[N] = {0};
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
cost[i] = min(abs(h[i] - h[i - 1]) + cost[i - 1],
abs(h[i] - h[i - 2]) + cost[i - 2]);
}
// for(int... | [
"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"
] | 954,477 | 954,478 | u499215329 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int a1, a2;
int length;
cin >> length;
int height[length];
for (int i = 0; i < length; ++i) {
cin >> height[i];
}
a2 = 0;
if (height[1] > height[0])
a1 = height[0] - height[1];
else
a1 = height[1] - height[0];
int temp1, temp2;
for ... | #include <iostream>
using namespace std;
int main() {
int a1, a2;
int length;
cin >> length;
int height[length];
for (int i = 0; i < length; ++i) {
cin >> height[i];
}
a2 = 0;
if (height[1] > height[0])
a1 = height[1] - height[0];
else
a1 = height[0] - height[1];
int temp1, temp2;
for ... | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"assignment.add"
] | 954,479 | 954,480 | u840752761 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int a1, a2;
int length;
cin >> length;
int height[length];
for (int i = 0; i < length; ++i) {
cin >> height[i];
}
a2 = 0;
if (height[1] > height[0])
a1 = height[0] - height[1];
else
a1 = height[0] - height[1];
int temp1, temp2;
for ... | #include <iostream>
using namespace std;
int main() {
int a1, a2;
int length;
cin >> length;
int height[length];
for (int i = 0; i < length; ++i) {
cin >> height[i];
}
a2 = 0;
if (height[1] > height[0])
a1 = height[1] - height[0];
else
a1 = height[0] - height[1];
int temp1, temp2;
for ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 954,481 | 954,480 | u840752761 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int a1, a2;
int length;
cin >> length;
int height[length];
for (int i = 0; i < length; ++i) {
cin >> height[i];
}
a2 = height[0];
if (height[1] > height[0])
a1 = height[0] - height[1];
else
a1 = height[0] - height[1];
int temp1, temp2... | #include <iostream>
using namespace std;
int main() {
int a1, a2;
int length;
cin >> length;
int height[length];
for (int i = 0; i < length; ++i) {
cin >> height[i];
}
a2 = 0;
if (height[1] > height[0])
a1 = height[1] - height[0];
else
a1 = height[0] - height[1];
int temp1, temp2;
for ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 954,482 | 954,480 | u840752761 | cpp |
p03152 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"literal.string.change",
"call.arguments.change",
"function.return_value.change"
] | 954,505 | 954,506 | u452725238 | cpp |
p03153 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define db double
#define pb push_back
#define ppb pop_back
#define all(x) (x).begin(), (x).end()
template <typena... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define db double
#define pb push_back
#define ppb pop_back
#define all(x) (x).begin(), (x).end()
template <typena... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_declaration.type.change"
] | 954,513 | 954,512 | u322084037 | cpp |
p03153 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
template <typename T> void ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
template <typename T> void ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 954,518 | 954,519 | u042689916 | cpp |
p03153 | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 954,528 | 954,529 | u904221771 | cpp |
p03153 | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change"
] | 954,530 | 954,529 | u904221771 | cpp |
p03153 | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | /*----------------by syr----------------*/
/*
----- ----- -----
| | |---| _/
| | | \_ /
----- | \ -----
|---\ \ / |\ /|
| | \_/ | \/ |
| | / \ | |
|---/ / \ | |
*/
#include <bits/stdc++.h>
using namespace std;
#define PH push
#define MP make_pair
#define P... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 954,531 | 954,529 | u904221771 | cpp |
p03153 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define ... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 954,539 | 954,540 | u274463010 | cpp |
p03153 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> struct Kruskal {
struct edge {
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> struct Kruskal {
struct edge {
... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 954,571 | 954,572 | u687214625 | cpp |
p03153 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long double ld;
typedef long long ll;
const int max_n = 300011, max_m = 500011, inf = 1000111222;
const ll inff = 1000111222333444;
struct dsu {
int p[max_n], sz[max_n];
dsu() {
for (int i = 0; i < max_n; ++i) {
p[i... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long double ld;
typedef long long ll;
const int max_n = 300011, max_m = 500011, inf = 1000111222;
const ll inff = 1000111222333444;
struct dsu {
int p[max_n], sz[max_n];
dsu() {
for (int i = 0; i < max_n; ++i) {
p[i... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 954,575 | 954,576 | u434758757 | cpp |
p03153 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
#define pq priority_queue
#define mp make_pair
#define pii pair<int, int>
#define mod 998244353
int lowbit(int x) { return x & (-x); }
int n, d;
int a[200010];
vector<pair<ll, pii>> e;
struct ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
#define pq priority_queue
#define mp make_pair
#define pii pair<int, int>
#define mod 998244353
int lowbit(int x) { return x & (-x); }
int n, d;
int a[200010];
vector<pair<ll, pii>> e;
struct ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 954,611 | 954,612 | u068829283 | cpp |
p03153 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 954,625 | 954,626 | u937608388 | cpp |
p03153 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long n, d, a[200005];
typedef pair<int, int> P;
typedef pair<long long, P> PP;
struct UF {
int par[200005], rank[200005];
void in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
long long n, d, a[200005];
typedef pair<int, int> P;
typedef pair<long long, P> PP;
struct UF {
int par[200005], rank[200005];
void in... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 954,629 | 954,630 | u936665693 | cpp |
p03153 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll run();
int main() {
#ifdef home
freopen("i", "r", stdin);
freopen("d", "w", stderr);
#endif
cout.precision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
run();
return 0;
}
ll n, d, m;
ll a[200005], pre[200005... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll run();
int main() {
#ifdef home
freopen("i", "r", stdin);
freopen("d", "w", stderr);
#endif
cout.precision(15);
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
run();
return 0;
}
ll n, d, m = 1;
ll a[200005], pre[20... | [
"variable_declaration.value.change"
] | 954,647 | 954,648 | u244818078 | cpp |
p03153 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
typedef long long ll;
using namespace std;
const int MAX = 2e5 + 5;
int id[MAX], nodes, edges;
typedef pair<ll, ll> pll;
pair<long long, pair<int, int>> p[MAX];
void initialize() {
for (int i = 0; i < MAX; ++i)
id[i] = i;
}
int root(int x) {
... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
typedef long long ll;
using namespace std;
const int MAX = 2e5 + 5;
int id[MAX], nodes, edges;
typedef pair<ll, ll> pll;
pair<long long, pair<int, int>> p[MAX];
void initialize() {
for (int i = 0; i < MAX; ++i)
id[i] = i;
}
int root(int x) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 954,659 | 954,660 | u116436282 | cpp |
p03153 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
typedef long long ll;
using namespace std;
const int MAX = 2e5 + 5;
int id[MAX], nodes, edges;
typedef pair<ll, ll> pll;
pair<long long, pair<int, int>> p[MAX];
void initialize() {
for (int i = 0; i < MAX; ++i)
id[i] = i;
}
int root(int x) {
... | #include <bits/stdc++.h>
#define pb push_back
#define int long long
typedef long long ll;
using namespace std;
const int MAX = 2e5 + 5;
int id[MAX], nodes, edges;
typedef pair<ll, ll> pll;
pair<long long, pair<int, int>> p[MAX];
void initialize() {
for (int i = 0; i < MAX; ++i)
id[i] = i;
}
int root(int x) {
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 954,661 | 954,660 | u116436282 | cpp |
p03160 | #include <cmath>
#include <complex>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using i64 = int_fast64_t;
using u64 = uint_fast64_t;
using i32 = int_fast32_t;
using u32 = uint_fast32_t;
#define int i64
template <class T> inline bool chmin(T &a, T b) {
if (a... | #include <cmath>
#include <complex>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using i64 = int_fast64_t;
using u64 = uint_fast64_t;
using i32 = int_fast32_t;
using u32 = uint_fast32_t;
#define int i64
template <class T> inline bool chmin(T &a, T b) {
if (a... | [
"literal.number.change"
] | 954,681 | 954,682 | u550913048 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dp[114514];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 114514;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dp[114514];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = 1145141919;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= 2; j++... | [
"literal.number.change",
"assignment.value.change"
] | 954,683 | 954,684 | u110653681 | cpp |
p03160 | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s); i < (n); i++)
#define MOD 1000000007
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main() {
cin.tie(0);
ios::sync_with_stdio... | [
"literal.number.change"
] | 954,687 | 954,688 | u438265890 | cpp |
p03160 | // gauravsinghh
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using bigint = int64_t;
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define lob lower_bound
#define upb upper_bound
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#defi... | // gauravsinghh
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using bigint = int64_t;
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpll vector<pll>
#define lob lower_bound
#define upb upper_bound
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#defi... | [
"call.remove"
] | 954,698 | 954,699 | u480527921 | cpp |
p03160 | // gauravsinghh
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define db double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sii set<int>... | // gauravsinghh
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define db double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sii set<int>... | [
"variable_declaration.remove"
] | 954,700 | 954,701 | u480527921 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
r... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
//#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
r... | [
"call.arguments.change"
] | 954,702 | 954,703 | u739107267 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
// clang-format off
using LL = long long;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
using LL = long long;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((... | [
"assignment.change"
] | 954,706 | 954,707 | u723574055 | 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 = 100000;
int main() {
int n;
cin >> n;
vector<int> hs(n);
rep(i, n) { cin >> hs[i]; }
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
... | #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 = 1000000000;
int main() {
int n;
cin >> n;
vector<int> hs(n);
rep(i, n) { cin >> hs[i]; }
vector<ll> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 954,708 | 954,709 | u142082997 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.