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
/** * Title: A - Frog 1 * Url: https://atcoder.jp/contests/dp/tasks/dp_a */ #include <bits/stdc++.h> using namespace std; #define ll long long const int MAX_N = 10000; int main() { int n; cin >> n; int h[MAX_N + 1]; int cost[MAX_N + 1]; for (int i = 0; i < n; i++) cin >> h[i + 1]; for (int i = 1; i <= n; i++) { if (i == 1) { cost[i] = 0; } else if (i == 2) { cost[i] = abs(h[2] - h[1]); } else { cost[i] = min(cost[i - 1] + abs(h[i] - h[i - 1]), cost[i - 2] + abs(h[i] - h[i - 2])); } } cout << cost[n] << endl; return 0; }
/** * Title: A - Frog 1 * Url: https://atcoder.jp/contests/dp/tasks/dp_a */ #include <bits/stdc++.h> using namespace std; #define ll long long const int MAX_N = 100000; int main() { int n; cin >> n; int h[MAX_N + 1]; int cost[MAX_N + 1]; for (int i = 0; i < n; i++) cin >> h[i + 1]; for (int i = 1; i <= n; i++) { if (i == 1) { cost[i] = 0; } else if (i == 2) { cost[i] = abs(h[2] - h[1]); } else { cost[i] = min(cost[i - 1] + abs(h[i] - h[i - 1]), cost[i - 2] + abs(h[i] - h[i - 2])); } } cout << cost[n] << endl; return 0; }
replace
10
11
10
11
0
p03160
C++
Time Limit Exceeded
#include <iostream> #include <vector> using namespace std; int main() { int N; cin >> N; vector<int> H(N); for (int i = 0; i < N; ++i) { cin >> H[i]; } vector<int> c(N, 0); for (int i = 1; i < N; ++i) { if (i = 1) { c[i] = c[i - 1] + abs(H[i] - H[i - 1]); } else { c[i] = min(c[i - 1] + abs(H[i] - H[i - 1]), c[i - 2] + abs(H[i] - H[i - 2])); } } cout << c[N - 1] << endl; }
#include <iostream> #include <vector> using namespace std; int main() { int N; cin >> N; vector<int> H(N); for (int i = 0; i < N; ++i) { cin >> H[i]; } vector<int> c(N, 0); for (int i = 1; i < N; ++i) { if (i == 1) { c[i] = c[i - 1] + abs(H[i] - H[i - 1]); } else { c[i] = min(c[i - 1] + abs(H[i] - H[i - 1]), c[i - 2] + abs(H[i] - H[i - 2])); } } cout << c[N - 1] << endl; }
replace
12
13
12
13
TLE
p03160
C++
Time Limit Exceeded
#include <cstdlib> #include <cstring> #include <iostream> #include <vector> using namespace std; #pragma GCC oprimize("Ofast") #define rep(i, a, b) for (__typeof(b) i = a; i < b; ++i) typedef long long ll; typedef vector<ll> vl; const ll inf = 100000000000; ll n; ll mem[100010]; vl l; ll dp(ll at) { if (at > n - 1) return inf; if (at == n - 1) return 0; if (mem[at] != -1) return mem[at]; ll ans = inf; ans = min(ans, abs(l[at] - l[at + 1]) + dp(at + 1)); ans = min(ans, abs(l[at] - l[at + 2]) + dp(at + 2)); return ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); memset(mem, -1, sizeof(mem)); cin >> n; l.resize(n); rep(i, 0, n) { cin >> l[i]; } cout << dp(0); return 0; }
#include <cstdlib> #include <cstring> #include <iostream> #include <vector> using namespace std; #pragma GCC oprimize("Ofast") #define rep(i, a, b) for (__typeof(b) i = a; i < b; ++i) typedef long long ll; typedef vector<ll> vl; const ll inf = 100000000000; ll n; ll mem[100010]; vl l; ll dp(ll at) { if (at > n - 1) return inf; if (at == n - 1) return 0; if (mem[at] != -1) return mem[at]; ll ans = inf; ans = min(ans, abs(l[at] - l[at + 1]) + dp(at + 1)); ans = min(ans, abs(l[at] - l[at + 2]) + dp(at + 2)); return mem[at] = ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); memset(mem, -1, sizeof(mem)); cin >> n; l.resize(n); rep(i, 0, n) { cin >> l[i]; } cout << dp(0); return 0; }
replace
29
30
29
30
TLE
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) int costmin(int n, int h[]) { int *dp = new int[n + 1]{INT_MAX}; dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])); } return dp[n - 1]; } int main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif fastio(); int n; cin >> n; int a[n]; for (int &x : a) cin >> x; int ans = costmin(n, a); cout << ans << 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) int costmin(int n, int h[]) { int *dp = new int[n + 1]{INT_MAX}; dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])); } return dp[n - 1]; } int main() { fastio(); int n; cin >> n; int a[n]; for (int &x : a) cin >> x; int ans = costmin(n, a); cout << ans << endl; return 0; }
delete
21
25
21
21
0
p03160
C++
Runtime Error
#include <algorithm> #include <bits/stdc++.h> #include <iostream> #include <math.h> #include <string.h> #include <vector> #define ll long long #define IOS \ ios_base::sync_with_stdio(false); \ cin.tie(0); \ cout.tie(0); #define mod 1000000009 using namespace std; bool isprime(ll n) { // if(n<2) // return false; if (n == 1) return true; if (n == 2 || n == 3) return true; if (n % 2 == 0) return false; for (ll i = 3; i * i <= n; i += 2) { if (n % i == 0) return false; } return true; } int gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a); } int lcm(ll a, ll b) { return a * (b / gcd(a, b)); } set<ll> fac; void allFactors(ll n) { // set<ll> fac; for (ll i = 1; i <= sqrt(n); i++) { if (n % i == 0) { fac.insert(i); if (i != n / i) { fac.insert(n / i); } } } // return fac.size(); } bool threefactors(ll n) // when you have need of a no which is divisible by // 1,itself,any other one no. { ll p = sqrt(n); if (p * p == n) { if (isprime(p)) return 1; else return 0; } else return 0; } int main() { IOS // int w; // cin>>w; // while(w--) { int n; cin >> n; int a[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } ll dp[10000]; for (int i = 0; i < 10000; i++) dp[i] = mod; dp[1] = 0; for (int i = 1; i < n; i++) { for (int j = i + 1; j <= i + 2; j++) { if (j <= n) dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j])); } } cout << dp[n]; } return 0; } // ascii of a=97 // ascii of A=65 // ascii of 0=48
#include <algorithm> #include <bits/stdc++.h> #include <iostream> #include <math.h> #include <string.h> #include <vector> #define ll long long #define IOS \ ios_base::sync_with_stdio(false); \ cin.tie(0); \ cout.tie(0); #define mod 1000000009 using namespace std; bool isprime(ll n) { // if(n<2) // return false; if (n == 1) return true; if (n == 2 || n == 3) return true; if (n % 2 == 0) return false; for (ll i = 3; i * i <= n; i += 2) { if (n % i == 0) return false; } return true; } int gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a); } int lcm(ll a, ll b) { return a * (b / gcd(a, b)); } set<ll> fac; void allFactors(ll n) { // set<ll> fac; for (ll i = 1; i <= sqrt(n); i++) { if (n % i == 0) { fac.insert(i); if (i != n / i) { fac.insert(n / i); } } } // return fac.size(); } bool threefactors(ll n) // when you have need of a no which is divisible by // 1,itself,any other one no. { ll p = sqrt(n); if (p * p == n) { if (isprime(p)) return 1; else return 0; } else return 0; } int main() { IOS // int w; // cin>>w; // while(w--) { int n; cin >> n; int a[n + 1]; for (int i = 1; i <= n; i++) { cin >> a[i]; } ll dp[10000000]; for (int i = 0; i < 10000000; i++) dp[i] = mod; dp[1] = 0; for (int i = 1; i < n; i++) { for (int j = i + 1; j <= i + 2; j++) { if (j <= n) dp[j] = min(dp[j], dp[i] + abs(a[i] - a[j])); } } cout << dp[n]; } return 0; } // ascii of a=97 // ascii of A=65 // ascii of 0=48
replace
72
74
72
74
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #include <unordered_map> using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef map<int, int> mii; typedef pair<int, int> pii; #define INF 1000000000 #define MOD 1000000007 #define itr ::iterator it #define gcd(a, b) __gcd((a), (b)) #define lcm(a, b) ((a) * (b)) / gcd((a), (b)) #define remin(a, b) (a) = min((a), (b)) #define remax(a, b) (a) = max((a), (b)) #define ll long long #define db double #define el "\n" #define ld long double #define ff first #define ss second #define pb push_back #define mp make_pair 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]; for (i = 0; i < n; i++) { cin >> a[i]; } int ans[n]; ans[0] = 0; ans[1] = abs(a[1] - a[0]); for (i = 2; i < n; i++) { ans[i] = min(ans[i - 1] + abs(a[i] - a[i - 1]), ans[i - 2] + abs(a[i] - a[i - 2])); } cout << ans[n - 1]; }
#include <bits/stdc++.h> #include <unordered_map> using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef map<int, int> mii; typedef pair<int, int> pii; #define INF 1000000000 #define MOD 1000000007 #define itr ::iterator it #define gcd(a, b) __gcd((a), (b)) #define lcm(a, b) ((a) * (b)) / gcd((a), (b)) #define remin(a, b) (a) = min((a), (b)) #define remax(a, b) (a) = max((a), (b)) #define ll long long #define db double #define el "\n" #define ld long double #define ff first #define ss second #define pb push_back #define mp make_pair int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, i; cin >> n; int a[n]; for (i = 0; i < n; i++) { cin >> a[i]; } int ans[n]; ans[0] = 0; ans[1] = abs(a[1] - a[0]); for (i = 2; i < n; i++) { ans[i] = min(ans[i - 1] + abs(a[i] - a[i - 1]), ans[i - 2] + abs(a[i] - a[i - 2])); } cout << ans[n - 1]; }
delete
25
29
25
25
-11
p03160
C++
Runtime Error
//*-- ILSH --*// #include <bits/stdc++.h> using namespace std; typedef long long int ll; #define pb push_back #define pop pop_back #define mp make_pair #define ve vector #define vii vector<int> #define vll vector<ll> #define pii pair<int, int> #define pll pair<ll, ll> #define vpi vector<pii> #define vpl vector<pll> #define viii vector<vii> #define vlll vector<vll> #define fi first #define sz size #define len length #define se second // const ll mod=998244353; const ll mod = 1000000000 + 7; const ll N = 200000 + 6; const ll inf = 1e17; ll powm(ll a, ll b) { a = a % mod; ll res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return (res % mod); } ll modInverse(ll a, ll m) { ll m0 = m; ll y = 0, x = 1; if (m == 1) return 0; while (a > 1) { ll q = a / m; ll t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } void solve() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int brr[n]; brr[0] = 0; brr[1] = abs(arr[0] - arr[1]); for (int i = 2; i < n; i++) brr[i] = std::min(brr[i - 1] + abs(arr[i] - arr[i - 1]), brr[i - 2] + abs(arr[i] - arr[i - 2])); cout << brr[n - 1] << '\n'; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("INPUT.txt", "r", stdin); freopen("OUTPUT.txt", "w", stdout); #endif int t = 1; // cin>>t; while (t--) solve(); }
//*-- ILSH --*// #include <bits/stdc++.h> using namespace std; typedef long long int ll; #define pb push_back #define pop pop_back #define mp make_pair #define ve vector #define vii vector<int> #define vll vector<ll> #define pii pair<int, int> #define pll pair<ll, ll> #define vpi vector<pii> #define vpl vector<pll> #define viii vector<vii> #define vlll vector<vll> #define fi first #define sz size #define len length #define se second // const ll mod=998244353; const ll mod = 1000000000 + 7; const ll N = 200000 + 6; const ll inf = 1e17; ll powm(ll a, ll b) { a = a % mod; ll res = 1; while (b) { if (b & 1) res = (res * a) % mod; a = (a * a) % mod; b >>= 1; } return (res % mod); } ll modInverse(ll a, ll m) { ll m0 = m; ll y = 0, x = 1; if (m == 1) return 0; while (a > 1) { ll q = a / m; ll t = m; m = a % m, a = t; t = y; y = x - q * y; x = t; } if (x < 0) x += m0; return x; } void solve() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int brr[n]; brr[0] = 0; brr[1] = abs(arr[0] - arr[1]); for (int i = 2; i < n; i++) brr[i] = std::min(brr[i - 1] + abs(arr[i] - arr[i - 1]), brr[i - 2] + abs(arr[i] - arr[i - 2])); cout << brr[n - 1] << '\n'; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; // cin>>t; while (t--) solve(); }
replace
71
75
71
72
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/detail/standard_policies.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef long long int ll; typedef unsigned long long int ull; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> o_set; #define int ll #define pb push_back #define mp make_pair #define xx first #define yy second #define all(a) a.begin(), a.end() #define vi vector<int> #define vpi vector<pii> #define pii pair<int, int> #define present(DT, val) (DT.find(val) != DT.end()) // for set and map #define cpresent(DT, val) (find(all(DT), val) != DT.end()) // vectors #define input "/home/pollution/Desktop/WorkSpace/C++/Files/input.txt" #define output "/home/pollution/Desktop/WorkSpace/C++/Files/output1.txt" #define error "/home/pollution/Desktop/WorkSpace/C++/Files/error.txt" #define IO() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); #define INF 2e18 #define MOD 1000000007 #define clr(x) memset(x, 0, sizeof(x)) #define init(x, a) memset(x, a, sizeof(x)) #define out(a) \ for (auto i : a) \ cout << i << ' '; \ cout << '\n' #define cpy(a, b) memcpy(a, b, sizeof(b)) #define itos(a) to_string(a) #define ctoi(a) int(a) - 48 #define setd(val, n) cout << fixed << setprecision(n) << val << '\n' void solve() { int n; cin >> n; int a[n]; clr(a); for (int i = 0; i < n; i++) { cin >> a[i]; } int dp[n]; clr(dp); dp[0] = 0; dp[1] = abs(a[1] - a[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2])); } cout << dp[n - 1]; } signed main() { IO(); #ifndef ONLINE_JUDGE freopen(input, "r", stdin); freopen(output, "w", stdout); freopen(error, "w", stderr); #endif int t = 1; // cin>>t; while (t--) solve(); return 0; }
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/detail/standard_policies.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef long long int ll; typedef unsigned long long int ull; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> o_set; #define int ll #define pb push_back #define mp make_pair #define xx first #define yy second #define all(a) a.begin(), a.end() #define vi vector<int> #define vpi vector<pii> #define pii pair<int, int> #define present(DT, val) (DT.find(val) != DT.end()) // for set and map #define cpresent(DT, val) (find(all(DT), val) != DT.end()) // vectors #define input "/home/pollution/Desktop/WorkSpace/C++/Files/input.txt" #define output "/home/pollution/Desktop/WorkSpace/C++/Files/output1.txt" #define error "/home/pollution/Desktop/WorkSpace/C++/Files/error.txt" #define IO() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); #define INF 2e18 #define MOD 1000000007 #define clr(x) memset(x, 0, sizeof(x)) #define init(x, a) memset(x, a, sizeof(x)) #define out(a) \ for (auto i : a) \ cout << i << ' '; \ cout << '\n' #define cpy(a, b) memcpy(a, b, sizeof(b)) #define itos(a) to_string(a) #define ctoi(a) int(a) - 48 #define setd(val, n) cout << fixed << setprecision(n) << val << '\n' void solve() { int n; cin >> n; int a[n]; clr(a); for (int i = 0; i < n; i++) { cin >> a[i]; } int dp[n]; clr(dp); dp[0] = 0; dp[1] = abs(a[1] - a[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2])); } cout << dp[n - 1]; } signed main() { IO(); int t = 1; // cin>>t; while (t--) solve(); return 0; }
delete
65
70
65
65
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #include <stdio.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define all(v) ((v).begin()), ((v).end()) #define rall(v) ((v).rbegin()), ((v).rend()) #define clr(v, line) memset(v, line, sizeof(v)) #define endl '\n' #define TRACE #ifdef TRACE #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cerr << name << " : " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *coma = strchr(names + 1, ','); cerr.write(names, coma - names) << " : " << arg1 << " | "; __f(coma + 1, args...); } #else #define trace(...) #endif void file() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } void fast() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } int N; int h[100005], dp[100005]; int solve(int idx = 0) { if (idx == N) return 0; int &ret = dp[idx]; if (~ret) return ret; return ret = min( ((idx + 1) <= N) * (solve(idx + 1) + abs(h[idx] - h[idx + 1])), ((idx + 2) <= N) * (solve(idx + 2) + abs(h[idx] - h[idx + 2]))); } int main(int argc, char const *argv[]) { file(); fast(); cin >> N; fill(h, h + 100005, INT_MAX); for (int i = 0; i < N; ++i) { cin >> h[i]; } clr(dp, -1); cout << solve(); }
#include <bits/stdc++.h> #include <stdio.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define all(v) ((v).begin()), ((v).end()) #define rall(v) ((v).rbegin()), ((v).rend()) #define clr(v, line) memset(v, line, sizeof(v)) #define endl '\n' #define TRACE #ifdef TRACE #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cerr << name << " : " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *coma = strchr(names + 1, ','); cerr.write(names, coma - names) << " : " << arg1 << " | "; __f(coma + 1, args...); } #else #define trace(...) #endif void file() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } void fast() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); } int N; int h[100005], dp[100005]; int solve(int idx = 0) { if (idx == N) return 0; int &ret = dp[idx]; if (~ret) return ret; return ret = min( ((idx + 1) <= N) * (solve(idx + 1) + abs(h[idx] - h[idx + 1])), ((idx + 2) <= N) * (solve(idx + 2) + abs(h[idx] - h[idx + 2]))); } int main(int argc, char const *argv[]) { // file(); fast(); cin >> N; fill(h, h + 100005, INT_MAX); for (int i = 0; i < N; ++i) { cin >> h[i]; } clr(dp, -1); cout << solve(); }
replace
55
56
55
56
0
p03160
C++
Runtime Error
/* TASK: nocows LANG: C++14 */ #include "bits/stdc++.h" typedef long long ll; typedef long double ld; using namespace std; #define finish(x) return cout << x, 0; void setIn(string s) { freopen(s.c_str(), "r", stdin); } void setOut(string s) { freopen(s.c_str(), "w", stdout); } const string USCAO_TAG = "nocows"; void usaco() { setIn(USCAO_TAG + ".in"); setOut(USCAO_TAG + ".out"); } /* template<typename... Args> void print(Args... args) { ((std::cout << args << " "), ...); } */ ll a[10001]; ll dp[10001][2]; int main() { // usaco(); #ifndef ONLINE_JUDGE // setIn("in.txt"); #endif int n; cin >> n; memset(dp, 0, sizeof dp); for (int i = 1; i <= n; i++) cin >> a[i]; a[0] = a[1]; dp[n][1] = abs(a[n] - a[n - 1]); if (n > 1) dp[n][0] = abs(a[n] - a[n - 2]); for (int i = n - 1; i >= 1; i--) { dp[i][1] = dp[i + 1][1] + abs(a[i] - a[i - 1]); if (i + 2 <= n) dp[i][1] = min(dp[i][1], dp[i + 2][0] + abs(a[i] - a[i - 1])); if (i - 2 >= 0) dp[i][0] = dp[i + 1][1] + abs(a[i] - a[i - 2]); if (i + 2 <= n && i - 2 >= 0) dp[i][0] = min(dp[i][0], dp[i + 2][0] + abs(a[i] - a[i - 2])); } cout << dp[1][1]; }
/* TASK: nocows LANG: C++14 */ #include "bits/stdc++.h" typedef long long ll; typedef long double ld; using namespace std; #define finish(x) return cout << x, 0; void setIn(string s) { freopen(s.c_str(), "r", stdin); } void setOut(string s) { freopen(s.c_str(), "w", stdout); } const string USCAO_TAG = "nocows"; void usaco() { setIn(USCAO_TAG + ".in"); setOut(USCAO_TAG + ".out"); } /* template<typename... Args> void print(Args... args) { ((std::cout << args << " "), ...); } */ ll a[100001]; ll dp[100001][2]; int main() { // usaco(); #ifndef ONLINE_JUDGE // setIn("in.txt"); #endif int n; cin >> n; memset(dp, 0, sizeof dp); for (int i = 1; i <= n; i++) cin >> a[i]; a[0] = a[1]; dp[n][1] = abs(a[n] - a[n - 1]); if (n > 1) dp[n][0] = abs(a[n] - a[n - 2]); for (int i = n - 1; i >= 1; i--) { dp[i][1] = dp[i + 1][1] + abs(a[i] - a[i - 1]); if (i + 2 <= n) dp[i][1] = min(dp[i][1], dp[i + 2][0] + abs(a[i] - a[i - 1])); if (i - 2 >= 0) dp[i][0] = dp[i + 1][1] + abs(a[i] - a[i - 2]); if (i + 2 <= n && i - 2 >= 0) dp[i][0] = min(dp[i][0], dp[i + 2][0] + abs(a[i] - a[i - 2])); } cout << dp[1][1]; }
replace
26
28
26
28
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define mod 1000000009 #define ll long long #define mp make_pair #define pb push_back #define ff first #define ss second #define set0(a) memset((a), 0, sizeof(a)) #define set1(a) memset((a), -1, sizeof(a)) #define pi pair<int, int> #define ps pair<string, string> #define pl pair<long, long> #define pll pair<long long, long long> #define vll vector<long long> #define vl vector<long> #define vi vector<int> #define vs vector<string> #define vps vector<ps> #define vpi vector<pi> #define vpl vector<pl> #define vpll vector<pll> #define flash \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); #define tc(t, T) for (long long t = 0; t < T; t++) #define rep(i, s, n, d) for (long long i = s; i < n; i = i + d) #define meax 100007 vll a(meax, 0); vll b(meax, meax); ll sum1 = 0; ll maximize(ll i, ll n, ll prev) { if (b[i] != meax) { return b[i]; } if (i >= n) { return meax; } if (i == n - 1) { b[i] = 0; return b[i]; } ll d1 = maximize(i + 1, n, a[i]); ll d2 = maximize(i + 2, n, a[i]); b[i] = min(abs(a[i] - a[i + 1]) + d1, abs(a[i + 2] - a[i]) + d2); } int main() { ll n; cin >> n; rep(i, 0, n, 1) { cin >> a[i]; } ll d = maximize(0, n, a[0]); cout << d << endl; }
#include <bits/stdc++.h> using namespace std; #define mod 1000000009 #define ll long long #define mp make_pair #define pb push_back #define ff first #define ss second #define set0(a) memset((a), 0, sizeof(a)) #define set1(a) memset((a), -1, sizeof(a)) #define pi pair<int, int> #define ps pair<string, string> #define pl pair<long, long> #define pll pair<long long, long long> #define vll vector<long long> #define vl vector<long> #define vi vector<int> #define vs vector<string> #define vps vector<ps> #define vpi vector<pi> #define vpl vector<pl> #define vpll vector<pll> #define flash \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); #define tc(t, T) for (long long t = 0; t < T; t++) #define rep(i, s, n, d) for (long long i = s; i < n; i = i + d) #define meax 100007 vll a(meax, 0); vll b(meax, meax); ll sum1 = 0; ll maximize(ll i, ll n, ll prev) { if (b[i] != meax) { return b[i]; } if (i >= n) { return meax; } if (i == n - 1) { b[i] = 0; return b[i]; } ll d1 = maximize(i + 1, n, a[i]); ll d2 = maximize(i + 2, n, a[i]); b[i] = min(abs(a[i] - a[i + 1]) + d1, abs(a[i + 2] - a[i]) + d2); return b[i]; } int main() { ll n; cin >> n; rep(i, 0, n, 1) { cin >> a[i]; } ll d = maximize(0, n, a[0]); cout << d << endl; }
insert
47
47
47
48
0
p03160
C++
Time Limit Exceeded
/* TASK: nocows LANG: C++14 */ #include "bits/stdc++.h" typedef long long ll; typedef long double ld; using namespace std; #define finish(x) return cout << x, 0; void setIn(string s) { freopen(s.c_str(), "r", stdin); } void setOut(string s) { freopen(s.c_str(), "w", stdout); } const string USCAO_TAG = "nocows"; void usaco() { setIn(USCAO_TAG + ".in"); setOut(USCAO_TAG + ".out"); } /* template<typename... Args> void print(Args... args) { ((std::cout << args << " "), ...); } */ ll a[100001]; ll dp[100001][101]; int main() { // usaco(); #ifndef ONLINE_JUDGE // setIn("in.txt"); #endif int n, k; cin >> n; k = 2; memset(dp, 0x3f3f3f3f, sizeof dp); for (int i = 1; i <= n; i++) cin >> a[i]; a[0] = a[1]; for (int i = k; i >= 1; i--) { dp[n][i] = abs(a[n] - a[n - i]); } for (int i = n - 1; i >= 1; i--) { for (int j = 1; i - j >= 0; j++) { for (int q = 1; q <= n - i && q <= 2; q++) dp[i][j] = min(dp[i][j], dp[i + q][q] + abs(a[i] - a[i - j])); } } ll mn = 1e9; for (int i = 1; i <= k; i++) { mn = min(mn, dp[1][i]); } cout << mn; }
/* TASK: nocows LANG: C++14 */ #include "bits/stdc++.h" typedef long long ll; typedef long double ld; using namespace std; #define finish(x) return cout << x, 0; void setIn(string s) { freopen(s.c_str(), "r", stdin); } void setOut(string s) { freopen(s.c_str(), "w", stdout); } const string USCAO_TAG = "nocows"; void usaco() { setIn(USCAO_TAG + ".in"); setOut(USCAO_TAG + ".out"); } /* template<typename... Args> void print(Args... args) { ((std::cout << args << " "), ...); } */ ll a[100001]; ll dp[100001][101]; int main() { // usaco(); #ifndef ONLINE_JUDGE // setIn("in.txt"); #endif int n, k; cin >> n; k = 2; memset(dp, 0x3f3f3f3f, sizeof dp); for (int i = 1; i <= n; i++) cin >> a[i]; a[0] = a[1]; for (int i = k; i >= 1; i--) { dp[n][i] = abs(a[n] - a[n - i]); } for (int i = n - 1; i >= 1; i--) { for (int j = 1; i - j >= 0 && j <= 2; j++) { for (int q = 1; q <= n - i && q <= 2; q++) dp[i][j] = min(dp[i][j], dp[i + q][q] + abs(a[i] - a[i - j])); } } ll mn = 1e9; for (int i = 1; i <= k; i++) { mn = min(mn, dp[1][i]); } cout << mn; }
replace
50
51
50
51
TLE
p03160
C++
Runtime Error
#include <iostream> using namespace std; int findMin(int h[], int n) { int cost[n]; cost[0] = 0; cost[1] = abs(h[0] - h[1]); for (int i = 2; i < n; i++) cost[i] = min(cost[i - 1] + abs(h[i] - h[i - 1]), cost[i - 2] + abs(h[i] - h[i - 2])); return cost[n - 1]; } int main() { int n; int h[10000]; cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << findMin(h, n) << endl; }
#include <iostream> using namespace std; int findMin(int h[], int n) { int cost[n]; cost[0] = 0; cost[1] = abs(h[0] - h[1]); for (int i = 2; i < n; i++) cost[i] = min(cost[i - 1] + abs(h[i] - h[i - 1]), cost[i - 2] + abs(h[i] - h[i - 2])); return cost[n - 1]; } int main() { int n; int h[100000]; cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << findMin(h, n) << endl; }
replace
17
18
17
18
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int n, h[10000], dp[10000]; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } dp[0] = 0; dp[1] = abs(h[0] - h[1]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1])); } cout << dp[n - 1] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n, h[100000], dp[100000]; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } dp[0] = 0; dp[1] = abs(h[0] - h[1]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1])); } cout << dp[n - 1] << endl; return 0; }
replace
4
5
4
5
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define fastio \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) #define lli long long int #define pb push_back #define mp make_pair #define fi first #define se second #define pii pair<int, int> #define all(x) (x).begin(), (x).end() #define forn(i, n) for (int i = 0; i < n; ++i) #define rforn(i, start) for (int i = start; i >= 0; --i) #define forsn(i, start, end) for (int i = start; i < end; ++i) #define rforsn(i, start, end) for (int i = start; i >= end; --i) #define debug(x) cout << #x << " = " << x << "\n"; const int CONST = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); // freopen("output.txt","w",stdout); #endif int n; cin >> n; int ht[n]; forn(i, n) { cin >> ht[i]; } int dp[n]; dp[n - 1] = 0; rforsn(i, n - 2, 0) { dp[i] = INT_MAX; for (int j = 1; j <= 2 && (i + j) < n; ++j) { dp[i] = min(dp[i + j] + abs(ht[i + j] - ht[i]), dp[i]); } } cout << dp[0]; return 0; }
#include <bits/stdc++.h> using namespace std; #define fastio \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) #define lli long long int #define pb push_back #define mp make_pair #define fi first #define se second #define pii pair<int, int> #define all(x) (x).begin(), (x).end() #define forn(i, n) for (int i = 0; i < n; ++i) #define rforn(i, start) for (int i = start; i >= 0; --i) #define forsn(i, start, end) for (int i = start; i < end; ++i) #define rforsn(i, start, end) for (int i = start; i >= end; --i) #define debug(x) cout << #x << " = " << x << "\n"; const int CONST = 1e9 + 7; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt","w",stdout); #endif int n; cin >> n; int ht[n]; forn(i, n) { cin >> ht[i]; } int dp[n]; dp[n - 1] = 0; rforsn(i, n - 2, 0) { dp[i] = INT_MAX; for (int j = 1; j <= 2 && (i + j) < n; ++j) { dp[i] = min(dp[i + j] + abs(ht[i + j] - ht[i]), dp[i]); } } cout << dp[0]; return 0; }
replace
27
28
27
28
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define ll long long const int p = 10e5 + 5; int h[p], dp[p]; 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; for (int i = 1; i <= n; i++) { cin >> h[i]; dp[i] = 10e5; } dp[0] = 0; dp[1] = 0; dp[2] = abs(h[1] - h[2]); 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]; return 0; }
#include <bits/stdc++.h> using namespace std; #define ll long long const int p = 10e5 + 5; int h[p], dp[p]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> h[i]; dp[i] = 10e5; } dp[0] = 0; dp[1] = 0; dp[2] = abs(h[1] - h[2]); 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]; return 0; }
delete
6
10
6
6
0
p03160
C++
Runtime Error
#include <cstdlib> #include <cstring> #include <iostream> using namespace std; typedef long long ll; ll dp[10009]; int arr[100009]; ll sum = 0; long long Frog1(int n) { if (n == 0) return 0; else if (n == 1) return abs(arr[n] - arr[n - 1]); if (dp[n] != -1) return dp[n]; else { ll x = Frog1(n - 1); ll y = Frog1(n - 2); dp[n] = min(abs(arr[n - 1] - arr[n]) + x, abs(arr[n - 2] - arr[n]) + y); // cout << n << " = " << dp[n] << endl; return dp[n]; } } int main() { int n; memset(dp, -1, sizeof(dp)); cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; cout << Frog1(n - 1) << endl; }
#include <cstdlib> #include <cstring> #include <iostream> using namespace std; typedef long long ll; ll dp[100009]; int arr[100009]; ll sum = 0; long long Frog1(int n) { if (n == 0) return 0; else if (n == 1) return abs(arr[n] - arr[n - 1]); if (dp[n] != -1) return dp[n]; else { ll x = Frog1(n - 1); ll y = Frog1(n - 2); dp[n] = min(abs(arr[n - 1] - arr[n]) + x, abs(arr[n - 2] - arr[n]) + y); // cout << n << " = " << dp[n] << endl; return dp[n]; } } int main() { int n; memset(dp, -1, sizeof(dp)); cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; cout << Frog1(n - 1) << endl; }
replace
5
6
5
6
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #define l(i, a, b) for (auto i = a; i < b; i++) #define lr(i, a, b) for (auto i = a; i >= b; i--) #define ll long long #define lli long long int #define ld long double #define vec vector<int> #define mii map<ll, ll> #define vl vector<long long> #define se set<long long int> #define pi pair<long long, long long> #define pb push_back #define mp make_pair #define ft first #define sd second #define all(v) v.begin(), v.end() #define in(x) cin >> x #define o(x) cout << x #define SYNC \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); using namespace std; int ar[200000], dp[200000], n; int solve(int i) { dp[i] = min(abs(ar[i] - ar[i - 1]) + dp[i - 1], abs(ar[n] - ar[i - 2]) + dp[i - 2]); if (i == n || i == 1 || i == 2) return dp[n]; solve(i + 1); } int main() { SYNC in(n); l(i, 1, n + 1) in(ar[i]); dp[1] = 0; dp[2] = abs(ar[1] - ar[2]); o(solve(3)); }
#include <bits/stdc++.h> #define l(i, a, b) for (auto i = a; i < b; i++) #define lr(i, a, b) for (auto i = a; i >= b; i--) #define ll long long #define lli long long int #define ld long double #define vec vector<int> #define mii map<ll, ll> #define vl vector<long long> #define se set<long long int> #define pi pair<long long, long long> #define pb push_back #define mp make_pair #define ft first #define sd second #define all(v) v.begin(), v.end() #define in(x) cin >> x #define o(x) cout << x #define SYNC \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); using namespace std; int ar[200000], dp[200000], n; int solve(int i) { dp[i] = min(abs(ar[i] - ar[i - 1]) + dp[i - 1], abs(ar[i] - ar[i - 2]) + dp[i - 2]); if (i == n || n == 1 || n == 2) return dp[n]; solve(i + 1); } int main() { SYNC in(n); l(i, 1, n + 1) in(ar[i]); dp[1] = 0; dp[2] = abs(ar[1] - ar[2]); o(solve(3)); }
replace
26
28
26
28
0
p03160
C++
Runtime Error
// Code by : Abhishek Tiwari // codechef.com/users/devil_within || hackerearth.com/@devil_within #include <bits/stdc++.h> #define fio \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); #define int long long int #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define mp make_pair #define pb push_back #define pf push_front #define pii pair<int, int> #define ff first #define ss second #define mod 1000000007 #define gcd __gcd #define lcm(a, b) ((a) * (b)) / gcd(a, b) using namespace std; /*******************************************************************************************/ /*******************************************************************************************/ template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << "["; for (int i = 0; i < v.size() - 1; ++i) os << v[i] << ", "; os << v[v.size() - 1] << "]\n"; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << "{"; for (auto it : v) { os << it; if (it != *v.rbegin()) os << ", "; } os << "}\n"; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &v) { os << "{"; for (auto it : v) { os << "(" << it.first << " : " << it.second << ")"; if (it != *v.rbegin()) os << ", "; } os << "}\n"; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const pair<T, S> &v) { os << "("; os << v.first << ", " << v.second << ")"; return os; } /*******************************************************************************************/ /*******************************************************************************************/ int fpow(int x, int y, int p); int32_t main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); freopen("error.txt", "w", stderr); #endif fio; int tcases = 1; // cin>>testcases; for (int tcase = 1; tcase <= tcases; ++tcase) { int n; cin >> n; int a[n]; FOR(i, 0, n) cin >> a[i]; vector<int> dp(n, mod); dp[0] = 0; for (int i = 0; i < n; ++i) { if (i + 1 < n) dp[i + 1] = min(dp[i + 1], abs(a[i] - a[i + 1]) + dp[i]); if (i + 2 < n) dp[i + 2] = min(dp[i + 2], abs(a[i] - a[i + 2]) + dp[i]); } cout << dp[n - 1] << "\n"; // cout<<"Case #"<<tcase<<": "; } return 0; } // Functions int fpow(int x, int y, int p) { int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; }
// Code by : Abhishek Tiwari // codechef.com/users/devil_within || hackerearth.com/@devil_within #include <bits/stdc++.h> #define fio \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); #define int long long int #define FOR(i, a, b) for (int i = (a); i < (b); ++i) #define mp make_pair #define pb push_back #define pf push_front #define pii pair<int, int> #define ff first #define ss second #define mod 1000000007 #define gcd __gcd #define lcm(a, b) ((a) * (b)) / gcd(a, b) using namespace std; /*******************************************************************************************/ /*******************************************************************************************/ template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << "["; for (int i = 0; i < v.size() - 1; ++i) os << v[i] << ", "; os << v[v.size() - 1] << "]\n"; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { os << "{"; for (auto it : v) { os << it; if (it != *v.rbegin()) os << ", "; } os << "}\n"; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &v) { os << "{"; for (auto it : v) { os << "(" << it.first << " : " << it.second << ")"; if (it != *v.rbegin()) os << ", "; } os << "}\n"; return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const pair<T, S> &v) { os << "("; os << v.first << ", " << v.second << ")"; return os; } /*******************************************************************************************/ /*******************************************************************************************/ int fpow(int x, int y, int p); int32_t main() { #ifndef ONLINE_JUDGE // freopen("input.txt" , "r" , stdin);freopen("output.txt" , "w" , // stdout);freopen("error.txt" , "w" , stderr); #endif fio; int tcases = 1; // cin>>testcases; for (int tcase = 1; tcase <= tcases; ++tcase) { int n; cin >> n; int a[n]; FOR(i, 0, n) cin >> a[i]; vector<int> dp(n, mod); dp[0] = 0; for (int i = 0; i < n; ++i) { if (i + 1 < n) dp[i + 1] = min(dp[i + 1], abs(a[i] - a[i + 1]) + dp[i]); if (i + 2 < n) dp[i + 2] = min(dp[i + 2], abs(a[i] - a[i + 2]) + dp[i]); } cout << dp[n - 1] << "\n"; // cout<<"Case #"<<tcase<<": "; } return 0; } // Functions int fpow(int x, int y, int p) { int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; }
replace
62
65
62
64
-11
p03160
C++
Runtime Error
#include <cstring> #include <iostream> using namespace std; const int MAXN = 10010; int h[MAXN], dp[MAXN]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; memset(dp, 0xff, sizeof(dp)); dp[0] = 0; for (int i = 0; i < n; i++) { if (dp[i + 1] == -1 || dp[i + 1] > dp[i] + abs(h[i] - h[i + 1])) dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]); if (dp[i + 2] == -1 || dp[i + 2] > dp[i] + abs(h[i] - h[i + 2])) dp[i + 2] = dp[i] + abs(h[i] - h[i + 2]); } cout << dp[n - 1] << endl; return 0; }
#include <cstring> #include <iostream> using namespace std; const int MAXN = 100010; int h[MAXN], dp[MAXN]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; memset(dp, 0xff, sizeof(dp)); dp[0] = 0; for (int i = 0; i < n; i++) { if (dp[i + 1] == -1 || dp[i + 1] > dp[i] + abs(h[i] - h[i + 1])) dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]); if (dp[i + 2] == -1 || dp[i + 2] > dp[i] + abs(h[i] - h[i + 2])) dp[i + 2] = dp[i] + abs(h[i] - h[i + 2]); } cout << dp[n - 1] << endl; return 0; }
replace
4
5
4
5
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb push_back #define f first #define s second int dp[10000]; int main() { cin.tie(0); ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) { cin >> h[i]; dp[i] = 1e9; } dp[0] = 0; for (int i = 0; i < n - 1; i++) { if (i != n - 2) dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i])); dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i])); } cout << dp[n - 1]; }
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb push_back #define f first #define s second int dp[1000000]; int main() { cin.tie(0); ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) { cin >> h[i]; dp[i] = 1e9; } dp[0] = 0; for (int i = 0; i < n - 1; i++) { if (i != n - 2) dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i])); dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i])); } cout << dp[n - 1]; }
replace
7
8
7
8
0
p03160
C++
Runtime Error
#include <cmath> #include <iostream> using namespace std; int a[50], arr[50], n; int topdown(int x); int main() { int ans; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 0; i < n; i++) { a[i] = -1; } ans = topdown(0); cout << ans; return 0; } int topdown(int x) { if (a[x] != -1) { return a[x]; } if (x == n - 3 || x == n - 2) { a[x] = abs(arr[n - 1] - arr[x]); return a[x]; } int q; q = min(topdown(x + 1) + abs(arr[x + 1] - arr[x]), topdown(x + 2) + abs(arr[x + 2] - arr[x])); a[x] = q; return q; }
#include <cmath> #include <iostream> using namespace std; int a[100000], arr[100000], n; int topdown(int x); int main() { int ans; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; } for (int i = 0; i < n; i++) { a[i] = -1; } ans = topdown(0); cout << ans; return 0; } int topdown(int x) { if (a[x] != -1) { return a[x]; } if (x == n - 3 || x == n - 2) { a[x] = abs(arr[n - 1] - arr[x]); return a[x]; } int q; q = min(topdown(x + 1) + abs(arr[x + 1] - arr[x]), topdown(x + 2) + abs(arr[x + 2] - arr[x])); a[x] = q; return q; }
replace
3
4
3
4
0
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; int INF = 0x3f3f3f3f; ; vector<int> h(1e5 + 10); vector<int> dp(1e5 + 10, INF); int dfs(int j) { if (j <= 0) return 0; if (j == 1) { return abs(h[1] - h[0]); } if (j == 2) { return abs(h[2] - h[0]); } if (dp[j] != INF) return dp[j]; return min(abs(h[j] - h[j - 1]) + dfs(j - 1), abs(h[j] - h[j - 2]) + dfs(j - 2)); } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } cout << dfs(n - 1) << '\n'; }
#include <bits/stdc++.h> using namespace std; int INF = 0x3f3f3f3f; ; vector<int> h(1e5 + 10); vector<int> dp(1e5 + 10, INF); int dfs(int j) { if (j <= 0) return 0; if (j == 1) { return abs(h[1] - h[0]); } if (j == 2) { return abs(h[2] - h[0]); } if (dp[j] != INF) return dp[j]; dp[j] = min(abs(h[j] - h[j - 1]) + dfs(j - 1), abs(h[j] - h[j - 2]) + dfs(j - 2)); return dp[j]; } int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } cout << dfs(n - 1) << '\n'; }
replace
19
21
19
22
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) int main() { int N; vector<int> h(10010); vector<int> dp(10010); int res = 0; cin >> N; rep(i, N) { cin >> h.at(i); } dp.at(1) = abs(h.at(1) - h.at(0)); for (int i = 2; i < N; i++) { dp.at(i) = min(dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2))); } cout << dp.at(N - 1) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) int main() { int N; vector<int> h(100010); vector<int> dp(100010); int res = 0; cin >> N; rep(i, N) { cin >> h.at(i); } dp.at(1) = abs(h.at(1) - h.at(0)); for (int i = 2; i < N; i++) { dp.at(i) = min(dp.at(i - 1) + abs(h.at(i) - h.at(i - 1)), dp.at(i - 2) + abs(h.at(i) - h.at(i - 2))); } cout << dp.at(N - 1) << endl; return 0; }
replace
6
8
6
8
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; long long ans[10005], h[10005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; memset(ans, 63, sizeof(ans)); ans[0] = 0; ans[1] = fabs(h[1] - h[0]); for (int i = 2; i < n; i++) ans[i] = min(ans[i - 2] + fabs(h[i - 2] - h[i]), ans[i - 1] + fabs(h[i - 1] - h[i])); cout << ans[n - 1]; }
#include <bits/stdc++.h> using namespace std; long long ans[100005], h[100005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; memset(ans, 63, sizeof(ans)); ans[0] = 0; ans[1] = fabs(h[1] - h[0]); for (int i = 2; i < n; i++) ans[i] = min(ans[i - 2] + fabs(h[i - 2] - h[i]), ans[i - 1] + fabs(h[i - 1] - h[i])); cout << ans[n - 1]; }
replace
2
3
2
3
0
p03160
C++
Runtime Error
// #define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; #define uint unsigned int #define ull unsigned long long typedef string str; typedef long long ll; typedef double db; typedef pair<int, int> pii; typedef map<int, int> mii; typedef vector<int> vi; typedef vector<bool> vb; #define pb push_back #define fi first #define se second #define in insert #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define speed \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) const int INF = 1e9 + 5; const int N = 2e5 + 123; int main() { speed; int n; cin >> n; vi v(n); vi dp(n + 1, 0); for (int i = 1; i <= n; ++i) { cin >> v[i]; } dp[1] = 0; dp[2] = abs(v[2] - v[1]); for (int i = 3; i <= n; ++i) { dp[i] = min(dp[i - 2] + abs(v[i] - v[i - 2]), dp[i - 1] + abs(v[i] - v[i - 1])); } cout << dp[n]; }
// #define _GLIBCXX_DEBUG #include <bits/stdc++.h> using namespace std; #define uint unsigned int #define ull unsigned long long typedef string str; typedef long long ll; typedef double db; typedef pair<int, int> pii; typedef map<int, int> mii; typedef vector<int> vi; typedef vector<bool> vb; #define pb push_back #define fi first #define se second #define in insert #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define speed \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) const int INF = 1e9 + 5; const int N = 2e5 + 123; int main() { speed; int n; cin >> n; vi v(n + 1); vi dp(n + 1, 0); for (int i = 1; i <= n; ++i) { cin >> v[i]; } dp[1] = 0; dp[2] = abs(v[2] - v[1]); for (int i = 3; i <= n; ++i) { dp[i] = min(dp[i - 2] + abs(v[i] - v[i - 2]), dp[i - 1] + abs(v[i] - v[i - 1])); } cout << dp[n]; }
replace
28
29
28
29
0
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> #include <iostream> using namespace std; int a[100001]; int fib(int i, int n, int arr[]) { if (i == n - 1) { return 0; } int p = INT_MAX, q = INT_MAX; if (i + 2 <= n - 1) { p = fib(i + 2, n, arr) + abs(arr[i] - arr[i + 2]); } if (i + 1 <= n - 1) { q = fib(i + 1, n, arr) + abs(arr[i] - arr[i + 1]); } a[i] = min(p, q); return a[i]; } int main() { int n; cin >> n; int arr[n]; memset(a, -1, sizeof(a)); a[n - 1] = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; } cout << fib(0, n, arr) << endl; }
#include <bits/stdc++.h> #include <iostream> using namespace std; int a[100001]; int fib(int i, int n, int arr[]) { if (i == n - 1) { return 0; } int p = INT_MAX, q = INT_MAX; if (a[i] != -1) { return a[i]; } if (i + 2 <= n - 1) { p = fib(i + 2, n, arr) + abs(arr[i] - arr[i + 2]); } if (i + 1 <= n - 1) { q = fib(i + 1, n, arr) + abs(arr[i] - arr[i + 1]); } a[i] = min(p, q); return a[i]; } int main() { int n; cin >> n; int arr[n]; memset(a, -1, sizeof(a)); a[n - 1] = 0; for (int i = 0; i < n; i++) { cin >> arr[i]; } cout << fib(0, n, arr) << endl; }
insert
9
9
9
12
TLE
p03160
C++
Runtime Error
#include "algorithm" #include "cstring" #include "ctime" #include "iostream" #include "map" #include "math.h" #include "numeric" #include "queue" #include "set" #include "stack" #include "string" #include "vector" #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/detail/standard_policies.hpp> #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update using namespace std; using namespace __gnu_pbds; #define f first #define lgn 25 #define endl '\n' #define sc second #define N (int)2e5 + 5 #define pb push_back #define mod 1000000007 #define ld long double #define vi vector<int> #define eb emplace_back #define vpii vector<pii> #define mii map<int, int> #define int long long #define pii pair<int, int> #define pq priority_queue #define test(x) while (x--) #define all(x) begin(x), end(x) #define allr(x) rbegin(x), rend(x) #define fo(i, a, n) for (int i = a; i < n; i++) #define rfo(i, n, a) for (int i = n; i >= a; i--) #define db(x) cout << #x << " : " << x << endl; #define FAST \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define time() \ cerr << "Time : " << (double)clock() / (double)CLOCKS_PER_SEC << "s\n" #define PI acos(-1.0) #define bug(...) __f(#__VA_ARGS__, __VA_ARGS__) typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> OS; template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cout << name << " : " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...); } inline void INP() { #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("ou.txt", "w", stdout); #endif } const int inf = 0x3f3f3f3f; const int INF = 0x3f3f3f3f3f3f3f3f; int n, m, k, q; string s; int vis[N], dp[N], h[N]; void go() { cin >> n; fo(i, 0, n) cin >> h[i]; memset(dp, 0x3f3f3f3f, sizeof dp); dp[0] = 0; dp[1] = abs(h[0] - h[1]); fo(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; } int32_t main() { INP(); FAST; int t = 1; // cin>>t; test(t) go(); }
#include "algorithm" #include "cstring" #include "ctime" #include "iostream" #include "map" #include "math.h" #include "numeric" #include "queue" #include "set" #include "stack" #include "string" #include "vector" #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/detail/standard_policies.hpp> #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update using namespace std; using namespace __gnu_pbds; #define f first #define lgn 25 #define endl '\n' #define sc second #define N (int)2e5 + 5 #define pb push_back #define mod 1000000007 #define ld long double #define vi vector<int> #define eb emplace_back #define vpii vector<pii> #define mii map<int, int> #define int long long #define pii pair<int, int> #define pq priority_queue #define test(x) while (x--) #define all(x) begin(x), end(x) #define allr(x) rbegin(x), rend(x) #define fo(i, a, n) for (int i = a; i < n; i++) #define rfo(i, n, a) for (int i = n; i >= a; i--) #define db(x) cout << #x << " : " << x << endl; #define FAST \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define time() \ cerr << "Time : " << (double)clock() / (double)CLOCKS_PER_SEC << "s\n" #define PI acos(-1.0) #define bug(...) __f(#__VA_ARGS__, __VA_ARGS__) typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> OS; template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cout << name << " : " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...); } inline void INP() { #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("ou.txt", "w", stdout); #endif } const int inf = 0x3f3f3f3f; const int INF = 0x3f3f3f3f3f3f3f3f; int n, m, k, q; string s; int vis[N], dp[N], h[N]; void go() { cin >> n; fo(i, 0, n) cin >> h[i]; memset(dp, 0x3f3f3f3f, sizeof dp); dp[0] = 0; dp[1] = abs(h[0] - h[1]); fo(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; } int32_t main() { // INP(); FAST; int t = 1; // cin>>t; test(t) go(); }
replace
97
98
97
98
0
p03160
C++
Runtime Error
#include "bits/stdc++.h" #include <set> using namespace std; #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--) #define rep(i, n) for (int i = 0; i < (n); i++) #define rep1(i, n) for (int i = 1; i < (n); i++) #define rrep(i, n) for (int i = (n)-1; i >= 0; i--) #define all(i) (i).begin(), (i).end() #define rall(i) (i).begin(), (i).end(), greater<int>() #define int long long #define elif else if #define eb emplace_back #define pb push_back #define mp make_pair #define fst first #define sec second #define mod 1000000007 #define INF 10e10 template <typename T> void print(T x) { std::cout << x << " "; } template <typename T> void println(T x) { std::cout << x << "\n"; } int dp[10001]; signed main(void) { int n; cin >> n; vector<int> p(n); rep(i, n) { cin >> p[i]; } rep(i, 10001) { dp[i] = INF; } dp[0] = 0; dp[1] = abs(p[1] - p[0]); FOR(i, 2, n) { dp[i] = min((dp[i - 2] + abs(p[i - 2] - p[i])), (dp[i - 1] + abs(p[i - 1] - p[i]))); } print(dp[n - 1]); }
#include "bits/stdc++.h" #include <set> using namespace std; #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--) #define rep(i, n) for (int i = 0; i < (n); i++) #define rep1(i, n) for (int i = 1; i < (n); i++) #define rrep(i, n) for (int i = (n)-1; i >= 0; i--) #define all(i) (i).begin(), (i).end() #define rall(i) (i).begin(), (i).end(), greater<int>() #define int long long #define elif else if #define eb emplace_back #define pb push_back #define mp make_pair #define fst first #define sec second #define mod 1000000007 #define INF 10e10 template <typename T> void print(T x) { std::cout << x << " "; } template <typename T> void println(T x) { std::cout << x << "\n"; } int dp[100001]; signed main(void) { int n; cin >> n; vector<int> p(n); rep(i, n) { cin >> p[i]; } rep(i, 10001) { dp[i] = INF; } dp[0] = 0; dp[1] = abs(p[1] - p[0]); FOR(i, 2, n) { dp[i] = min((dp[i - 2] + abs(p[i - 2] - p[i])), (dp[i - 1] + abs(p[i - 1] - p[i]))); } print(dp[n - 1]); }
replace
30
31
30
31
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #define int long long using namespace std; int32_t main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int dp[n]; dp[0] = 0; dp[1] = abs(arr[1] - arr[0]); if (n == 2) return dp[n - 1]; 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] << "\n"; }
#include <bits/stdc++.h> #define int long long using namespace std; int32_t main() { int n; cin >> n; int arr[n]; for (int i = 0; i < n; i++) cin >> arr[i]; int dp[n]; dp[0] = 0; dp[1] = abs(arr[1] - arr[0]); if (n == 2) { cout << dp[n - 1] << "\n"; return 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] << "\n"; }
replace
12
14
12
16
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 10; int dp[N]; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } dp[0] = 0, dp[1] = abs(v[1] - v[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2])); } cout << dp[n - 1]; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; int dp[N]; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } dp[0] = 0, dp[1] = abs(v[1] - v[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2])); } cout << dp[n - 1]; }
replace
4
5
4
5
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define ld long double #define mx 200005 #define fr first #define se second #define fast \ ios_base::sync_with_stdio(false); \ cin.tie(0); \ cout.tie(0) ll dp[1005], coin[1000]; ll n; ll func(ll i) { if (i >= n) return 0; if (dp[i] != -1) return dp[i]; ll ans1 = INT_MAX, ans2 = INT_MAX; if (i + 1 <= n) ans1 = abs(coin[i] - coin[i + 1]) + func(i + 1); if (i + 2 <= n) ans2 = abs(coin[i] - coin[i + 2]) + func(i + 2); return dp[i] = min(ans1, ans2); } int main() { fast; cin >> n; memset(dp, -1, sizeof dp); for (ll i = 1; i <= n; i++) cin >> coin[i]; cout << func(1) << "\n"; return 0; }
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define ld long double #define mx 200005 #define fr first #define se second #define fast \ ios_base::sync_with_stdio(false); \ cin.tie(0); \ cout.tie(0) ll dp[100005], coin[100005]; ll n; ll func(ll i) { if (i >= n) return 0; if (dp[i] != -1) return dp[i]; ll ans1 = INT_MAX, ans2 = INT_MAX; if (i + 1 <= n) ans1 = abs(coin[i] - coin[i + 1]) + func(i + 1); if (i + 2 <= n) ans2 = abs(coin[i] - coin[i + 2]) + func(i + 2); return dp[i] = min(ans1, ans2); } int main() { fast; cin >> n; memset(dp, -1, sizeof dp); for (ll i = 1; i <= n; i++) cin >> coin[i]; cout << func(1) << "\n"; return 0; }
replace
12
13
12
13
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 __gnu_pbds; // #define ordered_set tree<ll, null_type,less<ll>, // rb_tree_tag,tree_order_statistics_node_update> // #include <boost/math/common_factor.cpp> using namespace std; #define fi first #define sec second #define mod 1000000009 #define MOD 998244353 #define mod9 1000000009 #define ll long long #define ld long double #define int long long #define pii pair<int, int> #define pll pair<ll, ll> #define pb push_back #define rep(i, a, b) for (i = a; i < (int)b; i++) #define repr(i, a, b) for (i = a; i >= (int)b; i--) #define mp make_pair #define t() \ int t; \ cin >> t; \ while (t--) #define vll vector<ll> #define setbits(x) __builtin_popcountll(x) #define all(p) p.begin(), p.end() #define N 1000000000 #define cMAXN 100 #define endl '\n' #define zro(x) __builtin_ctzll(x) // #define T pair<int, int> // #define ordered_set tree<T, null_type, less<T>, rb_tree_tag, // tree_order_statistics_node_update> #define TRACE #ifdef TRACE #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cout << name << " : " << arg1 << endl; // use cerr if u want to display at the bottom } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...); } #else #define trace(...) #endif bool isV(char x) { if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') { return 1; } return 0; } bool isP(ll n) { for (ll i = 2; i * i <= n; i++) { if (n % i == 0) return 0; } return 1; } void fio() { #ifndef ONLINE_JUDGE // for getting input from input.txt freopen("in.txt", "r", stdin); // for writing output to output.txt freopen("out.txt", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); } void print(int *a, int n) { int i; rep(i, 0, n) { cout << a[i] << " "; } cout << endl; } void print2d(int a[][1000], int m, int n) { int i, j; rep(i, 0, m) { rep(j, 0, n) { cout << setw(2) << a[i][j]; } cout << endl; } } /*bool comp(pii i1, pii i2) { //For Ascending Order (i1.fi < i2.sec) if(i1.sec == i2.sec) return (i1.fi > i2.fi); return (i1.sec > i2.sec); }*/ // All Functions below this // Main Function int32_t main() { fio(); int n; cin >> n; int *a = new int[n]; int i; rep(i, 0, n) { cin >> a[i]; } int *d = new int[n]; d[0] = 0, d[1] = abs(a[1] - a[0]); rep(i, 2, n) { d[i] = min(d[i - 1] + abs(a[i] - a[i - 1]), d[i - 2] + abs(a[i] - a[i - 2])); } cout << d[n - 1] << endl; }
#include "bits/stdc++.h" // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; // #define ordered_set tree<ll, null_type,less<ll>, // rb_tree_tag,tree_order_statistics_node_update> // #include <boost/math/common_factor.cpp> using namespace std; #define fi first #define sec second #define mod 1000000009 #define MOD 998244353 #define mod9 1000000009 #define ll long long #define ld long double #define int long long #define pii pair<int, int> #define pll pair<ll, ll> #define pb push_back #define rep(i, a, b) for (i = a; i < (int)b; i++) #define repr(i, a, b) for (i = a; i >= (int)b; i--) #define mp make_pair #define t() \ int t; \ cin >> t; \ while (t--) #define vll vector<ll> #define setbits(x) __builtin_popcountll(x) #define all(p) p.begin(), p.end() #define N 1000000000 #define cMAXN 100 #define endl '\n' #define zro(x) __builtin_ctzll(x) // #define T pair<int, int> // #define ordered_set tree<T, null_type, less<T>, rb_tree_tag, // tree_order_statistics_node_update> #define TRACE #ifdef TRACE #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char *name, Arg1 &&arg1) { cout << name << " : " << arg1 << endl; // use cerr if u want to display at the bottom } template <typename Arg1, typename... Args> void __f(const char *names, Arg1 &&arg1, Args &&...args) { const char *comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1 << " | "; __f(comma + 1, args...); } #else #define trace(...) #endif bool isV(char x) { if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u') { return 1; } return 0; } bool isP(ll n) { for (ll i = 2; i * i <= n; i++) { if (n % i == 0) return 0; } return 1; } void fio() { #ifndef ONLINE_JUDGE // for getting input from input.txt freopen("in.txt", "r", stdin); // for writing output to output.txt freopen("out.txt", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0); } void print(int *a, int n) { int i; rep(i, 0, n) { cout << a[i] << " "; } cout << endl; } void print2d(int a[][1000], int m, int n) { int i, j; rep(i, 0, m) { rep(j, 0, n) { cout << setw(2) << a[i][j]; } cout << endl; } } /*bool comp(pii i1, pii i2) { //For Ascending Order (i1.fi < i2.sec) if(i1.sec == i2.sec) return (i1.fi > i2.fi); return (i1.sec > i2.sec); }*/ // All Functions below this // Main Function int32_t main() { // fio(); int n; cin >> n; int *a = new int[n]; int i; rep(i, 0, n) { cin >> a[i]; } int *d = new int[n]; d[0] = 0, d[1] = abs(a[1] - a[0]); rep(i, 2, n) { d[i] = min(d[i - 1] + abs(a[i] - a[i - 1]), d[i - 2] + abs(a[i] - a[i - 2])); } cout << d[n - 1] << endl; }
replace
107
108
107
108
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Runtime Error
#include <bits/stdc++.h> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // #include <ext/pb_ds/detail/standard_policies.hpp> using namespace std; // using namespace __gnu_pbds; #define int ll #define endl "\n" #define pb push_back #define mp make_pair #define ff first #define ss second #define all(c) c.begin(), c.end() #define vi vector<int> #define pii pair<int, int> #define For(i, s, e) for (ll i = (s); i < (e); i++) #define MAX 500005 #define initialize(arr, elem) memset(arr, elem, sizeof(arr)) typedef long long ll; // typedef tree< int, null_type, less<int>, rb_tree_tag, // tree_order_statistics_node_update> ordered_set; int memo[MAX], arr[MAX]; int k = 2; int solve(int i) { if (memo[i] != -1) return memo[i]; if (i == 1) return memo[i] = 0; int dp = 100000000000000; for (int j = i - 1; j >= i - k && j > 0; j--) { dp = min(dp, solve(j) + abs(arr[i] - arr[j])); } return memo[i] = dp; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int n; cin >> n; initialize(memo, -1); For(i, 1, n + 1) cin >> arr[i]; cout << solve(n) << endl; // For(i,1,3) cout<<memo[i]<<" "; return 0; }
#include <bits/stdc++.h> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // #include <ext/pb_ds/detail/standard_policies.hpp> using namespace std; // using namespace __gnu_pbds; #define int ll #define endl "\n" #define pb push_back #define mp make_pair #define ff first #define ss second #define all(c) c.begin(), c.end() #define vi vector<int> #define pii pair<int, int> #define For(i, s, e) for (ll i = (s); i < (e); i++) #define MAX 500005 #define initialize(arr, elem) memset(arr, elem, sizeof(arr)) typedef long long ll; // typedef tree< int, null_type, less<int>, rb_tree_tag, // tree_order_statistics_node_update> ordered_set; int memo[MAX], arr[MAX]; int k = 2; int solve(int i) { if (memo[i] != -1) return memo[i]; if (i == 1) return memo[i] = 0; int dp = 100000000000000; for (int j = i - 1; j >= i - k && j > 0; j--) { dp = min(dp, solve(j) + abs(arr[i] - arr[j])); } return memo[i] = dp; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); // #endif int n; cin >> n; initialize(memo, -1); For(i, 1, n + 1) cin >> arr[i]; cout << solve(n) << endl; // For(i,1,3) cout<<memo[i]<<" "; return 0; }
replace
43
47
43
47
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i) #define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i) #define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--) #define rreps(i, n) for (int i = ((int)(n)); i > 0; i--) #define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i) #define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i) #define FOR(e, c) for (auto &e : c) #define SORT(v, n) sort(v, v + n); #define vsort(v) sort(v.begin(), v.end()); #define rvisort(v) sort(v.begin(), v.end(), greater<int>()); #define all(v) v.begin(), v.end() #define mp(n, m) make_pair(n, m); #define cout(d) cout << d << endl; #define coutd(d) cout << std::setprecision(10) << d << endl; #define cinline(n) getline(cin, n); #define replace_all(s, b, a) replace(s.begin(), s.end(), b, a); // #define int long long #define PI (acos(-1)) #define FILL(v, n, x) fill(v, v + n, x); #define sz(x) int(x.size()) using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using vll = vector<ll>; using vvll = vector<vll>; using pii = pair<int, int>; using ul = unsigned long; 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; } ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; } ll LCM(ll a, ll b) { return a / GCD(a, b) * b; } const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1}; const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}; inline bool inside(int y, int x, int H, int W) { return (y >= 0 && x >= 0 && y < H && x < W); } const int INF = 1e9; const int MOD = 1e9 + 7; const ll LINF = 1e18; int dp[10100]; signed main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vi a(n); rep(i, n) cin >> a[i]; dp[0] = 0; dp[1] = abs(a[0] - a[1]); irep(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> using namespace std; #define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i) #define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i) #define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--) #define rreps(i, n) for (int i = ((int)(n)); i > 0; i--) #define irep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i) #define ireps(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i) #define FOR(e, c) for (auto &e : c) #define SORT(v, n) sort(v, v + n); #define vsort(v) sort(v.begin(), v.end()); #define rvisort(v) sort(v.begin(), v.end(), greater<int>()); #define all(v) v.begin(), v.end() #define mp(n, m) make_pair(n, m); #define cout(d) cout << d << endl; #define coutd(d) cout << std::setprecision(10) << d << endl; #define cinline(n) getline(cin, n); #define replace_all(s, b, a) replace(s.begin(), s.end(), b, a); // #define int long long #define PI (acos(-1)) #define FILL(v, n, x) fill(v, v + n, x); #define sz(x) int(x.size()) using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using vll = vector<ll>; using vvll = vector<vll>; using pii = pair<int, int>; using ul = unsigned long; 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; } ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; } ll LCM(ll a, ll b) { return a / GCD(a, b) * b; } const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1}; const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}; inline bool inside(int y, int x, int H, int W) { return (y >= 0 && x >= 0 && y < H && x < W); } const int INF = 1e9; const int MOD = 1e9 + 7; const ll LINF = 1e18; int dp[101000]; signed main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vi a(n); rep(i, n) cin >> a[i]; dp[0] = 0; dp[1] = abs(a[0] - a[1]); irep(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
61
62
61
62
0
p03160
C++
Runtime Error
#include <memory.h> #include <stdio.h> int max(int a, int b) { if (a > b) return a; return b; } int min(int a, int b) { if (a < b) return a; return b; } int abs(int a) { if (a < 0) return -a; return a; } int h[10000]; int dp[10000]; int main() { int N; // freopen("input.txt", "r", stdin); while (scanf("%d", &N) != EOF) { memset(dp, 0, sizeof(dp)); for (int i = 0; i < N; i++) { scanf("%d", &h[i]); int pre1 = max(0, i - 1); int pre2 = max(0, i - 2); dp[i] = min(dp[pre1] + abs(h[i] - h[pre1]), dp[pre2] + abs(h[i] - h[pre2])); } printf("%d\n", dp[N - 1]); } return 0; }
#include <memory.h> #include <stdio.h> int max(int a, int b) { if (a > b) return a; return b; } int min(int a, int b) { if (a < b) return a; return b; } int abs(int a) { if (a < 0) return -a; return a; } int h[100000]; int dp[100000]; int main() { int N; // freopen("input.txt", "r", stdin); while (scanf("%d", &N) != EOF) { memset(dp, 0, sizeof(dp)); for (int i = 0; i < N; i++) { scanf("%d", &h[i]); int pre1 = max(0, i - 1); int pre2 = max(0, i - 2); dp[i] = min(dp[pre1] + abs(h[i] - h[pre1]), dp[pre2] + abs(h[i] - h[pre2])); } printf("%d\n", dp[N - 1]); } return 0; }
replace
17
19
17
19
0
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int mem[MAXN], a[MAXN]; int n; int solve(int i) { if (i == n - 1) return 0; if (i >= n) return 1e9; int &ret = mem[i]; if (ret != -1) return ret; int c1 = 1e9, c2 = 1e9; if (i + 1 < n) c1 = solve(i + 1) + abs(a[i] - a[i + 1]); if (i + 2 < n) c2 = solve(i + 2) + abs(a[i] - a[i + 2]); return min(c1, c2); } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; memset(mem, -1, sizeof(mem)); cout << solve(0); }
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 5; int mem[MAXN], a[MAXN]; int n; int solve(int i) { if (i == n - 1) return 0; if (i >= n) return 1e9; int &ret = mem[i]; if (ret != -1) return ret; int c1 = 1e9, c2 = 1e9; if (i + 1 < n) c1 = solve(i + 1) + abs(a[i] - a[i + 1]); if (i + 2 < n) c2 = solve(i + 2) + abs(a[i] - a[i + 2]); ret = min(c1, c2); return ret; } int main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; memset(mem, -1, sizeof(mem)); cout << solve(0); }
replace
21
22
21
23
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long a[10005], b[1005], x, y; long long n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; b[n - 1] = abs(a[n] - a[n - 1]); b[n] = 0; for (int i = n - 2; i >= 1; i--) { x = abs(a[i] - a[i + 1]) + b[i + 1]; y = abs(a[i] - a[i + 2]) + b[i + 2]; if (x >= y) b[i] = y; if (x < y) b[i] = x; } cout << b[1]; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); long a[100005], b[100005], x, y; long long n; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; b[n - 1] = abs(a[n] - a[n - 1]); b[n] = 0; for (int i = n - 2; i >= 1; i--) { x = abs(a[i] - a[i + 1]) + b[i + 1]; y = abs(a[i] - a[i + 2]) + b[i + 2]; if (x >= y) b[i] = y; if (x < y) b[i] = x; } cout << b[1]; return 0; }
replace
5
6
5
6
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; typedef long long int ll; const ll mod = 1e9 + 7; #define rep(i, a, b) for (ll i = a; i < b; i++) void swap(ll &a, ll &b) { ll t = a; a = b; b = t; } ll min(ll a, ll b) { if (a < b) return a; return b; } ll max(ll a, ll b) { if (a > b) return a; return b; } ll pow(ll a, ll b) { a %= mod; ll ans = 1; while (b > 0) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b /= 2; } return ans; } int main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); #endif ios_base ::sync_with_stdio(0); cin.tie(0); /// 1 2 3 4 .... ll n; cin >> n; ll a[n]; rep(i, 0, n) { cin >> a[i]; } vector<ll> dp(n, INT_MAX); dp[0] = 0; for (int i = 0; i < n; i++) { if (i + 1 < n) dp[i + 1] = min(dp[i + 1], abs(a[i + 1] - a[i]) + dp[i]); if (i + 2 < n) dp[i + 2] = min(dp[i + 2], abs(a[i + 2] - a[i]) + dp[i]); } cout << dp[n - 1]; }
#include <bits/stdc++.h> using namespace std; typedef long long int ll; const ll mod = 1e9 + 7; #define rep(i, a, b) for (ll i = a; i < b; i++) void swap(ll &a, ll &b) { ll t = a; a = b; b = t; } ll min(ll a, ll b) { if (a < b) return a; return b; } ll max(ll a, ll b) { if (a > b) return a; return b; } ll pow(ll a, ll b) { a %= mod; ll ans = 1; while (b > 0) { if (b & 1) ans = ans * a % mod; a = a * a % mod; b /= 2; } return ans; } int main() { // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // #endif ios_base ::sync_with_stdio(0); cin.tie(0); /// 1 2 3 4 .... ll n; cin >> n; ll a[n]; rep(i, 0, n) { cin >> a[i]; } vector<ll> dp(n, INT_MAX); dp[0] = 0; for (int i = 0; i < n; i++) { if (i + 1 < n) dp[i + 1] = min(dp[i + 1], abs(a[i + 1] - a[i]) + dp[i]); if (i + 2 < n) dp[i + 2] = min(dp[i + 2], abs(a[i + 2] - a[i]) + dp[i]); } cout << dp[n - 1]; }
replace
38
41
38
41
-11
p03160
C++
Runtime Error
#include <bits/stdc++.h> #define all(v) (v).begin(), (v).end() #define pb push_back #define sz(v) (v).size() #define debug(x) cerr << #x << "_=_" << x << "\n"; #define sum(n) ((n) * ((n) + 1) >> 1) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef pair<pair<int, int>, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<ll> vll; typedef vector<vll> vvll; typedef vector<vi> vvi; const int MAXN = 1e5 + 5; int dp[MAXN], arr[MAXN]; int f(int i) { if (i == 0) return 0; if (i == 1) return abs(arr[1] - arr[0]); if (~dp[i]) return dp[i]; int ans = min(f(i - 1) + abs(arr[i] - arr[i - 1]), f(i - 2) + abs(arr[i] - arr[i - 2])); return dp[i] = ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int n; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; memset(dp, -1, sizeof dp); cout << f(n - 1) << "\n"; return 0; } /* 1 9 3 111100000 */
#include <bits/stdc++.h> #define all(v) (v).begin(), (v).end() #define pb push_back #define sz(v) (v).size() #define debug(x) cerr << #x << "_=_" << x << "\n"; #define sum(n) ((n) * ((n) + 1) >> 1) using namespace std; typedef long long ll; typedef long double ld; typedef pair<int, int> ii; typedef pair<pair<int, int>, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<ll> vll; typedef vector<vll> vvll; typedef vector<vi> vvi; const int MAXN = 1e5 + 5; int dp[MAXN], arr[MAXN]; int f(int i) { if (i == 0) return 0; if (i == 1) return abs(arr[1] - arr[0]); if (~dp[i]) return dp[i]; int ans = min(f(i - 1) + abs(arr[i] - arr[i - 1]), f(i - 2) + abs(arr[i] - arr[i - 2])); return dp[i] = ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); // #endif int n; cin >> n; for (int i = 0; i < n; i++) cin >> arr[i]; memset(dp, -1, sizeof dp); cout << f(n - 1) << "\n"; return 0; } /* 1 9 3 111100000 */
replace
37
41
37
41
-11
p03160
C++
Runtime Error
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> #include <vector> using namespace std; #define read freopen("in.in", "r", stdin) #define write freopen("out.out", "w", stdout) #define FastIO ios::sync_with_stdio(0) typedef long long ll; int n; int cost[100005]; int memo[100005]; int dp(int idx) { if (idx > n) return 9999999; if (idx == n - 1) return 0; int &ret = memo[idx]; if (ret != -1) return ret; ret = min(dp(idx + 1) + abs(cost[idx + 1] - cost[idx]), dp(idx + 2) + abs(cost[idx] - cost[idx + 2])); return ret; } int main() { FastIO; #ifndef ONLINE_JUDGE write; read; #endif memset(memo, -1, sizeof memo); cin >> n; for (int i = 0; i < n; i++) cin >> cost[i]; cout << dp(0) << endl; return 0; }
#define _CRT_SECURE_NO_WARNINGS #include <bits/stdc++.h> #include <vector> using namespace std; #define read freopen("in.in", "r", stdin) #define write freopen("out.out", "w", stdout) #define FastIO ios::sync_with_stdio(0) typedef long long ll; int n; int cost[100005]; int memo[100005]; int dp(int idx) { if (idx > n) return 9999999; if (idx == n - 1) return 0; int &ret = memo[idx]; if (ret != -1) return ret; ret = min(dp(idx + 1) + abs(cost[idx + 1] - cost[idx]), dp(idx + 2) + abs(cost[idx] - cost[idx + 2])); return ret; } int main() { FastIO; #ifndef ONLINE_JUDGE // write; read; #endif memset(memo, -1, sizeof memo); cin >> n; for (int i = 0; i < n; i++) cin >> cost[i]; cout << dp(0) << endl; return 0; }
replace
27
29
27
28
0
p03160
C++
Runtime Error
#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n], dp[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; dp[i] = 0; } dp[1] = abs(arr[0] - arr[1]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]), dp[i - 1] + abs(arr[i - 1] - arr[i])); } return dp[n - 1]; }
#include <iostream> using namespace std; int main() { int n; cin >> n; int arr[n], dp[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; dp[i] = 0; } dp[1] = abs(arr[0] - arr[1]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 2] + abs(arr[i - 2] - arr[i]), dp[i - 1] + abs(arr[i - 1] - arr[i])); } cout << dp[n - 1] << endl; return 0; }
replace
17
18
17
19
30
p03160
C++
Runtime Error
#include <bits/stdc++.h> #define ll long long int #define n 10005 using namespace std; ll dp[n]; ll height[n]; ll solve(int N) { dp[1] = 0; for (int i = 2; i <= N; i++) { ll opt1 = abs(height[i] - height[i - 1]) + dp[i - 1]; ll opt2 = (i == 2) ? INT_MAX : abs(height[i] - height[i - 2]) + dp[i - 2]; dp[i] = min(opt1, opt2); } return dp[N]; } int main() { memset(dp, 0, sizeof dp); memset(height, 0, sizeof height); int N; cin >> N; for (int i = 1; i <= N; i++) { cin >> height[i]; } cout << solve(N); }
#include <bits/stdc++.h> #define ll long long int #define n 100005 using namespace std; ll dp[n]; ll height[n]; ll solve(int N) { dp[1] = 0; for (int i = 2; i <= N; i++) { ll opt1 = abs(height[i] - height[i - 1]) + dp[i - 1]; ll opt2 = (i == 2) ? INT_MAX : abs(height[i] - height[i - 2]) + dp[i - 2]; dp[i] = min(opt1, opt2); } return dp[N]; } int main() { memset(dp, 0, sizeof dp); memset(height, 0, sizeof height); int N; cin >> N; for (int i = 1; i <= N; i++) { cin >> height[i]; } cout << solve(N); }
replace
2
3
2
3
0
p03160
C++
Runtime Error
#include <algorithm> #include <iostream> #include <string> #include <vector> #define rep(i, n) for (int i = 0; i < n; i++) const long long INF = 1LL << 60; /* bがa以上のとき、置き換え */ template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; } else { return false; } return true; } /* bがa以下のとき、置き換え */ template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; } else { return false; } return true; } // テーブルの用意 std::vector<long long> dp(100005, INF); // dp[i] = 足場iまで飛ぶための最小コスト std::vector<long long> h(10005); int main() { int N; std::cin >> N; rep(i, N) std::cin >> h[i]; // 見ていく rep(i, N) { if (i == 0) { dp[i] = 0; continue; } else if (i == 1) { dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]); continue; } // 1つ前から dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]); // 2つ前はどう? chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2])); } std::cout << dp[N - 1] << std::endl; // printf("===dp[]===\n"); // rep(i, N) // { // printf("dp[%d]:%lld\n", i, dp[i]); // } return 0; }
#include <algorithm> #include <iostream> #include <string> #include <vector> #define rep(i, n) for (int i = 0; i < n; i++) const long long INF = 1LL << 60; /* bがa以上のとき、置き換え */ template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; } else { return false; } return true; } /* bがa以下のとき、置き換え */ template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; } else { return false; } return true; } // テーブルの用意 std::vector<long long> dp(100005, INF); // dp[i] = 足場iまで飛ぶための最小コスト std::vector<long long> h(100005); int main() { int N; std::cin >> N; rep(i, N) std::cin >> h[i]; // 見ていく rep(i, N) { if (i == 0) { dp[i] = 0; continue; } else if (i == 1) { dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]); continue; } // 1つ前から dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]); // 2つ前はどう? chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2])); } std::cout << dp[N - 1] << std::endl; // printf("===dp[]===\n"); // rep(i, N) // { // printf("dp[%d]:%lld\n", i, dp[i]); // } return 0; }
replace
31
32
31
32
0
p03160
C++
Runtime Error
#include <algorithm> #include <cmath> #include <iomanip> #include <iostream> #include <queue> #include <set> #include <string> #include <vector> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<bool> vb; typedef vector<ull> vul; typedef vector<pair<ll, ll>> vpl; typedef pair<ll, ll> pl; #define For(i, n) for (ll i = 0; i < n; i++) #define len(n) (ll)(n).size() #define Sort(a) sort(a.begin(), a.end()) ll dp[110]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; vl h(n + 2); For(i, n) { cin >> h[i]; dp[i] = 1e12; } h[n] = 0; h[n + 1] = 0; dp[0] = 0; For(i, n) { 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]; return 0; }
#include <algorithm> #include <cmath> #include <iomanip> #include <iostream> #include <queue> #include <set> #include <string> #include <vector> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<bool> vb; typedef vector<ull> vul; typedef vector<pair<ll, ll>> vpl; typedef pair<ll, ll> pl; #define For(i, n) for (ll i = 0; i < n; i++) #define len(n) (ll)(n).size() #define Sort(a) sort(a.begin(), a.end()) ll dp[100010]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n; cin >> n; vl h(n + 2); For(i, n) { cin >> h[i]; dp[i] = 1e12; } h[n] = 0; h[n + 1] = 0; dp[0] = 0; For(i, n) { 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]; return 0; }
replace
20
21
20
21
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5; int h[N], n, memo[N]; int solve(int idx) { if (idx == n - 1) return 0; if (memo[idx] != -1) return memo[idx]; int awal, tany = 1e9 + 5; awal = abs(h[idx] - h[idx + 1]) + solve(idx + 1); if (idx + 2 <= n - 1) tany = abs(h[idx] - h[idx + 2]) + solve(idx + 2); return memo[idx] = min(awal, tany); } int main() { memset(memo, -1, sizeof(memo)); cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << solve(0); return 0; }
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; int h[N], n, memo[N]; int solve(int idx) { if (idx == n - 1) return 0; if (memo[idx] != -1) return memo[idx]; int awal, tany = 1e9 + 5; awal = abs(h[idx] - h[idx + 1]) + solve(idx + 1); if (idx + 2 <= n - 1) tany = abs(h[idx] - h[idx + 2]) + solve(idx + 2); return memo[idx] = min(awal, tany); } int main() { memset(memo, -1, sizeof(memo)); cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << solve(0); return 0; }
replace
2
3
2
3
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int h[10004], dp[10004]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]); } cout << dp[n - 1] << endl; }
#include <bits/stdc++.h> using namespace std; int h[100005], dp[100005]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]); } cout << dp[n - 1] << endl; }
replace
4
5
4
5
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define ll long long vector<ll> dp(100002, -1); ll n; ll solve(vector<ll> &v, ll i) { if (i == n - 1) return 0; if (dp[i] != -1) return dp[i]; ll ans = abs(v[i] - v[i + 1]) + solve(v, i + 1); if (i + 2 < n) { ans = min(ans, abs(v[i] - v[i + 2]) + solve(v, i + 2)); } dp[i] = ans; } int main() { cin >> n; vector<ll> v(n); for (ll i = 0; i < n; i++) { cin >> v[i]; } cout << solve(v, 0); }
#include <bits/stdc++.h> using namespace std; #define ll long long vector<ll> dp(100002, -1); ll n; ll solve(vector<ll> &v, ll i) { if (i == n - 1) return 0; if (dp[i] != -1) return dp[i]; ll ans = abs(v[i] - v[i + 1]) + solve(v, i + 1); if (i + 2 < n) { ans = min(ans, abs(v[i] - v[i + 2]) + solve(v, i + 2)); } return dp[i] = ans; } int main() { cin >> n; vector<ll> v(n); for (ll i = 0; i < n; i++) { cin >> v[i]; } cout << solve(v, 0); }
replace
14
15
14
15
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int memo[10005], h[10005], n; int dp(int i) { if (i > n) return 1e5; if (i == n) return 0; if (memo[i] != -1) return memo[i]; int res, res1; res = abs(h[i] - h[i + 1]) + dp(i + 1); res1 = abs(h[i] - h[i + 2]) + dp(i + 2); memo[i] = min(res, res1); return memo[i]; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> h[i]; h[n + 1] = h[n + 2] = 1e5; memset(memo, -1, sizeof(memo)); cout << dp(1); return 0; }
#include <bits/stdc++.h> using namespace std; int memo[100005], h[100005], n; int dp(int i) { if (i > n) return 1e5; if (i == n) return 0; if (memo[i] != -1) return memo[i]; int res, res1; res = abs(h[i] - h[i + 1]) + dp(i + 1); res1 = abs(h[i] - h[i + 2]) + dp(i + 2); memo[i] = min(res, res1); return memo[i]; } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> h[i]; h[n + 1] = h[n + 2] = 1e5; memset(memo, -1, sizeof(memo)); cout << dp(1); return 0; }
replace
3
4
3
4
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define int long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define vi vector<int> #define mii map<int, int> #define pqb priority_queue<int> #define pqs priority_queue<int, vi, greater<int>> #define MX 200005 #define mod 1000000007 #define inf 1e18 #define ps(x, y) fixed << setprecision(y) << x #define mk(arr, n, type) type *arr = new type[n]; #define w(x) \ int x; \ cin >> x; \ while (x--) #define pw(b, p) pow(b, p) + 0.1 #define ull unsigned long long #define ll long long void codeforces() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("input.in", "r", stdin); freopen("output.in", "w", stdout); #endif } int32_t main() { codeforces(); // int t;cin>>t; // while(t--) { // } int n; cin >> n; vi a(n); for (int i = 0; i < n; i++) cin >> a[i]; vi dp(n, INT_MAX); dp[0] = 0; if (n == 1) { cout << dp[0] << endl; return 0; } for (int i = 0; i < n; i++) { int x = a[i]; if (i + 1 < n) { int y = a[i + 1]; y = abs(y - x); dp[i + 1] = min(dp[i + 1], y + dp[i]); } if (i + 2 < n) { int y = a[i + 2]; y = abs(y - x); dp[i + 2] = min(dp[i + 2], y + dp[i]); } } cout << dp[n - 1] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define int long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define vi vector<int> #define mii map<int, int> #define pqb priority_queue<int> #define pqs priority_queue<int, vi, greater<int>> #define MX 200005 #define mod 1000000007 #define inf 1e18 #define ps(x, y) fixed << setprecision(y) << x #define mk(arr, n, type) type *arr = new type[n]; #define w(x) \ int x; \ cin >> x; \ while (x--) #define pw(b, p) pow(b, p) + 0.1 #define ull unsigned long long #define ll long long void codeforces() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("input.in", "r", stdin); freopen("output.in", "w", stdout); #endif } int32_t main() { // codeforces(); // int t;cin>>t; // while(t--) { // } int n; cin >> n; vi a(n); for (int i = 0; i < n; i++) cin >> a[i]; vi dp(n, INT_MAX); dp[0] = 0; if (n == 1) { cout << dp[0] << endl; return 0; } for (int i = 0; i < n; i++) { int x = a[i]; if (i + 1 < n) { int y = a[i + 1]; y = abs(y - x); dp[i + 1] = min(dp[i + 1], y + dp[i]); } if (i + 2 < n) { int y = a[i + 2]; y = abs(y - x); dp[i + 2] = min(dp[i + 2], y + dp[i]); } } cout << dp[n - 1] << endl; return 0; }
replace
36
39
36
39
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Runtime Error
#pragma GCC optimize "Ofast" #pragma GCC optimize "unroll-loops" #pragma GCC target "sse,sse2,sse3,sse4,abm,avx,mmx,popcnt,tune=native" #include <bits/stdc++.h> using namespace std; #define IOS \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define int long long int #define pb push_back #define mp make_pair #define fi first #define se second #define init(a, b) memset(a, b, sizeof(a)) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vpii; typedef unordered_map<int, int> uoii; typedef unordered_map<string, int> uosi; #define MOD = 1e9 + 7; /******* Debugging Class Template *******/ #define DEBUG #ifdef DEBUG #define de(args...) (Debugger()), args class Debugger { public: Debugger(const std::string &_separator = " - ") : first(true), separator(_separator) {} template <typename ObjectType> Debugger &operator,(const ObjectType &v) { if (!first) std: cerr << separator; std::cerr << v; first = false; return *this; } ~Debugger() { std: cerr << endl; } private: bool first; std::string separator; }; #else #define debug(args...) // Just strip off all debug tokens #endif int32_t main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif IOS int n; cin >> n; vi h(n + 1); int inf = 1000 * 1000 * 1000; for (int i = 1; i < n + 1; i++) cin >> h[i]; vi dp(n + 1, inf); dp[0] = 0; dp[1] = 0; dp[2] = abs(h[2 - 1] - h[2]); for (int i = 3; i <= n; i++) { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i - 2] - h[i])); } cout << dp[n]; return 0; }
#pragma GCC optimize "Ofast" #pragma GCC optimize "unroll-loops" #pragma GCC target "sse,sse2,sse3,sse4,abm,avx,mmx,popcnt,tune=native" #include <bits/stdc++.h> using namespace std; #define IOS \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define int long long int #define pb push_back #define mp make_pair #define fi first #define se second #define init(a, b) memset(a, b, sizeof(a)) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vpii; typedef unordered_map<int, int> uoii; typedef unordered_map<string, int> uosi; #define MOD = 1e9 + 7; /******* Debugging Class Template *******/ #define DEBUG #ifdef DEBUG #define de(args...) (Debugger()), args class Debugger { public: Debugger(const std::string &_separator = " - ") : first(true), separator(_separator) {} template <typename ObjectType> Debugger &operator,(const ObjectType &v) { if (!first) std: cerr << separator; std::cerr << v; first = false; return *this; } ~Debugger() { std: cerr << endl; } private: bool first; std::string separator; }; #else #define debug(args...) // Just strip off all debug tokens #endif int32_t main() { IOS int n; cin >> n; vi h(n + 1); int inf = 1000 * 1000 * 1000; for (int i = 1; i < n + 1; i++) cin >> h[i]; vi dp(n + 1, inf); dp[0] = 0; dp[1] = 0; dp[2] = abs(h[2 - 1] - h[2]); for (int i = 3; i <= n; i++) { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i - 2] - h[i])); } cout << dp[n]; return 0; }
delete
62
66
62
62
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pll pair<long long, long long> #define vll vector<long long> #define pb push_back #define mp make_pair #define ff first #define ss second #define deb(x) cout << #x << "=" << x << endl #define F(i, a, b) for (ll i = a; i <= b; i++) #define RF(i, a, b) for (ll i = a; i >= b; i--) #define in(a, n) F(i, 0, n - 1) cin >> a[i] #define vi vector<int> #define out(a, n) \ F(i, 0, n - 1) cout << a[i] << " "; \ cout << endl #define mod 1000000007 #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 #define int long long const int N = (int)1e5 + 5; int dp[N]; int a[N]; int n; int solve(int idx) { int i = idx; if (idx == n) return 0; int &ans = dp[idx]; ans = INT_MAX; int op1 = INT_MAX, op2 = INT_MAX; if (idx + 2 <= n) op1 = abs(a[i + 2] - a[i]) + solve(idx + 2); op2 = abs(a[i + 1] - a[i]) + solve(idx + 1); return ans = min(op1, op2); } void solve() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; memset(dp, -1, sizeof dp); int ans = solve(1); cout << ans; } int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); int t = 1; // cin>>t; while (t--) solve(); }
#include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pll pair<long long, long long> #define vll vector<long long> #define pb push_back #define mp make_pair #define ff first #define ss second #define deb(x) cout << #x << "=" << x << endl #define F(i, a, b) for (ll i = a; i <= b; i++) #define RF(i, a, b) for (ll i = a; i >= b; i--) #define in(a, n) F(i, 0, n - 1) cin >> a[i] #define vi vector<int> #define out(a, n) \ F(i, 0, n - 1) cout << a[i] << " "; \ cout << endl #define mod 1000000007 #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 #define int long long const int N = (int)1e5 + 5; int dp[N]; int a[N]; int n; int solve(int idx) { int i = idx; if (idx == n) return 0; int &ans = dp[idx]; if (ans != -1) return ans; ans = INT_MAX; int op1 = INT_MAX, op2 = INT_MAX; if (idx + 2 <= n) op1 = abs(a[i + 2] - a[i]) + solve(idx + 2); op2 = abs(a[i + 1] - a[i]) + solve(idx + 1); return ans = min(op1, op2); } void solve() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; memset(dp, -1, sizeof dp); int ans = solve(1); cout << ans; } int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); int t = 1; // cin>>t; while (t--) solve(); }
replace
49
50
49
51
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define IOS \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define int long long int const int MOD = 1e9 + 7; const int MAXN = 2e5 + 5; int32_t main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif IOS int n; cin >> n; int arr[n + 1]; for (int i = 1; i <= n; i++) cin >> arr[i]; int dp[n + 1]; memset(dp, MAXN, sizeof(dp)); dp[1] = 0; // for(auto it :dp) cout<<it<<" "; for (int i = 1; i <= n; i++) { for (int j : {i + 1, i + 2}) { if (j <= n) { dp[j] = min(dp[j], dp[i] + abs(arr[i] - arr[j])); } } } cout << dp[n] << '\n'; return 0; }
#include <bits/stdc++.h> using namespace std; #define IOS \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define int long long int const int MOD = 1e9 + 7; const int MAXN = 2e5 + 5; int32_t main() { IOS int n; cin >> n; int arr[n + 1]; for (int i = 1; i <= n; i++) cin >> arr[i]; int dp[n + 1]; memset(dp, MAXN, sizeof(dp)); dp[1] = 0; // for(auto it :dp) cout<<it<<" "; for (int i = 1; i <= n; i++) { for (int j : {i + 1, i + 2}) { if (j <= n) { dp[j] = min(dp[j], dp[i] + abs(arr[i] - arr[j])); } } } cout << dp[n] << '\n'; return 0; }
replace
12
16
12
13
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; using ll = long long; using ldb = long double; using pa = pair<ll, ll>; using vec = vector<ll>; template <typename T> using index_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template <typename T> using MinPriorityQueue = priority_queue<T, vector<T>, greater<T>>; #define pb push_back #define po pop_back #define mp make_pair #define mt make_tuple #define F first #define S second #define f(i, x, n) for (ll i = x; i < n; i++) #define unique_sort(x) \ sort(all(x)), x.resize(distance(x.begin(), unique(all(x)))) #define all(c) c.begin(), c.end() #define str string #define edl "\n" #define add insert #define cot continue #define fast() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL) const int MOD = 1e9 + 7, INF = INT_MAX, N = 1e5 + 10; const double PI = acos(-1); const ll LINF = LLONG_MAX; vec dp(100002, INT_MAX); ll q[100001], n; int main() { fast(); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif cin >> n; f(i, 0, n) { cin >> q[i]; } dp[0] = 0; f(i, 0, n) { for (ll j = i + 1; j <= i + 2 && j < n; j++) { dp[j] = min(dp[j], dp[i] + abs(q[i] - q[j])); } } cout << dp[n - 1]; cerr << "Time taken: " << int((clock() * 1000.) / CLOCKS_PER_SEC) << "ms\n"; return 0; }
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; using ll = long long; using ldb = long double; using pa = pair<ll, ll>; using vec = vector<ll>; template <typename T> using index_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template <typename T> using MinPriorityQueue = priority_queue<T, vector<T>, greater<T>>; #define pb push_back #define po pop_back #define mp make_pair #define mt make_tuple #define F first #define S second #define f(i, x, n) for (ll i = x; i < n; i++) #define unique_sort(x) \ sort(all(x)), x.resize(distance(x.begin(), unique(all(x)))) #define all(c) c.begin(), c.end() #define str string #define edl "\n" #define add insert #define cot continue #define fast() \ ios_base::sync_with_stdio(false); \ cin.tie(NULL) const int MOD = 1e9 + 7, INF = INT_MAX, N = 1e5 + 10; const double PI = acos(-1); const ll LINF = LLONG_MAX; vec dp(100002, INT_MAX); ll q[100001], n; int main() { fast(); // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt","w",stdout); // #endif cin >> n; f(i, 0, n) { cin >> q[i]; } dp[0] = 0; f(i, 0, n) { for (ll j = i + 1; j <= i + 2 && j < n; j++) { dp[j] = min(dp[j], dp[i] + abs(q[i] - q[j])); } } cout << dp[n - 1]; cerr << "Time taken: " << int((clock() * 1000.) / CLOCKS_PER_SEC) << "ms\n"; return 0; }
replace
46
50
46
50
0
Time taken: 36ms
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; /*### FAST-IO ###*/ #define IOS \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); /*### DEBUGGGGGGG ###*/ #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 #define testcases \ int testcases; \ cin >> testcases; \ while (testcases--) #define queries \ int queries; \ cin >> queries; \ while (queries--) /*### TO PRINT ###*/ #define pp1(a) cout << a << endl; #define pp2(a, b) cout << a << " " << b << endl; #define pp3(a, b, c) cout << a << " " << b << " " << c << endl; #define pp4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl; #define pp5(a, b, c, d, e) \ cout << a << " " << b << " " << c << " " << d << " " << e << endl; /*### SSSSSSS ###*/ #define INF INT_MAX #define endl "\n" #define ll long long #define int long long ll mod = 1e9 + 7; #define pb push_back #define mp make_pair #define pii pair<int, int> #define msi map<string, int> #define vi vector<int> #define vpii vector<pair<int, int>> #define ff first #define ss second #define sz size() #define REP(i, a, b) for (int i = a; i <= b; i++) #define REP1(i, a, b) for (int i = a; i < b; i++) #define f0(n) for (ll i = 0; i < n; i++) #define f(n) for (ll i = 1; i <= n; i++) #define fn(a, n) for (ll a = 0; a < n; a++) #define flr(a, l, r) for (ll a = l; a <= r; a++) #define sorta(a) sort(a.begin(), a.end()); #define sortd(a) sort(a.begin(), a.end(), greater<ll>()); #define sortdp(a) sort(a.begin(), a.end(), greater<pair<ll, ll>>()); #define blb(a, b) lower_bound(all(a), b) - a.begin(); #define bub(a, b) upper_bound(all(a), b) - a.begin(); #define stop return 0 /*### COMPARATOR ###*/ bool rev(int x, int y) { return x > y; } /*### PAIR_SORT_IN_DESCENDING_ORDER ###*/ bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) { return (a.first > b.first); } /*### MODULO ###*/ int modulo(int x, int N) { return (x % N + N) % N; } /*### MAX & MIN ###*/ int max(int a, int b) { if (a >= b) return a; else return b; } int min(int a, int b) { if (a <= b) return a; else return b; } /*### MOD-DIFFERENCE ###*/ ll diff(ll a, ll b) { if (a >= b) return a - b; else return b - a; } /*### PAIR-SORTING ###*/ void pairsort(int a[], int b[], ll n) { pair<int, int> pairt[n]; for (int i = 0; i < n; i++) { pairt[i].first = a[i]; pairt[i].second = b[i]; } sort(pairt, pairt + n); for (int i = 0; i < n; i++) { a[i] = pairt[i].first; b[i] = pairt[i].second; } } /*### GCD && LCM ###*/ ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } /*### PRIME OR NOT ###*/ int isPrime(int n) { if (n < 2) return 0; if (n < 4) return 1; if (n % 2 == 0 or n % 3 == 0) return 0; for (int i = 5; i * i <= n; i += 6) if (n % i == 0 or n % (i + 2) == 0) return 0; return 1; } /*### nCr ###*/ long long C(int n, int r) { if (r > n - r) r = n - r; long long ans = 1; int i; for (i = 1; i <= r; i++) { ans *= n - r + i; ans /= i; } return ans; } /*### MODULAR-EXPONENTIATION ###*/ ll modexpo(ll x, ll p) { ll res = 1; x = x % mod; while (p) { if (p % 2) res = res * x; p >>= 1; x = x * x % mod; res %= mod; } return res; } uint64_t mul_mod(uint64_t a, uint64_t b, uint64_t m) { long double x; uint64_t c; int64_t r; if (a >= m) a %= m; if (b >= m) b %= m; x = a; c = x * b / m; r = (int64_t)(a * b - c * m) % (int64_t)m; return r < 0 ? r + m : r; } /*### STRING TO INT ###*/ int sti(string s) { int ans = 0; int p = 1; for (int i = s.size() - 1; i >= 0; i--) { ans = (ans + ((ll)(s[i] - '0') * p) % mod) % mod; p = (p * 10) % mod; } return ans; } /*### TIMER ###*/ void time() { #ifndef ONLINE_JUDGE cout << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n"; #endif } /*************************** END OF TEMPLATE ****************************/ const int N = 1e6 + 5; int32_t main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); #endif IOS int n; cin >> n; vi h(n + 1); flr(i, 1, n) { cin >> h[i]; } vi dp(n + 1); // dp[0]=h[0]; dp[1] = 0; dp[2] = abs(h[2] - h[1]); flr(i, 3, 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] << endl; // time(); stop; }
#include <bits/stdc++.h> using namespace std; /*### FAST-IO ###*/ #define IOS \ ios::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); /*### DEBUGGGGGGG ###*/ #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 #define testcases \ int testcases; \ cin >> testcases; \ while (testcases--) #define queries \ int queries; \ cin >> queries; \ while (queries--) /*### TO PRINT ###*/ #define pp1(a) cout << a << endl; #define pp2(a, b) cout << a << " " << b << endl; #define pp3(a, b, c) cout << a << " " << b << " " << c << endl; #define pp4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl; #define pp5(a, b, c, d, e) \ cout << a << " " << b << " " << c << " " << d << " " << e << endl; /*### SSSSSSS ###*/ #define INF INT_MAX #define endl "\n" #define ll long long #define int long long ll mod = 1e9 + 7; #define pb push_back #define mp make_pair #define pii pair<int, int> #define msi map<string, int> #define vi vector<int> #define vpii vector<pair<int, int>> #define ff first #define ss second #define sz size() #define REP(i, a, b) for (int i = a; i <= b; i++) #define REP1(i, a, b) for (int i = a; i < b; i++) #define f0(n) for (ll i = 0; i < n; i++) #define f(n) for (ll i = 1; i <= n; i++) #define fn(a, n) for (ll a = 0; a < n; a++) #define flr(a, l, r) for (ll a = l; a <= r; a++) #define sorta(a) sort(a.begin(), a.end()); #define sortd(a) sort(a.begin(), a.end(), greater<ll>()); #define sortdp(a) sort(a.begin(), a.end(), greater<pair<ll, ll>>()); #define blb(a, b) lower_bound(all(a), b) - a.begin(); #define bub(a, b) upper_bound(all(a), b) - a.begin(); #define stop return 0 /*### COMPARATOR ###*/ bool rev(int x, int y) { return x > y; } /*### PAIR_SORT_IN_DESCENDING_ORDER ###*/ bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) { return (a.first > b.first); } /*### MODULO ###*/ int modulo(int x, int N) { return (x % N + N) % N; } /*### MAX & MIN ###*/ int max(int a, int b) { if (a >= b) return a; else return b; } int min(int a, int b) { if (a <= b) return a; else return b; } /*### MOD-DIFFERENCE ###*/ ll diff(ll a, ll b) { if (a >= b) return a - b; else return b - a; } /*### PAIR-SORTING ###*/ void pairsort(int a[], int b[], ll n) { pair<int, int> pairt[n]; for (int i = 0; i < n; i++) { pairt[i].first = a[i]; pairt[i].second = b[i]; } sort(pairt, pairt + n); for (int i = 0; i < n; i++) { a[i] = pairt[i].first; b[i] = pairt[i].second; } } /*### GCD && LCM ###*/ ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } /*### PRIME OR NOT ###*/ int isPrime(int n) { if (n < 2) return 0; if (n < 4) return 1; if (n % 2 == 0 or n % 3 == 0) return 0; for (int i = 5; i * i <= n; i += 6) if (n % i == 0 or n % (i + 2) == 0) return 0; return 1; } /*### nCr ###*/ long long C(int n, int r) { if (r > n - r) r = n - r; long long ans = 1; int i; for (i = 1; i <= r; i++) { ans *= n - r + i; ans /= i; } return ans; } /*### MODULAR-EXPONENTIATION ###*/ ll modexpo(ll x, ll p) { ll res = 1; x = x % mod; while (p) { if (p % 2) res = res * x; p >>= 1; x = x * x % mod; res %= mod; } return res; } uint64_t mul_mod(uint64_t a, uint64_t b, uint64_t m) { long double x; uint64_t c; int64_t r; if (a >= m) a %= m; if (b >= m) b %= m; x = a; c = x * b / m; r = (int64_t)(a * b - c * m) % (int64_t)m; return r < 0 ? r + m : r; } /*### STRING TO INT ###*/ int sti(string s) { int ans = 0; int p = 1; for (int i = s.size() - 1; i >= 0; i--) { ans = (ans + ((ll)(s[i] - '0') * p) % mod) % mod; p = (p * 10) % mod; } return ans; } /*### TIMER ###*/ void time() { #ifndef ONLINE_JUDGE cout << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n"; #endif } /*************************** END OF TEMPLATE ****************************/ const int N = 1e6 + 5; int32_t main() { // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // //freopen("output.txt", "w", stdout); // #endif IOS int n; cin >> n; vi h(n + 1); flr(i, 1, n) { cin >> h[i]; } vi dp(n + 1); // dp[0]=h[0]; dp[1] = 0; dp[2] = abs(h[2] - h[1]); flr(i, 3, 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] << endl; // time(); stop; }
replace
235
239
235
239
0
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; #define ll long long int ll fun(ll a[], ll ind, ll dp[]) { if (ind == 0) return dp[0] = 0; if (ind == 1) return dp[1] = abs(a[0] - a[1]); ll &ans = dp[ind]; return ans = min(abs(a[ind] - a[ind - 1]) + fun(a, ind - 1, dp), abs(a[ind] - a[ind - 2]) + fun(a, ind - 2, dp)); } int main() { ll n; cin >> n; ll a[n]; ll dp[n]; for (ll i = 0; i < n; i++) { cin >> a[i]; dp[i] = -1; } cout << fun(a, n - 1, dp); }
#include <bits/stdc++.h> using namespace std; #define ll long long int ll fun(ll a[], ll ind, ll dp[]) { if (ind == 0) return dp[0] = 0; if (ind == 1) return dp[1] = abs(a[0] - a[1]); ll &ans = dp[ind]; if (ans != -1) return ans; return ans = min(abs(a[ind] - a[ind - 1]) + fun(a, ind - 1, dp), abs(a[ind] - a[ind - 2]) + fun(a, ind - 2, dp)); } int main() { ll n; cin >> n; ll a[n]; ll dp[n]; for (ll i = 0; i < n; i++) { cin >> a[i]; dp[i] = -1; } cout << fun(a, n - 1, dp); }
insert
10
10
10
12
TLE
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; #define ll long long int ll dp[100005]; ll ar[100005]; int n; ll f(ll ind) { if (ind == n) return 0; if (dp[ind] > 0) return dp[ind]; ll a = f(ind + 1) + abs(ar[ind] - ar[ind + 1]); ll b = 100000000000; if (ind != n - 1) { b = f(ind + 2) + abs(ar[ind] - ar[ind + 2]); } return dp[ind] = min(a, b); } int main() { cin >> n; fill(dp, dp + n, -1); for (int i = 1; i <= n; i++) { cin >> ar[i]; } cout << f(1); }
#include <bits/stdc++.h> using namespace std; #define ll long long int ll dp[100005]; ll ar[100005]; int n; ll f(ll ind) { if (ind == n) return 0; if (dp[ind] >= 0) return dp[ind]; ll a = f(ind + 1) + abs(ar[ind] - ar[ind + 1]); ll b = 100000000000; if (ind != n - 1) { b = f(ind + 2) + abs(ar[ind] - ar[ind + 2]); } return dp[ind] = min(a, b); } int main() { cin >> n; fill(dp, dp + n, -1); for (int i = 1; i <= n; i++) { cin >> ar[i]; } cout << f(1); }
replace
9
10
9
10
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 10000; ll dp[N]; ll h[N]; const int mx = 1000000; int main() { ll n; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; dp[i] = mx; } dp[0] = 0; for (int i = 1; i < n; i++) { if (i == 1) { dp[i] = abs(h[i] - h[i - 1]); } else { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])); } } cout << dp[n - 1]; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1000000; ll dp[N]; ll h[N]; const int mx = 1000000; int main() { ll n; cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; dp[i] = mx; } dp[0] = 0; for (int i = 1; i < n; i++) { if (i == 1) { dp[i] = abs(h[i] - h[i - 1]); } else { 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
3
4
3
4
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #include <iostream> using namespace std; const long long INF = 1LL << 60; template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; // aをbで更新 return true; } return false; } int main(void) { int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; vector<long long> dp( 10010, INF); // long long型にしておかないとINFでオーバーフローを生じる dp[0] = 0; for (int i = 1; i < n; i++) { chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1])); if (i >= 2) chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2])); } cout << dp[n - 1] << endl; }
#include <bits/stdc++.h> #include <iostream> using namespace std; const long long INF = 1LL << 60; template <typename T> bool chmin(T &a, const T &b) { if (a > b) { a = b; // aをbで更新 return true; } return false; } int main(void) { int n; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; vector<long long> dp( 100100, INF); // long long型にしておかないとINFでオーバーフローを生じる dp[0] = 0; for (int i = 1; i < n; i++) { chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1])); if (i >= 2) chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2])); } cout << dp[n - 1] << endl; }
replace
23
24
23
24
0
p03160
C++
Runtime Error
// In The Name Of Allah // Mehrkish Makuei #include <bits/stdc++.h> #define pb push_back #define debug1(x) cerr << #x << " : " << x << endl; #define debug2(x, y) \ cerr << #x << " : " << x << " " << #y << " : " << y << endl; using namespace std; typedef long long ll; typedef long double ld; typedef string str; typedef vector<ll> vll; typedef set<char> sch; typedef set<ll> sll; const ll MOD = 1e9 + 7; const ll MAXN = 5e3 + 19; ll n, a[MAXN], dp[MAXN]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; 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] << endl; return 0; }
// In The Name Of Allah // Mehrkish Makuei #include <bits/stdc++.h> #define pb push_back #define debug1(x) cerr << #x << " : " << x << endl; #define debug2(x, y) \ cerr << #x << " : " << x << " " << #y << " : " << y << endl; using namespace std; typedef long long ll; typedef long double ld; typedef string str; typedef vector<ll> vll; typedef set<char> sch; typedef set<ll> sll; const ll MOD = 1e9 + 7; const ll MAXN = 1e5 + 19; ll n, a[MAXN], dp[MAXN]; int main() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> a[i]; 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] << endl; return 0; }
replace
20
21
20
21
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; vector<int> dp(n); dp[n - 2] = abs(v[n - 1] - v[n - 2]); for (int i = n - 3; i >= 0; i++) { dp[i] = min(dp[i + 1] + abs(v[i + 1] - v[i]), dp[i + 2] + abs(v[i + 2] - v[i])); } cout << dp[0] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; vector<int> dp(n); dp[n - 2] = abs(v[n - 1] - v[n - 2]); for (int i = n - 3; i >= 0; i--) { dp[i] = min(dp[i + 1] + abs(v[i + 1] - v[i]), dp[i + 2] + abs(v[i + 2] - v[i])); } cout << dp[0] << endl; return 0; }
replace
11
12
11
12
-11
p03160
C++
Runtime Error
#include <bits/stdc++.h> #include <stdint.h> using namespace std; #define MOD 1e9 + 7 #define ll long long int #define ff first #define ss second template <typename T, typename G> ostream &operator<<(ostream &out, const pair<T, G> &a) { return out << "( " << a.ff << ", " << a.ss << ")"; } template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) { out << "[ "; for (const auto &i : a) out << i << ", "; return out << "]" << endl; } template <typename T> ostream &operator<<(ostream &out, const set<T> &a) { out << "{ "; for (const auto &i : a) out << i << ", "; return out << "}" << endl; } template <typename T, typename G> ostream &operator<<(ostream &out, const map<T, G> &a) { out << "< "; for (const auto &i : a) out << i << ", "; return out << ">" << endl; } void solve() { ll n; cin >> n; vector<ll> h(n), c(n); for (int i = 0; i < n; i++) cin >> h[i]; c[0] = 0; c[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) c[i] = min(abs(h[i] - h[i - 1]) + c[i - 1], abs(h[i] - h[i - 2]) + c[i - 2]); cout << c[n - 1]; } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); #ifndef ONLINE_JUDGE freopen("_input.txt", "r", stdin); freopen("_output.txt", "w", stdout); #endif // your code goes here... int t = 1; // cin>>t; while (t--) { solve(); } }
#include <bits/stdc++.h> #include <stdint.h> using namespace std; #define MOD 1e9 + 7 #define ll long long int #define ff first #define ss second template <typename T, typename G> ostream &operator<<(ostream &out, const pair<T, G> &a) { return out << "( " << a.ff << ", " << a.ss << ")"; } template <typename T> ostream &operator<<(ostream &out, const vector<T> &a) { out << "[ "; for (const auto &i : a) out << i << ", "; return out << "]" << endl; } template <typename T> ostream &operator<<(ostream &out, const set<T> &a) { out << "{ "; for (const auto &i : a) out << i << ", "; return out << "}" << endl; } template <typename T, typename G> ostream &operator<<(ostream &out, const map<T, G> &a) { out << "< "; for (const auto &i : a) out << i << ", "; return out << ">" << endl; } void solve() { ll n; cin >> n; vector<ll> h(n), c(n); for (int i = 0; i < n; i++) cin >> h[i]; c[0] = 0; c[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) c[i] = min(abs(h[i] - h[i - 1]) + c[i - 1], abs(h[i] - h[i - 2]) + c[i - 2]); cout << c[n - 1]; } int32_t main() { // your code goes here... int t = 1; // cin>>t; while (t--) { solve(); } }
delete
54
61
54
54
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; #define ll long long int #define pb push_back const ll M = 1e5 + 6; ll dp[M], a[M]; ll rec(ll index) { if (index <= 2) return dp[index]; if (dp[index] != -1) return dp[index]; else return min(abs(a[index] - a[index - 1]) + rec(index - 1), abs(a[index] - a[index - 2]) + rec(index - 2)); } int main() { ll n, i, j, k, x, y, t, m; cin >> n; for (i = 1; i <= n; i++) cin >> a[i], dp[i] = -1; dp[1] = 0; dp[2] = abs(a[2] - a[1]); cout << rec(n) << endl; }
#include <bits/stdc++.h> using namespace std; #define ll long long int #define pb push_back const ll M = 1e5 + 6; ll dp[M], a[M]; ll rec(ll index) { if (index <= 2) return dp[index]; if (dp[index] != -1) return dp[index]; else { dp[index] = min(abs(a[index] - a[index - 1]) + rec(index - 1), abs(a[index] - a[index - 2]) + rec(index - 2)); return dp[index]; } } int main() { ll n, i, j, k, x, y, t, m; cin >> n; for (i = 1; i <= n; i++) cin >> a[i], dp[i] = -1; dp[1] = 0; dp[2] = abs(a[2] - a[1]); cout << rec(n) << endl; }
replace
12
15
12
17
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; void solve() { int i, n; cin >> n; vector<int> v(n); vector<int> dp(n, 0); for (i = 0; i < n; i++) cin >> v[i]; dp[0] = 0; dp[1] = abs(v[1] - v[0]); if (n == 1) { cout << dp[0] << "\n"; return; } if (n == 2) { cout << dp[1] << "\n"; return; } for (i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2])); } cout << dp[n - 1] << "\n"; } int main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif solve(); return 0; }
#include <bits/stdc++.h> using namespace std; void solve() { int i, n; cin >> n; vector<int> v(n); vector<int> dp(n, 0); for (i = 0; i < n; i++) cin >> v[i]; dp[0] = 0; dp[1] = abs(v[1] - v[0]); if (n == 1) { cout << dp[0] << "\n"; return; } if (n == 2) { cout << dp[1] << "\n"; return; } for (i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2])); } cout << dp[n - 1] << "\n"; } int main() { solve(); return 0; }
replace
28
32
28
29
-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 MP make_pair #define PB push_back #define F first #define S second #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define all(x) x.begin(), x.end() typedef pair<int, int> pi; typedef long long ll; const int MAX_INT = 2000000000; int dp[100001]; int h[100001]; int cost(int i, int j) { return abs(h[i] - h[j]); } int main() { int N; cin >> N; FOR(i, 1, N) { cin >> h[i]; } dp[N] = 0; dp[N - 1] = cost(N - 1, N); for (int i = N - 2; i >= 1; i++) { dp[i] = min(cost(i, i + 1) + dp[i + 1], cost(i, i + 2) + dp[i + 2]); } cout << dp[1]; return 0; }
#include <bits/stdc++.h> using namespace std; #define MP make_pair #define PB push_back #define F first #define S second #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define all(x) x.begin(), x.end() typedef pair<int, int> pi; typedef long long ll; const int MAX_INT = 2000000000; int dp[100001]; int h[100001]; int cost(int i, int j) { return abs(h[i] - h[j]); } int main() { int N; cin >> N; FOR(i, 1, N) { cin >> h[i]; } dp[N] = 0; dp[N - 1] = cost(N - 1, N); for (int i = N - 2; i >= 1; i--) { dp[i] = min(cost(i, i + 1) + dp[i + 1], cost(i, i + 2) + dp[i + 2]); } cout << dp[1]; return 0; }
replace
28
29
28
29
-11
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define pan(i, n) for (int i = 0; i < n; i++) #define pans(i, n, a) for (int i = a; i < n; i++) #define ll long long int #define vi vector<int> #define vl vector<ll> #define pb push_back #define INF 1000000007 #define PI 3.141592653 #define inf 100007 #define pll pair<ll, ll> #define pii pair<int, int> ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); } ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; } int main() { int n; cin >> n; vl dp(n + 1, inf), a(n + 1, inf); ll ans = 0; pans(i, n + 1, 1) cin >> a[i]; dp[1] = 0, dp[2] = abs(a[2] - a[1]), dp[3] = abs(a[3] - a[1]); pans(i, n + 1, 4) { dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i - 2] - a[i])); } cout << dp[n]; }
#include <bits/stdc++.h> using namespace std; #define pan(i, n) for (int i = 0; i < n; i++) #define pans(i, n, a) for (int i = a; i < n; i++) #define ll long long int #define vi vector<int> #define vl vector<ll> #define pb push_back #define INF 1000000007 #define PI 3.141592653 #define inf 100007 #define pll pair<ll, ll> #define pii pair<int, int> ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); } ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; } int main() { int n; cin >> n; vl dp(n + 1, inf), a(n + 1, inf); ll ans = 0; pans(i, n + 1, 1) cin >> a[i]; dp[0] = 0, dp[1] = 0; pans(i, n + 1, 2) { dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i - 2] - a[i])); } cout << dp[n]; }
replace
24
26
24
26
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define lli long long int int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int n; cin >> n; vector<int> h(n), v(n); for (auto &it : h) cin >> it; v[0] = 0; v[1] = abs(h[1] - h[0]); for (int i = 2; i < n; ++i) { v[i] = min(abs(h[i] - h[i - 1]) + v[i - 1], abs(h[i] - h[i - 2]) + v[i - 2]); } cout << v[n - 1]; return 0; }
#include <bits/stdc++.h> using namespace std; #define lli long long int int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> h(n), v(n); for (auto &it : h) cin >> it; v[0] = 0; v[1] = abs(h[1] - h[0]); for (int i = 2; i < n; ++i) { v[i] = min(abs(h[i] - h[i - 1]) + v[i - 1], abs(h[i] - h[i - 2]) + v[i - 2]); } cout << v[n - 1]; return 0; }
delete
8
12
8
8
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int N; int h[10002]; int dp[10002]; cin >> N; for (int i = 0; i < N; i++) { cin >> h[i]; dp[i] = 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; }
#include <bits/stdc++.h> using namespace std; int main() { int N; int h[100002]; int dp[100002]; cin >> N; for (int i = 0; i < N; i++) { cin >> h[i]; dp[i] = 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; }
replace
5
7
5
7
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; typedef long long ll; void print(ll x[], ll n) { for (int i = 0; i < n; i++) cout << x[i] << " "; cout << endl; } int x[10009], n; int dp[100009]; ll cost(int i) { if (i == n - 1) return 0; if (i >= n) return 100000000000; if (dp[i] != -1) return dp[i]; dp[i] = min(abs(x[i + 1] - x[i]) + cost(i + 1), abs(x[i + 2] - x[i]) + cost(i + 2)); return dp[i]; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; memset(dp, -1, sizeof dp); cout << cost(0) << endl; return 0; }
#include <bits/stdc++.h> using namespace std; typedef long long ll; void print(ll x[], ll n) { for (int i = 0; i < n; i++) cout << x[i] << " "; cout << endl; } int x[100009], n; int dp[100009]; ll cost(int i) { if (i == n - 1) return 0; if (i >= n) return 100000000000; if (dp[i] != -1) return dp[i]; dp[i] = min(abs(x[i + 1] - x[i]) + cost(i + 1), abs(x[i + 2] - x[i]) + cost(i + 2)); return dp[i]; } int main() { ios::sync_with_stdio(false); cin >> n; for (int i = 0; i < n; i++) cin >> x[i]; memset(dp, -1, sizeof dp); cout << cost(0) << endl; return 0; }
replace
9
10
9
10
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int h[10005]; int dp[10005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int N; cin >> N; for (int i = 0; i < N; i++) { cin >> h[i]; } dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < N; i++) { dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]); } cout << dp[N - 1] << '\n'; }
#include <bits/stdc++.h> using namespace std; int h[100005]; int dp[100005]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int N; cin >> N; for (int i = 0; i < N; i++) { cin >> h[i]; } dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < N; i++) { dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2]); } cout << dp[N - 1] << '\n'; }
replace
3
5
3
5
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int dp[10001]; int main() { #ifdef EVAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int N; cin >> N; int vet[N]; for (int i = 0; i < N; i++) { cin >> vet[i]; } fill(dp, dp + N, INT_MAX); dp[0] = 0; for (int i = 0; i < N; i++) { dp[i + 1] = min(dp[i + 1], dp[i] + abs(vet[i] - vet[i + 1])); dp[i + 2] = min(dp[i + 2], dp[i] + abs(vet[i] - vet[i + 2])); } cout << dp[N - 1]; }
#include <bits/stdc++.h> using namespace std; int dp[100001]; int main() { #ifdef EVAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int N; cin >> N; int vet[N]; for (int i = 0; i < N; i++) { cin >> vet[i]; } fill(dp, dp + N, INT_MAX); dp[0] = 0; for (int i = 0; i < N; i++) { dp[i + 1] = min(dp[i + 1], dp[i] + abs(vet[i] - vet[i + 1])); dp[i + 2] = min(dp[i + 2], dp[i] + abs(vet[i] - vet[i + 2])); } cout << dp[N - 1]; }
replace
2
3
2
3
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int dp[1000], vet[100005]; int main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &vet[i]); memset(dp, 0x3f3f3f3f, sizeof dp); dp[(n - 1)] = 0; for (int i = n - 2; i >= 0; i--) { dp[i] = min(dp[i], dp[i + 1] + abs(vet[i] - vet[i + 1])); if (i + 2 < n) dp[i] = min(dp[i], dp[i + 2] + abs(vet[i] - vet[i + 2])); // cout << i << ' ' << dp[i] << endl; } printf("%d\n", dp[0]); }
#include <bits/stdc++.h> using namespace std; int dp[100005], vet[100005]; int main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &vet[i]); memset(dp, 0x3f3f3f3f, sizeof dp); dp[(n - 1)] = 0; for (int i = n - 2; i >= 0; i--) { dp[i] = min(dp[i], dp[i + 1] + abs(vet[i] - vet[i + 1])); if (i + 2 < n) dp[i] = min(dp[i], dp[i + 2] + abs(vet[i] - vet[i + 2])); // cout << i << ' ' << dp[i] << endl; } printf("%d\n", dp[0]); }
replace
3
4
3
4
0
p03160
C++
Runtime Error
// Author rahuliitkgp /*A thing of beauty is a joy forever, Its loveliness increases, it will never pass into nothingness.*/ // Men at Work :) #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; using namespace std; typedef long long int ll; #define ff first #define ss second #define SZ(x) ((int)(x).size()) #define pb push_back #define mp make_pair #define pii pair<int, int> #define vi vector<int> #define mii map<int, int> #define pqb priority_queue<int> #define pqs priority_queue<int, vi, greater<int>> #define setbits(x) __builtin_popcountll(x) #define mod 1000000007 #define ps(x, y) fixed << setprecision(y) << x #define mk(arr, n, type) type *arr = new type[n]; #define w(x) \ int x; \ cin >> x; \ while (x--) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; void cpp() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } int main() { cpp(); ll n; cin >> n; vector<ll> v(n); for (ll i = 0; i < n; i++) { cin >> v[i]; } vector<ll> dp(n); dp[1] = abs(v[1] - v[0]); for (int i = 2; i < n; i++) { dp[i] = min(abs(v[i] - v[i - 2]) + dp[i - 2], abs(v[i] - v[i - 1]) + dp[i - 1]); } cout << dp[n - 1] << endl; return 0; }
// Author rahuliitkgp /*A thing of beauty is a joy forever, Its loveliness increases, it will never pass into nothingness.*/ // Men at Work :) #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; using namespace std; typedef long long int ll; #define ff first #define ss second #define SZ(x) ((int)(x).size()) #define pb push_back #define mp make_pair #define pii pair<int, int> #define vi vector<int> #define mii map<int, int> #define pqb priority_queue<int> #define pqs priority_queue<int, vi, greater<int>> #define setbits(x) __builtin_popcountll(x) #define mod 1000000007 #define ps(x, y) fixed << setprecision(y) << x #define mk(arr, n, type) type *arr = new type[n]; #define w(x) \ int x; \ cin >> x; \ while (x--) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; void cpp() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); // #endif } int main() { cpp(); ll n; cin >> n; vector<ll> v(n); for (ll i = 0; i < n; i++) { cin >> v[i]; } vector<ll> dp(n); dp[1] = abs(v[1] - v[0]); for (int i = 2; i < n; i++) { dp[i] = min(abs(v[i] - v[i - 2]) + dp[i - 2], abs(v[i] - v[i - 1]) + dp[i - 1]); } cout << dp[n - 1] << endl; return 0; }
replace
39
43
39
43
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Runtime Error
/** * purpose : * author : kyomukyomupurin * created : **/ // input/output #include <fstream> #include <iostream> #include <sstream> // container class #include <array> #include <deque> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> // math, algorithm #include <algorithm> #include <cmath> #include <complex> #include <numeric> // etc #include <bitset> #include <cctype> #include <chrono> #include <cstring> #include <iomanip> #include <random> #include <utility> // using-directive using namespace std; // alias template using int64 = int64_t; using pii = pair<int, int>; using pll = pair<int64_t, int64_t>; // text macro replacement #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define print(x) cout << (x) << '\n' #define debug(x) cout << #x << ": " << (x) << '\n' const int INF = 1e9; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int h[n]; rep(i, n) cin >> h[i]; int dp[10101]; // dp[i] : i + 1 番目の足場にたどりつくための最小コスト fill(dp, dp + 10101, INF); dp[0] = 0; dp[1] = abs(h[0] - h[1]); for (int i = 1; i < n; ++i) { dp[i + 1] = min(dp[i - 1] + abs(h[i + 1] - h[i - 1]), dp[i] + abs(h[i + 1] - h[i])); } print(dp[n - 1]); return 0; }
/** * purpose : * author : kyomukyomupurin * created : **/ // input/output #include <fstream> #include <iostream> #include <sstream> // container class #include <array> #include <deque> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> // math, algorithm #include <algorithm> #include <cmath> #include <complex> #include <numeric> // etc #include <bitset> #include <cctype> #include <chrono> #include <cstring> #include <iomanip> #include <random> #include <utility> // using-directive using namespace std; // alias template using int64 = int64_t; using pii = pair<int, int>; using pll = pair<int64_t, int64_t>; // text macro replacement #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define print(x) cout << (x) << '\n' #define debug(x) cout << #x << ": " << (x) << '\n' const int INF = 1e9; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int h[n]; rep(i, n) cin >> h[i]; int dp[101010]; // dp[i] : i + 1 番目の足場にたどりつくための最小コスト fill(dp, dp + 101010, INF); dp[0] = 0; dp[1] = abs(h[0] - h[1]); for (int i = 1; i < n; ++i) { dp[i + 1] = min(dp[i - 1] + abs(h[i + 1] - h[i - 1]), dp[i] + abs(h[i + 1] - h[i])); } print(dp[n - 1]); return 0; }
replace
58
60
58
60
0
p03160
C++
Runtime Error
#include <iostream> using namespace std; #include <vector> int main() { int n; cin >> n; const int INF = 1e9 + 7; vector<long long int> h(n); for (int i = 0; i < n; i++) { cin >> h[i]; } vector<long long int> s(n, INF); s[0] = 0; for (long long int i = 0; i < n; i++) { for (long long int j = i + 1; j <= i + 2; j++) { s[j] = min(s[j], s[i] + abs(h[j] - h[i])); } } cout << s[n - 1]; return 0; }
#include <iostream> using namespace std; #include <vector> int main() { int n; cin >> n; const int INF = 1e9 + 7; vector<long long int> h(n); for (int i = 0; i < n; i++) { cin >> h[i]; } vector<long long int> s(n, INF); s[0] = 0; for (long long int i = 0; i < n; i++) { for (long long int j = i + 1; j <= i + 2; j++) { if (j < n) s[j] = min(s[j], s[i] + abs(h[j] - h[i])); } } cout << s[n - 1]; return 0; }
replace
16
17
16
18
-6
Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf("%d", &n); long long arr[10010]; vector<long long> distance(10010, INT_MAX); for (int i = 0; i < n; i++) cin >> arr[i]; distance[0] = 0ll; for (int i = 0; i < n; i++) { if (i + 1 < n) distance[i + 1] = min(distance[i + 1], distance[i] + abs(arr[i + 1] - arr[i])); if (i + 2 < n) distance[i + 2] = min(distance[i + 2], distance[i] + abs(arr[i + 2] - arr[i])); } cout << distance[n - 1] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; int main() { int n; scanf("%d", &n); vector<long long> arr(n); vector<long long> distance(n, INT_MAX); for (int i = 0; i < n; i++) cin >> arr[i]; distance[0] = 0ll; for (int i = 0; i < n; i++) { if (i + 1 < n) distance[i + 1] = min(distance[i + 1], distance[i] + abs(arr[i + 1] - arr[i])); if (i + 2 < n) distance[i + 2] = min(distance[i + 2], distance[i] + abs(arr[i + 2] - arr[i])); } cout << distance[n - 1] << endl; return 0; }
replace
7
9
7
9
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define vi vector<int> #define usi unordered_set<int> #define si set<int> #define umii unordered_map<int, int> #define mii map<int, int> #define all(a) a.begin(), a.end() #define vii vector<pair<int, int>> #define pii pair<int, int> #define mod (int)(1e9 + 7) #define INF INT_MAX signed main() { #ifndef ONLINE_JUDGE // for getting input from input.txt freopen("input.txt", "r", stdin); // for writing output to output.txt // freopen("output.txt", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int dp[n]; dp[0] = 0; dp[1] = abs(a[1] - a[0]); for (int i = 1; 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 int long long #define pb push_back #define vi vector<int> #define usi unordered_set<int> #define si set<int> #define umii unordered_map<int, int> #define mii map<int, int> #define all(a) a.begin(), a.end() #define vii vector<pair<int, int>> #define pii pair<int, int> #define mod (int)(1e9 + 7) #define INF INT_MAX signed main() { // #ifndef ONLINE_JUDGE // // for getting input from input.txt // freopen("input.txt", "r", stdin); // // for writing output to output.txt // //freopen("output.txt", "w", stdout); // #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int dp[n]; dp[0] = 0; dp[1] = abs(a[1] - a[0]); for (int i = 1; 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
17
23
17
23
-11
p03160
C++
Runtime Error
#include <bits/stdc++.h> #define pb push_back #define fr first #define sc second #define MOD 1000000007 #define len(s) s.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 f(i, a, n) for (int i = a; i < n; i++) using namespace std; typedef long long ll; typedef vector<int> vi; typedef map<int, int> mii; int main() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); // int t; cin>>t; while(t--) { int n; cin >> n; vi h(n); for (int &x : h) cin >> x; vi dp(n, MOD); dp[0] = 0; f(i, 0, n) { 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]; return 0; }
#include <bits/stdc++.h> #define pb push_back #define fr first #define sc second #define MOD 1000000007 #define len(s) s.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 f(i, a, n) for (int i = a; i < n; i++) using namespace std; typedef long long ll; typedef vector<int> vi; typedef map<int, int> mii; int main() { /*#ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout) ; #endif */ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); // int t; cin>>t; while(t--) { int n; cin >> n; vi h(n); for (int &x : h) cin >> x; vi dp(n, MOD); dp[0] = 0; f(i, 0, n) { 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]; return 0; }
replace
17
21
17
21
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> #include <time.h> #define FOR(i, m, n) for (int i = (m); i < (n); ++i) #define REP(i, n) FOR(i, 0, n) #define dump(x) cerr << #x << " = " << (x) << endl #define debug(x) \ cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \ << " " << __FILE__ << endl using namespace std; typedef long long LL; const LL INF = 1LL << 60; template <typename T> inline ostream &operator<<(ostream &os, const vector<T> &vec) { os << "[ "; REP(i, vec.size()) { os << vec[i] << " "; } os << "]"; return os; } int dfs(int n, const vector<int> &hs) { if (n == hs.size() - 1) { return 0; } int cost1 = n + 1 < hs.size() ? abs(hs[n] - hs[n + 1]) + dfs(n + 1, hs) : int(1e5); int cost2 = n + 2 < hs.size() ? abs(hs[n] - hs[n + 2]) + dfs(n + 2, hs) : int(1e5); int ret = min(cost1, cost2); return ret; } int dfs_memo(int n, const vector<int> &hs, vector<LL> &memo) { if (memo[n] < INF) { return memo[n]; } if (n == hs.size() - 1) { return 0; } LL cost1 = n + 1 < hs.size() ? abs(hs[n] - hs[n + 1]) + dfs(n + 1, hs) : INF; LL cost2 = n + 2 < hs.size() ? abs(hs[n] - hs[n + 2]) + dfs(n + 2, hs) : INF; int ret = min(cost1, cost2); memo[n] = ret; return ret; } template <typename T> inline void chmin(T &a, T b) { if (a > b) { a = b; } } int dp1(const vector<int> &hs) { vector<int> costs(hs.size()); costs[0] = 0; costs[1] = abs(hs[0] - hs[1]); FOR(i, 2, hs.size()) { costs[i] = min(costs[i - 2] + abs(hs[i - 2] - hs[i]), costs[i - 1] + abs(hs[i - 1] - hs[i])); } return costs.back(); } int dp2(const vector<int> &hs) { vector<LL> costs(hs.size(), 1LL << 60); costs[0] = 0; REP(i, costs.size()) { if (i + 1 < costs.size()) chmin(costs[i + 1], costs[i] + abs(hs[i] - hs[i + 1])); if (i + 2 < costs.size()) chmin(costs[i + 2], costs[i] + abs(hs[i] - hs[i + 2])); } return costs.back(); } int main() { cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; vector<int> h(N); REP(i, N) cin >> h[i]; // cout << dfs(0, h) << endl; vector<LL> memo(N, INF); cout << dfs_memo(0, h, memo) << endl; // cout << dp1(h) << endl; // cout << dp2(h) << endl; }
#include <bits/stdc++.h> #include <time.h> #define FOR(i, m, n) for (int i = (m); i < (n); ++i) #define REP(i, n) FOR(i, 0, n) #define dump(x) cerr << #x << " = " << (x) << endl #define debug(x) \ cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \ << " " << __FILE__ << endl using namespace std; typedef long long LL; const LL INF = 1LL << 60; template <typename T> inline ostream &operator<<(ostream &os, const vector<T> &vec) { os << "[ "; REP(i, vec.size()) { os << vec[i] << " "; } os << "]"; return os; } int dfs(int n, const vector<int> &hs) { if (n == hs.size() - 1) { return 0; } int cost1 = n + 1 < hs.size() ? abs(hs[n] - hs[n + 1]) + dfs(n + 1, hs) : int(1e5); int cost2 = n + 2 < hs.size() ? abs(hs[n] - hs[n + 2]) + dfs(n + 2, hs) : int(1e5); int ret = min(cost1, cost2); return ret; } int dfs_memo(int n, const vector<int> &hs, vector<LL> &memo) { if (memo[n] < INF) { return memo[n]; } if (n == hs.size() - 1) { return 0; } LL cost1 = n + 1 < hs.size() ? abs(hs[n] - hs[n + 1]) + dfs_memo(n + 1, hs, memo) : INF; LL cost2 = n + 2 < hs.size() ? abs(hs[n] - hs[n + 2]) + dfs_memo(n + 2, hs, memo) : INF; int ret = min(cost1, cost2); memo[n] = ret; return ret; } template <typename T> inline void chmin(T &a, T b) { if (a > b) { a = b; } } int dp1(const vector<int> &hs) { vector<int> costs(hs.size()); costs[0] = 0; costs[1] = abs(hs[0] - hs[1]); FOR(i, 2, hs.size()) { costs[i] = min(costs[i - 2] + abs(hs[i - 2] - hs[i]), costs[i - 1] + abs(hs[i - 1] - hs[i])); } return costs.back(); } int dp2(const vector<int> &hs) { vector<LL> costs(hs.size(), 1LL << 60); costs[0] = 0; REP(i, costs.size()) { if (i + 1 < costs.size()) chmin(costs[i + 1], costs[i] + abs(hs[i] - hs[i + 1])); if (i + 2 < costs.size()) chmin(costs[i + 2], costs[i] + abs(hs[i] - hs[i + 2])); } return costs.back(); } int main() { cin.tie(0); ios_base::sync_with_stdio(false); int N; cin >> N; vector<int> h(N); REP(i, N) cin >> h[i]; // cout << dfs(0, h) << endl; vector<LL> memo(N, INF); cout << dfs_memo(0, h, memo) << endl; // cout << dp1(h) << endl; // cout << dp2(h) << endl; }
replace
50
52
50
56
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; /*#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/ struct fast_ios { fast_ios() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for (int i = (begin); i < (end); i++) #define REP(i, n) FOR(i, 0, n) #define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--) #define IREP(i, n) IFOR(i, 0, n) #define Sort(v) sort(v.begin(), v.end()) #define Reverse(v) reverse(v.begin(), v.end()) #define all(v) v.begin(), v.end() #define SZ(v) ((int)v.size()) #define Lower_bound(v, x) \ distance(v.begin(), lower_bound(v.begin(), v.end(), x)) #define Upper_bound(v, x) \ distance(v.begin(), upper_bound(v.begin(), v.end(), x)) #define Max(a, b) a = max(a, b) #define Min(a, b) a = min(a, b) #define bit(n) (1LL << (n)) #define bit_exist(x, n) ((x >> n) & 1) #define debug(x) cout << #x << "=" << x << endl; #define vdebug(v) \ { \ cout << #v << "=" << endl; \ REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \ cout << endl; \ } #define mdebug(m) \ { \ cout << #m << "=" << endl; \ REP(i_debug, m.size()) { \ REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \ cout << endl; \ } \ } #define Return(ans) \ { \ cout << (ans) << endl; \ return 0; \ } #define pb push_back #define f first #define s second #define int long long #define INF 1000000000000000000 template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { for (int i = 0; i < v.size(); i++) { cout << v[i]; if (i != v.size() - 1) cout << endl; }; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { cout << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T> void Out(T x) { cout << x << endl; } template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if (f) Out(y); else Out(n); } using vec = vector<int>; using mat = vector<vec>; using Pii = pair<int, int>; using PiP = pair<int, Pii>; using PPi = pair<Pii, int>; using bools = vector<bool>; using pairs = vector<Pii>; // int dx[4] = {1,0,-1,0}; // int dy[4] = {0,1,0,-1}; // char d[4] = {'D','R','U','L'}; const int mod = 1000000007; // const int mod = 998244353; // #define Add(x, y) x = (x + (y)) % mod // #define Mult(x, y) x = (x * (y)) % mod #include <bits/stdc++.h> using namespace std; signed main() { int N; cin >> N; vec h(N); REP(i, N) cin >> h[i]; int sum = INF; vec DP(10001, INF); DP[0] = 0; FOR(i, 1, N) { DP[i] = min(DP[i], DP[i - 1] + abs(h[i] - h[i - 1])); if (i > 1) DP[i] = min(DP[i], DP[i - 2] + abs(h[i] - h[i - 2])); } Out(DP[N - 1]); }
#include <bits/stdc++.h> using namespace std; /*#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/ struct fast_ios { fast_ios() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for (int i = (begin); i < (end); i++) #define REP(i, n) FOR(i, 0, n) #define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--) #define IREP(i, n) IFOR(i, 0, n) #define Sort(v) sort(v.begin(), v.end()) #define Reverse(v) reverse(v.begin(), v.end()) #define all(v) v.begin(), v.end() #define SZ(v) ((int)v.size()) #define Lower_bound(v, x) \ distance(v.begin(), lower_bound(v.begin(), v.end(), x)) #define Upper_bound(v, x) \ distance(v.begin(), upper_bound(v.begin(), v.end(), x)) #define Max(a, b) a = max(a, b) #define Min(a, b) a = min(a, b) #define bit(n) (1LL << (n)) #define bit_exist(x, n) ((x >> n) & 1) #define debug(x) cout << #x << "=" << x << endl; #define vdebug(v) \ { \ cout << #v << "=" << endl; \ REP(i_debug, v.size()) { cout << v[i_debug] << ","; } \ cout << endl; \ } #define mdebug(m) \ { \ cout << #m << "=" << endl; \ REP(i_debug, m.size()) { \ REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << ","; } \ cout << endl; \ } \ } #define Return(ans) \ { \ cout << (ans) << endl; \ return 0; \ } #define pb push_back #define f first #define s second #define int long long #define INF 1000000000000000000 template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { for (int i = 0; i < v.size(); i++) { cout << v[i]; if (i != v.size() - 1) cout << endl; }; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { cout << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T> void Out(T x) { cout << x << endl; } template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if (f) Out(y); else Out(n); } using vec = vector<int>; using mat = vector<vec>; using Pii = pair<int, int>; using PiP = pair<int, Pii>; using PPi = pair<Pii, int>; using bools = vector<bool>; using pairs = vector<Pii>; // int dx[4] = {1,0,-1,0}; // int dy[4] = {0,1,0,-1}; // char d[4] = {'D','R','U','L'}; const int mod = 1000000007; // const int mod = 998244353; // #define Add(x, y) x = (x + (y)) % mod // #define Mult(x, y) x = (x * (y)) % mod #include <bits/stdc++.h> using namespace std; signed main() { int N; cin >> N; vec h(N); REP(i, N) cin >> h[i]; vec DP(100001, INF); DP[0] = 0; FOR(i, 1, N) { DP[i] = min(DP[i], DP[i - 1] + abs(h[i] - h[i - 1])); if (i > 1) DP[i] = min(DP[i], DP[i - 2] + abs(h[i] - h[i - 2])); } Out(DP[N - 1]); }
replace
109
111
109
110
0
p03160
C++
Runtime Error
/*huzaifa242 copyright*/ #include <bits/stdc++.h> using namespace std; #define PI 3.1415926535897932384626 #define mod 1000000007 #define MAX 100005 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], h[n]; for (i = 0; i < n; i++) { cin >> h[i]; if (i == 0) a[i] = 0; else if (i == 1) a[i] = abs(h[i] - h[0]); else a[i] = min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2])); } cout << a[n - 1] << "\n"; return 0; }
/*huzaifa242 copyright*/ #include <bits/stdc++.h> using namespace std; #define PI 3.1415926535897932384626 #define mod 1000000007 #define MAX 100005 int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); #ifdef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif int n, i; cin >> n; int a[n], h[n]; for (i = 0; i < n; i++) { cin >> h[i]; if (i == 0) a[i] = 0; else if (i == 1) a[i] = abs(h[i] - h[0]); else a[i] = min(a[i - 1] + abs(h[i] - h[i - 1]), a[i - 2] + abs(h[i] - h[i - 2])); } cout << a[n - 1] << "\n"; return 0; }
replace
9
10
9
10
-11
p03160
C++
Runtime Error
// gauravsinghh #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define ll long long int #define ld long double #define db double #define pii pair<int, int> #define pll pair<long long, long long> #define sii set<int> #define sll set<long long> #define vii vector<int> #define vll vector<long long> #define mii map<int, int> #define mll map<long long, long long> #define lob lower_bound #define upb upper_bound #define ff first #define ss second #define pb push_back #define pf push_front #define ins insert #define mp make_pair #define w(t) \ cin >> t; \ while (t--) #define on cout << "\n" #define o2(a, b) cout << a << " " << b #define os cout << " " #define bitcount __builtin_popcount #define gcd __gcd #define endl "\n" #define present(s, x) (s.find(x) != s.end()) #define cpresent(s, x) (find(all(s), x) != s.end()) #define ford(container, it) \ for (__typeof(container.begin()) it = container.begin(); \ it != container.end(); it++) #define fors(container, it, a, b) \ for (__typeof(container.begin()) it = a; it != b; it++) #define MOD 1000000007 #define EPSILON 1e-9 #define PI 3.14159265358979323846 #define inf 999999999999999999 #define siz 100005 #define SIZ 1000005 #define SIZE 200005 #define fbo find_by_order #define ook order_of_key #define sz(s) (int)s.size() #define mem(n, m) memset(n, m, sizeof(n)) #define rep(i, n) for (ll i = 0; i < n; i++) #define ren(i, n) for (ll i = n - 1; i >= 0; i--) #define all(x) x.begin(), x.end() #define fo(i, a, b) for (ll i = a; i <= b; i++) #define ffo(i, a, b) for (ll i = a; i >= b; i--) #define MAX 100005 #define IOS \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds; void io_set() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } ll n, dp[100005], a[100005]; ll func() { dp[0] = 0; dp[1] = abs(a[1] - a[0]); fo(i, 2, n) { dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2])); } return dp[n - 1]; } signed main() { IOS io_set(); cin >> n; rep(i, n) { cin >> a[i]; } cout << func() << endl; return 0; }
// gauravsinghh #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; #define ll long long int #define ld long double #define db double #define pii pair<int, int> #define pll pair<long long, long long> #define sii set<int> #define sll set<long long> #define vii vector<int> #define vll vector<long long> #define mii map<int, int> #define mll map<long long, long long> #define lob lower_bound #define upb upper_bound #define ff first #define ss second #define pb push_back #define pf push_front #define ins insert #define mp make_pair #define w(t) \ cin >> t; \ while (t--) #define on cout << "\n" #define o2(a, b) cout << a << " " << b #define os cout << " " #define bitcount __builtin_popcount #define gcd __gcd #define endl "\n" #define present(s, x) (s.find(x) != s.end()) #define cpresent(s, x) (find(all(s), x) != s.end()) #define ford(container, it) \ for (__typeof(container.begin()) it = container.begin(); \ it != container.end(); it++) #define fors(container, it, a, b) \ for (__typeof(container.begin()) it = a; it != b; it++) #define MOD 1000000007 #define EPSILON 1e-9 #define PI 3.14159265358979323846 #define inf 999999999999999999 #define siz 100005 #define SIZ 1000005 #define SIZE 200005 #define fbo find_by_order #define ook order_of_key #define sz(s) (int)s.size() #define mem(n, m) memset(n, m, sizeof(n)) #define rep(i, n) for (ll i = 0; i < n; i++) #define ren(i, n) for (ll i = n - 1; i >= 0; i--) #define all(x) x.begin(), x.end() #define fo(i, a, b) for (ll i = a; i <= b; i++) #define ffo(i, a, b) for (ll i = a; i >= b; i--) #define MAX 100005 #define IOS \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL); typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds; void io_set() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } ll n, dp[100005], a[100005]; ll func() { dp[0] = 0; dp[1] = abs(a[1] - a[0]); fo(i, 2, n) { dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2])); } return dp[n - 1]; } signed main() { IOS // io_set(); cin >> n; rep(i, n) { cin >> a[i]; } cout << func() << endl; return 0; }
replace
86
88
86
90
0
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define int long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define vi vector<int> #define mii map<int, int> #define pqb priority_queue<int> #define pqs priority_queue<int, vi, greater<int>> #define setbits(x) __builtin_popcountll(x) #define zrobits(x) __builtin_ctzll(x) #define mod 1000000007 #define inf 1e18 #define ps(x, y) fixed << setprecision(y) << x #define mk(arr, n, type) type *arr = new type[n]; #define w(x) \ int x; \ cin >> x; \ while (x--) void FIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } int n, a[100005]; int dp[100005]; int frog1(int index) { if (index == n - 1) return 0; if (dp[n] != -1) return dp[n]; int left = abs(a[index] - a[index + 1]) + frog1(index + 1); int right = INT_MAX; if (index + 2 < n) { right = abs(a[index] - a[index + 2]) + frog1(index + 2); } return dp[index] = min(left, right); } int32_t main() { FIO(); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; } memset(dp, -1, sizeof(dp)); cout << frog1(0); return 0; }
#include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define int long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define vi vector<int> #define mii map<int, int> #define pqb priority_queue<int> #define pqs priority_queue<int, vi, greater<int>> #define setbits(x) __builtin_popcountll(x) #define zrobits(x) __builtin_ctzll(x) #define mod 1000000007 #define inf 1e18 #define ps(x, y) fixed << setprecision(y) << x #define mk(arr, n, type) type *arr = new type[n]; #define w(x) \ int x; \ cin >> x; \ while (x--) void FIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } int n, a[100005]; int dp[100005]; int frog1(int index) { if (index == n - 1) return 0; if (dp[index] != -1) return dp[index]; int left = abs(a[index] - a[index + 1]) + frog1(index + 1); int right = INT_MAX; if (index + 2 < n) { right = abs(a[index] - a[index + 2]) + frog1(index + 2); } return dp[index] = min(left, right); } int32_t main() { FIO(); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; } memset(dp, -1, sizeof(dp)); cout << frog1(0); return 0; }
replace
41
43
41
43
TLE
p03160
C++
Runtime Error
// gauravsinghh #include <bits/stdc++.h> using namespace std; using ll = long long int; using bigint = int64_t; #define pll pair<ll, ll> #define vll vector<ll> #define vpll vector<pll> #define lob lower_bound #define upb upper_bound #define ff first #define ss second #define pb push_back #define eb emplace_back #define pf push_front #define ins insert #define mp make_pair #define w(t) \ cin >> t; \ while (t--) #define bitcount __builtin_popcount #define endl "\n" #define sz(s) (int)s.size() #define mem(n, m) memset(n, m, sizeof(n)) #define deb(x) cout << #x << " = " << x << endl; #define rep(i, n) for (ll i = 0; i < n; i++) #define ren(i, n) for (ll i = n - 1; i >= 0; i--) #define all(x) x.begin(), x.end() #define fo(i, a, b) for (ll i = a; i <= b; i++) #define ffo(i, a, b) for (ll i = a; i >= b; i--) #define ffi(i, a, b, c) for (ll i = a; i <= b; i += c) #define IOS \ ios_base::sync_with_stdio(false); \ cin.tie(nullptr); \ cout.tie(nullptr); const int MOD = 1000000007; void io_set() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } ll n; ll a[100005]; ll dp[100005]; ll func(ll i) { if (i <= 1) { return 0; } if (i == 2) { dp[i] = abs(a[2] - a[1]); return dp[i]; } if (dp[i] != -1) { return dp[i]; } dp[i] = min(func(i - 1) + abs(a[i] - a[i - 1]), func(i - 2) + abs(a[i] - a[i - 2])); return dp[i]; } void solve() { cin >> n; rep(i, n) { cin >> a[i + 1]; } mem(dp, -1); cout << func(n); } int main() { IOS; io_set(); ll tt = 1; // cin >> tt; while (tt--) { solve(); } return 0; }
// gauravsinghh #include <bits/stdc++.h> using namespace std; using ll = long long int; using bigint = int64_t; #define pll pair<ll, ll> #define vll vector<ll> #define vpll vector<pll> #define lob lower_bound #define upb upper_bound #define ff first #define ss second #define pb push_back #define eb emplace_back #define pf push_front #define ins insert #define mp make_pair #define w(t) \ cin >> t; \ while (t--) #define bitcount __builtin_popcount #define endl "\n" #define sz(s) (int)s.size() #define mem(n, m) memset(n, m, sizeof(n)) #define deb(x) cout << #x << " = " << x << endl; #define rep(i, n) for (ll i = 0; i < n; i++) #define ren(i, n) for (ll i = n - 1; i >= 0; i--) #define all(x) x.begin(), x.end() #define fo(i, a, b) for (ll i = a; i <= b; i++) #define ffo(i, a, b) for (ll i = a; i >= b; i--) #define ffi(i, a, b, c) for (ll i = a; i <= b; i += c) #define IOS \ ios_base::sync_with_stdio(false); \ cin.tie(nullptr); \ cout.tie(nullptr); const int MOD = 1000000007; void io_set() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } ll n; ll a[100005]; ll dp[100005]; ll func(ll i) { if (i <= 1) { return 0; } if (i == 2) { dp[i] = abs(a[2] - a[1]); return dp[i]; } if (dp[i] != -1) { return dp[i]; } dp[i] = min(func(i - 1) + abs(a[i] - a[i - 1]), func(i - 2) + abs(a[i] - a[i - 2])); return dp[i]; } void solve() { cin >> n; rep(i, n) { cin >> a[i + 1]; } mem(dp, -1); cout << func(n); } int main() { IOS; // io_set(); ll tt = 1; // cin >> tt; while (tt--) { solve(); } return 0; }
replace
75
76
75
76
0
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; #define pii pair<int, int> #define pll pair<long long, long long> #define ll long long #define lcm(a, b) (a) / __gcd((a), (b)) * (b) #define pb push_back #define mp make_pair #define x first #define y second #define maxn 10000000000000 #define endl '\n' #define trace(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; int mod(int x, int y) { int s; s = abs(x) / y; if (x < 0) s--; return x - y * s; } int dir8[2][8] = {{1, -1, 0, 0, 1, -1, 1, -1}, {0, 0, 1, -1, 1, -1, -1, 1}}; int dir4[2][4] = {{1, -1, 0, 0}, {0, 0, 1, -1}}; ll m, n, row, col; ll memo[100006]; ll ara[100006]; ll dp(int i) { if (i == n - 1) return 0; if (memo[i] != -1) return memo[i]; ll p1 = maxn, p2 = maxn; if (i + 1 < n) p1 = dp(i + 1) + abs(ara[i] - ara[i + 1]); if (i + 2 < n) p2 = dp(i + 2) + abs(ara[i] - ara[i + 2]); return min(p1, p2); } void solve() { scanf("%lld", &n); for (int w = 0; w < n; w++) scanf("%lld", &ara[w]); ll ans = dp(0); printf("%lld\n", ans); } void test() { int t; // scanf("%d",&t); t = 1; for (int test = 1; test <= t; test++) { memset(memo, -1, sizeof memo); solve(); } } int main() { test(); return 0; }
#include <bits/stdc++.h> using namespace std; #define pii pair<int, int> #define pll pair<long long, long long> #define ll long long #define lcm(a, b) (a) / __gcd((a), (b)) * (b) #define pb push_back #define mp make_pair #define x first #define y second #define maxn 10000000000000 #define endl '\n' #define trace(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; int mod(int x, int y) { int s; s = abs(x) / y; if (x < 0) s--; return x - y * s; } int dir8[2][8] = {{1, -1, 0, 0, 1, -1, 1, -1}, {0, 0, 1, -1, 1, -1, -1, 1}}; int dir4[2][4] = {{1, -1, 0, 0}, {0, 0, 1, -1}}; ll m, n, row, col; ll memo[100006]; ll ara[100006]; ll dp(int i) { if (i == n - 1) return 0; if (memo[i] != -1) return memo[i]; ll p1 = maxn, p2 = maxn; if (i + 1 < n) p1 = dp(i + 1) + abs(ara[i] - ara[i + 1]); if (i + 2 < n) p2 = dp(i + 2) + abs(ara[i] - ara[i + 2]); memo[i] = min(p1, p2); return min(p1, p2); } void solve() { scanf("%lld", &n); for (int w = 0; w < n; w++) scanf("%lld", &ara[w]); ll ans = dp(0); printf("%lld\n", ans); } void test() { int t; // scanf("%d",&t); t = 1; for (int test = 1; test <= t; test++) { memset(memo, -1, sizeof memo); solve(); } } int main() { test(); return 0; }
insert
43
43
43
44
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define REP(i, f, n) for (int i = f; i < n; i++) int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); int d[10000]; fill(d, d + n, 0); rep(i, n) cin >> a.at(i); d[1] = abs(a.at(1) - a.at(0)); REP(i, 2, n) { d[i] = min(abs(a.at(i) - a.at(i - 1)) + d[i - 1], abs(a.at(i) - a.at(i - 2)) + d[i - 2]); } cout << d[n - 1] << endl; return 0; }
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define REP(i, f, n) for (int i = f; i < n; i++) int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); int d[100005]; fill(d, d + n, 0); rep(i, n) cin >> a.at(i); d[1] = abs(a.at(1) - a.at(0)); REP(i, 2, n) { d[i] = min(abs(a.at(i) - a.at(i - 1)) + d[i - 1], abs(a.at(i) - a.at(i - 2)) + d[i - 2]); } cout << d[n - 1] << endl; return 0; }
replace
11
12
11
12
0
p03160
C++
Runtime Error
#include <algorithm> #include <bitset> #include <iostream> #include <set> #include <string> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> v; vector<int> cost; for (int i = 1; i < n + 1; ++i) { cin >> v[i]; } cost[1] = 0; cost[2] = cost[1] + abs(v[1] - v[2]); for (int i = 3; i < n + 1; ++i) { cost[i] = min(cost[i - 2] + abs(v[i - 2] - v[i]), cost[i - 1] + abs(v[i - 1] - v[i])); } cout << cost[n]; return 0; }
#include <algorithm> #include <bitset> #include <iostream> #include <set> #include <string> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> v(n + 1, 0); vector<int> cost(n + 1, 0); for (int i = 1; i < n + 1; ++i) { cin >> v[i]; } cost[1] = 0; cost[2] = cost[1] + abs(v[1] - v[2]); for (int i = 3; i < n + 1; ++i) { cost[i] = min(cost[i - 2] + abs(v[i - 2] - v[i]), cost[i - 1] + abs(v[i - 1] - v[i])); } cout << cost[n]; return 0; }
replace
11
13
11
13
-11
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int N; vector<int> height; vector<int> dp(N); cin >> N; int x; for (int i = 0; i < N; i++) { cin >> x; height.push_back(x); } dp[0] = 0; dp[1] = abs(height[0] - height[1]); for (int i = 2; i < N; i++) dp[i] = min(dp[i - 1] + abs(height[i - 1] - height[i]), dp[i - 2] + abs(height[i - 2] - height[i])); return dp[N - 1]; }
#include <bits/stdc++.h> using namespace std; int main() { int N; vector<int> height; vector<int> dp(N); cin >> N; int x; for (int i = 0; i < N; i++) { cin >> x; height.push_back(x); } dp[0] = 0; dp[1] = abs(height[0] - height[1]); for (int i = 2; i < N; i++) dp[i] = min(dp[i - 1] + abs(height[i - 1] - height[i]), dp[i - 2] + abs(height[i - 2] - height[i])); cout << dp[N - 1]; }
replace
20
21
20
21
-6
terminate called after throwing an instance of 'std::bad_alloc' what(): std::bad_alloc
p03160
C++
Runtime Error
#include <cstdlib> #include <iostream> #include <vector> using namespace std; template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } const long long INF = 1LL << 60; int N; long long h[10010]; long long dp[10010]; 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]; // 初期化 (最小化問題なので INF に初期化) for (int i = 0; i < 100010; ++i) dp[i] = INF; // 答え cout << rec(N - 1) << endl; }
#include <cstdlib> #include <iostream> #include <vector> using namespace std; template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } const long long INF = 1LL << 60; int N; long long h[100010]; long long dp[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]; // 初期化 (最小化問題なので INF に初期化) for (int i = 0; i < 100010; ++i) dp[i] = INF; // 答え cout << rec(N - 1) << endl; }
replace
22
24
22
24
-11
p03160
C++
Time Limit Exceeded
#include <bits/stdc++.h> using namespace std; long long int f(int *h, int i) { if (i <= 0) return 0; if (i == 1) return abs(h[i] - h[0]); long long int ans1 = f(h, i - 2) + abs(h[i] - h[i - 2]); long long int ans2 = f(h, i - 1) + abs(h[i] - h[i - 1]); return min(ans1, ans2); } int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; cout << f(a, n - 1); // long long int dp[n]; // dp[0]=0; // dp[1] = abs(a[1]-a[0]); // for(int i=2;i<n;i++) dp[i] = //min(dp[i-1]+abs(a[i]-a[i-1]),dp[i-2]+a[i]-a[i-2]); cout<<dp[n-1]; }
#include <bits/stdc++.h> using namespace std; long long int f(int *h, int i) { if (i <= 0) return 0; if (i == 1) return abs(h[i] - h[0]); long long int ans1 = f(h, i - 2) + abs(h[i] - h[i - 2]); long long int ans2 = f(h, i - 1) + abs(h[i] - h[i - 1]); return min(ans1, ans2); } int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; // cout<<f(a,n-1); long long int dp[n]; dp[0] = 0; dp[1] = abs(a[1] - a[0]); for (int i = 2; i < n; i++) dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]), dp[i - 2] + abs(a[i] - a[i - 2])); cout << dp[n - 1]; }
replace
17
23
17
25
TLE
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j; cin >> n; vector<int> dp(n), h(n); for (i = 0; i < n; i++) { cin >> h[i]; } for (i = 0; i < n; ++i) { if (i != 0) { dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1]), dp[i - 1] + abs(h[i + 1] - h[i - 1])); } else { dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]); } } cout << dp[n - 1] << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int n, i, j; cin >> n; vector<int> dp(n), h(n); for (i = 0; i < n; i++) { cin >> h[i]; } for (i = 0; i < n - 1; ++i) { if (i != 0) { dp[i + 1] = min(dp[i] + abs(h[i] - h[i + 1]), dp[i - 1] + abs(h[i + 1] - h[i - 1])); } else { dp[i + 1] = dp[i] + abs(h[i] - h[i + 1]); } } cout << dp[n - 1] << endl; }
replace
12
13
12
13
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int n, temp; cin >> n; vector<int> h(n, 0); for (int i = 0; i < n; i++) { cin >> temp; h[i] = temp; } vector<int> dp(n + 1, INT_MAX); dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])); } return dp[n - 1]; }
#include <bits/stdc++.h> using namespace std; int main() { int n, temp; cin >> n; vector<int> h(n, 0); for (int i = 0; i < n; i++) { cin >> temp; h[i] = temp; } vector<int> dp(n + 1, INT_MAX); dp[0] = 0; dp[1] = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2])); } cout << dp[n - 1]; }
replace
17
18
17
18
30
p03160
C++
Runtime Error
#include <cstdio> #include <iostream> using namespace std; int n, a[100001], f[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #ifndef ONLINE_JUDGE freopen("FROG1.inp", "r", stdin); freopen("FROG1.out", "w", stdout); #endif // ONLINE_JUDGE cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } f[1] = 0; f[2] = abs(a[2] - a[1]); for (int i = 3; i <= n; i++) { f[i] = min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2])); } cout << f[n]; return 0; }
#include <cstdio> #include <iostream> using namespace std; int n, a[100001], f[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } f[1] = 0; f[2] = abs(a[2] - a[1]); for (int i = 3; i <= n; i++) { f[i] = min(f[i - 1] + abs(a[i] - a[i - 1]), f[i - 2] + abs(a[i] - a[i - 2])); } cout << f[n]; return 0; }
delete
10
14
10
10
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define FOR(i, n, m) for (int i = (n); i < (m); i++) #define REP(i, n) FOR(i, 0, n) #define nax 10009 typedef vector<int> vi; int main() { int n, dp[nax]; cin >> n; vi v(n); REP(i, n) cin >> v[i]; memset(dp, 100000000, sizeof dp); dp[0] = 0; dp[1] = abs(v[1] - v[0]); FOR(i, 2, n) { dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2])); } cout << dp[n - 1]; return 0; }
#include <bits/stdc++.h> using namespace std; #define FOR(i, n, m) for (int i = (n); i < (m); i++) #define REP(i, n) FOR(i, 0, n) #define nax 100009 typedef vector<int> vi; int main() { int n, dp[nax]; cin >> n; vi v(n); REP(i, n) cin >> v[i]; memset(dp, 100000000, sizeof dp); dp[0] = 0; dp[1] = abs(v[1] - v[0]); FOR(i, 2, n) { dp[i] = min(dp[i - 1] + abs(v[i] - v[i - 1]), dp[i - 2] + abs(v[i] - v[i - 2])); } cout << dp[n - 1]; return 0; }
replace
5
6
5
6
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> #include <math.h> #define pb push_back #define fst first #define snd second #define fill(a, c) memset(&a, c, sizeof(a)) #define fore(i, x, y) for (ll i = x; i < y; i++) #define FIN \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) typedef long long ll; using namespace std; int main() { FIN; #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); #endif int n; cin >> n; int ar[n]; fore(i, 0, n) cin >> ar[i]; int weight[n]; fore(i, 0, n) weight[i] = -1; weight[0] = 0; weight[1] = abs(ar[1] - ar[0]); fore(i, 2, n) { weight[i] = min(abs(ar[i] - ar[i - 1]) + weight[i - 1], abs(ar[i] - ar[i - 2]) + weight[i - 2]); } cout << weight[n - 1] << "\n"; return 0; }
#include <bits/stdc++.h> #include <math.h> #define pb push_back #define fst first #define snd second #define fill(a, c) memset(&a, c, sizeof(a)) #define fore(i, x, y) for (ll i = x; i < y; i++) #define FIN \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) typedef long long ll; using namespace std; int main() { FIN; int n; cin >> n; int ar[n]; fore(i, 0, n) cin >> ar[i]; int weight[n]; fore(i, 0, n) weight[i] = -1; weight[0] = 0; weight[1] = abs(ar[1] - ar[0]); fore(i, 2, n) { weight[i] = min(abs(ar[i] - ar[i - 1]) + weight[i - 1], abs(ar[i] - ar[i - 2]) + weight[i - 2]); } cout << weight[n - 1] << "\n"; return 0; }
delete
18
21
18
18
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; #define END '\n' #define int long long #define pb push_back #define pii pair<int, int> #define loop(i, a, b) for (int i = (a); i < (b); i++) #define loopb(i, b, a) for (int i = (b); i > (a); --i) void fastscan(int &x) { bool neg = false; register int c; x = 0; c = getchar(); if (c == '-') { neg = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48; if (neg) x *= -1; } string alpha = "abcdefghijklmnopqrstuvwxyz"; const int mod = 1e9 + 7; const int inf = 2e18 + 5; const int nax = 100010; const int mod1 = 998244353; signed 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); freopen("error.txt", "w", stderr); #endif int n; cin >> n; vector<int> v; loop(i, 0, n) { int x; cin >> x; v.pb(x); } int dp[n]; dp[n - 2] = abs(v[n - 2] - v[n - 1]); dp[n - 3] = abs(v[n - 3] - v[n - 1]); loopb(i, n - 3, 0) { dp[i - 1] = min(dp[i] + abs(v[i] - v[i - 1]), dp[i + 1] + abs(v[i + 1] - v[i - 1])); } cout << dp[0]; return 0; }
#include <bits/stdc++.h> using namespace std; #define END '\n' #define int long long #define pb push_back #define pii pair<int, int> #define loop(i, a, b) for (int i = (a); i < (b); i++) #define loopb(i, b, a) for (int i = (b); i > (a); --i) void fastscan(int &x) { bool neg = false; register int c; x = 0; c = getchar(); if (c == '-') { neg = true; c = getchar(); } for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48; if (neg) x *= -1; } string alpha = "abcdefghijklmnopqrstuvwxyz"; const int mod = 1e9 + 7; const int inf = 2e18 + 5; const int nax = 100010; const int mod1 = 998244353; signed main() { int n; cin >> n; vector<int> v; loop(i, 0, n) { int x; cin >> x; v.pb(x); } int dp[n]; dp[n - 2] = abs(v[n - 2] - v[n - 1]); dp[n - 3] = abs(v[n - 3] - v[n - 1]); loopb(i, n - 3, 0) { dp[i - 1] = min(dp[i] + abs(v[i] - v[i - 1]), dp[i + 1] + abs(v[i + 1] - v[i - 1])); } cout << dp[0]; return 0; }
delete
30
38
30
30
-6
p03160
C++
Runtime Error
// Author: nimishkhurana #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (i = a; i < b; i++) #define rrep(i, b, a) for (i = b; i >= a; i--) #define ld long double #define ll long long #define umapi unordered_map<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vii vector<pii> #define vll vector<pll> #define pb push_back #define mk make_pair #define fastIO \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); #define INF 1000000000 template <typename T> ostream &operator<<(ostream &stream, const pair<T, T> &p) { return stream << "(" << p.first << "," << p.second << ") "; } int n; const int mxn = 1e5; int h[mxn]; int dp[mxn]; int solve(int i) { if (i == n - 1) return 0; if (dp[i] != -1) return dp[i]; if (i + 1 == n - 1) return dp[i] = abs(h[i + 1] - h[i]); return dp[i] = min(abs(h[i + 1] - h[i]) + solve(i + 1), abs(h[i + 2] - h[i]) + solve(i + 2)); } int solve_iterative() { int dp0 = 0; int dp1 = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { int temp = dp0; dp0 = dp1; dp1 = min(abs(h[i] - h[i - 1]) + dp1, abs(h[i - 2] - h[i]) + temp); } return dp1; } int main() { fastIO #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif memset(dp, -1, sizeof(dp)); cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << solve_iterative(); return 0; }
// Author: nimishkhurana #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (i = a; i < b; i++) #define rrep(i, b, a) for (i = b; i >= a; i--) #define ld long double #define ll long long #define umapi unordered_map<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vii vector<pii> #define vll vector<pll> #define pb push_back #define mk make_pair #define fastIO \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); #define INF 1000000000 template <typename T> ostream &operator<<(ostream &stream, const pair<T, T> &p) { return stream << "(" << p.first << "," << p.second << ") "; } int n; const int mxn = 1e5; int h[mxn]; int dp[mxn]; int solve(int i) { if (i == n - 1) return 0; if (dp[i] != -1) return dp[i]; if (i + 1 == n - 1) return dp[i] = abs(h[i + 1] - h[i]); return dp[i] = min(abs(h[i + 1] - h[i]) + solve(i + 1), abs(h[i + 2] - h[i]) + solve(i + 2)); } int solve_iterative() { int dp0 = 0; int dp1 = abs(h[1] - h[0]); for (int i = 2; i < n; i++) { int temp = dp0; dp0 = dp1; dp1 = min(abs(h[i] - h[i - 1]) + dp1, abs(h[i - 2] - h[i]) + temp); } return dp1; } int main() { fastIO // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); // #endif memset(dp, -1, sizeof(dp)); cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << solve_iterative(); return 0; }
replace
56
61
56
61
0
p03160
C++
Runtime Error
// Author: nimishkhurana #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (i = a; i < b; i++) #define rrep(i, b, a) for (i = b; i >= a; i--) #define ld long double #define ll long long #define umapi unordered_map<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vii vector<pii> #define vll vector<pll> #define pb push_back #define mk make_pair #define fastIO \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); #define INF 1000000000 template <typename T> ostream &operator<<(ostream &stream, const pair<T, T> &p) { return stream << "(" << p.first << "," << p.second << ") "; } int n; const int mxn = 1e5; int h[mxn]; int dp[mxn]; int solve(int i) { if (i == n - 1) return 0; if (dp[i] != -1) return dp[i]; if (i + 1 == n - 1) return dp[i] = abs(h[i + 1] - h[i]); return dp[i] = min(abs(h[i + 1] - h[i]) + solve(i + 1), abs(h[i + 2] - h[i]) + solve(i + 2)); } int main() { fastIO #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif memset(dp, -1, sizeof(dp)); cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << solve(0); return 0; }
// Author: nimishkhurana #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (i = a; i < b; i++) #define rrep(i, b, a) for (i = b; i >= a; i--) #define ld long double #define ll long long #define umapi unordered_map<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define vi vector<int> #define vl vector<ll> #define vii vector<pii> #define vll vector<pll> #define pb push_back #define mk make_pair #define fastIO \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); #define INF 1000000000 template <typename T> ostream &operator<<(ostream &stream, const pair<T, T> &p) { return stream << "(" << p.first << "," << p.second << ") "; } int n; const int mxn = 1e5; int h[mxn]; int dp[mxn]; int solve(int i) { if (i == n - 1) return 0; if (dp[i] != -1) return dp[i]; if (i + 1 == n - 1) return dp[i] = abs(h[i + 1] - h[i]); return dp[i] = min(abs(h[i + 1] - h[i]) + solve(i + 1), abs(h[i + 2] - h[i]) + solve(i + 2)); } int main() { fastIO // #ifndef ONLINE_JUDGE // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); // #endif memset(dp, -1, sizeof(dp)); cin >> n; for (int i = 0; i < n; i++) cin >> h[i]; cout << solve(0); return 0; }
replace
44
49
44
49
0
p03160
C++
Runtime Error
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; vector<int> h(N); for (int i = 1; i <= N; i++) { cin >> h[i]; } int answer = 0; vector<int> dp(N + 1); dp[0] = 0; dp[1] = 0; dp[2] = abs(h[1] - h[2]); for (int i = 3; i <= N; i++) { dp[i] = min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]); } cout << dp[N] << endl; }
#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; vector<int> h(N + 1); for (int i = 1; i <= N; i++) { cin >> h[i]; } int answer = 0; vector<int> dp(N + 1); dp[0] = 0; dp[1] = 0; dp[2] = abs(h[1] - h[2]); for (int i = 3; i <= N; i++) { dp[i] = min(abs(h[i - 2] - h[i]) + dp[i - 2], abs(h[i - 1] - h[i]) + dp[i - 1]); } cout << dp[N] << endl; }
replace
8
9
8
9
0
p03160
C++
Runtime Error
#include <algorithm> #include <cmath> #include <cstring> #include <fstream> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <stdio.h> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <vector> #define fastio \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL) #define foru(i, a, b) for (ll i = a; i < b; i++) #define ford(i, a, b) for (ll i = a; i >= b; i--) #define ain(a, n) \ for (ll i = 0; i < n; i++) \ cin >> a[i] #define aout(a, n) \ for (ll i = 0; i < n; i++) \ cout << a[i] << " " #define M 998244353 #define mp make_pair #define mt make_tuple #define cend cout << "\n" #define all(x) x.begin(), x.end() #define aout2(a, n, m) \ for (ll i = 0; i < n; i++) { \ for (ll j = 0; j < m; j++) { \ cout << a[i][j] << " "; \ } \ cout << endl; \ } #define ain2(a, n, m) \ for (ll i = 0; i < n; i++) { \ for (ll j = 0; j < m; j++) { \ cin >> a[i][j]; \ } \ } #define ff first #define ss second #define mset(a, b) memset(a, b, sizeof(a)) #ifndef ONLINE_JUDGE #define dbg(a) \ cerr << #a << ": "; \ _print(a); \ cerr << endl; #else #define dbg(a) // No more TLEs #endif using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<char> vch; typedef vector<string> vs; typedef set<ll> sll; typedef multiset<ll> msll; typedef pair<ll, ll> pll; typedef vector<pair<ll, ll>> vpll; template <class T, class V> void _print(pair<T, V> p) { cerr << "{" << p.ff << "," << p.ss << "}"; } template <class T> void _print(vector<T> v) { cerr << "[ "; for (T i : v) cerr << i << " "; cerr << "]"; } template <class T> void _print(set<T> s) { cerr << "[ "; for (T i : s) cerr << i << " "; cerr << "]"; } template <class T> void _print(T n) { cerr << n; } /*----------------------------- # --- MATH ALGORITHMS --- # * -----------------------------*/ template <class T> T gcd(T a, T b) { while (a != 0) { T temp = a; a = b % a; b = temp; } return b; } template <class T> T egcd(T a, T b, T &x, T &y) { T gcd, xt, yt; if (a == 0) { gcd = b; x = 0, y = 1; } else { gcd = egcd(b % a, a, xt, yt); x = yt - (b / a) * xt; y = xt; } return gcd; } template <class T> T expo(T base, T exp, T mod) { T res = 1; base = base % mod; while (exp > 0) { if (exp & 1) res = (res * base) % mod; exp = exp >> 1; base = (base * base) % mod; } return res; } template <class T> T modinv(T a, T mod) { T x, y; egcd<T>(a, mod, x, y); while (x < 0) x += mod; while (x >= mod) x -= mod; return x; } template <class T> T modinvfermat(T a, T mod) { return expo<T>(a, mod - 2, mod); } template <class T> bool rev(T a, T b) { return a > b; } template <class T> ll maxpower(T a, T b) { ll ans = 0; while (a > 0 && a % b == 0) { ans++; a /= b; } return ans; } template <class T> T mceil(T a, T b) { if (a % b == 0) return a / b; else return a / b + 1; } template <class T> T lcm(T a, T b) { return (a * b) / gcd<T>(a, b); } /*----------------------------- # --- MAIN CODE --- # * -----------------------------*/ int main() { fastio; #ifndef ONLINE_JUDGE freopen("testcase.txt", "r", stdin); freopen("error.txt", "w", stderr); freopen("output.txt", "w", stdout); #endif ll n; cin >> n; vll a(n); ain(a, n); vll dp(n); dp[0] = 0; dp[1] = abs(a[1] - a[0]); foru(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]; }
#include <algorithm> #include <cmath> #include <cstring> #include <fstream> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <set> #include <stack> #include <stdio.h> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <vector> #define fastio \ ios_base::sync_with_stdio(false); \ cin.tie(NULL); \ cout.tie(NULL) #define foru(i, a, b) for (ll i = a; i < b; i++) #define ford(i, a, b) for (ll i = a; i >= b; i--) #define ain(a, n) \ for (ll i = 0; i < n; i++) \ cin >> a[i] #define aout(a, n) \ for (ll i = 0; i < n; i++) \ cout << a[i] << " " #define M 998244353 #define mp make_pair #define mt make_tuple #define cend cout << "\n" #define all(x) x.begin(), x.end() #define aout2(a, n, m) \ for (ll i = 0; i < n; i++) { \ for (ll j = 0; j < m; j++) { \ cout << a[i][j] << " "; \ } \ cout << endl; \ } #define ain2(a, n, m) \ for (ll i = 0; i < n; i++) { \ for (ll j = 0; j < m; j++) { \ cin >> a[i][j]; \ } \ } #define ff first #define ss second #define mset(a, b) memset(a, b, sizeof(a)) #ifndef ONLINE_JUDGE #define dbg(a) \ cerr << #a << ": "; \ _print(a); \ cerr << endl; #else #define dbg(a) // No more TLEs #endif using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<char> vch; typedef vector<string> vs; typedef set<ll> sll; typedef multiset<ll> msll; typedef pair<ll, ll> pll; typedef vector<pair<ll, ll>> vpll; template <class T, class V> void _print(pair<T, V> p) { cerr << "{" << p.ff << "," << p.ss << "}"; } template <class T> void _print(vector<T> v) { cerr << "[ "; for (T i : v) cerr << i << " "; cerr << "]"; } template <class T> void _print(set<T> s) { cerr << "[ "; for (T i : s) cerr << i << " "; cerr << "]"; } template <class T> void _print(T n) { cerr << n; } /*----------------------------- # --- MATH ALGORITHMS --- # * -----------------------------*/ template <class T> T gcd(T a, T b) { while (a != 0) { T temp = a; a = b % a; b = temp; } return b; } template <class T> T egcd(T a, T b, T &x, T &y) { T gcd, xt, yt; if (a == 0) { gcd = b; x = 0, y = 1; } else { gcd = egcd(b % a, a, xt, yt); x = yt - (b / a) * xt; y = xt; } return gcd; } template <class T> T expo(T base, T exp, T mod) { T res = 1; base = base % mod; while (exp > 0) { if (exp & 1) res = (res * base) % mod; exp = exp >> 1; base = (base * base) % mod; } return res; } template <class T> T modinv(T a, T mod) { T x, y; egcd<T>(a, mod, x, y); while (x < 0) x += mod; while (x >= mod) x -= mod; return x; } template <class T> T modinvfermat(T a, T mod) { return expo<T>(a, mod - 2, mod); } template <class T> bool rev(T a, T b) { return a > b; } template <class T> ll maxpower(T a, T b) { ll ans = 0; while (a > 0 && a % b == 0) { ans++; a /= b; } return ans; } template <class T> T mceil(T a, T b) { if (a % b == 0) return a / b; else return a / b + 1; } template <class T> T lcm(T a, T b) { return (a * b) / gcd<T>(a, b); } /*----------------------------- # --- MAIN CODE --- # * -----------------------------*/ int main() { fastio; // #ifndef ONLINE_JUDGE // freopen("testcase.txt", "r", stdin); // freopen("error.txt", "w", stderr); // freopen("output.txt", "w", stdout); // #endif ll n; cin >> n; vll a(n); ain(a, n); vll dp(n); dp[0] = 0; dp[1] = abs(a[1] - a[0]); foru(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]; }
replace
156
161
156
161
0