problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> dp(100002, -1);
ll n;
ll solve(vector<ll> &v, ll i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll ans = abs(v[i] - v[i + 1]) + solve(v, i + 1);
if (i + 2 < n) {
ans = min(ans, abs(v[i] - v[i + 2]) + solve(v... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> dp(100002, -1);
ll n;
ll solve(vector<ll> &v, ll i) {
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
ll ans = abs(v[i] - v[i + 1]) + solve(v, i + 1);
if (i + 2 < n) {
ans = min(ans, abs(v[i] - v[i + 2]) + solve(v... | [
"control_flow.return.add"
] | 952,139 | 952,140 | u075940004 | cpp |
p03160 | #include <bits/stdc++.h>
#define int long long
#define abs llabs
#define INF 10000000LL
using namespace std;
signed main() {
int n, h[100000], dp[10000];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n - 2; ++i) {
dp[i + 1] = min(dp[i + 1], dp... | #include <bits/stdc++.h>
#define int long long
#define abs llabs
#define INF 10000000000000000LL
using namespace std;
signed main() {
int n, h[100000], dp[100000];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> h[i];
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n - 2; ++i) {
dp[i + 1] = min(dp[... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.binary.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 952,146 | 952,145 | u652908807 | cpp |
p03160 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,147 | 952,148 | u926006934 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int o1 = dp[i - 1] + abs(h[i] - h[i - 1]);
int o2 = dp[i - 2] + abs(h[i]... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int o1 = dp[i - 1] + abs(h[i] - h[i - 1]);
int o2 = dp[i - 2] + abs(h[i]... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,149 | 952,150 | u052603064 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define vll vector<int>
vll dp(1e5 + 1, 0);
int main() {
int i, j, k, n, m, t;
vll h;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
h.push_back(j);
}
dp[2] = fabs(h[1] - h[0]);
dp[3] = fabs(h[2] - h[0]);
for (i = 4; i <= n; i++) {
dp[i] = min(... | #include <bits/stdc++.h>
using namespace std;
#define vll vector<int>
vll dp(1e5 + 5, 0);
int main() {
int i, j, k, n, m, t;
vll h;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
h.push_back(j);
}
dp[1] = fabs(h[1] - h[0]);
dp[2] = fabs(h[2] - h[0]);
for (i = 3; i <= n; i++) {
dp[i] = min(... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,151 | 952,152 | u454814816 | cpp |
p03160 | //#include <bits/stdc++.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric... | //#include <bits/stdc++.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,153 | 952,154 | u969825174 | cpp |
p03160 | //#include <bits/stdc++.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric... | //#include <bits/stdc++.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,155 | 952,154 | u969825174 | cpp |
p03160 | //#include <bits/stdc++.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric... | //#include <bits/stdc++.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,156 | 952,154 | u969825174 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define deb(x) cout << #x << " : " << x << endl
#define deb2(x, y) cout << #x << " : " << x << " , " << #y << " : " << y << endl
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define deb(x) cout << #x << " : " << x << endl
#define deb2(x, y) cout << #x << " : " << x << " , " << #y << " : " << y << endl
... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.change"
] | 952,159 | 952,160 | u105054381 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i <= n - 1; i++) {
cin >> a[i];
}
int dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[0] = a[0];
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i <= n - 1; i++) {
dp[i] =
min(dp[i - 1] + abs(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i <= n - 1; i++) {
cin >> a[i];
}
int dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i <= n - 1; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i]... | [] | 952,166 | 952,167 | u752731990 | cpp |
p03160 | // Created by SAMAN on ۷/۳۱/۲۰۲۰ م..
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <vector>
#define lint long long int
#define kill(x) return cout << x <<... | // Created by SAMAN on ۷/۳۱/۲۰۲۰ م..
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <vector>
#define lint long long int
#define kill(x) return cout << x <<... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,176 | 952,177 | u430255348 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[n];
for (i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]) + dp[1];
for (i = 3; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) +... | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]) + dp[1];
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,180 | 952,181 | u352310516 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]) + dp[1];
for (i = 3; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + ... | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]) + dp[1];
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - ... | [
"literal.number.change",
"assignment.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,182 | 952,181 | u352310516 | cpp |
p03160 | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n - 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]) + dp[1];
for (i = 3; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + ... | #include <iostream>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
}
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]) + dp[1];
for (i = 3; i <= n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - ... | [
"literal.number.change",
"assignment.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",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 952,183 | 952,181 | u352310516 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <limits>
int main() {
int N;
std::cin >> N;
int h[N];
for (int i = 0; i < N; ++i) {
std::cin >> h[i];
}
int dp[N];
for (int i = 0; i < N; ++i) {
dp[i] = std::numeric_limits<int>::max();
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = ... | #include <algorithm>
#include <iostream>
#include <limits>
int main() {
int N;
std::cin >> N;
int h[N];
for (int i = 0; i < N; ++i) {
std::cin >> h[i];
}
int dp[N];
for (int i = 0; i < N; ++i) {
dp[i] = std::numeric_limits<int>::max();
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = ... | [
"identifier.change",
"expression.operation.binary.change"
] | 952,184 | 952,185 | u587370992 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int n;
int a[100005];
int dp[100005];
int fun(int ind) {
if (ind == (n - 1))
return 0;
if (ind >= n)
return INT_MAX;
if (dp[ind] != -1)
return dp[ind];
int left = abs(a[ind] - a[ind + 1]) + fun(ind + 1);
in... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define int long long
int n;
int a[100005];
int dp[100005];
int fun(int ind) {
if (ind == (n - 1))
return 0;
if (ind >= n)
return INT_MAX;
if (dp[ind] != -1)
return dp[ind];
int left = abs(a[ind] - a[ind + 1]) + fun(ind + 1);
in... | [
"call.arguments.change"
] | 952,190 | 952,191 | u444171208 | 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[2]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] +... | #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] +... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,194 | 952,195 | u962049952 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define f(n) for (int i = 0; i < n; i++)
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(k, n) for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define f(n) for (int i = 0; i < n; i++)
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(k, n) for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
... | [] | 952,200 | 952,201 | u653928018 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5;
int dp[mxn + 2];
int h[mxn + 2];
int func(int n) {
int k;
if (n == 1)
return dp[1] = 0;
if (dp[n] != -1)
return dp[n];
dp[n] = func(n - 1) + abs(h[n] - h[n - 1]);
if (n > 2) {
k = func(n - 2) + abs(h[n] - h[n - 2]);
}
dp[n] = m... | #include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5;
int dp[mxn + 2];
int h[mxn + 2];
int func(int n) {
int k;
if (n == 1)
return dp[1] = 0;
if (dp[n] != -1)
return dp[n];
dp[n] = func(n - 1) + abs(h[n] - h[n - 1]);
if (n > 2) {
k = func(n - 2) + abs(h[n] - h[n - 2]);
dp[n] = min... | [] | 952,202 | 952,203 | u209384203 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define vi vector<int>
#define vb vector<bool>
#define lli long long int
#define vvi vector<vector<int>>
#define loop(n) for... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define vi vector<int>
#define vb vector<bool>
#define lli long long int
#define vvi vector<vector<int>>
#define loop(n) for... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,204 | 952,205 | u911189808 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int dp[N], a[N], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2) {
dp[i] = min(dp[i], dp[i - 2]... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int dp[N], a[N], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 2) {
dp[i] = min(dp[i], dp[i - 2]... | [
"call.arguments.change"
] | 952,206 | 952,207 | u564843244 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll frog(vector<ll> h, vector<ll> dp, ll n) {
for (int i = 1; i <= n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i - 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 1] - h[i - 1]));
}
return dp[n];
}
/*ll fg(vector<ll> h... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll frog(vector<ll> h, vector<ll> dp, ll n) {
for (int i = 1; i <= n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i - 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 1] - h[i - 1]));
}
return dp[n];
}
/*ll fg(vector<ll> h... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 952,212 | 952,213 | u987274574 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll frog(vector<ll> h, vector<ll> dp, ll n) {
for (int i = 1; i <= n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i - 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 1] - h[i - 1]));
}
return dp[n];
}
/*ll fg(vector<ll> h... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll frog(vector<ll> h, vector<ll> dp, ll n) {
for (int i = 1; i <= n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i - 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 1] - h[i - 1]));
}
return dp[n];
}
/*ll fg(vector<ll> h... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 952,214 | 952,213 | u987274574 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[0] = h[0];
dp[1] = abs(dp[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] +... | #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]), dp[i - 2] + abs... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,215 | 952,216 | u204158532 | cpp |
p03160 | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define Eriri ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int, int> Pii;
const int N = 1e5 + 10;
int dp[N], n, h[N];
signed main() {
Eriri ... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define Eriri ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int, int> Pii;
const int N = 1e5 + 10;
int dp[N], n, h[N];
signed main() {
Eriri ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 952,217 | 952,218 | u840424904 | cpp |
p03160 | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define Eriri ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int, int> Pii;
const int N = 1e5 + 10;
int dp[N], n, h[N];
signed main() {
Eriri ... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define Eriri ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int, int> Pii;
const int N = 1e5 + 10;
int dp[N], n, h[N];
signed main() {
Eriri ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,219 | 952,218 | u840424904 | cpp |
p03160 | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define Eriri ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int, int> Pii;
const int N = 1e5 + 10;
int dp[N], n, h[N];
signed main() {
Eriri ... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define Eriri ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
#define int long long
using namespace std;
typedef pair<int, int> Pii;
const int N = 1e5 + 10;
int dp[N], n, h[N];
signed main() {
Eriri ... | [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,220 | 952,218 | u840424904 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int dp[n];
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = h[0];
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]))... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
int dp[n];
for (int i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
... | [] | 952,223 | 952,224 | u968930840 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &a, int i, int n, vector<int> &dp) {
if (i == n) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
int c1 = INT_MAX;
int c2 = INT_MAX;
if (i + 1 <= n) {
c1 = abs(a[i + 1] - a[i]) + solve(a, i + 1, n, dp);
}
if (i + 2 <= n) ... | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &a, int i, int n, vector<int> &dp) {
if (i == n) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
int c1 = INT_MAX;
int c2 = INT_MAX;
if (i + 1 <= n) {
c1 = abs(a[i + 1] - a[i]) + solve(a, i + 1, n, dp);
}
if (i + 2 <= n) ... | [
"assignment.variable.change",
"identifier.change"
] | 952,225 | 952,226 | u617710640 | cpp |
p03160 | /*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
usi... | /*╔═══╗──╔╗╔╗───────────────────╔╗────────╔═══╦═══╗
║║─║╠╗╠╗╔╣╚═╦══╦═╗╔╦╗╔═╗╔══╦══╣╚═╦╦══╦══╣║─║║║─╚╝
║╔═╗║╚╝║╚╣║║║╚╝║║─╔╦╗║║║║╚╝║╚╝║╚╝║║║═╬══║╔═╗║╚╩═║
╚╝─╚╩══╩═╩╝╚╩══╩╝─╚╩╝╚╝╚╩══╩══╩══╩╩══╩══╩╝─╚╩═══╝*/
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
usi... | [] | 952,227 | 952,228 | u771992664 | cpp |
p03160 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dist(int arr[], int n) {
int dp[n + 1], op1, op2;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
op1 = abs(arr[i] - arr[i - 1]) + dp[i - 1];
if (i != 2) {
op2 = abs(arr[i] - arr[i - 2]) + dp[i - 2];
}
dp[i] = min(op1, op2);
... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dist(int arr[], int n) {
int dp[n + 1], op1, op2 = INT_MAX;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
op1 = abs(arr[i] - arr[i - 1]) + dp[i - 1];
if (i != 2) {
op2 = abs(arr[i] - arr[i - 2]) + dp[i - 2];
}
dp[i] = min(op1... | [
"variable_declaration.value.change"
] | 952,231 | 952,232 | u106256464 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {};
dp[0] = arr[0];
dp[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int dp[n] = {};
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] - arr[i - 2]),
... | [] | 952,245 | 952,246 | u659210268 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minReach(int arr[], int n) {
int dp[n + 1];
dp[1] = arr[1];
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
int ans1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int ans2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(ans1, ans2);
... | #include <bits/stdc++.h>
using namespace std;
int minReach(int arr[], int n) {
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
int ans1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int ans2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(ans1, ans2);
}
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,247 | 952,248 | u193875150 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; ++i) {
cin >> heights[i];
}
int a = abs(heights[1] - heights[0]), b = abs(heights[2] - heights[0]),
ans = 0;
for (int i = 1; i < N - 1; ++i) {
if (i % 2 == 1) {
b = min(b,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; ++i) {
cin >> heights[i];
}
int a = abs(heights[1] - heights[0]), b = abs(heights[2] - heights[0]),
ans = a;
for (int i = 1; i < N - 1; ++i) {
if (i % 2 == 1) {
b = min(b,... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,251 | 952,252 | u007332755 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
h.push_back(temp);
}
vector<int> dp(n, 0);
dp[0] = h[0];
dp[1] = abs(dp[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] +=
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
h.push_back(temp);
}
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] +=
mi... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,253 | 952,254 | u108976315 | cpp |
p03160 | #include <algorithm>
#include <iostream>
#include <vector>
#define lli long long int
#define INF 1e9 + 5
using namespace std;
int absdiff(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
... | #include <algorithm>
#include <iostream>
#include <vector>
#define lli long long int
#define INF 1e9 + 5
using namespace std;
int absdiff(int a, int b) {
if (a > b)
return a - b;
else
return b - a;
}
int main() {
int n;
cin >> n;
vector<int> h;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 952,255 | 952,256 | u375055372 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void boost() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
boost();
ll n;
cin >> n;
ll arr[n], i;
for (i = 0; i < n; i++)
cin >> arr[i];
ll dp[n + 1];
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
if ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void boost() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
boost();
ll n;
cin >> n;
ll arr[n], i;
for (i = 0; i < n; i++)
cin >> arr[i];
ll dp[n + 1];
dp[0] = arr[0];
dp[1] = abs(arr[1] - arr[0]);
if ... | [
"call.add",
"call.arguments.change"
] | 952,257 | 952,258 | u960935381 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
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... | #include <cstdlib>
#include <iostream>
#include <vector>
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... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,259 | 952,260 | u993268357 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
for (int i = 2; i <= n; i++) {
dp[1] = 1000000;
if (i == 2)
dp[2] = abs(h[2] - h[1]);
else {
dp[i] = min(dp[i - 1] ... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
for (int i = 2; i <= n; i++) {
dp[1] = 0;
if (i == 2)
dp[2] = abs(h[2] - h[1]);
else {
dp[i] = min(dp[i - 1] + abs(... | [
"literal.number.change",
"assignment.value.change"
] | 952,263 | 952,264 | u032955959 | cpp |
p03160 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mxN = 1e5, INF = 1e9 + 7;
int n;
vector<int> h(mxN);
vector<int> dp(mxN + 1, INF);
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mxN = 1e5, INF = 1e9 + 7;
int n;
vector<int> h(mxN + 1);
vector<int> dp(mxN + 1);
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
m... | [
"call.arguments.change"
] | 952,267 | 952,266 | u973157631 | 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];
}
vector<int> dp(n, 0);
// dp[1]=h[1]-h[0];
dp[1] = abs(h[2] - h[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i -... | #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];
}
vector<int> dp(n, 0);
// dp[1]=h[1]-h[0];
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i -... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,271 | 952,272 | u485607024 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int h[n];
int i = 0;
int dp[n];
while (i < n) {
cin >> h[i];
dp[i] = INF;
i++;
}
i = 1;
dp[0] = 0;
for (; i < n; i++) {
int j = 1;
while (j < 3) {
if (i + j < n)
dp[... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
int n;
cin >> n;
int h[n];
int i = 0;
int dp[n];
while (i < n) {
cin >> h[i];
dp[i] = INF;
i++;
}
i = 0;
dp[0] = 0;
for (; i < n; i++) {
int j = 1;
while (j < 3) {
if (i + j < n)
dp[... | [
"literal.number.change",
"assignment.value.change"
] | 952,277 | 952,278 | u931624197 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define trav(a, x) for (auto &a : x)
const int INF = 1e5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define trav(a, x) for (auto &a : x)
const ll INF = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 952,279 | 952,280 | u195278459 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define trav(a, x) for (auto &a : x)
const int INF = 1e5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define trav(a, x) for (auto &a : x)
const ll INF = 1e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
... | [
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 952,281 | 952,280 | u195278459 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | [
"literal.number.change",
"expression.operation.binary.change"
] | 952,282 | 952,283 | u669936199 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define zeroend __builtin_ctz
#define ones __builtin_popcount
#define ends "\n"
#defi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define zeroend __builtin_ctz
#define ones __builtin_popcount
#define ends "\n"
#defi... | [] | 952,286 | 952,287 | u130030265 | 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 setbits(... | #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 setbits(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 952,290 | 952,291 | u476737806 | cpp |
p03160 | //#pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define make_unique(v) ... | //#pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define make_unique(v) ... | [
"call.add",
"call.arguments.change"
] | 952,292 | 952,293 | u887982593 | 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];
for (int i = 0; i < n; i++) {
dp[i] = 0;
}
dp[0] = 0;
dp[1] = (arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] += min(dp[i - 1] + a... | #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];
for (int i = 0; i < n; i++) {
dp[i] = 0;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
dp[i] += min(dp[i - 1] ... | [
"call.add"
] | 952,294 | 952,295 | u724031512 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#define pb push_back
#define all(c) (c).... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define pq priority_queue
#define ff first
#define ss second
#define pb push_back
#define pb push_back
#define all(c) (c).... | [
"assignment.change"
] | 952,298 | 952,299 | u965116893 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset((a), 0, sizeof(a))
#define set1(a) memset((a), -1, sizeof(a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000009
#define ll long long
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set0(a) memset((a), 0, sizeof(a))
#define set1(a) memset((a), -1, sizeof(a))
#define pi pair<int, int>
#define ps pair<string, string>
#define pl... | [
"control_flow.return.add"
] | 952,300 | 952,301 | u544149677 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
void solve() {
ll n;
cin >> n;
ll arr[n],... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
void solve() {
ll n;
cin >> n;
ll arr[n],... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,317 | 952,318 | u290308915 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = 100000;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
}
vector<int64_t> cost(N + 1, 100000);
cost.at(0) = 0;
cost.at(1) = 0;
for (int i = 2; i <= N; i++) {
cost.at(i) = min((cost.at(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = 100000;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
}
vector<int64_t> cost(N + 1, 1000000000000000);
cost.at(0) = 0;
cost.at(1) = 0;
for (int i = 2; i <= N; i++) {
cost.at(i) = min... | [
"literal.number.change",
"call.arguments.change"
] | 952,319 | 952,320 | u453366189 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = 100000;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
}
vector<int> cost(N + 1, 100000);
cost.at(0) = 0;
cost.at(1) = 0;
for (int i = 2; i <= N; i++) {
cost.at(i) = min((cost.at(i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = 100000;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
}
vector<int64_t> cost(N + 1, 1000000000000000);
cost.at(0) = 0;
cost.at(1) = 0;
for (int i = 2; i <= N; i++) {
cost.at(i) = min... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 952,321 | 952,320 | u453366189 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = 100000;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
}
vector<int> cost(N + 1, 100000);
cost.at(0) = 0;
cost.at(1) = 0;
for (int i = 2; i <= N; i++) {
cost.at(i) = min((cost.at(i - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N + 1);
h.at(0) = 100000;
for (int i = 1; i <= N; i++) {
cin >> h.at(i);
}
vector<int64_t> cost(N + 1, 1000000000000000);
cost.at(0) = 0;
cost.at(1) = 0;
for (int i = 2; i <= N; i++) {
cost.at(i) = min... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"call.arguments.change"
] | 952,322 | 952,320 | u453366189 | cpp |
p03160 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n;
int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
int dp[n];
dp[0] = 0;
dp[1] = A[1] - A[0];
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(A[i] - A[i - 2]), dp[i - 1] + abs(A[i]... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
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 - 2] + abs(A[i] - A[i - 2]), dp[i - 1] + abs... | [
"call.add",
"call.arguments.change"
] | 952,323 | 952,324 | u558926332 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | [
"assignment.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 952,325 | 952,326 | u344194703 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | [
"assignment.change",
"assignment.add"
] | 952,325 | 952,327 | u344194703 | cpp |
p03160 | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | #include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(... | [
"assignment.add"
] | 952,325 | 952,328 | u344194703 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define SZ(x) ((int)(x).size())
#define endl "\n"
ll mod = 1e9 + 7;
// const double pi = acos(-1.0);
/*
ll kmp(string x)
{
ll n= x.length();
//cout<<x<<endl;
vector<ll> lcp(x.length(), 0);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<ll, ll>
#define SZ(x) ((int)(x).size())
#define endl "\n"
ll mod = 1e9 + 7;
// const double pi = acos(-1.0);
/*
ll kmp(string x)
{
ll n= x.length();
//cout<<x<<endl;
vector<ll> lcp(x.length(), 0);
... | [] | 952,329 | 952,330 | u554953113 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> arr(n);
std::vector<int> dp(n);
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = arr[1] - arr[0];
for (int i = 2; i < n; ++i) {
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
std::vector<int> arr(n);
std::vector<int> dp(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 - 1] + abs(arr[i] - arr[i - 1]),
... | [
"call.add",
"call.arguments.change"
] | 952,331 | 952,332 | u614576698 | cpp |
p03160 | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ █... | /*
███╗ ███╗ █████╗ ███████╗███╗ ███╗ ██████╗ ██╗
██╗██████╗ ███████╗ █████╗ ███╗ ███╗██████╗ ██╗ ██╗ ████╗
████║██╔══██╗╚════██║████╗ ████║██╔═══██╗██║ ██║██╔══██╗╚════██║██╔══██╗████╗
████║██╔══██╗╚██╗ ██╔╝ ██╔████╔██║███████║ ██╔╝██╔████╔██║██║ ██║██║
██║██║ ██║ █... | [] | 952,338 | 952,339 | u801961010 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
#define M (int)1e9
#define pi 3.1415926536
#define all(a) a.begin(), a.end()
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define M (int)1e9
#define pi 3.1415926536
#define all(a) a.begin(), a.end()
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"call.add",
"call.arguments.change"
] | 952,340 | 952,341 | u496612088 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[n - 1] = 0;
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int a =... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[n - 1] = 0;
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int a =... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,342 | 952,343 | u867580039 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[n - 1] = 0;
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int a =... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[n - 1] = 0;
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int a =... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,344 | 952,343 | u867580039 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[n - 1] = 0;
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int a =... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[n - 1] = 0;
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
int a =... | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,344 | 952,345 | u867580039 | cpp |
p03160 | #include <bits/stdc++.h>
#define INF 1e6
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, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int x : {1, 2}) {
if (i + x < n) {
dp[i + x] = min(dp[i + x], ... | #include <bits/stdc++.h>
#define INF 1e9 + 5
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, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int x : {1, 2}) {
if (i + x < n) {
dp[i + x] = min(dp[i + ... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 952,348 | 952,349 | u023030760 | cpp |
p03160 | #include <cstdlib>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
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 ... | #include <cstdlib>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
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 ... | [
"call.add",
"call.arguments.change"
] | 952,355 | 952,356 | u289381123 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n, INT_MAX);
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j < 3; j++) {
if (i + j < n) {
dp[i + j] = min(dp[i + j], dp[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n, INT_MAX);
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j < 3; j++) {
if (i + j < n) {
dp[i + j] = min(dp[i + j], dp[i]... | [
"identifier.change",
"io.output.change"
] | 952,362 | 952,363 | u942160556 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<bool> vb;
typedef vector<ull> vul;
typ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<bool> vb;
typedef vector<ull> vul;
typ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 952,364 | 952,365 | u080077876 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int min(int a, int b) {
if (a > b)
return b;
else
return a;
}
int cost(int n, int h[]) {
int DP[n + 1];
DP[1] = 0;
DP[2] = abs(h[1] - h[0]);
for (int i = 3; i <= n; i++)
DP[i] = min((DP[i - 1] + abs(h[i] - h[i - 1])),
(D... | #include <cmath>
#include <iostream>
using namespace std;
int min(int a, int b) {
if (a > b)
return b;
else
return a;
}
int cost(int n, int h[]) {
int DP[n + 1];
DP[1] = 0;
DP[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++)
DP[i] = min((DP[i - 1] + abs(h[i] - h[i - 1])),
(D... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,368 | 952,369 | u706567482 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int minCost(int n, int cost[], int dp[]) {
if (n == 1) {
return 0;
}
if (n == 2) {
return abs(cost[1] - cost[0]);
}
if (dp[n] != -1) {
return dp[n];
}
int cost1 = abs(cost[n - 1] - cost[n - 2]) + minCost(n - 1, cost, dp);
int cost2 = abs(cost[n ... | #include <bits/stdc++.h>
using namespace std;
int minCost(int n, int cost[], int dp[]) {
if (n == 1) {
return 0;
}
if (n == 2) {
return abs(cost[1] - cost[0]);
}
if (dp[n] != -1) {
return dp[n];
}
int cost1 = abs(cost[n - 1] - cost[n - 2]) + minCost(n - 1, cost, dp);
int cost2 = abs(cost[n ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change"
] | 952,372 | 952,371 | u602983424 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
vector<int> cost(n, -1);
cost.at(0) = h.at(0);
cost.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
cost.at(i) = min(cost.at(i - 2) + abs(h.at... | #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.at(i);
vector<int> cost(n, -1);
cost.at(0) = 0;
cost.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
cost.at(i) = min(cost.at(i - 2) + abs(h.at(i) - ... | [
"call.remove",
"call.arguments.change"
] | 952,375 | 952,376 | u284109563 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int n, arr[1000000];
long dp[1000000];
long solve(int i) {
if (i >= n - 1) {
return 0;
}
if (dp[i] != -1)
return dp[i];
if (i == n - 2)
dp[i] = abs(arr[i] - arr[i + 1]);
else
dp[i] = max(abs(arr[i] - arr[i + 1]) + solve(i + 1),
a... | #include <bits/stdc++.h>
using namespace std;
int n, arr[1000000];
long dp[1000000];
long solve(int i) {
if (i >= n - 1) {
return 0;
}
if (dp[i] != -1)
return dp[i];
if (i == n - 2)
dp[i] = abs(arr[i] - arr[i + 1]);
else
dp[i] = min(abs(arr[i] - arr[i + 1]) + solve(i + 1),
a... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 952,379 | 952,380 | u941672501 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int mem[100005] = {-1};
vector<int> frog;
int dp(int n) {
if (n < 0) {
return 0;
}
if (n == 0) {
return 0;
}
if (n == 1) {
return abs(frog[1] - frog[0]);
}
if (mem[n] != -1) {
return -1;
}
int x = dp(n - 1);
int y = dp(n - 2);
int cos... | #include <bits/stdc++.h>
using namespace std;
int mem[100005] = {-1};
vector<int> frog;
int dp(int n) {
if (n < 0) {
return 0;
}
if (n == 0) {
return 0;
}
if (n == 1) {
return abs(frog[1] - frog[0]);
}
if (mem[n] != -1) {
return mem[n];
}
int x = dp(n - 1);
int y = dp(n - 2);
int... | [] | 952,385 | 952,386 | u774919576 | cpp |
p03160 | #include <cmath>
#include <iostream>
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];
for (int i = 0; i < n; i++) {
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] = abs(arr[i - 1] - arr[i - 2]);
else {
i... | #include <cmath>
#include <iostream>
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];
for (int i = 0; i < n; i++) {
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] = abs(arr[i] - arr[i - 1]);
else {
int t... | [
"expression.operation.binary.remove",
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 952,389 | 952,390 | u047590349 | 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);
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i++) {
dp[i] =
min(dp[i + 1] + abs(v[i + 1] - v[i]), dp[i + 2] + abs(... | #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);
dp[n - 2] = abs(v[n - 1] - v[n - 2]);
for (int i = n - 3; i >= 0; i--) {
dp[i] =
min(dp[i + 1] + abs(v[i + 1] - v[i]), dp[i + 2] + abs(... | [] | 952,395 | 952,396 | u065541219 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define f first
#define s second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(... | [] | 952,404 | 952,405 | u256247307 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; i++)
cin >> heights[i];
int dp[N];
dp[0] = 0;
for (int i = 1; i < 0; i++) {
int op1 = INT_MAX;
int op2 = INT_MAX;
if (i - 1 >= 0)
op1 = abs(heights[i] - heights[i - 1])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; i++)
cin >> heights[i];
int dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
int op1 = INT_MAX;
int op2 = INT_MAX;
if (i - 1 >= 0)
op1 = abs(heights[i] - heights[i - 1])... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,406 | 952,407 | u720046242 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; i++)
cin >> heights[i];
int dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
int op1 = INT_MAX;
int op2 = INT_MAX;
if (i - 1 >= 0)
op1 = abs(heights[i] - heights[i - 1])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; i++)
cin >> heights[i];
int dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
int op1 = INT_MAX;
int op2 = INT_MAX;
if (i - 1 >= 0)
op1 = abs(heights[i] - heights[i - 1])... | [
"expression.operation.binary.add"
] | 952,408 | 952,407 | u720046242 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; i++)
cin >> heights[i];
int dp[N];
dp[0] = 0;
for (int i = 1; i < 0; i++) {
int op1 = INT_MAX;
int op2 = INT_MAX;
if (i - 1 >= 0)
op1 = abs(heights[i] - heights[i - 1])... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int heights[N];
for (int i = 0; i < N; i++)
cin >> heights[i];
int dp[N];
dp[0] = 0;
for (int i = 1; i < N; i++) {
int op1 = INT_MAX;
int op2 = INT_MAX;
if (i - 1 >= 0)
op1 = abs(heights[i] - heights[i - 1])... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,409 | 952,407 | u720046242 | cpp |
p03160 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using str = string;
using vl = vector<ll>;
using vs = vector<str>;
using listl = list<ll>;
#define min(A, B) min(static_cast<ll>(A), static_cast<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using str = string;
using vl = vector<ll>;
using vs = vector<str>;
using listl = list<ll>;
#define min(A, B) min(static_cast<ll>(A), static_cast<... | [
"call.add",
"call.arguments.change"
] | 952,413 | 952,414 | u288035794 | cpp |
p03160 | // thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int oo = 1e9;
int n;
int h[MaxN], dp[MaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = oo;
}
dp[1] = 0;
for (... | // thuanqvbn03
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 100005;
const int oo = 1e9;
int n;
int h[MaxN], dp[MaxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
dp[i] = oo;
}
dp[1] = 0;
for (... | [
"assignment.value.change",
"call.arguments.change"
] | 952,415 | 952,416 | u124636763 | cpp |
p03160 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + ab... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a... | [] | 952,417 | 952,418 | u202494171 | cpp |
p03160 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) ((v).begin()),... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) ((v).begin()),... | [
"expression.operation.binary.remove"
] | 952,421 | 952,422 | u931971262 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1] = {0};
dp[1] = 0;
dp[2] = abs(a[0] - a[1]);
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]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n + 1] = {0};
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(a[i] - a[i - 2]), dp[i - 1] + abs(a[i] ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.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.opera... | 952,425 | 952,426 | u067276037 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> temp;
h[i] = temp;
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
cin >> n;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> temp;
h[i] = temp;
}
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] ... | [
"io.output.change"
] | 952,427 | 952,428 | u061594873 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n, INT_MAX), arr(n, 0);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = arr[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]),
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> dp(n, INT_MAX), arr(n, 0);
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 - 1] + abs(arr[i] - arr[i - 1]),
... | [] | 952,429 | 952,430 | u061594873 | cpp |
p03160 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bits/stdtr1c++.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bits/stdtr1c++.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#inclu... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 952,433 | 952,434 | u906385259 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//
// int n, m;
// bool vaild(int i, int j)
//{
// return i >= 0 && i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//
// int n, m;
// bool vaild(int i, int j)
//{
// return i >= 0 && i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,435 | 952,436 | u927144274 | cpp |
p03160 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//
// int n, m;
// bool vaild(int i, int j)
//{
// return i >= 0 && i... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
//
// int n, m;
// bool vaild(int i, int j)
//{
// return i >= 0 && i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 952,437 | 952,436 | u927144274 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int h[N], f[N];
int main() {
int n;
for (int i = 0; i < n; i++)
cin >> h[i];
f[0] = 0;
f[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
f[i] =
min(f[i - 1] + abs(h[i] - h[i - 1]), f[i - 2] + abs(h[i] - h[i - 2]));
}
... | #include <bits/stdc++.h>
using namespace std;
const int N = 100000;
int h[N], f[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
f[0] = 0;
f[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
f[i] =
min(f[i - 1] + abs(h[i] - h[i - 1]), f[i - 2] + abs(h[i] - h[i -... | [] | 952,448 | 952,449 | u943017136 | cpp |
p03160 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define P pair<int, int>
using namespace std;
using ll = long long;
// using mod = int 1000000000 + 7;
void self_max(int &a, int b) { a = max(a, b); }
void self_min(int &a, int b) { a = min(a, b); }
int main() {
int n;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define P pair<int, int>
using namespace std;
using ll = long long;
// using mod = int 1000000000 + 7;
void self_max(int &a, int b) { a = max(a, b); }
void self_min(int &a, int b) { a = min(a, b); }
int main() {
int n;
c... | [] | 952,453 | 952,454 | u366686355 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {};
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[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] + abs(arr[j]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {};
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> arr[i];
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] + abs(ar... | [
"assignment.change"
] | 952,455 | 952,456 | u366686355 | cpp |
p03160 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {};
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0];
for (int i = 1; i < n; i++) {
for (int j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(arr[j]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n] = {};
vector<int> dp(n, INT_MAX);
for (int i = 0; i < n; i++)
cin >> arr[i];
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] + abs(ar... | [
"assignment.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 952,457 | 952,456 | u366686355 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll ar[n];
for (ll i = 0; i < n; ++i) {
cin >> ar[i];
}
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = ar[1] - ar[0];
for (ll i = 3; i < n + 1; ++i) {
dp[i] = min(dp[i - 1] + abs(ar[i - 1] - ar[i - 2]... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n;
cin >> n;
ll ar[n];
for (ll i = 0; i < n; ++i) {
cin >> ar[i];
}
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(ar[1] - ar[0]);
for (ll i = 3; i < n + 1; ++i) {
dp[i] = min(dp[i - 1] + abs(ar[i - 1] - ar[i... | [
"call.add",
"call.arguments.change"
] | 952,458 | 952,459 | u328627271 | cpp |
p03160 | /* "The world is full of obvious things which nobody by any chance ever
* observes." */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pi 3.14159265358979323846
#define pb push_back
#define mk make_pair
#define popcnt(a) ... | /* "The world is full of obvious things which nobody by any chance ever
* observes." */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define pi 3.14159265358979323846
#define pb push_back
#define mk make_pair
#define popcnt(a) ... | [
"identifier.replace.remove",
"literal.replace.add",
"function.return_value.change"
] | 952,462 | 952,463 | u466535000 | cpp |
p03160 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k)... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) lower_bound(all(v), k)... | [
"call.add",
"call.arguments.change"
] | 952,464 | 952,465 | u422633119 | cpp |
p03160 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, a[200005];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[200005];
dp[0] = a[0];
dp[1] = abs(a[1] - a[0]);
ll ans = INT_MAX;
for (int i = 2; i < n; i++) {
ll v1 = dp[i - 1] + abs(a[i] - a[i... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n, a[200005];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll dp[200005];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
ll ans = INT_MAX;
for (int i = 2; i < n; i++) {
ll v1 = dp[i - 1] + abs(a[i] - a[i - ... | [] | 952,468 | 952,469 | u295716434 | cpp |
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 = 2; 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])),
... | [] | 952,482 | 952,483 | u566183836 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.