problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
using namespace std;
const ll inf = 10000000000;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, i, j;
cin >> n;
ll arr[n + 5];
for (i = 0; i < n; i++)
cin >> arr[i];
k = 2;
vector<ll> dp(n + 5, inf);
// for(i=0;i<n;i++)
// cout<<dp[i]<<" ";
ll zero = 0;
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = i - 1; j >= max(zero, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
using namespace std;
const ll inf = 10000000000;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios::sync_with_stdio(false);
cin.tie(0);
ll n, k, i, j;
cin >> n;
ll arr[n + 5];
for (i = 0; i < n; i++)
cin >> arr[i];
k = 2;
vector<ll> dp(n + 5, inf);
// for(i=0;i<n;i++)
// cout<<dp[i]<<" ";
ll zero = 0;
dp[0] = 0;
for (i = 1; i < n; i++) {
for (j = i - 1; j >= max(zero, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(arr[i] - arr[j]));
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 6 | 10 | 6 | 10 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(a) a.begin(), a.end()
#define print(x) cout << x << "\n";
const ll M = ll(1e9 + 7);
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it : v) {
os << it;
if (it != *v.rbegin())
os << ", ";
}
os << "]\n";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto it : v)
os << it.first << " : " << it.second << "\n";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(";
os << v.first << ", " << v.second << ")";
return os;
}
/***********************************************************************/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
vector<ll> dp(n);
dp[1] = abs(a[1] - a[0]);
for (ll 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]));
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define all(a) a.begin(), a.end()
#define print(x) cout << x << "\n";
const ll M = ll(1e9 + 7);
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); ++i) {
os << v[i];
if (i != v.size() - 1)
os << ", ";
}
os << "]\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it : v) {
os << it;
if (it != *v.rbegin())
os << ", ";
}
os << "]\n";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto it : v)
os << it.first << " : " << it.second << "\n";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(";
os << v.first << ", " << v.second << ")";
return os;
}
/***********************************************************************/
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
vector<ll> a(n);
for (auto &x : a)
cin >> x;
vector<ll> dp(n);
dp[1] = abs(a[1] - a[0]);
for (ll 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]));
}
cout << dp[n - 1];
}
|
delete
| 43 | 47 | 43 | 43 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
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;
}
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h[i];
}
// dp table
std::vector<ll> dp(N, INF);
// init dp table
// ok
// init condition
dp[0] = 0;
// loop
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + std::abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + std::abs(h[i + 2] - h[i]));
}
std::cout << dp[N - 1] << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define INF (1 << 31) - 1 // INT_MAX/2
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using P = std::pair<int, int>;
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;
}
int main(int argc, char *argv[]) {
int N;
std::cin >> N;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h[i];
}
// dp table
std::vector<ll> dp(N + 2, INF);
// init dp table
// ok
// init condition
dp[0] = 0;
// loop
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + std::abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + std::abs(h[i + 2] - h[i]));
}
std::cout << dp[N - 1] << std::endl;
return 0;
}
|
replace
| 35 | 36 | 35 | 36 |
-6
|
Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// ↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i, n) for (int i = 1; i <= ((int)(n)); i++) // 1-indexed昇順
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--) // 0-indexed降順
#define rrep1(i, n) for (int i = ((int)(n)); i >= 1; i--) // 1-indexed降順
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii; // 2次元配列
typedef vector<ll> vll;
typedef pair<int, int> PII;
template <typename T> using vec = vector<T>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ld PI = acos(-1.0L);
const ll infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
const int mod = 1000000007;
// const int mod = 998244353;
/*FUNCs=================================================*/
/*MAIN==================================================*/
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false); // cin cout 高速化
// cout << fixed << setprecision(10);
int n;
cin >> n;
vi h(n - 1);
rep(i, n) cin >> h[i];
vi dp(12345, inf);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// ↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++) // 0-indexed昇順
#define rep1(i, n) for (int i = 1; i <= ((int)(n)); i++) // 1-indexed昇順
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--) // 0-indexed降順
#define rrep1(i, n) for (int i = ((int)(n)); i >= 1; i--) // 1-indexed降順
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii; // 2次元配列
typedef vector<ll> vll;
typedef pair<int, int> PII;
template <typename T> using vec = vector<T>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ld PI = acos(-1.0L);
const ll infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
const int mod = 1000000007;
// const int mod = 998244353;
/*FUNCs=================================================*/
/*MAIN==================================================*/
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false); // cin cout 高速化
// cout << fixed << setprecision(10);
int n;
cin >> n;
vi h(n - 1);
rep(i, n) cin >> h[i];
vi dp(112345, inf);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[n - 1] << '\n';
}
|
replace
| 57 | 58 | 57 | 58 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int solve(int i, int a[], vector<int> &dp, int n) {
if (i > n - 2)
return 0;
if (i == n - 2) {
return dp[i] = abs(a[n - 1] - a[n - 2]);
}
return dp[i] = min((abs(a[i] - a[i + 1]) + solve(i + 1, a, dp, n)),
(abs(a[i] - a[i + 2]) + solve(i + 2, a, dp, n)));
}
int main() {
int n;
cin >> n;
int a[n];
vector<int> dp(n, -1);
for (int i = 0; i < n; i++)
cin >> a[i];
int m = solve(0, a, dp, n);
cout << m;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(int i, int a[], vector<int> &dp, int n) {
if (i > n - 2)
return 0;
if (dp[i] != -1)
return dp[i];
if (i == n - 2) {
return dp[i] = abs(a[n - 1] - a[n - 2]);
}
return dp[i] = min((abs(a[i] - a[i + 1]) + solve(i + 1, a, dp, n)),
(abs(a[i] - a[i + 2]) + solve(i + 2, a, dp, n)));
}
int main() {
int n;
cin >> n;
int a[n];
vector<int> dp(n, -1);
for (int i = 0; i < n; i++)
cin >> a[i];
int m = solve(0, a, dp, n);
cout << m;
return 0;
}
|
insert
| 5 | 5 | 5 | 7 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main(void) {
int N;
int h[10001];
int dp[N + 1];
int tmp, tnp;
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++) {
tmp = dp[i - 2] + abs(h[i] - h[i - 2]);
tnp = dp[i - 1] + abs(h[i] - h[i - 1]);
dp[i] = min(tmp, tnp);
}
cout << dp[N - 1] << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int N;
int h[100001];
int dp[N];
int tmp, tnp;
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++) {
tmp = dp[i - 2] + abs(h[i] - h[i - 2]);
tnp = dp[i - 1] + abs(h[i] - h[i - 1]);
dp[i] = min(tmp, tnp);
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 5 | 7 | 5 | 7 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp1[n];
for (int i = 0; i < n; i++) {
if (i == 0)
dp1[i] = 0;
else if (i == 1)
dp1[i] = dp1[i - 1] + abs(a[i] - a[i - 1]);
else
dp1[i] = min(dp1[i - 1] + abs(a[i] - a[i - 1]),
dp1[i - 2] + abs(a[i] - a[i - 2]));
// cout<< dp1[i]<<"\n";
}
cout << dp1[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp1[n];
for (int i = 0; i < n; i++) {
if (i == 0)
dp1[i] = 0;
else if (i == 1)
dp1[i] = dp1[i - 1] + abs(a[i] - a[i - 1]);
else
dp1[i] = min(dp1[i - 1] + abs(a[i] - a[i - 1]),
dp1[i - 2] + abs(a[i] - a[i - 2]));
// cout<< dp1[i]<<"\n";
}
cout << dp1[n - 1] << "\n";
return 0;
}
|
replace
| 6 | 10 | 6 | 10 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int fun(vector<int> &v, int i, vector<int> dp) {
if (dp[i] != 1e6) {
return dp[i];
}
if (i == v.size()) {
return 1e5;
}
int ans = 0;
if (i + 2 < v.size()) {
ans = ans + min(abs(v[i] - v[i + 1]) + fun(v, i + 1, dp),
abs(v[i] - v[i + 2]) + fun(v, i + 2, dp));
} else if (i + 1 < v.size()) {
ans = ans + abs(v[i] - v[i + 1]) + fun(v, i + 1, dp);
}
dp[i] = ans;
return ans;
}
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<int> dp(v.size(), 1e6);
cout << fun(v, 0, dp);
}
|
#include <bits/stdc++.h>
using namespace std;
int fun(vector<int> &v, int i, vector<int> &dp) {
if (dp[i] != 1e6) {
return dp[i];
}
if (i == v.size()) {
return 1e5;
}
int ans = 0;
if (i + 2 < v.size()) {
ans = ans + min(abs(v[i] - v[i + 1]) + fun(v, i + 1, dp),
abs(v[i] - v[i + 2]) + fun(v, i + 2, dp));
} else if (i + 1 < v.size()) {
ans = ans + abs(v[i] - v[i + 1]) + fun(v, i + 1, dp);
}
dp[i] = ans;
return ans;
}
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
v.push_back(x);
}
vector<int> dp(v.size(), 1e6);
cout << fun(v, 0, dp);
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long int
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define max_pqueue priority_queue<long long>
#define min_pqueue \
priority_queue<long long, vector<long long>, greater<long long>>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vl vector<long long>
#define vll vector<pair<long long, long long>>
#define FF first
#define SS second
//~ setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//~ setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
//xxx77 ~ setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//~ cout.precision(x) cout<<fixed<<val; // prints x digits after decimal in
//val
#ifndef LOCAL_MACHINE
#define cerr \
if (false) \
cerr
#endif
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
template <typename T> void _printA(T *t, long long sz) {
cout << " { ";
for (long long i = 0; i < sz; i++)
cout << "[" << i << "] = " << t[i] << endl;
cout << " } \n";
}
#ifdef LOCAL_MACHINE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#define debugA(x, y) \
cerr << "[" << #x << "] = "; \
_printA(x, y)
#else
#define debug(x...)
#define debugA(x, y)
#endif
const ll _MOD = 998244353LL;
ll mod(ll a, ll m = _MOD) { return (a + m) % m; }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll gcd(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
ll modinv(ll a, ll m = _MOD) {
ll x, y;
gcd(a, m, x, y);
x = (x % m + m) % m;
return x;
}
/* ------------------------------------------------------------------ */
ll h[(int)1e4 + 5];
ll dp[(int)1e4 + 5];
void solve() {
ll 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++) {
ll a = abs(h[i] - h[i - 1]) + dp[i - 1];
ll b = abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
cout << dp[n - 1] << endl;
}
int main() {
#ifdef LOCAL_MACHINE
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-result"
freopen("in", "r", stdin);
#pragma GCC diagnostic pop
#endif
fast_io;
ll T;
T = 1;
//~ cin>>T;
for (ll t = 0; t < T; t++) {
solve();
}
}
|
#include <bits/stdc++.h>
#define ll long long int
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define max_pqueue priority_queue<long long>
#define min_pqueue \
priority_queue<long long, vector<long long>, greater<long long>>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vl vector<long long>
#define vll vector<pair<long long, long long>>
#define FF first
#define SS second
//~ setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//~ setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints
//xxx77 ~ setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//~ cout.precision(x) cout<<fixed<<val; // prints x digits after decimal in
//val
#ifndef LOCAL_MACHINE
#define cerr \
if (false) \
cerr
#endif
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
template <typename T> void _printA(T *t, long long sz) {
cout << " { ";
for (long long i = 0; i < sz; i++)
cout << "[" << i << "] = " << t[i] << endl;
cout << " } \n";
}
#ifdef LOCAL_MACHINE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#define debugA(x, y) \
cerr << "[" << #x << "] = "; \
_printA(x, y)
#else
#define debug(x...)
#define debugA(x, y)
#endif
const ll _MOD = 998244353LL;
ll mod(ll a, ll m = _MOD) { return (a + m) % m; }
ll gcd(ll a, ll b) { return __gcd(a, b); }
ll gcd(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
ll modinv(ll a, ll m = _MOD) {
ll x, y;
gcd(a, m, x, y);
x = (x % m + m) % m;
return x;
}
/* ------------------------------------------------------------------ */
ll h[(int)1e5 + 5];
ll dp[(int)1e5 + 5];
void solve() {
ll 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++) {
ll a = abs(h[i] - h[i - 1]) + dp[i - 1];
ll b = abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(a, b);
}
cout << dp[n - 1] << endl;
}
int main() {
#ifdef LOCAL_MACHINE
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-result"
freopen("in", "r", stdin);
#pragma GCC diagnostic pop
#endif
fast_io;
ll T;
T = 1;
//~ cin>>T;
for (ll t = 0; t < T; t++) {
solve();
}
}
|
replace
| 114 | 116 | 114 | 116 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, h[10000], dp[10000], k = 3;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
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]));
}
cout << dp[n - 1];
}
|
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int n, h[100000], dp[100000], k = 3;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
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]));
}
cout << dp[n - 1];
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mod 1000000007
ll dp[100005] = {INT_MAX}, cur = 0;
int main() {
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\msmut\\Documents\\Programming\\Input.txt", "r", stdin);
freopen("C:\\Users\\msmut\\Documents\\Programming\\Output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll h[n + 5];
for (ll i = 0; i < n; i++)
cin >> h[i];
cur = 0;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
if (n == 2)
cout << dp[1];
else {
for (ll i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define mod 1000000007
ll dp[100005] = {INT_MAX}, cur = 0;
int main() {
ll n;
cin >> n;
ll h[n + 5];
for (ll i = 0; i < n; i++)
cin >> h[i];
cur = 0;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
if (n == 2)
cout << dp[1];
else {
for (ll i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
}
|
delete
| 11 | 18 | 11 | 11 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
template <typename T> T gcd(T a, T b) {
while (b != 0) {
T temp = a;
a = b;
b = temp % b;
}
return a;
}
// cout << setfill('0') << setw(5) << number < endl;
// while(getline(cin, s)) { .. } | `s` is a string
void solve() {
int n;
cin >> n;
vector<int> h(n);
vector<ll> dp(n);
for (auto &it : h)
cin >> it;
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(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
}
int main() {
IOS;
#ifndef ONLINE_JUDGE
// for getting input from input.txt
(void)freopen("input.txt", "r", stdin);
// for writing output to output.txt
(void)freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
template <typename T> T gcd(T a, T b) {
while (b != 0) {
T temp = a;
a = b;
b = temp % b;
}
return a;
}
// cout << setfill('0') << setw(5) << number < endl;
// while(getline(cin, s)) { .. } | `s` is a string
void solve() {
int n;
cin >> n;
vector<int> h(n);
vector<ll> dp(n);
for (auto &it : h)
cin >> it;
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(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
}
int main() {
IOS;
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
|
delete
| 73 | 79 | 73 | 73 |
-6
|
terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int N, dp[1000] = {};
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i < N; i++) {
if (i > 1)
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1];
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long int ll;
int main() {
int N, dp[1000000] = {};
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i < N; i++) {
if (i > 1)
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1];
}
|
replace
| 15 | 16 | 15 | 16 |
0
| |
p03160
|
C++
|
Runtime Error
|
/*
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
*/
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#define N_MAX 10001
using namespace std;
int dp[N_MAX];
int h[N_MAX];
int n;
int res;
void solve() {
dp[1] = 0;
for (int i = 1; i <= n; i++) {
if (i - 1 >= 1 && i - 2 >= 1) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
} else if (i - 1 >= 1) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
}
}
res = dp[n];
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
solve();
cout << res << endl;
return 0;
}
|
/*
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
*/
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#define N_MAX 100001
using namespace std;
int dp[N_MAX];
int h[N_MAX];
int n;
int res;
void solve() {
dp[1] = 0;
for (int i = 1; i <= n; i++) {
if (i - 1 >= 1 && i - 2 >= 1) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
} else if (i - 1 >= 1) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
}
}
res = dp[n];
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
solve();
cout << res << endl;
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Ull unsigned long long
#define pb push_back
#define INF 2e16
#define PI acos(-1.0)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define SQR(a) ((a) * (a))
#define MEM(a, x) memset(a, x, sizeof(a))
#define ABS(x) ((x) < 0 ? -(x) : (x))
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
#define FastRead \
ios_base::sync_with_stdio(0); \
cin.tie(nullptr);
const int N = 2;
const ll MOD = 1e9 + 7;
void Solve() {
ll n;
cin >> n;
ll a[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++)
dp[i] = INF;
dp[0] = 0;
for (ll i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], (dp[i] + abs(a[i + 1] - a[i])));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], (dp[i] + abs(a[i + 2] - a[i])));
}
cout << dp[n - 1] << "\n";
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
FastRead;
int T = 1;
// cin>>T;
while (T--) {
Solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Ull unsigned long long
#define pb push_back
#define INF 2e16
#define PI acos(-1.0)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define min4(a, b, c, d) min(a, min(b, min(c, d)))
#define max4(a, b, c, d) max(a, max(b, max(c, d)))
#define SQR(a) ((a) * (a))
#define MEM(a, x) memset(a, x, sizeof(a))
#define ABS(x) ((x) < 0 ? -(x) : (x))
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
#define FastRead \
ios_base::sync_with_stdio(0); \
cin.tie(nullptr);
const int N = 2;
const ll MOD = 1e9 + 7;
void Solve() {
ll n;
cin >> n;
ll a[n], dp[n];
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < n; i++)
dp[i] = INF;
dp[0] = 0;
for (ll i = 0; i < n - 1; i++) {
dp[i + 1] = min(dp[i + 1], (dp[i] + abs(a[i + 1] - a[i])));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], (dp[i] + abs(a[i + 2] - a[i])));
}
cout << dp[n - 1] << "\n";
}
int main() {
FastRead;
int T = 1;
// cin>>T;
while (T--) {
Solve();
}
return 0;
}
|
replace
| 48 | 52 | 48 | 49 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#define ll long long int
// #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
// cpp_int x;
// namespace mp=boost::multiprecision;
// mp::cpp_int s=n;
#define all(x) (x).begin(), (x).end()
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1000000000000000000;
const ll rk = 256;
const ld PI = 3.141592653589793;
#define pb push_back
#define mp make_pair
#define vc vector
#define fs first
#define sec second
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define pls pair<ll, string>
#define psl pair<string, ll>
#define plc pair<ll, char>
#define pcl pair<char, ll>
#define pss pair<string, string>
#define all(x) (x).begin(), (x).end()
#define tol(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
#define tou(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
#define print(a) \
for (auto j : a) { \
cout << j << ","; \
} \
cout << "\n";
#define endl '\n'
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
// getting string line
// getline(cin,word);
// STL:
// (1) PRIORITY_QUEUE pq:
// -> priority_queue < int > pq; // max_heap
// -> priority_queue < int , vector < int > , greater < int > > pq; //
// min_heap
// -> pq.top() --> returns the maximum or minimum element
// -> pq.push() --> push element into the queue
// -> pq.pop() --> remove top most element
// -> pq.empty() --> checks whether queue is empty or not
// (2) set / multiset ss;
// --> ss.insert(key); (insertion)
// --> ss.erase(ss.find(key)) .. (deletion)
// --> ss.find(key) != ss.end() ..existence check
// --> ss.lower_bound(x) -> smallest value which is greater than or
// equals to x
// --> ss.upper_bound(x) --> first value strictly greater than x
// --> multiset< data_type , greater<data_type> > ms; // for max ordering
// (3) common functions
// lower_bound(v.begin(),v.end(),x) - v.begin() --> smallest value
// greater than or equals to x upper_bound(v.begin(), v.end(),x)-
// v.begin() --> smallest value greater than x memset(dp , val ,
// sizeof(dp)) -> sets the value of array dp to val
// (4) common mistakes
// .) long long vs int overflow
// .) read question carefully please!!!! it can cost you a lot
// .) unorderedmap is O(1) look up but worst case can be bad
// .) maps have higher constant so many lookups can cause TLE
// .) leaving debugs or cerrs in the program at times can cause TLE
// // Printing pair
ostream &operator<<(ostream &os, pair<ll, ll> const &x) {
os << x.first << "," << x.second;
return os;
}
// printing vector
template <class T> ostream &operator<<(ostream &os, vector<T> const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
// printing set
template <class T> ostream &operator<<(ostream &os, set<T> const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os,
Container const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
return os << "[ " << p.first << ", " << p.second << "]";
}
bool sortinrev(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll modularexpo(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n % 2 == 1)
res = (res * x) % mod;
x = (x * x) % mod;
n = n / 2;
}
return res;
}
void primegen(ll n) {
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
cout << i << endl;
// prime.pb(i);
else {
cout << i << " " << n / i << endl;
// prime.pb(i);
// prime.pb(n/i);
}
}
}
}
bool primetest(ll n) {
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
ll phi(ll n) {
ll res = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = res / i;
res = res * (i - 1);
while (n % i == 0) {
n = n / i;
}
}
}
if (n > 1) {
res = res / n;
res = res * (n - 1);
}
return res;
}
vc<ll> temp;
void divisors(ll n) {
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
temp.pb(i);
else {
temp.pb(i);
temp.pb(n / i);
}
}
}
}
struct Triplet {
ll x, y, z;
};
string bits(ll n) {
int arr[100];
int i = 0;
while (n > 0) {
arr[i] = n % 2;
n = n / 2;
i++;
}
string s = "";
for (int j = i - 1; j >= 0; j--) {
if (arr[j] == 1)
s += '1';
else
s += '0';
}
return s;
}
int main() {
FastIO;
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
ll arr[n];
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n];
memset(dp, mod, sizeof(dp));
dp[0] = 0;
// print(dp)
for (ll i = 0; i < n - 2; i++) {
dp[i + 1] = min(abs(arr[i] - arr[i + 1]) + dp[i], dp[i + 1]);
dp[i + 2] = min(abs(arr[i] - arr[i + 2]) + dp[i], dp[i + 2]);
}
dp[n - 1] = min(dp[n - 1], abs(arr[n - 1] - arr[n - 2]) + dp[n - 2]);
// print(dp);
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O3")
#define ll long long int
// #include <boost/multiprecision/cpp_int.hpp>
// using boost::multiprecision::cpp_int;
// cpp_int x;
// namespace mp=boost::multiprecision;
// mp::cpp_int s=n;
#define all(x) (x).begin(), (x).end()
using ld = long double;
const ll mod = 1000000007;
const ll inf = 1000000000000000000;
const ll rk = 256;
const ld PI = 3.141592653589793;
#define pb push_back
#define mp make_pair
#define vc vector
#define fs first
#define sec second
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pll pair<ll, ll>
#define pls pair<ll, string>
#define psl pair<string, ll>
#define plc pair<ll, char>
#define pcl pair<char, ll>
#define pss pair<string, string>
#define all(x) (x).begin(), (x).end()
#define tol(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
#define tou(s) transform(s.begin(), s.end(), s.begin(), ::toupper);
#define print(a) \
for (auto j : a) { \
cout << j << ","; \
} \
cout << "\n";
#define endl '\n'
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
// getting string line
// getline(cin,word);
// STL:
// (1) PRIORITY_QUEUE pq:
// -> priority_queue < int > pq; // max_heap
// -> priority_queue < int , vector < int > , greater < int > > pq; //
// min_heap
// -> pq.top() --> returns the maximum or minimum element
// -> pq.push() --> push element into the queue
// -> pq.pop() --> remove top most element
// -> pq.empty() --> checks whether queue is empty or not
// (2) set / multiset ss;
// --> ss.insert(key); (insertion)
// --> ss.erase(ss.find(key)) .. (deletion)
// --> ss.find(key) != ss.end() ..existence check
// --> ss.lower_bound(x) -> smallest value which is greater than or
// equals to x
// --> ss.upper_bound(x) --> first value strictly greater than x
// --> multiset< data_type , greater<data_type> > ms; // for max ordering
// (3) common functions
// lower_bound(v.begin(),v.end(),x) - v.begin() --> smallest value
// greater than or equals to x upper_bound(v.begin(), v.end(),x)-
// v.begin() --> smallest value greater than x memset(dp , val ,
// sizeof(dp)) -> sets the value of array dp to val
// (4) common mistakes
// .) long long vs int overflow
// .) read question carefully please!!!! it can cost you a lot
// .) unorderedmap is O(1) look up but worst case can be bad
// .) maps have higher constant so many lookups can cause TLE
// .) leaving debugs or cerrs in the program at times can cause TLE
// // Printing pair
ostream &operator<<(ostream &os, pair<ll, ll> const &x) {
os << x.first << "," << x.second;
return os;
}
// printing vector
template <class T> ostream &operator<<(ostream &os, vector<T> const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
// printing set
template <class T> ostream &operator<<(ostream &os, set<T> const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr> &operator<<(basic_ostream<Ch, Tr> &os,
Container const &x) {
os << "{ ";
for (auto &y : x)
os << y << " ";
return os << "}";
}
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
return os << "[ " << p.first << ", " << p.second << "]";
}
bool sortinrev(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll modularexpo(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n % 2 == 1)
res = (res * x) % mod;
x = (x * x) % mod;
n = n / 2;
}
return res;
}
void primegen(ll n) {
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
cout << i << endl;
// prime.pb(i);
else {
cout << i << " " << n / i << endl;
// prime.pb(i);
// prime.pb(n/i);
}
}
}
}
bool primetest(ll n) {
if (n == 1)
return false;
else {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
}
ll phi(ll n) {
ll res = n;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res = res / i;
res = res * (i - 1);
while (n % i == 0) {
n = n / i;
}
}
}
if (n > 1) {
res = res / n;
res = res * (n - 1);
}
return res;
}
vc<ll> temp;
void divisors(ll n) {
for (ll i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
temp.pb(i);
else {
temp.pb(i);
temp.pb(n / i);
}
}
}
}
struct Triplet {
ll x, y, z;
};
string bits(ll n) {
int arr[100];
int i = 0;
while (n > 0) {
arr[i] = n % 2;
n = n / 2;
i++;
}
string s = "";
for (int j = i - 1; j >= 0; j--) {
if (arr[j] == 1)
s += '1';
else
s += '0';
}
return s;
}
int main() {
FastIO;
ll n;
cin >> n;
ll arr[n];
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n];
memset(dp, mod, sizeof(dp));
dp[0] = 0;
// print(dp)
for (ll i = 0; i < n - 2; i++) {
dp[i + 1] = min(abs(arr[i] - arr[i + 1]) + dp[i], dp[i + 1]);
dp[i + 2] = min(abs(arr[i] - arr[i + 2]) + dp[i], dp[i + 2]);
}
dp[n - 1] = min(dp[n - 1], abs(arr[n - 1] - arr[n - 2]) + dp[n - 2]);
// print(dp);
cout << dp[n - 1] << endl;
return 0;
}
|
delete
| 211 | 217 | 211 | 211 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
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 ll INF = 1LL << 60;
int n;
vector<ll> h(100010, 0);
vector<ll> dp(10010, INF);
int main() {
cin >> n;
rep(i, n) cin >> h[i];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
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 ll INF = 1LL << 60;
int n;
vector<ll> h(100010, 0);
vector<ll> dp(100010, INF);
int main() {
cin >> n;
rep(i, n) cin >> h[i];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << "\n";
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define INF 10000000
#define MAXN 11000
using namespace std;
long long h[MAXN], dp[MAXN];
int N;
int main() {
fill(dp, dp + MAXN, INF);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1];
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1000000000
#define MAXN 110000
using namespace std;
long long h[MAXN], dp[MAXN];
int N;
int main() {
fill(dp, dp + MAXN, INF);
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1];
return 0;
}
|
replace
| 1 | 3 | 1 | 3 |
0
| |
p03160
|
C++
|
Runtime Error
|
/* -- Aditya0412-- */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpl vector<pll>
#define fi first
#define sz size
#define len length
#define se second
// const ll mod=998244353;
const ll mod = 1000000000 + 7;
const ll N = 1000000 + 6;
#define M_PI 3.14159265358979323846
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("INPUT.txt", "r", stdin);
freopen("OUTPUT.txt", "w", stdout);
#endif
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int brr[n + 1];
brr[0] = 0;
brr[1] = 0;
brr[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
brr[i] = min(brr[i - 2] + abs(arr[i - 2] - arr[i]),
brr[i - 1] + abs(arr[i - 1] - arr[i]));
}
cout << brr[n];
}
|
/* -- Aditya0412-- */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpl vector<pll>
#define fi first
#define sz size
#define len length
#define se second
// const ll mod=998244353;
const ll mod = 1000000000 + 7;
const ll N = 1000000 + 6;
#define M_PI 3.14159265358979323846
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++)
cin >> arr[i];
int brr[n + 1];
brr[0] = 0;
brr[1] = 0;
brr[2] = abs(arr[1] - arr[2]);
for (int i = 3; i <= n; i++) {
brr[i] = min(brr[i - 2] + abs(arr[i - 2] - arr[i]),
brr[i - 1] + abs(arr[i - 1] - arr[i]));
}
cout << brr[n];
}
|
delete
| 25 | 29 | 25 | 25 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
#include <limits.h>
using namespace std;
int dp[100004];
int mincost(int n, int height[]) {
if (n == 1 || n == 0)
return 0;
int cost1 = INT_MAX;
int cost2 = INT_MAX;
if (dp[n] != -1)
return dp[n];
if (n >= 2)
cost1 = abs(height[n - 1] - height[n - 2]) + mincost(n - 1, height);
if (n >= 3)
cost2 = abs(height[n - 1] - height[n - 3]) + mincost(n - 2, height);
return dp[n] = min(cost1, cost2);
}
int main() {
int n;
cin >> n;
int height[1000];
for (int i = 0; i < n; i++)
cin >> height[i];
for (int i = 0; i < 100004; i++)
dp[i] = -1;
cout << mincost(n, height);
}
|
#include <iostream>
#include <limits.h>
using namespace std;
int dp[100004];
int mincost(int n, int height[]) {
if (n == 1 || n == 0)
return 0;
int cost1 = INT_MAX;
int cost2 = INT_MAX;
if (dp[n] != -1)
return dp[n];
if (n >= 2)
cost1 = abs(height[n - 1] - height[n - 2]) + mincost(n - 1, height);
if (n >= 3)
cost2 = abs(height[n - 1] - height[n - 3]) + mincost(n - 2, height);
return dp[n] = min(cost1, cost2);
}
int main() {
int n;
cin >> n;
int height[100004];
for (int i = 0; i < n; i++)
cin >> height[i];
for (int i = 0; i < 100004; i++)
dp[i] = -1;
cout << mincost(n, height);
}
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long> dp(n, INT_MAX);
dp[0] = 0;
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j <= i + 2; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
vector<long long> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<long long> dp(n, INT_MAX);
dp[0] = 0;
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1];
}
|
replace
| 13 | 14 | 13 | 16 |
-6
|
Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int dp[10005];
int val[100004];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> val[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int y, x = dp[i - 1] + abs(val[i] - val[i - 1]);
if (i == 1)
y = 1000003;
else
y = dp[i - 2] + abs(val[i] - val[i - 2]);
dp[i] = min(x, y);
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100005];
int val[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> val[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int y, x = dp[i - 1] + abs(val[i] - val[i - 1]);
if (i == 1)
y = 1000003;
else
y = dp[i - 2] + abs(val[i] - val[i - 2]);
dp[i] = min(x, y);
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 2 | 4 | 2 | 4 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define itf ios_base::sync_with_stdio(false)
#define ct cin.tie(NULL)
int Z[100002];
int step(int a[], int n, int i) {
if (i >= n)
return 0;
return min(abs(a[i - 1] - a[i]) + step(a, n, i + 1),
abs(a[i - 1] - a[i + 1]) + step(a, n, i + 2));
}
int main() {
memset(Z, -1, sizeof(Z));
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
cout << step(a, n, 1) << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define itf ios_base::sync_with_stdio(false)
#define ct cin.tie(NULL)
int Z[100002];
int step(int a[], int n, int i) {
if (i >= n)
return 0;
if (Z[i] != -1)
return Z[i];
return (Z[i] = min(abs(a[i - 1] - a[i]) + step(a, n, i + 1),
abs(a[i - 1] - a[i + 1]) + step(a, n, i + 2)));
}
int main() {
memset(Z, -1, sizeof(Z));
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
cout << step(a, n, 1) << " ";
return 0;
}
|
replace
| 12 | 14 | 12 | 17 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define lc (rt << 1)
#define rc (rt << 1 | 1)
#define mp make_pair
#define pb push_back
#define lowbit(a) (a & (-a))
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define mst(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x ": " << x << '\n';
#define IOS \
{ \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
}
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
const int N = 1000010;
const int mod = 1e9 + 7;
const ld PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> inline void gmax(T &A, T B) { (A < B) && (A = B); }
template <typename T> inline void gmin(T &A, T B) { (A > B) && (A = B); }
template <class T> inline bool re(T &ret) {
char c;
int sgn;
if (c = getchar(), c == EOF)
return 0;
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
int h[11111], dp[11111];
int main() {
#ifdef local
// freopen("in.txt", "r", stdin);
#endif
IOS;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define lc (rt << 1)
#define rc (rt << 1 | 1)
#define mp make_pair
#define pb push_back
#define lowbit(a) (a & (-a))
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define mst(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x ": " << x << '\n';
#define IOS \
{ \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
}
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
const int N = 1000010;
const int mod = 1e9 + 7;
const ld PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> inline void gmax(T &A, T B) { (A < B) && (A = B); }
template <typename T> inline void gmin(T &A, T B) { (A > B) && (A = B); }
template <class T> inline bool re(T &ret) {
char c;
int sgn;
if (c = getchar(), c == EOF)
return 0;
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
int h[111111], dp[111111];
int main() {
#ifdef local
// freopen("in.txt", "r", stdin);
#endif
IOS;
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[2] = abs(h[1] - h[2]);
for (int i = 3; i <= n; i++)
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cout << dp[n];
return 0;
}
|
replace
| 56 | 57 | 56 | 57 |
0
| |
p03160
|
C++
|
Runtime Error
|
/*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : thanos1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ |
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define TEST \
int t; \
cin >> t; \
while (t--)
#define line cout << endl;
#define loop(i, a, b) for (long long int i = a; i < b; i++)
#define loopIn(i, a, b) for (long long int i = a; i <= b; i++)
#define MAX_SIZE 1000000
#define ff first
#define ss second
#define pb push_back
#define ll long long int
#define mp make_pair
#define vt vector<tup>
#define vtt vector<vt>
#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(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
void Sieve(int *prime, int n) {
for (int i = 0; i < n; i++) {
prime[i] = 0;
}
for (int i = 2; i < n; i++) {
prime[i] = 1;
}
for (int i = 4; i < n; i += 2) {
prime[i] = 0;
}
for (int i = 3; i < n; i++) {
if (prime[i] == 1) {
for (int j = i * i; j < n; j += i) {
prime[j] = 0;
}
}
}
return;
}
void input() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("/home/yash/Desktop/CPP/input.txt", "r", stdin);
freopen("/home/yash/Desktop/CPP/output.txt", "w", stdout);
#endif
}
ll inp;
int parent[101];
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
/*int find(int a)
{
while(parent[a] > 0)
a = parent[a];
return a;
} */
void Union(int a, int b) {
parent[a] += parent[b]; // adding size of set b to set a
parent[b] = a; // making a , parent of new set
}
int find(int node) {
if (parent[node] < 0)
return node;
parent[node] = find(parent[node]);
return parent[node];
}
int main() {
input();
int n;
cin >> n;
vi V;
loop(i, 0, n) {
cin >> inp;
V.pb(inp);
}
int dp[n];
dp[0] = 0;
dp[1] = abs(V[0] - V[1]);
loop(i, 2, n) {
int ans1 = dp[i - 1] + abs(V[i] - V[i - 1]);
int ans2 = dp[i - 2] + abs(V[i] - V[i - 2]);
dp[i] = min(ans1, ans2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
/*
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
| |
| author : thanos1399 Language : C ++ |
| college : MSIT |
| _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ |
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define TEST \
int t; \
cin >> t; \
while (t--)
#define line cout << endl;
#define loop(i, a, b) for (long long int i = a; i < b; i++)
#define loopIn(i, a, b) for (long long int i = a; i <= b; i++)
#define MAX_SIZE 1000000
#define ff first
#define ss second
#define pb push_back
#define ll long long int
#define mp make_pair
#define vt vector<tup>
#define vtt vector<vt>
#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(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
void Sieve(int *prime, int n) {
for (int i = 0; i < n; i++) {
prime[i] = 0;
}
for (int i = 2; i < n; i++) {
prime[i] = 1;
}
for (int i = 4; i < n; i += 2) {
prime[i] = 0;
}
for (int i = 3; i < n; i++) {
if (prime[i] == 1) {
for (int j = i * i; j < n; j += i) {
prime[j] = 0;
}
}
}
return;
}
void input() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("/home/yash/Desktop/CPP/input.txt", "r", stdin);
freopen("/home/yash/Desktop/CPP/output.txt", "w", stdout);
#endif
}
ll inp;
int parent[101];
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
/*int find(int a)
{
while(parent[a] > 0)
a = parent[a];
return a;
} */
void Union(int a, int b) {
parent[a] += parent[b]; // adding size of set b to set a
parent[b] = a; // making a , parent of new set
}
int find(int node) {
if (parent[node] < 0)
return node;
parent[node] = find(parent[node]);
return parent[node];
}
int main() {
// input();
int n;
cin >> n;
vi V;
loop(i, 0, n) {
cin >> inp;
V.pb(inp);
}
int dp[n];
dp[0] = 0;
dp[1] = abs(V[0] - V[1]);
loop(i, 2, n) {
int ans1 = dp[i - 1] + abs(V[i] - V[i - 1]);
int ans2 = dp[i - 2] + abs(V[i] - V[i - 2]);
dp[i] = min(ans1, ans2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 104 | 105 | 104 | 105 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int N;
int memo[10001];
int arr[10001];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
memo[i] = 1000000000;
}
memo[0] = 0;
for (int i = 0; i < N; i++) {
if (i + 1 < N)
memo[i + 1] = min(memo[i + 1], memo[i] + abs(arr[i] - arr[i + 1]));
if (i + 2 < N)
memo[i + 2] = min(memo[i + 2], memo[i] + abs(arr[i] - arr[i + 2]));
}
printf("%d\n", memo[N - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int memo[100001];
int arr[100001];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &arr[i]);
memo[i] = 1000000000;
}
memo[0] = 0;
for (int i = 0; i < N; i++) {
if (i + 1 < N)
memo[i + 1] = min(memo[i + 1], memo[i] + abs(arr[i] - arr[i + 1]));
if (i + 2 < N)
memo[i + 2] = min(memo[i + 2], memo[i] + abs(arr[i] - arr[i + 2]));
}
printf("%d\n", memo[N - 1]);
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define emb emplace_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define N 999999
#define f first
#define em emplace
#define s second
#define lint long long int
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<lint> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<string> vs;
#define fori(n) for (int i = 0; i < int(n); i++)
#define cins(s) \
string s; \
cin >> s;
#define cini(i) \
lint i; \
cin >> i;
#define cind(d) \
double d; \
cin >> d;
#define cinai(a, n) \
vi a(n); \
fori(n) { cin >> a[i]; }
#define cinas(s, n) \
vs s(n); \
fori(n) { cin >> s[i]; }
#define cinad(a, n) \
vd a(n); \
fori(n) { cin >> a[i]; }
#define z 1000000007
int arr[N];
vector<int> v;
int solve(int l, int r) {
if (arr[l] != -1)
return arr[l];
else if (l == r - 1) {
arr[l] = abs(v[l] - v[r]);
return arr[l];
} else if (l == r) {
arr[l] = 0;
return arr[l];
} else if (l > r)
return 100000;
return arr[l] = min(
abs(v[l] - v[l + 1]) + solve(l + 1, r),
abs(v[l + 2] - v[l]) + solve(l + 2, r)
);
}
int main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("hex.txt", "w", stdout);
#endif
memset(arr, -1, sizeof(arr));
cini(n);
fori(n) {
cini(a);
v.pb(a);
}
int min = solve(0, n - 1);
cout << min << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define emb emplace_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long
#define N 999999
#define f first
#define em emplace
#define s second
#define lint long long int
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<lint> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<string> vs;
#define fori(n) for (int i = 0; i < int(n); i++)
#define cins(s) \
string s; \
cin >> s;
#define cini(i) \
lint i; \
cin >> i;
#define cind(d) \
double d; \
cin >> d;
#define cinai(a, n) \
vi a(n); \
fori(n) { cin >> a[i]; }
#define cinas(s, n) \
vs s(n); \
fori(n) { cin >> s[i]; }
#define cinad(a, n) \
vd a(n); \
fori(n) { cin >> a[i]; }
#define z 1000000007
int arr[N];
vector<int> v;
int solve(int l, int r) {
if (arr[l] != -1)
return arr[l];
else if (l == r - 1) {
arr[l] = abs(v[l] - v[r]);
return arr[l];
} else if (l == r) {
arr[l] = 0;
return arr[l];
} else if (l > r)
return 100000;
return arr[l] = min(
abs(v[l] - v[l + 1]) + solve(l + 1, r),
abs(v[l + 2] - v[l]) + solve(l + 2, r)
);
}
int main() {
fast;
/* #ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("hex.txt","w",stdout);
#endif*/
memset(arr, -1, sizeof(arr));
cini(n);
fori(n) {
cini(a);
v.pb(a);
}
int min = solve(0, n - 1);
cout << min << endl;
}
|
replace
| 72 | 76 | 72 | 76 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define C continue;
#define R return
#define D double
#define I insert
#define ll long long
#define ld long double
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
#define pf push_front
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vb vector<bool>
#define vd vector<D>
#define vll vector<ll>
#define vull vector<ull>
#define vld vector<ld>
#define PQ priority_queue
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vvc vector<vector<char>>
#define vvll vector<vector<ll>>
#define vvd vector<vector<D>>
#define vvld vector<vector<ld>>
#define all(v) (v).begin(), (v).end()
#define allrev(v) (v).rbegin(), (v).rend()
#define allcomp(v) v.begin(), v.end(), comp
#define allrevcomp(v) v.rbegin(), v.rend(), comp
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define pDD pair<D, D>
#define pipii pair<int, pii>
#define pcpii pair<char, pii>
#define vpld vector<pld>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpDD vector<pDD>
#define vvpii vector<vector<pii>>
#define vpipii vector<pipii>
#define F first
#define S second
#define mp make_pair
#define unm unordered_map
#define unmii unm<int, int>
#define unmll unm<ll, ll>
#define unms unm<string, int>
#define unmci unm<char, int>
#define sortvia sort(a.begin(), a.end());
#define sortvib sort(b.begin(), b.end());
#define revsorta sort(a.begin(), a.end(), greater<int>());
#define revsortb sort(b.begin(), b.end(), greater<>());
#define loop(q, n) for (int i = q; i <= n; i++)
#define loopj(r, n) for (int j = r; j < n; j++)
#define loopm(s, m) for (int k = s; k < m; k++)
#define test \
int t; \
cin >> t; \
while (t--)
#define nextline "\n"
#define tab "\t"
#define space " "
// YES
// NO
// cout
// true
// false
// yes
// no
const ll mod9 = 1e9 + 7;
const ll maxsize = 2e9 + 1;
const ll mod = 998244353;
const ll mod2 = 1073741824;
const ll INF = 1e8;
using namespace std;
int modfn(int p) {
if (p < 0)
return (-1 * p);
else
return p;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vi h(n + 1);
vi a(n + 1);
loop(1, n) cin >> h[i];
// loop(1,n)cout<<h[i]<<space;
a[n] = 0;
a[n - 1] = modfn(h[n] - h[n - 1]);
// cout<<a[n]<<space<<a[n-1];
// cout<<nextline;
int term1, term2;
for (int i = n - 2; i >= 1; i--) {
term1 = modfn(h[i] - h[i + 1]) + a[i + 1];
term2 = modfn(h[i] - h[i + 2]) + a[i + 2];
// cout<<i<<space<<term1<<space<<term2<<nextline;
a[i] = min(term1, term2);
}
cout << a[1];
}
|
#include <bits/stdc++.h>
#define C continue;
#define R return
#define D double
#define I insert
#define ll long long
#define ld long double
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
#define pf push_front
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define vb vector<bool>
#define vd vector<D>
#define vll vector<ll>
#define vull vector<ull>
#define vld vector<ld>
#define PQ priority_queue
#define vvi vector<vector<int>>
#define vvb vector<vector<bool>>
#define vvc vector<vector<char>>
#define vvll vector<vector<ll>>
#define vvd vector<vector<D>>
#define vvld vector<vector<ld>>
#define all(v) (v).begin(), (v).end()
#define allrev(v) (v).rbegin(), (v).rend()
#define allcomp(v) v.begin(), v.end(), comp
#define allrevcomp(v) v.rbegin(), v.rend(), comp
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define pDD pair<D, D>
#define pipii pair<int, pii>
#define pcpii pair<char, pii>
#define vpld vector<pld>
#define vpii vector<pii>
#define vpll vector<pll>
#define vpDD vector<pDD>
#define vvpii vector<vector<pii>>
#define vpipii vector<pipii>
#define F first
#define S second
#define mp make_pair
#define unm unordered_map
#define unmii unm<int, int>
#define unmll unm<ll, ll>
#define unms unm<string, int>
#define unmci unm<char, int>
#define sortvia sort(a.begin(), a.end());
#define sortvib sort(b.begin(), b.end());
#define revsorta sort(a.begin(), a.end(), greater<int>());
#define revsortb sort(b.begin(), b.end(), greater<>());
#define loop(q, n) for (int i = q; i <= n; i++)
#define loopj(r, n) for (int j = r; j < n; j++)
#define loopm(s, m) for (int k = s; k < m; k++)
#define test \
int t; \
cin >> t; \
while (t--)
#define nextline "\n"
#define tab "\t"
#define space " "
// YES
// NO
// cout
// true
// false
// yes
// no
const ll mod9 = 1e9 + 7;
const ll maxsize = 2e9 + 1;
const ll mod = 998244353;
const ll mod2 = 1073741824;
const ll INF = 1e8;
using namespace std;
int modfn(int p) {
if (p < 0)
return (-1 * p);
else
return p;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vi h(n + 1);
vi a(n + 1);
loop(1, n) cin >> h[i];
// loop(1,n)cout<<h[i]<<space;
a[n] = 0;
a[n - 1] = modfn(h[n] - h[n - 1]);
// cout<<a[n]<<space<<a[n-1];
// cout<<nextline;
int term1, term2;
for (int i = n - 2; i >= 1; i--) {
term1 = modfn(h[i] - h[i + 1]) + a[i + 1];
term2 = modfn(h[i] - h[i + 2]) + a[i + 2];
// cout<<i<<space<<term1<<space<<term2<<nextline;
a[i] = min(term1, term2);
}
cout << a[1];
}
|
delete
| 104 | 108 | 104 | 104 |
-6
|
terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
int N;
vector<int> h(100001);
int main(void) {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
ll dp[10001];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int n = 3; n <= N; n++) {
dp[n] =
min(dp[n - 2] + abs(h[n] - h[n - 2]), dp[n - 1] + abs(h[n] - h[n - 1]));
}
cout << dp[N] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
int N;
vector<int> h(100001);
int main(void) {
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
ll dp[100001];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int n = 3; n <= N; n++) {
dp[n] =
min(dp[n - 2] + abs(h[n] - h[n - 2]), dp[n - 1] + abs(h[n] - h[n - 1]));
}
cout << dp[N] << endl;
}
|
replace
| 15 | 16 | 15 | 16 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int h[1 << 14];
int m[1 << 14];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
m[0] = 0;
m[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
m[i] =
min(m[i - 2] + abs(h[i] - h[i - 2]), m[i - 1] + abs(h[i] - h[i - 1]));
}
cout << m[N - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int h[1 << 17];
int m[1 << 17];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
}
m[0] = 0;
m[1] = abs(h[0] - h[1]);
for (int i = 2; i < N; i++) {
m[i] =
min(m[i - 2] + abs(h[i] - h[i - 2]), m[i - 1] + abs(h[i] - h[i - 1]));
}
cout << m[N - 1] << endl;
return 0;
}
|
replace
| 6 | 8 | 6 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define inf (pow(10, 18))
#define ll long long int
#define mod 1000000007
#define ntq(z) \
long long int z; \
cin >> z; \
for (long long int i = 0; i < z; i++)
#define fi(x9, y9) for (long long int i = x9; i < y9; i++)
#define fj(x9, y9) for (long long int j = x9; j < y9; j++)
#define fk(x9, y9) for (long long int k = x9; k < y9; k++)
#define f(z9) for (long long int i = 0; i < z9; i++)
#define endl "\n"
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define stoi(s, n) \
stringstream str(s); \
str >> n;
#define get_vi(v, n) \
vi v(n); \
f(n) { cin >> v[i]; }
typedef vector<ll> vi;
typedef vector<pair<ll, ll>> vp;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
void printprecise(double l, ll precision) {
std::cout << std::fixed;
std::cout << std::setprecision(precision);
std::cout << l;
}
ll ncr(ll n, ll k) {
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++) {
for (j = 0; j <= min(i, k); j++) {
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
}
}
return C[n][k];
}
ll power_wm(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll power(ll x, ll y) {
ll res = 1; // Initialize result
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x);
// y must be even now
y = y >> 1; // y = y/2
x = (x * x);
}
return res;
}
ll root(ll x, vi &roots) {
if (roots[x] != x)
roots[x] = root(roots[x], roots);
return roots[x];
}
void unoin(ll p, ll q, vi &roots, vi &rank) {
ll rp = root(p, roots);
ll rq = root(q, roots);
if (rank[rq] < rank[rp]) {
roots[rq] = rp;
} else if (rank[rp] > rank[rq]) {
roots[rp] = rq;
} else {
roots[rp] = rq;
rank[rq]++;
}
}
ll dig_sum(ll n) {
ll s = 0;
while (n) {
s += n % 10;
n /= 10;
}
return s;
}
ll gcd(ll a, ll b) {
if (a < b) {
a = a + b;
b = a - b;
a = a - b;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
ll toD(ll x, ll y, ll m) { return x * m + y % m; }
pair<ll, ll> twoD(ll p, ll m) { return (make_pair(p / m, p % m)); }
vi parentof, vis, dist;
vvi g;
void dfs(int p) {
vis[p] = 1;
f(g[p].size()) {
if (vis[g[p][i]] == 0) {
parentof[g[p][i]] = p;
dist[g[p][i]] = dist[p] + 1;
dfs(g[p][i]);
}
}
}
vvi graph(1000);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
vi v(n);
f(n) { cin >> v[i]; }
vi dp(n);
dp[1] = abs(v[0] - v[1]);
fi(2, n) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define inf (pow(10, 18))
#define ll long long int
#define mod 1000000007
#define ntq(z) \
long long int z; \
cin >> z; \
for (long long int i = 0; i < z; i++)
#define fi(x9, y9) for (long long int i = x9; i < y9; i++)
#define fj(x9, y9) for (long long int j = x9; j < y9; j++)
#define fk(x9, y9) for (long long int k = x9; k < y9; k++)
#define f(z9) for (long long int i = 0; i < z9; i++)
#define endl "\n"
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define stoi(s, n) \
stringstream str(s); \
str >> n;
#define get_vi(v, n) \
vi v(n); \
f(n) { cin >> v[i]; }
typedef vector<ll> vi;
typedef vector<pair<ll, ll>> vp;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
void printprecise(double l, ll precision) {
std::cout << std::fixed;
std::cout << std::setprecision(precision);
std::cout << l;
}
ll ncr(ll n, ll k) {
ll C[n + 1][k + 1];
ll i, j;
for (i = 0; i <= n; i++) {
for (j = 0; j <= min(i, k); j++) {
if (j == 0 || j == i)
C[i][j] = 1;
else
C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
}
}
return C[n][k];
}
ll power_wm(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll power(ll x, ll y) {
ll res = 1; // Initialize result
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x);
// y must be even now
y = y >> 1; // y = y/2
x = (x * x);
}
return res;
}
ll root(ll x, vi &roots) {
if (roots[x] != x)
roots[x] = root(roots[x], roots);
return roots[x];
}
void unoin(ll p, ll q, vi &roots, vi &rank) {
ll rp = root(p, roots);
ll rq = root(q, roots);
if (rank[rq] < rank[rp]) {
roots[rq] = rp;
} else if (rank[rp] > rank[rq]) {
roots[rp] = rq;
} else {
roots[rp] = rq;
rank[rq]++;
}
}
ll dig_sum(ll n) {
ll s = 0;
while (n) {
s += n % 10;
n /= 10;
}
return s;
}
ll gcd(ll a, ll b) {
if (a < b) {
a = a + b;
b = a - b;
a = a - b;
}
if (b == 0)
return a;
return gcd(b, a % b);
}
ll toD(ll x, ll y, ll m) { return x * m + y % m; }
pair<ll, ll> twoD(ll p, ll m) { return (make_pair(p / m, p % m)); }
vi parentof, vis, dist;
vvi g;
void dfs(int p) {
vis[p] = 1;
f(g[p].size()) {
if (vis[g[p][i]] == 0) {
parentof[g[p][i]] = p;
dist[g[p][i]] = dist[p] + 1;
dfs(g[p][i]);
}
}
}
vvi graph(1000);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vi v(n);
f(n) { cin >> v[i]; }
vi dp(n);
dp[1] = abs(v[0] - v[1]);
fi(2, n) {
dp[i] =
min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n - 1];
return 0;
}
|
delete
| 152 | 156 | 152 | 152 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Runtime Error
|
#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(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 998244353
#define endl "\n"
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
// #DEBUG
void __print(int x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x)
cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cout << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cout << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
// ###################################################################
void fast() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
vector<int> stones;
int ans1 = INT_MAX;
int ans2 = INT_MAX;
int n;
int dp[100005];
int solve(int start) {
if (start == n - 2) {
return abs(stones[n - 1] - stones[n - 2]);
}
if (start == n - 1) {
return 0;
}
if (dp[start] != -1) {
return dp[start];
} else {
dp[start + 1] = solve(start + 1);
dp[start + 2] = solve(start + 2);
ans1 = abs(stones[start] - stones[start + 1]) + solve(start + 1);
ans2 = abs(stones[start] - stones[start + 2]) + solve(start + 2);
dp[start] = min(ans1, ans2);
return dp[start];
}
}
int32_t main() {
fast();
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
stones.push_back(a);
}
cout << solve(0);
}
|
#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(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 998244353
#define endl "\n"
#define ps(x, y) fixed << setprecision(y) << x
#define mk(arr, n, type) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
// #DEBUG
void __print(int x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cout << '{';
__print(x.first);
cout << ',';
__print(x.second);
cout << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cout << '{';
for (auto &i : x)
cout << (f++ ? "," : ""), __print(i);
cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cout << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cout << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
// ###################################################################
void fast() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
}
vector<int> stones;
int ans1 = INT_MAX;
int ans2 = INT_MAX;
int n;
int dp[100005];
int solve(int start) {
if (start == n - 2) {
return abs(stones[n - 1] - stones[n - 2]);
}
if (start == n - 1) {
return 0;
}
if (dp[start] != -1) {
return dp[start];
} else {
dp[start + 1] = solve(start + 1);
dp[start + 2] = solve(start + 2);
ans1 = abs(stones[start] - stones[start + 1]) + solve(start + 1);
ans2 = abs(stones[start] - stones[start + 2]) + solve(start + 2);
dp[start] = min(ans1, ans2);
return dp[start];
}
}
int32_t main() {
fast();
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
stones.push_back(a);
}
cout << solve(0);
}
|
replace
| 79 | 83 | 79 | 83 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll int
const ll inf = 1e9;
const int N = 1e4 + 7;
ll dp[N][3], v[N];
ll n;
ll solve(ll cur, int p) {
if (cur == n)
return 0;
if (cur > n)
return inf;
// cout<<cur<<" "<<p<<endl;
if (dp[cur][p] != -1)
return dp[cur][p];
dp[cur][p] = solve(cur + 1, 1) + abs(v[cur + 1] - v[cur]);
dp[cur][p] = min(solve(cur + 2, 2) + abs(v[cur + 2] - v[cur]), dp[cur][p]);
return dp[cur][p];
}
int main() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> v[i];
memset(dp, -1, sizeof dp);
int ans = solve(1, 1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll int
const ll inf = 1e9;
const int N = 1e5 + 7;
ll dp[N][3], v[N];
ll n;
ll solve(ll cur, int p) {
if (cur == n)
return 0;
if (cur > n)
return inf;
// cout<<cur<<" "<<p<<endl;
if (dp[cur][p] != -1)
return dp[cur][p];
dp[cur][p] = solve(cur + 1, 1) + abs(v[cur + 1] - v[cur]);
dp[cur][p] = min(solve(cur + 2, 2) + abs(v[cur + 2] - v[cur]), dp[cur][p]);
return dp[cur][p];
}
int main() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> v[i];
memset(dp, -1, sizeof dp);
int ans = solve(1, 1);
cout << ans << endl;
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repi(i, 0, n)
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
// using P = pair<int, int>;
struct Vec {
double x, y;
};
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;
}
using namespace std;
int dp[10001];
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
// cout << fixed << setprecision(15);
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
repi(i, 2, N) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repi(i, 0, n)
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
// using P = pair<int, int>;
struct Vec {
double x, y;
};
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;
}
using namespace std;
int dp[100001];
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
// cout << fixed << setprecision(15);
int N;
cin >> N;
vector<int> h(N);
rep(i, N) cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
repi(i, 2, N) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 27 | 28 | 27 | 28 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define str(a) to_string(a)
#define int long long
#define pb push_back
#define mp make_pair
#define SORT(c) sort(c.begin(), c.end())
#define max_heap priority_queue<int>
#define min_heap priority_queue<int, vector<int>, greater<int>>
#define mod 1000000007
#define setbits(x) __builtin_popcount(x)
#define ps(x, y) fixed << setprecision(y) << x
#define start(t) \
int x; \
cin >> x; \
while (x--)
#define inf LLONG_MAX
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
h[0] = 0;
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
cerr << dp[1] << " " << dp[2] << endl;
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cerr << dp[i] << " ";
}
cerr << endl;
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define str(a) to_string(a)
#define int long long
#define pb push_back
#define mp make_pair
#define SORT(c) sort(c.begin(), c.end())
#define max_heap priority_queue<int>
#define min_heap priority_queue<int, vector<int>, greater<int>>
#define mod 1000000007
#define setbits(x) __builtin_popcount(x)
#define ps(x, y) fixed << setprecision(y) << x
#define start(t) \
int x; \
cin >> x; \
while (x--)
#define inf LLONG_MAX
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
vector<int> h(n + 1);
for (int i = 1; i <= n; i++)
cin >> h[i];
h[0] = 0;
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
cerr << dp[1] << " " << dp[2] << endl;
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
cerr << dp[i] << " ";
}
cerr << endl;
cout << dp[n] << endl;
}
|
replace
| 28 | 32 | 28 | 32 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
#define ac(x, i) get<i>(x)
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define MOD 1000000007
const int infi = 1e9;
const ll infl = 1e18;
const int N = 1e5 + 100;
ll dp[N][2];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
dp[i][0] = infl;
dp[i][1] = infl;
}
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1][0] = dp[1][1] = 0LL;
for (int i = 1; i < n; i++) {
dp[i + 1][0] = min(dp[i][0], dp[i][1]) + abs(a[i + 1] - a[i]);
dp[i + 2][1] = min(dp[i][0], dp[i][1]) + abs(a[i + 2] - a[i]);
}
cout << min(dp[n][0], dp[n][1]) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
#define ac(x, i) get<i>(x)
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define MOD 1000000007
const int infi = 1e9;
const ll infl = 1e18;
const int N = 1e5 + 100;
ll dp[N][2];
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 2; i <= n; i++) {
dp[i][0] = infl;
dp[i][1] = infl;
}
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
dp[1][0] = dp[1][1] = 0LL;
for (int i = 1; i < n; i++) {
dp[i + 1][0] = min(dp[i][0], dp[i][1]) + abs(a[i + 1] - a[i]);
dp[i + 2][1] = min(dp[i][0], dp[i][1]) + abs(a[i + 2] - a[i]);
}
cout << min(dp[n][0], dp[n][1]) << "\n";
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int i, n;
cin >> n;
int h[10000], dp[10001];
for (i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int i, n;
cin >> n;
int h[n], dp[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9 + 5;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
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 j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9 + 5;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
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 j : {i + 1, i + 2}) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
}
|
replace
| 8 | 12 | 8 | 12 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int n, stones[N];
int memo[N];
int jumps(int ind) {
if (ind == (n - 1))
return 0;
if (ind >= n)
return INT_MAX;
if (memo[ind] != -1)
return memo[ind];
int oneJump = abs(stones[ind] - stones[ind + 1]) + jumps(ind + 1);
int twoJumps = INT_MAX;
if (ind + 2 < n) {
twoJumps = abs(stones[ind] - stones[ind + 2]) + jumps(ind + 2);
}
return memo[n] = min(oneJump, twoJumps);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
memset(memo, -1, sizeof(memo));
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> stones[i];
}
// We will start from first stone
cout << jumps(0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
int n, stones[N];
int memo[N];
int jumps(int ind) {
if (ind == (n - 1))
return 0;
if (ind >= n)
return INT_MAX;
if (memo[ind] != -1)
return memo[ind];
int oneJump = abs(stones[ind] - stones[ind + 1]) + jumps(ind + 1);
int twoJumps = INT_MAX;
if (ind + 2 < n) {
twoJumps = abs(stones[ind] - stones[ind + 2]) + jumps(ind + 2);
}
return memo[ind] = min(oneJump, twoJumps);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
memset(memo, -1, sizeof(memo));
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> stones[i];
}
// We will start from first stone
cout << jumps(0) << endl;
return 0;
}
|
replace
| 24 | 25 | 24 | 25 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define qmod 998244353
#define M 1000001
#define endl "\n"
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repr(i, a, b) for (int i = a; i >= b; --i)
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
int solve(int a[], int dp[], int n, int i) {
if (i == n - 1)
return 0;
else if (i == n - 2)
return abs(a[i] - a[i + 1]);
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(a[i] - a[i + 1]) + solve(a, dp, n, i + 1),
abs(a[i] - a[i + 2]) + solve(a, dp, n, i + 2));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast;
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int a[n];
rep(i, 0, n) cin >> a[i];
int dp[n];
memset(dp, -1, sizeof(dp));
cout << solve(a, dp, n, 0);
}
return 0;
}
// First, solve the problem. Then, write the code.
|
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define mod 1000000007
#define qmod 998244353
#define M 1000001
#define endl "\n"
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repr(i, a, b) for (int i = a; i >= b; --i)
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
int solve(int a[], int dp[], int n, int i) {
if (i == n - 1)
return 0;
else if (i == n - 2)
return abs(a[i] - a[i + 1]);
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(a[i] - a[i + 1]) + solve(a, dp, n, i + 1),
abs(a[i] - a[i + 2]) + solve(a, dp, n, i + 2));
}
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif */
fast;
int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int a[n];
rep(i, 0, n) cin >> a[i];
int dp[n];
memset(dp, -1, sizeof(dp));
cout << solve(a, dp, n, 0);
}
return 0;
}
// First, solve the problem. Then, write the code.
|
replace
| 36 | 40 | 36 | 40 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int minCost(ll *h, int n) {
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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]));
return dp[n - 1];
}
int main() {
c_p_c();
int n;
cin >> n;
ll h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
cout << minCost(h, n) << "\n";
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void c_p_c() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int minCost(ll *h, int n) {
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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]));
return dp[n - 1];
}
int main() {
c_p_c();
int n;
cin >> n;
ll h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
cout << minCost(h, n) << "\n";
}
|
delete
| 7 | 11 | 7 | 7 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int n;
int num[101];
int dp[101];
int main() {
memset(dp, 63, sizeof dp);
cin >> n;
for (int qq = 1; qq <= n; qq++)
cin >> num[qq];
dp[1] = 0;
dp[2] = abs(num[1] - num[2]);
for (int qq = 3; qq <= n; qq++) {
dp[qq] = min(abs(num[qq - 2] - num[qq]) + dp[qq - 2],
abs(num[qq - 1] - num[qq]) + dp[qq - 1]);
}
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int num[100001];
int dp[100001];
int main() {
memset(dp, 63, sizeof dp);
cin >> n;
for (int qq = 1; qq <= n; qq++)
cin >> num[qq];
dp[1] = 0;
dp[2] = abs(num[1] - num[2]);
for (int qq = 3; qq <= n; qq++) {
dp[qq] = min(abs(num[qq - 2] - num[qq]) + dp[qq - 2],
abs(num[qq - 1] - num[qq]) + dp[qq - 1]);
}
cout << dp[n];
return 0;
}
|
replace
| 4 | 6 | 4 | 6 |
0
| |
p03160
|
C++
|
Runtime Error
|
// g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
// int N;
vector<ll> h(10010);
vector<ll> dp(10010, INFL);
ll rec(ll i) {
if (dp[i] < INFL)
return dp[i];
if (i == 0)
return 0;
ll res = INF;
res = min(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
res = min(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> h[i];
}
cout << rec(N - 1) << endl;
}
|
// g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
ll MOD = 1e9 + 7;
int INF = 1 << 30;
ll INFL = 1LL << 60;
// int N;
vector<ll> h(100010);
vector<ll> dp(100010, INFL);
ll rec(ll i) {
if (dp[i] < INFL)
return dp[i];
if (i == 0)
return 0;
ll res = INF;
res = min(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
res = min(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> h[i];
}
cout << rec(N - 1) << endl;
}
|
replace
| 26 | 28 | 26 | 28 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define MAXN 10005
using namespace std;
int main() {
// freopen("t.txt","r",stdin);
int n;
cin >> n;
int a[MAXN];
long long dp[MAXN];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n];
}
|
#include <bits/stdc++.h>
#define MAXN 100005
using namespace std;
int main() {
// freopen("t.txt","r",stdin);
int n;
cin >> n;
int a[MAXN];
long long dp[MAXN];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++) {
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n];
}
|
replace
| 1 | 2 | 1 | 2 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int dp[10010];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int step1 = dp[i - 1] + abs(h[i] - h[i - 1]);
int step2 = dp[i - 2] + abs(h[i] - h[i - 2]);
dp[i] = min(step1, step2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
int dp[100010];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int step1 = dp[i - 1] + abs(h[i] - h[i - 1]);
int step2 = dp[i - 2] + abs(h[i] - h[i - 2]);
dp[i] = min(step1, step2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 15 | 16 | 15 | 16 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
int dp[10001];
int h[10001];
int func(int a) {
if (dp[a] != -1) {
return dp[a];
}
if (func(a - 1) + abs(h[a] - h[a - 1]) < func(a - 2) + abs(h[a] - h[a - 2])) {
return dp[a] = func(a - 1) + abs(h[a] - h[a - 1]);
} else {
return dp[a] = func(a - 2) + abs(h[a] - h[a - 2]);
}
}
int main() {
int n;
std::cin >> n;
for (int i = 0; i <= n; i++) {
dp[i] = -1;
};
for (int i = 1; i <= n; i++) {
std::cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
std::cout << func(n) << std::endl;
}
|
#include <iostream>
int dp[100001];
int h[100001];
int func(int a) {
if (dp[a] != -1) {
return dp[a];
}
if (func(a - 1) + abs(h[a] - h[a - 1]) < func(a - 2) + abs(h[a] - h[a - 2])) {
return dp[a] = func(a - 1) + abs(h[a] - h[a - 1]);
} else {
return dp[a] = func(a - 2) + abs(h[a] - h[a - 2]);
}
}
int main() {
int n;
std::cin >> n;
for (int i = 0; i <= n; i++) {
dp[i] = -1;
};
for (int i = 1; i <= n; i++) {
std::cin >> h[i];
}
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
std::cout << func(n) << std::endl;
}
|
replace
| 2 | 4 | 2 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vii vector<pii>
#define pii pair<int, int>
#define mii map<int, int>
#define pb push_back
#define rev(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl '\n'
#define F first
#define S second
#define PI 3.14159265359
#define MAXN 100007
const int mod = 1e9 + 7;
int dp[MAXN], arr[MAXN];
int n;
int solve(int idx) {
if (idx >= n)
return INT_MAX;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = min(abs(arr[idx] - arr[idx + 1]) + solve(idx + 1),
abs(arr[idx] - arr[idx + 2]) + solve(idx + 2));
return dp[idx];
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
cout << solve(0) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define vi vector<int>
#define vii vector<pii>
#define pii pair<int, int>
#define mii map<int, int>
#define pb push_back
#define rev(v) reverse(v.begin(), v.end())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl '\n'
#define F first
#define S second
#define PI 3.14159265359
#define MAXN 100007
const int mod = 1e9 + 7;
int dp[MAXN], arr[MAXN];
int n;
int solve(int idx) {
if (idx >= n)
return INT_MAX;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
dp[idx] = min(abs(arr[idx] - arr[idx + 1]) + solve(idx + 1),
abs(arr[idx] - arr[idx + 2]) + solve(idx + 2));
return dp[idx];
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
cout << solve(0) << endl;
return 0;
}
|
delete
| 37 | 41 | 37 | 37 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
int ls[N], c[N];
int calc(int n) {
c[2] = abs(ls[1] - ls[2]);
c[3] = min(abs(ls[1] - ls[3]), c[2] + abs(ls[2] - ls[3]));
for (int i = 4; i <= n; i++)
c[i] = min(c[i - 1] + abs(ls[i] - ls[i - 1]),
c[i - 2] + abs(ls[i - 2] - ls[i]));
// for (int i=2;i<=n;i++)cout<<c[i]<<" ";
return c[n];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, t;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> ls[i];
cout << calc(n) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int ls[N], c[N];
int calc(int n) {
c[2] = abs(ls[1] - ls[2]);
c[3] = min(abs(ls[1] - ls[3]), c[2] + abs(ls[2] - ls[3]));
for (int i = 4; i <= n; i++)
c[i] = min(c[i - 1] + abs(ls[i] - ls[i - 1]),
c[i - 2] + abs(ls[i - 2] - ls[i]));
// for (int i=2;i<=n;i++)cout<<c[i]<<" ";
return c[n];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, t;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> ls[i];
cout << calc(n) << "\n";
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
long long int minimum(long long int a[], long long int n, long long int b[]) {
if (n == 2) {
b[2] = abs(a[1] - a[0]);
return abs(a[1] - a[0]);
} else if (n == 3) {
long long int min = abs(a[2] - a[0]);
if (abs(a[1] - a[0]) + abs(a[2] - a[1]) < min) {
min = abs(a[1] - a[0]) + abs(a[2] - a[1]);
}
b[3] = min;
return min;
} else {
if (b[n] == -1) {
long long int min = minimum(a, n - 1, b) + abs(a[n - 1] - a[n - 2]);
long long min2 = minimum(a, n - 2, b) + abs(a[n - 1] - a[n - 3]);
if (min2 < min) {
min = min2;
}
return min;
} else {
return b[n];
}
}
}
int main() {
long long int n;
cin >> n;
long long int a[n], b[n + 1];
for (long long int i = 0; i < n; i++) {
b[i] = -1;
cin >> a[i];
}
b[n] = -1;
long long int result = minimum(a, n, b);
cout << result;
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
long long int minimum(long long int a[], long long int n, long long int b[]) {
if (n == 2) {
b[2] = abs(a[1] - a[0]);
return abs(a[1] - a[0]);
} else if (n == 3) {
long long int min = abs(a[2] - a[0]);
if (abs(a[1] - a[0]) + abs(a[2] - a[1]) < min) {
min = abs(a[1] - a[0]) + abs(a[2] - a[1]);
}
b[3] = min;
return min;
} else {
if (b[n] == -1) {
long long int min = minimum(a, n - 1, b) + abs(a[n - 1] - a[n - 2]);
long long min2 = minimum(a, n - 2, b) + abs(a[n - 1] - a[n - 3]);
if (min2 < min) {
min = min2;
}
b[n] = min;
return min;
} else {
return b[n];
}
}
}
int main() {
long long int n;
cin >> n;
long long int a[n], b[n + 1];
for (long long int i = 0; i < n; i++) {
b[i] = -1;
cin >> a[i];
}
b[n] = -1;
long long int result = minimum(a, n, b);
cout << result;
}
|
insert
| 23 | 23 | 23 | 24 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
const int mx = 2e3 + 11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define sa(v) sort(v.begin(), v.end())
#define sd(v) sort(v.begin(), v.end(), greater<>())
#define rev(s) reverse(s.begin(), s.end())
#define tt \
int t; \
cin >> t; \
while (t--)
#define lo(i, a, b) for (ll i = a; i < b; i++)
#define be(a) (a).begin(), (a).end()
#define rbe(a) (a).rbegin(), (a).rend()
#define sqr(a) ((a) * (a))
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define mem(a, b) memset(a, b, sizeof(a))
#define yes cout << "YES" << nl;
#define no cout << "NO" << nl;
#define su \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define file \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define frac \
cout.unsetf(ios::floatfield); \
cout.precision(10); \
cout.setf(ios::fixed, ios::floatfield);
#define dbg(args...) \
do { \
cerr << #args << " : "; \
faltu(args); \
} while (0)
void faltu() { cerr << endl; }
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
int dp[mx], n, a[mx];
int solve(int i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
int ret1 = INT_MAX, ret2 = INT_MAX;
if (i + 1 <= n)
ret1 = abs(a[i] - a[i + 1]) + solve(i + 1);
if (i + 2 <= n)
ret2 = abs(a[i] - a[i + 2]) + solve(i + 2);
/// dbg(i);
dp[i] = min(ret1, ret2);
return dp[i];
}
int main() {
su;
mem(dp, -1);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
cout << solve(1) << nl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
const int mx = 1e5 + 11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define sa(v) sort(v.begin(), v.end())
#define sd(v) sort(v.begin(), v.end(), greater<>())
#define rev(s) reverse(s.begin(), s.end())
#define tt \
int t; \
cin >> t; \
while (t--)
#define lo(i, a, b) for (ll i = a; i < b; i++)
#define be(a) (a).begin(), (a).end()
#define rbe(a) (a).rbegin(), (a).rend()
#define sqr(a) ((a) * (a))
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define mem(a, b) memset(a, b, sizeof(a))
#define yes cout << "YES" << nl;
#define no cout << "NO" << nl;
#define su \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define file \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define frac \
cout.unsetf(ios::floatfield); \
cout.precision(10); \
cout.setf(ios::fixed, ios::floatfield);
#define dbg(args...) \
do { \
cerr << #args << " : "; \
faltu(args); \
} while (0)
void faltu() { cerr << endl; }
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
int dp[mx], n, a[mx];
int solve(int i) {
if (i >= n)
return 0;
if (dp[i] != -1)
return dp[i];
int ret1 = INT_MAX, ret2 = INT_MAX;
if (i + 1 <= n)
ret1 = abs(a[i] - a[i + 1]) + solve(i + 1);
if (i + 2 <= n)
ret2 = abs(a[i] - a[i + 2]) + solve(i + 2);
/// dbg(i);
dp[i] = min(ret1, ret2);
return dp[i];
}
int main() {
su;
mem(dp, -1);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
cout << solve(1) << nl;
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void) {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int dp[10000];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(void) {
int n;
cin >> n;
int h[n];
rep(i, n) cin >> h[i];
int dp[1000000];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAX_N = 10000;
int h[MAX_N], dp[MAX_N + 1];
int n;
void solve() {
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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]));
}
printf("%d", dp[n - 1]);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
solve();
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAX_N = 100000;
int h[MAX_N], dp[MAX_N + 1];
int n;
void solve() {
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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]));
}
printf("%d", dp[n - 1]);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
solve();
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAXN = 1e5 + 1;
void solve() {
int h[MAXN];
ll dp[MAXN];
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i > 2) {
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[n] << '\n';
}
/////////// End Solution ///////////////////////////////////////
//////// Initialization ////////////////////////////////////
int main() {
#ifndef ONLINE_JUDGE
FILE *FIN = freopen("/home/danil/prog/input.txt", "r", stdin);
clock_t time_start = clock();
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
#ifndef ONLINE_JUDGE
fclose(FIN);
cerr << "\x1b[031m\n-----------------\nTime="
<< (ll)((double)(clock() - time_start) / CLOCKS_PER_SEC * 1000)
<< "ms\n\x1b[0m";
#endif
return 0;
}
//////// End Initialization ///////////////////////////////////////
|
#include <bits/stdc++.h>
using namespace std;
#define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAXN = 1e5 + 1;
void solve() {
int h[MAXN];
ll dp[MAXN];
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
if (i > 2) {
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
}
cout << dp[n] << '\n';
}
/////////// End Solution ///////////////////////////////////////
//////// Initialization ////////////////////////////////////
int main() {
#ifndef ONLINE_JUDGE
FILE *FIN = freopen("/home/danil/prog/input.txt", "r", stdin);
clock_t time_start = clock();
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
solve();
#ifndef ONLINE_JUDGE
fclose(FIN);
cerr << "\x1b[031m\n-----------------\nTime="
<< (ll)((double)(clock() - time_start) / CLOCKS_PER_SEC * 1000)
<< "ms\n\x1b[0m";
#endif
return 0;
}
//////// End Initialization ///////////////////////////////////////
|
insert
| 3 | 3 | 3 | 4 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <limits>
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) \
for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define lli long long int
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define um unordered_map
#define F first
#define S second
#define clr(x) memset(x, 0, sizeof(x))
#define mem(data_structure, val) \
memset(data_structure, val, sizeof(data_structure))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define endl "\n"
const ll mod = 1e9 + 7;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
um<pii, int, hash_pair> map_with_pair{};
priority_queue<int, vector<int>, greater<int>> pq_desc; // decreasing order
lli minCost(int n, lli *h) {
lli cost[n];
cost[0] = 0;
cost[1] = abs(h[0] - h[1]);
Fo(i, 2, n) {
cost[i] = min(cost[i - 1] + abs(h[i - 1] - h[i]),
cost[i - 2] + abs(h[i - 2] - h[i]));
}
return cost[n - 1];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int n;
cin >> n;
lli h[n];
fo(i, n) cin >> h[i];
lli ans = minCost(n, h);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <limits>
using namespace std;
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) \
for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define lli long long int
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define um unordered_map
#define F first
#define S second
#define clr(x) memset(x, 0, sizeof(x))
#define mem(data_structure, val) \
memset(data_structure, val, sizeof(data_structure))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define endl "\n"
const ll mod = 1e9 + 7;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
um<pii, int, hash_pair> map_with_pair{};
priority_queue<int, vector<int>, greater<int>> pq_desc; // decreasing order
lli minCost(int n, lli *h) {
lli cost[n];
cost[0] = 0;
cost[1] = abs(h[0] - h[1]);
Fo(i, 2, n) {
cost[i] = min(cost[i - 1] + abs(h[i - 1] - h[i]),
cost[i - 2] + abs(h[i - 2] - h[i]));
}
return cost[n - 1];
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
lli h[n];
fo(i, n) cin >> h[i];
lli ans = minCost(n, h);
cout << ans << endl;
return 0;
}
|
delete
| 59 | 65 | 59 | 59 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int dp[100010];
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < 2 * n; i++) {
dp[i] = 1 << 30;
// cerr << dp[i] << endl;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
// cerr << dp[i+1] << " " << dp[i]+abs(h[i]-h[i+1]) << endl;
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] - h[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int dp[100010];
int main() {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < 100010; i++) {
dp[i] = 1 << 30;
// cerr << dp[i] << endl;
}
dp[0] = 0;
for (int i = 0; i < n - 1; i++) {
// cerr << dp[i+1] << " " << dp[i]+abs(h[i]-h[i+1]) << endl;
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] - h[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 19 | 20 | 19 | 20 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
template <typename T> void vec_print(vector<T> VEC) {
rep(i, 0, VEC.size()) { cout << VEC[i] << " "; }
cout << "\n";
};
template <typename T>
void mat_print(vector<vector<T>> MAT){
rep(i, 0, MAT.size()){rep(j, 0, MAT[i].size()){cout << MAT[i][j] << " ";
}
cout << "\n";
}
}
;
class HOGE {
public:
ll index;
ll value;
HOGE(ll index, ll value) {
this->index = index;
this->value = value;
};
~HOGE(void) { return; };
void print(void) {
cout << "index : " << index << ", value : " << value << "\n";
return;
};
bool operator==(const HOGE &obj) { return (this->value == obj.value); };
bool operator<(const HOGE &obj) { return (this->value < obj.value); };
bool operator>(const HOGE &obj) { return (this->value > obj.value); };
};
constexpr int INF = (1 << 30);
constexpr ll INFLL = 1LL << 62;
constexpr long double EPS = 1e-12;
ll min_search(int pos, const int last, const vector<ll> &h, vector<ll> dp) {
if (pos >= last)
return 0;
if (dp[pos] >= 0)
return dp[pos];
if (last - pos == 1 || last - pos == 2) {
dp[pos] = abs(h[pos] - h[last]);
} else {
ll dp2 = min_search(pos + 2, last, h, dp);
ll dp1 = min_search(pos + 1, last, h, dp);
dp[pos] =
min(abs(h[pos] - h[pos + 1]) + dp1, abs(h[pos] - h[pos + 2]) + dp2);
}
return dp[pos];
}
int main() {
cin.tie(0); // cut the cin and cout (default, std::flush is performed after
// std::cin)
ios::sync_with_stdio(
false); // cut the iostream and stdio (DON'T endl; BUT "\n";)
ll N;
cin >> N;
vector<ll> h(N);
rep(i, 0, N) { cin >> h[i]; }
vector<ll> dp(N, -1);
ll ans = min_search(0, N - 1, h, dp);
cout << ans << "\n";
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
#define rep(i, x, y) for (int i = (x); i < (y); ++i)
template <typename T> void vec_print(vector<T> VEC) {
rep(i, 0, VEC.size()) { cout << VEC[i] << " "; }
cout << "\n";
};
template <typename T>
void mat_print(vector<vector<T>> MAT){
rep(i, 0, MAT.size()){rep(j, 0, MAT[i].size()){cout << MAT[i][j] << " ";
}
cout << "\n";
}
}
;
class HOGE {
public:
ll index;
ll value;
HOGE(ll index, ll value) {
this->index = index;
this->value = value;
};
~HOGE(void) { return; };
void print(void) {
cout << "index : " << index << ", value : " << value << "\n";
return;
};
bool operator==(const HOGE &obj) { return (this->value == obj.value); };
bool operator<(const HOGE &obj) { return (this->value < obj.value); };
bool operator>(const HOGE &obj) { return (this->value > obj.value); };
};
constexpr int INF = (1 << 30);
constexpr ll INFLL = 1LL << 62;
constexpr long double EPS = 1e-12;
ll min_search(int pos, const int last, const vector<ll> &h, vector<ll> &dp) {
if (pos >= last)
return 0;
if (dp[pos] >= 0)
return dp[pos];
if (last - pos == 1 || last - pos == 2) {
dp[pos] = abs(h[pos] - h[last]);
} else {
ll dp2 = min_search(pos + 2, last, h, dp);
ll dp1 = min_search(pos + 1, last, h, dp);
dp[pos] =
min(abs(h[pos] - h[pos + 1]) + dp1, abs(h[pos] - h[pos + 2]) + dp2);
}
return dp[pos];
}
int main() {
cin.tie(0); // cut the cin and cout (default, std::flush is performed after
// std::cin)
ios::sync_with_stdio(
false); // cut the iostream and stdio (DON'T endl; BUT "\n";)
ll N;
cin >> N;
vector<ll> h(N);
rep(i, 0, N) { cin >> h[i]; }
vector<ll> dp(N, -1);
ll ans = min_search(0, N - 1, h, dp);
cout << ans << "\n";
return 0;
}
|
replace
| 63 | 64 | 63 | 64 |
0
| |
p03160
|
C++
|
Runtime Error
|
#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
typedef pair<int, int> pii;
#define MOD 1000000007
#define MOD1 998244353
#define ff first
#define ss second
#define bn cout << "\n"
#define o2(a, b) cout << a << " " << b
#define sz(a) int((a).size())
#define o(a) cout << a
#define MAX6 1000006
#define int ll
#define all(x) x.begin(), x.end()
#define ppii pair<int, pii>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<ppii>
#define vs vector<string>
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define MAX5 300005
#define MAX7 10000007
#define rep(i, a, b) for (__typeof((b)) i = (a); i <= (b); i++)
#define nrep(i, b, a) for (__typeof((b)) i = (b); i >= (a); i--)
#define mem(a) memset(a, 0, sizeof(a))
#define memneg(a) memset(a, -1, sizeof(a))
// #define se second
#define LN 14
#define LIM 22
#define MAX_ALPHA 26
const long long INF64 = 1e18;
const ll INF = 1e9;
const double PI = acos(-1);
#define ld long double
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
inline void max_self(ll &a, ll b) { a = max(a, b); }
inline void min_self(ll &a, ll b) { a = min(a, b); }
inline void add_self(ll &a, ll b) {
a += b;
if (a >= MOD)
a -= MOD;
}
inline void sub_self(ll &a, ll b) {
a -= b;
if (a < 0)
a += MOD;
}
inline int mul(int a, int b) { return (int)((long long)a * b % MOD); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int countDigits(int x) {
int cnt = 0;
while (x) {
x /= 10;
cnt++;
}
return cnt;
}
ll binExpo(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b /= 2;
}
return res % MOD;
}
int sum(int a) {
int result = 0;
while (a > 0) {
result += a % 10;
a /= 10;
}
return result;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("inputf.txt", "r", stdin);
freopen("outputf.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int dp[n + 1];
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INF64;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#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
typedef pair<int, int> pii;
#define MOD 1000000007
#define MOD1 998244353
#define ff first
#define ss second
#define bn cout << "\n"
#define o2(a, b) cout << a << " " << b
#define sz(a) int((a).size())
#define o(a) cout << a
#define MAX6 1000006
#define int ll
#define all(x) x.begin(), x.end()
#define ppii pair<int, pii>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<ppii>
#define vs vector<string>
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define MAX5 300005
#define MAX7 10000007
#define rep(i, a, b) for (__typeof((b)) i = (a); i <= (b); i++)
#define nrep(i, b, a) for (__typeof((b)) i = (b); i >= (a); i--)
#define mem(a) memset(a, 0, sizeof(a))
#define memneg(a) memset(a, -1, sizeof(a))
// #define se second
#define LN 14
#define LIM 22
#define MAX_ALPHA 26
const long long INF64 = 1e18;
const ll INF = 1e9;
const double PI = acos(-1);
#define ld long double
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
inline void max_self(ll &a, ll b) { a = max(a, b); }
inline void min_self(ll &a, ll b) { a = min(a, b); }
inline void add_self(ll &a, ll b) {
a += b;
if (a >= MOD)
a -= MOD;
}
inline void sub_self(ll &a, ll b) {
a -= b;
if (a < 0)
a += MOD;
}
inline int mul(int a, int b) { return (int)((long long)a * b % MOD); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int countDigits(int x) {
int cnt = 0;
while (x) {
x /= 10;
cnt++;
}
return cnt;
}
ll binExpo(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % MOD;
a = (a * a) % MOD;
b /= 2;
}
return res % MOD;
}
int sum(int a) {
int result = 0;
while (a > 0) {
result += a % 10;
a /= 10;
}
return result;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int dp[n + 1];
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INF64;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
delete
| 99 | 103 | 99 | 99 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vii vector<int, int>
#define pii pair<int, int>
#define nn "\n"
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
std::vector<ll> v(n + 1);
for (int i = 1; i <= n; ++i)
cin >> v[i];
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int op1 = abs(v[i] - v[i - 1]) + dp[i - 1];
int op2 = (i == 2) ? INT_MAX : abs(v[i] - v[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vii vector<int, int>
#define pii pair<int, int>
#define nn "\n"
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
std::vector<ll> v(n + 1);
for (int i = 1; i <= n; ++i)
cin >> v[i];
vector<int> dp(n + 1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
int op1 = abs(v[i] - v[i - 1]) + dp[i - 1];
int op2 = (i == 2) ? INT_MAX : abs(v[i] - v[i - 2]) + dp[i - 2];
dp[i] = min(op1, op2);
}
cout << dp[n];
return 0;
}
|
replace
| 10 | 14 | 10 | 14 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int h[10100];
int f[10100];
int main() {
int N;
scanf("%d%d", &N, h + 1);
for (int i = 2; i <= N; i++) {
scanf("%d", h + i);
f[i] = f[i - 1] + abs(h[i] - h[i - 1]);
if (i - 2)
f[i] = min(f[i], f[i - 2] + abs(h[i] - h[i - 2]));
}
return printf("%d\n", f[N]) & 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int h[100100];
int f[100100];
int main() {
int N;
scanf("%d%d", &N, h + 1);
for (int i = 2; i <= N; i++) {
scanf("%d", h + i);
f[i] = f[i - 1] + abs(h[i] - h[i - 1]);
if (i - 2)
f[i] = min(f[i], f[i - 2] + abs(h[i] - h[i - 2]));
}
return printf("%d\n", f[N]) & 0;
}
|
replace
| 5 | 7 | 5 | 7 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int h[10005], dp[10005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
dp[0] = 999999;
dp[1] = 0;
for (int i = 2; i <= n; ++i)
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int h[100005], dp[100005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
dp[0] = 999999;
dp[1] = 0;
for (int i = 2; i <= n; ++i)
dp[i] =
min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i]));
cout << dp[n];
return 0;
}
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const int INF = 1001001001;
const int MOD = 1000000007;
int main(void) {
int n;
cin >> n;
vector<int> h(n); // コスト配列
rep(i, n) cin >> h[i];
queue<int> q;
q.push(0);
vector<int> c(n, INF);
c[0] = 0; // DP配列
while (!q.empty()) {
int cur_v = q.front();
q.pop();
auto change = [&](int i) {
c[cur_v + i] = min(c[cur_v + i], c[cur_v] + abs(h[cur_v + i] - h[cur_v]));
};
if (cur_v + 1 < n) {
change(1);
q.push(cur_v + 1);
}
if (cur_v + 2 < n) {
change(2);
q.push(cur_v + 2);
}
}
cout << c[n - 1] << endl;
return 0;
}
|
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const int INF = 1001001001;
const int MOD = 1000000007;
int main(void) {
int n;
cin >> n;
vector<int> h(n); // コスト配列
rep(i, n) cin >> h[i];
queue<int> q;
q.push(0);
vector<int> c(n, INF);
c[0] = 0; // DP配列
rep(i, n) {
int cur_v = i;
auto change = [&](int i) {
c[cur_v + i] = min(c[cur_v + i], c[cur_v] + abs(h[cur_v + i] - h[cur_v]));
};
if (cur_v + 1 < n) {
change(1);
q.push(cur_v + 1);
}
if (cur_v + 2 < n) {
change(2);
q.push(cur_v + 2);
}
}
cout << c[n - 1] << endl;
return 0;
}
|
replace
| 22 | 25 | 22 | 24 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 10001
#define INF INT_MAX >> 1
using namespace std;
int dp[SIZE];
int main(void) {
int n;
cin >> n;
int h[SIZE] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
fill(dp, dp + n, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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]));
}
cout << dp[n - 1] << endl;
}
|
#include <algorithm>
#include <climits>
#include <iostream>
#define SIZE 100001
#define INF INT_MAX >> 1
using namespace std;
int dp[SIZE];
int main(void) {
int n;
cin >> n;
int h[SIZE] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
}
fill(dp, dp + n, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
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]));
}
cout << dp[n - 1] << endl;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x << "=" << x << endl;
int a[10001], n, dp[10001];
int main(void) {
cin >> n;
rep(i, n) cin >> a[i];
dp[1] = abs(a[1] - a[0]);
repi(i, 2, n) dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define d(x) cerr << #x << "=" << x << endl;
int a[100001], n, dp[100001];
int main(void) {
cin >> n;
rep(i, n) cin >> a[i];
dp[1] = abs(a[1] - a[0]);
repi(i, 2, n) dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03160
|
C++
|
Runtime Error
|
// STRIVER_79
// Lets goto the next level
// AIM 6* at CC and CM at CF *__*
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define mod (int)(1e9 + 21)
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define bloop(i, a, b) for (int i = a; i >= b; i--)
#define tc(t) \
int t; \
cin >> t; \
while (t--)
#define int long long
#define ll long long
#define pb emplace_back
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define in(x) scanf("%intd", &x)
#define rr return 0
#define prec(n) fixed << setprecision(n)
#define maxheap priority_queue<int>
#define minheap priority_queue<int, vector<int>, greater<int>>
#define inf (int)(1e18)
#define ini(a, i) memset(a, i, sizeof(a))
#define fi first
#define se second
#define kitna se
#define endl "\n"
#define pi pair<int, int>
#define LL long long
const int MAXN = (int)((1e5) + 10);
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
bool isPrime(int N) {
for (int i = 2; i * i <= N; ++i) {
if (N % i == 0)
return false;
}
return true;
}
int cbrt(int x) {
int lo = 1, hi = min(2000000ll, x);
while (hi - lo > 1) {
int mid = (lo + hi) / 2;
if (mid * mid * mid < x) {
lo = mid;
} else
hi = mid;
}
if (hi * hi * hi <= x)
return hi;
else
return lo;
}
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const int nax = (int)(1 * 1e5 + 10);
// int SPF[N+5];
// void SOF()
// {
// SPF[1] = 1;
// for (int i=2; i<N; i++)
// SPF[i] = i;
// for (int i=4; i<N; i+=2)
// SPF[i] = 2;
// for (int i=3; i*i<N; i++)
// {
// if (SPF[i] == i)
// {
// for (int kon=i*i; kon<N; kon+=i)
// if (SPF[kon]==kon)
// SPF[kon] = i;
// }
// }
// }
int a[nax];
int n;
int dp[nax];
int func(int ind) {
if (ind == (n - 1))
return 0;
else if (dp[ind] != -1)
return dp[ind];
else {
int ans = 1e9 + 5;
for (int i = 1; i <= 2; i++) {
if (ind + i < n)
ans = min(ans, abs(a[ind + i] - a[ind]) + func(ind + i));
}
return dp[ind] = ans;
}
}
signed main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
// freopen("output.txt", "w", stdout);
#endif
fio;
int t = 1;
// cin >> t;
// string s;
// getline(cin,s);
while (t--) {
cin >> n;
for0(i, n) cin >> a[i];
ini(dp, -1);
cout << func(0);
}
rr;
}
|
// STRIVER_79
// Lets goto the next level
// AIM 6* at CC and CM at CF *__*
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define mod (int)(1e9 + 21)
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define bloop(i, a, b) for (int i = a; i >= b; i--)
#define tc(t) \
int t; \
cin >> t; \
while (t--)
#define int long long
#define ll long long
#define pb emplace_back
#define fio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define in(x) scanf("%intd", &x)
#define rr return 0
#define prec(n) fixed << setprecision(n)
#define maxheap priority_queue<int>
#define minheap priority_queue<int, vector<int>, greater<int>>
#define inf (int)(1e18)
#define ini(a, i) memset(a, i, sizeof(a))
#define fi first
#define se second
#define kitna se
#define endl "\n"
#define pi pair<int, int>
#define LL long long
const int MAXN = (int)((1e5) + 10);
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int max(int a, int b) {
if (a > b)
return a;
else
return b;
}
int min(int a, int b) {
if (a < b)
return a;
else
return b;
}
bool isPrime(int N) {
for (int i = 2; i * i <= N; ++i) {
if (N % i == 0)
return false;
}
return true;
}
int cbrt(int x) {
int lo = 1, hi = min(2000000ll, x);
while (hi - lo > 1) {
int mid = (lo + hi) / 2;
if (mid * mid * mid < x) {
lo = mid;
} else
hi = mid;
}
if (hi * hi * hi <= x)
return hi;
else
return lo;
}
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const int nax = (int)(1 * 1e5 + 10);
// int SPF[N+5];
// void SOF()
// {
// SPF[1] = 1;
// for (int i=2; i<N; i++)
// SPF[i] = i;
// for (int i=4; i<N; i+=2)
// SPF[i] = 2;
// for (int i=3; i*i<N; i++)
// {
// if (SPF[i] == i)
// {
// for (int kon=i*i; kon<N; kon+=i)
// if (SPF[kon]==kon)
// SPF[kon] = i;
// }
// }
// }
int a[nax];
int n;
int dp[nax];
int func(int ind) {
if (ind == (n - 1))
return 0;
else if (dp[ind] != -1)
return dp[ind];
else {
int ans = 1e9 + 5;
for (int i = 1; i <= 2; i++) {
if (ind + i < n)
ans = min(ans, abs(a[ind + i] - a[ind]) + func(ind + i));
}
return dp[ind] = ans;
}
}
signed main() {
int t = 1;
// cin >> t;
// string s;
// getline(cin,s);
while (t--) {
cin >> n;
for0(i, n) cin >> a[i];
ini(dp, -1);
cout << func(0);
}
rr;
}
|
replace
| 118 | 125 | 118 | 119 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vs vector<string>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define mc map<char, ll>
#define itr ::iterator
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fe(i, a, b) for (ll i = a; i <= b; i++)
#define fn(i, a, b) for (ll i = a; i > b; i--)
#define fne(i, a, b) for (ll i = a; i >= b; i--)
#define fm(it, m) for (it = m.begin(); it != m.end(); ++it)
#define all(v) v.begin(), v.end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define M 1000000007
#define pi 3.14159265358979323846
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int T = 1;
cin >> T;
f(t, 0, T) {
ll n = 0;
//,i=0,j=0,k=0,flag=0;
cin >> n;
vi a(n), dp(n);
f(i, 0, n) cin >> a[i];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
f(i, 2, n) {
dp[i] = min((dp[i - 2] + abs(a[i] - a[i - 2])),
(dp[i - 1] + abs(a[i] - a[i - 1])));
}
cout << dp[n - 1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define pb push_back
#define mp make_pair
#define pii pair<ll, ll>
#define vi vector<ll>
#define vs vector<string>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define mc map<char, ll>
#define itr ::iterator
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fe(i, a, b) for (ll i = a; i <= b; i++)
#define fn(i, a, b) for (ll i = a; i > b; i--)
#define fne(i, a, b) for (ll i = a; i >= b; i--)
#define fm(it, m) for (it = m.begin(); it != m.end(); ++it)
#define all(v) v.begin(), v.end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define M 1000000007
#define pi 3.14159265358979323846
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int T = 1;
// cin>>T;
f(t, 0, T) {
ll n = 0;
//,i=0,j=0,k=0,flag=0;
cin >> n;
vi a(n), dp(n);
f(i, 0, n) cin >> a[i];
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
f(i, 2, n) {
dp[i] = min((dp[i - 2] + abs(a[i] - a[i - 2])),
(dp[i - 1] + abs(a[i] - a[i - 1])));
}
cout << dp[n - 1] << endl;
}
return 0;
}
|
replace
| 34 | 35 | 34 | 35 |
-11
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define filename "lynext"
#define freop \
freopen(filename ".cik", "w", stdout); \
freopen(filename ".gir", "r", stdin)
const long long int N = ((long long int)1e5) + 5;
const long long int M = ((long long int)1e3) + 5;
const long long int llinf = (long long int)1e18;
const int inf = INT_MAX;
typedef long long int lli;
lli dp[N];
lli n;
lli h[N];
lli f(lli i) {
if (dp[i] != -1)
return dp[i];
if (i == n)
return 0;
if (i == n - 1)
return abs(h[n] - h[i]);
lli t1 = f(i + 1) + abs(h[i] - h[i + 1]);
lli t2 = f(i + 2) + abs(h[i] - h[i + 2]);
return min(t1, t2);
}
int main() {
fast;
// freop;
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << f(1) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define MOD ((int)(1e9) + 7)
#define fast \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define filename "lynext"
#define freop \
freopen(filename ".cik", "w", stdout); \
freopen(filename ".gir", "r", stdin)
const long long int N = ((long long int)1e5) + 5;
const long long int M = ((long long int)1e3) + 5;
const long long int llinf = (long long int)1e18;
const int inf = INT_MAX;
typedef long long int lli;
lli dp[N];
lli n;
lli h[N];
lli f(lli i) {
if (dp[i] != -1)
return dp[i];
if (i == n)
return 0;
if (i == n - 1)
return abs(h[n] - h[i]);
lli t1 = f(i + 1) + abs(h[i] - h[i + 1]);
lli t2 = f(i + 2) + abs(h[i] - h[i + 2]);
return dp[i] = min(t1, t2);
}
int main() {
fast;
// freop;
cin >> n;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << f(1) << "\n";
}
|
replace
| 34 | 35 | 34 | 35 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long int
#define lld long double
#define F first
#define S second
#define f(i, a, b) for (int i = a; i <= b; i++)
#define g(i, a, b) for (int i = a; i >= b; i--)
#define mp make_pair
#define pb push_back
#define mh make_heap
#define ph push_heap
#define pq priority_queue
#define bits(x) __builtin_popcountll(x)
#define op(x) cout << "Case #" << x << ": "
using namespace std;
ll mod = 1000000007;
ll INF = 1000000000000000000;
ll n;
ll a[100001];
void solve(int t) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
b[i] =
min(abs(a[i - 1] - a[i]) + b[i - 1], abs(a[i - 2] - a[i]) + b[i - 2]);
}
cout << b[n - 1] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
}
}
|
#include <bits/stdc++.h>
#include <iostream>
#define ll long long int
#define lld long double
#define F first
#define S second
#define f(i, a, b) for (int i = a; i <= b; i++)
#define g(i, a, b) for (int i = a; i >= b; i--)
#define mp make_pair
#define pb push_back
#define mh make_heap
#define ph push_heap
#define pq priority_queue
#define bits(x) __builtin_popcountll(x)
#define op(x) cout << "Case #" << x << ": "
using namespace std;
ll mod = 1000000007;
ll INF = 1000000000000000000;
ll n;
ll a[100001];
void solve(int t) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll b[n];
b[0] = 0;
b[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
b[i] =
min(abs(a[i - 1] - a[i]) + b[i - 1], abs(a[i - 2] - a[i]) + b[i - 2]);
}
cout << b[n - 1] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
}
}
|
replace
| 40 | 46 | 40 | 46 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int a[10010];
int b[10010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[0] = 0;
b[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
int l = abs(a[i] - a[i - 1]) + b[i - 1];
int r = abs(a[i] - a[i - 2]) + b[i - 2];
b[i] = min(l, r);
}
cout << b[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int b[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
b[0] = 0;
b[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
int l = abs(a[i] - a[i - 1]) + b[i - 1];
int r = abs(a[i] - a[i - 2]) + b[i - 2];
b[i] = min(l, r);
}
cout << b[n - 1];
return 0;
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p03160
|
Python
|
Runtime Error
|
import functools
import threading
import sys
class SearchProblem(object):
def __init__(self, N, H):
self.N = N
self.H = H
def isEnd(self, i):
return i == self.N
def succ(self, i):
res = []
if i + 1 <= self.N:
res.append((i + 1, abs(self.H[i + 1] - self.H[i])))
if i + 2 <= self.N:
res.append((i + 2, abs(self.H[i + 2] - self.H[i])))
return res
def solve(problem: SearchProblem):
@functools.lru_cache(maxsize=None)
def future_cost(s):
if problem.isEnd(s):
return 0
else:
return min(
cost + future_cost(next_state) for next_state, cost in problem.succ(s)
)
return future_cost(1)
def main():
N = int(input())
H = [None] + [int(x) for x in input().split(" ")]
problem = SearchProblem(N, H)
print(solve(problem))
if __name__ == "__main__":
sys.setrecursionlimit(1024 * 1024)
threading.stack_size(128 * 1024 * 1024)
threading.Thread(target=main).start()
|
import functools
import threading
import sys
class SearchProblem(object):
def __init__(self, N, H):
self.N = N
self.H = H
def isEnd(self, i):
return i == self.N
def succ(self, i):
res = []
if i + 1 <= self.N:
res.append((i + 1, abs(self.H[i + 1] - self.H[i])))
if i + 2 <= self.N:
res.append((i + 2, abs(self.H[i + 2] - self.H[i])))
return res
def solve(problem: SearchProblem):
@functools.lru_cache(maxsize=None)
def future_cost(s):
if problem.isEnd(s):
return 0
else:
return min(
cost + future_cost(next_state) for next_state, cost in problem.succ(s)
)
return future_cost(1)
def main():
N = int(input())
H = [None] + [int(x) for x in input().split(" ")]
problem = SearchProblem(N, H)
print(solve(problem))
if __name__ == "__main__":
sys.setrecursionlimit(1024 * 1024 * 2)
threading.stack_size(128 * 1024 * 1024 * 2)
threading.Thread(target=main).start()
|
replace
| 43 | 45 | 43 | 45 |
RuntimeError: can't start new thread
|
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03160/Python/s280441279.py", line 47, in <module>
threading.Thread(target=main).start()
File "/usr/lib/python3.10/threading.py", line 935, in start
_start_new_thread(self._bootstrap, ())
RuntimeError: can't start new thread
|
p03160
|
C++
|
Runtime Error
|
// Author : Vipul Sharma
// LIBRARIES
#include <bits/stdc++.h>
// MACROS
#define ll long long int
#define rep(i, a, b) for (i = a; i < b; i++)
#define rev(i, b, a) for (i = b - 1; i >= a; i--)
#define s1rep(i, a, b) for (i = 1; i <= b; i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define ld long double
#define pb push_back
#define w(t) while (t--)
#define booster \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define deb3(x, y, z) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << endl;
#define deb4(x, y, z, w) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << "\t" << #w << " : " << w << endl;
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
using namespace std;
long long cost = 1e18;
// FUNCTIONS
ll power(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1) {
res *= a;
n--;
} else {
a *= a;
n >>= 1;
}
}
return res;
}
ll dp[100001];
ll solve(ll a[], ll n) {
ll dp[n], i;
rep(i, 0, n) dp[i] = INT_MAX;
dp[0] = 0;
for (i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
return dp[n - 1];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
booster;
ll n, i;
cin >> n;
ll a[n];
rep(i, 0, n) cin >> a[i];
cout << solve(a, n) << endl;
return 0;
}
|
// Author : Vipul Sharma
// LIBRARIES
#include <bits/stdc++.h>
// MACROS
#define ll long long int
#define rep(i, a, b) for (i = a; i < b; i++)
#define rev(i, b, a) for (i = b - 1; i >= a; i--)
#define s1rep(i, a, b) for (i = 1; i <= b; i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define ld long double
#define pb push_back
#define w(t) while (t--)
#define booster \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define deb1(x) cout << #x << " : " << x << endl;
#define deb2(x, y) cout << #x << " : " << x << "\t" << #y << " : " << y << endl;
#define deb3(x, y, z) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << endl;
#define deb4(x, y, z, w) \
cout << #x << " : " << x << "\t" << #y << " : " << y << "\t" << #z << " : " \
<< z << "\t" << #w << " : " << w << endl;
#define deb5(a, b, c, d, e) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define deb6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
using namespace std;
long long cost = 1e18;
// FUNCTIONS
ll power(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1) {
res *= a;
n--;
} else {
a *= a;
n >>= 1;
}
}
return res;
}
ll dp[100001];
ll solve(ll a[], ll n) {
ll dp[n], i;
rep(i, 0, n) dp[i] = INT_MAX;
dp[0] = 0;
for (i = 0; i < n; i++) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j]));
}
}
return dp[n - 1];
}
int main() {
booster;
ll n, i;
cin >> n;
ll a[n];
rep(i, 0, n) cin >> a[i];
cout << solve(a, n) << endl;
return 0;
}
|
delete
| 68 | 72 | 68 | 68 |
-11
| |
p03160
|
Python
|
Runtime Error
|
import sys
sys.setrecursionlimit(10**4)
n = int(input())
h = [int(x) for x in input().split()]
dp = [-1 for _ in range(n)]
def rec_dp(i: int) -> int:
global h, dp
if i == 0:
return 0
if dp[i] != -1:
return dp[i]
res = rec_dp(i - 1) + abs(h[i] - h[i - 1])
if i - 2 >= 0:
res = min(rec_dp(i - 2) + abs(h[i] - h[i - 2]), res)
dp[i] = res
return res
print(rec_dp(n - 1))
|
import sys
sys.setrecursionlimit(10**9)
n = int(input())
h = [int(x) for x in input().split()]
dp = [-1 for _ in range(n)]
def rec_dp(i: int) -> int:
global h, dp
if i == 0:
return 0
if dp[i] != -1:
return dp[i]
res = rec_dp(i - 1) + abs(h[i] - h[i - 1])
if i - 2 >= 0:
res = min(rec_dp(i - 2) + abs(h[i] - h[i - 2]), res)
dp[i] = res
return res
print(rec_dp(n - 1))
|
replace
| 2 | 3 | 2 | 3 |
0
| |
p03160
|
Python
|
Runtime Error
|
"""
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *H = map(int, readline().split())
dp = [0] * N
dp[1] = abs(H[1] - H[0])
for i in range(2, N):
dp[i] = min(dp[i - k] + abs(H[i] - H[i - k]) for k in [1, 2])
ans = dp[-1]
print(ans)
|
"""
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *H = map(int, read().split())
dp = [0] * N
dp[1] = abs(H[1] - H[0])
for i in range(2, N):
dp[i] = min(dp[i - k] + abs(H[i] - H[i - k]) for k in [1, 2])
ans = dp[-1]
print(ans)
|
replace
| 16 | 17 | 16 | 17 |
IndexError: list index out of range
|
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03160/Python/s149948517.py", line 19, in <module>
dp[1] = abs(H[1] - H[0])
IndexError: list index out of range
|
p03160
|
Python
|
Runtime Error
|
# -*- coding: utf-8 -*-
# Input#
n = int(input())
# n, k = map(int, input().split())
h = list(map(int, input().split()))
h = [-1] + h
ans = 0
memo = [-1] * (n + 1)
memo[1] = 0
memo[2] = abs(h[2] - h[1])
def dp(i):
if memo[i] != -1:
return memo[i]
else:
hop1 = dp(i - 1) + abs(h[i] - h[i - 1])
hop2 = dp(i - 2) + abs(h[i] - h[i - 2])
memo[i] = min(hop1, hop2)
return memo[i]
for i in range(n):
tmp = dp(i)
ans = dp(n)
print("{}".format(ans))
|
# -*- coding: utf-8 -*-
# Input#
n = int(input())
# n, k = map(int, input().split())
h = list(map(int, input().split()))
h = [-1] + h
ans = 0
memo = [-1] * (n + 1)
memo[1] = 0
memo[2] = abs(h[2] - h[1])
def dp(i):
if memo[i] != -1:
return memo[i]
else:
hop1 = dp(i - 1) + abs(h[i] - h[i - 1])
hop2 = dp(i - 2) + abs(h[i] - h[i - 2])
memo[i] = min(hop1, hop2)
return memo[i]
for i in range(n):
if i == 0 or i == 1 or i == 2:
continue
hop1 = memo[i - 1] + abs(h[i] - h[i - 1])
hop2 = memo[i - 2] + abs(h[i] - h[i - 2])
memo[i] = min(hop1, hop2)
ans = dp(n)
print("{}".format(ans))
|
replace
| 26 | 27 | 26 | 31 |
0
| |
p03160
|
Python
|
Runtime Error
|
N = int(input())
h = [int(i) for i in input().split()]
memo = [float("inf")] * N
memo[0], memo[1] = 0, abs(h[1] - h[0])
def frog(ith):
if memo[ith] != float("inf"):
return memo[ith]
memo[ith] = min(
frog(ith - 1) + abs(h[ith] - h[ith - 1]),
frog(ith - 2) + abs(h[ith] - h[ith - 2]),
)
return memo[ith]
print(frog(N - 1))
|
import sys
sys.setrecursionlimit(500000)
N = int(input())
h = [int(i) for i in input().split()]
memo = [float("inf")] * N
memo[0], memo[1] = 0, abs(h[1] - h[0])
def frog(ith):
if memo[ith] != float("inf"):
return memo[ith]
memo[ith] = min(
frog(ith - 1) + abs(h[ith] - h[ith - 1]),
frog(ith - 2) + abs(h[ith] - h[ith - 2]),
)
return memo[ith]
print(frog(N - 1))
|
insert
| 0 | 0 | 0 | 3 |
0
| |
p03160
|
Python
|
Runtime Error
|
def frog():
n = int(input())
h_list = list(map(int, input().split()))
dp = [0] * 100
for n_element in range(n):
if n_element >= 2:
dp[n_element] = min(
dp[n_element - 1] + abs(h_list[n_element] - h_list[n_element - 1]),
dp[n_element - 2] + abs(h_list[n_element] - h_list[n_element - 2]),
)
elif n_element == 1:
dp[n_element] = abs(h_list[n_element] - h_list[n_element - 1])
else:
dp[n_element] = 0
print(dp[n - 1])
if __name__ == "__main__":
frog()
|
def frog():
n = int(input())
h_list = list(map(int, input().split()))
dp = [0] * 10**5
for n_element in range(n):
if n_element >= 2:
dp[n_element] = min(
dp[n_element - 1] + abs(h_list[n_element] - h_list[n_element - 1]),
dp[n_element - 2] + abs(h_list[n_element] - h_list[n_element - 2]),
)
elif n_element == 1:
dp[n_element] = abs(h_list[n_element] - h_list[n_element - 1])
else:
dp[n_element] = 0
print(dp[n - 1])
if __name__ == "__main__":
frog()
|
replace
| 4 | 5 | 4 | 5 |
0
| |
p03160
|
Python
|
Runtime Error
|
INF = float("inf")
def LIST():
return list(map(int, input().split()))
def rec(i: int):
if dp[i] < INF:
return dp[i]
if i == 0:
return 0
res = INF
res = min(res, rec(i - 1) + abs(h[i] - h[i - 1]))
if i > 1:
res = min(res, rec(i - 2) + abs(h[i] - h[i - 2]))
dp[i] = res
return dp[i]
N = int(input())
h = LIST()
h.extend([0] * 2)
dp = [INF] * (N + 2)
print(rec(N - 1))
|
import sys
sys.setrecursionlimit(10**9)
INF = float("inf")
def LIST():
return list(map(int, input().split()))
def rec(i: int):
if dp[i] < INF:
return dp[i]
if i == 0:
return 0
res = INF
res = min(res, rec(i - 1) + abs(h[i] - h[i - 1]))
if i > 1:
res = min(res, rec(i - 2) + abs(h[i] - h[i - 2]))
dp[i] = res
return dp[i]
N = int(input())
h = LIST()
h.extend([0] * 2)
dp = [INF] * (N + 2)
print(rec(N - 1))
|
insert
| 0 | 0 | 0 | 4 |
0
| |
p03160
|
Python
|
Runtime Error
|
N, K = map(int, input().split())
K = 2
(*h,) = map(int, input().split())
a = [abs(h[0] - h[k]) for k in range(K)]
for n in range(N - K):
a = a[1:] + [min([a[k] + abs(h[n + k] - h[n + K]) for k in range(K)])]
print(a[K - 1])
|
N, K = int(input()), 2
(*h,) = map(int, input().split())
a = [abs(h[0] - h[k]) for k in range(K)]
for n in range(N - K):
a = a[1:] + [min([a[k] + abs(h[n + k] - h[n + K]) for k in range(K)])]
print(a[K - 1])
|
replace
| 0 | 2 | 0 | 1 |
ValueError: not enough values to unpack (expected 2, got 1)
|
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03160/Python/s413689583.py", line 1, in <module>
N, K = map(int, input().split())
ValueError: not enough values to unpack (expected 2, got 1)
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int n, dp[10002], v[100002];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = dp[i - 1] + abs(v[i] - v[i - 1]);
else
dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]),
dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("carte.in");
ofstream fout("carte.out");
int n, dp[100002], v[100002];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i == 2)
dp[i] = dp[i - 1] + abs(v[i] - v[i - 1]);
else
dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]),
dp[i - 2] + abs(v[i] - v[i - 2]));
}
cout << dp[n];
return 0;
}
|
replace
| 4 | 5 | 4 | 8 |
0
| |
p03160
|
Python
|
Runtime Error
|
import sys
# import numpy as np
def main():
f = sys.stdin.buffer
N, K = map(int, f.readline().split())
H = list(map(int, f.readline().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(
dp[i - k - 1] + abs(H[i] - H[i - k - 1]) for k in range(K) if i - k - 1 >= 0
)
print(dp[-1])
if __name__ == "__main__":
main()
|
n = int(input())
h = list(map(int, input().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0, p1 = p1, p2
print(p1)
|
replace
| 0 | 19 | 0 | 7 |
ValueError: not enough values to unpack (expected 2, got 1)
|
Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03160/Python/s516514400.py", line 19, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03160/Python/s516514400.py", line 8, in main
N, K = map(int, f.readline().split())
ValueError: not enough values to unpack (expected 2, got 1)
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define inf 1000000000000000007
#define eps 0.000001
#define pi 3.141592653589793
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vii vector<int>
#define vpl vector<pll>
#define vll vector<ll>
#define sti stack<int>
#define stll stack<ll>
#define mseti set<ll>
#define msetd multiset<ll, greater<ll>>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define stp setprecision(20) // use fixed before stp
#define endl '\n'
int main() {
FAST
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ll n;
cin >> n;
ll a[n], dp[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
dp[i] = inf;
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define inf 1000000000000000007
#define eps 0.000001
#define pi 3.141592653589793
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vii vector<int>
#define vpl vector<pll>
#define vll vector<ll>
#define sti stack<int>
#define stll stack<ll>
#define mseti set<ll>
#define msetd multiset<ll, greater<ll>>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define stp setprecision(20) // use fixed before stp
#define endl '\n'
int main() {
FAST ll n;
cin >> n;
ll a[n], dp[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
dp[i] = inf;
}
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
}
|
replace
| 31 | 37 | 31 | 32 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <climits>
using namespace std;
#define endl '\n'
// #define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define c0(x) cout << (x) << " "
#define c1(x) cout << (x) << endl
#define rep for (ll i = 0; i < n; i++)
#define f(i, s, n) for (ll i = s; i < n; i++)
#define fe(i, s, n) for (ll i = s; i <= n; i++)
#define rfe(i, s, n) for (ll i = s; i >= n; i--)
#define TCs(x) \
ll x; \
cin >> x; \
while (x--)
#define TC(x) \
ll x = 1; \
while (x--)
#define f2(it, v) for (it = v.begin(); it != v.end(); ++it)
#define fori(it, x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define auto(m) for (auto &it : m)
#define ip(n, a) \
ll n; \
cin >> n; \
ll a[n]; \
rep { cin >> a[i]; }
#define ip2(n, a, b) \
ll n; \
cin >> n; \
ll a[n]; \
ll b[n]; \
rep { cin >> a[i]; } \
rep { cin >> b[i]; }
// #define ip(n,a) ll n;cin>>n;ll a[n];rep{cin>>a[i];}
#define op(n, a) \
f(i, 0, n) { cout << a[i] << " "; }
#define i2p(n, k, a) \
ll n, k; \
cin >> n >> k; \
ll a[n]; \
rep { cin >> a[i]; }
// #define ll long long
// #define ld long double
// #define vl vector<ll>
#define mll map<ll, ll>
#define mcl map<char, ll>
#define msl map<string, ll>
#define mp make_pair
#define pii pair<ll, ll>
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define vsort(v) sort(all(v))
#define vrsort(v) reverse(all(v))
#define Max(x, y, z) max(x, max(y, z))
#define Min(x, y, z) min(x, min(y, z))
// #define F first
// #define S second
// #define ps(x,y) fixed<<setprecision(y)<<x
// #define ps(x) std::cout << std::fixed; std::cout <<
// std::setprecision(x);
#define clz(a) \
__builtin_clz(a) // count leading zeroes
// (geeksforgeeks.org/builtin-functions-gcc-compiler/)
#define ctz(a) __builtin_ctz(a) // count trailing zeroes
// #define ctz(a) __builtin_ctzll(a)
#define popc(a) \
__builtin_popcount(a) // count set bits (for ints only diff for ll)
#define GCD(A, B) __gcd(A, B)
// #define LCM(A,B) boost::math::lcm(A,B)
// #define COUNT(v,x) count(all(v),x)
// #define COUNT(v,x) count(all(s),'x')
// Typedefs:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<ll, ll> pairs;
// typedef vector<pair<ll, pair<ll, ll>>> vppl;
const int N = 1e5 + 5;
const long long MOD = (long long)(1e9 + 7);
const long long INF = (long long)(1e9 + 5);
const long long INIT = (long long)(1e6 + 1);
// Functions:----------------------------------------------------------------------------------------------------------------------------------------------------------------------
inline string IntToString(ll a) {
char x[100];
sprintf(x, "%lld", a);
string s = x;
return s;
}
//....................................................................................//
inline ll StringToInt(string a) {
char x[100];
ll res;
strcpy(x, a.c_str());
sscanf(x, "%lld", &res);
return res;
}
//....................................................................................//
inline string GetString(void) {
char x[1000005];
scanf("%s", x);
string s = x;
return s;
}
//....................................................................................//
inline string uppercase(string s) {
int n = s.size();
f(i, 0, n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
return s;
}
//....................................................................................//
inline string lowercase(string s) {
int n = s.size();
f(i, 0, n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
return s;
}
//....................................................................................//
inline void OPEN(string s) {
#ifndef TESTING
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
#endif
}
//....................................................................................//
template <typename T, typename U> // Same as max_val = max (max_val, val)
static inline void amin(T &x, U y) // Same as min_val = min (min_val,val)
{
if (y < x) // maximum = amax(max_val, val);
x = y; // minimum = amin (min_val, val);
}
//....................................................................................//
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
//....................................................................................//
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2);
p = (p * p);
return (y % 2 == 0) ? p : (x * p);
}
//....................................................................................//
int lcm(ll a, ll b) {
ll lar = max(a, b);
ll small = min(a, b);
for (ll i = lar;; i += lar) {
if (i % small == 0)
return i;
}
}
//....................................................................................//
int bsearch(ll arr[], ll l, ll r, ll x) {
while (l <= r) {
ll m = l + (r - l) / 2;
if (arr[m] == x) {
return m;
}
if (arr[m] < x) {
l = m + 1;
} else
r = m - 1;
}
return -1;
}
//....................................................................................//
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename T> T pow(T a, T b, ll m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
// int bsearch(ll arr[], ll l, ll r, ll x){while (l <= r){ll m = l + (r - l) /
// 2;if(arr[m] == x){return m;}if(arr[m] < x){l = m + 1;}else{r = m - 1;}}}
// Solve:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
void solve() {
ll n;
cin >> n;
ll a[n + 1];
fe(i, 1, n) { cin >> a[i]; }
ll dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fe(i, 3, n) {
ll x = dp[i - 1] + abs(a[i] - a[i - 1]);
ll y = dp[i - 2] + abs(a[i] - a[i - 2]);
dp[i] = min(x, y);
}
cout << dp[n] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
TC(t) { solve(); }
#ifdef LOCAL
cerr << "Time elapsed: " << (double)clock() / CLOCKS_PER_SEC * 1000
<< " ms.\n";
#endif // LOCAL
return 0;
}
|
#include <bits/stdc++.h>
#include <climits>
using namespace std;
#define endl '\n'
// #define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define c0(x) cout << (x) << " "
#define c1(x) cout << (x) << endl
#define rep for (ll i = 0; i < n; i++)
#define f(i, s, n) for (ll i = s; i < n; i++)
#define fe(i, s, n) for (ll i = s; i <= n; i++)
#define rfe(i, s, n) for (ll i = s; i >= n; i--)
#define TCs(x) \
ll x; \
cin >> x; \
while (x--)
#define TC(x) \
ll x = 1; \
while (x--)
#define f2(it, v) for (it = v.begin(); it != v.end(); ++it)
#define fori(it, x) \
for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define auto(m) for (auto &it : m)
#define ip(n, a) \
ll n; \
cin >> n; \
ll a[n]; \
rep { cin >> a[i]; }
#define ip2(n, a, b) \
ll n; \
cin >> n; \
ll a[n]; \
ll b[n]; \
rep { cin >> a[i]; } \
rep { cin >> b[i]; }
// #define ip(n,a) ll n;cin>>n;ll a[n];rep{cin>>a[i];}
#define op(n, a) \
f(i, 0, n) { cout << a[i] << " "; }
#define i2p(n, k, a) \
ll n, k; \
cin >> n >> k; \
ll a[n]; \
rep { cin >> a[i]; }
// #define ll long long
// #define ld long double
// #define vl vector<ll>
#define mll map<ll, ll>
#define mcl map<char, ll>
#define msl map<string, ll>
#define mp make_pair
#define pii pair<ll, ll>
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define vsort(v) sort(all(v))
#define vrsort(v) reverse(all(v))
#define Max(x, y, z) max(x, max(y, z))
#define Min(x, y, z) min(x, min(y, z))
// #define F first
// #define S second
// #define ps(x,y) fixed<<setprecision(y)<<x
// #define ps(x) std::cout << std::fixed; std::cout <<
// std::setprecision(x);
#define clz(a) \
__builtin_clz(a) // count leading zeroes
// (geeksforgeeks.org/builtin-functions-gcc-compiler/)
#define ctz(a) __builtin_ctz(a) // count trailing zeroes
// #define ctz(a) __builtin_ctzll(a)
#define popc(a) \
__builtin_popcount(a) // count set bits (for ints only diff for ll)
#define GCD(A, B) __gcd(A, B)
// #define LCM(A,B) boost::math::lcm(A,B)
// #define COUNT(v,x) count(all(v),x)
// #define COUNT(v,x) count(all(s),'x')
// Typedefs:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<ll, ll> pairs;
// typedef vector<pair<ll, pair<ll, ll>>> vppl;
const int N = 1e5 + 5;
const long long MOD = (long long)(1e9 + 7);
const long long INF = (long long)(1e9 + 5);
const long long INIT = (long long)(1e6 + 1);
// Functions:----------------------------------------------------------------------------------------------------------------------------------------------------------------------
inline string IntToString(ll a) {
char x[100];
sprintf(x, "%lld", a);
string s = x;
return s;
}
//....................................................................................//
inline ll StringToInt(string a) {
char x[100];
ll res;
strcpy(x, a.c_str());
sscanf(x, "%lld", &res);
return res;
}
//....................................................................................//
inline string GetString(void) {
char x[1000005];
scanf("%s", x);
string s = x;
return s;
}
//....................................................................................//
inline string uppercase(string s) {
int n = s.size();
f(i, 0, n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
return s;
}
//....................................................................................//
inline string lowercase(string s) {
int n = s.size();
f(i, 0, n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
return s;
}
//....................................................................................//
inline void OPEN(string s) {
#ifndef TESTING
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
#endif
}
//....................................................................................//
template <typename T, typename U> // Same as max_val = max (max_val, val)
static inline void amin(T &x, U y) // Same as min_val = min (min_val,val)
{
if (y < x) // maximum = amax(max_val, val);
x = y; // minimum = amin (min_val, val);
}
//....................................................................................//
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
//....................................................................................//
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2);
p = (p * p);
return (y % 2 == 0) ? p : (x * p);
}
//....................................................................................//
int lcm(ll a, ll b) {
ll lar = max(a, b);
ll small = min(a, b);
for (ll i = lar;; i += lar) {
if (i % small == 0)
return i;
}
}
//....................................................................................//
int bsearch(ll arr[], ll l, ll r, ll x) {
while (l <= r) {
ll m = l + (r - l) / 2;
if (arr[m] == x) {
return m;
}
if (arr[m] < x) {
l = m + 1;
} else
r = m - 1;
}
return -1;
}
//....................................................................................//
template <typename T> T gcd(T a, T b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
template <typename T> T pow(T a, T b, ll m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
// int bsearch(ll arr[], ll l, ll r, ll x){while (l <= r){ll m = l + (r - l) /
// 2;if(arr[m] == x){return m;}if(arr[m] < x){l = m + 1;}else{r = m - 1;}}}
// Solve:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
void solve() {
ll n;
cin >> n;
ll a[n + 1];
fe(i, 1, n) { cin >> a[i]; }
ll dp[n + 1];
dp[1] = 0;
dp[2] = abs(a[2] - a[1]);
fe(i, 3, n) {
ll x = dp[i - 1] + abs(a[i] - a[i - 1]);
ll y = dp[i - 2] + abs(a[i] - a[i - 2]);
dp[i] = min(x, y);
}
cout << dp[n] << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
TC(t) { solve(); }
#ifdef LOCAL
cerr << "Time elapsed: " << (double)clock() / CLOCKS_PER_SEC * 1000
<< " ms.\n";
#endif // LOCAL
return 0;
}
|
replace
| 217 | 221 | 217 | 221 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int INF = 1001001001;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
insert
| 18 | 18 | 18 | 19 |
0
| |
p03160
|
C++
|
Runtime Error
|
/******************************************
* AUTHOR : HRITIK AGGARWAL *
******************************************/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, b) for (int i = 1; i <= b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define ms(s, n) memset(s, n, sizeof(s))
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int ll
ll po(ll a, ll x, ll m) {
if (x == 0) {
return 1;
}
ll ans = 1;
ll k = 1;
while (k <= x) {
if (x & k) {
ans = ((ans * a) % m);
}
k <<= 1;
a *= a;
a %= m;
}
return ans;
}
// DEKHIYE JI WALID JO THE ABBA HAMARE WO YEH function CHHOD KR GYE THE
int n;
vector<int> a;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("a.txt", "w", stdout);
#endif
cin >> n;
a = vector<int>(n);
forr(i, n) 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]));
}
// cout << dp[1] << "\n";
cout << dp[n - 1] << "\n";
return 0;
}
|
/******************************************
* AUTHOR : HRITIK AGGARWAL *
******************************************/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i, n) for (int i = 0; i < n; i++)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, b) for (int i = 1; i <= b; i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define ms(s, n) memset(s, n, sizeof(s))
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define int ll
ll po(ll a, ll x, ll m) {
if (x == 0) {
return 1;
}
ll ans = 1;
ll k = 1;
while (k <= x) {
if (x & k) {
ans = ((ans * a) % m);
}
k <<= 1;
a *= a;
a %= m;
}
return ans;
}
// DEKHIYE JI WALID JO THE ABBA HAMARE WO YEH function CHHOD KR GYE THE
int n;
vector<int> a;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
a = vector<int>(n);
forr(i, n) 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]));
}
// cout << dp[1] << "\n";
cout << dp[n - 1] << "\n";
return 0;
}
|
replace
| 48 | 52 | 48 | 49 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int h[105], dp[105];
int main() {
memset(dp, 0, sizeof(dp));
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> h[i];
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 - 2] - h[i]));
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 10;
int h[MAXN], dp[MAXN];
int main() {
memset(dp, 0, sizeof(dp));
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> h[i];
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 - 2] - h[i]));
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 5 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, int> msi;
typedef set<ll> sl;
typedef set<char> sc;
typedef pair<int, int> pii;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const int INF = 1 << 29;
#define MOD (ll)(1e9 + 7)
#define eps 1e-6
#define pb push_back
#define mp make_pair
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define F first
#define S second
int main() {
ios::sync_with_stdio(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int dp[n + 5];
REP(i, n + 5) dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, int> msi;
typedef set<ll> sl;
typedef set<char> sc;
typedef pair<int, int> pii;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
const int INF = 1 << 29;
#define MOD (ll)(1e9 + 7)
#define eps 1e-6
#define pb push_back
#define mp make_pair
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define F first
#define S second
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
int h[n];
REP(i, n) cin >> h[i];
int dp[n + 5];
REP(i, n + 5) dp[i] = INT_MAX;
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
delete
| 31 | 35 | 31 | 31 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define IN freopen("input.txt", "r", stdin);
#define OUT freopen("output.txt", "w", stdout);
#define LL long long
#define MOD 1000000007
#define INF 1000000000000000000
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
const int N = 1e5 + 1;
int n, F[N], h[N];
int main() {
IN;
FASTIO;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
h[0] = -1e8;
for (int i = 2; i <= n; i++) {
F[i] = F[i - 1] + abs(h[i] - h[i - 1]);
F[i] = min(F[i], F[i - 2] + abs(h[i] - h[i - 2]));
}
cout << F[n];
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FASTIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define IN freopen("input.txt", "r", stdin);
#define OUT freopen("output.txt", "w", stdout);
#define LL long long
#define MOD 1000000007
#define INF 1000000000000000000
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
const int N = 1e5 + 1;
int n, F[N], h[N];
int main() {
// IN;
FASTIO;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i];
h[0] = -1e8;
for (int i = 2; i <= n; i++) {
F[i] = F[i - 1] + abs(h[i] - h[i - 1]);
F[i] = min(F[i], F[i - 2] + abs(h[i] - h[i - 2]));
}
cout << F[n];
return 0;
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[10005], ara[10005];
ll ans(ll n) {
if (n == 1) {
dp[1] = 0;
}
if (n == 2) {
dp[2] = abs(ara[2] - ara[1]);
return dp[2];
}
if (dp[n] != -1)
return dp[n];
dp[n] = min((ans(n - 1) + abs(ara[n] - ara[n - 1])),
ans(n - 2) + abs(ara[n] - ara[n - 2]));
return dp[n];
}
int main() {
ll n;
int i;
cin >> n;
memset(dp, -1, sizeof(dp));
for (i = 1; i <= n; i++) {
cin >> ara[i];
}
cout << ans(n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[100005], ara[100005];
ll ans(ll n) {
if (n == 1) {
dp[1] = 0;
}
if (n == 2) {
dp[2] = abs(ara[2] - ara[1]);
return dp[2];
}
if (dp[n] != -1)
return dp[n];
dp[n] = min((ans(n - 1) + abs(ara[n] - ara[n - 1])),
ans(n - 2) + abs(ara[n] - ara[n - 2]));
return dp[n];
}
int main() {
ll n;
int i;
cin >> n;
memset(dp, -1, sizeof(dp));
for (i = 1; i <= n; i++) {
cin >> ara[i];
}
cout << ans(n) << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[10005], ara[10005];
int main() {
ll n;
int i;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ara[i];
}
dp[1] = 0;
dp[2] = abs(ara[1] - ara[2]);
for (i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(ara[i] - ara[i - 1]),
dp[i - 2] + abs(ara[i] - ara[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll dp[100005], ara[100005];
int main() {
ll n;
int i;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ara[i];
}
dp[1] = 0;
dp[2] = abs(ara[1] - ara[2]);
for (i = 3; i <= n; i++) {
dp[i] = min(dp[i - 1] + abs(ara[i] - ara[i - 1]),
dp[i - 2] + abs(ara[i] - ara[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int dp[60000], i, ara[60000], n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> ara[i];
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(ara[i] - ara[i - 1]);
if (i > 2)
dp[i] = min(dp[i], dp[i - 2] + abs(ara[i] - ara[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int dp[100005], i, ara[100005], n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> ara[i];
dp[1] = 0;
for (i = 2; i <= n; i++) {
dp[i] = dp[i - 1] + abs(ara[i] - ara[i - 1]);
if (i > 2)
dp[i] = min(dp[i], dp[i - 2] + abs(ara[i] - ara[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, h;
vi heights;
int dp[100001];
int calc(int i) {
if (dp[i] != -1)
return dp[i];
if (i == 0)
return dp[i] = 0;
if (i == 1)
return dp[i] = abs(heights[i] - heights[i - 1]);
return dp[i] = min(abs(heights[i] - heights[i - 1]) + calc(i - 1),
abs(heights[i] - heights[i - 2]) + calc(i - 2));
}
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin.sync_with_stdio(0);
cin.tie();
cin.exceptions(cin.failbit);
cin >> n;
rep(i, 1, n) {
cin >> h;
heights.pb(h);
}
memset(dp, sizeof dp, -1);
cout << calc(n - 1);
}
|
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int n, h;
vi heights;
int dp[100001];
int calc(int i) {
if (dp[i] != -1)
return dp[i];
if (i == 0)
return dp[i] = 0;
if (i == 1)
return dp[i] = abs(heights[i] - heights[i - 1]);
return dp[i] = min(abs(heights[i] - heights[i - 1]) + calc(i - 1),
abs(heights[i] - heights[i - 2]) + calc(i - 2));
}
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin.sync_with_stdio(0);
cin.tie();
cin.exceptions(cin.failbit);
cin >> n;
rep(i, 1, n) {
cin >> h;
heights.pb(h);
}
rep(i, 0, n) dp[i] = -1;
cout << calc(n - 1);
}
|
replace
| 39 | 40 | 39 | 40 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const int INF = 1001001001;
int main() {
int N, h[10000], dp[10000];
cin >> N;
rep(i, N) { 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] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const int INF = 1001001001;
int main() {
int N, h[100000], dp[100000];
cin >> N;
rep(i, N) { 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] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 29;
int main() {
int n;
cin >> n;
vector<int> vec;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
vec.push_back(tmp);
}
for (int i = 0; i < n; i++) {
// cout << vec[i] << endl;
}
int dp[10001];
for (int i = 0; i < 10001; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = dp[i + 1] < abs(vec[i + 1] - vec[i]) + dp[i]
? dp[i + 1]
: abs(vec[i + 1] - vec[i]) + dp[i];
dp[i + 2] = dp[i + 2] < abs(vec[i + 2] - vec[i]) + dp[i]
? dp[i + 2]
: abs(vec[i + 2] - vec[i]) + dp[i];
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <regex>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 29;
int main() {
int n;
cin >> n;
vector<int> vec;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
vec.push_back(tmp);
}
for (int i = 0; i < n; i++) {
// cout << vec[i] << endl;
}
int dp[100010];
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = dp[i + 1] < abs(vec[i + 1] - vec[i]) + dp[i]
? dp[i + 1]
: abs(vec[i + 1] - vec[i]) + dp[i];
dp[i + 2] = dp[i + 2] < abs(vec[i + 2] - vec[i]) + dp[i]
? dp[i + 2]
: abs(vec[i + 2] - vec[i]) + dp[i];
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 26 | 28 | 26 | 28 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
vector<ll> hieghts;
#define INF 1000000007
const int N = 1e7;
vector<ll> dp(N);
ll total_size;
int min_cost(int curr_position) {
dp[0] = 0;
dp[1] = abs(hieghts[1] - hieghts[0]);
for (ll i = 2; i < total_size; i++) {
dp[i] = min((dp[i - 1] + abs(hieghts[i] - hieghts[i - 1])),
(dp[i - 2] + abs(hieghts[i] - hieghts[i - 2])));
}
cout << dp[total_size - 1] << "\n";
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> total_size;
for (ll i = 0; i < total_size; i++) {
ll temp;
cin >> temp;
hieghts.pb(temp);
}
min_cost(0);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
vector<ll> hieghts;
#define INF 1000000007
const int N = 1e7;
vector<ll> dp(N);
ll total_size;
int min_cost(int curr_position) {
dp[0] = 0;
dp[1] = abs(hieghts[1] - hieghts[0]);
for (ll i = 2; i < total_size; i++) {
dp[i] = min((dp[i - 1] + abs(hieghts[i] - hieghts[i - 1])),
(dp[i - 2] + abs(hieghts[i] - hieghts[i - 2])));
}
cout << dp[total_size - 1] << "\n";
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
cin >> total_size;
for (ll i = 0; i < total_size; i++) {
ll temp;
cin >> temp;
hieghts.pb(temp);
}
min_cost(0);
}
|
replace
| 21 | 25 | 21 | 25 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define E 2.71828182845905
#define rep(i, a, b) for (int i = a; i < b; i++)
#define debug(x) cout << #x << " is " << x << endl;
#define PI 3.14159265
#define mem(x) memset(x, 0, sizeof(x));
using namespace std;
void sol() {
int n;
cin >> n;
int h[n];
rep(i, 0, n) cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
rep(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
sol();
}
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define E 2.71828182845905
#define rep(i, a, b) for (int i = a; i < b; i++)
#define debug(x) cout << #x << " is " << x << endl;
#define PI 3.14159265
#define mem(x) memset(x, 0, sizeof(x));
using namespace std;
void sol() {
int n;
cin >> n;
int h[n];
rep(i, 0, n) cin >> h[i];
ll dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
rep(i, 2, n) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
sol();
}
}
|
replace
| 38 | 42 | 38 | 42 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const ll MOD = 1000000007;
const ll INF = 1000000000;
using namespace std;
int main(void) {
int n;
ll dp[10010], h[10010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
dp[i + 1] = INF;
}
dp[1] = 0;
for (int i = 1; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i > 1) {
dp[i + 1] = min(dp[i + 1], dp[i - 1] + abs(h[i + 1] - h[i - 1]));
}
}
cout << dp[n] << endl;
}
|
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
const ll MOD = 1000000007;
const ll INF = 1000000000;
using namespace std;
int main(void) {
int n;
int dp[100010], h[100010];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
dp[i + 1] = INF;
}
dp[1] = 0;
for (int i = 1; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
if (i > 1) {
dp[i + 1] = min(dp[i + 1], dp[i - 1] + abs(h[i + 1] - h[i - 1]));
}
}
cout << dp[n] << endl;
}
|
replace
| 24 | 25 | 24 | 25 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
bool debug = true;
#endif
typedef long long unsigned llu;
typedef long long lld;
typedef long ld;
#define N 100005
int a[N], dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
if (debug)
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
int i, n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++)
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
(dp[i - 2] + abs(a[i] - a[i - 2])));
cout << dp[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
bool debug = true;
#endif
typedef long long unsigned llu;
typedef long long lld;
typedef long ld;
#define N 100005
int a[N], dp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, n;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
dp[1] = 0;
dp[2] = abs(a[1] - a[2]);
for (i = 3; i <= n; i++)
dp[i] = min((dp[i - 1] + abs(a[i] - a[i - 1])),
(dp[i - 2] + abs(a[i] - a[i - 2])));
cout << dp[n] << endl;
return 0;
}
|
delete
| 17 | 19 | 17 | 17 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#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;
const int MAX_N = 1e5;
int main() {
int N;
cin >> N;
vector<int64_t> dp(MAX_N);
for (int i = 0; i < MAX_N; ++i)
dp.at(i) = INF;
vector<int> h(N + 2);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (int i = 0; i < N; i++) {
chmin(dp.at(i + 1), dp.at(i) + abs(h.at(i) - h.at(i + 1)));
chmin(dp.at(i + 2), dp.at(i) + abs(h.at(i) - h.at(i + 2)));
}
cout << dp.at(N - 1) << endl;
}
|
#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;
const int MAX_N = 1e6;
int main() {
int N;
cin >> N;
vector<int64_t> dp(MAX_N);
for (int i = 0; i < MAX_N; ++i)
dp.at(i) = INF;
vector<int> h(N + 2);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (int i = 0; i < N; i++) {
chmin(dp.at(i + 1), dp.at(i) + abs(h.at(i) - h.at(i + 1)));
chmin(dp.at(i + 2), dp.at(i) + abs(h.at(i) - h.at(i + 2)));
}
cout << dp.at(N - 1) << endl;
}
|
replace
| 21 | 22 | 21 | 22 |
0
| |
p03160
|
C++
|
Runtime Error
|
#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;
int main() {
int N;
cin >> N;
vector<int64_t> dp(100000);
for (int i = 0; i < 100000; ++i)
dp.at(i) = INF;
vector<int> h(N + 2);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (int i = 0; i < N; i++) {
chmin(dp.at(i + 1), dp.at(i) + abs(h.at(i) - h.at(i + 1)));
chmin(dp.at(i + 2), dp.at(i) + abs(h.at(i) - h.at(i + 2)));
}
cout << dp.at(N - 1) << endl;
}
|
#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;
int main() {
int N;
cin >> N;
vector<int64_t> dp(100010);
for (int i = 0; i < 100010; ++i)
dp.at(i) = INF;
vector<int> h(N + 2);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
dp.at(0) = 0;
for (int i = 0; i < N; i++) {
chmin(dp.at(i + 1), dp.at(i) + abs(h.at(i) - h.at(i + 1)));
chmin(dp.at(i + 2), dp.at(i) + abs(h.at(i) - h.at(i + 2)));
}
cout << dp.at(N - 1) << endl;
}
|
replace
| 26 | 28 | 26 | 28 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long
#define rep(i, x, n) for (int i = x; i < n; i++)
#define reprev(i, n, x) for (int i = n; i >= x; i--)
#define mp(a, b) make_pair(a, b)
#define mod 998244353
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#pragma GCC target("sse4.2")
using namespace std;
void grayserge() {
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++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n - 1];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
while (t--) {
grayserge();
}
cerr << "time taken: " << (float)clock() / CLOCKS_PER_SEC << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define rep(i, x, n) for (int i = x; i < n; i++)
#define reprev(i, n, x) for (int i = n; i >= x; i--)
#define mp(a, b) make_pair(a, b)
#define mod 998244353
#define pb push_back
#define vi vector<int>
#define pi pair<int, int>
#pragma GCC target("sse4.2")
using namespace std;
void grayserge() {
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++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n - 1];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int t = 1;
// cin>>t;
while (t--) {
grayserge();
}
cerr << "time taken: " << (float)clock() / CLOCKS_PER_SEC << endl;
return 0;
}
|
replace
| 31 | 35 | 31 | 35 |
0
|
time taken: 0.032539
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define clr cin.ignore(numeric_limits<streamsize>::max(), '\n')
#define _val(x) cerr << #x << " is " << x << "\n";
#define all(container) container.begin(), container.end()
#define rall(container) container.rbegin(), container.rend()
#define rep(i, a, b, c) for (ll i = a; i <= b; i += c)
#define rrep(i, a, b, c) for (ll i = a; i >= b; i -= c)
#define pb push_back
#define mp make_pair
using namespace std;
const double eps = 1e-10;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpll;
const int INF = 0x3f3f3f3f;
int main(void) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
ll n;
cin >> n;
ll heights[n], dp[n];
rep(i, 0, n - 1, 1) cin >> heights[i];
dp[0] = 0;
dp[1] = abs(heights[0] - heights[1]);
rep(i, 2, n - 1, 1) dp[i] = min(dp[i - 2] + abs(heights[i - 2] - heights[i]),
dp[i - 1] + abs(heights[i] - heights[i - 1]));
cout << dp[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define clr cin.ignore(numeric_limits<streamsize>::max(), '\n')
#define _val(x) cerr << #x << " is " << x << "\n";
#define all(container) container.begin(), container.end()
#define rall(container) container.rbegin(), container.rend()
#define rep(i, a, b, c) for (ll i = a; i <= b; i += c)
#define rrep(i, a, b, c) for (ll i = a; i >= b; i -= c)
#define pb push_back
#define mp make_pair
using namespace std;
const double eps = 1e-10;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
typedef pair<long long, long long> pll;
typedef vector<pair<long long, long long>> vpll;
const int INF = 0x3f3f3f3f;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
ll n;
cin >> n;
ll heights[n], dp[n];
rep(i, 0, n - 1, 1) cin >> heights[i];
dp[0] = 0;
dp[1] = abs(heights[0] - heights[1]);
rep(i, 2, n - 1, 1) dp[i] = min(dp[i - 2] + abs(heights[i - 2] - heights[i]),
dp[i - 1] + abs(heights[i] - heights[i - 1]));
cout << dp[n - 1] << "\n";
return 0;
}
|
delete
| 23 | 27 | 23 | 23 |
-11
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.