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>
using namespace std;
long long int jump(int n, int h[], int start, int end, long long int y[]) {
if (y[n] != -1) {
return y[n];
}
if (end == start + 1) {
int k = abs(h[end] - h[start]);
y[n] = k;
return y[n];
}
if (end == start) {
return 0;
}
int d = abs(h[start + 2] - h[start]);
int e = abs(h[start + 1] - h[start]);
y[n] = min(d + jump(n - 2, h, start + 2, end, y),
e + jump(n - 1, h, start + 1, end, y));
return y[n];
}
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);
int n;
cin >> n;
int g = n;
int h[n];
long long int y[1000001];
memset(y, -1, sizeof(y));
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int f = jump(n, h, 0, g - 1, y);
cout << f;
// #ifndef ONLINE_JUDGE
// cout<<"\nTime Elapsed : "<< 1.0*clock() / CLOCKS_PER_SEC << " s\n";
// #endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int jump(int n, int h[], int start, int end, long long int y[]) {
if (y[n] != -1) {
return y[n];
}
if (end == start + 1) {
int k = abs(h[end] - h[start]);
y[n] = k;
return y[n];
}
if (end == start) {
return 0;
}
int d = abs(h[start + 2] - h[start]);
int e = abs(h[start + 1] - h[start]);
y[n] = min(d + jump(n - 2, h, start + 2, end, y),
e + jump(n - 1, h, start + 1, end, y));
return y[n];
}
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);
int n;
cin >> n;
int g = n;
int h[n];
long long int y[1000001];
memset(y, -1, sizeof(y));
for (int i = 0; i < n; i++) {
cin >> h[i];
}
int f = jump(n, h, 0, g - 1, y);
cout << f;
// #ifndef ONLINE_JUDGE
// cout<<"\nTime Elapsed : "<< 1.0*clock() / CLOCKS_PER_SEC << " s\n";
// #endif
return 0;
}
|
replace
| 24 | 28 | 24 | 28 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
#include <math.h>
using namespace std;
long long min(long long a, long long b);
int main(void) {
long long N, h[10001], sum[10001], i;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> h[i];
}
if (i == 1) {
cout << 0 << endl;
}
else if (i == 2) {
cout << abs(h[1] - h[2]) << endl;
}
else {
sum[1] = 0;
sum[2] = abs(h[1] - h[2]);
for (i = 3; i <= N; i++) {
sum[i] = min(sum[i - 2] + abs(h[i - 2] - h[i]),
sum[i - 1] + abs(h[i - 1] - h[i]));
}
cout << sum[N] << endl;
}
return 0;
}
long long min(long long a, long long b) {
if (a < b) {
return a;
}
else {
return b;
}
}
|
#include <iostream>
#include <math.h>
using namespace std;
long long min(long long a, long long b);
int main(void) {
long long N, h[100001], sum[100001], i;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> h[i];
}
if (i == 1) {
cout << 0 << endl;
}
else if (i == 2) {
cout << abs(h[1] - h[2]) << endl;
}
else {
sum[1] = 0;
sum[2] = abs(h[1] - h[2]);
for (i = 3; i <= N; i++) {
sum[i] = min(sum[i - 2] + abs(h[i - 2] - h[i]),
sum[i - 1] + abs(h[i - 1] - h[i]));
}
cout << sum[N] << endl;
}
return 0;
}
long long min(long long a, long long b) {
if (a < b) {
return a;
}
else {
return b;
}
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = 0; i > (int)(n); i--)
#define ALL(v) v.begin(), v.end()
#define INF 1e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int h[10001], dp[10001];
int main(void) {
int N;
cin >> N;
REP(i, N) { cin >> h[i]; }
REP(i, N) { dp[i] = INF; }
dp[0] = 0;
REP(i, N) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + 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 < (int)(n); i++)
#define RREP(i, n) for (int i = 0; i > (int)(n); i--)
#define ALL(v) v.begin(), v.end()
#define INF 1e9
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
int h[100001], dp[100001];
int main(void) {
int N;
cin >> N;
REP(i, N) { cin >> h[i]; }
REP(i, N) { dp[i] = INF; }
dp[0] = 0;
REP(i, N) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p03160
|
C++
|
Runtime Error
|
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
using namespace std;
#define int long long
#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 mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
const int hell = 1000000007;
int h[100010] = {0};
int dp[100010];
int n;
int frog(int index) {
if (index >= n)
return 0;
if (dp[index] != -1)
return dp[index];
int ans = hell;
rep(i, 1, 3) {
if (index + i <= n) {
ans = min(ans, abs(h[index + i] - h[index]) + frog(index + i));
}
}
// if(dp[index]!=-1)dp[index]=ans;
// else dp[index]=min(dp[index],ans);
return dp[index] = ans;
}
int solve() {
memset(dp, -1, sizeof(dp));
cin >> n;
rep(i, 0, n) cin >> h[i + 1];
cout << frog(1);
return 0;
}
signed main() {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
using namespace std;
#define int long long
#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 mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
const int hell = 1000000007;
int h[100010] = {0};
int dp[100010];
int n;
int frog(int index) {
if (index >= n)
return 0;
if (dp[index] != -1)
return dp[index];
int ans = hell;
rep(i, 1, 3) {
if (index + i <= n) {
ans = min(ans, abs(h[index + i] - h[index]) + frog(index + i));
}
}
// if(dp[index]!=-1)dp[index]=ans;
// else dp[index]=min(dp[index],ans);
return dp[index] = ans;
}
int solve() {
memset(dp, -1, sizeof(dp));
cin >> n;
rep(i, 0, n) cin >> h[i + 1];
cout << frog(1);
return 0;
}
signed main() {
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
delete
| 63 | 68 | 63 | 63 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF (long long)(1e18)
#define MOD (int)(1e9 + 7)
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
#define MAX 11000
int dp[MAX], h[MAX];
signed main() {
cout << fixed << setprecision(7);
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
dp[i] = 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]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N] << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define INF (long long)(1e18)
#define MOD (int)(1e9 + 7)
#define yn(f) ((f) ? "Yes" : "No")
#define YN(f) ((f) ? "YES" : "NO")
#define MAX 110000
int dp[MAX], h[MAX];
signed main() {
cout << fixed << setprecision(7);
int N;
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> h[i];
dp[i] = 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]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N] << endl;
return 0;
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define ll long long
#define inf (1LL << 61)
#define MOD 1000000007
const ll N = 2e5 + 5;
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, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
ll n;
ll h[100005];
ll cache[100005];
ll dp(ll i) {
if (i > n)
return inf;
if (i == n)
return 0;
ll &ans = cache[i];
ans = inf;
ans = min(ans, dp(i + 1) + abs(h[i + 1] - h[i]));
ans = min(ans, dp(i + 2) + abs(h[i + 2] - h[i]));
return ans;
}
int main() {
IOS;
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> h[i];
memset(cache, -1, sizeof(cache));
ll ans = dp(1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define ll long long
#define inf (1LL << 61)
#define MOD 1000000007
const ll N = 2e5 + 5;
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, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1)
ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
ll n;
ll h[100005];
ll cache[100005];
ll dp(ll i) {
if (i > n)
return inf;
if (i == n)
return 0;
ll &ans = cache[i];
if (ans != -1)
return ans;
ans = inf;
ans = min(ans, dp(i + 1) + abs(h[i + 1] - h[i]));
ans = min(ans, dp(i + 2) + abs(h[i + 2] - h[i]));
return ans;
}
int main() {
IOS;
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> h[i];
memset(cache, -1, sizeof(cache));
ll ans = dp(1);
cout << ans << endl;
return 0;
}
|
insert
| 35 | 35 | 35 | 37 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
// typedef tuple <int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
#define siz(x) (int)(x).size()
#define Y second
#define X first
#define IN insert
#define PB push_back
#define P pop_back
#define PU push
#define PO pop
// #define F find
#define ED end()
#define MP(a, b) make_pair(a, b)
// #define MOD 1000000007ll
#define INF 1000000000
#define endl "\n"
#define rep(a, i, b) for (ll i = (a); i < (b); ++i)
#define reps(a, i, b) for (ll i = (a); i <= (b); ++i)
#define repd(num, i, ed) for (ll(i) = (num)-1; (i) >= ed; --(i))
#define repkt(bg, i, num, kt) for (ll(i) = (bg); (i) < (num) && (kt); ++(i))
#define repchar(i) for (char(i) = 48; (i) <= 122; (i)++)
#define in(n) scanf("%lld", &n)
#define out(n) printf("%lld\n", n)
#define outS(s) printf("%s\n", s)
#define setA(a, n) \
for (ll i = 0, j = sizeof(a) / sizeof(a[0]); i < j; ++i) \
a[i] = n;
#define repe(num, i, ed) for (ll(i) = (num); (i) >= ed; --(i))
// const int INF=0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll N = 1e5 + 5, K = 105;
const int si = (1 << 20);
const ll M = 50 + 5;
const ll oo = 1e18 + 5;
const double INFdb = 1e10;
int n;
int h[N];
int dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
h[0] = h[1];
dp[0] = dp[1] = 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];
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
// typedef tuple <int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
#define siz(x) (int)(x).size()
#define Y second
#define X first
#define IN insert
#define PB push_back
#define P pop_back
#define PU push
#define PO pop
// #define F find
#define ED end()
#define MP(a, b) make_pair(a, b)
// #define MOD 1000000007ll
#define INF 1000000000
#define endl "\n"
#define rep(a, i, b) for (ll i = (a); i < (b); ++i)
#define reps(a, i, b) for (ll i = (a); i <= (b); ++i)
#define repd(num, i, ed) for (ll(i) = (num)-1; (i) >= ed; --(i))
#define repkt(bg, i, num, kt) for (ll(i) = (bg); (i) < (num) && (kt); ++(i))
#define repchar(i) for (char(i) = 48; (i) <= 122; (i)++)
#define in(n) scanf("%lld", &n)
#define out(n) printf("%lld\n", n)
#define outS(s) printf("%s\n", s)
#define setA(a, n) \
for (ll i = 0, j = sizeof(a) / sizeof(a[0]); i < j; ++i) \
a[i] = n;
#define repe(num, i, ed) for (ll(i) = (num); (i) >= ed; --(i))
// const int INF=0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll N = 1e5 + 5, K = 105;
const int si = (1 << 20);
const ll M = 50 + 5;
const ll oo = 1e18 + 5;
const double INFdb = 1e10;
int n;
int h[N];
int dp[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
#endif
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> h[i];
h[0] = h[1];
dp[0] = dp[1] = 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];
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
replace
| 64 | 65 | 64 | 65 |
0
|
Time elapsed: 34ms
|
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int d[10100];
int h[10100];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
d[1] = 0;
d[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; ++i) {
auto cost1 = abs(h[i] - h[i - 1]) + d[i - 1];
auto cost2 = abs(h[i] - h[i - 2]) + d[i - 2];
d[i] = min(cost1, cost2);
}
cout << d[n] << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
int d[100100];
int h[100100];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
d[1] = 0;
d[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; ++i) {
auto cost1 = abs(h[i] - h[i - 1]) + d[i - 1];
auto cost2 = abs(h[i] - h[i - 2]) + d[i - 2];
d[i] = min(cost1, cost2);
}
cout << d[n] << endl;
return 0;
}
|
replace
| 7 | 9 | 7 | 9 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int solve(vector<int> h, vector<int> a, int i) {
if (a.at(i) > -1) {
return a.at(i);
} else {
a.at(i) = min(a.at(i - 2) + abs(h.at(i) - h.at(i - 2)),
a.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
return a.at(i);
}
}
int main() {
int n;
cin >> n;
vector<int> h(n);
for (size_t i = 0; i < n; i++) {
/* code */
cin >> h.at(i);
}
vector<int> hyo(n, -1);
hyo.at(0) = 0;
hyo.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
/* code */
hyo.at(i) = solve(h, hyo, i);
}
int ans = hyo.at(n - 1);
cout << ans << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int solve(vector<int> &h, vector<int> &a, int i) {
if (a.at(i) > -1) {
return a.at(i);
} else {
a.at(i) = min(a.at(i - 2) + abs(h.at(i) - h.at(i - 2)),
a.at(i - 1) + abs(h.at(i) - h.at(i - 1)));
return a.at(i);
}
}
int main() {
int n;
cin >> n;
vector<int> h(n);
for (size_t i = 0; i < n; i++) {
/* code */
cin >> h.at(i);
}
vector<int> hyo(n, -1);
hyo.at(0) = 0;
hyo.at(1) = abs(h.at(1) - h.at(0));
for (int i = 2; i < n; i++) {
/* code */
hyo.at(i) = solve(h, hyo, i);
}
int ans = hyo.at(n - 1);
cout << ans << endl;
}
|
replace
| 6 | 7 | 6 | 7 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
ll dp[100010];
void solve(long long N, std::vector<long long> h) {
for (int i = 0; i <= N + 10; i++) {
dp[i] = INF;
}
dp[1] = 0;
for (int i = 1; i <= N; i++) {
dp[i + 1] = min(dp[i] + abs(h[i - 1] - h[i]), dp[i + 1]);
dp[i + 2] = min(dp[i] + abs(h[i - 1] - h[i + 1]), dp[i + 2]);
}
cout << dp[N] << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> h(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &h[i]);
}
solve(N, std::move(h));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n) {
for (size_t i = 0; i < n; i++) {
for (size_t j = 0; j < n; j++) {
for (size_t k = 0; k < n; k++) {
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
}
}
}
}
class UnionFind {
public:
vector<ll> Parent;
UnionFind(ll N) { Parent = vector<ll>(N, -1); }
ll find(ll A) {
if (Parent[A] < 0)
return A;
return Parent[A] = find(Parent[A]);
}
ll size(ll A) { return -Parent[find(A)]; }
bool Union(ll A, ll B) {
A = find(A);
B = find(B);
if (A == B) {
return false;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
Parent[B] = A;
return true;
}
};
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
ll mulMod(ll a, ll b) { return (((a % MOD) * (b % MOD)) % MOD); }
ll powMod(ll a, ll p) {
if (p == 0) {
return 1;
} else if (p % 2 == 0) {
ll half = powMod(a, p / 2);
return mulMod(half, half);
} else {
return mulMod(powMod(a, p - 1), a);
}
}
ll ceil(ll a, ll b) { return (a + b - 1) / b; }
ll dp[100010];
void solve(long long N, std::vector<long long> h) {
for (int i = 0; i <= N; i++) {
dp[i] = INF;
}
dp[1] = 0;
for (int i = 1; i <= N; i++) {
dp[i + 1] = min(dp[i] + abs(h[i - 1] - h[i]), dp[i + 1]);
dp[i + 2] = min(dp[i] + abs(h[i - 1] - h[i + 1]), dp[i + 2]);
}
cout << dp[N] << endl;
}
int main() {
long long N;
scanf("%lld", &N);
std::vector<long long> h(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &h[i]);
}
solve(N, std::move(h));
return 0;
}
|
replace
| 80 | 81 | 80 | 81 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define per(i, n) for (long long i = (long long)(n - 1); i >= 0; --i)
#define REP(i, s, t) for (long long i = s; i < t; i++)
#define PER(i, s, t) for (long long i = s; i > t; --i)
#define all(x) x.begin(), x.end()
#define sp(n) setprecision(n)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(10010, 0), dp(10010, 0);
rep(i, n) { cin >> a[i]; }
dp[1] = abs(a[0] - a[1]);
REP(i, 2, n) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + abs(a[i - 1] - a[i]));
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define per(i, n) for (long long i = (long long)(n - 1); i >= 0; --i)
#define REP(i, s, t) for (long long i = s; i < t; i++)
#define PER(i, s, t) for (long long i = s; i > t; --i)
#define all(x) x.begin(), x.end()
#define sp(n) setprecision(n)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(100100, 0), dp(100100, 0);
rep(i, n) { cin >> a[i]; }
dp[1] = abs(a[0] - a[1]);
REP(i, 2, n) {
dp[i] =
min(dp[i - 2] + abs(a[i - 2] - a[i]), dp[i - 1] + abs(a[i - 1] - a[i]));
}
cout << dp[n - 1] << endl;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long dp[10010];
int h[100010];
long long rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
long long res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (auto &x : dp)
x = INF;
cout << rec(n - 1) << endl;
}
|
#include <iostream>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long dp[100010];
int h[100010];
long long rec(int i) {
if (dp[i] < INF)
return dp[i];
if (i == 0)
return 0;
long long res = INF;
chmin(res, rec(i - 1) + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(res, rec(i - 2) + abs(h[i] - h[i - 2]));
return dp[i] = res;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (auto &x : dp)
x = INF;
cout << rec(n - 1) << endl;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int N;
int h[100000];
int dp[100000];
int solve(int now) {
if (now == N - 1)
return 0;
if (dp[now] = !-1)
return dp[now];
if (now == N - 2) {
dp[now] = abs(h[now + 1] - h[now]) + solve(now + 1);
} else {
dp[now] = min(abs(h[now + 1] - h[now]) + solve(now + 1),
abs(h[now + 2] - h[now]) + solve(now + 2));
}
return dp[now];
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
dp[i] = -1;
}
cout << solve(0) << endl;
return 0;
}
/*
int D, N;
int T[200], A[200], B[200], C[200];
int dp[100][100];
int solve(int now, int m){ //now:日数 m:派手さの差の絶対値の合計
if(now == N) return 0;
if(dp[now][m]
}
int main(){
cin >> D >> N;
for(int i=0; i<D; i++){
cin >> T[i];
}
for(int i=0; i<N; i++){
cin >> A[i] >> B[i] >> C[i];
}
return 0;
}
*/
/*
//6
int N;
int A[100];
int dp[100][200];
int solve(int now, int m, int B[100]){
if(now == N){
return 1;
}
dp[now][m] = 0;
for(int i=0; i<N; i++){
if(B[i]>0 && i != m-1 && i != m && i != m+1){
B[i]--;
dp[now][m] += solve(now+1, i, B);
B[i]++;
}
}
dp[now][m] %= 10007 ;
return dp[now][m];
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
cin >> A[i];
for(int j=0; j<200; j++){
dp[i][j] = -1;
}
}
cout << solve(0, 200, A);
return 0;
}
*/
/*
//5
int N, M;
int A[200000], l[200000], r[200000];
vector<int> max1[200000] = {};
int tmp[4000][3] = {};
int ok[200000] = {};
int main(){
cin >> N >> M;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<M; i++){
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
for(int j = l[i]; j<=r[i]; j++){
ok[j]++;
}
}
tmp[0][0] = tmp[0][1] = 0;
for(int i=1; i<=N; i++){
if(ok[i-1] == 0){
tmp[i][0] += A[i-1] + tmp[i-1][1] + tmp[i-1][2];
tmp[i][1] = tmp[i][0];
}
else if(ok[i-1] == 1){
tmp[i][1] += max(A[i-1] + tmp[i-1][0], tmp[i-1][1]);
tmp[i][0] = tmp[i-1][0];
}
else if(ok[i-1] == 2){
tmp[i][1] = tmp[i-1][1];
tmp[i][2] = max(tmp[i-1][1], tmp[i-1][2]);
}
}
cout << tmp[N][0] << endl;
return 0;
}
*/
// 4
/*
int N;
int A[100000];
int main(){
cin >> N;
vector<int> x, y, z; //xは頂、ｙは谷、ｚは合わせたやつ
cin >> A[0];
int B[100001];
B[0] = 0;
for(int i=1; i<N; i++){
cin >> A[i];
B[i] = A[i] - A[i-1];
if(B[i-1] * B[i] < 0){
if(B[i-1] > 0){
x.push_back(A[i-1]);
z.push_back(A[i-1]);
}
else if(B[i-1] < 0){
y.push_back(A[i-1]);
z.push_back(A[i-1]);
}
}
else if(B[i] == 0){
if(B[i-1] > 0){
x.push_back(A[i-1]);
z.push_back(A[i-1]);
}
else if(B[i-1] < 0){
y.push_back(A[i-1]);
z.push_back(A[i-1]);
}
}
}
if(B[1] < 0){
x.push_back(A[0]);
z.push_back(A[0]);
}
if(B[N-1] > 0){
x.push_back(A[N-1]);
z.push_back(A[N-1]);
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
sort(z.begin(), z.end());
if(y[0] == A[N-1]) y.erase(y.begin());
reverse(x.begin(), x.end());
reverse(y.begin(), y.end());
reverse(z.begin(), z.end());
int xi = 0, yi = 0;
int tmp = 0;
int ans = 0;
for(int i=0; i<z.size(); i++){
if(z[i] == y[yi]){
tmp--;
yi++;
if(yi >= y.size()) yi--;
}
else if(z[i] == x[xi]){
tmp++;
xi++;
if(xi >= x.size()) xi--;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
*/
/*
//3
int N;
string s;
int main(){
cin >> N >> s;
int ans = 0;
for(int i=1; i<N; i++){
if(s[i-1] != s[i]){
ans++;
i++;
}
}
cout << ans << endl;
return 0;
}
*/
/*
//2
int main(){
int N, M;
int X[100];
cin >> N;
for(int i=0; i<N; i++){
cin >> X[i];
}
cin >> M;
for(int i=0; i<M; i++){
int a;
cin >> a;
a--;
for(int j = 0; j<N; j++){
if(X[a] + 1 == X[j]){
break;
}
else if(j == N -1){
X[a]++;
}
}
if(X[a] > 2019) X[a] = 2019;
}
for(int i=0; i<N; i++){
cout << X[i] << endl;
}
return 0;
}
*/
/*
//1
int main(){
int a, b, c;
cin >> a >> b >> c;
int week = c/(7*a+b);
int tmp = c%(7*a+b);
int ans = tmp/a;
if(tmp%a != 0) ans++;
cout << min(ans + 7*week, 7*(week+1) ) << endl;
return 0;
}
*/
/*
int N;
int x[3000], y[3000];
int main(){
cin >> N;
for(int i=0; i<N; i++){
cin >> x[i] >> y[i];
}
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
for(int k=j+1; k<N; k++){
for(int l=k+1; l<0; l++){
int wide = max(abs(x[i]-x[j]),
max(abs(x[i]-x[k]), max(abs(x[i] - x[l]), max(abs(x[j]-x[k]), max(abs(x[j] -
x[l]), abs(x[k]-x[l])))))); int height = max(abs(y[i]-y[j]), max(abs(y[i]-y[k]),
max(abs(y[i] - y[l]), max(abs(y[j]-y[k]), max(abs(y[j] -y[l]),
abs(y[k]-y[l])))))); if(wide == height){
}
}
}
}
}
return 0;
}
*/
// 最長の階段
/*
int N, k;
int num[100000];
bool empty = false;
int sizes[100000][2] = {};
int main(){
cin >> N >> k;
for(int i=0; i<k; i++){
int tmp;
cin >> tmp;
if(tmp==0) empty = true;
else num[i] = tmp;
}
sort(num, num+k);
sizes[0][0] = 0;
for(int i=1; i<=k; i++){
int x = num[i] - num[i-1];
if(x == 1){
sizes[i][0] = sizes[i-1][0] + 1;
sizes[i][1] = sizes[i-1][1] + 1;
}
else if(x == 2 && empty == true){
sizes[i][1] = sizes[i-1][0] + 2;
}
else{
sizes[i][0] = 0;
sizes[i][1] = 0;
}
}
int ans = 0;
for(int i=0; i<k; i++){
for(int j=0; j<2; j++){
ans = max(ans, sizes[i][j]);
}
}
cout << ans+1 << endl;
return 0;
}
*/
/*
int N, F;
vector<string> sets[100];
set<string> items;
vector<pair<string, string>> pairs;
int main(){
cin >> N >> F;
for(int i=0; i<N; i++){
int m;
cin >> m;
for(int j=0; j<m; j++){
string tmp;
cin >> tmp;
sets[i].push_back(tmp);
items.insert(tmp);
}
}
vector<string> kind;
for(auto itr = items.begin(); itr != items.end(); itr++){
kind.push_back(*itr);
}
for(auto i=0; i<kind.size(); i++){
for(auto j=1+i; j<kind.size(); j++){
for(int k=0; k<N; k++){
int ok1 = 0;
for(int l=0; l<sets[k].size(); l++){
if(kind[i] == sets[k][l]){
ok1++;
}
if(kind[j] == sets[k][l]){
ok1++;
}
}
if(ok1 == 2){
pairs.push_back(make_pair(kind[i],
kind[j]));
}
}
}
}
set<pair<string, string>> ans;
for(int i=0; i<pairs.size(); i++){
int tmp = 0;
for(int j=i++; j<pairs.size(); j++){
if(pairs[i] == pairs[j]){
tmp++;
}
}
if(tmp>=F){
ans.insert(pairs[i]);
}
}
cout << ans.size() << endl;
for(auto i=ans.begin(); i!=ans.end(); i++){
pair<string, string> tmp = *i;
cout << tmp.first << " " << tmp.second << endl;
}
return 0;
}
*/
/*
int h[10], w[10];
vector<int> sh, sw;
int main(){
bool ok = true;
for(int i=0; i<6; i++){
int htmp, wtmp;
cin >> htmp >> wtmp;
if(htmp < wtmp){
h[i] = htmp;
w[i] = wtmp;
}
else{
h[i] = wtmp;
w[i] = htmp;
}
}
for(int i=0; i<5; i++){
for(int j=i+1; j<6; j++){
if(h[i] == h[j] && w[i] == w[j] && h[i]>0){
sh.push_back(h[i]);
sw.push_back(w[i]);
h[i] = h[j] = w[i] = w[j] = -1;
break;
}
}
}
if(sw.size() != 3){
ok = false;
cout << "no" << endl;
}
for(int i=0; i<2; i++){
for(int j=i+1; j<3; j++){
if(sh[i] == sh[j] && sh[i] != -1){
sh[i] = sh[j] = -1;
}
else if(sh[i] == sw[j] && sh[i] != -1){
sh[i] = sw[j] = -1;
}
else if(sw[i] == sh[j] && sw[i] != -1){
sw[i] = sh[j] = -1;
}
else if(sw[i] == sw[j] && sw[i] != -1){
sw[i] = sw[j] = -1;
}
else if(j == 2){
ok = false;
cout << "no" << endl;
}
}
}
if(ok) cout << "yes" << endl;
return 0;
}
*/
/*
int N;
int lc[100], rc[100], p[100], dp[100];
int root;
vector<int> leaves;
int dpth(int now){
if(now == root) return 0;
return dpth( p[now] ) + 1;
}
int hgt(int now){
for(int i=0; i<leaves.size(); i++){
if(now == leaves[i]) return 0;
}
if(dp[now] != -1) return dp[now];
dp[now] = (max(hgt(lc[now]), hgt(rc[now])) + 1);
return dp[now];
}
void print(int id){
cout << "node " << id << ": ";
cout << "parent = " << p[id] << ", ";
cout << "sibling = ";
if(p[id] == -1) cout << -1;
else if(lc[ p[id] ] != id) cout << lc[ p[id] ];
else if(rc[ p[id] ] != id) cout << rc[ p[id] ];
else cout << -1;
cout << ", ";
cout << "degree = ";
int tmp = 0;
if(lc[id] != -1) tmp++;
if(rc[id] != -1) tmp++;
cout << tmp << ", ";
cout << "depth = " << dpth(id) << ", ";
cout << "height = " << hgt(id) << ", ";
if(p[id] == -1) cout << "root";
else if(lc[id] == -1 && rc[id] == -1) cout << "leaf";
else cout << "internal node";
cout << endl;
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
lc[i] = rc[i] = p[i] = dp[i] = -1;
}
for(int i=0; i<N; i++){
int id, left, right;
cin >> id >> left >> right;
lc[id] = left;
rc[id] = right;
p[left] = id;
p[right] = id;
}
for(int i=0; i<N; i++){
if(p[i] == -1) root = i;
if(lc[i] == -1 && rc[i] == -1) leaves.push_back(i);
}
for(int i=0; i<N; i++){
print(i);
}
return 0;
}
*/
/*
int N;
int parent[100000], Left[100000], Right[100000];
int d[100000];
void rec(int u, int p){
d[u] = p;
if(Right[u] != -1) rec(Right[u], p);
if(Left[u] != -1) rec(Left[u], p+1);
}
void print(int n){
cout << "node " << n;
cout << ": parent = "<< parent[n];
cout << ", depth = "<< d[n] << ", ";
if(parent[n] == -1) cout << "root";
else if(Left[n] == -1) cout << "leaf";
else cout << "internal node";
cout << ", [";
int c = Left[n];
for(int i=0; c != -1; i++){
if(i) cout << ", ";
cout << c;
c = Right[c];
}
cout << "]" << endl;
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
parent[i] = Left[i] = Right[i] = -1;
}
for(int i=0; i<N; i++){
int id, k, l;
cin >> id >> k;
for(int j=0; j<k; j++){
int c;
cin >> c;
if(j == 0){
Left[id] = c;
}
else{
Right[l] = c;
}
l = c;
parent[c] = id;
}
}
int r;
for(int i=0; i<N; i++){
if(parent[i] == -1) r = i;
}
rec(r, 0);
for(int i=0; i<N; i++) print(i);
return 0;
}
*/
// カードゲーム
/*
int main(){
int N;
cin >> N;
vector<int> Taro, Hana;
for(int i=0; i<N; i++){
int tmp;
cin >> tmp;
Taro.push_back(tmp);
}
sort(Taro.begin(), Taro.end());
for(int i=1; i<=2*N; i++){
for(int j=0; j<N; j++){
if(i == Taro[j]){
break;
}
else if(j = N-1){
Hana.push_back(i);
}
}
}
int TaroSize = Taro.size();
int HanaSize = Hana.size();
bool taroturn = true;
int now = 0;
while(TaroSize != 0 && HanaSize != 0){
if(taroturn){
for(int i=0; i<TaroSize; i++){
if(now < Taro[i]){
now = Taro[i];
taroturn = false;
}
}
}
else{
}
}
return 0;
}
*/
// サッカー
/*
int main(){
int N;
cin >> N;
int X[4][3] = {};
for(int i=0; i<N*(N-1)/2; i++){
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
if(c>d){
X[a][0]++;
X[b][1]++;
}
if(c == d){
X[a][2]++;
X[b][2]++;
}
if(c<d){
X[a][0]++;
X[b][1]++;
}
}
return 0;
}
*/
// すごろく
/*
int main(){
int N, M;
cin >> N >> M;
int Place[1000];
for(int i=0; i<N; i++){
cin >> Place[i];
}
int ans;
int now = 0;
for(int i=0; i<M; i++){
int sai;
cin >> sai;
now += sai;
now += Place[now];
if(now >= N-1){
ans = i + 1;
break;
}
}
cout << ans << endl;
return 0;
}
*/
// 鉛筆
/*
int main(){
int N, a, b, c, d;
cin >> N >> a >> b >> c >> d;
/*
int x, y;
for(int i=1; i*a < N; i++){
x = i*b;
}
for(int i=1; i*c < N; i++){
y = i*d;
}
x += b;
y += d;*/
/*
int x = N/a * b;
if(N%a != 0) x += b;
int y = N/c * d;
if(N%c != 0) y += d;
if(x>y) x = y;
cout << x << endl;
return 0;
}
*/
/*
int main(){
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int ans = 0;
if(a<0){
ans += c * abs(a) + d;
a = 0;
}
ans += (b-a)*e;
cout << ans << endl;
return 0;
}
*/
/*
//科目選択
int main(){
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if(e < f) e = f;
int sum = a + b + c + d;
if(a>b) a = b;
if(a>c) a = c;
if(a>d) a = d;
cout << sum - a + e << endl;
return 0;
}
*/
// 最大の和
/*
int main(){
while(true){
int k;
int A[100000];
int N;
cin >> N >> k;
if(N == 0 && k == 0) break;
A[0] = 0;
for(int i=1; i<=N; i++){
cin >> A[i];
A[i] = A[i] + A[i-1];
}
int ans = -99999999;
for(int i=1; i+k-1<N; i++){
ans = max(ans, A[i+k-1] - A[i-1]);
}
cout << ans << endl;
}
return 0;
}
*/
// フィボナッチ数列
/*
int dp[100];
int N;
int solve(int n){
if(dp[n] != -1) return dp[n];
dp[n] = solve(n-2) + solve(n-1);
return dp[n];
}
int main(){
cin >> N;
for(int i=0; i<100; i++){
dp[i] = -1;
}
dp[0] = 1;
dp[1] = 1;
cout << solve(N) << endl;
return 0;
}
*/
/*
//Longest Common Subsequence
int c[1001][1001];
int lcs(string X, string Y){
int m = X.size();
int n = Y.size();
int maxl = 0;
X = ' ' + X;
Y = ' ' + Y;
for(int i=0; i<=m; i++){
for(int j=0; j<=n; j++){
c[i][j] = 0;
}
}
//for(int i=1; i<=m; i++) c[i][0] = 0;
//for(int i=1; i<=n; i++) c[0][i] = 0;
for(int i=1; i<=m; i++){
for(int j=1; j<=n; j++){
if(X[i] == Y[j]){
c[i][j] = c[i-1][j-1] + 1;
}
else{
c[i][j] = max(c[i-1][j], c[i][j-1]);
}
maxl = max(c[i][j], maxl);
}
}
return maxl;
}
int main(){
int q;
cin >> q;
string X, Y;
for(int i=0; i<q; i++){
cin >> X >> Y;
cout << lcs(X, Y) << endl;
}
return 0;
}
/*
int main(){
/*
int x,y;
cin >> x >> y;
cout << x << " + " << y << " = " << x+y << endl;
cout << x << " - " << y << " = " << x-y << endl;
cout << x << " * " << y << " = " << x*y << endl;
cout << x << " / " << y << " = " << x/y << endl;
cout << x << " % " << y << " = " << x%y << endl;
*/
/*
int p;
cin >> p;
if(p<50){
cout << "Your grade is C" << endl;
}
else if(p >= 50 && p < 70){
cout << "Your grade is B" << endl;
}
else if(p >= 70 && p<100){
cout << "Your grade is A" << endl;
}
else if(p == 100){
cout << "Your grade is S" << endl;
}
*/
/*
string name;
double a, b, c, d, f;
cin >> name >> a >> b >> c >> d >> f;
double p = (5*a + 4*b + c*3 + d*2 + f)/(a + b + c + d + f);
cout << name << " ";
if(p == 5) cout << "Great!" << endl;
if(p >= 4&& p < 5) cout << "Very Good" << endl;
if(p >= 3&& p < 4) cout << "Good!" << endl;
if(p < 3) cout << "Poor!" << endl;
*/
/*
int aw, al, ah;
int bw, bl, bh;
int cw, cl, ch;
int dw, dl, dh;
int ew, el, eh;
cin >> aw >> al >> ah;
cin >> bw >> bl >> bh;
cin >> cw >> cl >> ch;
cin >> dw >> dl >> dh;
cin >> ew >> el >> eh;
int ap = aw - al;
int bp = bw - bl;
int cp = cw - cl;
int ap = dl;w - al;
int ap = aw - al;
return 0;
}
*/
// 総当り
/*
int N, M;
int A[100];
int dp[100][100];
int solve(int now, int m){
if(m == 0) return 1;
if(now >= N) return 0;
if(dp[now][m] != -1) return dp[now][m];
if(solve(now+1, m) == 1){
dp[now][m] = 1;
}
else{
dp[now][m] = solve(now+1, m-A[now]);
}
return dp[now][m];
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
dp[i][j] = -1;
}
}
int q;
cin >> q;
for(int i=0; i<q; i++){
cin >> M;
if(solve(0, M) == 1){
cout << "yes" << endl;
}
else{
cout << "no" << endl;
}
}
return 0;
}
*/
// 幅優先探索
/*
int N;
int M[101][101];
queue<int> que;
int cost[101];
void solve(int now){
for(int i=0; i<N; i++){
if(M[now][i] == 1){
if(cost[i] == -1){
cost[i] = cost[now] + 1;
que.push(i);
}
else if(cost[now] + 1 < cost[i]){
cost[i] = cost[now] + 1;
que.push(i);
}
}
}
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
int u, k;
cin >> u >> k;
for(int j=0; j<k; j++){
int v;
cin >> v;
M[u-1][v-1] = 1;
}
}
for(int i=0; i<N; i++){
cost[i] = -1;
}
cost[0] = 0;
que.push(0);
while (!que.empty())
{
solve(que.front());
que.pop();
}
for(int i=0; i<N; i++){
cout << i+1 << " " << cost[i] << endl;
}
return 0;
}
*/
// 深さ優先探索
/*
int N;
int M[101][101] = {};
int d[101] = {};
int f[101] = {};
int ct = 0;
void solve(int now){
if(d[now] == 0) d[now] = ct;
for(int i=1; i<=N; i++){
if(M[now][i] == 1 && d[i] == 0){
ct++;
solve(i);
}
if(i == N){
ct++;
f[now] = ct;
}
}
}
int main(){
cin >> N;
for(int i=1; i<=N; i++){
M[0][i] = 1;
}
for(int i=0; i<N; i++){
int u, k;
cin >> u >> k;
for(int j=0; j<k; j++){
int v;
cin >> v;
M[u][v] = 1;
}
}
solve(0);
for(int i=1; i<=N; i++){
cout << i << " " << d[i] << " " << f[i] << endl;
}
return 0;
}
*/
// グラフの表現
/*
int main(){
int n;
int M[101][101] = {};
cin >> n;
for(int i=0; i<n; i++){
int u, k;
cin >> u >> k;
for(int j=0; j<k; j++){
int v;
cin >> v;
M[u-1][v-1] = 1;
}
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cout << M[i][j];
if(j != n-1){
cout << " ";
}
else{
cout << endl;
}
}
}
return 0;
}
*/
// 二乗法
/*
int main(){
long long m,n;
int MOD = 1000000007;
cin >> m >> n;
long long ans = 1;
while(n != 0){
if(n%2 == 1){
ans *= m;
ans %= MOD;
}
n = n/2;
m = m*m;
m %= MOD;
}
cout << ans << endl;
return 0;
}
*/
// カードゲーム
/*
int n;
bool T[100], H[100];
int Tnum = n, Hnum = n;
int main (){
cin >> n;
for(int i=0; i<2*n; i++){
T[i] = false;
}
for(int i=0; i<n; i++){
int a;
cin >> a;
T[a] = true;
}
for(int i=0; i<n; i++){
if(!T[i]){
H[i] = true;
}
}
int now;
bool turn = true;
for(int i=0; i<n; i++){
if(T[i]){
now = i;
T[i] = false;
Tnum--;
turn = false;
break;
}
}
while(Tnum > 0 || Hnum > 0){
for(int i=0; i<n; i++){
if(T[i]){
now = i;
T[i] = false;
Tnum--;
turn = false;
break;
}
else if(H[i]){
now = i;
H[i] = false;
Hnum--;
turn = true;
break;
}
}
}
return 0;
}
*/
/*
int A[100];
int B[100];
int n;
int ansT, ansH;
int taro = n - 1, hana = n;
void solve(int c, bool b){
if(taro == 0){
ansT = hana;
return;
}
if(hana == 0 ){
ansH = taro;
return;
}
if(b){
for(int i=0; i<n; i++){
if(c < B[i]){
int a = B[i];
B[i] = -1;
hana--;
solve( a, !b);
return;
}
else if(i==n-1){
taro++;
solve(0 , !b);
}
}
}
else{
for(int i=0; i<n; i++){
if(c < A[i]){
int a = B[i];
A[i] = -1;
taro--;
solve( a, !b);
return;
}
else if(i==n-1){
taro++;
solve(0, !b);
}
}
}
}
int main(){
while(true){
cin >> n;
if(n == 0){
break;
}
for(int i=0; i<n; i++){
cin >> A[i];
}
sort(A, A+n);
int m = 0;
for(int i=0; i<n ; i++){
for(int j=B[m]+1; j<=2*n; j++){
if(A[i] != j){
B[m] = j;
m++;
}
}
}
solve(A[0], true);
cout << ansT << endl << ansH << endl;
}
return 0;
}
*/
// 最高のピザ
/*
int n,a,b,c;
int A[110];
int dp[110][110];
int main(){
cin >> n >> a >> b >> c;
for(int i=1; i<=n; i++){
cin >> A[i];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + A[i]);
}
}
int ans = c/a;
for(int i=0; i<=n; i++){
ans = max(ans, (dp[n][i]+c)/(a + b*i) );
}
cout << ans << endl;
return 0;
}
*/
/*
int x = 0;
dp[0].first = 0;
for(int j=0; j<n; j++){
//X.push_back(temp);
if(dp[j].first < dp[j].first + A[j]){
dp[j+1].first = dp[j].first + A[j];
dp[j+1].second = x;
}
else{
dp[j+1] = dp[j];
}
//dp.push_back(-1);
}
int ans = 0;
for(int i=0; i<n+1; i++){
ans = max( (dp[i].first + c)/(dp[i].second * b + a), ans);
}
cout << ans << endl;
*/
// cout << solve(0) << endl;
// チーズ
/*
int h,w,n;
pair<int,int> factory[10];
int cost[1000][1000];
queue< pair<int,int> > que;
string S[1000];
int A[2][4] = {{-1, 1 ,0, 0}, {0, 0, -1, 1}};
void Solve(pair<int,int> Now){
for(int i = 0; i<4; i++){
int x = Now.first + A[0][i];
int y = Now.second + A[1][i];
if(x >= 0 && x < h&&y >= 0&&y < w && S[Now.first +
A[0][i]][Now.second + A[1][i]] != 'X'){ if(cost[Now.first][Now.second] + 1 <
cost[x ][y]){ cost[x][y] = cost[Now.first][Now.second] + 1;
que.push(make_pair(x, y));
}
}
}
//上
if(Now.first - 1 >= 0 && S[Now.first - 1][Now.second] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first -
1][Now.second]){ cost[Now.first - 1][Now.second] = cost[Now.first][Now.second] +
1; que.push(make_pair(Now.first -1, Now.second));
}
}
//下
if(Now.first + 1 < h && S[Now.first + 1][Now.second] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first +
1][Now.second]){ cost[Now.first + 1][Now.second] = cost[Now.first][Now.second] +
1; que.push(make_pair(Now.first + 1, Now.second));
}
}
//hidari
if(Now.second - 1 >= 0 && S[Now.first][Now.second - 1] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first][Now.second
- 1]){ cost[Now.first][Now.second - 1] = cost[Now.first][Now.second] + 1;
que.push(make_pair(Now.first, Now.second - 1));
}
}
//r
if(Now.second +1 < w && S[Now.first][Now.second + 1] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first][Now.second
+ 1]){ cost[Now.first][Now.second + 1] = cost[Now.first][Now.second] + 1;
que.push(make_pair(Now.first , Now.second + 1));
}
}
}
int main(){
//チーズ
cin >> h >> w >> n;
for(int i=0; i<h; i++){
cin >> S[i];
}
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(S[i][j] == 'S'){
factory[0] = make_pair(i, j);
}
else if(S[i][j] != 'X' && S[i][j] != '.'){
factory[S[i][j]-'0'] = make_pair(i,j);
}
}
}
int ans = 0;
for(int i=0; i<n; i++){
for(int j=0; j<h; j++){
for(int k=0; k<w; k++){
cost[j][k] = 999999;
}
}
cost[factory[i].first][factory[i].second] = 0;
que.push(factory[i]);
while(!que.empty()){
Solve(que.front());
que.pop();
}
ans += cost[factory[i+1].first][factory[i+1].second];
}
cout << ans << endl;
return 0;
}
*/
// 宝探し
/*
int n,m;
cin >> n >> m;
int A[5100][5100];
//A[0][0] = 0;
/*
for(int i=0; i<5000; i++){
for(int j=0; j<5000; j++){
//A[i+1][j+1] = A[i+1][j] + A[i][j+1] -A[;
}
}
*/
/*
int Px[5000],Py[5000];
for(int i=0; i<n; i++){
int x,y;
cin >> x >> y;
//A[x][y] = 1;
}
int B[5100][5100];
B[0][0] = 0;
for(int i=0; i<100; i++){
for(int j=0; j<100; j++){
B[i+1][j+1] = B[i+1][j] + B[i][j+1] - B[i][j] + A[i+1][j+1];
}
}
for(int i=0; i<m; i++){
int x,y,X,Y;
cin >> x >> y >> X >> Y;
cout << B[x][y] - B[X-1][Y-1] << endl;
}
*/
// 超観光都市
/*
int w,h,n;
cin >> w >> h >> n;
int ans = 0;
int X,Y;
int x,y;
cin >> x >> y;
X = x;
Y = y;
for(int i=0; i<n-1; i++){
cin >> x >> y;
bool hugou = ((x-X>0&&y-Y>0)||(x-X<0&&y-Y<0));
if(hugou == 1){
ans += max(abs(x-X), abs(y-Y));
}
else{
ans += abs(x-X)+abs(y-Y);
}
X = x;
Y = y;
}
cout << ans << endl;
*/
// すごろく
/*
while(true){
int n,m;
cin >> n >> m;
if(n==0 && m==0) break;
int X[1000],Y;
for(int i=0 ; i<n; i++){
cin >> X[i];
}
int i,a=0;
for(i=0; i<m; i++){
cin >> Y;
a += Y;
a += X[a];
if(a+1>=n) break;
}
cout << i + 1<< endl;
}
*/
// 看板(未完成）
/*
int n,Ans;
string name;
cin >> n >> name;
for(int i=0; i<n; i++){
string s;
cin >> s;
int x[100];
int l=0;
for(int j=0; j<name.size(); j++){
for(int k=0; k<s.size(); k++){
if(name[j]==s[k]){
x[l]=k;
l++;
}
}
}
int p=x[1]-x[0];
for(int j=1; j<l+1; j++){
if(p!=x[j]-x[j-1])
break;
}
}
*/
// サッカー
/*
int n;
cin >> n;
int P[100];
for(int i = 0; i<n; i++){
P[i]=0;
}
for(int i=0; i<n*(n-1)/2; i++){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(c>d)
P[a-1] += 3;
if(c==d){
P[a-1]++;
P[b-1]++;
}
if(c<d)
P[b-1] += 3;
}
int Q[100];
for(int i =0; i<n; i++){
Q[i] = P[i];
}
sort(Q, Q+n);
reverse(Q,Q+n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(P[i]==Q[j]){
cout << j+1 << endl;
break;
}
}
}
*/
// 気象予報士
/*
int h,w;
int x=-1;
cin >> h >> w;
for(int i=0; i<h; i++){
for(int j =0; j<w; j++){
char a;
cin >> a;
if(a=='c'){
cout << 0;
x = j;
}
else if(x != -1){
cout << j-x;
}
else
cout << -1;
if(j==w-1)
break;
cout << " ";
}
cout << endl;
x = -1;
}
*/
/*
//数あて
int n;
cin >> n;
int p[200][3];
for(int i=0;i<n;i++)
{
cin >> p[i][0] >> p[i][1] >> p[i][2];
}
int _p;
for(int k=0;k<3;k++)
{
for(int i=0;i<n;i++)
{
_p = p[i][k];
for(int j=i+1;j<n;j++)
{
if(_p == p[j][k])
{
p[i][k] = 0;
p[j][k] = 0;
}
}
}
}
for(int i=0;i<n;i++)
{
cout << p[i][0] + p[i][1] + p[i][2] << endl;
}
*/
/*
//得点
int ai,am,as,ae,bi,bm,bs,be;
cin >> ai >> am >> as >> ae >> bi >> bm >> bs >> be;
int answer=ai+am+as+ae;
if(answer < bi+bm+bs+be)
{
/ answer=bi+bm+bs+be;
}
cout << answer << endl;
*/
// おつり
/* int onum;
while(true){
int N;
cin >> N;
if(N == 0) break;
onum=0;
int oturi = 1000-N;
if(oturi >= 500)
{
onum++;
oturi -= 500;
}
while(oturi>=100)
{
onum++;
oturi -= 100;
}
if(oturi >= 50)
{
onum++;
oturi -= 50;
}
while(oturi>=10)
{
onum++;
oturi -= 10;
}
if(oturi >= 5)
{
onum++;
oturi -= 5;
}
while(oturi>=1)
{
onum++;
oturi -= 1;
}
cout << onum << endl;
}
*/
// レシート
/*
while(true){
int N;
cin >> N;
if(N==0) break;
int a[9];
for(int i=0;i<9;i++){
cin >> a[0];
}
}
/*
int N;
int i = 0;
while(i<N){
i++;
}
for(int i=0; i<N; i++)
*/
/*
int N;
int x;
set<int> a;
cin >> N;
for(int i=0; i<N; i++){
cin >> x;
a.insert(x);
}
cout << a.size() << endl;
*/
// 投票
/*
int N,M;
cin >> N >> M;
int a;
int A[1000];
int B[1000];
int X[1000][2];
for(int i=0; i<N; i++){
cin >> A[i];
X[i][0] = i;
X[i][1] = 0;
}
for(int j=0; j<M;j++){
cin >> B[j];
}
for(int j=0; j<M; j++){
for(int i=0; i<N; i++){
if(A[i] <= B[j]){
X[i][1]++;
break;
}
}
}
for(int i=1; i<N; i++){
if(X[i-1][1]<X[i][1])
X[i-1][0] = X[i][0];
}
cout << X[0][0]+1 << endl;
*/
/*
int N,M;
cin >> N >> M;
int A[1000];
int vote[1000];
for(int i=0; i<N; i++){
cin >> A[i];
vote[i] =0;
}
int B;
for(int i=0; i<M; i++){
cin >> B;
for(int j=0; j<N; j++){
if(A[j]<=B){
vote[j]++;
break;
}
}
}
int temps = 0;
int ans=0;
for(int i=0; i<N; i++){
if(vote[i] >= temps){
temps = vote[i];
ans = i;
}
}
cout << ans+1 << endl;
*/
// return 0;
//}
/*
int max(int i,int j){
if(i < j) i=j;
return i;
}
*/
|
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int N;
int h[100000];
int dp[100000];
int solve(int now) {
if (now == N - 1)
return 0;
if (dp[now] != -1)
return dp[now];
if (now == N - 2) {
dp[now] = abs(h[now + 1] - h[now]) + solve(now + 1);
} else {
dp[now] = min(abs(h[now + 1] - h[now]) + solve(now + 1),
abs(h[now + 2] - h[now]) + solve(now + 2));
}
return dp[now];
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h[i];
dp[i] = -1;
}
cout << solve(0) << endl;
return 0;
}
/*
int D, N;
int T[200], A[200], B[200], C[200];
int dp[100][100];
int solve(int now, int m){ //now:日数 m:派手さの差の絶対値の合計
if(now == N) return 0;
if(dp[now][m]
}
int main(){
cin >> D >> N;
for(int i=0; i<D; i++){
cin >> T[i];
}
for(int i=0; i<N; i++){
cin >> A[i] >> B[i] >> C[i];
}
return 0;
}
*/
/*
//6
int N;
int A[100];
int dp[100][200];
int solve(int now, int m, int B[100]){
if(now == N){
return 1;
}
dp[now][m] = 0;
for(int i=0; i<N; i++){
if(B[i]>0 && i != m-1 && i != m && i != m+1){
B[i]--;
dp[now][m] += solve(now+1, i, B);
B[i]++;
}
}
dp[now][m] %= 10007 ;
return dp[now][m];
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
cin >> A[i];
for(int j=0; j<200; j++){
dp[i][j] = -1;
}
}
cout << solve(0, 200, A);
return 0;
}
*/
/*
//5
int N, M;
int A[200000], l[200000], r[200000];
vector<int> max1[200000] = {};
int tmp[4000][3] = {};
int ok[200000] = {};
int main(){
cin >> N >> M;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<M; i++){
cin >> l[i] >> r[i];
l[i]--;
r[i]--;
for(int j = l[i]; j<=r[i]; j++){
ok[j]++;
}
}
tmp[0][0] = tmp[0][1] = 0;
for(int i=1; i<=N; i++){
if(ok[i-1] == 0){
tmp[i][0] += A[i-1] + tmp[i-1][1] + tmp[i-1][2];
tmp[i][1] = tmp[i][0];
}
else if(ok[i-1] == 1){
tmp[i][1] += max(A[i-1] + tmp[i-1][0], tmp[i-1][1]);
tmp[i][0] = tmp[i-1][0];
}
else if(ok[i-1] == 2){
tmp[i][1] = tmp[i-1][1];
tmp[i][2] = max(tmp[i-1][1], tmp[i-1][2]);
}
}
cout << tmp[N][0] << endl;
return 0;
}
*/
// 4
/*
int N;
int A[100000];
int main(){
cin >> N;
vector<int> x, y, z; //xは頂、ｙは谷、ｚは合わせたやつ
cin >> A[0];
int B[100001];
B[0] = 0;
for(int i=1; i<N; i++){
cin >> A[i];
B[i] = A[i] - A[i-1];
if(B[i-1] * B[i] < 0){
if(B[i-1] > 0){
x.push_back(A[i-1]);
z.push_back(A[i-1]);
}
else if(B[i-1] < 0){
y.push_back(A[i-1]);
z.push_back(A[i-1]);
}
}
else if(B[i] == 0){
if(B[i-1] > 0){
x.push_back(A[i-1]);
z.push_back(A[i-1]);
}
else if(B[i-1] < 0){
y.push_back(A[i-1]);
z.push_back(A[i-1]);
}
}
}
if(B[1] < 0){
x.push_back(A[0]);
z.push_back(A[0]);
}
if(B[N-1] > 0){
x.push_back(A[N-1]);
z.push_back(A[N-1]);
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
sort(z.begin(), z.end());
if(y[0] == A[N-1]) y.erase(y.begin());
reverse(x.begin(), x.end());
reverse(y.begin(), y.end());
reverse(z.begin(), z.end());
int xi = 0, yi = 0;
int tmp = 0;
int ans = 0;
for(int i=0; i<z.size(); i++){
if(z[i] == y[yi]){
tmp--;
yi++;
if(yi >= y.size()) yi--;
}
else if(z[i] == x[xi]){
tmp++;
xi++;
if(xi >= x.size()) xi--;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
*/
/*
//3
int N;
string s;
int main(){
cin >> N >> s;
int ans = 0;
for(int i=1; i<N; i++){
if(s[i-1] != s[i]){
ans++;
i++;
}
}
cout << ans << endl;
return 0;
}
*/
/*
//2
int main(){
int N, M;
int X[100];
cin >> N;
for(int i=0; i<N; i++){
cin >> X[i];
}
cin >> M;
for(int i=0; i<M; i++){
int a;
cin >> a;
a--;
for(int j = 0; j<N; j++){
if(X[a] + 1 == X[j]){
break;
}
else if(j == N -1){
X[a]++;
}
}
if(X[a] > 2019) X[a] = 2019;
}
for(int i=0; i<N; i++){
cout << X[i] << endl;
}
return 0;
}
*/
/*
//1
int main(){
int a, b, c;
cin >> a >> b >> c;
int week = c/(7*a+b);
int tmp = c%(7*a+b);
int ans = tmp/a;
if(tmp%a != 0) ans++;
cout << min(ans + 7*week, 7*(week+1) ) << endl;
return 0;
}
*/
/*
int N;
int x[3000], y[3000];
int main(){
cin >> N;
for(int i=0; i<N; i++){
cin >> x[i] >> y[i];
}
for(int i=0; i<N; i++){
for(int j=i+1; j<N; j++){
for(int k=j+1; k<N; k++){
for(int l=k+1; l<0; l++){
int wide = max(abs(x[i]-x[j]),
max(abs(x[i]-x[k]), max(abs(x[i] - x[l]), max(abs(x[j]-x[k]), max(abs(x[j] -
x[l]), abs(x[k]-x[l])))))); int height = max(abs(y[i]-y[j]), max(abs(y[i]-y[k]),
max(abs(y[i] - y[l]), max(abs(y[j]-y[k]), max(abs(y[j] -y[l]),
abs(y[k]-y[l])))))); if(wide == height){
}
}
}
}
}
return 0;
}
*/
// 最長の階段
/*
int N, k;
int num[100000];
bool empty = false;
int sizes[100000][2] = {};
int main(){
cin >> N >> k;
for(int i=0; i<k; i++){
int tmp;
cin >> tmp;
if(tmp==0) empty = true;
else num[i] = tmp;
}
sort(num, num+k);
sizes[0][0] = 0;
for(int i=1; i<=k; i++){
int x = num[i] - num[i-1];
if(x == 1){
sizes[i][0] = sizes[i-1][0] + 1;
sizes[i][1] = sizes[i-1][1] + 1;
}
else if(x == 2 && empty == true){
sizes[i][1] = sizes[i-1][0] + 2;
}
else{
sizes[i][0] = 0;
sizes[i][1] = 0;
}
}
int ans = 0;
for(int i=0; i<k; i++){
for(int j=0; j<2; j++){
ans = max(ans, sizes[i][j]);
}
}
cout << ans+1 << endl;
return 0;
}
*/
/*
int N, F;
vector<string> sets[100];
set<string> items;
vector<pair<string, string>> pairs;
int main(){
cin >> N >> F;
for(int i=0; i<N; i++){
int m;
cin >> m;
for(int j=0; j<m; j++){
string tmp;
cin >> tmp;
sets[i].push_back(tmp);
items.insert(tmp);
}
}
vector<string> kind;
for(auto itr = items.begin(); itr != items.end(); itr++){
kind.push_back(*itr);
}
for(auto i=0; i<kind.size(); i++){
for(auto j=1+i; j<kind.size(); j++){
for(int k=0; k<N; k++){
int ok1 = 0;
for(int l=0; l<sets[k].size(); l++){
if(kind[i] == sets[k][l]){
ok1++;
}
if(kind[j] == sets[k][l]){
ok1++;
}
}
if(ok1 == 2){
pairs.push_back(make_pair(kind[i],
kind[j]));
}
}
}
}
set<pair<string, string>> ans;
for(int i=0; i<pairs.size(); i++){
int tmp = 0;
for(int j=i++; j<pairs.size(); j++){
if(pairs[i] == pairs[j]){
tmp++;
}
}
if(tmp>=F){
ans.insert(pairs[i]);
}
}
cout << ans.size() << endl;
for(auto i=ans.begin(); i!=ans.end(); i++){
pair<string, string> tmp = *i;
cout << tmp.first << " " << tmp.second << endl;
}
return 0;
}
*/
/*
int h[10], w[10];
vector<int> sh, sw;
int main(){
bool ok = true;
for(int i=0; i<6; i++){
int htmp, wtmp;
cin >> htmp >> wtmp;
if(htmp < wtmp){
h[i] = htmp;
w[i] = wtmp;
}
else{
h[i] = wtmp;
w[i] = htmp;
}
}
for(int i=0; i<5; i++){
for(int j=i+1; j<6; j++){
if(h[i] == h[j] && w[i] == w[j] && h[i]>0){
sh.push_back(h[i]);
sw.push_back(w[i]);
h[i] = h[j] = w[i] = w[j] = -1;
break;
}
}
}
if(sw.size() != 3){
ok = false;
cout << "no" << endl;
}
for(int i=0; i<2; i++){
for(int j=i+1; j<3; j++){
if(sh[i] == sh[j] && sh[i] != -1){
sh[i] = sh[j] = -1;
}
else if(sh[i] == sw[j] && sh[i] != -1){
sh[i] = sw[j] = -1;
}
else if(sw[i] == sh[j] && sw[i] != -1){
sw[i] = sh[j] = -1;
}
else if(sw[i] == sw[j] && sw[i] != -1){
sw[i] = sw[j] = -1;
}
else if(j == 2){
ok = false;
cout << "no" << endl;
}
}
}
if(ok) cout << "yes" << endl;
return 0;
}
*/
/*
int N;
int lc[100], rc[100], p[100], dp[100];
int root;
vector<int> leaves;
int dpth(int now){
if(now == root) return 0;
return dpth( p[now] ) + 1;
}
int hgt(int now){
for(int i=0; i<leaves.size(); i++){
if(now == leaves[i]) return 0;
}
if(dp[now] != -1) return dp[now];
dp[now] = (max(hgt(lc[now]), hgt(rc[now])) + 1);
return dp[now];
}
void print(int id){
cout << "node " << id << ": ";
cout << "parent = " << p[id] << ", ";
cout << "sibling = ";
if(p[id] == -1) cout << -1;
else if(lc[ p[id] ] != id) cout << lc[ p[id] ];
else if(rc[ p[id] ] != id) cout << rc[ p[id] ];
else cout << -1;
cout << ", ";
cout << "degree = ";
int tmp = 0;
if(lc[id] != -1) tmp++;
if(rc[id] != -1) tmp++;
cout << tmp << ", ";
cout << "depth = " << dpth(id) << ", ";
cout << "height = " << hgt(id) << ", ";
if(p[id] == -1) cout << "root";
else if(lc[id] == -1 && rc[id] == -1) cout << "leaf";
else cout << "internal node";
cout << endl;
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
lc[i] = rc[i] = p[i] = dp[i] = -1;
}
for(int i=0; i<N; i++){
int id, left, right;
cin >> id >> left >> right;
lc[id] = left;
rc[id] = right;
p[left] = id;
p[right] = id;
}
for(int i=0; i<N; i++){
if(p[i] == -1) root = i;
if(lc[i] == -1 && rc[i] == -1) leaves.push_back(i);
}
for(int i=0; i<N; i++){
print(i);
}
return 0;
}
*/
/*
int N;
int parent[100000], Left[100000], Right[100000];
int d[100000];
void rec(int u, int p){
d[u] = p;
if(Right[u] != -1) rec(Right[u], p);
if(Left[u] != -1) rec(Left[u], p+1);
}
void print(int n){
cout << "node " << n;
cout << ": parent = "<< parent[n];
cout << ", depth = "<< d[n] << ", ";
if(parent[n] == -1) cout << "root";
else if(Left[n] == -1) cout << "leaf";
else cout << "internal node";
cout << ", [";
int c = Left[n];
for(int i=0; c != -1; i++){
if(i) cout << ", ";
cout << c;
c = Right[c];
}
cout << "]" << endl;
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
parent[i] = Left[i] = Right[i] = -1;
}
for(int i=0; i<N; i++){
int id, k, l;
cin >> id >> k;
for(int j=0; j<k; j++){
int c;
cin >> c;
if(j == 0){
Left[id] = c;
}
else{
Right[l] = c;
}
l = c;
parent[c] = id;
}
}
int r;
for(int i=0; i<N; i++){
if(parent[i] == -1) r = i;
}
rec(r, 0);
for(int i=0; i<N; i++) print(i);
return 0;
}
*/
// カードゲーム
/*
int main(){
int N;
cin >> N;
vector<int> Taro, Hana;
for(int i=0; i<N; i++){
int tmp;
cin >> tmp;
Taro.push_back(tmp);
}
sort(Taro.begin(), Taro.end());
for(int i=1; i<=2*N; i++){
for(int j=0; j<N; j++){
if(i == Taro[j]){
break;
}
else if(j = N-1){
Hana.push_back(i);
}
}
}
int TaroSize = Taro.size();
int HanaSize = Hana.size();
bool taroturn = true;
int now = 0;
while(TaroSize != 0 && HanaSize != 0){
if(taroturn){
for(int i=0; i<TaroSize; i++){
if(now < Taro[i]){
now = Taro[i];
taroturn = false;
}
}
}
else{
}
}
return 0;
}
*/
// サッカー
/*
int main(){
int N;
cin >> N;
int X[4][3] = {};
for(int i=0; i<N*(N-1)/2; i++){
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
if(c>d){
X[a][0]++;
X[b][1]++;
}
if(c == d){
X[a][2]++;
X[b][2]++;
}
if(c<d){
X[a][0]++;
X[b][1]++;
}
}
return 0;
}
*/
// すごろく
/*
int main(){
int N, M;
cin >> N >> M;
int Place[1000];
for(int i=0; i<N; i++){
cin >> Place[i];
}
int ans;
int now = 0;
for(int i=0; i<M; i++){
int sai;
cin >> sai;
now += sai;
now += Place[now];
if(now >= N-1){
ans = i + 1;
break;
}
}
cout << ans << endl;
return 0;
}
*/
// 鉛筆
/*
int main(){
int N, a, b, c, d;
cin >> N >> a >> b >> c >> d;
/*
int x, y;
for(int i=1; i*a < N; i++){
x = i*b;
}
for(int i=1; i*c < N; i++){
y = i*d;
}
x += b;
y += d;*/
/*
int x = N/a * b;
if(N%a != 0) x += b;
int y = N/c * d;
if(N%c != 0) y += d;
if(x>y) x = y;
cout << x << endl;
return 0;
}
*/
/*
int main(){
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int ans = 0;
if(a<0){
ans += c * abs(a) + d;
a = 0;
}
ans += (b-a)*e;
cout << ans << endl;
return 0;
}
*/
/*
//科目選択
int main(){
int a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e >> f;
if(e < f) e = f;
int sum = a + b + c + d;
if(a>b) a = b;
if(a>c) a = c;
if(a>d) a = d;
cout << sum - a + e << endl;
return 0;
}
*/
// 最大の和
/*
int main(){
while(true){
int k;
int A[100000];
int N;
cin >> N >> k;
if(N == 0 && k == 0) break;
A[0] = 0;
for(int i=1; i<=N; i++){
cin >> A[i];
A[i] = A[i] + A[i-1];
}
int ans = -99999999;
for(int i=1; i+k-1<N; i++){
ans = max(ans, A[i+k-1] - A[i-1]);
}
cout << ans << endl;
}
return 0;
}
*/
// フィボナッチ数列
/*
int dp[100];
int N;
int solve(int n){
if(dp[n] != -1) return dp[n];
dp[n] = solve(n-2) + solve(n-1);
return dp[n];
}
int main(){
cin >> N;
for(int i=0; i<100; i++){
dp[i] = -1;
}
dp[0] = 1;
dp[1] = 1;
cout << solve(N) << endl;
return 0;
}
*/
/*
//Longest Common Subsequence
int c[1001][1001];
int lcs(string X, string Y){
int m = X.size();
int n = Y.size();
int maxl = 0;
X = ' ' + X;
Y = ' ' + Y;
for(int i=0; i<=m; i++){
for(int j=0; j<=n; j++){
c[i][j] = 0;
}
}
//for(int i=1; i<=m; i++) c[i][0] = 0;
//for(int i=1; i<=n; i++) c[0][i] = 0;
for(int i=1; i<=m; i++){
for(int j=1; j<=n; j++){
if(X[i] == Y[j]){
c[i][j] = c[i-1][j-1] + 1;
}
else{
c[i][j] = max(c[i-1][j], c[i][j-1]);
}
maxl = max(c[i][j], maxl);
}
}
return maxl;
}
int main(){
int q;
cin >> q;
string X, Y;
for(int i=0; i<q; i++){
cin >> X >> Y;
cout << lcs(X, Y) << endl;
}
return 0;
}
/*
int main(){
/*
int x,y;
cin >> x >> y;
cout << x << " + " << y << " = " << x+y << endl;
cout << x << " - " << y << " = " << x-y << endl;
cout << x << " * " << y << " = " << x*y << endl;
cout << x << " / " << y << " = " << x/y << endl;
cout << x << " % " << y << " = " << x%y << endl;
*/
/*
int p;
cin >> p;
if(p<50){
cout << "Your grade is C" << endl;
}
else if(p >= 50 && p < 70){
cout << "Your grade is B" << endl;
}
else if(p >= 70 && p<100){
cout << "Your grade is A" << endl;
}
else if(p == 100){
cout << "Your grade is S" << endl;
}
*/
/*
string name;
double a, b, c, d, f;
cin >> name >> a >> b >> c >> d >> f;
double p = (5*a + 4*b + c*3 + d*2 + f)/(a + b + c + d + f);
cout << name << " ";
if(p == 5) cout << "Great!" << endl;
if(p >= 4&& p < 5) cout << "Very Good" << endl;
if(p >= 3&& p < 4) cout << "Good!" << endl;
if(p < 3) cout << "Poor!" << endl;
*/
/*
int aw, al, ah;
int bw, bl, bh;
int cw, cl, ch;
int dw, dl, dh;
int ew, el, eh;
cin >> aw >> al >> ah;
cin >> bw >> bl >> bh;
cin >> cw >> cl >> ch;
cin >> dw >> dl >> dh;
cin >> ew >> el >> eh;
int ap = aw - al;
int bp = bw - bl;
int cp = cw - cl;
int ap = dl;w - al;
int ap = aw - al;
return 0;
}
*/
// 総当り
/*
int N, M;
int A[100];
int dp[100][100];
int solve(int now, int m){
if(m == 0) return 1;
if(now >= N) return 0;
if(dp[now][m] != -1) return dp[now][m];
if(solve(now+1, m) == 1){
dp[now][m] = 1;
}
else{
dp[now][m] = solve(now+1, m-A[now]);
}
return dp[now][m];
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
dp[i][j] = -1;
}
}
int q;
cin >> q;
for(int i=0; i<q; i++){
cin >> M;
if(solve(0, M) == 1){
cout << "yes" << endl;
}
else{
cout << "no" << endl;
}
}
return 0;
}
*/
// 幅優先探索
/*
int N;
int M[101][101];
queue<int> que;
int cost[101];
void solve(int now){
for(int i=0; i<N; i++){
if(M[now][i] == 1){
if(cost[i] == -1){
cost[i] = cost[now] + 1;
que.push(i);
}
else if(cost[now] + 1 < cost[i]){
cost[i] = cost[now] + 1;
que.push(i);
}
}
}
}
int main(){
cin >> N;
for(int i=0; i<N; i++){
int u, k;
cin >> u >> k;
for(int j=0; j<k; j++){
int v;
cin >> v;
M[u-1][v-1] = 1;
}
}
for(int i=0; i<N; i++){
cost[i] = -1;
}
cost[0] = 0;
que.push(0);
while (!que.empty())
{
solve(que.front());
que.pop();
}
for(int i=0; i<N; i++){
cout << i+1 << " " << cost[i] << endl;
}
return 0;
}
*/
// 深さ優先探索
/*
int N;
int M[101][101] = {};
int d[101] = {};
int f[101] = {};
int ct = 0;
void solve(int now){
if(d[now] == 0) d[now] = ct;
for(int i=1; i<=N; i++){
if(M[now][i] == 1 && d[i] == 0){
ct++;
solve(i);
}
if(i == N){
ct++;
f[now] = ct;
}
}
}
int main(){
cin >> N;
for(int i=1; i<=N; i++){
M[0][i] = 1;
}
for(int i=0; i<N; i++){
int u, k;
cin >> u >> k;
for(int j=0; j<k; j++){
int v;
cin >> v;
M[u][v] = 1;
}
}
solve(0);
for(int i=1; i<=N; i++){
cout << i << " " << d[i] << " " << f[i] << endl;
}
return 0;
}
*/
// グラフの表現
/*
int main(){
int n;
int M[101][101] = {};
cin >> n;
for(int i=0; i<n; i++){
int u, k;
cin >> u >> k;
for(int j=0; j<k; j++){
int v;
cin >> v;
M[u-1][v-1] = 1;
}
}
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cout << M[i][j];
if(j != n-1){
cout << " ";
}
else{
cout << endl;
}
}
}
return 0;
}
*/
// 二乗法
/*
int main(){
long long m,n;
int MOD = 1000000007;
cin >> m >> n;
long long ans = 1;
while(n != 0){
if(n%2 == 1){
ans *= m;
ans %= MOD;
}
n = n/2;
m = m*m;
m %= MOD;
}
cout << ans << endl;
return 0;
}
*/
// カードゲーム
/*
int n;
bool T[100], H[100];
int Tnum = n, Hnum = n;
int main (){
cin >> n;
for(int i=0; i<2*n; i++){
T[i] = false;
}
for(int i=0; i<n; i++){
int a;
cin >> a;
T[a] = true;
}
for(int i=0; i<n; i++){
if(!T[i]){
H[i] = true;
}
}
int now;
bool turn = true;
for(int i=0; i<n; i++){
if(T[i]){
now = i;
T[i] = false;
Tnum--;
turn = false;
break;
}
}
while(Tnum > 0 || Hnum > 0){
for(int i=0; i<n; i++){
if(T[i]){
now = i;
T[i] = false;
Tnum--;
turn = false;
break;
}
else if(H[i]){
now = i;
H[i] = false;
Hnum--;
turn = true;
break;
}
}
}
return 0;
}
*/
/*
int A[100];
int B[100];
int n;
int ansT, ansH;
int taro = n - 1, hana = n;
void solve(int c, bool b){
if(taro == 0){
ansT = hana;
return;
}
if(hana == 0 ){
ansH = taro;
return;
}
if(b){
for(int i=0; i<n; i++){
if(c < B[i]){
int a = B[i];
B[i] = -1;
hana--;
solve( a, !b);
return;
}
else if(i==n-1){
taro++;
solve(0 , !b);
}
}
}
else{
for(int i=0; i<n; i++){
if(c < A[i]){
int a = B[i];
A[i] = -1;
taro--;
solve( a, !b);
return;
}
else if(i==n-1){
taro++;
solve(0, !b);
}
}
}
}
int main(){
while(true){
cin >> n;
if(n == 0){
break;
}
for(int i=0; i<n; i++){
cin >> A[i];
}
sort(A, A+n);
int m = 0;
for(int i=0; i<n ; i++){
for(int j=B[m]+1; j<=2*n; j++){
if(A[i] != j){
B[m] = j;
m++;
}
}
}
solve(A[0], true);
cout << ansT << endl << ansH << endl;
}
return 0;
}
*/
// 最高のピザ
/*
int n,a,b,c;
int A[110];
int dp[110][110];
int main(){
cin >> n >> a >> b >> c;
for(int i=1; i<=n; i++){
cin >> A[i];
}
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + A[i]);
}
}
int ans = c/a;
for(int i=0; i<=n; i++){
ans = max(ans, (dp[n][i]+c)/(a + b*i) );
}
cout << ans << endl;
return 0;
}
*/
/*
int x = 0;
dp[0].first = 0;
for(int j=0; j<n; j++){
//X.push_back(temp);
if(dp[j].first < dp[j].first + A[j]){
dp[j+1].first = dp[j].first + A[j];
dp[j+1].second = x;
}
else{
dp[j+1] = dp[j];
}
//dp.push_back(-1);
}
int ans = 0;
for(int i=0; i<n+1; i++){
ans = max( (dp[i].first + c)/(dp[i].second * b + a), ans);
}
cout << ans << endl;
*/
// cout << solve(0) << endl;
// チーズ
/*
int h,w,n;
pair<int,int> factory[10];
int cost[1000][1000];
queue< pair<int,int> > que;
string S[1000];
int A[2][4] = {{-1, 1 ,0, 0}, {0, 0, -1, 1}};
void Solve(pair<int,int> Now){
for(int i = 0; i<4; i++){
int x = Now.first + A[0][i];
int y = Now.second + A[1][i];
if(x >= 0 && x < h&&y >= 0&&y < w && S[Now.first +
A[0][i]][Now.second + A[1][i]] != 'X'){ if(cost[Now.first][Now.second] + 1 <
cost[x ][y]){ cost[x][y] = cost[Now.first][Now.second] + 1;
que.push(make_pair(x, y));
}
}
}
//上
if(Now.first - 1 >= 0 && S[Now.first - 1][Now.second] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first -
1][Now.second]){ cost[Now.first - 1][Now.second] = cost[Now.first][Now.second] +
1; que.push(make_pair(Now.first -1, Now.second));
}
}
//下
if(Now.first + 1 < h && S[Now.first + 1][Now.second] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first +
1][Now.second]){ cost[Now.first + 1][Now.second] = cost[Now.first][Now.second] +
1; que.push(make_pair(Now.first + 1, Now.second));
}
}
//hidari
if(Now.second - 1 >= 0 && S[Now.first][Now.second - 1] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first][Now.second
- 1]){ cost[Now.first][Now.second - 1] = cost[Now.first][Now.second] + 1;
que.push(make_pair(Now.first, Now.second - 1));
}
}
//r
if(Now.second +1 < w && S[Now.first][Now.second + 1] != 'X'){
if(cost[Now.first][Now.second] + 1 < cost[Now.first][Now.second
+ 1]){ cost[Now.first][Now.second + 1] = cost[Now.first][Now.second] + 1;
que.push(make_pair(Now.first , Now.second + 1));
}
}
}
int main(){
//チーズ
cin >> h >> w >> n;
for(int i=0; i<h; i++){
cin >> S[i];
}
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
if(S[i][j] == 'S'){
factory[0] = make_pair(i, j);
}
else if(S[i][j] != 'X' && S[i][j] != '.'){
factory[S[i][j]-'0'] = make_pair(i,j);
}
}
}
int ans = 0;
for(int i=0; i<n; i++){
for(int j=0; j<h; j++){
for(int k=0; k<w; k++){
cost[j][k] = 999999;
}
}
cost[factory[i].first][factory[i].second] = 0;
que.push(factory[i]);
while(!que.empty()){
Solve(que.front());
que.pop();
}
ans += cost[factory[i+1].first][factory[i+1].second];
}
cout << ans << endl;
return 0;
}
*/
// 宝探し
/*
int n,m;
cin >> n >> m;
int A[5100][5100];
//A[0][0] = 0;
/*
for(int i=0; i<5000; i++){
for(int j=0; j<5000; j++){
//A[i+1][j+1] = A[i+1][j] + A[i][j+1] -A[;
}
}
*/
/*
int Px[5000],Py[5000];
for(int i=0; i<n; i++){
int x,y;
cin >> x >> y;
//A[x][y] = 1;
}
int B[5100][5100];
B[0][0] = 0;
for(int i=0; i<100; i++){
for(int j=0; j<100; j++){
B[i+1][j+1] = B[i+1][j] + B[i][j+1] - B[i][j] + A[i+1][j+1];
}
}
for(int i=0; i<m; i++){
int x,y,X,Y;
cin >> x >> y >> X >> Y;
cout << B[x][y] - B[X-1][Y-1] << endl;
}
*/
// 超観光都市
/*
int w,h,n;
cin >> w >> h >> n;
int ans = 0;
int X,Y;
int x,y;
cin >> x >> y;
X = x;
Y = y;
for(int i=0; i<n-1; i++){
cin >> x >> y;
bool hugou = ((x-X>0&&y-Y>0)||(x-X<0&&y-Y<0));
if(hugou == 1){
ans += max(abs(x-X), abs(y-Y));
}
else{
ans += abs(x-X)+abs(y-Y);
}
X = x;
Y = y;
}
cout << ans << endl;
*/
// すごろく
/*
while(true){
int n,m;
cin >> n >> m;
if(n==0 && m==0) break;
int X[1000],Y;
for(int i=0 ; i<n; i++){
cin >> X[i];
}
int i,a=0;
for(i=0; i<m; i++){
cin >> Y;
a += Y;
a += X[a];
if(a+1>=n) break;
}
cout << i + 1<< endl;
}
*/
// 看板(未完成）
/*
int n,Ans;
string name;
cin >> n >> name;
for(int i=0; i<n; i++){
string s;
cin >> s;
int x[100];
int l=0;
for(int j=0; j<name.size(); j++){
for(int k=0; k<s.size(); k++){
if(name[j]==s[k]){
x[l]=k;
l++;
}
}
}
int p=x[1]-x[0];
for(int j=1; j<l+1; j++){
if(p!=x[j]-x[j-1])
break;
}
}
*/
// サッカー
/*
int n;
cin >> n;
int P[100];
for(int i = 0; i<n; i++){
P[i]=0;
}
for(int i=0; i<n*(n-1)/2; i++){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(c>d)
P[a-1] += 3;
if(c==d){
P[a-1]++;
P[b-1]++;
}
if(c<d)
P[b-1] += 3;
}
int Q[100];
for(int i =0; i<n; i++){
Q[i] = P[i];
}
sort(Q, Q+n);
reverse(Q,Q+n);
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(P[i]==Q[j]){
cout << j+1 << endl;
break;
}
}
}
*/
// 気象予報士
/*
int h,w;
int x=-1;
cin >> h >> w;
for(int i=0; i<h; i++){
for(int j =0; j<w; j++){
char a;
cin >> a;
if(a=='c'){
cout << 0;
x = j;
}
else if(x != -1){
cout << j-x;
}
else
cout << -1;
if(j==w-1)
break;
cout << " ";
}
cout << endl;
x = -1;
}
*/
/*
//数あて
int n;
cin >> n;
int p[200][3];
for(int i=0;i<n;i++)
{
cin >> p[i][0] >> p[i][1] >> p[i][2];
}
int _p;
for(int k=0;k<3;k++)
{
for(int i=0;i<n;i++)
{
_p = p[i][k];
for(int j=i+1;j<n;j++)
{
if(_p == p[j][k])
{
p[i][k] = 0;
p[j][k] = 0;
}
}
}
}
for(int i=0;i<n;i++)
{
cout << p[i][0] + p[i][1] + p[i][2] << endl;
}
*/
/*
//得点
int ai,am,as,ae,bi,bm,bs,be;
cin >> ai >> am >> as >> ae >> bi >> bm >> bs >> be;
int answer=ai+am+as+ae;
if(answer < bi+bm+bs+be)
{
/ answer=bi+bm+bs+be;
}
cout << answer << endl;
*/
// おつり
/* int onum;
while(true){
int N;
cin >> N;
if(N == 0) break;
onum=0;
int oturi = 1000-N;
if(oturi >= 500)
{
onum++;
oturi -= 500;
}
while(oturi>=100)
{
onum++;
oturi -= 100;
}
if(oturi >= 50)
{
onum++;
oturi -= 50;
}
while(oturi>=10)
{
onum++;
oturi -= 10;
}
if(oturi >= 5)
{
onum++;
oturi -= 5;
}
while(oturi>=1)
{
onum++;
oturi -= 1;
}
cout << onum << endl;
}
*/
// レシート
/*
while(true){
int N;
cin >> N;
if(N==0) break;
int a[9];
for(int i=0;i<9;i++){
cin >> a[0];
}
}
/*
int N;
int i = 0;
while(i<N){
i++;
}
for(int i=0; i<N; i++)
*/
/*
int N;
int x;
set<int> a;
cin >> N;
for(int i=0; i<N; i++){
cin >> x;
a.insert(x);
}
cout << a.size() << endl;
*/
// 投票
/*
int N,M;
cin >> N >> M;
int a;
int A[1000];
int B[1000];
int X[1000][2];
for(int i=0; i<N; i++){
cin >> A[i];
X[i][0] = i;
X[i][1] = 0;
}
for(int j=0; j<M;j++){
cin >> B[j];
}
for(int j=0; j<M; j++){
for(int i=0; i<N; i++){
if(A[i] <= B[j]){
X[i][1]++;
break;
}
}
}
for(int i=1; i<N; i++){
if(X[i-1][1]<X[i][1])
X[i-1][0] = X[i][0];
}
cout << X[0][0]+1 << endl;
*/
/*
int N,M;
cin >> N >> M;
int A[1000];
int vote[1000];
for(int i=0; i<N; i++){
cin >> A[i];
vote[i] =0;
}
int B;
for(int i=0; i<M; i++){
cin >> B;
for(int j=0; j<N; j++){
if(A[j]<=B){
vote[j]++;
break;
}
}
}
int temps = 0;
int ans=0;
for(int i=0; i<N; i++){
if(vote[i] >= temps){
temps = vote[i];
ans = i;
}
}
cout << ans+1 << endl;
*/
// return 0;
//}
/*
int max(int i,int j){
if(i < j) i=j;
return i;
}
*/
|
replace
| 20 | 21 | 20 | 21 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int N;
vector<long long> h(N + 1);
long long dp[110000];
long long dfs(int k) {
if (k >= N)
return INF;
if (k == N - 1)
return 0;
if (dp[k] != -1)
return dp[k];
long long step1 = dfs(k + 1) + abs(h[k + 1] - h[k]);
long long step2 = dfs(k + 2) + abs(h[k + 2] - h[k]);
return dp[k] = min(step1, step2);
}
int main() {
cin >> N;
REP(i, N) { cin >> h[i]; }
REP(i, 110000) { dp[i] = -1; }
cout << dfs(0) << endl;
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
#define PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int N;
vector<long long> h(110000);
long long dp[110000];
long long dfs(int k) {
if (k >= N)
return INF;
if (k == N - 1)
return 0;
if (dp[k] != -1)
return dp[k];
long long step1 = dfs(k + 1) + abs(h[k + 1] - h[k]);
long long step2 = dfs(k + 2) + abs(h[k + 2] - h[k]);
return dp[k] = min(step1, step2);
}
int main() {
cin >> N;
REP(i, N) { cin >> h[i]; }
REP(i, 110000) { dp[i] = -1; }
cout << dfs(0) << endl;
return 0;
}
|
replace
| 18 | 19 | 18 | 19 |
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 FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define ll long long int
#define F first
#define S second
#define pll pair<ll, ll>
#define vl vector<ll>
#define pb push_back
struct compare {
bool operator()(const pair<int, int> &a, const pair<int, int> &b) const {
if ((a.S - a.F) != (b.S - b.F))
return ((a.S - a.F) > (b.S - b.F));
else
return (a.F < b.F);
}
};
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
FASTIO;
ll n, i;
cin >> n;
vl v(n), dp(n, LLONG_MAX);
for (i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (i = 0; i < n; i++) {
if ((i + 1) < n)
dp[i + 1] = min(dp[i + 1], (dp[i] + abs(v[i + 1] - v[i])));
if ((i + 2) < n)
dp[i + 2] = min(dp[i + 2], (dp[i] + abs(v[i + 2] - v[i])));
}
cout << dp[n - 1] << endl;
}
|
#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 FASTIO \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false)
#define ll long long int
#define F first
#define S second
#define pll pair<ll, ll>
#define vl vector<ll>
#define pb push_back
struct compare {
bool operator()(const pair<int, int> &a, const pair<int, int> &b) const {
if ((a.S - a.F) != (b.S - b.F))
return ((a.S - a.F) > (b.S - b.F));
else
return (a.F < b.F);
}
};
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
FASTIO;
ll n, i;
cin >> n;
vl v(n), dp(n, LLONG_MAX);
for (i = 0; i < n; i++)
cin >> v[i];
dp[0] = 0;
for (i = 0; i < n; i++) {
if ((i + 1) < n)
dp[i + 1] = min(dp[i + 1], (dp[i] + abs(v[i + 1] - v[i])));
if ((i + 2) < n)
dp[i + 2] = min(dp[i + 2], (dp[i] + abs(v[i + 2] - v[i])));
}
cout << dp[n - 1] << endl;
}
|
replace
| 26 | 30 | 26 | 30 |
-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;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(N), h(N);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1) - h.at(i)));
if (i > 1) {
chmin(res, rec(i - 2) + abs(h.at(i - 2) - h.at(i)));
}
return dp.at(i) = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
dp.at(i) = INF;
}
cout << rec(N - 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void chmin(int &a, int b) {
if (a > b) {
a = b;
}
}
int INF = 1000000000;
int N;
vector<int> dp(100010), h(100010);
int rec(int i) {
if (dp.at(i) < INF) {
return dp.at(i);
}
if (i == 0) {
return 0;
}
int res = INF;
chmin(res, rec(i - 1) + abs(h.at(i - 1) - h.at(i)));
if (i > 1) {
chmin(res, rec(i - 2) + abs(h.at(i - 2) - h.at(i)));
}
return dp.at(i) = res;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> h.at(i);
dp.at(i) = INF;
}
cout << rec(N - 1) << endl;
}
|
replace
| 11 | 12 | 11 | 12 |
-6
|
terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03160
|
C++
|
Runtime Error
|
/*
################
# Avi Kasliwal #
# Noob Coder:( #
################
*/
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(NULL)
#define deb(x) cout << "#x " << x << "\n"
#define newline cout << "\n"
#define yes \
cout << "Yes" \
<< "\n"
#define no \
cout << "No" \
<< "\n"
#define Yes \
cout << "YES" \
<< "\n"
#define No \
cout << "NO" \
<< "\n"
#define fixDeci(num, places) \
std::cout << std::fixed << std::setprecision(places) << num << '\n'
#define setBits(x) __builtin_popcount(x)
#define zerobits(x) __builtint_ctzll(x)
#define MOD 1000000007
#define rep(i, s, e) for (i = s; i < e; i++)
#define repr(i, s, e) for (i = s; i >= e; i--)
// GCD Function
int GCD(int a, int b) {
if (b == 0) {
return a;
} else {
return GCD(b, a % b);
}
}
// LCM Function
int LCM(int a, int b) {
int gcd = GCD(a, b);
return (max(a, b) / gcd) * (min(a, b));
}
/*int p[100000001];
void Sieve() {
p[0] = p[1] = 0;
p[2] = 1;
for (int i = 4; i < 100000000; i += 2) {
p[i] = 0;
}
for (int i = 3; i * i < 100000000; i++) {
if (p[i] == 1) {
for (int j = i*i; j < 100000000; j += i) {
p[j] = 0;
}
}
}
}*/
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int i, j;
/*######## Code Here ##########*/
/*~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
int t;
t = 1;
while (t--) {
int n;
cin >> n;
int a[n];
rep(i, 0, n) { cin >> a[i]; }
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
rep(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] << "\n";
}
return 0;
}
/*Timus : 294930IX */
|
/*
################
# Avi Kasliwal #
# Noob Coder:( #
################
*/
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(NULL)
#define deb(x) cout << "#x " << x << "\n"
#define newline cout << "\n"
#define yes \
cout << "Yes" \
<< "\n"
#define no \
cout << "No" \
<< "\n"
#define Yes \
cout << "YES" \
<< "\n"
#define No \
cout << "NO" \
<< "\n"
#define fixDeci(num, places) \
std::cout << std::fixed << std::setprecision(places) << num << '\n'
#define setBits(x) __builtin_popcount(x)
#define zerobits(x) __builtint_ctzll(x)
#define MOD 1000000007
#define rep(i, s, e) for (i = s; i < e; i++)
#define repr(i, s, e) for (i = s; i >= e; i--)
// GCD Function
int GCD(int a, int b) {
if (b == 0) {
return a;
} else {
return GCD(b, a % b);
}
}
// LCM Function
int LCM(int a, int b) {
int gcd = GCD(a, b);
return (max(a, b) / gcd) * (min(a, b));
}
/*int p[100000001];
void Sieve() {
p[0] = p[1] = 0;
p[2] = 1;
for (int i = 4; i < 100000000; i += 2) {
p[i] = 0;
}
for (int i = 3; i * i < 100000000; i++) {
if (p[i] == 1) {
for (int j = i*i; j < 100000000; j += i) {
p[j] = 0;
}
}
}
}*/
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
IOS;
int i, j;
/*######## Code Here ##########*/
/*~~~~~~~~~~~~~~~~~~~~~~~~~~~~~*/
int t;
t = 1;
while (t--) {
int n;
cin >> n;
int a[n];
rep(i, 0, n) { cin >> a[i]; }
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
rep(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] << "\n";
}
return 0;
}
/*Timus : 294930IX */
|
replace
| 74 | 78 | 74 | 78 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:256000000")
// #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define mp make_pair
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef long double ld;
mt19937_64 gen(time(NULL));
ll const maxn = 1e4 + 4;
ll dp[maxn];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> h(1 + n);
for (ll i = 1; i <= n; i++) {
cin >> h[i];
}
for (ll i = 0; i < maxn; i++)
dp[i] = 1e9;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i == 2)
continue;
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
/*
7 27 2
9 1 1 27 3 27 3
7 60 4
30 1 1 3 10 6 4
*/
|
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/stack:256000000")
// #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define mp make_pair
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef long double ld;
mt19937_64 gen(time(NULL));
ll const maxn = 1e5 + 4;
ll dp[maxn];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vector<ll> h(1 + n);
for (ll i = 1; i <= n; i++) {
cin >> h[i];
}
for (ll i = 0; i < maxn; i++)
dp[i] = 1e9;
dp[1] = 0;
for (ll i = 2; i <= n; i++) {
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i == 2)
continue;
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n] << endl;
return 0;
}
/*
7 27 2
9 1 1 27 3 27 3
7 60 4
30 1 1 3 10 6 4
*/
|
replace
| 34 | 35 | 34 | 35 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[11009];
ll val[11009];
ll n;
ll frog(ll i) {
if (i == n - 1)
return 0;
if (i > n - 1)
return 989898;
// cout<<"I = "<<i<<endl;
// if(i==n-1)return (abs(val[i]-val[n-1]));
// if(i==n-2)return (abs(val[i]-val[n-2]));
if (dp[i] != -1)
return dp[i];
ll f1, f2;
f1 = frog(i + 1) + abs(val[i] - val[i + 1]);
// cout<<"f1 = "<<f1<<endl;
f2 = frog(i + 2) + abs(val[i] - val[i + 2]);
// cout<<" f2 = "<<f2<<endl;
dp[i] = min(f1, f2);
return dp[i];
}
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
ll d;
cin >> d;
val[i] = d;
}
memset(dp, -1, sizeof(dp));
ll ans = frog(0);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[100009];
ll val[100009];
ll n;
ll frog(ll i) {
if (i == n - 1)
return 0;
if (i > n - 1)
return 989898;
// cout<<"I = "<<i<<endl;
// if(i==n-1)return (abs(val[i]-val[n-1]));
// if(i==n-2)return (abs(val[i]-val[n-2]));
if (dp[i] != -1)
return dp[i];
ll f1, f2;
f1 = frog(i + 1) + abs(val[i] - val[i + 1]);
// cout<<"f1 = "<<f1<<endl;
f2 = frog(i + 2) + abs(val[i] - val[i + 2]);
// cout<<" f2 = "<<f2<<endl;
dp[i] = min(f1, f2);
return dp[i];
}
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
ll d;
cin >> d;
val[i] = d;
}
memset(dp, -1, sizeof(dp));
ll ans = frog(0);
cout << ans << endl;
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p03160
|
C++
|
Runtime Error
|
// \[T]/
//Praise
// (*)
//The / \ Sun
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) \
for (ll i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define rep(n) for (ll i = 0; i < n; i++)
#define fr(i, j, k) for (ll i = j; i < k; i++)
#define FR(i, j, k) for (ll i = j; i >= 0; i--)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define INF 1000000
#define xx first
#define yy second
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("/home/ram/Competitive Programming/IO/in.txt", "r", stdin);
freopen("/home/ram/Competitive Programming/IO/out.txt", "w", stdout);
#endif
int n;
cin >> n;
vl a(n), dp(n);
invec(a, n);
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
fr(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] << "\n";
}
|
// \[T]/
//Praise
// (*)
//The / \ Sun
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) \
for (ll i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define rep(n) for (ll i = 0; i < n; i++)
#define fr(i, j, k) for (ll i = j; i < k; i++)
#define FR(i, j, k) for (ll i = j; i >= 0; i--)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define INF 1000000
#define xx first
#define yy second
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("/home/ram/Competitive Programming/IO/in.txt", "r", stdin);
// freopen("/home/ram/Competitive Programming/IO/out.txt", "w", stdout);
// #endif
int n;
cin >> n;
vl a(n), dp(n);
invec(a, n);
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
fr(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] << "\n";
}
|
replace
| 38 | 42 | 38 | 42 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include "bits/stdc++.h"
using namespace std;
// template<typename... T>
// void read(T&... args) {
// ((cin >> args), ...);
// }
// template<typename... T>
// void write(T&&... args) {
// ((cout << args << " "), ...);
// }
// #define deb(x) cerr << #x << " " << x <<endl;
// #define debs(args ...) cerr << __LINE__ << ": ", err(new
// istringstream(string(#args)), args), cerr << '\n' void err(istringstream
// *iss) {} template<typename T, typename ... Args> void err(istringstream *iss,
// const T &_val, const Args & ... args) {
// string _name;
// *iss >> _name;
// if (_name.back()==',') _name.pop_back();
// cerr << _name << " = " << _val << "; ", err(iss, args ...);
// }
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
while (cin >> n) {
vector<int> lst(n);
for (int i = 0; i < n; cin >> lst[i++])
;
vector<long long> dp(n + 2, 0);
dp[2] = abs(lst[1] - lst[0]);
for (int i = 3; i <= n; ++i)
dp[i] = min(dp[i - 1] + abs(lst[i - 1] - lst[i - 2]),
dp[i - 2] + abs(lst[i - 1] - lst[i - 3]));
cout << dp[n] << endl;
}
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
// template<typename... T>
// void read(T&... args) {
// ((cin >> args), ...);
// }
// template<typename... T>
// void write(T&&... args) {
// ((cout << args << " "), ...);
// }
// #define deb(x) cerr << #x << " " << x <<endl;
// #define debs(args ...) cerr << __LINE__ << ": ", err(new
// istringstream(string(#args)), args), cerr << '\n' void err(istringstream
// *iss) {} template<typename T, typename ... Args> void err(istringstream *iss,
// const T &_val, const Args & ... args) {
// string _name;
// *iss >> _name;
// if (_name.back()==',') _name.pop_back();
// cerr << _name << " = " << _val << "; ", err(iss, args ...);
// }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
while (cin >> n) {
vector<int> lst(n);
for (int i = 0; i < n; cin >> lst[i++])
;
vector<long long> dp(n + 2, 0);
dp[2] = abs(lst[1] - lst[0]);
for (int i = 3; i <= n; ++i)
dp[i] = min(dp[i - 1] + abs(lst[i - 1] - lst[i - 2]),
dp[i - 2] + abs(lst[i - 1] - lst[i - 3]));
cout << dp[n] << endl;
}
return 0;
}
|
replace
| 27 | 31 | 27 | 28 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <unordered_map>
#define M 1000000007
#define T 998244353
#define PI 3.142
#define ll long long
using namespace std;
int ab(int a, int b) {
if (a < b) {
return b - a;
}
return a - b;
}
int mini(int a, int b) {
if (a > b) {
return b;
}
return a;
}
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, i;
cin >> n;
int a[n], cost[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
cost[n - 1] = ab(a[n - 1], a[n - 2]);
cost[n - 2] =
mini(cost[n - 1] + ab(a[n - 2], a[n - 3]), ab(a[n - 1], a[n - 3]));
for (i = n - 3; i > 0; i--) {
cost[i] = mini(cost[i + 1] + ab(a[i], a[i - 1]),
cost[i + 2] + ab(a[i - 1], a[i + 1]));
}
cout << cost[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#define M 1000000007
#define T 998244353
#define PI 3.142
#define ll long long
using namespace std;
int ab(int a, int b) {
if (a < b) {
return b - a;
}
return a - b;
}
int mini(int a, int b) {
if (a > b) {
return b;
}
return a;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i;
cin >> n;
int a[n], cost[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
cost[n - 1] = ab(a[n - 1], a[n - 2]);
cost[n - 2] =
mini(cost[n - 1] + ab(a[n - 2], a[n - 3]), ab(a[n - 1], a[n - 3]));
for (i = n - 3; i > 0; i--) {
cost[i] = mini(cost[i + 1] + ab(a[i], a[i - 1]),
cost[i + 2] + ab(a[i - 1], a[i + 1]));
}
cout << cost[1] << endl;
return 0;
}
|
delete
| 27 | 32 | 27 | 27 |
0
| |
p03160
|
C++
|
Runtime Error
|
/*
@author : srinathbalaji_99
*/
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define endl '\n'
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define rep(i, a, b, inc) for (long long i = a; i < b; i += inc)
#define REP(i, n) rep(i, 0, n, 1)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define PLL pair<long long, long long>
#define VL vector<long long>
#define VS vector<string>
#define VLL vector<PLL>
#define VVL vector<VL>
#define MPLL map<long long, long long>
#define UMPLL unordered_map<long long, long long>
#define SETL set<long long>
#define MSETL multiset<long long>
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) (a * b) / GCD(a, b)
#define ff first
#define ss second
#define pall(a) \
REP(i, sizeof(a) / sizeof(a[0])) cout << a[i] << " "; \
cout << endl;
#define pvall(v) \
REP(i, v.size()) cout << v[i] << " "; \
cout << endl;
#define gall(a, n) REP(i, n) cin >> a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
LL dp[100001], h[100001];
int main() {
fast();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
LL t, n, i, j, k, x, y, c;
cin >> n;
gall(h, n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
rep(i, 2, n, 1) {
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];
}
|
/*
@author : srinathbalaji_99
*/
#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define endl '\n'
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define rep(i, a, b, inc) for (long long i = a; i < b; i += inc)
#define REP(i, n) rep(i, 0, n, 1)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define PLL pair<long long, long long>
#define VL vector<long long>
#define VS vector<string>
#define VLL vector<PLL>
#define VVL vector<VL>
#define MPLL map<long long, long long>
#define UMPLL unordered_map<long long, long long>
#define SETL set<long long>
#define MSETL multiset<long long>
#define GCD(a, b) __gcd(a, b)
#define LCM(a, b) (a * b) / GCD(a, b)
#define ff first
#define ss second
#define pall(a) \
REP(i, sizeof(a) / sizeof(a[0])) cout << a[i] << " "; \
cout << endl;
#define pvall(v) \
REP(i, v.size()) cout << v[i] << " "; \
cout << endl;
#define gall(a, n) REP(i, n) cin >> a[i];
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef unsigned long long ULL;
typedef long long LL;
typedef long double LD;
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
LL dp[100001], h[100001];
int main() {
fast();
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
LL t, n, i, j, k, x, y, c;
cin >> n;
gall(h, n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
rep(i, 2, n, 1) {
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];
}
|
replace
| 55 | 59 | 55 | 59 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define ld long double
// #define mp make_pair
#define vpll vector<pair<ll, ll>>
#define sll set<ll>
#define vll vector<ll>
#define vld vector<ld>
#define vvll vector<vector<ll>>
#define vvld vector<vector<ld>>
#define pll pair<ll, ll>
#define vvpll vector<vector<pair<ll, ll>>>
#define pqll priority_queue<ll>
#define mll map<ll, ll>
#define mlc map<ll, char>
#define um unordered_map
#define umll um<ll, ll>
#define umlc um<ll, char>
#define umcl um<char, ll>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define test \
ll Testcases; \
cin >> Testcases; \
while (Testcases--)
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
void inp_out() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
int main() {
fastIO inp_out();
ll n;
cin >> n;
vll a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
ll dp[n];
dp[0] = 0;
for (ll i = 1; i < n; ++i) {
ll val = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1) {
val = min(val, dp[i - 2] + abs(a[i - 2] - a[i]));
}
dp[i] = val;
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define MOD 1000000007
#define inf 3e18
#define ld long double
// #define mp make_pair
#define vpll vector<pair<ll, ll>>
#define sll set<ll>
#define vll vector<ll>
#define vld vector<ld>
#define vvll vector<vector<ll>>
#define vvld vector<vector<ld>>
#define pll pair<ll, ll>
#define vvpll vector<vector<pair<ll, ll>>>
#define pqll priority_queue<ll>
#define mll map<ll, ll>
#define mlc map<ll, char>
#define um unordered_map
#define umll um<ll, ll>
#define umlc um<ll, char>
#define umcl um<char, ll>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define test \
ll Testcases; \
cin >> Testcases; \
while (Testcases--)
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define db(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << " " << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
void inp_out() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("debug.txt", "w", stderr);
#endif
}
int main() {
fastIO
// inp_out();
ll n;
cin >> n;
vll a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
ll dp[n];
dp[0] = 0;
for (ll i = 1; i < n; ++i) {
ll val = dp[i - 1] + abs(a[i] - a[i - 1]);
if (i > 1) {
val = min(val, dp[i - 2] + abs(a[i - 2] - a[i]));
}
dp[i] = val;
}
cout << dp[n - 1];
return 0;
}
|
replace
| 54 | 56 | 54 | 57 |
-6
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1000000007;
template <typename T> void print(const T &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
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 int MAX = 10010;
int dp[MAX];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i < n - 2; i++) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 2] - h[i + 1]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1000000007;
template <typename T> void print(const T &v) {
for (int i = 0; i < v.size(); i++) {
if (i)
cout << ' ';
cout << v[i];
}
cout << endl;
}
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 int MAX = 100010;
ll dp[MAX];
int main() {
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 0; i < n - 2; i++) {
dp[i + 2] =
min(dp[i] + abs(h[i + 2] - h[i]), dp[i + 1] + abs(h[i + 2] - h[i + 1]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 33 | 35 | 33 | 35 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int dp[100001];
int n, arr[100001];
int pound(int pos) {
if (dp[pos] != -1)
return dp[pos];
return dp[pos] = min(abs(arr[pos] - arr[pos - 1]) + pound(pos - 1),
abs(arr[pos] - arr[pos - 2]) + pound(pos - 2));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("frog_in.txt", "r", stdin);
#endif
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
cout << pound(n - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int dp[100001];
int n, arr[100001];
int pound(int pos) {
if (dp[pos] != -1)
return dp[pos];
return dp[pos] = min(abs(arr[pos] - arr[pos - 1]) + pound(pos - 1),
abs(arr[pos] - arr[pos - 2]) + pound(pos - 2));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
memset(dp, -1, sizeof(dp));
for (int i = 0; i < n; ++i)
cin >> arr[i];
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
cout << pound(n - 1);
return 0;
}
|
delete
| 19 | 23 | 19 | 19 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, h[100001], min_cost[100001];
int mincost(int i) {
if (i == 0)
return 0;
if (i == 1)
return abs(h[1] - h[0]);
if (min_cost[i - 1] == -1)
min_cost[i - 1] = mincost(i - 1);
if (min_cost[i - 2] == -1)
min_cost[i - 2] = mincost(i - 2);
return min(abs(h[i] - h[i - 1]) + min_cost[i - 1],
abs(h[i] - h[i - 2]) + min_cost[i - 2]);
}
int32_t 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
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
min_cost[i] = -1;
cout << mincost(n - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, h[100001], min_cost[100001];
int mincost(int i) {
if (i == 0)
return 0;
if (i == 1)
return abs(h[1] - h[0]);
if (min_cost[i - 1] == -1)
min_cost[i - 1] = mincost(i - 1);
if (min_cost[i - 2] == -1)
min_cost[i - 2] = mincost(i - 2);
return min(abs(h[i] - h[i - 1]) + min_cost[i - 1],
abs(h[i] - h[i - 2]) + min_cost[i - 2]);
}
int32_t 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
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
min_cost[i] = -1;
cout << mincost(n - 1);
return 0;
}
|
replace
| 20 | 24 | 20 | 24 |
0
| |
p03160
|
C++
|
Runtime Error
|
// slight modification similar logic errichto's code
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
vector<int> h(n);
for (int &x : h) {
cin >> x;
}
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[i] - h[j]));
}
}
}
cout << dp[n - 1] << "\n";
return 0;
}
|
// slight modification similar logic errichto's code
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> h(n);
for (int &x : h) {
cin >> x;
}
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[i] - h[j]));
}
}
}
cout << dp[n - 1] << "\n";
return 0;
}
|
insert
| 14 | 14 | 14 | 15 |
-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 ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define w(x) \
int t; \
cin >> t; \
while (t--)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, b, a) for (int i = b; i >= a; i--)
#define mk(arr, n, type) type *arr = new type[n];
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define um unordered_map
#define us unordered_set
#define pqm priority_queue<int>
#define pqmi priority_queue<int, vi, greater<int>>
#define lb(v, val) lower_bound(v.begin(), v.end(), val) - v.begin();
#define ub(v, val) upper_bound(v.begin(), v.end(), val) - v.begin();
#define setbits(x) __builtin_popcountll(x)
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define out(flag) flag ? cout << "NO" << endl : cout << "YES" << endl;
#define MAX 100001
#define mod 998244353
#define inf 1e18
#define PI 3.1415926535
void IO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast;
}
int main() {
IO();
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
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 ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define w(x) \
int t; \
cin >> t; \
while (t--)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define repd(i, b, a) for (int i = b; i >= a; i--)
#define mk(arr, n, type) type *arr = new type[n];
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define um unordered_map
#define us unordered_set
#define pqm priority_queue<int>
#define pqmi priority_queue<int, vi, greater<int>>
#define lb(v, val) lower_bound(v.begin(), v.end(), val) - v.begin();
#define ub(v, val) upper_bound(v.begin(), v.end(), val) - v.begin();
#define setbits(x) __builtin_popcountll(x)
#define fast \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define out(flag) flag ? cout << "NO" << endl : cout << "YES" << endl;
#define MAX 100001
#define mod 998244353
#define inf 1e18
#define PI 3.1415926535
void IO() { fast; }
int main() {
IO();
int n;
cin >> n;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
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
| 37 | 44 | 37 | 38 |
-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 FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
/* #define INF 1e10 */
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve(long long N, vector<long long> h) {
vector<ll> dp(N + 100); //, INF);
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
// initial point
dp[0] = 0;
for (ll i = 0; i < N; ++i) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1] << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
cin >> N;
vector<long long> h(N + 100, 0);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
solve(N, move(h));
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
/* #define INF 1e10 */
typedef long long ll;
const ll INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
void solve(long long N, vector<long long> h) {
vector<ll> dp(N + 10000, INF);
// initial point
dp[0] = 0;
for (ll i = 0; i < N; ++i) {
chmin(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[N - 1] << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
cin >> N;
vector<long long> h(N + 100, 0);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
solve(N, move(h));
}
|
replace
| 24 | 27 | 24 | 25 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod = 1e9 + 7;
#define PI 3.1415926535897932385
#define INF 100000000000000000ll
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#include <string>
string char_to_str(char c) {
string tem(1, c);
return tem;
}
typedef pair<int, int> ii;
#define S second
#define F first
ll max(ll a, ll b) {
if (a > b) {
return a;
}
return b;
}
ll min(ll a, ll b) {
if (a < b) {
return a;
}
return b;
}
// string to integer stoi() Remember: it takes string not character
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
// To compile--> g++ -std=c++0x -o output one.cpp
// To run--> ./output
int main() {
fastio;
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
ans[i] = min(ans[i - 1] + abs(a[i - 1] - a[i]),
ans[i - 2] + abs(a[i - 2] - a[i]));
}
cout << ans[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll mod = 1e9 + 7;
#define PI 3.1415926535897932385
#define INF 100000000000000000ll
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#include <string>
string char_to_str(char c) {
string tem(1, c);
return tem;
}
typedef pair<int, int> ii;
#define S second
#define F first
ll max(ll a, ll b) {
if (a > b) {
return a;
}
return b;
}
ll min(ll a, ll b) {
if (a < b) {
return a;
}
return b;
}
// string to integer stoi() Remember: it takes string not character
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
// To compile--> g++ -std=c++0x -o output one.cpp
// To run--> ./output
int main() {
fastio;
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans[n];
ans[0] = 0;
ans[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i) {
ans[i] = min(ans[i - 1] + abs(a[i - 1] - a[i]),
ans[i - 2] + abs(a[i - 2] - a[i]));
}
cout << ans[n - 1];
return 0;
}
|
replace
| 40 | 42 | 40 | 42 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define fr(i, a, b) for (int i = a; i < b; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int h[n + 1];
fr(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[1] = 0;
fr(i, 2, n + 1) {
int one = abs(h[i] - h[i - 1]) + dp[i - 1];
int two = (i == 2) ? INT_MAX : abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(one, two);
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define fr(i, a, b) for (int i = a; i < b; i++)
int main() {
// ios::sync_with_stdio(false);
// cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int h[n + 1];
fr(i, 1, n + 1) cin >> h[i];
int dp[n + 1];
dp[1] = 0;
fr(i, 2, n + 1) {
int one = abs(h[i] - h[i - 1]) + dp[i - 1];
int two = (i == 2) ? INT_MAX : abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(one, two);
}
cout << dp[n] << endl;
}
|
replace
| 12 | 18 | 12 | 18 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e3 + 6, M = 1e5 + 5, OO = 0x3f3f3f3f;
int n, h[N], op1, op2, dp[N];
int frog() {
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; 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];
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", h + i);
printf("%d\n", frog());
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1e5 + 6, M = 1e5 + 5, OO = 0x3f3f3f3f;
int n, h[N], op1, op2, dp[N];
int frog() {
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; 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];
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", h + i);
printf("%d\n", frog());
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
ll h[1000000]{0};
ll dp[1000000]{0};
ll n;
ll solve(ll i) {
if (i == n)
return 0;
if (i > n)
return INT_MAX;
ll ans = INT_MAX;
ans = solve(i + 1) + abs(h[i + 1] - h[i]);
if (i + 2 <= n) {
ans = min(ans, solve(i + 2) + abs(h[i + 2] - h[i]));
}
return dp[i] = ans;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> h[i + 1];
}
cout << solve(1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
ll h[1000000]{0};
ll dp[1000000]{0};
ll n;
ll solve(ll i) {
if (i == n)
return 0;
if (i > n)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
ll ans = INT_MAX;
ans = solve(i + 1) + abs(h[i + 1] - h[i]);
if (i + 2 <= n) {
ans = min(ans, solve(i + 2) + abs(h[i + 2] - h[i]));
}
return dp[i] = ans;
}
int main() {
memset(dp, -1, sizeof(dp));
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> h[i + 1];
}
cout << solve(1) << endl;
}
|
insert
| 13 | 13 | 13 | 15 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int dp[10001];
int h[10001];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n;
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n == 2) {
cout << abs(h[0] - h[1]);
return 0;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int a = abs(h[i] - h[i - 2]) + dp[i - 2];
int b = abs(h[i] - h[i - 1]) + dp[i - 1];
dp[i] = min(a, b);
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100001];
int h[100001];
int main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n;
cin >> n;
if (n == 1) {
cout << 0;
return 0;
}
for (int i = 0; i < n; i++) {
cin >> h[i];
}
if (n == 2) {
cout << abs(h[0] - h[1]);
return 0;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
int a = abs(h[i] - h[i - 2]) + dp[i - 2];
int b = abs(h[i] - h[i - 1]) + dp[i - 1];
dp[i] = min(a, b);
}
cout << dp[n - 1];
return 0;
}
|
replace
| 4 | 6 | 4 | 6 |
0
| |
p03160
|
C++
|
Runtime Error
|
// Om Sree Sai Ram
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
vector<int> dp;
int dfs(int i, int ar[], int n) {
if (dp[i] != INT_MAX) {
return dp[i];
}
if (i == n - 1) {
return 0;
}
if (i + 1 < n) {
int tmp = abs(ar[i + 1] - ar[i]) + dfs(i + 1, ar, n);
dp[i] = min(dp[i], tmp);
}
if (i + 2 < n) {
int tmp = abs(ar[i + 2] - ar[i]) + dfs(i + 2, ar, n);
dp[i] = min(dp[i], tmp);
}
return dp[i];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cout<<" Hello world"<<endl;
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
dp.assign(n, INT_MAX);
dfs(0, ar, n);
cout << dp[0] << endl;
return 0;
}
|
// Om Sree Sai Ram
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
using namespace std;
vector<int> dp;
int dfs(int i, int ar[], int n) {
if (dp[i] != INT_MAX) {
return dp[i];
}
if (i == n - 1) {
return 0;
}
if (i + 1 < n) {
int tmp = abs(ar[i + 1] - ar[i]) + dfs(i + 1, ar, n);
dp[i] = min(dp[i], tmp);
}
if (i + 2 < n) {
int tmp = abs(ar[i + 2] - ar[i]) + dfs(i + 2, ar, n);
dp[i] = min(dp[i], tmp);
}
return dp[i];
}
int main() {
// cout<<" Hello world"<<endl;
int n;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
}
dp.assign(n, INT_MAX);
dfs(0, ar, n);
cout << dp[0] << endl;
return 0;
}
|
delete
| 26 | 31 | 26 | 26 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> h(100000 + 100, -1);
vector<ll> dp(100000 + 100, -1);
ll calc(ll i) {
if (i == 1)
return 0;
if (i == 2)
return abs(h[1] - h[2]);
if (dp[i] != -1)
return dp[i];
return min(calc(i - 1) + abs(h[i] - h[i - 1]),
calc(i - 2) + abs(h[i] - h[i - 2]));
}
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; ++i) {
cin >> h[i];
}
cout << calc(n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> h(100000 + 100, -1);
vector<ll> dp(100000 + 100, -1);
ll calc(ll i) {
if (i == 1)
return 0;
if (i == 2)
return abs(h[1] - h[2]);
if (dp[i] != -1)
return dp[i];
dp[i] = min(calc(i - 1) + abs(h[i] - h[i - 1]),
calc(i - 2) + abs(h[i] - h[i - 2]));
return dp[i];
}
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; ++i) {
cin >> h[i];
}
cout << calc(n) << endl;
return 0;
}
|
replace
| 14 | 16 | 14 | 17 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int a[1005], f[1005], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[0] = 0;
f[1] = 0;
f[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
f[i] =
min(abs(a[i] - a[i - 1]) + f[i - 1], abs(a[i] - a[i - 2]) + f[i - 2]);
cout << f[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005], f[10005], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
f[0] = 0;
f[1] = 0;
f[2] = abs(a[2] - a[1]);
for (int i = 3; i <= n; i++)
f[i] =
min(abs(a[i] - a[i - 1]) + f[i - 1], abs(a[i] - a[i - 2]) + f[i - 2]);
cout << f[n];
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
// Includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
// Defines
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
#define mem(name, value) memset(name, value, sizeof(name))
#define f(i, a) for (int i = 0; i < a; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
typedef vector<string> vs;
int arr[100005], dp[100005];
int n;
int calc(int i) {
if (i == n - 2)
return std::abs(arr[n - 2] - arr[n - 1]);
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
int ans1 = std::abs(arr[i] - arr[i + 1]) + calc(i + 1);
int ans2 = std::abs(arr[i] - arr[i + 2]) + calc(i + 2);
return dp[i] = min(ans1, ans2);
}
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);
cin >> n;
f(i, n) { cin >> arr[i]; }
mem(dp, -1);
cout << calc(0) << "\n";
return 0;
}
|
// Includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
// Defines
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define MOD 1000000007
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
#define mem(name, value) memset(name, value, sizeof(name))
#define f(i, a) for (int i = 0; i < a; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef vector<vll> vvll;
typedef vector<string> vs;
int arr[100005], dp[100005];
int n;
int calc(int i) {
if (i == n - 2)
return std::abs(arr[n - 2] - arr[n - 1]);
if (i == n - 1)
return 0;
if (dp[i] != -1)
return dp[i];
int ans1 = std::abs(arr[i] - arr[i + 1]) + calc(i + 1);
int ans2 = std::abs(arr[i] - arr[i + 2]) + calc(i + 2);
return dp[i] = min(ans1, ans2);
}
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);
cin >> n;
f(i, n) { cin >> arr[i]; }
mem(dp, -1);
cout << calc(0) << "\n";
return 0;
}
|
replace
| 69 | 73 | 69 | 73 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <stdio.h>
#include <stdlib.h>
#define MAX 2147483647
int h[100000];
int dp[100000];
void chmin(int *a, int b) {
if (*a > b) {
*a = b;
}
}
int rec(int i) {
if (dp[i] != MAX) {
return dp[i];
}
if (i == 0) {
return 0;
}
int res = MAX;
chmin(&res, rec(i - 1) + abs(h[i - 1] - h[i]));
if (i > 1) {
chmin(&res, rec(i - 2) + abs(h[i - 2] - h[i]));
}
return res;
}
/*
int rec(int i){
if(i==0){
return 0;
}
int res = MAX;
chmin(&res,rec(i-1)+abs(h[i-1]-h[i]));
if(i>1){
chmin(&res,rec(i-2)+abs(h[i-2]-h[i]));
}
return res;
}*/
int main(void) {
// Your code here!
int N;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &h[i]);
dp[i] = MAX;
}
printf("%d\n", rec(N - 1));
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#define MAX 2147483647
int h[100000];
int dp[100000];
void chmin(int *a, int b) {
if (*a > b) {
*a = b;
}
}
int rec(int i) {
if (dp[i] != MAX) {
return dp[i];
}
if (i == 0) {
return 0;
}
int res = MAX;
chmin(&res, rec(i - 1) + abs(h[i - 1] - h[i]));
if (i > 1) {
chmin(&res, rec(i - 2) + abs(h[i - 2] - h[i]));
}
return dp[i] = res;
}
/*
int rec(int i){
if(i==0){
return 0;
}
int res = MAX;
chmin(&res,rec(i-1)+abs(h[i-1]-h[i]));
if(i>1){
chmin(&res,rec(i-2)+abs(h[i-2]-h[i]));
}
return res;
}*/
int main(void) {
// Your code here!
int N;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &h[i]);
dp[i] = MAX;
}
printf("%d\n", rec(N - 1));
return 0;
}
|
replace
| 27 | 28 | 27 | 28 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int n;
vector<int> h(10010);
vector<long long> dp(100010);
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int n;
vector<int> h(100010);
vector<long long> dp(100010);
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]));
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]));
}
cout << dp[n - 1] << endl;
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define fi first`
#define se second
void solve() {
ll n;
cin >> n;
std::vector<ll> v(n), ans(n);
for (auto &i : v)
cin >> i;
ans[1] = abs(v[1] - v[0]);
// ans[2]=min(ans[0]+abs(v[2]-v[1]),abs(v[2]-v[0]));
for (int i = 2; i < n; i++)
ans[i] = min(ans[i - 1] + abs(v[i] - v[i - 1]),
ans[i - 2] + abs(v[i] - v[i - 2]));
cout << ans[n - 1];
}
int 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
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
// cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define fi first`
#define se second
void solve() {
ll n;
cin >> n;
std::vector<ll> v(n), ans(n);
for (auto &i : v)
cin >> i;
ans[1] = abs(v[1] - v[0]);
// ans[2]=min(ans[0]+abs(v[2]-v[1]),abs(v[2]-v[0]));
for (int i = 2; i < n; i++)
ans[i] = min(ans[i - 1] + abs(v[i] - v[i - 1]),
ans[i - 2] + abs(v[i] - v[i - 2]));
cout << ans[n - 1];
}
int 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
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
// cout << endl;
}
}
|
replace
| 23 | 29 | 23 | 29 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Runtime Error
|
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define testcase(t) \
int t; \
cin >> t; \
for (int testcnt = 1; testcnt <= t; testcnt++)
#define int long long
#define double long double
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define eb emplace_back
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int nod(int n) {
string s = to_string(n);
return (int)s.length();
}
int sod(int n) {
int ans = 0;
while (n)
ans += (n % 10), n /= 10;
return ans;
}
int modexpo(int x, int y, int p) {
int res = 1;
x %= p;
while (y) {
if (y & 1)
res *= x, res %= p;
x *= x, x %= p;
y >>= 1;
}
return res;
}
int h[10005];
int dp[10005];
int32_t main() {
IOS int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
dp[0] = 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];
}
|
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define testcase(t) \
int t; \
cin >> t; \
for (int testcnt = 1; testcnt <= t; testcnt++)
#define int long long
#define double long double
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
#define endl "\n"
#define pb push_back
#define eb emplace_back
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int nod(int n) {
string s = to_string(n);
return (int)s.length();
}
int sod(int n) {
int ans = 0;
while (n)
ans += (n % 10), n /= 10;
return ans;
}
int modexpo(int x, int y, int p) {
int res = 1;
x %= p;
while (y) {
if (y & 1)
res *= x, res %= p;
x *= x, x %= p;
y >>= 1;
}
return res;
}
int h[100005];
int dp[100005];
int32_t main() {
IOS int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
dp[0] = 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];
}
|
replace
| 43 | 45 | 43 | 45 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> costs(n);
for (int i = 0; i < n; ++i) {
cin >> costs[i];
}
vector<int> dp(n);
for (int i = 0; i < n; ++i) {
if (i == 0)
dp[0] = 0;
else if (i == 1) {
dp[1] = abs(costs[0] - costs[1]);
} else {
int step_1 = dp[i - 1] + abs(costs[i - 1] - costs[i]);
int step_2 = dp[i - 2] + abs(costs[i - 2] - costs[i]);
dp[i] = min(step_1, step_2);
}
// cout << dp[i] << endl;
}
cout << dp.back() << endl;
return dp.back();
}
|
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> costs(n);
for (int i = 0; i < n; ++i) {
cin >> costs[i];
}
vector<int> dp(n);
for (int i = 0; i < n; ++i) {
if (i == 0)
dp[0] = 0;
else if (i == 1) {
dp[1] = abs(costs[0] - costs[1]);
} else {
int step_1 = dp[i - 1] + abs(costs[i - 1] - costs[i]);
int step_2 = dp[i - 2] + abs(costs[i - 2] - costs[i]);
dp[i] = min(step_1, step_2);
}
// cout << dp[i] << endl;
}
cout << dp.back() << endl;
return 0;
}
|
replace
| 29 | 30 | 29 | 30 |
30
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define L "\n"
#define S " "
#define ll long long
#define pb push_back
#define mp make_pair
#define vi std::vector<int>
#define si std::set<int>
#define vl std::vector<long long>
#define qi std::queue<int>
#define de(a) cout << #a << " ------> " << a << "\n"
#define SIZE 100002
#define INF INT_MAX
#define FOR(i, n) for (i = 1; i <= n; i++)
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
int dp[SIZE], N, h[SIZE];
bool flag[SIZE];
int findcost(int i) {
int cost1, cost2;
if (i == N)
return 0;
else if (i == N - 1) {
dp[i] = abs(h[N] - h[N - 1]);
flag[i] = 1;
return dp[i];
}
if (flag[i + 1])
cost1 = abs(h[i] - h[i + 1]) + dp[i + 1];
else
cost1 = abs(h[i] - h[i + 1]) + findcost(i + 1);
if (flag[i + 2])
cost2 = abs(h[i] - h[i + 2]) + dp[i + 2];
else
cost2 = abs(h[i] - h[i + 2]) + findcost(i + 2);
return dp[i] = min(cost1, cost2);
}
void solve() {
int i;
cin >> N;
FOR(i, N)
cin >> h[i];
int cost = findcost(1);
cout << cost << L;
}
int main() {
FASTIO;
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// #endif
int t;
// cin >> t;
// while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define L "\n"
#define S " "
#define ll long long
#define pb push_back
#define mp make_pair
#define vi std::vector<int>
#define si std::set<int>
#define vl std::vector<long long>
#define qi std::queue<int>
#define de(a) cout << #a << " ------> " << a << "\n"
#define SIZE 100002
#define INF INT_MAX
#define FOR(i, n) for (i = 1; i <= n; i++)
#define FASTIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
int dp[SIZE], N, h[SIZE];
bool flag[SIZE];
int findcost(int i) {
int cost1, cost2;
if (i == N)
return 0;
else if (i == N - 1) {
dp[i] = abs(h[N] - h[N - 1]);
flag[i] = 1;
return dp[i];
}
if (flag[i + 1])
cost1 = abs(h[i] - h[i + 1]) + dp[i + 1];
else
cost1 = abs(h[i] - h[i + 1]) + findcost(i + 1);
if (flag[i + 2])
cost2 = abs(h[i] - h[i + 2]) + dp[i + 2];
else
cost2 = abs(h[i] - h[i + 2]) + findcost(i + 2);
flag[i] = 1;
return dp[i] = min(cost1, cost2);
}
void solve() {
int i;
cin >> N;
FOR(i, N)
cin >> h[i];
int cost = findcost(1);
cout << cost << L;
}
int main() {
FASTIO;
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// #endif
int t;
// cin >> t;
// while (t--)
solve();
return 0;
}
|
insert
| 40 | 40 | 40 | 41 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
void solve() {
ll n;
cin >> n;
vll heights(n);
loop(i, 0, n) cin >> heights[i];
vll dp(n + 1, 0);
loop(i, 1, n) {
if (i == 1) { // because for reaching i=1 there is only one option i.e. from
// 0 to 1.
dp[1] = abs(heights[1] - heights[0]);
continue;
}
ll option1 =
dp[i - 1] + abs(heights[i - 1] - heights[i]); // jump from i to i+1
ll option2 =
dp[i - 2] + abs(heights[i] - heights[i - 2]); // jump from i to i+2
dp[i] = min(option1, option2);
}
cout << dp[n - 1] << endl;
return;
}
int main() {
fastIO;
take_fileIO();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long int
#define mod 1000000007
#define w(t) \
int t; \
cin >> t while (t--)
#define vi vector<int>
#define vll vector<ll>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define fastIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define loop(i, k, n) for (ll i = k; i < n; i += 1)
void take_fileIO() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return;
}
void solve() {
ll n;
cin >> n;
vll heights(n);
loop(i, 0, n) cin >> heights[i];
vll dp(n + 1, 0);
loop(i, 1, n) {
if (i == 1) { // because for reaching i=1 there is only one option i.e. from
// 0 to 1.
dp[1] = abs(heights[1] - heights[0]);
continue;
}
ll option1 =
dp[i - 1] + abs(heights[i - 1] - heights[i]); // jump from i to i+1
ll option2 =
dp[i - 2] + abs(heights[i] - heights[i - 2]); // jump from i to i+2
dp[i] = min(option1, option2);
}
cout << dp[n - 1] << endl;
return;
}
int main() {
fastIO;
// take_fileIO();
solve();
return 0;
}
|
replace
| 58 | 59 | 58 | 59 |
-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;
int min(int a, int b) { return (a < b) ? a : b; }
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 1]) + dp[i - 1], abs(v[i] - v[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
return 1;
}
|
#include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return (a < b) ? a : b; }
int main() {
int n;
cin >> n;
vector<int> v(n);
for (auto &i : v)
cin >> i;
vector<int> dp(n);
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
dp[i] =
min(abs(v[i] - v[i - 1]) + dp[i - 1], abs(v[i] - v[i - 2]) + dp[i - 2]);
}
cout << dp[n - 1];
}
|
delete
| 27 | 29 | 27 | 27 |
1
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
#define abs(x) ((x) < 0 ? (-(x)) : (x))
#define rep(i, a, m) for ((i) = (a); (i) < (m); ++(i))
#define REP(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.end(), x.begin()
#define sz(x) ((int)x.size())
#define PI 3.14159265
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t, T;
cin >> T;
vl vec(T);
vl A(T, 0);
for (t = 1; t <= T; ++t) {
cin >> vec[t - 1];
}
A[0] = vec[0];
A[1] = abs(vec[0] - vec[1]);
if (T == 2)
return A[1];
A[0] = 0LL;
// A[1] = 0LL;
for (int i = 2; i < T; ++i) {
ll x = A[i - 1] + abs(vec[i] - vec[i - 1]);
ll y = A[i - 2] + abs(vec[i] - vec[i - 2]);
A[i] = min(x, y);
}
cout << A[T - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define max(x, y) ((x) > (y) ? (x) : (y))
#define min(x, y) ((x) < (y) ? (x) : (y))
#define abs(x) ((x) < 0 ? (-(x)) : (x))
#define rep(i, a, m) for ((i) = (a); (i) < (m); ++(i))
#define REP(i, n) for ((i) = 0; (i) < (int)(n); (i)++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define rall(x) x.end(), x.begin()
#define sz(x) ((int)x.size())
#define PI 3.14159265
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t, T;
cin >> T;
vl vec(T);
vl A(T, 0);
for (t = 1; t <= T; ++t) {
cin >> vec[t - 1];
}
A[0] = vec[0];
A[1] = abs(vec[0] - vec[1]);
if (T == 2) {
cout << A[1] << endl;
return 0;
}
A[0] = 0LL;
// A[1] = 0LL;
for (int i = 2; i < T; ++i) {
ll x = A[i - 1] + abs(vec[i] - vec[i - 1]);
ll y = A[i - 2] + abs(vec[i] - vec[i - 2]);
A[i] = min(x, y);
}
cout << A[T - 1] << endl;
return 0;
}
|
replace
| 36 | 38 | 36 | 40 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 29;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
int N;
Graph G;
vector<int> res;
ll h[10010];
ll dp[100100];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
rep(i, N) cin >> h[i];
rep(i, 100100) dp[i] = LLINF;
dp[0] = 0;
rep(i, N) {
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] << endl;
}
|
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP(i, num, n) for (ll i = num, i##_len = (n); i < i##_len; ++i)
#define repprev(i, a, b) for (ll i = b - 1; i >= a; i--)
#define reprev(i, n) repprev(i, 0, n)
using namespace std;
#define sz(x) ((int)(x).size())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MEMSET(v, h) memset((v), h, sizeof(v))
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> int former(const vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin() - 1;
}
template <class T> int latter(const vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
#define pb push_back
#define mp make_pair
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define BIT_FLAG_0 (1 << 0) // 0000 0000 0000 0001
#define BIT_FLAG_1 (1 << 1) // 0000 0000 0000 0010
#define BIT_FLAG_2 (1 << 2) // 0000 0000 0000 0100
#define BIT_FLAG_3 (1 << 3) // 0000 0000 0000 1000
#define BIT_FLAG_4 (1 << 4) // 0000 0000 0001 0000
#define BIT_FLAG_5 (1 << 5) // 0000 0000 0010 0000
#define BIT_FLAG_6 (1 << 6) // 0000 0000 0100 0000
#define BIT_FLAG_7 (1 << 7) // 0000 0000 1000 0000
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const ll LLINF = 1LL << 60;
const int INTINF = 1 << 29;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(ll n) : par(n, -1) {}
void init(ll n) { par.assign(n, -1); }
ll root(ll x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool issame(ll x, ll y) { return root(x) == root(y); }
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
ll size(ll x) { return -par[root(x)]; }
};
template <typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G) {
const T INF = numeric_limits<T>::max();
using P = pair<T, int>;
int n = G.size();
vector<T> d(n, INF);
vector<int> b(n, -1);
priority_queue<P, vector<P>, greater<P>> q;
d[s] = 0;
q.emplace(d[s], s);
while (!q.empty()) {
P p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto &e : G[v]) {
int u = e.first;
T c = e.second;
if (d[u] > d[v] + c) {
d[u] = d[v] + c;
b[u] = v;
q.emplace(d[u], u);
}
}
}
return d;
}
vector<vector<int>> bfs(vector<string> &s, int sy, int sx, char wall, int dir) {
int h = s.size(), w = s.front().size();
vector<vector<int>> dp(h, vector<int>(w, -1));
using P = pair<int, int>;
queue<P> q;
dp[sy][sx] = 0;
q.emplace(sy, sx);
int dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
auto in = [&](int y, int x) { return 0 <= y && y < h && 0 <= x && x < w; };
while (!q.empty()) {
int y, x;
tie(y, x) = q.front();
q.pop();
for (int k = 0; k < dir; k++) {
int ny = y + dy[k], nx = x + dx[k];
if (!in(ny, nx) || s[ny][nx] == wall)
continue;
if (~dp[ny][nx])
continue;
dp[ny][nx] = dp[y][x] + 1;
q.emplace(ny, nx);
}
}
return dp;
}
std::vector<ll> divisor(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
int N;
Graph G;
vector<int> res;
ll h[100010];
ll dp[100100];
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
ll N;
cin >> N;
rep(i, N) cin >> h[i];
rep(i, 100100) dp[i] = LLINF;
dp[0] = 0;
rep(i, N) {
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] << endl;
}
|
replace
| 190 | 191 | 190 | 191 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[10010], dp[10010];
int main() {
int n;
scanf("%d", &n);
scanf("%d", &a[1]);
scanf("%d", &a[2]);
dp[2] = max(a[1], a[2]) - min(a[1], a[2]);
for (int i = 3; i <= n; i++) {
;
scanf("%d", &a[i]);
dp[i] = min(dp[i - 1] + (max(a[i], a[i - 1]) - min(a[i], a[i - 1])),
dp[i - 2] + (max(a[i], a[i - 2]) - min(a[i], a[i - 2])));
}
printf("%d", dp[n]);
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[100100], dp[100100];
int main() {
int n;
scanf("%d", &n);
scanf("%d", &a[1]);
scanf("%d", &a[2]);
dp[2] = max(a[1], a[2]) - min(a[1], a[2]);
for (int i = 3; i <= n; i++) {
;
scanf("%d", &a[i]);
dp[i] = min(dp[i - 1] + (max(a[i], a[i - 1]) - min(a[i], a[i - 1])),
dp[i - 2] + (max(a[i], a[i - 2]) - min(a[i], a[i - 2])));
}
printf("%d", dp[n]);
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int h[10010];
int dp[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
const int INF = 1 << 29;
for (int i = 0; i < n; i++) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
printf("%d\n", dp[n - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int h[100010];
int dp[100010];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &h[i]);
}
const int INF = 1 << 29;
for (int i = 0; i < n; i++) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
printf("%d\n", dp[n - 1]);
}
|
replace
| 11 | 12 | 11 | 12 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int vals[10005];
int dp[10005];
int f(int n) {
if (n == 0) {
return 0;
}
if (dp[n] != -1) {
return dp[n];
}
int left = INT_MAX;
int right = INT_MAX;
if (n - 1 >= 0) {
left = f(n - 1) + abs(vals[n - 1] - vals[n]);
}
if (n - 2 >= 0) {
right = f(n - 2) + abs(vals[n - 2] - vals[n]);
}
dp[n] = min(left, right);
return dp[n];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> vals[i];
dp[i] = -1;
}
cout << f(n - 1) << endl;
}
|
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
int vals[100005];
int dp[100005];
int f(int n) {
if (n == 0) {
return 0;
}
if (dp[n] != -1) {
return dp[n];
}
int left = INT_MAX;
int right = INT_MAX;
if (n - 1 >= 0) {
left = f(n - 1) + abs(vals[n - 1] - vals[n]);
}
if (n - 2 >= 0) {
right = f(n - 2) + abs(vals[n - 2] - vals[n]);
}
dp[n] = min(left, right);
return dp[n];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> vals[i];
dp[i] = -1;
}
cout << f(n - 1) << endl;
}
|
replace
| 6 | 8 | 6 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007ll
#define vll vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define db(x) cout << #x << " = " << x << '\n'
#define sep cout << "********************************************\n"
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL)
ll n, a[100005], ans[100005];
int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; ++i) {
ans[i] = min(abs(a[i] - a[i - 1]) + ans[i - 1],
abs(a[i] - a[i - 2]) + ans[i - 2]);
}
cout << ans[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007ll
#define vll vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define db(x) cout << #x << " = " << x << '\n'
#define sep cout << "********************************************\n"
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL)
ll n, a[100005], ans[100005];
int main(int argc, char const *argv[]) {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
fast;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ans[0] = 0;
ans[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; ++i) {
ans[i] = min(abs(a[i] - a[i - 1]) + ans[i - 1],
abs(a[i] - a[i - 2]) + ans[i - 2]);
}
cout << ans[n - 1];
return 0;
}
|
replace
| 16 | 20 | 16 | 20 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int rec(int i, const vector<int> &h, vector<int> *memo) {
if (i == 1)
return 0;
if (i == 2)
return abs(h[i - 1] - h[i - 2]);
if ((*memo)[i] != -1)
return (*memo)[i];
int cost1 = abs(h[i - 1] - h[i - 2]);
int cost2 = abs(h[i - 1] - h[i - 3]);
return min(rec(i - 1, h, memo) + cost1, rec(i - 2, h, memo) + cost2);
}
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
vector<int> memo(N + 1, -1);
cout << rec(N, h, &memo) << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int rec(int i, const vector<int> &h, vector<int> *memo) {
if (i == 1)
return 0;
if (i == 2)
return abs(h[i - 1] - h[i - 2]);
if ((*memo)[i] != -1)
return (*memo)[i];
int cost1 = abs(h[i - 1] - h[i - 2]);
int cost2 = abs(h[i - 1] - h[i - 3]);
return (*memo)[i] =
min(rec(i - 1, h, memo) + cost1, rec(i - 2, h, memo) + cost2);
}
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
vector<int> memo(N + 1, -1);
cout << rec(N, h, &memo) << endl;
}
|
replace
| 18 | 19 | 18 | 20 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx];
vector<int> peso;
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < n; i++) {
cin >> n;
peso.push_back(n);
}
dp[0] = 0;
dp[1] = dp[0] + abs(peso[0] - peso[1]);
for (int i = 2; i < x; i++)
dp[i] = min(dp[i - 1] + abs(peso[i - 1] - peso[i]),
dp[i - 2] + abs(peso[i - 2] - peso[i]));
cout << dp[x - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define maxx 100010
#define mp make_pair
typedef pair<int, int> ii;
int dp[maxx];
vector<int> peso;
int x;
int main() {
cin >> x;
int n;
for (int i = 0; i < x; i++) {
cin >> n;
peso.push_back(n);
}
dp[0] = 0;
dp[1] = dp[0] + abs(peso[0] - peso[1]);
for (int i = 2; i < x; i++)
dp[i] = min(dp[i - 1] + abs(peso[i - 1] - peso[i]),
dp[i - 2] + abs(peso[i - 2] - peso[i]));
cout << dp[x - 1] << endl;
return 0;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h;
int elem;
vector<int> dp(10000 + 7);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> elem;
h.push_back(elem);
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int j2 = dp[i - 2] + (abs(h[i] - h[i - 2]));
int j1 = dp[i - 1] + (abs(h[i] - h[i - 1]));
dp[i] = min(j2, j1);
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> h;
int elem;
vector<int> dp(100000 + 7);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> elem;
h.push_back(elem);
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
int j2 = dp[i - 2] + (abs(h[i] - h[i - 2]));
int j1 = dp[i - 1] + (abs(h[i] - h[i - 1]));
dp[i] = min(j2, j1);
}
cout << dp[n - 1];
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 10000
int main() {
int n;
cin >> n;
int f[MAX] = {}, h[MAX] = {};
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
h[0] = 0;
f[1] = 0;
f[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
f[i] =
min(f[i - 1] + abs(h[i - 1] - h[i]), f[i - 2] + abs(h[i - 2] - h[i]));
}
cout << f[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int main() {
int n;
cin >> n;
int f[MAX] = {}, h[MAX] = {};
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
h[0] = 0;
f[1] = 0;
f[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
f[i] =
min(f[i - 1] + abs(h[i - 1] - h[i]), f[i - 2] + abs(h[i - 2] - h[i]));
}
cout << f[n] << endl;
return 0;
}
|
replace
| 2 | 3 | 2 | 3 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), dp(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (n == 1)
return 0;
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i)
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
return dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), dp(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (n == 1)
return 0;
dp[0] = 0, dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; ++i)
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
cout << dp[n - 1] << "\n";
return 0;
}
|
replace
| 16 | 17 | 16 | 18 |
30
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
string s;
int main() {
int a[10000];
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int dp[n + 1];
dp[0] = 0;
dp[1] = dp[0] + abs(a[0] - a[1]);
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[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#include <algorithm>
#include <iostream>
#include <iterator>
using namespace std;
string s;
int main() {
int a[100000];
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int dp[n + 1];
dp[0] = 0;
dp[1] = dp[0] + abs(a[0] - a[1]);
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[n - 1];
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
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
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] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
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
*/
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] << "\n";
}
|
replace
| 7 | 13 | 7 | 13 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7, N = 1e5 + 10;
int n, h[N], dp[N];
int dfs(int i) {
if (i > n)
return 1e9;
if (i == n)
return 0;
int &ans = dp[i];
if (ans != -1)
return ans;
return ans = min(dfs(i + 2) + abs(h[i + 2] - h[i]),
dfs(i + 1) + abs(h[i + 1] - h[i]));
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> n;
f(i, 1, n + 1) { cin >> h[i]; }
h[n + 2] = h[n + 1] = 1e9;
f(i, 0, n + 10) dp[i] = -1;
cout << dfs(1) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7, N = 1e5 + 10;
int n, h[N], dp[N];
int dfs(int i) {
if (i > n)
return 1e9;
if (i == n)
return 0;
int &ans = dp[i];
if (ans != -1)
return ans;
return ans = min(dfs(i + 2) + abs(h[i + 2] - h[i]),
dfs(i + 1) + abs(h[i + 1] - h[i]));
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
cin >> n;
f(i, 1, n + 1) { cin >> h[i]; }
h[n + 2] = h[n + 1] = 1e9;
f(i, 0, n + 10) dp[i] = -1;
cout << dfs(1) << '\n';
return 0;
}
|
replace
| 31 | 35 | 31 | 35 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ARRAY_LENGTH (10010)
// Infinity value
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
int main(void) {
int N;
long long H[ARRAY_LENGTH];
long long dp[ARRAY_LENGTH];
std::cin >> N;
// Input costs
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
// Initialize DP
for (int i = 0; i < ARRAY_LENGTH; i++) {
dp[i] = INF;
}
// Initial condition
dp[0] = 0;
// Loop
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]));
}
}
std::cout << dp[N - 1] << std::endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define ARRAY_LENGTH (100010)
// Infinity value
const long long INF = 1LL << 60;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
int main(void) {
int N;
long long H[ARRAY_LENGTH];
long long dp[ARRAY_LENGTH];
std::cin >> N;
// Input costs
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
// Initialize DP
for (int i = 0; i < ARRAY_LENGTH; i++) {
dp[i] = INF;
}
// Initial condition
dp[0] = 0;
// Loop
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]));
}
}
std::cout << dp[N - 1] << std::endl;
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <cmath>
#include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N;
int H[10010];
int main() {
cin >> N;
for (int i = 0; i < N; ++i)
cin >> H[i];
long long dp[100010];
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < N; ++i) {
dp[i] = min(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 - 1] << endl;
return 0;
}
|
#include <cmath>
#include <iostream>
using namespace std;
const long long INF = 1LL << 60;
int N;
int H[100010];
int main() {
cin >> N;
for (int i = 0; i < N; ++i)
cin >> H[i];
long long dp[100010];
for (int i = 0; i < 100010; ++i)
dp[i] = INF;
dp[0] = 0;
for (int i = 1; i < N; ++i) {
dp[i] = min(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 - 1] << endl;
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
// Vaidik Patel(India)
// DA-IICT
#include <bits/stdc++.h>
using namespace std;
//********************************************
#include <ext/pb_ds/assoc_container.hpp> // include the associative containers or group of templates such as set, multimap, map etc.
#include <ext/pb_ds/tree_policy.hpp> // include the tree_order_statistics_node update
using namespace __gnu_pbds; // necessary for the GNU based Policy based data
// structures.
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//********************************************
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
int INF = (int)1e9;
ll INFINF = (ll)1e18 + 10;
const ld PI = 3.14159265358979323846;
#define precision(x, d) cout << fixed << setprecision(d) << x
#define minheap priority_queue<ll, vector<ll>, greater<ll>>
#define maxheap priority_queue<ll, vector<ll>, less<ll>>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rFOR(i, a, b) for (ll i = a; i >= b; i--)
#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;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define checkbit(n, b) ((n >> b) & 1)
#define mkp make_pair
#define ff first
#define ss second
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define TIME \
cerr << "Time Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
#define lc 2 * idx
#define rc 2 * idx + 1
ll powermodm(ll x, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = (x * x) % mod;
n = n / 2;
}
return result;
}
ll GCD(ll, ll);
ll LCM(ll, ll);
ll power(ll, ll);
ll choose(ll, ll);
int ones(ll);
void extendedEuclid(ll, ll);
ll MMI(ll, ll);
void fastscan(int &);
bool checkithbit(ll, ll); // ith bit is zero or not
vector<ll> SegmentTree;
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l, ll r);
ll sum(ll idx, ll sl, ll sr, ll l, ll r);
void update(ll idx, ll sl, ll sr, ll value, ll id);
vector<ll> prime;
void findprime(void);
ll phi(ll num);
vector<int> isprime;
void precomputeprime(int N);
vector<int> prephi;
void precomputephi(int N);
int read();
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
#define pb push_back
#define M 1000000007
//////////////////////////////////////////////////////////////////////////////
int main() {
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vll a(n);
vll dp(n, 1e18);
FOR(i, 0, n) { cin >> a[i]; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
FOR(i, 2, n) {
ll x1 = dp[i - 2] + abs(a[i - 2] - a[i]);
ll x2 = dp[i - 1] + abs(a[i - 1] - a[i]);
dp[i] = min(dp[i], min(x1, x2));
}
cout << dp[n - 1] << "\n";
return 0;
}
//////////////////////////////////////////////////////////////////////////
// precomputephi()
void precomputephi(int N) {
prephi.resize(N);
FOR(i, 0, N) { prephi[i] = i; }
for (int i = 1; i < N; i++) {
if (isprime[i]) {
for (int j = i; j < N; j += i) {
prephi[j] = prephi[j] - (prephi[j] / i);
}
}
}
}
// precomputedprime()
void precomputeprime(int N) {
isprime.resize(N);
isprime.assign(N, 1);
isprime[0] = 0;
isprime[1] = 0;
for (int i = 2; i * i <= 500005; i++) {
if (isprime[i]) {
for (int j = i * i; j <= 500005; j += i) {
isprime[j] = 0;
}
}
}
}
//"""euler totient function""": counts the number of integers between 1 and n
//inclusive, which are coprime to n.
ll phi(ll num) // find using factorization in O(sqrt(N)).....
{
ll result = num;
for (ll i = 2; i * i <= num; i++) {
if (num % i == 0) {
while (num % i == 0) {
num /= i;
}
result -= (result / i);
}
}
if (num > 1) {
result -= (result / num);
}
return result;
}
void findprime(void) {
int N = 1e6 + 5;
vector<bool> isprime(N, 1); // up to 1e6+5 number
for (int i = 2; i * i <= N; i++) {
if (isprime[i]) {
for (int j = i * i; j <= N; j += i) {
if (isprime[j]) {
isprime[j] = 0;
}
}
}
}
for (int i = 2; i <= N; i++) {
if (isprime[i]) {
prime.pb(i);
}
}
}
bool checkithbit(ll a, ll i) {
if (a & (1 << i)) {
return true;
} else {
return false;
}
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return (max(a, b) / GCD(a, b)) * min(a, b); }
ll power(ll a, ll n) {
unsigned long long int result = 1, x = a;
while (n > 0) {
if (n % 2 == 1)
result = result * x;
x = x * x;
n = n / 2;
}
return result;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
int ones(ll n) {
int c = 0;
while (n) {
n = n & (n - 1);
c++;
}
return c;
}
// store gcd of a,b in d
// store solution of a*x + b*y = d in x,y
// if gcd(a,b)=1 then x = a^(-1)(mod b) and y = b^(-1)(mod a)
ll d, x, y;
void extendedEuclid(ll A, ll B) {
if (B == 0) {
d = A;
x = 1;
y = 0;
} else {
extendedEuclid(B, A % B);
int temp = x;
x = y;
y = temp - (A / B) * y;
}
}
// return modulo inverse of a wrt modulo p(should be prime)
// retunt -1 if modulo inverse does not exist
ll MMI(ll a, ll p) {
extendedEuclid(a, p);
if (d == 1 && p != 1)
return ((x % p) + p) % p;
else
return -1;
}
// Fastest way to read Input
void fastscan(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
if (negative)
number *= -1;
}
inline int read() {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar();
if (c == '-')
t = -1, c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 + c - '0', c = getchar();
return ret * t;
}
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l,
ll r) // where l and r is query range.
{
if (l == r) {
SegmentTree[idx] = a[l];
} else {
ll mid = (l + r) / 2ll;
Build_Segment_Tree(a, (2ll * idx), l, mid);
Build_Segment_Tree(a, (2ll * idx) + 1, mid + 1, r);
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
ll sum(ll idx, ll sl, ll sr, ll l,
ll r) // here [sl...sr] segment range associate at idx index. where l and
// r is query range.
{
if (l > r) {
return 0;
}
if (sl == l && sr == r) {
return SegmentTree[idx];
}
ll mid = (sl + sr) / 2;
return sum(2ll * idx, sl, mid, l, min(r, mid)) +
sum(2ll * idx + 1, mid + 1, sr, max(mid + 1, l), r);
}
void update(ll idx, ll sl, ll sr, ll value, ll id) {
if (sl == sr && sl == id) {
SegmentTree[idx] = value;
} else {
ll mid = (sl + sr) / 2ll;
if (id <= mid) {
update(2ll * idx, sl, mid, value, id);
} else {
update(2ll * idx + 1, mid + 1, sr, value, id);
}
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
/*
note:
//a.resize(unique(a.begin(), a.end()) - a.begin()); use for create array unique
element...
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(g1.begin(), g1.end(), rng);(g1 is array name) for choose random number
//int grand(int x) {
return uniform_int_distribution<int>(0, x - 1)(rng);
}
//use once(num) give no of 1 in its binary form
//use give (int)log2(num)+1 give no of digits in its binary form
//bitset<64>(num).to_string() convert decimal to num64 bit binary number
//stoull(str, nullptr, 2) convert str in binary form to decimal number
// "max" priority queue: priority_queue<ll, vector<ll>, less<ll> >pq; #select
max element as top()#
// "min" priority queue: priority_queue<ll, vector<ll>, greater< ll> >pq;
#select min element as top()#
//set<int> inbuit sort accending order (set<int,less<int>>)
//set<int,greater<int>> sort element in decreasing order
// int __builtin_popcount(unsigned int)
--->It returns the numbers of set bits in an integer (the number of ones in the
binary representation of the integer).
///for finding xnor from xor
x1=Xor
x2=Xnor
ll x1=a ^ b;
ll num=max(a,b);
ll xx=log2(num)+ 1; (length of num in binary form)
****ll t=(1 << xx) - 1; (set all xx length bits to 1)
ll x2=x1 ^ t; (get xnor via xor using t)
--->Dilworth's theorem:-
this theorem says that the minimum number of non-decreasing sequences we
need to cover the whole sequence equals the length of least decreasing
subsequence.
----->a + b = (a xor b) +( 2 * (a & b)); ///very imp
*/
|
// Vaidik Patel(India)
// DA-IICT
#include <bits/stdc++.h>
using namespace std;
//********************************************
#include <ext/pb_ds/assoc_container.hpp> // include the associative containers or group of templates such as set, multimap, map etc.
#include <ext/pb_ds/tree_policy.hpp> // include the tree_order_statistics_node update
using namespace __gnu_pbds; // necessary for the GNU based Policy based data
// structures.
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//********************************************
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
int INF = (int)1e9;
ll INFINF = (ll)1e18 + 10;
const ld PI = 3.14159265358979323846;
#define precision(x, d) cout << fixed << setprecision(d) << x
#define minheap priority_queue<ll, vector<ll>, greater<ll>>
#define maxheap priority_queue<ll, vector<ll>, less<ll>>
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rFOR(i, a, b) for (ll i = a; i >= b; i--)
#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;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define checkbit(n, b) ((n >> b) & 1)
#define mkp make_pair
#define ff first
#define ss second
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define TIME \
cerr << "Time Elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
#define lc 2 * idx
#define rc 2 * idx + 1
ll powermodm(ll x, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = (x * x) % mod;
n = n / 2;
}
return result;
}
ll GCD(ll, ll);
ll LCM(ll, ll);
ll power(ll, ll);
ll choose(ll, ll);
int ones(ll);
void extendedEuclid(ll, ll);
ll MMI(ll, ll);
void fastscan(int &);
bool checkithbit(ll, ll); // ith bit is zero or not
vector<ll> SegmentTree;
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l, ll r);
ll sum(ll idx, ll sl, ll sr, ll l, ll r);
void update(ll idx, ll sl, ll sr, ll value, ll id);
vector<ll> prime;
void findprime(void);
ll phi(ll num);
vector<int> isprime;
void precomputeprime(int N);
vector<int> prephi;
void precomputephi(int N);
int read();
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
#define pb push_back
#define M 1000000007
//////////////////////////////////////////////////////////////////////////////
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
vll a(n);
vll dp(n, 1e18);
FOR(i, 0, n) { cin >> a[i]; }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
FOR(i, 2, n) {
ll x1 = dp[i - 2] + abs(a[i - 2] - a[i]);
ll x2 = dp[i - 1] + abs(a[i - 1] - a[i]);
dp[i] = min(dp[i], min(x1, x2));
}
cout << dp[n - 1] << "\n";
return 0;
}
//////////////////////////////////////////////////////////////////////////
// precomputephi()
void precomputephi(int N) {
prephi.resize(N);
FOR(i, 0, N) { prephi[i] = i; }
for (int i = 1; i < N; i++) {
if (isprime[i]) {
for (int j = i; j < N; j += i) {
prephi[j] = prephi[j] - (prephi[j] / i);
}
}
}
}
// precomputedprime()
void precomputeprime(int N) {
isprime.resize(N);
isprime.assign(N, 1);
isprime[0] = 0;
isprime[1] = 0;
for (int i = 2; i * i <= 500005; i++) {
if (isprime[i]) {
for (int j = i * i; j <= 500005; j += i) {
isprime[j] = 0;
}
}
}
}
//"""euler totient function""": counts the number of integers between 1 and n
//inclusive, which are coprime to n.
ll phi(ll num) // find using factorization in O(sqrt(N)).....
{
ll result = num;
for (ll i = 2; i * i <= num; i++) {
if (num % i == 0) {
while (num % i == 0) {
num /= i;
}
result -= (result / i);
}
}
if (num > 1) {
result -= (result / num);
}
return result;
}
void findprime(void) {
int N = 1e6 + 5;
vector<bool> isprime(N, 1); // up to 1e6+5 number
for (int i = 2; i * i <= N; i++) {
if (isprime[i]) {
for (int j = i * i; j <= N; j += i) {
if (isprime[j]) {
isprime[j] = 0;
}
}
}
}
for (int i = 2; i <= N; i++) {
if (isprime[i]) {
prime.pb(i);
}
}
}
bool checkithbit(ll a, ll i) {
if (a & (1 << i)) {
return true;
} else {
return false;
}
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
ll LCM(ll a, ll b) { return (max(a, b) / GCD(a, b)) * min(a, b); }
ll power(ll a, ll n) {
unsigned long long int result = 1, x = a;
while (n > 0) {
if (n % 2 == 1)
result = result * x;
x = x * x;
n = n / 2;
}
return result;
}
ll choose(ll n, ll k) {
if (k == 0)
return 1;
return (n * choose(n - 1, k - 1)) / k;
}
int ones(ll n) {
int c = 0;
while (n) {
n = n & (n - 1);
c++;
}
return c;
}
// store gcd of a,b in d
// store solution of a*x + b*y = d in x,y
// if gcd(a,b)=1 then x = a^(-1)(mod b) and y = b^(-1)(mod a)
ll d, x, y;
void extendedEuclid(ll A, ll B) {
if (B == 0) {
d = A;
x = 1;
y = 0;
} else {
extendedEuclid(B, A % B);
int temp = x;
x = y;
y = temp - (A / B) * y;
}
}
// return modulo inverse of a wrt modulo p(should be prime)
// retunt -1 if modulo inverse does not exist
ll MMI(ll a, ll p) {
extendedEuclid(a, p);
if (d == 1 && p != 1)
return ((x % p) + p) % p;
else
return -1;
}
// Fastest way to read Input
void fastscan(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
if (negative)
number *= -1;
}
inline int read() {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-')
c = getchar();
if (c == '-')
t = -1, c = getchar();
while (c >= '0' && c <= '9')
ret = ret * 10 + c - '0', c = getchar();
return ret * t;
}
void Build_Segment_Tree(vector<ll> &a, ll idx, ll l,
ll r) // where l and r is query range.
{
if (l == r) {
SegmentTree[idx] = a[l];
} else {
ll mid = (l + r) / 2ll;
Build_Segment_Tree(a, (2ll * idx), l, mid);
Build_Segment_Tree(a, (2ll * idx) + 1, mid + 1, r);
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
ll sum(ll idx, ll sl, ll sr, ll l,
ll r) // here [sl...sr] segment range associate at idx index. where l and
// r is query range.
{
if (l > r) {
return 0;
}
if (sl == l && sr == r) {
return SegmentTree[idx];
}
ll mid = (sl + sr) / 2;
return sum(2ll * idx, sl, mid, l, min(r, mid)) +
sum(2ll * idx + 1, mid + 1, sr, max(mid + 1, l), r);
}
void update(ll idx, ll sl, ll sr, ll value, ll id) {
if (sl == sr && sl == id) {
SegmentTree[idx] = value;
} else {
ll mid = (sl + sr) / 2ll;
if (id <= mid) {
update(2ll * idx, sl, mid, value, id);
} else {
update(2ll * idx + 1, mid + 1, sr, value, id);
}
SegmentTree[idx] = SegmentTree[2ll * idx] + SegmentTree[2ll * idx + 1];
}
}
/*
note:
//a.resize(unique(a.begin(), a.end()) - a.begin()); use for create array unique
element...
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(g1.begin(), g1.end(), rng);(g1 is array name) for choose random number
//int grand(int x) {
return uniform_int_distribution<int>(0, x - 1)(rng);
}
//use once(num) give no of 1 in its binary form
//use give (int)log2(num)+1 give no of digits in its binary form
//bitset<64>(num).to_string() convert decimal to num64 bit binary number
//stoull(str, nullptr, 2) convert str in binary form to decimal number
// "max" priority queue: priority_queue<ll, vector<ll>, less<ll> >pq; #select
max element as top()#
// "min" priority queue: priority_queue<ll, vector<ll>, greater< ll> >pq;
#select min element as top()#
//set<int> inbuit sort accending order (set<int,less<int>>)
//set<int,greater<int>> sort element in decreasing order
// int __builtin_popcount(unsigned int)
--->It returns the numbers of set bits in an integer (the number of ones in the
binary representation of the integer).
///for finding xnor from xor
x1=Xor
x2=Xnor
ll x1=a ^ b;
ll num=max(a,b);
ll xx=log2(num)+ 1; (length of num in binary form)
****ll t=(1 << xx) - 1; (set all xx length bits to 1)
ll x2=x1 ^ t; (get xnor via xor using t)
--->Dilworth's theorem:-
this theorem says that the minimum number of non-decreasing sequences we
need to cover the whole sequence equals the length of least decreasing
subsequence.
----->a + b = (a xor b) +( 2 * (a & b)); ///very imp
*/
|
delete
| 99 | 104 | 99 | 99 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#if 1
#define int long long
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define stoi stoll
#else
#define MAX INT_MAX
#define MIN INT_MIN
#endif
#define INF MAX / 2
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second
const int NIL = -1;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
int pow(int x, int n) {
int res = 1;
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
int get_gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
a %= b;
}
}
int get_lcm(int a, int b) { return a * b / get_gcd(a, b); }
bool chmin(int &a, int b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
bool chmax(int &a, int b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
//-------------------------テンプレここまで-------------------------//
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
static int h[10000];
REP(i, N) cin >> h[i];
// dp[i] ... 足場i番目(0-index)にいるときの最小コスト
static int dp[100000];
REP(i, N) dp[i] = INF;
dp[0] = 0;
// 配るdp
REP(i, N - 1) {
// 1つ飛ぶとき
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
// 2つ飛ぶとき
if (i + 2 < N)
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#if 1
#define int long long
#define MAX LLONG_MAX
#define MIN LLONG_MIN
#define stoi stoll
#else
#define MAX INT_MAX
#define MIN INT_MIN
#endif
#define INF MAX / 2
#define ALL(obj) (obj).begin(), (obj).end()
#define fi first
#define se second
const int NIL = -1;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
int pow(int x, int n) {
int res = 1;
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
int get_gcd(int a, int b) {
while (1) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
a %= b;
}
}
int get_lcm(int a, int b) { return a * b / get_gcd(a, b); }
bool chmin(int &a, int b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
bool chmax(int &a, int b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
//-------------------------テンプレここまで-------------------------//
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N;
cin >> N;
static int h[100000];
REP(i, N) cin >> h[i];
// dp[i] ... 足場i番目(0-index)にいるときの最小コスト
static int dp[100000];
REP(i, N) dp[i] = INF;
dp[0] = 0;
// 配るdp
REP(i, N - 1) {
// 1つ飛ぶとき
chmin(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]));
// 2つ飛ぶとき
if (i + 2 < N)
chmin(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]));
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 65 | 66 | 65 | 66 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// rep
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(x) cerr << #x << ": " << x << '\n'
#define DEBUGP(x) cerr << #x << ": " << x.first << " \t" << x.second << '\n'
int n;
VI h(10001);
signed main() {
cin >> n;
REP(i, n) { cin >> h[i]; }
h.resize(n);
VI dp(n, 1000000001);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
FOR(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>
using namespace std;
#define int long long
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
// rep
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(x) cerr << #x << ": " << x << '\n'
#define DEBUGP(x) cerr << #x << ": " << x.first << " \t" << x.second << '\n'
int n;
VI h(100010);
signed main() {
cin >> n;
REP(i, n) { cin >> h[i]; }
h.resize(n);
VI dp(n, 1000000001);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
FOR(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
| 21 | 22 | 21 | 22 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ll long long
#define inf 1e18
#define pi acos(-1.0)
ll n, a[100005], dp[100005];
ll f(int i) {
if (i == n - 1)
return dp[i] = abs(a[n] - a[i]);
if (i == n)
return dp[i] = 0;
if (dp[i] != -1)
return dp[i];
return min(abs(a[i] - a[i + 1]) + f(i + 1), abs(a[i] - a[i + 2]) + f(i + 2));
}
int main() {
fastio;
ll i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << f(1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define ll long long
#define inf 1e18
#define pi acos(-1.0)
ll n, a[100005], dp[100005];
ll f(int i) {
if (i == n - 1)
return dp[i] = abs(a[n] - a[i]);
if (i == n)
return dp[i] = 0;
if (dp[i] != -1)
return dp[i];
return dp[i] = min(abs(a[i] - a[i + 1]) + f(i + 1),
abs(a[i] - a[i + 2]) + f(i + 2));
}
int main() {
fastio;
ll i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
memset(dp, -1, sizeof(dp));
cout << f(1);
return 0;
}
|
replace
| 20 | 21 | 20 | 22 |
TLE
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int a[1000000];
int getans(int i, int n) {
if (i == n) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
int cost = abs(a[i] - a[i + 1]) + getans(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + getans(i + 2, n));
// return cost;
}
return cost;
// return dp[i];
}
int main() {
int n;
cin >> n;
// int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof(dp));
int ans = getans(1, n);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[1000000];
int a[1000000];
int getans(int i, int n) {
if (i == n) {
return 0;
}
if (dp[i] != -1) {
return dp[i];
}
int cost = abs(a[i] - a[i + 1]) + getans(i + 1, n);
if (i + 2 <= n) {
cost = min(cost, abs(a[i] - a[i + 2]) + getans(i + 2, n));
// return cost;
}
return dp[i] = cost;
// return dp[i];
}
int main() {
int n;
cin >> n;
// int a[n];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
memset(dp, -1, sizeof(dp));
int ans = getans(1, n);
cout << ans << endl;
}
|
replace
| 16 | 17 | 16 | 17 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2)
return abs(a[1] - a[0]);
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
vector<int> dp(n, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
cout << abs(a[1] - a[0]);
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++)
dp[i] =
min(abs(a[i] - a[i - 1]) + dp[i - 1], abs(a[i] - a[i - 2]) + dp[i - 2]);
cout << dp[n - 1];
}
|
replace
| 10 | 12 | 10 | 14 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n;
cin >> n;
int h[n + 1];
rep(i, n) cin >> h[i + 1];
int dp[10005];
dp[1] = 0;
dp[0] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; 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] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define SORT(c) sort((c).begin(), (c).end())
#define MOD 1000000007 // S.size() 配列名.Length()
using namespace std;
typedef unsigned long long ll;
int main(void) {
int n;
cin >> n;
int h[n + 1];
rep(i, n) cin >> h[i + 1];
int dp[100000];
dp[1] = 0;
dp[0] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; 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] << endl;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pb push_back
#define mp make_pair
#define INF (int)1e9
#define cBits(x) __builtin_popcount(x)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) a / gcd(a, b) * b
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORr(i, a, b) for (int i = a; i >= b; i--)
#define MAX3(a, b, c) max(a, max(b, c))
#define MIN3(a, b, c) min(a, min(b, c))
#define eachTest \
int t; \
cin >> t; \
while (t--) \
solve();
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
typedef pair<int, int> PII;
const int MOD = 1000000007;
void solve() { ; }
int main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// eachTest
ll n;
cin >> n;
vector<ll> arr(n);
FOR(i, 0, n) { cin >> arr[i]; }
vector<ll> table(n);
table[0] = 0;
table[1] = abs(arr[1] - arr[0]);
FOR(i, 2, n) {
table[i] = min(abs(arr[i] - arr[i - 1]) + table[i - 1],
abs(arr[i] - arr[i - 2]) + table[i - 2]);
}
cout << table[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define pb push_back
#define mp make_pair
#define INF (int)1e9
#define cBits(x) __builtin_popcount(x)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) a / gcd(a, b) * b
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define FORr(i, a, b) for (int i = a; i >= b; i--)
#define MAX3(a, b, c) max(a, max(b, c))
#define MIN3(a, b, c) min(a, min(b, c))
#define eachTest \
int t; \
cin >> t; \
while (t--) \
solve();
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
typedef pair<int, int> PII;
const int MOD = 1000000007;
void solve() { ; }
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
// eachTest
ll n;
cin >> n;
vector<ll> arr(n);
FOR(i, 0, n) { cin >> arr[i]; }
vector<ll> table(n);
table[0] = 0;
table[1] = abs(arr[1] - arr[0]);
FOR(i, 2, n) {
table[i] = min(abs(arr[i] - arr[i - 1]) + table[i - 1],
abs(arr[i] - arr[i - 2]) + table[i - 2]);
}
cout << table[n - 1] << "\n";
return 0;
}
|
replace
| 32 | 36 | 32 | 36 |
-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;
#define endl "\n"
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF (long long int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define ll long long int
#define ret return
#define NUM 100020
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio();
input();
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
int x1 = dp[i - 1] + abs(v[i] - v[i - 1]);
int x2 = dp[i - 2] + abs(v[i] - v[i - 2]);
dp[i] = min(x1, x2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF (long long int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define ll long long int
#define ret return
#define NUM 100020
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void input() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
fastio();
// input();
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int dp[n];
dp[0] = 0;
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
int x1 = dp[i - 1] + abs(v[i] - v[i - 1]);
int x2 = dp[i - 2] + abs(v[i] - v[i - 2]);
dp[i] = min(x1, x2);
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 28 | 29 | 28 | 29 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : "; \
for (auto x : v) \
cerr << x << ' '; \
cerr << endl;
#define MOD 1000000007
#define PI 3.141592653589793238
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll exp(ll x, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n & 1 == 1)
result = (result * x) % mod;
x = (x * x) % mod;
n = n >> 1;
}
return result;
}
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = dp[n - 1] + abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--)
dp[i] =
min(dp[i + 1] + abs(h[i] - h[i + 1]), dp[i + 2] + abs(h[i] - h[i + 2]));
cout << dp[0] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a) * (a)
#define debug(x) cerr << #x << '=' << (x) << endl;
#define debugv(v) \
cerr << #v << " : "; \
for (auto x : v) \
cerr << x << ' '; \
cerr << endl;
#define MOD 1000000007
#define PI 3.141592653589793238
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll exp(ll x, ll n, ll mod) {
ll result = 1;
while (n > 0) {
if (n & 1 == 1)
result = (result * x) % mod;
x = (x * x) % mod;
n = n >> 1;
}
return result;
}
int32_t main() {
IOS
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[n - 1] = 0;
dp[n - 2] = dp[n - 1] + abs(h[n - 2] - h[n - 1]);
for (int i = n - 3; i >= 0; i--)
dp[i] =
min(dp[i + 1] + abs(h[i] - h[i + 1]), dp[i + 2] + abs(h[i] - h[i + 2]));
cout << dp[0] << endl;
return 0;
}
|
delete
| 38 | 42 | 38 | 38 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define stdi(in) freopen(in, "r", stdin)
#define stdo(out) freopen(out, "w", stdout)
#define stdio(in, out) \
stdi(in); \
stdo(out)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define MAX 1000007
#define MOD 1000000007
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
// typedef int ittt;
// #define int ll
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
const ll inf = 1e18;
ll hit[MAX];
ll dp[MAX];
int n;
ll solve(int i) {
if (i <= 1) {
return 0;
}
if (dp[i] != -1)
return dp[i];
ll ans = solve(i - 1) + abs(hit[i] - hit[i - 1]);
if (i - 2 > 0) {
ans = min(ans, solve(i - 2) + abs(hit[i] - hit[i - 2]));
}
return dp[i] = ans;
}
int main() {
#ifndef ONLINE_JUDGE
stdio("in", "out");
#endif
fast;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> hit[i];
dp[i] = -1;
}
ll ans = solve(n);
cout << ans << '\n';
return 0;
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define stdi(in) freopen(in, "r", stdin)
#define stdo(out) freopen(out, "w", stdout)
#define stdio(in, out) \
stdi(in); \
stdo(out)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define MAX 1000007
#define MOD 1000000007
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
// typedef int ittt;
// #define int ll
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
const ll inf = 1e18;
ll hit[MAX];
ll dp[MAX];
int n;
ll solve(int i) {
if (i <= 1) {
return 0;
}
if (dp[i] != -1)
return dp[i];
ll ans = solve(i - 1) + abs(hit[i] - hit[i - 1]);
if (i - 2 > 0) {
ans = min(ans, solve(i - 2) + abs(hit[i] - hit[i - 2]));
}
return dp[i] = ans;
}
int main() {
/*#ifndef ONLINE_JUDGE
stdio("in", "out");
#endif*/
fast;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> hit[i];
dp[i] = -1;
}
ll ans = solve(n);
cout << ans << '\n';
return 0;
}
|
replace
| 53 | 56 | 53 | 56 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n;
vector<int> h(n + 1);
vector<int> cost(n + 1);
int Ans(int n) {
if (cost[n] != -1)
return cost[n];
cost[n] = min((Ans(n - 1) + abs(h[n - 1] - h[n])),
(Ans(n - 2) + abs(h[n - 2] - h[n])));
return cost[n];
}
int main() {
cin >> n;
rep(i, n) {
cin >> h[i];
cost[i] = -1;
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
cout << Ans(n - 1) << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int n;
vector<int> h(100000);
vector<int> cost(100000);
int Ans(int n) {
if (cost[n] != -1)
return cost[n];
cost[n] = min((Ans(n - 1) + abs(h[n - 1] - h[n])),
(Ans(n - 2) + abs(h[n - 2] - h[n])));
return cost[n];
}
int main() {
cin >> n;
rep(i, n) {
cin >> h[i];
cost[i] = -1;
}
cost[0] = 0;
cost[1] = abs(h[1] - h[0]);
cout << Ans(n - 1) << endl;
}
|
replace
| 5 | 7 | 5 | 7 |
0
| |
p03160
|
C++
|
Runtime Error
|
//_Hala Madrid_//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define FOR(i, start, end) for (ll i = start; i <= end; i++)
#define FORD(i, start, end) for (ll i = start; i >= end; i--)
#define br cout << "\n"
#define test(t) \
int t; \
cin >> t; \
while (t--)
#define rz return 0
#define all(s) s.begin(), s.end()
#define sz size()
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7;
void solve() {
bool flag = 0, flag1 = 0;
int m, n, k, l, r, sum = 0, ans = 0, pos, pos1, c1 = 0, c2 = 0, c3 = 0,
c4 = 0, x, y, z, cnt = 0, mx = 0, mn = INT_MAX;
string s, t, s1, s2;
string str = "";
vi v;
cin >> n;
int h[n];
vector<ll> dp(n, INT_MAX);
FOR(i, 0, n - 1)
cin >> h[i];
dp[0] = 0;
FOR(i, 0, n - 1) {
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];
}
int main() {
fio bool notc = 0;
int t = 1;
if (notc) {
cin >> t;
}
while (t--) {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
}
rz;
}
|
//_Hala Madrid_//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define FOR(i, start, end) for (ll i = start; i <= end; i++)
#define FORD(i, start, end) for (ll i = start; i >= end; i--)
#define br cout << "\n"
#define test(t) \
int t; \
cin >> t; \
while (t--)
#define rz return 0
#define all(s) s.begin(), s.end()
#define sz size()
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7;
void solve() {
bool flag = 0, flag1 = 0;
int m, n, k, l, r, sum = 0, ans = 0, pos, pos1, c1 = 0, c2 = 0, c3 = 0,
c4 = 0, x, y, z, cnt = 0, mx = 0, mn = INT_MAX;
string s, t, s1, s2;
string str = "";
vi v;
cin >> n;
int h[n];
vector<ll> dp(n + 5, INT_MAX);
FOR(i, 0, n - 1)
cin >> h[i];
dp[0] = 0;
FOR(i, 0, n - 1) {
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];
}
int main() {
fio bool notc = 0;
int t = 1;
if (notc) {
cin >> t;
}
while (t--) {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
solve();
}
rz;
}
|
replace
| 40 | 41 | 40 | 41 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define fr first
#define sc second
#define memset(X, Y) memset(X, Y, sizeof X)
#define all(X) X.begin(), X.end()
#define sz size()
#define pb push_back
#define ve vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define Graph vector<vector<int>>
#define Fp cout << fixed << setprecision(9)
#define Fast \
ios::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
const ll M = 1e3 + 30, N = 110, MOD = 1e9 + 7, OO = 1e7;
ll m, n, k, x, y, dp[N], bla, c = 1, cnt, ans, sum, a[N], ok = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n; i++)
dp[i] = OO;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n];
return 0;
}
/*
6 15= max
6 5
5 6
6 4
6 6
3 5
7 2
*/
|
#include <bits/stdc++.h>
#define fr first
#define sc second
#define memset(X, Y) memset(X, Y, sizeof X)
#define all(X) X.begin(), X.end()
#define sz size()
#define pb push_back
#define ve vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define Graph vector<vector<int>>
#define Fp cout << fixed << setprecision(9)
#define Fast \
ios::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
const ll M = 1e3 + 30, N = 1e5 + 30, MOD = 1e9 + 7, OO = 1e7;
ll m, n, k, x, y, dp[N], bla, c = 1, cnt, ans, sum, a[N], ok = 1;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n; i++)
dp[i] = OO;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
dp[i] =
min(dp[i - 1] + abs(a[i - 1] - a[i]), dp[i - 2] + abs(a[i - 2] - a[i]));
}
cout << dp[n];
return 0;
}
/*
6 15= max
6 5
5 6
6 4
6 6
3 5
7 2
*/
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[n] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> dp(n), arr(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
dp[0] = 0;
if (n > 1)
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[n - 1];
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
const int maxn = 1e3 + 5;
int32_t main() {
#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, 1e9);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
if (i - 1 >= 0)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
const int maxn = 1e3 + 5;
int32_t main() {
// #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, 1e9);
dp[0] = 0;
for (int i = 1; i < n; i++) {
if (i - 2 >= 0)
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
if (i - 1 >= 0)
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 8 | 12 | 8 | 12 |
-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 ll;
typedef long double ld;
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
ll ans[100000] = {};
ll fun(ll a[], ll pos, ll n) {
if (pos >= n - 1)
return 0;
if (ans[pos] != -1)
return ans[pos];
return ans[pos] = min(abs(a[pos] - a[pos + 1]) + fun(a, pos + 1, n),
abs(a[pos] - a[pos + 2]) + fun(a, pos + 2, n));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
memset(ans, -1, sizeof(ans));
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
ll n;
cin >> n;
ll a[n];
rep(i, 0, n) cin >> a[i];
cout << fun(a, 0, n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
ll ans[100000] = {};
ll fun(ll a[], ll pos, ll n) {
if (pos >= n - 1)
return 0;
if (ans[pos] != -1)
return ans[pos];
return ans[pos] = min(abs(a[pos] - a[pos + 1]) + fun(a, pos + 1, n),
abs(a[pos] - a[pos + 2]) + fun(a, pos + 2, n));
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
memset(ans, -1, sizeof(ans));
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
ll n;
cin >> n;
ll a[n];
rep(i, 0, n) cin >> a[i];
cout << fun(a, 0, n);
return 0;
}
|
replace
| 20 | 24 | 20 | 24 |
-6
|
terminate called after throwing an instance of 'std::__ios_failure'
what(): basic_ios::clear: iostream error
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (int i = start; i < end; i++)
#define N 100001
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl;
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << endl;
#define pi M_PI
const int INF = 1e9 + 5;
int main() {
fastio();
#ifndef ONLINE_JUDGE
auto freopenvar = freopen("in.txt", "r", stdin);
auto freeopenvar2 = freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int h[n];
loop(i, 0, n) { cin >> h[i]; }
vector<int> dp(n, INF);
dp[0] = 0;
loop(i, 0, n) {
loop(j, i + 1, i + 3) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define mkp make_pair
#define nl cout << endl
#define MOD 1000000007
#define loop(i, start, end) for (int i = start; i < end; i++)
#define N 100001
#define oa(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " "; \
nl;
#define ov(a) \
for (int i = 0; i < a.size(); i++) \
cout << a[i] << endl;
#define pi M_PI
const int INF = 1e9 + 5;
int main() {
fastio();
int n;
cin >> n;
int h[n];
loop(i, 0, n) { cin >> h[i]; }
vector<int> dp(n, INF);
dp[0] = 0;
loop(i, 0, n) {
loop(j, i + 1, i + 3) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
delete
| 30 | 34 | 30 | 30 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int n;
vector<int> v(10010, inf);
int main() {
cin >> n;
vector<int> h(n, 0);
rep(i, n) cin >> h[i];
v[0] = 0;
rep(i, n - 1) {
if (i + 2 < n) {
v[i + 2] = min(v[i + 2], v[i] + abs(h[i + 2] - h[i]));
v[i + 1] = min(v[i + 1], v[i] + abs(h[i + 1] - h[i]));
} else if (i + 1 < n) {
v[i + 1] = min(v[i + 1], v[i] + abs(h[i + 1] - h[i]));
}
}
cout << v[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
typedef long long ll;
typedef pair<ll, int> P;
typedef set<int> S;
int n;
vector<int> v(100100, inf);
int main() {
cin >> n;
vector<int> h(n, 0);
rep(i, n) cin >> h[i];
v[0] = 0;
rep(i, n - 1) {
if (i + 2 < n) {
v[i + 2] = min(v[i + 2], v[i] + abs(h[i + 2] - h[i]));
v[i + 1] = min(v[i + 1], v[i] + abs(h[i + 1] - h[i]));
} else if (i + 1 < n) {
v[i + 1] = min(v[i + 1], v[i] + abs(h[i + 1] - h[i]));
}
}
cout << v[n - 1] << endl;
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
0
| |
p03160
|
C++
|
Runtime Error
|
// Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 14;
const ll N = 5e3 + 5;
const ll INF = 1e9;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define ints(n) scanf("%d", &n)
#define intp(n) printf("%d\n", n)
#define longs(n) scanf("%lld", &n)
#define longp(n) printf("%lld\n", n)
#define f first
#define s second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
#define GCD(a, b) __gcd((a), (b))
#define all(v) v.begin(), v.end()
#define bits(x) __builtin_popcount(x)
#define LCM(a, b) ((a) * (b)) / GCD((a), (b))
#define ms(dp, val) memset(dp, val, sizeof(dp))
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
template <typename T> T power(T x, T y, ll m) {
T ans = 1;
while (y > 0) {
if (y & 1LL)
ans = (ans * x) % m;
y >>= 1LL;
x = (x * x) % m;
}
return ans % m;
}
ll n, a[N], dp[N][2];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1][0] = 0;
dp[1][1] = INF;
dp[2][0] = abs(a[2] - a[1]);
dp[2][1] = INF;
for (ll i = 3; i <= n; i++) {
dp[i][0] = abs(a[i] - a[i - 1]) + min(dp[i - 1][0], dp[i - 1][1]);
dp[i][1] = abs(a[i] - a[i - 2]) + min(dp[i - 2][1], dp[i - 2][0]);
}
// cout<<endl;
// for(ll i=1;i<=n;i++){cout<<dp[i][0]<<" "<<dp[i][1]<<endl;}
// cout<<endl;
cout << min(dp[n][0], dp[n][1]) << endl;
}
|
// Charan Sriramula
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long int ll;
const ll lg = 14;
const ll N = 5e5 + 5;
const ll INF = 1e9;
const ll mod = 1e9 + 7;
const double PI = 3.14159265358979323846;
#define ints(n) scanf("%d", &n)
#define intp(n) printf("%d\n", n)
#define longs(n) scanf("%lld", &n)
#define longp(n) printf("%lld\n", n)
#define f first
#define s second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
#define GCD(a, b) __gcd((a), (b))
#define all(v) v.begin(), v.end()
#define bits(x) __builtin_popcount(x)
#define LCM(a, b) ((a) * (b)) / GCD((a), (b))
#define ms(dp, val) memset(dp, val, sizeof(dp))
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
template <typename T> T power(T x, T y, ll m) {
T ans = 1;
while (y > 0) {
if (y & 1LL)
ans = (ans * x) % m;
y >>= 1LL;
x = (x * x) % m;
}
return ans % m;
}
ll n, a[N], dp[N][2];
int main() {
ll n;
cin >> n;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
}
dp[1][0] = 0;
dp[1][1] = INF;
dp[2][0] = abs(a[2] - a[1]);
dp[2][1] = INF;
for (ll i = 3; i <= n; i++) {
dp[i][0] = abs(a[i] - a[i - 1]) + min(dp[i - 1][0], dp[i - 1][1]);
dp[i][1] = abs(a[i] - a[i - 2]) + min(dp[i - 2][1], dp[i - 2][0]);
}
// cout<<endl;
// for(ll i=1;i<=n;i++){cout<<dp[i][0]<<" "<<dp[i][1]<<endl;}
// cout<<endl;
cout << min(dp[n][0], dp[n][1]) << endl;
}
|
replace
| 8 | 9 | 8 | 9 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
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;
}
constexpr long long INF = 1LL << 60;
long long h[10010];
long long dp[100010];
int main() {
int N;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> h[i];
}
for (auto &e : dp) {
e = INF;
}
// i==0
dp[0] = 0;
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + std::abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + std::abs(h[i] - h[i + 2]));
}
std::cout << dp[N - 1] << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
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;
}
constexpr long long INF = 1LL << 60;
long long h[100010];
long long dp[100010];
int main() {
int N;
std::cin >> N;
for (int i = 0; i < N; i++) {
std::cin >> h[i];
}
for (auto &e : dp) {
e = INF;
}
// i==0
dp[0] = 0;
for (int i = 0; i < N; i++) {
chmin(dp[i + 1], dp[i] + std::abs(h[i] - h[i + 1]));
chmin(dp[i + 2], dp[i] + std::abs(h[i] - h[i + 2]));
}
std::cout << dp[N - 1] << std::endl;
return 0;
}
|
replace
| 18 | 19 | 18 | 19 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int ll;
int main() {
ios::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;
vector<int> h(n);
for (auto &x : h)
cin >> x;
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (auto j : {i + 1, i + 2})
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> h(n);
for (auto &x : h)
cin >> x;
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++)
for (auto j : {i + 1, i + 2})
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
cout << dp[n - 1];
return 0;
}
|
delete
| 7 | 11 | 7 | 7 |
-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>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(1e9);
rep(i, n) { cin >> h.at(i); }
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (size_t i = 2; i < n; i++) {
int prev, prev2;
prev = abs(h[i] - h[i - 1]) + dp[i - 1];
prev2 = abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(prev, prev2);
}
cout << dp.at(n - 1) << endl;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> h(n);
vector<int> dp(n, 1e9);
rep(i, n) { cin >> h.at(i); }
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (size_t i = 2; i < n; i++) {
int prev, prev2;
prev = abs(h[i] - h[i - 1]) + dp[i - 1];
prev2 = abs(h[i] - h[i - 2]) + dp[i - 2];
dp[i] = min(prev, prev2);
}
cout << dp.at(n - 1) << endl;
}
|
replace
| 12 | 13 | 12 | 13 |
-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 ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define si second
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F(a, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define F1(a, n) \
for (int i = 1; i <= n; i++) { \
cin >> a[i]; \
}
#define P(a, n) \
for (int i = 0; i < n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define P1(a, n) \
for (int i = 1; i <= n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define NF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cin >> a[i][j]; \
} \
}
#define NF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cin >> a[i][j]; \
} \
}
#define PNF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define PNF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define AS 200001
#define mod 1000000007
#define inf 1e9
int solve(vector<int> ar, int n) {
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 2; i <= n; i++) {
int option1 = abs(ar[i] - ar[i - 1]) + dp[i - 1];
int option2 = (i == 2) ? inf : abs(ar[i] - ar[i - 2]) + dp[i - 2];
dp[i] = min(option1, option2);
}
return dp[n];
}
int main() {
fastIO
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vector<int> ar;
ar.resize(n + 1);
F1(ar, n);
cout << solve(ar, n) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define fi first
#define si second
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define F(a, n) \
for (int i = 0; i < n; i++) { \
cin >> a[i]; \
}
#define F1(a, n) \
for (int i = 1; i <= n; i++) { \
cin >> a[i]; \
}
#define P(a, n) \
for (int i = 0; i < n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define P1(a, n) \
for (int i = 1; i <= n; i++) { \
cout << a[i] << ' '; \
} \
cout << endl;
#define NF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cin >> a[i][j]; \
} \
}
#define NF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cin >> a[i][j]; \
} \
}
#define PNF(a, n, m) \
for (int i = 0; i < n; i++) { \
for (int j = 0; j < m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define PNF1(a, n, m) \
for (int i = 1; i <= n; i++) { \
for (int j = 1; j <= m; j++) { \
cout << a[i][j] << ' '; \
} \
cout << endl; \
} \
cout << endl;
#define AS 200001
#define mod 1000000007
#define inf 1e9
int solve(vector<int> ar, int n) {
vector<int> dp(n + 1);
dp[0] = 1;
for (int i = 2; i <= n; i++) {
int option1 = abs(ar[i] - ar[i - 1]) + dp[i - 1];
int option2 = (i == 2) ? inf : abs(ar[i] - ar[i - 2]) + dp[i - 2];
dp[i] = min(option1, option2);
}
return dp[n];
}
int main() {
fastIO
int n;
cin >> n;
vector<int> ar;
ar.resize(n + 1);
F1(ar, n);
cout << solve(ar, n) << endl;
}
|
replace
| 72 | 77 | 72 | 74 |
-6
|
terminate called after throwing an instance of 'std::length_error'
what(): vector::_M_default_append
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define F first
#define S second
#define vi vector<int>
#define pi pair<int, int>
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define er(n) cout << "error " << n << endl;
#define pbds \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define mod 1000000007
void Abhay() {
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
}
int32_t main() {
Abhay();
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0, dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
dp[i] = min(dp[i], abs(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define pb push_back
#define F first
#define S second
#define vi vector<int>
#define pi pair<int, int>
#define PI 3.14159265
#define all(x) x.begin(), x.end()
#define er(n) cout << "error " << n << endl;
#define pbds \
tree<int, null_type, less_equal<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define mod 1000000007
void Abhay() {
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
}
int32_t main() {
// Abhay();
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int dp[n];
dp[0] = 0, dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
dp[i] = min(dp[i], abs(dp[i - 2] + abs(a[i] - a[i - 2])));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 29 | 30 | 29 | 30 |
-11
| |
p03160
|
C++
|
Time Limit Exceeded
|
// In the name of **** God ****
/*
Copyright (C) JadedBeast
Morocco
created : 7/3/2019
*/
#include <bits/stdc++.h>
using namespace std;
int dp(int i, int *values, int *result, int n) {
if (i >= n)
return 0;
if (i < n - 2)
return result[i] = min(abs(values[i] - values[i + 1]) +
dp(i + 1, values, result, n),
min(abs(values[i] - values[i + 2]) +
dp(i + 2, values, result, n),
result[i]));
if (i < n - 1)
return result[i] = min(abs(values[i] - values[i + 1]) +
dp(i + 1, values, result, n),
result[i]);
return 0;
}
int main() {
int n;
cin >> n;
int values[n], result[n];
fill(result, result + n, INT_MAX);
for (int i = 0; i < n; i++) {
cin >> values[i];
}
cout << dp(0, values, result, n) << endl;
return 0;
}
|
// In the name of **** God ****
/*
Copyright (C) JadedBeast
Morocco
created : 7/3/2019
*/
#include <bits/stdc++.h>
using namespace std;
int dp(int i, int *values, int *result, int n) {
if (i >= n)
return 0;
if (result[i] < INT_MAX)
return result[i];
if (i < n - 2)
return result[i] = min(abs(values[i] - values[i + 1]) +
dp(i + 1, values, result, n),
min(abs(values[i] - values[i + 2]) +
dp(i + 2, values, result, n),
result[i]));
if (i < n - 1)
return result[i] = min(abs(values[i] - values[i + 1]) +
dp(i + 1, values, result, n),
result[i]);
return 0;
}
int main() {
int n;
cin >> n;
int values[n], result[n];
fill(result, result + n, INT_MAX);
for (int i = 0; i < n; i++) {
cin >> values[i];
}
cout << dp(0, values, result, n) << endl;
return 0;
}
|
insert
| 19 | 19 | 19 | 21 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll N1097 = 1000000007LL;
int h[10000];
int dp[10000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &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] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll N1097 = 1000000007LL;
int h[1000000];
int dp[1000000];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
scanf("%d", &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] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
}
|
replace
| 6 | 8 | 6 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
typedef long long int ll;
#define int ll
#define pb push_back
#define pll pair<int, int>
#define mll map<int, int>
#define F first
#define S second
#define lbnd(v, val) lower_bound(v.begin(), v.end(), val)
#define ubnd(v, val) upper_bound(v.begin(), v.end(), val)
#define bs(v, val) binary_search(v.begin(), v.end(), val)
#define mp make_pair
#define f(i, x, n) for (int i = x; i < n; i++)
#define isup isupper
#define islow islower
#define max3(a, b, c) max(a, max(b, c))
#define endl "\n"
#define countbits(n) __builtin_popcountll(n)
#define all(ar) ar.begin(), ar.end()
#define rall(ar) (ar).rbegin(), (ar).rend()
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
const ll N = 2e5 + 10;
typedef vector<vector<ll>> matrix;
typedef vector<ll> vll;
void solve() {
int n;
cin >> n;
vll v(n);
f(i, 0, n) { cin >> v[i]; }
int sum = 0;
vll ans(n, 0);
if (n == 2) {
cout << abs(v[0] - v[1]) << endl;
return;
}
ans[n - 2] = abs(v[n - 2] - v[n - 1]);
for (int i = n - 3; i >= 0; i--) {
ans[i] = min(abs(v[i] - v[i + 1]) + ans[i + 1],
abs(v[i] - v[i + 2]) + ans[i + 2]);
}
// debug(ans);
cout << ans[0] << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
typedef long long int ll;
#define int ll
#define pb push_back
#define pll pair<int, int>
#define mll map<int, int>
#define F first
#define S second
#define lbnd(v, val) lower_bound(v.begin(), v.end(), val)
#define ubnd(v, val) upper_bound(v.begin(), v.end(), val)
#define bs(v, val) binary_search(v.begin(), v.end(), val)
#define mp make_pair
#define f(i, x, n) for (int i = x; i < n; i++)
#define isup isupper
#define islow islower
#define max3(a, b, c) max(a, max(b, c))
#define endl "\n"
#define countbits(n) __builtin_popcountll(n)
#define all(ar) ar.begin(), ar.end()
#define rall(ar) (ar).rbegin(), (ar).rend()
const ll mod = 1e9 + 7;
const ll inf = LLONG_MAX;
const ll N = 2e5 + 10;
typedef vector<vector<ll>> matrix;
typedef vector<ll> vll;
void solve() {
int n;
cin >> n;
vll v(n);
f(i, 0, n) { cin >> v[i]; }
int sum = 0;
vll ans(n, 0);
if (n == 2) {
cout << abs(v[0] - v[1]) << endl;
return;
}
ans[n - 2] = abs(v[n - 2] - v[n - 1]);
for (int i = n - 3; i >= 0; i--) {
ans[i] = min(abs(v[i] - v[i + 1]) + ans[i + 1],
abs(v[i] - v[i + 2]) + ans[i + 2]);
}
// debug(ans);
cout << ans[0] << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
// #endif
int t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
replace
| 89 | 93 | 89 | 93 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03160
|
C++
|
Time Limit Exceeded
|
#include <iostream>
using namespace std;
typedef long long ll;
ll mincost(ll n, ll h[], ll *cost) {
if (cost[n] != 0)
return cost[n];
else {
if (n <= 3)
return cost[n] = abs(h[n] - h[1]);
return cost[n] = min(abs(h[n] - h[n - 2]) + mincost(n - 2, h, cost),
abs(h[n] - h[n - 1]) + mincost(n - 1, h, cost));
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll i, h[n + 1];
ll *cost = new ll[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
cost[i] = 0;
}
ll ans = mincost(n, h, cost);
cout << ans;
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
ll mincost(ll n, ll h[], ll *cost) {
if (cost[n] != 0)
return cost[n];
else {
cost[2] = abs(h[2] - h[1]);
cost[3] = abs(h[3] - h[1]);
for (ll i = 4; i <= n; i++) {
cost[i] = min(abs(h[i] - h[i - 1]) + cost[i - 1],
abs(h[i] - h[i - 2]) + cost[i - 2]);
}
return cost[n];
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll i, h[n + 1];
ll *cost = new ll[n + 1];
for (i = 1; i <= n; i++) {
cin >> h[i];
cost[i] = 0;
}
ll ans = mincost(n, h, cost);
cout << ans;
return 0;
}
|
replace
| 8 | 12 | 8 | 15 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
#define ull unsigned long long
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define vi vector<ll>
#define INF 1000000000
#define M ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main() {
M ll n, dp[100] = {};
vi v;
cin >> n;
for (int i = 0; i < n; i++) {
ll in;
cin >> in;
v.pb(in);
}
dp[0] = 0;
for (int i = 1; i <= n; i++)
dp[i] = INF;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i] - v[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(v[i] - v[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
#define ull unsigned long long
#define pb push_back
#define all(v) ((v).begin()), ((v).end())
#define vi vector<ll>
#define INF 1000000000
#define M ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
using namespace std;
int main() {
M ll n, dp[1000001] = {};
vi v;
cin >> n;
for (int i = 0; i < n; i++) {
ll in;
cin >> in;
v.pb(in);
}
dp[0] = 0;
for (int i = 1; i <= n; i++)
dp[i] = INF;
for (int i = 0; i < n; i++) {
if (i + 1 < n)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(v[i] - v[i + 1]));
if (i + 2 < n)
dp[i + 2] = min(dp[i + 2], dp[i] + abs(v[i] - v[i + 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x, y) x = min(x, y)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll dp[15000];
ll h[15000];
int main() {
int n;
cin >> n;
rep(i, n) { cin >> h[i]; }
dp[1] = abs(h[1] - h[0]);
rep(i, n) { dp[i] = LINF; }
dp[0] = 0;
for (int i = 0; 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;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x, y) x = min(x, y)
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
ll dp[150000];
ll h[150000];
int main() {
int n;
cin >> n;
rep(i, n) { cin >> h[i]; }
dp[1] = abs(h[1] - h[0]);
rep(i, n) { dp[i] = LINF; }
dp[0] = 0;
for (int i = 0; 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;
}
|
replace
| 14 | 16 | 14 | 16 |
0
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vc = vector<char>;
using vcc = vector<vc>;
using vb = vector<bool>;
using vbb = vector<vb>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using vd = vector<double>;
using vdd = vector<vd>;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a > b) ? b : a)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1e9 + 7;
vector<pii>
prime_factorization(int n) { // 素因数分解をしたvector<素数, 指数>を返す
vector<pii> res;
int tmp, root_n = floor(sqrt(n));
if (n % 2 == 0) {
tmp = 1;
n /= 2;
while (n % 2 == 0) {
n /= 2;
tmp++;
}
res.push_back(make_pair(2, tmp));
}
ll i = 3;
while (i <= root_n && i <= n) {
if (n % i == 0) {
tmp = 1;
n /= i;
while (n % i == 0) {
n /= i;
tmp++;
}
res.push_back(make_pair(i, tmp));
}
i += 2;
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
vector<pli>
prime_factorization(ll n) { // 素因数分解をしたvector<素数, 指数>を返す
vector<pli> res;
int tmp, root_n = floor(sqrt(n));
if (n % 2 == 0) {
tmp = 1;
n /= 2;
while (n % 2 == 0) {
n /= 2;
tmp++;
}
res.push_back(make_pair(2, tmp));
}
ll i = 3;
while (i <= root_n && i <= n) {
if (n % i == 0) {
tmp = 1;
n /= i;
while (n % i == 0) {
n /= i;
tmp++;
}
res.push_back(make_pair(i, tmp));
}
i += 2;
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// n は 2以上の素数表を返す
vb Primes(int n) {
vector<bool> res(n + 1, true);
res.at(0) = false;
res.at(1) = false;
for (int i = 2; i <= sqrt(n); i++) {
if (res.at(i)) {
for (int j = 2 * i; j <= n; j += i) {
res.at(j) = false;
}
}
}
return res;
}
// ===================================================
ll power_mod(ll k, int n, int mod) {
if (n == 0)
return 1;
ll tmp = power_mod(k, n / 2, mod);
tmp = (tmp * tmp) % mod;
if (n % 2 == 0)
return tmp;
return (k * tmp) % mod;
}
ll v_p(int n, int p) {
int res = 0;
while (n >= p) {
res += (n / p);
n /= p;
}
return res;
}
void dpp(vi h, vi &dp, int k) {
if (k == 0) {
dp.at(0) = 0;
return;
}
if (k == 1) {
dpp(h, dp, 0);
dp.at(1) = abs(h.at(0) - h.at(1));
return;
}
if (dp.at(k - 1) != -1 && dp.at(k - 2) != -1)
return;
dpp(h, dp, k - 1);
int p, q;
p = abs(h.at(k) - h.at(k - 1)) + dp.at(k - 1);
q = abs(h.at(k) - h.at(k - 2)) + dp.at(k - 2);
dp.at(k) = MIN(p, q);
// cout << "Done of " << k << "\n";
return;
}
int main() {
int n;
cin >> n;
vi h(n);
REP(i, n) cin >> h.at(i);
vi subDP(n, -1);
dpp(h, subDP, n - 1);
cout << subDP.at(n - 1) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
// g++ Main.cpp -std=gnu++1y -O2 -I/opt/boost/gcc/include -o main && ./main
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vc = vector<char>;
using vcc = vector<vc>;
using vb = vector<bool>;
using vbb = vector<vb>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using vd = vector<double>;
using vdd = vector<vd>;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a > b) ? b : a)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1e9 + 7;
vector<pii>
prime_factorization(int n) { // 素因数分解をしたvector<素数, 指数>を返す
vector<pii> res;
int tmp, root_n = floor(sqrt(n));
if (n % 2 == 0) {
tmp = 1;
n /= 2;
while (n % 2 == 0) {
n /= 2;
tmp++;
}
res.push_back(make_pair(2, tmp));
}
ll i = 3;
while (i <= root_n && i <= n) {
if (n % i == 0) {
tmp = 1;
n /= i;
while (n % i == 0) {
n /= i;
tmp++;
}
res.push_back(make_pair(i, tmp));
}
i += 2;
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
vector<pli>
prime_factorization(ll n) { // 素因数分解をしたvector<素数, 指数>を返す
vector<pli> res;
int tmp, root_n = floor(sqrt(n));
if (n % 2 == 0) {
tmp = 1;
n /= 2;
while (n % 2 == 0) {
n /= 2;
tmp++;
}
res.push_back(make_pair(2, tmp));
}
ll i = 3;
while (i <= root_n && i <= n) {
if (n % i == 0) {
tmp = 1;
n /= i;
while (n % i == 0) {
n /= i;
tmp++;
}
res.push_back(make_pair(i, tmp));
}
i += 2;
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// n は 2以上の素数表を返す
vb Primes(int n) {
vector<bool> res(n + 1, true);
res.at(0) = false;
res.at(1) = false;
for (int i = 2; i <= sqrt(n); i++) {
if (res.at(i)) {
for (int j = 2 * i; j <= n; j += i) {
res.at(j) = false;
}
}
}
return res;
}
// ===================================================
ll power_mod(ll k, int n, int mod) {
if (n == 0)
return 1;
ll tmp = power_mod(k, n / 2, mod);
tmp = (tmp * tmp) % mod;
if (n % 2 == 0)
return tmp;
return (k * tmp) % mod;
}
ll v_p(int n, int p) {
int res = 0;
while (n >= p) {
res += (n / p);
n /= p;
}
return res;
}
void dpp(vi &h, vi &dp, int k) {
if (k == 0) {
dp.at(0) = 0;
return;
}
if (k == 1) {
dpp(h, dp, 0);
dp.at(1) = abs(h.at(0) - h.at(1));
return;
}
if (dp.at(k - 1) != -1 && dp.at(k - 2) != -1)
return;
dpp(h, dp, k - 1);
int p, q;
p = abs(h.at(k) - h.at(k - 1)) + dp.at(k - 1);
q = abs(h.at(k) - h.at(k - 2)) + dp.at(k - 2);
dp.at(k) = MIN(p, q);
// cout << "Done of " << k << "\n";
return;
}
int main() {
int n;
cin >> n;
vi h(n);
REP(i, n) cin >> h.at(i);
vi subDP(n, -1);
dpp(h, subDP, n - 1);
cout << subDP.at(n - 1) << "\n";
return 0;
}
|
replace
| 128 | 129 | 128 | 129 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, sizeof(a))
#define all(x) x.begin(), x.end()
#define itit(it, a) for (auto it = (a).begin(); it != (a).end(); it++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, a, b) for (ll i = a; i > b; i--)
#define reprr(i, a, b) for (ll i = a; i >= b; i--)
#define pi 3.14159265358979323846264338327950288419716939937510582097494459230
ll max3(ll x, ll y, ll z) { return max(max(x, y), z); }
ll min3(ll x, ll y, ll z) { return min(min(x, y), z); }
const ll M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int &a, int b) {
a += b;
if (a >= mod) {
a -= mod;
}
}
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
ll power(ll x, ll n) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = ((x % mod) * (x % mod)) % mod;
n = n / 2;
}
return result;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll h[n];
rep(i, 0, n) cin >> h[i];
std::vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; ++i) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
return 0;
}
|
// --------------------<optimizations>--------------------
#pragma GCC optimize("O3")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)\
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)\
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair<ll, ll>
#define vpii vector<pair<ll, ll>>
#define F first
#define S second
#define ld long double
#define built __builtin_popcountll
#define mst(a, i) memset(a, i, sizeof(a))
#define all(x) x.begin(), x.end()
#define itit(it, a) for (auto it = (a).begin(); it != (a).end(); it++)
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, a, b) for (ll i = a; i > b; i--)
#define reprr(i, a, b) for (ll i = a; i >= b; i--)
#define pi 3.14159265358979323846264338327950288419716939937510582097494459230
ll max3(ll x, ll y, ll z) { return max(max(x, y), z); }
ll min3(ll x, ll y, ll z) { return min(min(x, y), z); }
const ll M = 2e5 + 10, M2 = 1e6 + 10, mod = 1e9 + 7, inf = 1e17 + 10;
void add(int &a, int b) {
a += b;
if (a >= mod) {
a -= mod;
}
}
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ":" << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
int X[] = {0, 1, 0, -1};
int Y[] = {-1, 0, 1, 0};
ll power(ll x, ll n) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % mod;
x = ((x % mod) * (x % mod)) % mod;
n = n / 2;
}
return result;
}
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
ll h[n];
rep(i, 0, n) cin >> h[i];
std::vector<ll> dp(n, inf);
dp[0] = 0;
for (ll i = 0; i < n; ++i) {
for (ll j = i + 1; j <= i + 2; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 66 | 68 | 66 | 68 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int dp[1001] = {0};
int fun(int arr[], int n) {
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int option1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int option2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(option1, option2);
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << fun(arr, n) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100000] = {0};
int fun(int arr[], int n) {
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
int option1 = dp[i - 1] + abs(arr[i] - arr[i - 1]);
int option2 = dp[i - 2] + abs(arr[i] - arr[i - 2]);
dp[i] = min(option1, option2);
}
// for(int i=0;i<n;i++) cout<<dp[i]<<" ";
return dp[n - 1];
}
int main() {
int n;
cin >> n;
int arr[n + 1];
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << fun(arr, n) << endl;
}
|
replace
| 2 | 3 | 2 | 3 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> vec;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec.push_back(x);
}
vector<int> dp;
dp.push_back(0);
dp.push_back(abs(vec[0] - vec[1]));
for (int i = 2; i < n; i++) {
int y = min(abs(vec[i - 1] - vec[i]) + dp[i - 1],
abs(vec[i - 2] - vec[i]) + dp[i - 2]);
dp.push_back(y);
}
return dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> vec;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec.push_back(x);
}
vector<int> dp;
dp.push_back(0);
dp.push_back(abs(vec[0] - vec[1]));
for (int i = 2; i < n; i++) {
int y = min(abs(vec[i - 1] - vec[i]) + dp[i - 1],
abs(vec[i - 2] - vec[i]) + dp[i - 2]);
dp.push_back(y);
}
cout << dp[n - 1];
return 0;
}
|
replace
| 30 | 31 | 30 | 33 |
30
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define pie 3.141592653589
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
ll i, n, n2, m, t, j, l, r, pos, mpos, f = 0, k, p, n1, z, q, x, y, x1, y1,
x2, y2, x3, y3, x4, y4;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
vector<ll> dp(n, 0);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define pie 3.141592653589
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, n, n2, m, t, j, l, r, pos, mpos, f = 0, k, p, n1, z, q, x, y, x1, y1,
x2, y2, x3, y3, x4, y4;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
vector<ll> dp(n, 0);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++)
dp[i] =
min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2]));
cout << dp[n - 1];
return 0;
}
|
delete
| 12 | 17 | 12 | 12 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int n;
int h[10000];
int a[10000];
a[0] = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
a[i + 1] = abs(h[i] - h[i + 1]) + a[i];
if (i > 0) {
if (a[i + 1] > abs(h[i - 1] - h[i + 1]) + a[i - 1])
a[i + 1] = abs(h[i - 1] - h[i + 1]) + a[i - 1];
}
}
cout << a[n - 1];
}
|
#include <iostream>
using namespace std;
int main() {
int n;
int h[1000000];
int a[1000000];
a[0] = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < n; i++) {
a[i + 1] = abs(h[i] - h[i + 1]) + a[i];
if (i > 0) {
if (a[i + 1] > abs(h[i - 1] - h[i + 1]) + a[i - 1])
a[i + 1] = abs(h[i - 1] - h[i + 1]) + a[i - 1];
}
}
cout << a[n - 1];
}
|
replace
| 4 | 6 | 4 | 6 |
0
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.