problem_id
stringlengths 6
6
| language
stringclasses 2
values | original_status
stringclasses 3
values | original_src
stringlengths 19
243k
| changed_src
stringlengths 19
243k
| change
stringclasses 3
values | i1
int64 0
8.44k
| i2
int64 0
8.44k
| j1
int64 0
8.44k
| j2
int64 0
8.44k
| error
stringclasses 270
values | stderr
stringlengths 0
226k
|
|---|---|---|---|---|---|---|---|---|---|---|---|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long int
#define double long double
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define len(x) ((int)(x).length())
#define pii pair<int, int>
#define vi vector<int>
#define vd vector<double>
#define vs vector<string>
#define mp map<int, int>
#define ump unordered_map<int, int>
#define lb lower_bound
#define ub upper_bound
#define nx cout << "\n";
#define inf 9223372036854775807
#define PI 3.14159265
const int MOD = 1e9 + 7;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
inline int add(int a, int b) { return ((a % MOD) + (b % MOD)) % MOD; }
inline int multi(int a, int b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline int sub(int a, int b) {
a %= MOD;
b %= MOD;
a -= b;
if (a < 0)
a += MOD;
return a;
}
inline int power(int a, int b) {
a %= MOD;
int res = 1;
while (b > 0) {
if (b & 1) {
res = multi(res, a);
}
a = multi(a, a);
b >>= 1;
}
return res;
}
bool isPrime(int x) {
if (x <= 4 || x % 2 == 0 || x % 3 == 0) {
return x == 2 || x == 3;
}
for (int i = 5; i * i <= x; i += 6) {
if (x % i == 0 || x % (i + 2) == 0) {
return 0;
}
}
return 1;
}
int solve(int i, int n, int h[], int dp[]) {
if (i > n)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
if (i == n)
return 0;
return dp[i] = min(solve(i + 1, n, h, dp) + abs(h[i] - h[i + 1]),
solve(i + 2, n, h, dp) + abs(h[i] - h[i + 2]));
}
int32_t main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
int h[n + 5];
for (int i = 0; i < n; i++)
cin >> h[i];
h[n] = INT_MAX;
int dp[n];
memset(dp, -1, sizeof(dp));
cout << solve(0, n - 1, h, dp) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long int
#define double long double
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define len(x) ((int)(x).length())
#define pii pair<int, int>
#define vi vector<int>
#define vd vector<double>
#define vs vector<string>
#define mp map<int, int>
#define ump unordered_map<int, int>
#define lb lower_bound
#define ub upper_bound
#define nx cout << "\n";
#define inf 9223372036854775807
#define PI 3.14159265
const int MOD = 1e9 + 7;
inline int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline int lcm(int a, int b) { return a * b / gcd(a, b); }
inline int add(int a, int b) { return ((a % MOD) + (b % MOD)) % MOD; }
inline int multi(int a, int b) { return ((a % MOD) * (b % MOD)) % MOD; }
inline int sub(int a, int b) {
a %= MOD;
b %= MOD;
a -= b;
if (a < 0)
a += MOD;
return a;
}
inline int power(int a, int b) {
a %= MOD;
int res = 1;
while (b > 0) {
if (b & 1) {
res = multi(res, a);
}
a = multi(a, a);
b >>= 1;
}
return res;
}
bool isPrime(int x) {
if (x <= 4 || x % 2 == 0 || x % 3 == 0) {
return x == 2 || x == 3;
}
for (int i = 5; i * i <= x; i += 6) {
if (x % i == 0 || x % (i + 2) == 0) {
return 0;
}
}
return 1;
}
int solve(int i, int n, int h[], int dp[]) {
if (i > n)
return INT_MAX;
if (dp[i] != -1)
return dp[i];
if (i == n)
return 0;
return dp[i] = min(solve(i + 1, n, h, dp) + abs(h[i] - h[i + 1]),
solve(i + 2, n, h, dp) + abs(h[i] - h[i + 2]));
}
int32_t main() {
fast;
int n;
cin >> n;
int h[n + 5];
for (int i = 0; i < n; i++)
cin >> h[i];
h[n] = INT_MAX;
int dp[n];
memset(dp, -1, sizeof(dp));
cout << solve(0, n - 1, h, dp) << endl;
}
|
delete
| 84 | 88 | 84 | 84 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
typedef pair<int, int> P;
int dp[10000] = {}, h[100001] = {};
int main() {
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] = abs(h[i - 1] - h[i]);
else
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000000
typedef long long ll;
typedef pair<int, int> P;
int dp[100001] = {}, h[100001] = {};
int main() {
int n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
dp[i] = 0;
else if (i == 1)
dp[i] = abs(h[i - 1] - h[i]);
else
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i - 2] - h[i]));
}
cout << dp[n - 1] << "\n";
return 0;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
#define mod 1000000007
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define T(a) \
ll a; \
cin >> a;
#define TT(t) \
T(t); \
while (t--)
#define pb push_back
#define mp make_pair
const int INF = 1 << 29;
typedef long long ll;
#define int long long
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int &n, int b) { n |= two(b); }
inline void unset_bit(int &n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
ll powermod(ll x, ll y) {
ll res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
ll mulmod(ll a, ll b) {
ll res = 0;
a %= mod;
while (b) {
if (b & 1)
res = (res + a) % mod;
a = (2 * a) % mod;
b >>= 1;
}
return res;
}
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i += 6) {
if ((n % i == 0) || (n % (i + 2) == 0))
return false;
}
return true;
}
long double dist(ll x1, ll y1, ll x2, ll y2) {
return (long double)sqrt(
(long double)((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
}
ll squaredist(ll x1, ll y1, ll x2, ll y2) {
return ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
ll nCr(ll n, ll r) {
if (r == 0)
return 1;
return (n * nCr(n - 1, r - 1)) / r;
}
ll countDivisors(ll n) {
ll cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
cnt++;
else
cnt = cnt + 2;
}
}
return cnt;
}
ll modulo(ll a, ll b) {
ll r = a % b;
return r < 0 ? r + b : r;
}
void fs(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
if (negative)
number *= -1;
}
using namespace std;
// using namespace boost::multiprecision;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
T(n);
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
vector<int> dp(n + 1);
dp[2] = abs(v[1] - v[0]);
dp[3] = min(abs(v[2] - v[0]), dp[2] + abs(v[2] - v[1]));
FOR(i, 4, n) {
dp[i] = min(dp[i - 1] + abs(v[i - 1] - v[i - 2]),
dp[i - 2] + abs(v[i - 1] - v[i - 3]));
}
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
// #include<boost/multiprecision/cpp_int.hpp>
#define mod 1000000007
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define T(a) \
ll a; \
cin >> a;
#define TT(t) \
T(t); \
while (t--)
#define pb push_back
#define mp make_pair
const int INF = 1 << 29;
typedef long long ll;
#define int long long
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int &n, int b) { n |= two(b); }
inline void unset_bit(int &n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
if (a == b)
return a;
if (a > b)
return gcd(a - b, b);
return gcd(a, b - a);
}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll max(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll power(ll x, ll y) {
ll res = 1;
while (y > 0) {
if (y & 1)
res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
ll powermod(ll x, ll y) {
ll res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
ll mulmod(ll a, ll b) {
ll res = 0;
a %= mod;
while (b) {
if (b & 1)
res = (res + a) % mod;
a = (2 * a) % mod;
b >>= 1;
}
return res;
}
bool isPrime(ll n) {
if (n <= 1)
return false;
if (n <= 3)
return true;
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i += 6) {
if ((n % i == 0) || (n % (i + 2) == 0))
return false;
}
return true;
}
long double dist(ll x1, ll y1, ll x2, ll y2) {
return (long double)sqrt(
(long double)((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
}
ll squaredist(ll x1, ll y1, ll x2, ll y2) {
return ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
ll nCr(ll n, ll r) {
if (r == 0)
return 1;
return (n * nCr(n - 1, r - 1)) / r;
}
ll countDivisors(ll n) {
ll cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i)
cnt++;
else
cnt = cnt + 2;
}
}
return cnt;
}
ll modulo(ll a, ll b) {
ll r = a % b;
return r < 0 ? r + b : r;
}
void fs(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar())
number = number * 10 + c - 48;
if (negative)
number *= -1;
}
using namespace std;
// using namespace boost::multiprecision;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
T(n);
vector<int> v(n);
REP(i, n) { cin >> v[i]; }
vector<int> dp(n + 1);
if (n >= 2) {
dp[2] = abs(v[1] - v[0]);
}
if (n >= 3) {
dp[3] = min(abs(v[2] - v[0]), dp[2] + abs(v[2] - v[1]));
}
FOR(i, 4, n) {
dp[i] = min(dp[i - 1] + abs(v[i - 1] - v[i - 2]),
dp[i - 2] + abs(v[i - 1] - v[i - 3]));
}
cout << dp[n];
return 0;
}
|
replace
| 144 | 146 | 144 | 150 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int h[10000];
int dp[10000];
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
vector<int> h;
h.resize(n);
vector<int> dp(n);
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 5 | 7 | 5 | 8 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define ft first
#define sc second
#define ppb pop_back
#define sz size
#define forn(i, a, n) for (i = a; i < n; i++)
#define M 1000000007
#define inf 2e18
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);
ll t;
cin >> t;
ll i, arr[t];
for (i = 0; i < t; i++)
cin >> arr[i];
ll dp[t];
memset(dp, 0, sizeof dp);
dp[1] = abs(arr[1] - arr[0]);
for (i = 2; i < t; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[t - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define ft first
#define sc second
#define ppb pop_back
#define sz size
#define forn(i, a, n) for (i = a; i < n; i++)
#define M 1000000007
#define inf 2e18
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t;
cin >> t;
ll i, arr[t];
for (i = 0; i < t; i++)
cin >> arr[i];
ll dp[t];
memset(dp, 0, sizeof dp);
dp[1] = abs(arr[1] - arr[0]);
for (i = 2; i < t; i++)
dp[i] = min(dp[i - 1] + abs(arr[i] - arr[i - 1]),
dp[i - 2] + abs(arr[i] - arr[i - 2]));
cout << dp[t - 1];
return 0;
}
|
delete
| 15 | 19 | 15 | 15 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
const long long INF = 1LL << 60;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
long long dp[10010];
for (int i = 0; i < 10010; i++) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = abs(h.at(1) - h.at(0));
for (int i = 2; i < N; i++) {
long long d1 = dp[i - 1] + abs(h.at(i) - h.at(i - 1));
long long d2 = dp[i - 2] + abs(h.at(i) - h.at(i - 2));
dp[i] = min(dp[i], d1);
dp[i] = min(dp[i], d2);
}
cout << dp[N - 1] << endl;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
const long long INF = 1LL << 60;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
long long dp[100100];
for (int i = 0; i < 100100; i++) {
dp[i] = INF;
}
dp[0] = 0;
dp[1] = abs(h.at(1) - h.at(0));
for (int i = 2; i < N; i++) {
long long d1 = dp[i - 1] + abs(h.at(i) - h.at(i - 1));
long long d2 = dp[i - 2] + abs(h.at(i) - h.at(i - 2));
dp[i] = min(dp[i], d1);
dp[i] = min(dp[i], d2);
}
cout << dp[N - 1] << endl;
}
|
replace
| 16 | 18 | 16 | 18 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end()
#define pb push_back
#define pii pair<int, int>
#define vpii vector<pii>
#define f first
#define db double
#define s second
#define ll long long
#define ull unsigned long long
#define E '\n'
#define lmax 9223372036854775807;
#define MOD 1000000007
using namespace std;
vi v;
vvi ed;
void dfs(int i) {
v[i] = 1;
aut(j, ed[i]) if (!v[j]) dfs(j);
}
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("code.in", "r", stdin);
freopen("code.out", "w", stdout);
#endif
}
int main() {
Fast_IO();
int t;
// cin>>t;
t = 1;
while (t--) {
int n;
cin >> n;
vi arr(n);
vi dp(n, 0);
rep(i, n) cin >> arr[i];
dp[1] = abs(arr[1] - arr[0]);
forr(i, 2, n) dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
cout << dp[n - 1];
cout << E;
}
return 0;
}
|
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define forr(i, k, n) for (int i = k; i < n; i++)
#define iforr(i, k, n) for (int i = n - 1; i >= k; i--)
#define rep(i, n) forr(i, 0, n)
#define irep(i, n) iforr(i, 0, n)
#define aut(i, arr) for (auto &i : arr)
#define all(arr) arr.begin(), arr.end()
#define pb push_back
#define pii pair<int, int>
#define vpii vector<pii>
#define f first
#define db double
#define s second
#define ll long long
#define ull unsigned long long
#define E '\n'
#define lmax 9223372036854775807;
#define MOD 1000000007
using namespace std;
vi v;
vvi ed;
void dfs(int i) {
v[i] = 1;
aut(j, ed[i]) if (!v[j]) dfs(j);
}
void Fast_IO() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("code.in", "r", stdin);
freopen("code.out", "w", stdout);
#endif
}
int main() {
// Fast_IO();
int t;
// cin>>t;
t = 1;
while (t--) {
int n;
cin >> n;
vi arr(n);
vi dp(n, 0);
rep(i, n) cin >> arr[i];
dp[1] = abs(arr[1] - arr[0]);
forr(i, 2, n) dp[i] = min(dp[i - 2] + abs(arr[i] - arr[i - 2]),
dp[i - 1] + abs(arr[i] - arr[i - 1]));
cout << dp[n - 1];
cout << E;
}
return 0;
}
|
replace
| 37 | 38 | 37 | 38 |
-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;
int h[10000];
int dp[100000];
int main() {
int N;
cin >> N;
copy_n(istream_iterator<int>(cin), N, h);
memset(dp, N, 99999);
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];
}
|
#include <bits/stdc++.h>
using namespace std;
int h[100000];
int dp[100000];
int main() {
int N;
cin >> N;
copy_n(istream_iterator<int>(cin), N, h);
memset(dp, N, 99999);
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
| 3 | 4 | 3 | 4 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
#define ve vector
#define maxe(v) *max_element(v.begin(), v.end())
#define mine(v) *min_element(v.begin(), v.end())
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mp make_pair
#define M 1000000007
#define PRECISE cout.precision(18);
#define all(c) c.begin(), c.end()
#define sec second
#define fst first
#define tr(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
FAST ll n;
cin >> n;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll dp[n];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll i = 2; i <= n - 1; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
#define ve vector
#define maxe(v) *max_element(v.begin(), v.end())
#define mine(v) *min_element(v.begin(), v.end())
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define FAST \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define mp make_pair
#define M 1000000007
#define PRECISE cout.precision(18);
#define all(c) c.begin(), c.end()
#define sec second
#define fst first
#define tr(container, it) \
for (typeof(container.begin()) it = container.begin(); \
it != container.end(); it++)
int main() {
FAST ll n;
cin >> n;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll dp[n];
memset(dp, 0, sizeof(dp));
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll i = 2; i <= n - 1; i++) {
dp[i] =
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
|
delete
| 27 | 34 | 27 | 27 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll i, n;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
if (i >= 2)
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
else
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i, n;
cin >> n;
ll a[n];
for (i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
if (i >= 2)
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
else
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
}
cout << dp[n - 1] << endl;
return 0;
}
|
delete
| 6 | 10 | 6 | 6 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
#define int long long
#define vll vector<long long>
#define pii pair<long long, long long>
#define vvi vector<vector<long long>>
#define vpii vector<pair<int, int>>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define sec second
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define m_p make_pair
#define all(x) (x.begin(), x.end())
#define sz(v) ((int)(v.size()))
#define endl '\n'
typedef vector<long long> vi;
const int MOD = 1e9 + 7;
int size = 10000000;
int32_t main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int T = 1; // cin>>T;
while (T--) {
int n;
cin >> n;
vi h(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> h[i];
vi dp(n + 1, -1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i - 2 >= 1) {
if (dp[i] == -1)
dp[i] = dp[i - 2] + abs(h[i] - h[i - 2]);
else
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
if (dp[i] == -1)
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
else
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ll long long
#define int long long
#define vll vector<long long>
#define pii pair<long long, long long>
#define vvi vector<vector<long long>>
#define vpii vector<pair<int, int>>
#define pll pair<long long, long long>
#define pb push_back
#define ff first
#define sec second
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(a) sort(a.rbegin(), a.rend())
#define m_p make_pair
#define all(x) (x.begin(), x.end())
#define sz(v) ((int)(v.size()))
#define endl '\n'
typedef vector<long long> vi;
const int MOD = 1e9 + 7;
int size = 10000000;
int32_t main() {
fast;
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
*/
int T = 1; // cin>>T;
while (T--) {
int n;
cin >> n;
vi h(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> h[i];
vi dp(n + 1, -1);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
if (i - 2 >= 1) {
if (dp[i] == -1)
dp[i] = dp[i - 2] + abs(h[i] - h[i - 2]);
else
dp[i] = min(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
if (dp[i] == -1)
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
else
dp[i] = min(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n] << endl;
}
return 0;
}
|
replace
| 70 | 75 | 70 | 75 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
#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
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans = 0;
vi dp(n, 0);
dp[0] = 0;
if (n >= 1)
dp[1] = abs(a[1] - a[0]);
if (n >= 2) {
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]));
}
}
// for (int i = 0; i < n; ++i)
// {
// cout << dp[i] << " ";
// }
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define eb emplace_back
#define pb push_back
#define f first
#define s second
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans = 0;
vi dp(n, 0);
dp[0] = 0;
if (n >= 1)
dp[1] = abs(a[1] - a[0]);
if (n >= 2) {
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]));
}
}
// for (int i = 0; i < n; ++i)
// {
// cout << dp[i] << " ";
// }
cout << dp[n - 1] << endl;
return 0;
}
|
delete
| 26 | 32 | 26 | 26 |
-11
| |
p03160
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define bac(i, a, b) for (ll i = b - 1; i <= a; i--)
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define mod 1000000007
vi v(100000, -1);
int result(vi ve, int indx, int size) {
if (v[indx] != -1)
return v[indx];
if (indx == size - 1)
return 0;
if (indx > size - 1)
return INT_MAX;
return v[indx] =
min(result(ve, indx + 1, size) + abs(ve[indx] - ve[indx + 1]),
indx + 2 <= size
? result(ve, indx + 2, size) + abs(ve[indx] - ve[indx + 2])
: INT_MAX);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a;
cin >> a;
vi vec(a + 1);
for (int i = 0; i < a; i++)
cin >> vec[i];
int b = vec[a - 2];
vec[a] = b;
int res = result(vec, 0, a);
cout << res << "\n";
v.clear();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define bac(i, a, b) for (ll i = b - 1; i <= a; i--)
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define mod 1000000007
vi v(100000, -1);
int result(vi &ve, int indx, int size) {
if (v[indx] != -1)
return v[indx];
if (indx == size - 1)
return 0;
if (indx > size - 1)
return INT_MAX;
return v[indx] =
min(result(ve, indx + 1, size) + abs(ve[indx] - ve[indx + 1]),
indx + 2 <= size
? result(ve, indx + 2, size) + abs(ve[indx] - ve[indx + 2])
: INT_MAX);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int a;
cin >> a;
vi vec(a + 1);
for (int i = 0; i < a; i++)
cin >> vec[i];
int b = vec[a - 2];
vec[a] = b;
int res = result(vec, 0, a);
cout << res << "\n";
v.clear();
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long int
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mii map<int, int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define MOD 1000000007
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define FORD(i, a, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, a[100001];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1]; // dp[i] reps cost to reach a[i]
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];
return 0;
}
|
#include <bits/stdc++.h>
#define int long long int
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mii map<int, int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define MOD 1000000007
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define FORD(i, a, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
int32_t main() {
int n, a[100001];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n + 1]; // dp[i] reps cost to reach a[i]
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];
return 0;
}
|
delete
| 18 | 25 | 18 | 18 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << "\n"
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long LINF = 1LL << 60;
int main() {
ll dp[10010];
REP(i, 10010) dp[i] = LINF;
dp[0] = 0;
ll n;
cin >> n;
vector<ll> h(n);
REP(i, n) cin >> h[i];
REPS(i, n) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << "\n"
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long LINF = 1LL << 60;
int main() {
ll dp[110000];
REP(i, 110000) dp[i] = LINF;
dp[0] = 0;
ll n;
cin >> n;
vector<ll> h(n);
REP(i, n) cin >> h[i];
REPS(i, n) {
chmin(dp[i], dp[i - 1] + abs(h[i] - h[i - 1]));
if (i > 1)
chmin(dp[i], dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 34 | 36 | 34 | 36 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long
#define M 998244353
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define F first
#define S second
#define Zero(dp) memset(dp, 0, sizeof(dp))
#define pb emplace_back
using namespace std;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
}
|
#include <bits/stdc++.h>
#define int long long
#define M 998244353
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define F first
#define S second
#define Zero(dp) memset(dp, 0, sizeof(dp))
#define pb emplace_back
using namespace std;
int32_t main() {
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
*/
ios int t = 1;
// cin>>t;
while (t--) {
int n;
cin >> n;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]),
dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[n - 1];
}
}
|
replace
| 15 | 19 | 15 | 21 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
#define ld long double
#define vi vector<ll>
const int INF = 1e9;
const int N = 100005;
vi h(N, 0);
vi dp(N, 0);
void solve() {
ll n;
cin >> n;
for (ll i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll 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];
}
int main() {
FASTIO;
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
#define ld long double
#define vi vector<ll>
const int INF = 1e9;
const int N = 100005;
vi h(N, 0);
vi dp(N, 0);
void solve() {
ll n;
cin >> n;
for (ll i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll 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];
}
int main() {
FASTIO;
/*
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
*/
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
replace
| 31 | 39 | 31 | 39 |
TLE
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<ll>
#define sz(x) ((int)(x).size())
#define pll pair<long long, long long>
#define mp make_pair
#define F first
#define S second
#define T \
int tt; \
cin >> tt; \
while (tt--)
#define fastio ios_base::sync_with_stdio(false);
#define endl '\n'
#define all(a) (a).begin(), (a).end()
#define display(x) \
for (auto i : x) \
cout << i << " "; \
cout << '\n';
#define input(x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define make(x, y) fill(all(x), y)
#define FO(i, startLoop, n) for (int i = startLoop; i < n; i++)
#define mod 1000000007
#define Y cout << "YES" << endl;
#define N cout << "NO" << endl;
#define ITFO(myiterator, mymap) \
for (auto myiterator = mymap.begin(); myiterator != mymap.end(); ++myiterator)
using namespace std;
int main() {
fastio cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
vi a(n, 0), dp(n, INT_MAX);
input(a);
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
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];
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<ll>
#define sz(x) ((int)(x).size())
#define pll pair<long long, long long>
#define mp make_pair
#define F first
#define S second
#define T \
int tt; \
cin >> tt; \
while (tt--)
#define fastio ios_base::sync_with_stdio(false);
#define endl '\n'
#define all(a) (a).begin(), (a).end()
#define display(x) \
for (auto i : x) \
cout << i << " "; \
cout << '\n';
#define input(x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define make(x, y) fill(all(x), y)
#define FO(i, startLoop, n) for (int i = startLoop; i < n; i++)
#define mod 1000000007
#define Y cout << "YES" << endl;
#define N cout << "NO" << endl;
#define ITFO(myiterator, mymap) \
for (auto myiterator = mymap.begin(); myiterator != mymap.end(); ++myiterator)
using namespace std;
int main() {
fastio cin.tie(NULL);
cout.tie(0);
int n;
cin >> n;
vi a(n, 0), dp(n, INT_MAX);
input(a);
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
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];
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
delete
| 40 | 45 | 40 | 40 |
0
|
Time elapsed: 34ms
|
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define mi map<int, int>
#define umi unordered_map<int, int>
#define pii pair<int, int>
#define ff first
#define ss second
#define inf 1e18
#define case \
int t; \
cin >> t; \
while (t--)
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> pbds;
void pre() {
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
}
int32_t main() {
pre();
// case
{
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
cout << abs(a[0] - a[1]);
return 0;
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
int s1 = dp[i - 1] + abs(a[i - 1] - a[i]);
int s2 = dp[i - 2] + abs(a[i - 2] - a[i]);
dp[i] = min(s1, s2);
}
cout << dp[n - 1];
}
return 0;
}
|
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define mi map<int, int>
#define umi unordered_map<int, int>
#define pii pair<int, int>
#define ff first
#define ss second
#define inf 1e18
#define case \
int t; \
cin >> t; \
while (t--)
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> pbds;
void pre() {
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
}
int32_t main() { // pre();
// case
{
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
if (n == 2) {
cout << abs(a[0] - a[1]);
return 0;
}
int dp[n];
dp[0] = 0;
dp[1] = abs(a[0] - a[1]);
for (int i = 2; i < n; i++) {
int s1 = dp[i - 1] + abs(a[i - 1] - a[i]);
int s2 = dp[i - 2] + abs(a[i - 2] - a[i]);
dp[i] = min(s1, s2);
}
cout << dp[n - 1];
}
return 0;
}
|
replace
| 30 | 32 | 30 | 31 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(100, 0);
dp[0] = 0;
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] +=
min(dp[i - 1] + abs(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;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
vector<int> dp(100'000, 0);
dp[0] = 0;
dp[1] = dp[0] + abs(h[1] - h[0]);
for (int i = 2; i < N; i++) {
dp[i] +=
min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]));
}
cout << dp[N - 1] << endl;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03160
|
C++
|
Runtime Error
|
// Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!
#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;
using ll = long long;
using ld = long double;
#define pb emplace_back
#define push emplace
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define len(a) (int)a.size()
#define reset(a, val) memset(a, val, sizeof(a))
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
#define int long long
#define vll vector<int>
#define pll pair<int, int>
#define vvll vector<vector<int>>
#define vpll vector<pair<int, int>>
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// shuffle(a.begin(), a.end(), rng) or shuffle(a, a+n, rng) instead of
// random_shuffle uniform_int_distribution<int/ld>(l, r)(rng) for generating
// random integer/double numbers in [l, r]
#ifdef ONLINE_JUDGE
#define endl '\n'
#pragma comment(linker, "/stack:268435456")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif
#ifndef ONLINE_JUDGE
#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 *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif // ifndef ONLINE_JUDGE
struct custom_hash {
static int splitmix64(int x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(int x) const {
static const int FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <class T, class cmp = less<T>>
using ordered_set =
tree<T, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define unordered_map fast_unordered_map
template <class Key, class Value,
class Hash = std::hash<Key>> // Hash = custom_hash for ints
using fast_unordered_map = gp_hash_table<Key, Value, Hash>;
#define unordered_set fast_unordered_set
template <class Key, class Hash = std::hash<Key>> // Hash = custom_hash for ints
using fast_unordered_set = gp_hash_table<Key, null_type, Hash>;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i)
os << v[i] << " ";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto &it : v)
os << it << " ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.first << " " << v.second;
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto &it : v)
os << "(" << it.first << "=>" << it.second << ")" << endl;
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const unordered_map<T, S> &v) {
for (auto &it : v)
os << "(" << it.first << "=>" << it.second << ")" << endl;
return os;
}
const int mod = 1e9 + 7;
const int inf = 2e18;
const int ninf = -2e18;
int power(int x, int y, int mod = inf) {
int ans = 1;
x %= mod;
while (y > 0) {
if (y % 2)
ans = (x * ans) % mod;
x = (x * x) % mod;
y >>= 1;
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
time_t t1, t2;
t1 = clock();
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int n;
cin >> n;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n];
t2 = clock();
#ifndef ONLINE_JUDGE
cerr << endl << "time taken: " << t2 - t1 << endl;
#endif // ONLINE_JUDGE
return 0;
}
|
// Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!
#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;
using ll = long long;
using ld = long double;
#define pb emplace_back
#define push emplace
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define len(a) (int)a.size()
#define reset(a, val) memset(a, val, sizeof(a))
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill - cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
#define int long long
#define vll vector<int>
#define pll pair<int, int>
#define vvll vector<vector<int>>
#define vpll vector<pair<int, int>>
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// shuffle(a.begin(), a.end(), rng) or shuffle(a, a+n, rng) instead of
// random_shuffle uniform_int_distribution<int/ld>(l, r)(rng) for generating
// random integer/double numbers in [l, r]
#ifdef ONLINE_JUDGE
#define endl '\n'
#pragma comment(linker, "/stack:268435456")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#endif
#ifndef ONLINE_JUDGE
#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 *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif // ifndef ONLINE_JUDGE
struct custom_hash {
static int splitmix64(int x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(int x) const {
static const int FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template <class T, class cmp = less<T>>
using ordered_set =
tree<T, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define unordered_map fast_unordered_map
template <class Key, class Value,
class Hash = std::hash<Key>> // Hash = custom_hash for ints
using fast_unordered_map = gp_hash_table<Key, Value, Hash>;
#define unordered_set fast_unordered_set
template <class Key, class Hash = std::hash<Key>> // Hash = custom_hash for ints
using fast_unordered_set = gp_hash_table<Key, null_type, Hash>;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i)
os << v[i] << " ";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto &it : v)
os << it << " ";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << v.first << " " << v.second;
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto &it : v)
os << "(" << it.first << "=>" << it.second << ")" << endl;
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const unordered_map<T, S> &v) {
for (auto &it : v)
os << "(" << it.first << "=>" << it.second << ")" << endl;
return os;
}
const int mod = 1e9 + 7;
const int inf = 2e18;
const int ninf = -2e18;
int power(int x, int y, int mod = inf) {
int ans = 1;
x %= mod;
while (y > 0) {
if (y % 2)
ans = (x * ans) % mod;
x = (x * x) % mod;
y >>= 1;
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
time_t t1, t2;
t1 = clock();
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// freopen("error.txt", "w", stderr);
// #endif
int n;
cin >> n;
int h[n + 1];
for (int i = 1; i <= n; i++)
cin >> h[i];
int dp[n + 1];
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (int i = 3; i <= n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n];
t2 = clock();
#ifndef ONLINE_JUDGE
cerr << endl << "time taken: " << t2 - t1 << endl;
#endif // ONLINE_JUDGE
return 0;
}
|
replace
| 136 | 141 | 136 | 141 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define pb push_back
#define rep(a, b, c) for (int a = (int)b; a < (int)c; a++)
#define repk(a, b, c, k) for (int a = (int)b; a < (int)c; a += (int)k)
#define comeback \
std::ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1000000007
#define int long long int
#define pii pair<int, int>
#define ful(a) a.begin(), a.end()
#define ub upper_bound
#define lb lower_bound
#define ff first
#define ss second
using namespace std;
int em(int x, int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return em((x % mod * x % mod) % mod, n / 2);
else
return (x % mod * em((x % mod * x % mod) % mod, (n - 1) / 2)) % mod;
}
signed main() {
comeback
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
int i, j;
int t;
cin >> t;
int a[t + 1];
int dp[t + 1];
dp[1] = 0;
for (i = 1; i <= t; i++)
cin >> a[i];
for (i = 2; i <= t; i++) {
if (i - 2 >= 1) {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
} else
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
}
cout << dp[t];
}
|
#include <bits/stdc++.h>
#define pb push_back
#define rep(a, b, c) for (int a = (int)b; a < (int)c; a++)
#define repk(a, b, c, k) for (int a = (int)b; a < (int)c; a += (int)k)
#define comeback \
std::ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define mod 1000000007
#define int long long int
#define pii pair<int, int>
#define ful(a) a.begin(), a.end()
#define ub upper_bound
#define lb lower_bound
#define ff first
#define ss second
using namespace std;
int em(int x, int n) {
if (n == 0)
return 1;
else if (n % 2 == 0)
return em((x % mod * x % mod) % mod, n / 2);
else
return (x % mod * em((x % mod * x % mod) % mod, (n - 1) / 2)) % mod;
}
signed main() {
comeback
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w",stdout);
#endif*/
int i,
j;
int t;
cin >> t;
int a[t + 1];
int dp[t + 1];
dp[1] = 0;
for (i = 1; i <= t; i++)
cin >> a[i];
for (i = 2; i <= t; i++) {
if (i - 2 >= 1) {
dp[i] = min(dp[i - 1] + abs(a[i] - a[i - 1]),
dp[i - 2] + abs(a[i] - a[i - 2]));
} else
dp[i] = dp[i - 1] + abs(a[i] - a[i - 1]);
}
cout << dp[t];
}
|
replace
| 27 | 32 | 27 | 33 |
-11
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int dp[100009], h[100009];
int i, j, n;
cin >> n;
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
if (n >= 2)
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
return dp[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int dp[100009], h[100009];
int i, j, n;
cin >> n;
for (i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
if (n >= 2)
dp[1] = abs(h[1] - h[0]);
for (i = 2; i < n; i++) {
dp[i] =
min(dp[i - 2] + abs(h[i] - h[i - 2]), dp[i - 1] + abs(h[i] - h[i - 1]));
}
cout << dp[n - 1] << endl;
}
|
replace
| 15 | 16 | 15 | 16 |
30
| |
p03160
|
C++
|
Runtime Error
|
// AnkitCode99 here....
#include <bits/stdc++.h>
#define endl "\n"
typedef long long int ll;
#define MOD 1000000007
#define mp make_pair
#define pll pair<ll, ll>
#define pb push_back
// max xor btw range of two numbers..
#define max_XOR(a, b) (1 << int(log2(a ^ b) + 1)) - 1
#define vl vector<ll>
#define inf ll(1e18)
#define all(v) v.begin(), v.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (long long int i = a; i < b; i++)
#define nrep(i, a, b) for (long long int i = a; i >= b; i--)
#define ceil(a, b) a / b + ((a % b == 0) ? 0 : 1)
using namespace std;
const ll sz = 100005;
const ll szz = 1000006;
ll n;
ll ar[sz], cache[sz];
// TOP - DOWN Approach
ll dp(ll idx) {
if (idx > n)
return ll(1e9);
if (idx == n)
return 0;
if (cache[idx] != -1)
return cache[idx];
cache[idx] = min(abs(ar[idx] - ar[idx + 1]) + dp(idx + 1),
abs(ar[idx] - ar[idx + 2]) + dp(idx + 2));
return cache[idx];
}
int main() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("op.txt", "w", stdout);
#endif
cin >> n;
memset(cache, -1, sizeof cache);
rep(i, 1, n + 1) { cin >> ar[i]; }
cout << dp(1) << endl;
// rep(i,1,n+1)
// cout<<cache[i]<<" ";
} // Goodbye...
|
// AnkitCode99 here....
#include <bits/stdc++.h>
#define endl "\n"
typedef long long int ll;
#define MOD 1000000007
#define mp make_pair
#define pll pair<ll, ll>
#define pb push_back
// max xor btw range of two numbers..
#define max_XOR(a, b) (1 << int(log2(a ^ b) + 1)) - 1
#define vl vector<ll>
#define inf ll(1e18)
#define all(v) v.begin(), v.end()
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (long long int i = a; i < b; i++)
#define nrep(i, a, b) for (long long int i = a; i >= b; i--)
#define ceil(a, b) a / b + ((a % b == 0) ? 0 : 1)
using namespace std;
const ll sz = 100005;
const ll szz = 1000006;
ll n;
ll ar[sz], cache[sz];
// TOP - DOWN Approach
ll dp(ll idx) {
if (idx > n)
return ll(1e9);
if (idx == n)
return 0;
if (cache[idx] != -1)
return cache[idx];
cache[idx] = min(abs(ar[idx] - ar[idx + 1]) + dp(idx + 1),
abs(ar[idx] - ar[idx + 2]) + dp(idx + 2));
return cache[idx];
}
int main() {
fast;
cin >> n;
memset(cache, -1, sizeof cache);
rep(i, 1, n + 1) { cin >> ar[i]; }
cout << dp(1) << endl;
// rep(i,1,n+1)
// cout<<cache[i]<<" ";
} // Goodbye...
|
delete
| 47 | 51 | 47 | 47 |
0
| |
p03160
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ll n, i, j;
cin >> n;
ll arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[1] = abs(arr[1] - arr[0]);
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, i, j;
cin >> n;
ll arr[n];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
ll dp[n + 1];
memset(dp, 0, sizeof(dp));
dp[1] = abs(arr[1] - arr[0]);
for (i = 2; i < n; i++) {
dp[i] = min(dp[i - 1] + abs(arr[i - 1] - arr[i]),
dp[i - 2] + abs(arr[i - 2] - arr[i]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 14 | 18 | 14 | 15 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll inf = 1LL << 60;
const long double pi = 3.14159265358979323846;
// ****************************************CODE***************************************//
ll n, k, h[100100];
ll dp[100100];
ll rec(ll i) {
if (dp[i] != inf)
return dp[i];
if (i == 0)
return 0;
ll res = inf;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
res = min(res, rec(i - j) + abs(h[i] - h[i - 1]));
}
}
return dp[i] = res;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < 100100; i++)
dp[i] = inf;
cout << rec(n - 1) << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
// ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
// ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const ll mod = 1e9 + 7;
const ll inf = 1LL << 60;
const long double pi = 3.14159265358979323846;
// ****************************************CODE***************************************//
ll n, k, h[100100];
ll dp[100100];
ll rec(ll i) {
if (dp[i] != inf)
return dp[i];
if (i == 0)
return 0;
ll res = inf;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
res = min(res, rec(i - j) + abs(h[i] - h[i - j]));
}
return dp[i] = res;
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < 100100; i++)
dp[i] = inf;
cout << rec(n - 1) << endl;
}
|
replace
| 43 | 48 | 43 | 46 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
#define MAX 100005
using namespace std;
const int INF = 1e9 + 5;
ll arr[MAX];
vector<ll> dp(MAX, INF);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
for (int j = 1; j <= k; j++)
if (j > 0)
dp[i] = min(dp[i - j] + abs(arr[i] - arr[i - j]), dp[i]);
cout << dp[n] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MAX 100005
using namespace std;
const int INF = 1e9 + 5;
ll arr[MAX];
vector<ll> dp(MAX, INF);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
dp[1] = 0;
dp[2] = abs(arr[2] - arr[1]);
for (int i = 3; i <= n; i++)
for (int j = 1; j <= k; j++) {
if (i - j <= 0)
break;
dp[i] = min(dp[i - j] + abs(arr[i] - arr[i - j]), dp[i]);
}
cout << dp[n] << endl;
return 0;
}
|
replace
| 20 | 23 | 20 | 25 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int _min;
cin >> n >> k;
vector<int> h(n);
vector<int> dp(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
};
if (n <= k + 1) {
cout << abs(h.at(n - 1) - h.at(0)) << endl;
exit(1);
};
for (int i = 0; i <= k; i++) {
dp.at(i) = abs(h.at(i) - h.at(0));
};
for (int g = k + 1; g < n; g++) {
_min = 999999999;
for (int l = g - k; l < g; l++) {
_min = min(_min, dp.at(l) + abs(h.at(g) - h.at(l)));
}
dp.at(g) = _min;
};
cout << dp.at(n - 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int _min;
cin >> n >> k;
vector<int> h(n);
vector<int> dp(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
};
if (n <= k + 1) {
cout << abs(h.at(n - 1) - h.at(0)) << endl;
} else {
for (int i = 0; i <= k; i++) {
dp.at(i) = abs(h.at(i) - h.at(0));
};
for (int g = k + 1; g < n; g++) {
_min = 999999999;
for (int l = g - k; l < g; l++) {
_min = min(_min, dp.at(l) + abs(h.at(g) - h.at(l)));
}
dp.at(g) = _min;
};
cout << dp.at(n - 1) << endl;
}
return 0;
}
|
replace
| 15 | 29 | 15 | 28 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define COUT(x) cout << x << endl;
#define PB(x) push_back(x)
#define MP make_pair
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
// 0-index
vector<int> h(10010), dp(10010, INF);
rep(i, n) cin >> h[i];
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define COUT(x) cout << x << endl;
#define PB(x) push_back(x)
#define MP make_pair
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int INF = 1e9;
const int MOD = 1e9 + 7;
signed main() {
int n, k;
cin >> n >> k;
// 0-index
vector<int> h(100100), dp(100100, INF);
rep(i, n) cin >> h[i];
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 35 | 36 | 35 | 36 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define pb push_back
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define PI 3.1415926535897932384626
#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(type, arr, n) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
//=======================
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
//=======================
const int MOD = 1000000007;
const int N = 300005, M = N;
//=======================
vi g[N], adj[N];
int n, m, s, w, W, S, k, i, l, j, p, q, pr, fi, md;
void abhinay() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
abhinay();
cin >> n >> k;
vi dp(n + 1, MOD), v(n + 1);
dp[0] = 0;
fo(i, n) cin >> v[i];
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (j < n) {
dp[i] = min(abs(v[i] - v[i - j]) + dp[i - j], dp[i]);
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define pb push_back
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define PI 3.1415926535897932384626
#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(type, arr, n) type *arr = new type[n];
#define w(x) \
int x; \
cin >> x; \
while (x--)
//=======================
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
//=======================
const int MOD = 1000000007;
const int N = 300005, M = N;
//=======================
vi g[N], adj[N];
int n, m, s, w, W, S, k, i, l, j, p, q, pr, fi, md;
void abhinay() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
abhinay();
cin >> n >> k;
vi dp(n + 1, MOD), v(n + 1);
dp[0] = 0;
fo(i, n) cin >> v[i];
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++)
for (int j = 1; j <= k; j++)
if (i - j >= 0) {
dp[i] = min(abs(v[i] - v[i - j]) + dp[i - j], dp[i]);
}
cout << dp[n - 1];
return 0;
}
|
replace
| 53 | 54 | 53 | 54 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define sz(c) c.size()
#define fr first
#define sc second
#define pb push_back
#define sz(c) c.size()
#define ppb pop_back
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define U 1000000007
#define N 100005
#define ins insert
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int h[n], ans[n];
rep(i, 0, n) {
cin >> h[i];
ans[i] = INT_MAX;
}
ans[0] = 0;
rep(i, 0, n) {
rep(j, 1, k + 1) ans[i + j] =
min(ans[i + j], ans[i] + abs(h[i + j] - h[i]));
}
cout << ans[n - 1];
}
|
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define sz(c) c.size()
#define fr first
#define sc second
#define pb push_back
#define sz(c) c.size()
#define ppb pop_back
#define all(a) (a).begin(), (a).end()
#define rep(i, a, n) for (int i = a; i < n; i++)
#define U 1000000007
#define N 100005
#define ins insert
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int h[n], ans[n];
rep(i, 0, n) {
cin >> h[i];
ans[i] = INT_MAX;
}
ans[0] = 0;
rep(i, 0, n) {
rep(j, 1, k + 1) {
if (i + j < n)
ans[i + j] = min(ans[i + j], ans[i] + abs(h[i + j] - h[i]));
}
}
cout << ans[n - 1];
}
|
replace
| 28 | 30 | 28 | 32 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
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;
}
using namespace std;
int main() {
int N, K;
cin >> N >> K;
ll h[100010];
REP(i, N) cin >> h[i];
ll INF = 1LL << 60;
ll dp[100010];
REP(i, 100010) dp[i] = INF;
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 0; i < n; i++)
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;
}
using namespace std;
int main() {
int N, K;
cin >> N >> K;
ll h[100010];
REP(i, N) cin >> h[i];
ll INF = 1LL << 60;
ll dp[101000];
REP(i, 100010) dp[i] = INF;
dp[0] = 0;
REP(i, N) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[N - 1] << endl;
}
|
replace
| 28 | 29 | 28 | 29 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <iostream>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
const int INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
int h[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[100010];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
}
|
#include <iostream>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
const int INF = 1e9;
int main() {
int N, K;
cin >> N >> K;
int h[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
int dp[110000];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
}
|
replace
| 26 | 27 | 26 | 27 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
int N, K;
int H[100005];
int dp[100001];
int main() {
cin >> N >> K;
H[0] = INT32_MAX; // to avoid RTE
for (int i = 1; i <= N; i++)
cin >> H[i];
for (int i = 0; i <= N; i++)
dp[i] = INT32_MAX;
int ans = 0;
dp[N] = 0; // the base case
K = min(N - 1, K);
for (int i = N; i > 1; i--) {
for (int j = 1; j <= K; j++) {
dp[i - j] = min(dp[i - j], abs(H[i] - H[i - j]) + dp[i]);
}
}
cout << dp[1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
int N, K;
int H[100005];
int dp[100001];
int main() {
cin >> N >> K;
H[0] = INT32_MAX; // to avoid RTE
for (int i = 1; i <= N; i++)
cin >> H[i];
for (int i = 0; i <= N; i++)
dp[i] = INT32_MAX;
int ans = 0;
dp[N] = 0; // the base case
K = min(N - 1, K);
for (int i = N; i > 1; i--) {
for (int j = 1; j <= K; j++) {
if (i - j < 0)
break;
dp[i - j] = min(dp[i - j], abs(H[i] - H[i - j]) + dp[i]);
}
}
cout << dp[1] << endl;
return 0;
}
|
insert
| 25 | 25 | 25 | 27 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
// your code goes here
ll n, k;
cin >> n;
cin >> k;
ll arr[100001], dp[100001], i, ans;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (i = 1; i < 100001; i++) {
dp[i] = 1e9;
}
for (i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], abs(arr[i] - arr[i + j]) + dp[i]);
}
}
cout << dp[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
// your code goes here
ll n, k;
cin >> n;
cin >> k;
ll arr[100001], dp[10000001], i, ans;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
dp[0] = 0;
for (i = 1; i < 100001; i++) {
dp[i] = 1e9;
}
for (i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], abs(arr[i] - arr[i + j]) + dp[i]);
}
}
cout << dp[n - 1] << "\n";
return 0;
}
|
replace
| 9 | 10 | 9 | 10 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int array[n];
for (int x = 0; x < n; x++) {
cin >> array[x];
}
int dp[n];
dp[0] = 0;
for (int x = 0; x <= k; x++) {
dp[x] = abs(array[x] - array[0]);
for (int i = 0; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
for (int x = k + 1; x < n; x++) {
dp[x] = dp[x - k] + abs(array[x] - array[x - k]);
for (int i = x - k; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int array[n];
for (int x = 0; x < n; x++) {
cin >> array[x];
}
int dp[n];
dp[0] = 0;
for (int x = 0; x <= k && x < n; x++) {
dp[x] = abs(array[x] - array[0]);
for (int i = 0; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
for (int x = k + 1; x < n; x++) {
dp[x] = dp[x - k] + abs(array[x] - array[x - k]);
for (int i = x - k; i < x; i++) {
dp[x] = min(dp[x], dp[i] + abs(array[x] - array[i]));
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 16 | 17 | 16 | 17 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
int k;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - k] + abs(arr[i] - arr[i - j]));
}
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
int k;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 18 | 19 | 18 | 19 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
ll power(ll a, ll b) { // a^b
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a);
b--;
}
a = (a * a);
b >>= 1;
}
return res;
}
vl dp(100005, -1);
vl h(100005);
ll k;
ll jump(ll i) {
if (dp[i] != -1)
return dp[i];
if (i == 1) {
dp[1] = 0;
return dp[i];
}
ll mi = jump(i - 1) + abs(h[i] - h[i - 1]);
for (ll j = 2; j <= k; j++) {
if (i - j < 1)
break;
mi = min(mi, jump(i - j) + abs(h[i] - h[i - k]));
}
dp[i] = mi;
return dp[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
cin >> k;
for (ll i = 1; i <= n; i++)
cin >> h[i];
cout << jump(n) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
ll power(ll a, ll b) { // a^b
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a);
b--;
}
a = (a * a);
b >>= 1;
}
return res;
}
vl dp(100005, -1);
vl h(100005);
ll k;
ll jump(ll i) {
if (dp[i] != -1)
return dp[i];
if (i == 1) {
dp[1] = 0;
return dp[i];
}
ll mi = jump(i - 1) + abs(h[i] - h[i - 1]);
for (ll j = 2; j <= k; j++) {
if (i - j < 1)
break;
mi = min(mi, jump(i - j) + abs(h[i] - h[i - j]));
}
dp[i] = mi;
return dp[i];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
cin >> k;
for (ll i = 1; i <= n; i++)
cin >> h[i];
cout << jump(n) << "\n";
}
|
replace
| 36 | 37 | 36 | 37 |
0
| |
p03161
|
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;
struct _ {
ios_base::Init i;
_() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
}
} ___;
#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 *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define pii pair<int, int>
#define ff first
#define ss second
#define endll '\n'
#define rep(i, n) for (int i = 0; i++ < n;)
#define scl(i) scanf("%lld", &i);
#define int long long int
int dp[100005];
vector<int> arr(100005);
int k, n;
int call(int i) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int mini = 1e10;
for (int j = i + 1; j <= min(n, i + k); j++) {
mini = min(mini, abs(arr[i] - arr[j]) + call(j));
}
return dp[i] = mini;
}
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> n >> k;
rep(i, n) cin >> arr[i];
memset(dp, -1, sizeof dp);
cout << call(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;
struct _ {
ios_base::Init i;
_() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
}
} ___;
#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 *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define pii pair<int, int>
#define ff first
#define ss second
#define endll '\n'
#define rep(i, n) for (int i = 0; i++ < n;)
#define scl(i) scanf("%lld", &i);
#define int long long int
int dp[100005];
vector<int> arr(100005);
int k, n;
int call(int i) {
if (i == n)
return 0;
if (dp[i] != -1)
return dp[i];
int mini = 1e10;
for (int j = i + 1; j <= min(n, i + k); j++) {
mini = min(mini, abs(arr[i] - arr[j]) + call(j));
}
return dp[i] = mini;
}
signed main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
cin >> n >> k;
rep(i, n) cin >> arr[i];
memset(dp, -1, sizeof dp);
cout << call(1);
}
|
replace
| 57 | 61 | 57 | 61 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<int>>;
using Graph = vector<vector<int>>;
using VI = vector<int>;
using VC = vector<char>;
using PI = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) x.begin(), x.end()
const long long INF = 1LL << 60;
const int mod = 1000000007;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int N, K;
vector<int> h(10010);
vector<int> dp(10010, INT32_MAX);
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N >> K;
REP(i, N) cin >> h.at(i);
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = i - K; j < i; j++) {
if (j < 0)
continue;
chmin(dp.at(i), dp.at(j) + abs(h.at(j) - h.at(i)));
}
}
cout << dp.at(N - 1) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<int>>;
using Graph = vector<vector<int>>;
using VI = vector<int>;
using VC = vector<char>;
using PI = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) x.begin(), x.end()
const long long INF = 1LL << 60;
const int mod = 1000000007;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int N, K;
vector<int> h(100010);
vector<int> dp(100010, INT32_MAX);
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N >> K;
REP(i, N) cin >> h.at(i);
dp.at(0) = 0;
for (int i = 1; i < N; i++) {
for (int j = i - K; j < i; j++) {
if (j < 0)
continue;
chmin(dp.at(i), dp.at(j) + abs(h.at(j) - h.at(i)));
}
}
cout << dp.at(N - 1) << endl;
return 0;
}
|
replace
| 33 | 35 | 33 | 35 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
const int INF = 1e9 + 5;
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> c(n);
for (int &x : c)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; +j) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(c[i] - c[j]));
}
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
const int INF = 1e9 + 5;
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> c(n);
for (int &x : c)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; ++j) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(c[i] - c[j]));
}
}
cout << dp[n - 1];
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
/*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int dy[4] = {-1, 0, +1, 0};
int dx[4] = {0, +1, 0, -1};
const long long INF = 1LL << 60;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
int main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h[i] = tmp;
}
ll dp[100010];
for (int i = 0; i < 100010; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
|
/*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int dy[4] = {-1, 0, +1, 0};
int dx[4] = {0, +1, 0, -1};
const long long INF = 1LL << 60;
bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
return f.second > s.second;
}
int main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
h[i] = tmp;
}
ll dp[100100];
for (int i = 0; i < 100100; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 36 | 38 | 36 | 38 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define tc \
int t; \
cin >> t; \
while (t--)
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ff(i, a, b) for (i = a; i < b; i++)
#define fb(i, b, a) for (i = b; i > a; i--)
#define ffi(i, a, b, c) for (i = a; i < b; i += c)
#define fbi(i, b, a, c) for (i = b; i > a; i -= c)
#define clin(s) getline(cin, s)
#define MOD 1e9 + 7
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define ub upper_bound
#define lb lower_bound
int main() {
fio;
long n, k, i, j;
cin >> n >> k;
long arr[n];
long dp[n];
ff(i, 0, n) { cin >> arr[i]; }
dp[0] = 0;
ff(i, 1, k) { dp[i] = abs(arr[0] - arr[i]); }
ff(i, k, n) {
// dp[i]=min(dp[i-1]+abs(arr[i]-arr[i-1]),dp[i-2]+abs(arr[i]-arr[i-2]));
// cout<<dp[i]<<" ";
dp[i] = LONG_MAX;
ff(j, 1, k + 1) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
// cout<<"\n";
cout << dp[n - 1] << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define tc \
int t; \
cin >> t; \
while (t--)
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ff(i, a, b) for (i = a; i < b; i++)
#define fb(i, b, a) for (i = b; i > a; i--)
#define ffi(i, a, b, c) for (i = a; i < b; i += c)
#define fbi(i, b, a, c) for (i = b; i > a; i -= c)
#define clin(s) getline(cin, s)
#define MOD 1e9 + 7
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define ub upper_bound
#define lb lower_bound
int main() {
fio;
long n, k, i, j;
cin >> n >> k;
long arr[n];
long dp[n];
if (k > n)
k = n;
ff(i, 0, n) { cin >> arr[i]; }
dp[0] = 0;
ff(i, 1, k) { dp[i] = abs(arr[0] - arr[i]); }
ff(i, k, n) {
// dp[i]=min(dp[i-1]+abs(arr[i]-arr[i-1]),dp[i-2]+abs(arr[i]-arr[i-2]));
// cout<<dp[i]<<" ";
dp[i] = LONG_MAX;
ff(j, 1, k + 1) {
dp[i] = min(dp[i], dp[i - j] + abs(arr[i] - arr[i - j]));
}
}
// cout<<"\n";
cout << dp[n - 1] << "\n";
return 0;
}
|
insert
| 29 | 29 | 29 | 31 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
// 最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
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;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
REP(i, N) cin >> A[i];
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
}
print(dp[N - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000;
// long long
using ll = long long;
// 出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin() end()
#define all(x) (x).begin(), (x).end()
// for
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
// 最大公約数
unsigned gcd(unsigned a, unsigned b) {
if (a < b)
return gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
// 最小公倍数
unsigned lcm(unsigned a, unsigned b) { return a / gcd(a, b) * b; }
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;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
REP(i, N) cin >> A[i];
vector<int> dp(N, INF);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], abs(A[i] - A[i - j]) + dp[i - j]);
}
}
print(dp[N - 1]);
}
|
insert
| 63 | 63 | 63 | 65 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N, 1e9 + 7);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K + 1; j++) {
if (j - i < 0)
break;
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<int> dp(N, 1e9 + 7);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j < K + 1; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], abs(h[i] - h[i - j]) + dp[i - j]);
}
}
cout << dp[N - 1] << endl;
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int dp[100'000 + 5]; /// dp[i] = min cost to get from 0 to i
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> input(n);
for (int i = 0; i < n; i++)
cin >> input[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 2'000'000'000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - k] + abs(input[i] - input[i - k]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[100'000 + 5]; /// dp[i] = min cost to get from 0 to i
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> input(n);
for (int i = 0; i < n; i++)
cin >> input[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
dp[i] = 2'000'000'000;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(input[i] - input[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define pb push_back
#define mp make_pair
#define f(i, x, n) for (ll i = x; i < n; i++)
#define fl(i, x, n) for (ll i = n; i >= x; i--)
#define mod (ll)1e9 + 7
#define print(x) cout << x << endl
#define vec vector<ll>
#define pai pair<ll, ll>
#define itr(it) ::iterator it
#define MAX (ll)1e16
#define MIN (ll) - 1e16
#define X first
#define Y second
#define up upper_bound
#define lo lower_bound
using namespace std;
/////////// /// /// /// /// //////////// /// ///
/// /// /// /// /// /// /// /// ///
/// /// /// /// /// /// /// /// ///
/////////// /////////// /// /// //////////// ////////////
/// /// /// /// /// /// /// /// ///
/// /// /// /// /// /// /// /// ///
/////////// /// /// //////////// //////////// /// ///
ll minn(ll a, ll b) {
if (a > b)
return b;
return a;
}
ll maxx2(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll maxx(ll a, ll b, ll c) { return maxx2(a, maxx2(b, c)); }
ll gcdd(ll a, ll b) {
if (b == 0)
return a;
else
return gcdd(b, a % b);
}
ll dsum(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
ll poww(ll a, ll b) {
if (b <= 0)
return 1;
if (b == 1)
return a;
else
return poww(a, b / 2) * poww(a, b / 2) * poww(a, b % 2);
}
ll sumsq(ll x, ll y, ll z) {
return (x - y) * (x - y) + (y - z) * (y - z) + (z - x) * (z - x);
}
ll n, k, a[200001], dp[200001] = {0};
ll solve(ll i) {
if (dp[i] != 1000000000)
return dp[i];
if (i <= 0) {
return 0;
}
f(j, 1, k + 1) {
if ((i - j) >= 0) {
dp[i] = minn(dp[i], solve(i - j) + abs(a[i] - a[i - j]));
}
}
return dp[i];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
IOS;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin >> n >> k;
f(i, 0, n) { cin >> a[i]; }
f(i, 0, n) { dp[i] = 1000000000; }
ll ans = solve(n - 1);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define pb push_back
#define mp make_pair
#define f(i, x, n) for (ll i = x; i < n; i++)
#define fl(i, x, n) for (ll i = n; i >= x; i--)
#define mod (ll)1e9 + 7
#define print(x) cout << x << endl
#define vec vector<ll>
#define pai pair<ll, ll>
#define itr(it) ::iterator it
#define MAX (ll)1e16
#define MIN (ll) - 1e16
#define X first
#define Y second
#define up upper_bound
#define lo lower_bound
using namespace std;
/////////// /// /// /// /// //////////// /// ///
/// /// /// /// /// /// /// /// ///
/// /// /// /// /// /// /// /// ///
/////////// /////////// /// /// //////////// ////////////
/// /// /// /// /// /// /// /// ///
/// /// /// /// /// /// /// /// ///
/////////// /// /// //////////// //////////// /// ///
ll minn(ll a, ll b) {
if (a > b)
return b;
return a;
}
ll maxx2(ll a, ll b) {
if (a > b)
return a;
return b;
}
ll maxx(ll a, ll b, ll c) { return maxx2(a, maxx2(b, c)); }
ll gcdd(ll a, ll b) {
if (b == 0)
return a;
else
return gcdd(b, a % b);
}
ll dsum(ll n) {
ll sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
ll poww(ll a, ll b) {
if (b <= 0)
return 1;
if (b == 1)
return a;
else
return poww(a, b / 2) * poww(a, b / 2) * poww(a, b % 2);
}
ll sumsq(ll x, ll y, ll z) {
return (x - y) * (x - y) + (y - z) * (y - z) + (z - x) * (z - x);
}
ll n, k, a[200001], dp[200001] = {0};
ll solve(ll i) {
if (dp[i] != 1000000000)
return dp[i];
if (i <= 0) {
return 0;
}
f(j, 1, k + 1) {
if ((i - j) >= 0) {
dp[i] = minn(dp[i], solve(i - j) + abs(a[i] - a[i - j]));
}
}
return dp[i];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
IOS;
cin >> n >> k;
f(i, 0, n) { cin >> a[i]; }
f(i, 0, n) { dp[i] = 1000000000; }
ll ans = solve(n - 1);
cout << ans << endl;
return 0;
}
|
replace
| 83 | 87 | 83 | 84 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD = 1000000007;
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
REP(i, N) cin >> h[i];
vector<ll> ans(N, INF);
ans[0] = 0;
for (int i = 1; i < N; i++) {
REP(j, i) {
if (i - j > K)
continue;
ll comp = ans[j] + abs(h[i] - h[j]);
ans[i] = min(ans[i], comp);
}
}
// REP(i,N) cout<<ans[i]<<endl;
cout << ans[N - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD = 1000000007;
void print(const std::vector<int> &v) {
std::for_each(v.begin(), v.end(), [](int x) { std::cout << x << " "; });
std::cout << std::endl;
}
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
REP(i, N) cin >> h[i];
vector<ll> ans(N, INF);
ans[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = max(i - K, 0); j < i; j++) {
ll comp = ans[j] + abs(h[i] - h[j]);
ans[i] = min(ans[i], comp);
}
}
// REP(i,N) cout<<ans[i]<<endl;
cout << ans[N - 1] << endl;
return 0;
}
|
replace
| 39 | 42 | 39 | 40 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
// https://atcoder.jp/contests/dp/tasks/dp_b
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF (1e9)
#define MOD (1e9 + 7)
#define LINF (1e18)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// int gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// int lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n + k, INF);
REP(i, n) cin >> h[i];
// 入力値の足場の高さHの差分の合計を最小化する
vector<int> dp(n + k, INF);
dp[0] = 0;
// 配るDP
// for (int i = 0; i < n; i++) {
// for (int j = 1; j <= k; j++) {
// dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
// }
// }
// 貰うDP
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
// https://atcoder.jp/contests/dp/tasks/dp_b
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define INF (1e9)
#define MOD (1e9 + 7)
#define LINF (1e18)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
// int gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
// int lcm(long a, long b) { return a * b / gcd(a, b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n + k, INF);
REP(i, n) cin >> h[i];
// 入力値の足場の高さHの差分の合計を最小化する
vector<int> dp(n + k, INF);
dp[0] = 0;
// 配るDP
// for (int i = 0; i < n; i++) {
// for (int j = 1; j <= k; j++) {
// dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
// }
// }
// 貰うDP
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k && i - j >= 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 48 | 49 | 48 | 49 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int num;
int jump;
cin >> num >> jump;
vector<int> v;
int tmp;
for (int i = 0; i < num; i++) {
cin >> tmp;
v.push_back(tmp);
}
for (int i = 0; i <= jump + 10; i++) {
v.push_back(1000000);
}
array<int, 100010> ans;
for (int i = 0; i < 100010; i++) {
ans[i] = -1;
}
ans[0] = 0;
for (int i = 0; i < num - 1; i++) {
for (int j = 1; j <= jump; j++) {
if (ans[i + j] == -1) {
ans[i + j] = ans[i] + abs(v[i + j] - v[i]);
} else {
ans[i + j] = min(ans[i + j], ans[i] + abs(v[i + j] - v[i]));
}
}
}
cout << ans[num - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int num;
int jump;
cin >> num >> jump;
vector<int> v;
int tmp;
for (int i = 0; i < num; i++) {
cin >> tmp;
v.push_back(tmp);
}
for (int i = 0; i <= jump + 10; i++) {
v.push_back(1000000);
}
array<int, 110000> ans;
for (int i = 0; i < 100010; i++) {
ans[i] = -1;
}
ans[0] = 0;
for (int i = 0; i < num - 1; i++) {
for (int j = 1; j <= jump; j++) {
if (ans[i + j] == -1) {
ans[i + j] = ans[i] + abs(v[i + j] - v[i]);
} else {
ans[i + j] = min(ans[i + j], ans[i] + abs(v[i + j] - v[i]));
}
}
}
cout << ans[num - 1] << endl;
return 0;
}
|
replace
| 27 | 28 | 27 | 28 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> dp(N), c(N);
rep(i, 0, N) cin >> c[i];
dp[0] = 0;
rep(i, 1, K) dp[i] = abs(c[0] - c[i]);
rep(i, K, N) {
dp[i] = dp[i - 1] + abs(c[i - 1] - c[i]);
rep(j, 1, K) dp[i] = min(dp[i], dp[i - j - 1] + abs(c[i - j - 1] - c[i]));
}
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
int main() {
int N, K;
cin >> N >> K;
vector<int> dp(100005), c(N);
rep(i, 0, N) cin >> c[i];
dp[0] = 0;
rep(i, 1, K) dp[i] = abs(c[0] - c[i]);
rep(i, K, N) {
dp[i] = dp[i - 1] + abs(c[i - 1] - c[i]);
rep(j, 1, K) dp[i] = min(dp[i], dp[i - j - 1] + abs(c[i - j - 1] - c[i]));
}
cout << dp[N - 1] << endl;
}
|
replace
| 6 | 7 | 6 | 7 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
// c++ templte for
// help............................................................................................................................................
typedef long long ll;
// template<typename... T>
// void print1(T... t){
//((cout<<t<<" "),...);
//}
// template<typename... T>
// void print2(T... t){
// vector<vector<ll>> ans={t...};
// for(ll i=0;i<(ll)ans.size();i++){
// if(i!=0) cout<<"\t";
// else cout<<"\t";
// for(ll j=0;j<(ll)ans[i].size();j++){
// cout<<ans[i][j]<<" ";
//}
// if(i!=(ll)ans.size()-1)
// cout<<endl;
//}
//}
// #define deb(...) cout<<" [ "#__VA_ARGS__<<" : "; print1(__VA_ARGS__);
// cout<<"]"<<endl; #define vdeb(...) cout<<" [ "#__VA_ARGS__<<" : ";
// print2(__VA_ARGS__); cout<<"]"<<endl;
// for loop
#define fo(i, n) for (int i = 0; i < (ll)n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
// to print vector element
// template<typename T>
// void printV(T vec){
// fo(i,vec.size()) cout<<vec[i]<<" "<<flush;
// cout<<endl;
// }
#define modulo 1000000007
const int INF = 1e9 + 5;
// iterate map
// template<typename T>
// void itR(T map){
// for(auto itr=map.begin();itr!=map.end();itr++){
// deb(itr->first,itr->second);
//}
// cout<<endl;
//}
// c++ template for
// help...........................................................................................................................................
ll solve() {
ll n, k;
cin >> n >> k;
vector<int> vec(n);
fo(i, n) { cin >> vec[i]; }
vector<int> dp(n + 1, INF); // dp[n] -- n pa jane ma kintna cost lagega
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j <= n and i - j - 1 < n)
dp[i] = min(dp[i], dp[i - j] + abs(vec[i - 1] - vec[i - j - 1]));
}
}
return dp[n];
}
int main() {
// stringstream ss;
// ss<<"akhil";
// cout<<ss.str()<<endl;
cout << setprecision(50);
ios::sync_with_stdio(0);
cin.tie(0);
// TESTCASE KO DEKH KA BHAUT SARA CONDITION GENERATE MAT KRO
// PAPER PD CONFIRM HO JAO THORA JADA TIME HI KYU NA LGA
// greedy ma jadatr exceptional case check kr ke dekh lo
// WHILE DOING THE QUESTION OF DYNAMIC PROGRAMMING GREEDY KA TRAH SOCHNA BAND
// KRO DP M DATA KA BHI USE KRNA PDTA HA BE BHULO MT DP BHI WO LEETCODE WALE
// MATRIX KA QUESTION KI TARAH HA CONSTRAIN WILL BE THE DIMENSION OF DP DP MA
// STATE PTA KRO AUR PHIR FUNCTION GENERATE KRO OBJECT KO CHOOSE KIA YA NAE
// KIA AGAR KIA TO KYA HOGA AUR NAE KIA TO KYA HOGA KYA KYA CHEJ IMPORTANT HA
// WO STATE BN JAGA AUR HUM LOG STATE KO CHANGE KR SKTA HA JYSA KNPSACK 2 WALE
// PROBLEM MA KIA THA
// ll testCase;
// cin>>testCase;
// for(ll tt=0;tt<testCase;tt++){
// solve();
cout << solve() << endl;
//}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// c++ templte for
// help............................................................................................................................................
typedef long long ll;
// template<typename... T>
// void print1(T... t){
//((cout<<t<<" "),...);
//}
// template<typename... T>
// void print2(T... t){
// vector<vector<ll>> ans={t...};
// for(ll i=0;i<(ll)ans.size();i++){
// if(i!=0) cout<<"\t";
// else cout<<"\t";
// for(ll j=0;j<(ll)ans[i].size();j++){
// cout<<ans[i][j]<<" ";
//}
// if(i!=(ll)ans.size()-1)
// cout<<endl;
//}
//}
// #define deb(...) cout<<" [ "#__VA_ARGS__<<" : "; print1(__VA_ARGS__);
// cout<<"]"<<endl; #define vdeb(...) cout<<" [ "#__VA_ARGS__<<" : ";
// print2(__VA_ARGS__); cout<<"]"<<endl;
// for loop
#define fo(i, n) for (int i = 0; i < (ll)n; i++)
#define Fo(i, k, n) for (int i = k; i < n; i++)
// to print vector element
// template<typename T>
// void printV(T vec){
// fo(i,vec.size()) cout<<vec[i]<<" "<<flush;
// cout<<endl;
// }
#define modulo 1000000007
const int INF = 1e9 + 5;
// iterate map
// template<typename T>
// void itR(T map){
// for(auto itr=map.begin();itr!=map.end();itr++){
// deb(itr->first,itr->second);
//}
// cout<<endl;
//}
// c++ template for
// help...........................................................................................................................................
ll solve() {
ll n, k;
cin >> n >> k;
vector<int> vec(n);
fo(i, n) { cin >> vec[i]; }
vector<int> dp(n + 1, INF); // dp[n] -- n pa jane ma kintna cost lagega
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j - 1 >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(vec[i - 1] - vec[i - j - 1]));
}
}
return dp[n];
}
int main() {
// stringstream ss;
// ss<<"akhil";
// cout<<ss.str()<<endl;
cout << setprecision(50);
ios::sync_with_stdio(0);
cin.tie(0);
// TESTCASE KO DEKH KA BHAUT SARA CONDITION GENERATE MAT KRO
// PAPER PD CONFIRM HO JAO THORA JADA TIME HI KYU NA LGA
// greedy ma jadatr exceptional case check kr ke dekh lo
// WHILE DOING THE QUESTION OF DYNAMIC PROGRAMMING GREEDY KA TRAH SOCHNA BAND
// KRO DP M DATA KA BHI USE KRNA PDTA HA BE BHULO MT DP BHI WO LEETCODE WALE
// MATRIX KA QUESTION KI TARAH HA CONSTRAIN WILL BE THE DIMENSION OF DP DP MA
// STATE PTA KRO AUR PHIR FUNCTION GENERATE KRO OBJECT KO CHOOSE KIA YA NAE
// KIA AGAR KIA TO KYA HOGA AUR NAE KIA TO KYA HOGA KYA KYA CHEJ IMPORTANT HA
// WO STATE BN JAGA AUR HUM LOG STATE KO CHANGE KR SKTA HA JYSA KNPSACK 2 WALE
// PROBLEM MA KIA THA
// ll testCase;
// cin>>testCase;
// for(ll tt=0;tt<testCase;tt++){
// solve();
cout << solve() << endl;
//}
return 0;
}
|
replace
| 69 | 70 | 69 | 70 |
0
| |
p03161
|
C++
|
Runtime Error
|
/* Author : Harshit Jain a.k.a. iharshit009 */
#include <bits/stdc++.h>
#define vi vector<int>
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define sortrev(x) sort(all(x), greater<int>())
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define int long long
#define ld long double
#define endl "\n";
#define mp make_pair
#define pii <int, int>
#define lb lower_bound
#define ub upper_bound
#define len(a) int((a).size())
#define prec(n) fixed << setprecision(n)
#define cnt(n) __builtin_popcountll(n)
#define pi pair<int, int>
const int mod = 1000000007;
using namespace std;
using namespace std::chrono;
const int N = 1e5 + 5;
int n, k;
int a[N];
int dp[N];
int func(int idx) {
if (idx >= n)
return INT_MAX;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = INT_MAX;
for (int i = 1; i <= k; i++) {
ans = min(ans, abs(a[idx] - a[idx + i]) + func(idx + i));
}
return dp[idx] = ans;
}
int32_t main() {
auto start = high_resolution_clock::now(); // starting clock
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
t = 1;
// cin >>t;
while (t--) {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << func(0);
}
auto stop = high_resolution_clock::now(); // stop clock
auto duration =
duration_cast<microseconds>(stop - start); // printing duration
cerr << "Time taken by function: " << duration.count() << " milliseconds"
<< endl;
return 0;
}
|
/* Author : Harshit Jain a.k.a. iharshit009 */
#include <bits/stdc++.h>
#define vi vector<int>
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define sortrev(x) sort(all(x), greater<int>())
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define int long long
#define ld long double
#define endl "\n";
#define mp make_pair
#define pii <int, int>
#define lb lower_bound
#define ub upper_bound
#define len(a) int((a).size())
#define prec(n) fixed << setprecision(n)
#define cnt(n) __builtin_popcountll(n)
#define pi pair<int, int>
const int mod = 1000000007;
using namespace std;
using namespace std::chrono;
const int N = 1e5 + 5;
int n, k;
int a[N];
int dp[N];
int func(int idx) {
if (idx >= n)
return INT_MAX;
if (idx == n - 1)
return 0;
if (dp[idx] != -1)
return dp[idx];
int ans = INT_MAX;
for (int i = 1; i <= k && (idx + i < n);
i++) { //(idx+i < n) this cond is important otheriwse youwould get
//runtime error
ans = min(ans, abs(a[idx] - a[idx + i]) + func(idx + i));
}
return dp[idx] = ans;
}
int32_t main() {
auto start = high_resolution_clock::now(); // starting clock
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
t = 1;
// cin >>t;
while (t--) {
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << func(0);
}
auto stop = high_resolution_clock::now(); // stop clock
auto duration =
duration_cast<microseconds>(stop - start); // printing duration
cerr << "Time taken by function: " << duration.count() << " milliseconds"
<< endl;
return 0;
}
|
replace
| 34 | 35 | 34 | 37 |
0
|
Time taken by function: 1170 milliseconds
|
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 1, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<int> dp(n + 1, INF);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
else
break;
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 19 | 20 | 19 | 23 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
vector<ll> dp(10000, 1000000000);
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++) {
for (int j = 1; j <= K; j++) {
if (i >= j)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
vector<ll> dp(100000, 1000000000);
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++) {
for (int j = 1; j <= K; j++) {
if (i >= j)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[N - 1] << endl;
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03161
|
C++
|
Runtime Error
|
// #############################################################################
//----------------------------Karma is Real------------------------------------
#include "bits/stdc++.h"
// #############################################################################
// Macros
#define MOD 1000000007
#define eb emplace_back
#define mp make_pair
#define fr first
#define sc second
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
// Type Defs
typedef long long ll;
typedef unsigned long long ull;
// #############################################################################
using namespace std;
// #############################################################################
// Helpers
void io_handler() {
#ifndef ONLINE_JUDGE
freopen("inputf.in", "r", stdin);
freopen("outputf.in", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void print_matrix(vector<vector<ll>> mat) {
for (auto row : mat) {
for (auto e : row) {
cout << e << " ";
}
cout << endl;
}
}
void print_vector(vector<ll> vec) {
for (auto e : vec) {
cout << e << " ";
}
cout << endl;
}
map<int, int> get_count(vector<ll> vec) {
map<int, int> count;
for (auto e : vec) {
if (count.find(e) != count.end()) {
count[e]++;
} else {
count[e] = 1;
}
}
return count;
}
// #############################################################################
// Solution
void solve() {
ll n, k;
cin >> n >> k;
vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
vector<ll> dp(n, 1e11);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (ll i = 2; i < n; i++) {
for (ll j = max(i - k, 0LL); j < i; j++) {
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
}
}
// print_vector(dp);
cout << dp[n - 1] << endl;
}
// #############################################################################
// Driver
int main() {
io_handler();
int t = 1;
// cin>>t;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
}
// #############################################################################
|
// #############################################################################
//----------------------------Karma is Real------------------------------------
#include "bits/stdc++.h"
// #############################################################################
// Macros
#define MOD 1000000007
#define eb emplace_back
#define mp make_pair
#define fr first
#define sc second
#define len(x) x.size()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define all(v) v.begin(), v.end()
#define alla(a, n) a, a + n
// Type Defs
typedef long long ll;
typedef unsigned long long ull;
// #############################################################################
using namespace std;
// #############################################################################
// Helpers
void io_handler() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void print_matrix(vector<vector<ll>> mat) {
for (auto row : mat) {
for (auto e : row) {
cout << e << " ";
}
cout << endl;
}
}
void print_vector(vector<ll> vec) {
for (auto e : vec) {
cout << e << " ";
}
cout << endl;
}
map<int, int> get_count(vector<ll> vec) {
map<int, int> count;
for (auto e : vec) {
if (count.find(e) != count.end()) {
count[e]++;
} else {
count[e] = 1;
}
}
return count;
}
// #############################################################################
// Solution
void solve() {
ll n, k;
cin >> n >> k;
vector<ll> arr(n);
for (ll i = 0; i < n; i++) {
cin >> arr[i];
}
vector<ll> dp(n, 1e11);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for (ll i = 2; i < n; i++) {
for (ll j = max(i - k, 0LL); j < i; j++) {
dp[i] = min(dp[i], abs(arr[i] - arr[j]) + dp[j]);
}
}
// print_vector(dp);
cout << dp[n - 1] << endl;
}
// #############################################################################
// Driver
int main() {
io_handler();
int t = 1;
// cin>>t;
for (int i = 0; i < t; i++) {
solve();
}
return 0;
}
// #############################################################################
|
delete
| 23 | 27 | 23 | 23 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03161
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<ll>
#define sz(x) ((int)(x).size())
#define pll pair<long long, long long>
#define mp make_pair
#define F first
#define S second
#define T \
int tt; \
cin >> tt; \
while (tt--)
#define fastio ios_base::sync_with_stdio(false);
#define endl '\n'
#define all(a) (a).begin(), (a).end()
#define display(x) \
for (auto i : x) \
cout << i << " "; \
cout << '\n';
#define input(x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define make(x, y) fill(all(x), y)
#define FO(i, startLoop, n) for (int i = startLoop; i < n; i++)
#define mod 1000000007
#define Y cout << "YES" << endl;
#define N cout << "NO" << endl;
#define ITFO(myiterator, mymap) \
for (auto myiterator = mymap.begin(); myiterator != mymap.end(); ++myiterator)
using namespace std;
int main() {
fastio cin.tie(NULL);
cout.tie(0);
int n, k;
cin >> n >> k;
vi a(n, 0), dp(n, INT_MAX);
input(a);
dp[0] = 0;
if (k >= n) {
ll ans = INT_MAX;
for (int i = n - 2; i >= 0; ++i)
ans = min(ans, abs(a[i] - a[n - 1]));
cout << ans << endl;
return 0;
}
for (int i = 0; i < k; ++i)
dp[i] = abs(a[i] - a[0]);
for (int i = k; i < n; ++i) {
ll cnt = k, mm = INT_MAX, j = i - 1;
while (cnt-- && j >= 0) {
mm = min(mm, abs(a[i] - a[j]) + dp[j]);
j--;
}
dp[i] = mm;
}
cout << dp[n - 1];
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<ll>
#define sz(x) ((int)(x).size())
#define pll pair<long long, long long>
#define mp make_pair
#define F first
#define S second
#define T \
int tt; \
cin >> tt; \
while (tt--)
#define fastio ios_base::sync_with_stdio(false);
#define endl '\n'
#define all(a) (a).begin(), (a).end()
#define display(x) \
for (auto i : x) \
cout << i << " "; \
cout << '\n';
#define input(x) \
for (int i = 0; i < n; i++) \
cin >> x[i];
#define make(x, y) fill(all(x), y)
#define FO(i, startLoop, n) for (int i = startLoop; i < n; i++)
#define mod 1000000007
#define Y cout << "YES" << endl;
#define N cout << "NO" << endl;
#define ITFO(myiterator, mymap) \
for (auto myiterator = mymap.begin(); myiterator != mymap.end(); ++myiterator)
using namespace std;
int main() {
fastio cin.tie(NULL);
cout.tie(0);
int n, k;
cin >> n >> k;
vi a(n, 0), dp(n, INT_MAX);
input(a);
dp[0] = 0;
if (k >= n) {
ll ans = INT_MAX;
for (int i = n - 2; i >= 0; --i)
ans = min(ans, abs(a[i] - a[n - 1]));
cout << ans << endl;
return 0;
}
for (int i = 0; i < k; ++i)
dp[i] = abs(a[i] - a[0]);
for (int i = k; i < n; ++i) {
ll cnt = k, mm = INT_MAX, j = i - 1;
while (cnt-- && j >= 0) {
mm = min(mm, abs(a[i] - a[j]) + dp[j]);
j--;
}
dp[i] = mm;
}
cout << dp[n - 1];
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
replace
| 47 | 48 | 47 | 48 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
memset(b, 0x3f, 4 * n);
b[0] = 0;
for (int i = 1; i < k; i++)
b[i] = abs(a[i] - a[0]);
for (int i = k; i < n; i++) {
for (int j = i - k; j < i; j++) {
b[i] = min(b[i], b[j] + abs(a[i] - a[j]));
}
}
cout << b[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
memset(b, 0x3f, 4 * n);
b[0] = 0;
for (int i = 1; i < min(k, n); i++)
b[i] = abs(a[i] - a[0]);
for (int i = k; i < n; i++) {
for (int j = i - k; j < i; j++) {
b[i] = min(b[i], b[j] + abs(a[i] - a[j]));
}
}
cout << b[n - 1] << endl;
return 0;
}
|
replace
| 18 | 19 | 18 | 19 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
#define ld long double
#define vi vector<ll>
const int INF = 1e9;
const int N = 100005;
vi h(N, 0);
vi dp(N, INF);
void solve() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 1; j <= k && i - j >= 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
}
int main() {
FASTIO;
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
#define ld long double
#define vi vector<ll>
const int INF = 1e9;
const int N = 100005;
vi h(N, 0);
vi dp(N, INF);
void solve() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i < n; i++)
cin >> h[i];
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (ll i = 2; i < n; i++) {
for (ll j = 1; j <= k && i - j >= 0; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
}
int main() {
FASTIO;
/*
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
*/
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
|
replace
| 32 | 40 | 32 | 40 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp(ll i, ll k);
int n, k;
vector<ll> ans(10010, 0);
vector<ll> field(10010, 0);
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> field.at(i);
}
ans.at(0) = 0;
ans.at(1) = abs(field.at(1) - field.at(0));
for (int i = 2; i < n + 1; i++) {
ans.at(i) = ans.at(i - 1) + abs(field.at(i - 1) - field.at(i));
for (int o = 2; o < k + 1; o++) {
if (i - o >= 0) {
ans.at(i) =
min(ans.at(i), ans.at(i - o) + abs(field.at(i - o) - field.at(i)));
}
}
}
cout << ans.at(n - 1) << endl;
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp(ll i, ll k);
int n, k;
vector<ll> ans(100010, 0);
vector<ll> field(100010, 0);
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> field.at(i);
}
ans.at(0) = 0;
ans.at(1) = abs(field.at(1) - field.at(0));
for (int i = 2; i < n + 1; i++) {
ans.at(i) = ans.at(i - 1) + abs(field.at(i - 1) - field.at(i));
for (int o = 2; o < k + 1; o++) {
if (i - o >= 0) {
ans.at(i) =
min(ans.at(i), ans.at(i - o) + abs(field.at(i - o) - field.at(i)));
}
}
}
cout << ans.at(n - 1) << endl;
return (0);
}
|
replace
| 8 | 10 | 8 | 10 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
std::vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
std::vector<int> dp(N * 2, 1e9);
dp[0] = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j++)
dp[i + j + 1] = min(dp[i + j + 1], dp[i] + abs(v[i] - v[i + j + 1]));
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, K;
cin >> N >> K;
std::vector<int> v(N * 2, 1e9);
for (int i = 0; i < N; i++)
cin >> v[i];
std::vector<int> dp(N * 2, 1e9);
dp[0] = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < K; j++)
dp[i + j + 1] = min(dp[i + j + 1], dp[i] + abs(v[i] - v[i + j + 1]));
cout << dp[N - 1] << endl;
}
|
replace
| 7 | 8 | 7 | 8 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define endl '\n'
#define init(n) \
int n; \
cin >> n; \
int a[n]; \
rep(i, n) cin >> a[i];
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long int> vll;
typedef vector<pii> vii;
const int INF = 1e9 + 5;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int n, k;
cin >> n >> k;
vector<int> dp(n, INF);
int h[n];
rep(i, n) cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define endl '\n'
#define init(n) \
int n; \
cin >> n; \
int a[n]; \
rep(i, n) cin >> a[i];
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long int> vll;
typedef vector<pii> vii;
const int INF = 1e9 + 5;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int n, k;
cin >> n >> k;
vector<int> dp(n, INF);
int h[n];
rep(i, n) cin >> h[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 25 | 29 | 25 | 29 |
-6
|
terminate called after throwing an instance of 'std::__ios_failure'
what(): basic_ios::clear: iostream error
|
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define loop1(x, s, e) for (int x = s; x != e; x += 1 - 2 * (s > e))
#define input_matrix(a, m, n) \
for (int i = 0; i < m; i++) \
for (int j = 0; j < n; j++) \
cin >> a[i][j];
#define input_array(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define all(x) x.begin(), x.end()
#define newl "\n"
#define tests(t) \
int t; \
cin >> t; \
while (t--)
#define speed \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n);
loop1(i, 0, n) dp[i] = INT_MAX;
input_array(a, n);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i <= n; i++) {
for (int j = max(0, i - k); j < n; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define loop1(x, s, e) for (int x = s; x != e; x += 1 - 2 * (s > e))
#define input_matrix(a, m, n) \
for (int i = 0; i < m; i++) \
for (int j = 0; j < n; j++) \
cin >> a[i][j];
#define input_array(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define all(x) x.begin(), x.end()
#define newl "\n"
#define tests(t) \
int t; \
cin >> t; \
while (t--)
#define speed \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n), dp(n);
loop1(i, 0, n) dp[i] = INT_MAX;
input_array(a, n);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 1; i < n; i++) {
for (int j = i - k > 0 ? i - k : 0; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 32 | 34 | 32 | 34 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define has(c, i) ((c).find(i) != end(c))
#define has_str(s, c) ((s).find(c) != string::npos)
typedef long long ll;
int main() {
#ifdef LOCAL
// freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &i : h)
cin >> i;
vector<int> dp(n, 1e9 + 9);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < k + i; ++j) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[i + 1]));
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using indexed_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) ((v).begin()), ((v).end())
#define SZ(v) ((int)((v).size()))
#define clr(v, d) memset(v, d, sizeof(v))
#define has(c, i) ((c).find(i) != end(c))
#define has_str(s, c) ((s).find(c) != string::npos)
typedef long long ll;
int main() {
#ifdef LOCAL
// freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &i : h)
cin >> i;
vector<int> dp(n, 1e9 + 9);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j <= k + i; ++j) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 32 | 34 | 32 | 34 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define mod 1000000007
#define inf 1e18
#define w(x) \
int x; \
cin >> x; \
while (x--)
using namespace std;
bool sieve[100007];
void sieve_make() {
memset(sieve, true, sizeof(sieve));
sieve[0] = sieve[1] = false;
for (int i = 2; i * i <= 100006; i++) {
if (sieve[i]) {
for (int j = 2 * i; j <= 100006; j += i)
sieve[j] = false;
}
}
}
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 modexp(int a, int b, int c) {
if (a == 0)
return 0;
if (b == 0)
return 1;
int ans;
if (b % 2 == 0) {
int small = modexp(a, b / 2, c);
ans = (small * small) % c;
} else {
int small = modexp(a, b - 1, c);
ans = (a % c);
ans = (small * ans) % c;
}
return (ans + c) % c;
}
string rev(string s) {
reverse(s.begin(), s.end());
return s;
}
bool sign(int x) {
if (x > 0)
return true;
return false;
}
int base3(string b) {
int ans = 0, c = 0;
for (int i = b.length() - 1; i >= 0; i--) {
ans += (b[i] - '0') * pow(3, c++);
}
return ans;
}
int32_t main() {
ios::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n - 1];
}
|
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define mod 1000000007
#define inf 1e18
#define w(x) \
int x; \
cin >> x; \
while (x--)
using namespace std;
bool sieve[100007];
void sieve_make() {
memset(sieve, true, sizeof(sieve));
sieve[0] = sieve[1] = false;
for (int i = 2; i * i <= 100006; i++) {
if (sieve[i]) {
for (int j = 2 * i; j <= 100006; j += i)
sieve[j] = false;
}
}
}
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 modexp(int a, int b, int c) {
if (a == 0)
return 0;
if (b == 0)
return 1;
int ans;
if (b % 2 == 0) {
int small = modexp(a, b / 2, c);
ans = (small * small) % c;
} else {
int small = modexp(a, b - 1, c);
ans = (a % c);
ans = (small * ans) % c;
}
return (ans + c) % c;
}
string rev(string s) {
reverse(s.begin(), s.end());
return s;
}
bool sign(int x) {
if (x > 0)
return true;
return false;
}
int base3(string b) {
int ans = 0, c = 0;
for (int i = b.length() - 1; i >= 0; i--) {
ans += (b[i] - '0') * pow(3, c++);
}
return ans;
}
int32_t main() {
ios::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int dp[n];
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
dp[i] = INT_MAX;
for (int j = max(0, i - k); j < i; j++) {
dp[i] = min(dp[j] + abs(a[i] - a[j]), dp[i]);
}
}
cout << dp[n - 1];
}
|
delete
| 72 | 77 | 72 | 72 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define INF (int)(1e9)
// Relevant constraints
// 2 <= N <= 10^5
// 1 <= K <= 100
// 2 secs
// Generalized version of frog1
// to K possible steps instead of 2
// Naturally, this turns the complexity
// required from O(n) to O(nK)
// This is acceptable for our constraints
// Recurrence to optimize:
// c(n) = min({c(n - 1) + cost(n, n - 1), c(n - 2) + cost(n, n - 2), ...,
// c(n - k) + cost(n, n - k)})
// It doesn't matter how we use K in the future
// so that parameter is irrelevant for larger values
// and doesn't need to be stored
unordered_map<int, int> map_dp;
int solve_memo(const vector<int> &h, int n, int k) {
if (n < 0)
return INF;
if (n == 0)
return 0;
if (map_dp.find(n) != map_dp.end())
return map_dp[n];
int min_n = INF;
for (int i = 1; i <= k; ++i) {
min_n = min(min_n, solve_memo(h, n - i, k) + abs(h[n] - h[n - i]));
}
return map_dp[n] = min_n;
}
int solve_tab(const vector<int> &h, int n, int k) {
vector<int> dp(n);
// Initial conditions
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; ++i) {
int min_n = INF;
for (int j = 1; j <= k; ++j) {
if (i - j < 0)
break;
min_n = min(min_n, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = min_n;
}
// dp[n - 1] represents the minimum cost
// to get to stone n
// in general dp[i] represents the minimum
// cost to get to stone i
return dp[n - 1];
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
// n - 1 to accomodate the array size
cout << solve_memo(h, n - 1, k) << '\n';
// cout << solve_tab(h, n, k) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF (int)(1e9)
// Relevant constraints
// 2 <= N <= 10^5
// 1 <= K <= 100
// 2 secs
// Generalized version of frog1
// to K possible steps instead of 2
// Naturally, this turns the complexity
// required from O(n) to O(nK)
// This is acceptable for our constraints
// Recurrence to optimize:
// c(n) = min({c(n - 1) + cost(n, n - 1), c(n - 2) + cost(n, n - 2), ...,
// c(n - k) + cost(n, n - k)})
// It doesn't matter how we use K in the future
// so that parameter is irrelevant for larger values
// and doesn't need to be stored
unordered_map<int, int> map_dp;
int solve_memo(const vector<int> &h, int n, int k) {
if (n < 0)
return INF;
if (n == 0)
return 0;
if (map_dp.find(n) != map_dp.end())
return map_dp[n];
int min_n = INF;
for (int i = 1; i <= k; ++i) {
if (n - i < 0)
continue;
min_n = min(min_n, solve_memo(h, n - i, k) + abs(h[n] - h[n - i]));
}
return map_dp[n] = min_n;
}
int solve_tab(const vector<int> &h, int n, int k) {
vector<int> dp(n);
// Initial conditions
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; ++i) {
int min_n = INF;
for (int j = 1; j <= k; ++j) {
if (i - j < 0)
break;
min_n = min(min_n, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = min_n;
}
// dp[n - 1] represents the minimum cost
// to get to stone n
// in general dp[i] represents the minimum
// cost to get to stone i
return dp[n - 1];
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
// n - 1 to accomodate the array size
cout << solve_memo(h, n - 1, k) << '\n';
// cout << solve_tab(h, n, k) << '\n';
return 0;
}
|
insert
| 35 | 35 | 35 | 38 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, 1e9 + 5);
dp[1] = 0;
for (int i = 1; i < n + 1; i++) {
for (auto j = i + 1; j < i + k + 1; i++) {
if (j <= n) {
dp[j] = min(dp[j], dp[i] + abs(h[j - 1] - h[i - 1]));
}
}
}
cout << dp[n];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n, 0);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n + 1, 1e9 + 5);
dp[1] = 0;
for (int i = 1; i < n + 1; i++) {
for (auto j = i + 1; j < i + k + 1; j++) {
if (j <= n) {
dp[j] = min(dp[j], dp[i] + abs(h[j - 1] - h[i - 1]));
}
}
}
cout << dp[n];
return 0;
}
|
replace
| 12 | 13 | 12 | 13 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int climb_dp(int *h, int n, int k) {
int dp[n];
// Initialise states
dp[0] = 0;
for (int j = 1; j <= k; j++)
dp[j] = abs(h[j] - h[0]);
// Calculate the most optimal state for i
// building upon previous optimal states
for (int i = 2; i < n; i++) {
int min = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++)
if (i - j >= 0 && dp[i - j] + abs(h[i] - h[i - j]) < min)
min = dp[i - j] + abs(h[i] - h[i - j]);
dp[i] = min;
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cout << climb_dp(h, n, k);
return 0;
}
|
#include <iostream>
using namespace std;
int climb_dp(int *h, int n, int k) {
int dp[n];
// Initialise states
dp[0] = 0;
for (int j = 1; j <= k; j++)
dp[j] = abs(h[j] - h[0]);
// Calculate the most optimal state for i
// building upon previous optimal states
for (int i = 2; i < n; i++) {
int min = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; j++)
if (i - j >= 0 && dp[i - j] + abs(h[i] - h[i - j]) < min)
min = dp[i - j] + abs(h[i] - h[i - j]);
dp[i] = min;
}
return dp[n - 1];
}
int main() {
int n, k;
cin >> n >> k;
if (k > n)
k = n;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
cout << climb_dp(h, n, k);
return 0;
}
|
insert
| 28 | 28 | 28 | 31 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
int h[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n;
cin >> k;
int h[n];
int dp[n];
dp[0] = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
if (i == 0)
dp[0] = 0;
else
dp[i] = INT_MAX;
}
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k && i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9 + 5
int main() {
int n, k;
cin >> n >> k;
vector<int> hights(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> hights[i];
}
vector<int> dp(n + 1, INF);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i - k; j <= i - 1; j++) {
dp[i] = min(dp[i], dp[j] + abs(hights[i] - hights[j]));
}
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9 + 5
int main() {
int n, k;
cin >> n >> k;
vector<int> hights(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> hights[i];
}
vector<int> dp(n + 1, INF);
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i - 1; j >= max(1, i - k); j--) {
dp[i] = min(dp[i], dp[j] + abs(hights[i] - hights[j]));
}
}
cout << dp[n] << endl;
}
|
replace
| 15 | 16 | 15 | 16 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
vector<ll> ans(n);
ans[0] = 0;
for (ll i = 1; i < n; i++) {
ans[i] = ans[i - 1] + abs(v[i] - v[i - 1]);
for (ll j = 1; j <= k; j++) {
ans[i] = min(ans[i], ans[i - j] + abs(v[i] - v[i - j]));
}
}
cout << ans[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
vector<ll> ans(n);
ans[0] = 0;
for (ll i = 1; i < n; i++) {
ans[i] = ans[i - 1] + abs(v[i] - v[i - 1]);
for (ll j = 1; j <= k && i - j >= 0; j++) {
ans[i] = min(ans[i], ans[i - j] + abs(v[i] - v[i - j]));
}
}
cout << ans[n - 1] << endl;
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define c(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ffor(n) for (int i = 0; i < n; i++)
typedef vector<int> vi;
typedef vector<float> vf;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<long long> vll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef unordered_map<string, int> umsi;
int32_t main() {
fast_io;
int n, k;
cin >> n >> k;
vi a(n);
c(a, n);
vi dp(n, INT_MAX);
dp[0] = 0;
if (n == 1) {
cout << 0 << lc;
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - k] + abs(a[i] - a[i - j]));
}
cout << dp[n - 1] << lc;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define lc "\n"
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
#define c(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define ffor(n) for (int i = 0; i < n; i++)
typedef vector<int> vi;
typedef vector<float> vf;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<long long> vll;
typedef map<string, int> msi;
typedef map<int, int> mii;
typedef unordered_map<string, int> umsi;
int32_t main() {
fast_io;
int n, k;
cin >> n >> k;
vi a(n);
c(a, n);
vi dp(n, INT_MAX);
dp[0] = 0;
if (n == 1) {
cout << 0 << lc;
return 0;
}
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++)
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
cout << dp[n - 1] << lc;
return 0;
}
|
replace
| 43 | 44 | 43 | 44 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include "bits/stdc++.h"
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
const int MAXN = 1e5 + 10;
const int INF = 2 * 1e9;
int dp[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i{}; i < n; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int i{2}; i < n; i++) {
// i'ye gelmek icin olan deger
int mindeg = INT_MAX;
for (int j{1}; j <= k; j++) {
mindeg = min(mindeg, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] += mindeg;
}
cout << dp[n - 1] << "\n";
}
|
#include "bits/stdc++.h"
#pragma GCC optimize("O3,Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)
const int MAXN = 1e5 + 10;
const int INF = 2 * 1e9;
int dp[MAXN];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i{}; i < n; i++)
cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for (int i{2}; i < n; i++) {
// i'ye gelmek icin olan deger
int mindeg = INT_MAX;
for (int j{1}; j <= k && i - j >= 0; j++) {
mindeg = min(mindeg, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] += mindeg;
}
cout << dp[n - 1] << "\n";
}
|
replace
| 23 | 24 | 23 | 24 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int N = 2e7 + 7;
const int mod = 1e9 + 7;
const int INF = 1e18 + 7;
const int dx[] = {-1, 1, 0, 0}; // UDLR
const int dy[] = {0, 0, -1, 1}; // UDLR
inline int maximum(int a, int b) {
if (a > b)
return a;
else
return b;
}
inline int minimum(int a, int b) {
if (a > b)
return b;
else
return a;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> h(n + 1);
vector<int> dp(n + 1, INF);
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i - j >= 1 && i - j <= k) {
dp[i] = minimum(dp[j] + abs(h[i] - h[j]), dp[i]);
}
}
}
cout << dp[n];
return 0;
}
|
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int N = 2e7 + 7;
const int mod = 1e9 + 7;
const int INF = 1e18 + 7;
const int dx[] = {-1, 1, 0, 0}; // UDLR
const int dy[] = {0, 0, -1, 1}; // UDLR
inline int maximum(int a, int b) {
if (a > b)
return a;
else
return b;
}
inline int minimum(int a, int b) {
if (a > b)
return b;
else
return a;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> h(n + 1);
vector<int> dp(n + 1, INF);
for (int i = 1; i <= n; i++)
cin >> h[i];
dp[1] = 0;
for (int i = 2; i <= n; i++) {
for (int j = i - k >= 1 ? i - k : 1; j <= i; j++) {
dp[i] = minimum(dp[j] + abs(h[i] - h[j]), dp[i]);
}
}
cout << dp[n];
return 0;
}
|
replace
| 41 | 45 | 41 | 43 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100100);
rep(i, n) cin >> h[i];
vector<int> dp(100100, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(100100);
rep(i, n) cin >> h[i];
vector<int> dp(100100, INF);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= k; j++) {
if (i > j - 1) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 16 | 17 | 16 | 19 |
0
| |
p03161
|
C++
|
Runtime Error
|
/*------U Have To DO It------*/
/* BY-> RicoProg */
/* ___
__|__|
| |___ */
#include <bits/stdc++.h>
using namespace std;
//---------------------------------------------------MACROS----------------------------------------------------------
#define ll long long
#define beg(i, n) for (ll i = 0; i < n; i++)
#define beg1(i, n) for (ll i = 1; i < n; i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define nl "\n"
#define vec(v, n) vector<ll> v(n)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mii map<int, int>
#define mll map<ll, ll>
#define msi map<string, int>
#define mci map<char, int>
#define f1 first
#define f2 second
//---------------------------------------------------GLOBAL----------------------------------------------------------
const ll MOD = 998244353;
const ll MAX = 1e5 + 7;
//---------------------------------------------------FUNCTIONS-------------------------------------------------------
void solve() {
ll n, k;
vector<ll> dp(100001, 1e18);
cin >> n >> k;
vector<ll> ar(n);
beg(i, n) cin >> ar[i];
dp[0] = 0;
beg1(i, n) {
beg1(j, k + 1) dp[i] = min(dp[i], dp[i - j] + abs(ar[i] - ar[i - j]));
}
cout << dp[n - 1];
}
//---------------------------------------------------DRIVER----------------------------------------------------------
int main() {
fast;
int t = 1;
// cin >> t ;
while (t--) {
solve();
}
return 0;
}
|
/*------U Have To DO It------*/
/* BY-> RicoProg */
/* ___
__|__|
| |___ */
#include <bits/stdc++.h>
using namespace std;
//---------------------------------------------------MACROS----------------------------------------------------------
#define ll long long
#define beg(i, n) for (ll i = 0; i < n; i++)
#define beg1(i, n) for (ll i = 1; i < n; i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define nl "\n"
#define vec(v, n) vector<ll> v(n)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mii map<int, int>
#define mll map<ll, ll>
#define msi map<string, int>
#define mci map<char, int>
#define f1 first
#define f2 second
//---------------------------------------------------GLOBAL----------------------------------------------------------
const ll MOD = 998244353;
const ll MAX = 1e5 + 7;
//---------------------------------------------------FUNCTIONS-------------------------------------------------------
void solve() {
ll n, k;
vector<ll> dp(100001, 1e18);
cin >> n >> k;
vector<ll> ar(n);
beg(i, n) cin >> ar[i];
dp[0] = 0;
beg1(i, n) {
beg1(j, k + 1) {
if (i - j >= 0)
dp[i] = min(dp[i], dp[i - j] + abs(ar[i] - ar[i - j]));
}
}
cout << dp[n - 1];
}
//---------------------------------------------------DRIVER----------------------------------------------------------
int main() {
fast;
int t = 1;
// cin >> t ;
while (t--) {
solve();
}
return 0;
}
|
replace
| 43 | 44 | 43 | 47 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int h[100005], k;
vector<int> mem(100005, -1);
int dp(int n);
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << dp(n) << "\n";
return 0;
}
int dp(int n) {
if (n == 1) {
mem[1] = 0;
return 0;
}
if (n == 2) {
mem[2] = abs(h[n - 1] - h[n]);
return abs(h[n - 1] - h[n]);
}
if (mem[n] < 0) {
int minv = 1000000007;
for (int i = 1; i <= k; i++) {
minv = min(minv, abs(h[n] - h[n - i]) + dp(n - i));
}
mem[n] = minv;
}
return mem[n];
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int h[100005], k;
vector<int> mem(100005, -1);
int dp(int n);
signed main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << dp(n) << "\n";
return 0;
}
int dp(int n) {
if (n == 1) {
mem[1] = 0;
return 0;
}
if (n == 2) {
mem[2] = abs(h[n - 1] - h[n]);
return abs(h[n - 1] - h[n]);
}
if (mem[n] < 0) {
int minv = 1000000007;
for (int i = 1; i <= k && n - i > 0; i++) {
minv = min(minv, abs(h[n] - h[n - i]) + dp(n - i));
}
mem[n] = minv;
}
return mem[n];
}
|
replace
| 30 | 31 | 30 | 31 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const ll inf = 100000000000000000;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
map<ll, ll> mp;
ll dp[110];
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
fill(dp, dp + n, inf);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k && i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h.at(i) - h.at(i + j)));
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const ll inf = 100000000000000000;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }
map<ll, ll> mp;
ll dp[200000];
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h.at(i);
fill(dp, dp + n, inf);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k && i + j < n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h.at(i) - h.at(i + j)));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; i < n; i++) {
minCost[i] = abs(height[i] - height[i - 1]) + minCost[i - 1];
for (int j = i - 2; j >= i - k; j--)
minCost[i] = min(minCost[i], abs(height[i] - height[j]) + minCost[j]);
}
cout << minCost.back();
return 0;
}
|
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> minCost(n);
minCost[0] = 0;
minCost[1] = abs(height[0] - height[1]);
for (int i = 2; i < n; i++) {
minCost[i] = abs(height[i] - height[i - 1]) + minCost[i - 1];
for (int j = i - 2; j >= i - k && j >= 0; j--)
minCost[i] = min(minCost[i], abs(height[i] - height[j]) + minCost[j]);
}
cout << minCost.back();
return 0;
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
const int INF = 1e9 + 10;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= min(n - 1, i + k); j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
const int INF = 1e9 + 10;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= min(n - 1, i + k); j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 15 | 16 | 15 | 16 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
// Author - Sumit
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ps push
#define pb push_back
#define INF 1000000005
#define MOD 1000000007
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define itr ::iterator it
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
void solve() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, 0, n) cin >> a[i];
int ar[n];
// memset(ar,INF,sizeof(ar));
ar[0] = 0;
ar[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
// ar[i] = min(ar[i-1]+abs(a[i]-a[i-1]),ar[i-2]+abs(a[i]-a[i-2]));
ar[i] = INF;
rep(j, 1, k + 1) {
if ((i - j) >= 0) {
// cout<<(i-j)<<" ";
ar[i] = min(ar[i], ar[i - j] + abs(a[i] - a[i - j]));
}
}
}
// cout<<endl;
// for(auto x:ar){
// cout<<x<<" ";
// }cout<<endl;
debug(ar[n - 1]);
}
signed main() {
ios::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 t = 1;
// cin>>t;
WL(t) { solve(); }
}
|
// Author - Sumit
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ps push
#define pb push_back
#define INF 1000000005
#define MOD 1000000007
#define mp make_pair
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define F first
#define S second
#define mii map<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pair<int, int>>
#define itr ::iterator it
#define WL(t) while (t--)
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
#define debug(x) cout << x << endl;
#define debug2(x, y) cout << x << " " << y << endl;
#define debug3(x, y, z) cout << x << " " << y << " " << z << endl;
void solve() {
int n, k;
cin >> n >> k;
int a[n];
rep(i, 0, n) cin >> a[i];
int ar[n];
// memset(ar,INF,sizeof(ar));
ar[0] = 0;
ar[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
// ar[i] = min(ar[i-1]+abs(a[i]-a[i-1]),ar[i-2]+abs(a[i]-a[i-2]));
ar[i] = INF;
rep(j, 1, k + 1) {
if ((i - j) >= 0) {
// cout<<(i-j)<<" ";
ar[i] = min(ar[i], ar[i - j] + abs(a[i] - a[i - j]));
}
}
}
// cout<<endl;
// for(auto x:ar){
// cout<<x<<" ";
// }cout<<endl;
debug(ar[n - 1]);
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
WL(t) { solve(); }
}
|
delete
| 62 | 67 | 62 | 62 |
-11
| |
p03161
|
C++
|
Time Limit Exceeded
|
/*राधे कृष्णा*/ /*राधे कृष्णा*/ /*राधे कृष्णा*/ /*राधे कृष्णा*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <string>
#include <vector>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
// #define test ll t;cin >> t;while(t--)
#define ll long long int
#define sll stack<ll>
#define qll queue<ll>
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpi vector<pair<int, int>>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define ln "\n"
#define f0(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i < n; i++)
#define fab(i, a, b) for (i = a; i < b; i++)
// typical dp problem
void solve() {
ll n, k, i, j;
cin >> n >> k;
ll h[n + 1];
for (i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (i = 3; i <= n; i++) {
ll x = 1e9 + 100;
for (j = 1; j < i; j++) {
if (i - j > k)
continue;
x = min(x, (dp[j] + abs(h[i] - h[j])));
}
dp[i] = x;
}
// for(i=1;i<=n;i++)
cout << dp[n]; //<< " ";
}
int main() {
fastio
/*ll t;
cin >> t;
while(t--){*/
solve();
//}
return 0;
}
|
/*राधे कृष्णा*/ /*राधे कृष्णा*/ /*राधे कृष्णा*/ /*राधे कृष्णा*/
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <string>
#include <vector>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
// #define test ll t;cin >> t;while(t--)
#define ll long long int
#define sll stack<ll>
#define qll queue<ll>
#define pll pair<ll, ll>
#define vll vector<ll>
#define vpi vector<pair<int, int>>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define ln "\n"
#define f0(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i < n; i++)
#define fab(i, a, b) for (i = a; i < b; i++)
// typical dp problem
void solve() {
ll n, k, i, j;
cin >> n >> k;
ll h[n + 1];
for (i = 1; i <= n; i++)
cin >> h[i];
ll dp[n + 1];
dp[0] = 0;
dp[1] = 0;
dp[2] = abs(h[2] - h[1]);
for (i = 3; i <= n; i++) {
ll x = 1e9 + 100;
j = max(1LL, i - k);
for (; j < i; j++) {
// if(i-j >k) {j=j+(i-j) ;continue;}
x = min(x, (dp[j] + abs(h[i] - h[j])));
}
dp[i] = x;
}
// for(i=1;i<=n;i++)
cout << dp[n]; //<< " ";
}
int main() {
fastio
/*ll t;
cin >> t;
while(t--){*/
solve();
//}
return 0;
}
|
replace
| 44 | 47 | 44 | 47 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
void cc_env() {
#ifndef ONLINE_JUDGE
freopen("input", "r", stdin);
freopen("output", "w", stdout);
//
#endif
}
void self_min(int &a, int b) { a = min(a, b); }
int main() {
cc_env();
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
self_min(dp[j], dp[i] + abs(height[j] - height[i]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void cc_env() {
#ifndef ONLINE_JUDGE
freopen("input", "r", stdin);
freopen("output", "w", stdout);
//
#endif
}
void self_min(int &a, int b) { a = min(a, b); }
int main() {
// cc_env();
int n, k;
cin >> n >> k;
vector<int> height(n);
for (int i = 0; i < n; i++)
cin >> height[i];
vector<int> dp(n, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
self_min(dp[j], dp[i] + abs(height[j] - height[i]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 14 | 15 | 14 | 15 |
-6
|
terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k;
vector<ll> arr, dp;
void init() {
for (ll i = 0; i < n; i++)
dp[i] = -1;
}
ll solve(ll i) {
if (dp[i] != -1)
return dp[i];
if (i <= 0)
return 0;
else {
ll z = 1000000000;
for (ll j = 1; j <= k; j++) {
z = min(z, solve(i - j) + abs(arr[i] - arr[i - j]));
}
dp[i] = z;
return z;
}
}
int main() {
cin >> n >> k;
arr.resize(n);
dp.resize(n);
init();
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << solve(n - 1) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k;
vector<ll> arr, dp;
void init() {
for (ll i = 0; i < n; i++)
dp[i] = -1;
}
ll solve(ll i) {
if (dp[i] != -1)
return dp[i];
if (i <= 0)
return 0;
else {
ll z = 1000000000;
for (ll j = 1; j <= k; j++) {
if (i >= j)
z = min(z, solve(i - j) + abs(arr[i] - arr[i - j]));
}
dp[i] = z;
return z;
}
}
int main() {
cin >> n >> k;
arr.resize(n);
dp.resize(n);
init();
for (int i = 0; i < n; i++)
cin >> arr[i];
cout << solve(n - 1) << "\n";
return 0;
}
|
replace
| 22 | 23 | 22 | 24 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
int h[100010];
int dp[100010];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
|
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
// 入力
int N;
long long h[110000];
// DP テーブル
long long dp[110000];
int main() {
int N, K;
cin >> N >> K;
long long h[100010];
long long dp[101000];
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
dp[i] = INF;
dp[0] = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = 1; j <= K; j++) {
chmin(dp[i + j], dp[i] + abs(h[i + j] - h[i]));
}
}
cout << dp[N - 1] << endl;
}
|
replace
| 31 | 33 | 31 | 33 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, K;
cin >> N >> K;
int h[10000];
ll dp[10000];
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = INT64_MAX;
for (int j = 1; (i - j) >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, K;
cin >> N >> K;
int h[100000];
ll dp[100000];
for (int i = 0; i < N; i++)
cin >> h[i];
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = INT64_MAX;
for (int j = 1; (i - j) >= 0 && j <= K; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i - j] - h[i]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 9 | 11 | 9 | 11 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define mem(x) memset(x, 0, sizeof(x));
#define what_is(x) cout << #x << " is " << x << flush << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
const int maxn = 100010;
int n, k;
int a[maxn];
int dp[maxn];
void solve() {
cin >> n >> k;
rep(i, 0, n) cin >> a[i];
dp[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 0 && i - j <= k; j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
cout << dp[n - 1] << endl;
}
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(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define endl '\n'
#define hell 1000000007
#define mem(x) memset(x, 0, sizeof(x));
#define what_is(x) cout << #x << " is " << x << flush << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
const int maxn = 100010;
int n, k;
int a[maxn];
int dp[maxn];
void solve() {
cin >> n >> k;
rep(i, 0, n) cin >> a[i];
dp[1] = abs(a[1] - a[0]);
rep(i, 2, n) {
dp[i] = INT_MAX;
for (int j = i - 1; j >= 0 && i - j <= k; j--)
dp[i] = min(dp[i], dp[j] + abs(a[i] - a[j]));
}
cout << dp[n - 1] << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
|
replace
| 37 | 43 | 37 | 38 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, x, n) for (ll i = x; i <= n; ++i)
#define REP(i, x) for (ll i = 0; i < x; ++i)
#define FORD(i, x, n) for (ll i = x; i >= n; --i)
const int INF = 1e9;
ll n;
ll h[2 * (10 ^ 5)];
ll k;
int main() {
cin >> n >> k;
FOR(i, 1, n) cin >> h[i];
vector<ll> dp(n, INF);
dp[0] = 0;
REP(i, n - 1) {
FOR(j, i + 1, min(n - 1, i + k)) {
dp[j] = min(dp[i] + abs(h[i + 1] - h[j + 1]), dp[j]);
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, x, n) for (ll i = x; i <= n; ++i)
#define REP(i, x) for (ll i = 0; i < x; ++i)
#define FORD(i, x, n) for (ll i = x; i >= n; --i)
const int INF = 1e9;
ll n;
vector<ll> h(2000000);
ll k;
int main() {
cin >> n >> k;
FOR(i, 1, n) cin >> h[i];
vector<ll> dp(n, INF);
dp[0] = 0;
REP(i, n - 1) {
FOR(j, i + 1, min(n - 1, i + k)) {
dp[j] = min(dp[i] + abs(h[i + 1] - h[j + 1]), dp[j]);
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define vb vector<bool>
#define pii pair<ll, ll>
#define mod 1000000007
#define pll pair<ll, ll>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define per1(i, n) for (ll i = n; i > 0; i--)
#define prll(a, n) \
for (ll i = 0; i < n; i++) { \
cout << a[i] << " "; \
}
#define ain(a) \
for (auto &i : a) \
cin >> i
#define mms(a) memset(a, 0, sizeof(a))
// cout << fixed << setprecision(0) << pi <<" "<<npi<<endl;
ll max_ll(ll a, ll b, ll c) { return max(a, max(b, c)); }
ll min_ll(ll a, ll b, ll c) { return min(a, min(b, c)); }
bool sortBySec(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second == b.second)
return a.first < b.first;
return (a.second < b.second);
}
long long binexpmod(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) {
res = res * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return (res);
}
ll lcm(ll a, ll b) {
ll x = __gcd(a, b);
a /= x;
b /= x;
ll sum = a * b * x;
return sum;
}
void solve() {
ll n, k, res = 0;
cin >> n >> k;
vi a(n);
ain(a);
ll dp1[n];
rep(i, n) dp1[i] = 1000000000;
rep(i, k) { dp1[i] = abs(a[i] - a[0]); }
for (ll i = 2; i < n; i++) {
rep1(j, k) { dp1[i] = min(dp1[i], dp1[i - j] + abs(a[i] - a[i - j])); }
}
cout << dp1[n - 1] << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define vb vector<bool>
#define pii pair<ll, ll>
#define mod 1000000007
#define pll pair<ll, ll>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define rep1(i, n) for (ll i = 1; i <= n; i++)
#define per1(i, n) for (ll i = n; i > 0; i--)
#define prll(a, n) \
for (ll i = 0; i < n; i++) { \
cout << a[i] << " "; \
}
#define ain(a) \
for (auto &i : a) \
cin >> i
#define mms(a) memset(a, 0, sizeof(a))
// cout << fixed << setprecision(0) << pi <<" "<<npi<<endl;
ll max_ll(ll a, ll b, ll c) { return max(a, max(b, c)); }
ll min_ll(ll a, ll b, ll c) { return min(a, min(b, c)); }
bool sortBySec(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second == b.second)
return a.first < b.first;
return (a.second < b.second);
}
long long binexpmod(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1) {
res = res * a % mod;
}
a = a * a % mod;
b >>= 1;
}
return (res);
}
ll lcm(ll a, ll b) {
ll x = __gcd(a, b);
a /= x;
b /= x;
ll sum = a * b * x;
return sum;
}
void solve() {
ll n, k, res = 0;
cin >> n >> k;
vi a(n);
ain(a);
ll dp1[n];
rep(i, n) dp1[i] = 1000000000;
dp1[0] = 0;
for (ll i = 1; i < n; i++) {
rep1(j, min(k, i)) {
dp1[i] = min(dp1[i], dp1[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp1[n - 1] << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
|
replace
| 59 | 62 | 59 | 64 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> v;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
vector<ll> dp(n, 1e9);
for (ll i = 0; i < n; i++) {
ll s;
cin >> s;
v.push_back(s);
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
for (ll i = 0; i < n; i++) {
if (i == 0) {
dp[i] = 0;
} else if (i == 1) {
dp[i] = abs(v[i] - v[i - 1]);
} else {
for (ll j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
const ll mod = 1e9 + 7;
ll powmod(ll a, ll b) {
ll res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
}
return res;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
vector<ll> v;
int main() {
ll n;
cin >> n;
ll k;
cin >> k;
vector<ll> dp(n, 1e9);
for (ll i = 0; i < n; i++) {
ll s;
cin >> s;
v.push_back(s);
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
for (ll i = 0; i < n; i++) {
if (i == 0) {
dp[i] = 0;
} else if (i == 1) {
dp[i] = abs(v[i] - v[i - 1]);
} else {
for (ll j = 1; j <= k; j++) {
if (i - j < 0)
break;
dp[i] = min(dp[i], dp[i - j] + abs(v[i] - v[i - j]));
}
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
insert
| 39 | 39 | 39 | 41 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
#include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// cout << << endl;
// cin >> ;
int main() {
ll x = 0, g = 0, n, k, w, l, ans, ptr = 0;
string s, s1, s2;
cin >> n >> k;
VI h(n);
VI dp(n, INF);
dp[0] = 0;
rep(i, n) { cin >> h[i]; }
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (abs(i - j) <= k) {
dp[i] = min(dp[j] + abs(h[i] - h[j]), dp[i]);
} else
continue;
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define INF 1000000000
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(x) (x).begin(), (x).end() // 昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
#define SZ(x) ((int)(x).size)
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> Vl;
typedef vector<int> VI; // VI a(n);
typedef vector<string> VS;
typedef vector<VS> VSS;
typedef vector<VI> VVI; // VVI a(n,vector<int>(m)) n * m
typedef vector<Vl> VVl;
typedef pair<int, int> PII;
typedef vector<pair<int, int>> PS;
typedef long long ll; // ll とdoubleは違う
// cout << << endl;
// cin >> ;
int main() {
ll x = 0, g = 0, n, k, w, l, ans, ptr = 0;
string s, s1, s2;
cin >> n >> k;
VI h(n);
VI dp(n, INF);
dp[0] = 0;
rep(i, n) { cin >> h[i]; }
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < k; j++) {
if (i + j + 1 < n)
dp[i + j + 1] = min(dp[i] + abs(h[i] - h[i + j + 1]), dp[i + j + 1]);
else
break;
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 31 | 37 | 31 | 37 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
/*ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
int main() {
int n, i, j, k;
cin >> n >> k;
vi a(n), m(n);
for (i = 0; i < n; i++) {
cin >> a[i];
m[i] = INT_MAX;
}
m[0] = 0;
m[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
j = 1;
while (j <= k || i - j > 0) {
m[i] = min((abs(a[i - j] - a[i]) + m[i - j]), m[i]);
j++;
}
}
cout << m[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define vi vector<int>
#define vl vector<long>
#define vll vector<long long int>
#define vC vector<char>
#define FastIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
/*ll gcd(ll a, ll b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}*/
int main() {
int n, i, j, k;
cin >> n >> k;
vi a(n), m(n);
for (i = 0; i < n; i++) {
cin >> a[i];
m[i] = INT_MAX;
}
m[0] = 0;
m[1] = abs(a[1] - a[0]);
for (i = 2; i < n; i++) {
j = 1;
while (j <= k && i - j >= 0) {
m[i] = min((abs(a[i - j] - a[i]) + m[i - j]), m[i]);
j++;
}
}
cout << m[n - 1];
return 0;
}
|
replace
| 31 | 32 | 31 | 32 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define digit(x) floor(log10(x)) + 1
#define mod 1000000007
#define L_MAX 1e18
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using iii = tuple<ll, ll, ll>;
using matrix = vector<vector<ll>>;
using arr = vector<ll>;
using vs = vector<string>;
using pv = vector<ii>;
using umap = unordered_map<ll, ll>;
#define in1(x) scanf("%lld", &x)
#define in2(x, y) scanf("%lld %lld", &x, &y)
#define in3(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << endl;
void showArr(arr a) {
for (auto i : a)
cout << i << " ";
cout << endl;
}
ll dx[] = {-1, 1, -1, 1, 0, 0, -1, 1};
ll dy[] = {-1, 1, 0, 0, -1, 1, 1, -1};
ll Solve(ll index, arr a, ll n, ll k, ll dp[]) {
if (index >= n - 1)
return 0;
ll ans = L_MAX;
if (dp[index] != -1)
return dp[index];
for (int i = 1; i <= k; i++) {
if (index + i < n) {
if (dp[index + i] == -1)
dp[index + i] = Solve(index + i, a, n, k, dp);
ans = min(ans, abs(a[index] - a[index + i]) + dp[index + i]);
}
}
return dp[index] = ans;
}
int main() {
fast;
ll n, k;
cin >> n >> k;
arr a;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
ll dp[100009];
memset(dp, -1, sizeof(dp));
cout << Solve(0, a, n, k, dp) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define digit(x) floor(log10(x)) + 1
#define mod 1000000007
#define L_MAX 1e18
using ll = long long;
using ld = long double;
using ii = pair<ll, ll>;
using iii = tuple<ll, ll, ll>;
using matrix = vector<vector<ll>>;
using arr = vector<ll>;
using vs = vector<string>;
using pv = vector<ii>;
using umap = unordered_map<ll, ll>;
#define in1(x) scanf("%lld", &x)
#define in2(x, y) scanf("%lld %lld", &x, &y)
#define in3(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << endl;
void showArr(arr a) {
for (auto i : a)
cout << i << " ";
cout << endl;
}
ll dx[] = {-1, 1, -1, 1, 0, 0, -1, 1};
ll dy[] = {-1, 1, 0, 0, -1, 1, 1, -1};
ll Solve(ll index, arr a, ll n, ll k, ll dp[]) {
if (index >= n - 1)
return 0;
ll ans = L_MAX;
if (dp[index] != -1)
return dp[index];
for (int i = 1; i <= k; i++) {
if (index + i < n) {
if (dp[index + i] == -1)
dp[index + i] = Solve(index + i, a, n, k, dp);
ans = min(ans, abs(a[index] - a[index + i]) + dp[index + i]);
}
}
return dp[index] = ans;
}
int main() {
fast;
ll n, k;
cin >> n >> k;
arr a;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
a.pb(x);
}
/* ll dp[100009];
memset(dp,-1,sizeof(dp));
cout<<Solve(0,a,n,k,dp)<<endl;*/
ll dp[1000009];
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
dp[i] = L_MAX;
for (int j = 1; j <= k; j++) {
if (i + j <= n - 1) {
dp[i] = min(dp[i], dp[i + j] + abs(a[i] - a[i + j]));
}
}
}
cout << dp[0] << endl;
return 0;
}
|
replace
| 55 | 59 | 55 | 69 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const int MOD = 1000000007;
/* テンプレートここまで */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) { cin >> h[i]; }
vector<ll> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
FOR(j, 1, K + 1) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define IFOR(i, m, n) for (int i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const int MOD = 1000000007;
/* テンプレートここまで */
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
REP(i, N) { cin >> h[i]; }
vector<ll> dp(N, INF);
dp[0] = 0;
REP(i, N - 1) {
FOR(j, 1, K + 1) {
if (i + j >= N)
continue;
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1] << endl;
}
|
replace
| 41 | 42 | 41 | 46 |
-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)
|
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= j + k; j++)
dp[j] = min(dp[j], dp[i] + abs(cc[i] - cc[j]));
}
printf("%d\n", dp[n]);
return 0;
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
int n, m, i, j, k, a, b, c, dp[500000], cc[500000];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &cc[i]);
for (int i = 2; i <= n; i++)
dp[i] = 9999999999;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= i + k; j++)
dp[j] = min(dp[j], dp[i] + abs(cc[i] - cc[j]));
}
printf("%d\n", dp[n]);
return 0;
}
|
replace
| 11 | 12 | 11 | 12 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
for (int i = 0; i < n; i++)
cin >> a[i];
if (n > 2)
dp[0] = 0;
else {
cout << abs(a[1] - a[0]);
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; i++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[j] - a[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
for (int i = 0; i < n; i++)
cin >> a[i];
if (n > 2)
dp[0] = 0;
else {
cout << abs(a[1] - a[0]);
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(a[j] - a[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 17 | 18 | 17 | 19 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &x : h)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; i++) {
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>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int &x : h)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
dp[j] = min(dp[j], dp[i] + abs(h[i] - h[j]));
}
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n, K;
cin >> n >> K;
vector<int> ht(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> ht[i];
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = 0;
for (int i = 1; i <= K; i++)
dp[i] = abs(ht[i] - ht[1]);
for (int i = 2; i <= n; i++) {
for (int k = 1; k <= K; k++)
dp[i] = min(abs(ht[i] - ht[i - k]) + dp[i - k], dp[i]);
}
cout << dp[n];
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n, K;
cin >> n >> K;
vector<int> ht(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> ht[i];
vector<int> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = 0;
for (int i = 1; i <= K; i++)
dp[i] = abs(ht[i] - ht[1]);
for (int i = 2; i <= n; i++) {
for (int k = 1; k <= K && i - k >= 1; k++)
dp[i] = min(abs(ht[i] - ht[i - k]) + dp[i - k], dp[i]);
}
cout << dp[n];
}
|
replace
| 27 | 28 | 27 | 28 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
#define test(t) \
int t; \
cin >> t; \
while (t--)
#define forn(i, n) for (i = 0; i < n; i++)
#define rforn(i, n) for (i = n - 1; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
const int MOD = 1e9 + 7, MAX = 1e5 + 5;
ll powN(ll a, ll p) {
if (p == 0)
return 1;
ll z = powN(a, p / 2);
z = (z * z) % MOD;
if (p % 2)
z = (z * a) % MOD;
return z;
}
vector<bool> is_prime(MAX + 1, true);
void Sieve() {
is_prime[0] = is_prime[1] = false;
int i, j;
for (i = 2; i * i <= MAX; i++) {
if (is_prime[i]) {
for (j = i * i; j <= MAX; j += i)
is_prime[j] = false;
}
}
}
ll modInv(ll a) { return powN(a, MOD - 2); }
int main() {
int n, k;
cin >> n >> k;
vi h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vi dp(n, INT_MAX);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; i++) {
for (int j = 1; j <= k; j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
#define test(t) \
int t; \
cin >> t; \
while (t--)
#define forn(i, n) for (i = 0; i < n; i++)
#define rforn(i, n) for (i = n - 1; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
const int MOD = 1e9 + 7, MAX = 1e5 + 5;
ll powN(ll a, ll p) {
if (p == 0)
return 1;
ll z = powN(a, p / 2);
z = (z * z) % MOD;
if (p % 2)
z = (z * a) % MOD;
return z;
}
vector<bool> is_prime(MAX + 1, true);
void Sieve() {
is_prime[0] = is_prime[1] = false;
int i, j;
for (i = 2; i * i <= MAX; i++) {
if (is_prime[i]) {
for (j = i * i; j <= MAX; j += i)
is_prime[j] = false;
}
}
}
ll modInv(ll a) { return powN(a, MOD - 2); }
int main() {
int n, k;
cin >> n >> k;
vi h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vi dp(n, INT_MAX);
dp[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; j <= min(i, k); j++) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 52 | 55 | 52 | 54 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
template <typename T> void vc(T t) { std::cout << t << " "; }
template <typename T, typename... Args> void vc(T t, Args... args) {
// recursive variadic function
std::cout << t << " ";
vc(args...);
}
const int N = 100000;
std::vector<int> dp(N + 1, -1);
int dpf(const std::vector<int> &h, int r, int n, int k) {
if (dp[r] != -1) {
return dp[r];
}
if (r == n) {
return 0;
}
// if (r == n - 1) {
// dp[r] = std::abs(h[r] - h[n]);
// return dp[r];
// }
dp[r] = 0x3fffffff;
for (int i = 1; i <= k; ++i) {
dp[r] = std::min(dp[r], std::abs(h[r] - h[r + i]) + dpf(h, r + i, n, k));
}
// vc(" +", r, dp[r], "\n");
return dp[r];
}
void once() {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n + 1);
for (int i = 1; i <= n; ++i) {
std::cin >> h[i];
}
std::cout << dpf(h, 1, n, k) << std::endl;
}
int main() {
int n = 1;
std::ios::sync_with_stdio(false);
// std::cin >> n;
while (n--) {
once();
}
}
|
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
template <typename T> void vc(T t) { std::cout << t << " "; }
template <typename T, typename... Args> void vc(T t, Args... args) {
// recursive variadic function
std::cout << t << " ";
vc(args...);
}
const int N = 100000;
std::vector<int> dp(N + 1, -1);
int dpf(const std::vector<int> &h, int r, int n, int k) {
if (dp[r] != -1) {
return dp[r];
}
if (r == n) {
return 0;
}
// if (r == n - 1) {
// dp[r] = std::abs(h[r] - h[n]);
// return dp[r];
// }
dp[r] = 0x3fffffff;
for (int i = 1; i <= k && r + i <= n; ++i) {
dp[r] = std::min(dp[r], std::abs(h[r] - h[r + i]) + dpf(h, r + i, n, k));
}
// vc(" +", r, dp[r], "\n");
return dp[r];
}
void once() {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n + 1);
for (int i = 1; i <= n; ++i) {
std::cin >> h[i];
}
std::cout << dpf(h, 1, n, k) << std::endl;
}
int main() {
int n = 1;
std::ios::sync_with_stdio(false);
// std::cin >> n;
while (n--) {
once();
}
}
|
replace
| 31 | 32 | 31 | 32 |
-11
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.