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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
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, 0);
DP[1] = abs(h[1] - h[0]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (... | #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, 0);
DP[1] = abs(h[1] - h[0]);
int cost, min_cost;
for (int i = 2; i < N; i++) {
min_cost = DP[i - 1] + abs(h[i] - h[i - 1]);
for (... | replace | 17 | 18 | 17 | 18 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int j;
cin >> j;
vector<int> vec;
int dp[n + 20];
for (int i = 0; i < n; i++) {
int h;
cin >> h;
vec.push_back(h);
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int k = 1; k <= j; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int j;
cin >> j;
vector<int> vec;
int dp[n + 300];
for (int i = 0; i < n; i++) {
int h;
cin >> h;
vec.push_back(h);
dp[i] = 2000000000;
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int k = 1; k <= j;... | replace | 10 | 11 | 10 | 11 | 0 | |
p03161 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int int64_t
int MOD = 1000000007;
int minCost(int *A, int N, int K, int *dp) {
if (N == 0)
return 0;
if (N == 1)
return abs(A[1] - A[0]);
if (dp[N] != -1)
return dp[N];
int ans = INT_MAX;
for (int i = 1; i <= K; i++)
ans = min(minCost... | #include "bits/stdc++.h"
using namespace std;
#define int int64_t
int MOD = 1000000007;
int minCost(int *A, int N, int K, int *dp) {
if (N < 0)
return INT_MAX;
if (N == 0)
return 0;
if (N == 1)
return abs(A[1] - A[0]);
if (dp[N] != -1)
return dp[N];
int ans = INT_MAX;
for (int i = 1; ... | insert | 8 | 8 | 8 | 11 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxN = 100200;
int mem[maxN];
int nums[maxN];
int solve(int i, int n, int k) {
if (i == n - 1) {
return 0;
}
int res = 2000000000;
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
res = min(res, abs(nums[i] - nums[j]) + solve(j, n, k));
... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 100200;
int mem[maxN];
int nums[maxN];
int solve(int i, int n, int k) {
if (i == n - 1) {
return 0;
}
if (mem[i] != -1) {
return mem[i];
}
int res = 2000000000;
for (int j = i + 1; j <= i + k; j++) {
if (j < n) {
res = min(res,... | insert | 8 | 8 | 8 | 11 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n];
int dp[n];
int k;
cin >> k;
for (int i = 0; i < n; i++)
cin >> ar[i];
dp[0] = 0;
for (int i = 1; i <= k; i++) {
int mini = 100000007;
for (int j = 1; j <= i; j++)
mini = min(mini, (dp[i - j] + abs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ar[n];
int dp[n];
int k;
cin >> k;
for (int i = 0; i < n; i++)
cin >> ar[i];
dp[0] = 0;
for (int i = 1; i < n; i++) {
int mini = 1000000007;
if (i - k < 0) {
for (int j = 0; j < i; j++)
mini = mi... | replace | 13 | 24 | 13 | 24 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
int n, k, v[100010], dp[100010];
int recur(int pos) {
if (pos == n - 1)
return 0;
if (pos >= n)
return INF;
if (dp[pos] != -1)
return dp[pos];
int ret = INF;
for (int i = 1; i <= k; ++i)
ret = min(ret, recur(pos + i) + ab... | #include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
int n, k, v[100010], dp[100010];
int recur(int pos) {
if (pos == n - 1)
return 0;
if (pos >= n)
return INF;
if (dp[pos] != -1)
return dp[pos];
int ret = INF;
for (int i = 1; i <= k; ++i)
ret = min(ret, recur(pos + i) + ab... | insert | 19 | 19 | 19 | 20 | TLE | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ln '\n';
int lim = 1e6;
ll inf = 1e15;
ll solve(ll *dp, int n, int i, ll *h, int k) {
if (i >= n) {
return inf;
}
if (dp[i] != -1) {
return dp[i];
}
if (i == n - 1) {
return 0;
} else {
ll ans = inf;
for (int j =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ln '\n';
int lim = 1e6;
ll inf = 1e15;
ll solve(ll *dp, int n, int i, ll *h, int k) {
if (i >= n) {
return inf;
}
if (dp[i] != -1) {
return dp[i];
}
if (i == n - 1) {
return 0;
} else {
ll ans = inf;
for (int j =... | insert | 22 | 22 | 22 | 23 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define sorted(a_1) sort(a_1.begin(), a_1.end())
#define rsorted(a_1) sort(a_1.rbegin(), a_1.rend())
#define t1(a_1) cout << a_1 << endl;
#define t2(a_1) ... | replace | 54 | 55 | 54 | 55 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long int ull;
#define pb push_back
#define For(ii, aa, bb) for (ll ii = aa; ii < bb; ii++)
#define Rof(ii, aa, bb) for (ll ii = aa; ii >= bb; ii--)
#define st first
#define nd second
#define MP make_pair
#define MAX 1000000009
#define MOD 1000000007
#... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long int ull;
#define pb push_back
#define For(ii, aa, bb) for (ll ii = aa; ii < bb; ii++)
#define Rof(ii, aa, bb) for (ll ii = aa; ii >= bb; ii--)
#define st first
#define nd second
#define MP make_pair
#define MAX 1000000009
#define MOD 1000000007
#... | replace | 37 | 39 | 37 | 39 | -11 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 10000000... | #include <bits/stdc++.h>
using namespace std;
int stones[101];
int steps[101];
int main() {
int N, K;
scanf("%d %d", &N, &K);
int pos = 0;
for (int i = 0; i < N; ++i) {
int stone;
scanf("%d", &stone);
if (i == 0) {
steps[pos] = 0;
stones[pos] = stone;
} else {
int m = 0x7FFFFF... | replace | 16 | 18 | 16 | 18 | 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;
int N, K;
int flog(vector<int> &dp, vector<int> h, int n) {
if (n == 0) {
return 0;
}
if (dp[n] != -1) {
return dp[n];
}
int mn = 2147483647;
for (int i = 1; i <= K; i++) {
if ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int N, K;
int flog(vector<int> &dp, vector<int> &h, int n) {
if (n == 0) {
return 0;
}
if (dp[n] != -1) {
return dp[n];
}
int mn = 2147483647;
for (int i = 1; i <= K; i++) {
if... | replace | 7 | 8 | 7 | 8 | 0 | |
p03161 | C++ | Runtime Error | // motatoes cp snippet
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define forr(a, b, v) for (int v = a; v <= b; v++)
#define ford(a, b, v) for (int v = a; v >= b; v--)
// https://www.topcoder.com/community/competitive-programming/tutorials/power-up-c-with-the-standard-templ... | // motatoes cp snippet
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define forr(a, b, v) for (int v = a; v <= b; v++)
#define ford(a, b, v) for (int v = a; v >= b; v--)
// https://www.topcoder.com/community/competitive-programming/tutorials/power-up-c-with-the-standard-templ... | replace | 103 | 104 | 103 | 104 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define Mod 1000000007
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
for (ll i = 1; i < n; i++) {
ll val = 999999999999;
for (ll j = 1; j <= k; j++)
val = min(dp[i - ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define Mod 1000000007
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n), dp(n);
for (ll i = 0; i < n; i++)
cin >> v[i];
for (ll i = 1; i < n; i++) {
ll val = 999999999999;
for (ll j = 1; j <= k; j++)
if (i >= j)
... | replace | 13 | 14 | 13 | 15 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | #include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
typedef long lon... | replace | 22 | 23 | 22 | 23 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int lon... | replace | 26 | 27 | 26 | 27 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<long long> vi;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define endl "\n"
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fr(n) for (ll i = 0; i < n; i++)
#define tr(a) for (auto it... | #include <bits/stdc++.h>
using namespace std;
typedef vector<long long> vi;
typedef long long ll;
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define endl "\n"
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define fr(n) for (ll i = 0; i < n; i++)
#define tr(a) for (auto it... | replace | 33 | 34 | 33 | 34 | -11 | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
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];
}
if (1 + k <= n) {
cout << a... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
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];
}
if (n <= 1 + k) {
cout << a... | replace | 20 | 21 | 20 | 21 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define out(ans) cout << ans << endl
#define in(n) cin >> n
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define floopi(i, j, N) for (ll j = i + 1; j < N; j++)
template <class T> inline bool chmin(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define out(ans) cout << ans << endl
#define in(n) cin >> n
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define floopi(i, j, N) for (ll j = i + 1; j < N; j++)
template <class T> inline bool chmin(T... | replace | 38 | 40 | 38 | 40 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
/// freopen("input.txt", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int &x : a)
cin >> x;
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i... | replace | 22 | 23 | 22 | 23 | 0 | |
p03161 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define ma 1000000000
int mod(int a) {
if (a >= 0)
return a;
else
return -a;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
b[0] = 0;
b[1] = mod(a[1] - a[0]... | #include <iostream>
#include <vector>
#define ma 1000000000
int mod(int a) {
if (a >= 0)
return a;
else
return -a;
}
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a;
a.resize(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int b[n];
b[0] = 0;
b[1] = mod(a[1] - a[0]... | replace | 21 | 22 | 21 | 22 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define max1 1000005
#define siz 100000
#define mod 998244353
#define inf 1e18 + 5
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
#define jam(x) cout << "Case #" << x << ": "
typedef pair<ll, ll> pr;
int main() {
ios_base::sync_with_stdio(false);... | #include <bits/stdc++.h>
using namespace std;
#define max1 1000005
#define siz 100000
#define mod 998244353
#define inf 1e18 + 5
#define ll long long int
#define debug(x) cout << #x << " " << x << endl
#define jam(x) cout << "Case #" << x << ": "
typedef pair<ll, ll> pr;
int main() {
ios_base::sync_with_stdio(false);... | replace | 28 | 29 | 28 | 29 | 0 | |
p03161 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 7;
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, INF);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
if (k == 1) {
... | #include <iostream>
#include <vector>
using namespace std;
const int INF = 1e9 + 7;
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, INF);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (int i = 2; i < n; i++) {
if (k == 1) {
... | replace | 22 | 23 | 22 | 25 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar, val)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar, val)... | delete | 33 | 37 | 33 | 33 | 0 | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
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);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
int... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
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);
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < N; ++i) {
int... | replace | 22 | 23 | 22 | 23 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int frogCost(int h[], int d[], int n, int k) {
if (d[n] != INT_MAX)
return d[n];
int cost = INT_MAX;
for (int i = 1; i <= k; i++) {
if ((n - i) >= 0) {
int diff = abs(h[n - i] - h[n]);
cost = min(cost, diff + frogCost(h, d, n - i, k));
}
}
... | #include <bits/stdc++.h>
using namespace std;
int frogCost(int h[], int d[], int n, int k) {
if (d[n] != INT_MAX)
return d[n];
int cost = INT_MAX;
for (int i = 1; i <= k; i++) {
if ((n - i) >= 0) {
int diff = abs(h[n - i] - h[n]);
cost = min(cost, diff + frogCost(h, d, n - i, k));
}
}
... | insert | 14 | 14 | 14 | 15 | TLE | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MAXN 100005
#define INF 1e9 + 5
using namespace std;
int n, lake[MAXN], k;
int dp[MAXN];
int solve(int v) {
if (v == n - 1)
return 0;
if (dp[v] >= 0)
return dp[v];
int temp = INF;
for (int i = 1; i <= k; i++) {
if (v + i >= n)
break;
temp = min(temp, abs... | #include <bits/stdc++.h>
#define MAXN 100005
#define INF 1e9 + 5
using namespace std;
int n, lake[MAXN], k;
int dp[MAXN];
int solve(int v) {
if (v == n - 1)
return 0;
if (dp[v] >= 0)
return dp[v];
int temp = INF;
for (int i = 1; i <= k; i++) {
if (v + i >= n)
break;
temp = min(temp, abs... | replace | 20 | 21 | 20 | 21 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> &h, vector<int> &v, int k = 2) {
int n = h.size();
for (int curr = 0; curr < n; curr++) {
for (int j = curr + 1; j < n and j <= curr + k; j++) {
int d1 = abs(h[curr] - h[curr + j]);
v[j] = min(v[j], v[curr] + d1);
}
}
}
int ... | #include <bits/stdc++.h>
using namespace std;
void solve(vector<int> &h, vector<int> &v, int k = 2) {
int n = h.size();
for (int curr = 0; curr < n; curr++) {
for (int j = curr + 1; j < n and j <= curr + k; j++) {
int d1 = abs(h[curr] - h[j]);
v[j] = min(v[j], v[curr] + d1);
}
}
}
int main() ... | replace | 7 | 8 | 7 | 8 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | insert | 32 | 32 | 32 | 35 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using ... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using ... | replace | 34 | 35 | 34 | 35 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int minCost(int a[], int n, int k) {
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT_MAX;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(a[j] - a[i]));
}
}
ret... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
int minCost(int a[], int n, int k) {
int dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = INT_MAX;
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[... | replace | 11 | 12 | 11 | 14 | 0 | |
p03161 | C++ | Runtime Error | /*
##############################
# Author: Pratyush Gaurav #
# College: NIT ROURKELA #
##############################
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> plli;
typedef vector<lli> vlli;
typedef vector<plli> vpl... | /*
##############################
# Author: Pratyush Gaurav #
# College: NIT ROURKELA #
##############################
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
typedef long double ld;
typedef pair<lli, lli> plli;
typedef vector<lli> vlli;
typedef vector<plli> vpl... | insert | 45 | 45 | 45 | 47 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = i - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int a[n + 1];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> dp(n + 1, INT_MAX);
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (int i = 2; i < n; i++) {
for (int j = i - ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long unsigned int ... | replace | 45 | 46 | 45 | 46 | -6 | *** stack smashing detected ***: terminated
|
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int sa(int a, int b) { return max(a - b, b - a); }
int main() {
int N, K;
cin >> N >> K;
vector<int> he(N);
for (int i = 0; i < N; i++)
cin >> he[i];
vector<int> dp(N);
for (int i = 0; i <= K; i++) {
dp[i] = sa(he[0], he[i]);
}
for (int i = K + 1; i ... | #include <bits/stdc++.h>
using namespace std;
int sa(int a, int b) { return max(a - b, b - a); }
int main() {
int N, K;
cin >> N >> K;
vector<int> he(N);
for (int i = 0; i < N; i++)
cin >> he[i];
if (N - 1 <= K) {
cout << sa(he[0], he[N - 1]) << endl;
return 0;
}
vector<int> dp(N);
for (int ... | insert | 9 | 9 | 9 | 13 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int h[10002] = {0};
int memo[10002] = {-1};
int compute(int startPos, int n, int k) {
if (memo[startPos] != -1) {
return memo[startPos];
}
if (startPos == n - 1) {
return 0;
}
if (startPos == n -... | #include <bits/stdc++.h>
#include <iostream>
#include <stdlib.h>
#include <string>
using namespace std;
int h[100002] = {0};
int memo[100002] = {-1};
int compute(int startPos, int n, int k) {
if (memo[startPos] != -1) {
return memo[startPos];
}
if (startPos == n - 1) {
return 0;
}
if (startPos == n... | replace | 7 | 9 | 7 | 9 | 0 | |
p03161 | C++ | Runtime Error | ////////////////////////////////////
/// Please Give Me AC!!! ///
////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) \
for (int i = 0; i < (int)in.siz... | ////////////////////////////////////
/// Please Give Me AC!!! ///
////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) \
for (int i = 0; i < (int)in.siz... | replace | 37 | 38 | 37 | 38 | -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 <bits/stdc++.h>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double lxd;
#define INF 1000000007
#define mem(dp, a) memset(dp, a, sizeof dp)
#define flash \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#include <stack>
using namespace std;
typedef long long ll;
typedef long double lxd;
#define INF 1000000007
#define mem(dp, a) memset(dp, a, sizeof dp)
#define flash \
ios_base::sync_with_stdio(false); ... | replace | 29 | 30 | 29 | 30 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = INT_MAX; // 2147483647
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#else
#define debug(var)
#endif
#define p(var) std::cout << var << std::endl
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = INT_MAX; // 2147483647
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
#ifdef LOCAL_ENV
#define debug(var) std::cout << #var " = " << var << std::endl
#else
#define debug(var)
#endif
#define p(var) std::cout << var << std::endl
... | replace | 68 | 70 | 68 | 70 | 0 | |
p03161 | C++ | Runtime Error | // In The Name Of God
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sqr(A) ((A) * (A))
#define X first
#define Y second
#define MP make_pair
#define bsz __builtin_popcount
#define all(A) A.begin(), A.end()
using namespace std;
using namespace __gnu_pbds;... | // In The Name Of God
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sqr(A) ((A) * (A))
#define X first
#define Y second
#define MP make_pair
#define bsz __builtin_popcount
#define all(A) A.begin(), A.end()
using namespace std;
using namespace __gnu_pbds;... | replace | 35 | 36 | 35 | 36 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
... | replace | 66 | 67 | 66 | 69 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 1e9;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j <= i + k; j++)
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
ll dp[n];
dp[0] = 0;
for (int i = 1; i < n; i++)
dp[i] = 1e9;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j <= i + k; j++)
... | replace | 16 | 17 | 16 | 20 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (int a = 1; a <= n; a++)
cin >> arr[a];
ll dp[n + 1];
dp[1] = 0;
for (int a = 2; a <= k... | #include <bits/stdc++.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll arr[n + 1];
for (int a = 1; a <= n; a++)
cin >> arr[a];
ll dp[n + 1];
dp[1] = 0;
for (int a = 2; a <= m... | replace | 15 | 16 | 15 | 16 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline int ctoi(char c) {
if (c < '0' || '9' < c)
throw invalid_argument("ctoi error");
return c - '0';
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
tem... | #include <bits/stdc++.h>
using namespace std;
inline int ctoi(char c) {
if (c < '0' || '9' < c)
throw invalid_argument("ctoi error");
return c - '0';
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
tem... | replace | 53 | 54 | 53 | 57 | 0 | |
p03161 | C++ | Runtime Error | // aarsh01rsh@gmail.com
// Aarsh Sharma
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "... | // aarsh01rsh@gmail.com
// Aarsh Sharma
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char ch) {
string s(1, ch);
return '\'' + s + '\'';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "... | replace | 89 | 90 | 89 | 90 | 0 | [dp]: {0, 20, 30, 40, 30}
|
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 100007
#define MOD 1000000007
long long frog(long long arr[], int n, int k) {
long long output[n + 1];
for (int i = 0; i < n; i++)
output[i] = INT_MAX;
output[0] = 0;
for (int i = 1; i < k; i++) {
for (int j = i - 1; j >= 0; j--) {
if (out... | #include <bits/stdc++.h>
using namespace std;
#define MAX 100007
#define MOD 1000000007
long long frog(long long arr[], int n, int k) {
long long output[n + 1];
for (int i = 0; i < n; i++)
output[i] = INT_MAX;
output[0] = 0;
for (int i = 1; i < min(k, n); i++) {
for (int j = i - 1; j >= 0; j--) {
... | replace | 10 | 11 | 10 | 11 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int v[N];
int dp[N];
int n, k;
int calc(int idx) {
if (idx >= n - 1)
return 0;
int &ret = dp[idx];
if (ret != -1)
return ret;
ret = 1e9;
for (int i = 1; i <= k; ++i)
if (idx + i < n)
ret = min(ret, calc(idx + i) + abs(v[idx]... | #include <bits/stdc++.h>
using namespace std;
const int N = 100001;
int v[N];
int dp[N];
int n, k;
int calc(int idx) {
if (idx >= n - 1)
return 0;
int &ret = dp[idx];
if (ret != -1)
return ret;
ret = 1e9;
for (int i = 1; i <= k; ++i)
if (idx + i < n)
ret = min(ret, calc(idx + i) + abs(v[idx]... | delete | 22 | 25 | 22 | 22 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <time.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
ll n, i, j, k;
cin >> n >> k;
vector<ll> a(n);
for (i = 0; i < n; i++)
cin >> a[i];
ll ... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <time.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
void solve() {
ll n, i, j, k;
cin >> n >> k;
vector<ll> a(n);
for (i = 0; i < n; i++)
cin >> a[i];
ll ... | replace | 36 | 40 | 36 | 40 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define EPS 1e-6
#define INF 1000000000
// MAXIMIZAR f(x) == MINIMIZAR -f(x)
#define _ \
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), \
cout.precision... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define EPS 1e-6
#define INF 1000000000
// MAXIMIZAR f(x) == MINIMIZAR -f(x)
#define _ \
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0), \
cout.precision... | replace | 65 | 66 | 65 | 66 | -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 <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
int MOD = 1000000007; // 10^9 + 7
template <class T> inline bool chmax(T &a, T b) ... | #include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
int MOD = 1000000007; // 10^9 + 7
template <class T> inline bool chmax(T &a, T b) ... | replace | 47 | 48 | 47 | 49 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | replace | 28 | 29 | 28 | 29 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int>... | #include <bits/stdc++.h>
#define ll long long
#define lsb(x) (x & -x)
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("a.in", "r", stdin);
int n, k;
cin >> n >> k;
vector<int> v(n + 1, 0);
for (int i = 1; i <= n; i++)
cin >> v[i];
vector<int>... | replace | 22 | 23 | 22 | 23 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 100000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 100000... | insert | 32 | 32 | 32 | 35 | -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 <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i+... | replace | 30 | 31 | 30 | 31 | 0 | |
p03161 | C++ | Runtime Error | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
#include <bits/stdc++.h>
using namespace std;
using int64 = int64_t;
using pii = pair<int, int>;
using pll = pair<int64_t, int64_t>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x)... | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
#include <bits/stdc++.h>
using namespace std;
using int64 = int64_t;
using pii = pair<int, int>;
using pll = pair<int64_t, int64_t>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) (v).begin(), (v).end()
#define print(x)... | replace | 31 | 33 | 31 | 33 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define int long long int
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define ... | #include <bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define int long long int
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define ... | delete | 39 | 44 | 39 | 39 | TLE | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> in(n);
for (int i = 0; i < n; ++i) {
std::cin >> in[i];
}
std::vector<int> dp(n);
for (int i = 0; i < k; i++) {
dp[i] = std::abs(in[i] - in[0]);
}
// O(n*k)
for (int i ... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> in(n);
for (int i = 0; i < n; ++i) {
std::cin >> in[i];
}
std::vector<int> dp(n);
// O(n*k)
for (int i = 1; i < n; i++) {
std::vector<int> currCosts;
for (int j = 1; j <... | delete | 14 | 18 | 14 | 14 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, b, a) for (int i = (b); i > (a); --i)
void fastscan(int &x) {
bool neg = false;
register int c;
x = 0;
c = ... | #include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define loop(i, a, b) for (int i = (a); i < (b); i++)
#define loopb(i, b, a) for (int i = (b); i > (a); --i)
void fastscan(int &x) {
bool neg = false;
register int c;
x = 0;
c = ... | replace | 42 | 43 | 42 | 45 | 0 | |
p03161 | C++ | Runtime Error | /* Author: Rennan Rocha
* Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll... | /* Author: Rennan Rocha
* Time: $%Y%$-$%M%$-$%D%$ $%h%$:$%m%$:$%s%$
**/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define ll long long
#define vi vector<int>
#define vll vector<ll... | replace | 31 | 33 | 31 | 33 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << end... | #include <bits/stdc++.h>
typedef long long ll;
typedef double ld;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define per(i, a, n) for (ll i = (n - 1); i >= (a); i--)
#define F first
#define S second
#define maxx(a, b) a = max(a, b)
#define minn(a, b) a = min(a, b)
#define db(x) cerr << #x << " = " << x << end... | replace | 33 | 35 | 33 | 35 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
return;
}
return;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
long long dp[1000000];... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
return;
}
return;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
long long dp[1000000];... | insert | 30 | 30 | 30 | 32 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod ... | replace | 31 | 37 | 31 | 32 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000000
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vs vector<string>
#define psi pair<string, ll>
#define pii pair<ll, ll>
#define vsi vector<psi>
#define vii vector<pii>
#define mp make_pair
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000000
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vs vector<string>
#define psi pair<string, ll>
#define pii pair<ll, ll>
#define vsi vector<psi>
#define vii vector<pii>
#define mp make_pair
#define pb push_back
#defin... | replace | 58 | 64 | 58 | 59 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int frog(std::vector<int> v, int n, int k) {
int dp[100001] = {0};
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i <= n; i++) {
int ans = INT_MAX;
for (int j = 1; j <= k; j++) {
int a1 = dp[i - j] + abs(v[i] - v[i - j]);
ans = min(ans, a1)... | #include <bits/stdc++.h>
using namespace std;
int frog(std::vector<int> v, int n, int k) {
int dp[100001] = {0};
dp[0] = 0;
dp[1] = abs(v[0] - v[1]);
for (int i = 2; i <= n; i++) {
int ans = INT_MAX;
for (int j = 1; j <= k; j++) {
int a1 = 0;
if ((i - j) >= 0) {
a1 = dp[i - j] + abs(... | replace | 9 | 10 | 9 | 15 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[n];
min_jumps[0] = 0;
for (int i = 1; i < k; i++)
min_jumps[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
min_jumps[i] = INT_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int min_jumps[max(n, k)];
min_jumps[0] = 0;
for (int i = 1; i < k; i++)
min_jumps[i] = abs(arr[0] - arr[i]);
for (int i = k; i < n; i++) {
min_jumps[i... | replace | 11 | 12 | 11 | 12 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll i, a[10000] = {0}, dp[10000] = {0}, n, cost, k;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(a[i - 1] - a[i - 2]);
else {
ll mini = INT_MAX,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll i, a[100001] = {0}, dp[100001] = {0}, n, cost, k;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 2; i <= n; i++) {
if (i == 2)
dp[i] = abs(a[i - 1] - a[i - 2]);
else {
ll mini = INT_MA... | replace | 4 | 5 | 4 | 5 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, k;
cin >> n >> k;
vi h(n + 1);
rep(i, n) cin >> h[i + 1];
vi dp(n + 1);
dp[0] = 0;
dp[1] = 0;
for (int i = 2; i <=... | insert | 18 | 18 | 18 | 20 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int *arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int dp[n];
for (int i = 0; i < n; i++) {
dp[i] = INT_MAX;
}
dp[0] = 0;
dp[1] = abs(arr[1] - arr[0]);
for (int i = 2; i < n; i++) {
... | replace | 23 | 24 | 23 | 25 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> arr;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n, k;
cin >> n >> k;
arr.resize(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> ans(n, INT_MAX);
ans[0] = 0;
ans[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n... | #include <bits/stdc++.h>
using namespace std;
vector<int> arr;
int min(int a, int b) { return a < b ? a : b; }
int main() {
int n, k;
cin >> n >> k;
arr.resize(n);
for (int i = 0; i < n; i++)
cin >> arr[i];
vector<int> ans(n, INT_MAX);
ans[0] = 0;
ans[1] = abs(arr[0] - arr[1]);
for (int i = 2; i < n... | insert | 16 | 16 | 16 | 18 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i+... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
int N;
long long h[1000010];
long long dp[1000010];
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i+... | replace | 30 | 31 | 30 | 31 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | #include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in i... | replace | 18 | 19 | 18 | 19 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n + k);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<int> dp(n + 2, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j)
dp[i + j] = min(dp[i] + abs(h[i] - h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n + k);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<int> dp(n + k, INT_MAX);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j)
dp[i + j] = min(dp[i] + abs(h[i] - h... | replace | 10 | 11 | 10 | 11 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int minima(int i, int a[], int h[], int k) {
int arr[k];
int min = abs(h[i - 1] - h[i]) + a[i - 1];
for (int j = 0; j < k; ++j) {
arr[j] = abs(h[i - j - 1] - h[i]) + a[i - j - 1];
if (arr[j] < min)
min = arr[j];
}
return min;
}
in... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int minima(int i, int a[], int h[], int k) {
int arr[k];
int min = abs(h[i - 1] - h[i]) + a[i - 1];
for (int j = 0; j < k; ++j) {
arr[j] = abs(h[i - j - 1] - h[i]) + a[i - j - 1];
if (arr[j] < min)
min = arr[j];
}
return min;
}
in... | replace | 20 | 21 | 20 | 21 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define INF 1000000000
using namespace std;
int minCost(vector<int> &v, int index, int k, vector<int> &cost) {
if (cost[index] != -1) {
return cost[index];
}
if (index <= 0) {
return 0;
} else if (index == 1) {
return cost[index] = abs(v[1] - v[0]);
... | #include <bits/stdc++.h>
#define int long long
#define INF 1000000000
using namespace std;
int minCost(vector<int> &v, int index, int k, vector<int> &cost) {
if (cost[index] != -1) {
return cost[index];
}
if (index <= 0) {
return 0;
} else if (index == 1) {
return cost[index] = abs(v[1] - v[0]);
... | replace | 17 | 19 | 17 | 21 | 0 | |
p03161 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
for (int i = 0; i < N; i++)
cin >> heights[i];
vector<long> dp(N, 0);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (int k = 2; ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> heights(N);
for (int i = 0; i < N; i++)
cin >> heights[i];
vector<long> dp(N, 0);
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(heights[i] - heights[i - 1]);
// i - k >= 0 i ... | replace | 17 | 18 | 17 | 19 | 0 | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define INF 1000000000
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> cost(n, INF);
cost[0] = 0;
for (int i = 0; i < n; i++) {
int m = min(k, n - i);
... | #include <algorithm>
#include <iostream>
#include <vector>
#define INF 1000000000
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> cost(n, INF);
cost[0] = 0;
for (int i = 0; i < n; i++) {
int m = min(k, n - 1 - i)... | replace | 14 | 15 | 14 | 15 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int N = 1e5 + 5;
ll dp[N] = {-1}, v[N], k, n;
const int inf = 0x3f3f3f3f;
ll check(int index);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll i, j, m;
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int N = 1e5 + 5;
ll dp[N] = {-1}, v[N], k, n;
const int inf = 0x3f3f3f3f;
ll check(int index);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll i, j, m;
memset(dp, -1, sizeof(dp));
cin >> n >> k;
for (i... | replace | 33 | 34 | 33 | 34 | TLE | |
p03161 | C++ | Time Limit Exceeded | #define watch5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define watch4(a, b, c, d) \
... | #define watch5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define watch4(a, b, c, d) \
... | insert | 52 | 52 | 52 | 54 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri(), k = ri();
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
std::set<std::pair<int, int>> to_list;
for (int i = 0; i < k; i++)
to_list.insert({a[i], i});
int64_t dp[n];
for (int i = 0; i <... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri(), k = ri();
k = std::min(k, n - 1);
int a[n];
for (int i = 0; i < n; i++)
a[i] = ri();
std::set<std::pair<int, int>> to_list;
for (int i = 0; i < k; i++)
to_list.insert({a[i], i});
int64_t dp... | insert | 10 | 10 | 10 | 11 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
lli dp[10100... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
lli dp[10100... | replace | 20 | 21 | 20 | 21 | -6 | malloc(): corrupted top size
|
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <utility>
using namespace std;
const long long N = 200001;
const long long K = 201;
long long n, k;
long long arr[N];
long long matrix[N][K];
long long checkmin(long long i) {
long long res = matrix[i][0];
for (long long j = 0; j < k; j++) {
if (matrix[i][j] >= 0) {
res... | #include <bits/stdc++.h>
#include <utility>
using namespace std;
const long long N = 200001;
const long long K = 201;
long long n, k;
long long arr[N];
long long matrix[N][K];
long long checkmin(long long i) {
long long res = matrix[i][0];
for (long long j = 0; j < k; j++) {
if (matrix[i][j] >= 0) {
res... | replace | 33 | 34 | 33 | 36 | -11 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void frog2(vector<int> &cost, int m) {
int n = cost.size();
if (n == 0) {
cout << 0 << endl;
}
int dp[n];
dp[0] = 0;
dp[1] = abs(cost[1] - cost[0]) + dp[0];
int j;
for (int i = 2; i < n; i++) {
int mn = 1e9 + 5;
for (int k = 0; k < m; k++) {
... | #include <bits/stdc++.h>
using namespace std;
void frog2(vector<int> &cost, int m) {
int n = cost.size();
if (n == 0) {
cout << 0 << endl;
}
int dp[n];
dp[0] = 0;
dp[1] = abs(cost[1] - cost[0]) + dp[0];
int j;
for (int i = 2; i < n; i++) {
int mn = 1e9 + 5;
for (int k = 0; k < m; k++) {
... | replace | 15 | 16 | 15 | 17 | 0 | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (long long i = a; i < b; i++)
using namespace std;
long long n;
vector<long long> dp;
long long bf(long long p, long... | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (long long i = a; i < b; i++)
using namespace std;
long long n;
vector<long long> dp;
long long bf(long long p, long... | replace | 33 | 34 | 33 | 34 | -6 | munmap_chunk(): invalid pointer
|
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
#define oo 0x3f3f3f3f
using namespace std;
const int N = 100005;
const int K = 105;
int dp[K];
int vet[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &vet[i]);
}
dp[n - 1] = 0;
for (int i = n - 2; i >= 0; i--) {
dp[i % (k + 1)... | #include <bits/stdc++.h>
#define oo 0x3f3f3f3f
using namespace std;
const int N = 100005;
const int K = 105;
int dp[K];
int vet[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &vet[i]);
}
dp[(n - 1) % (k + 1)] = 0;
for (int i = n - 2; i >= 0; i--) {
dp... | replace | 16 | 17 | 16 | 17 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define mod 1000000007
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#e... | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, n) for (int i = a; i < n; i++)
#define pb push_back
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
#define mod 1000000007
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#e... | replace | 26 | 27 | 26 | 28 | 0 | |
p03161 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define pii pair<int, int>
#define makep make_pair
#define pb push_back
#define fi first
#define se se... | #define ONLINE_JUDGE
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define pii pair<int, int>
#define makep make_pair
#define pb push_back
#define f... | insert | 0 | 0 | 0 | 1 | TLE | |
p03161 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dbl;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vii;
#define mp make_pair
#define pb push_back
#define invec(a, n) ... | replace | 97 | 98 | 97 | 98 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
using P = pair<int, int>;
const int inf = 1e9;
const int minus_inf = -1e9;
struct edge {
int to;
int cost;
};
using graph = vector<vector<edge>>;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, inf);
vector<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
using P = pair<int, int>;
const int inf = 1e9;
const int minus_inf = -1e9;
struct edge {
int to;
int cost;
};
using graph = vector<vector<edge>>;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, inf);
vector<int... | replace | 24 | 28 | 24 | 32 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 100000007);
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= i; j++) {
if (j <= K) {
dp... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
vector<long long> dp(N, 100000007);
dp[0] = 0;
for (int i = 1; i < N; i++) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2;... | replace | 13 | 15 | 13 | 16 | TLE | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
ios::sync_with_stdio(0);
cin.tie(NULL);
cin >> N >> k;
vector<int> H(N);
vector<int> DP(N);
for (int &x : H)
cin >> x;
DP[0] = 0;
for (int i = 1; i < N; ++i) {
DP[i] = 0x3f3f3f3f;
for (int prev = i - 1; i - prev <= k;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
ios::sync_with_stdio(0);
cin.tie(NULL);
cin >> N >> k;
vector<int> H(N);
vector<int> DP(N);
for (int &x : H)
cin >> x;
DP[0] = 0;
for (int i = 1; i < N; ++i) {
DP[i] = 0x3f3f3f3f;
for (int prev = i - 1; i - prev <= k;... | insert | 19 | 19 | 19 | 21 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
vector<int> dp(n, INT_MAX);
dp[n - 1] = 0;
for (int i = n - 2; i >= n - k; i--) {
for (int j = i + 1; j < n; j++) {
dp[i] = min(dp[i], abs(A[i] - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
k = min(k, n);
vector<int> A(n);
for (int i = 0; i < n; i++)
cin >> A[i];
vector<int> dp(n, INT_MAX);
dp[n - 1] = 0;
for (int i = n - 2; i >= n - k; i--) {
for (int j = i + 1; j < n; j++) {
dp[i] = min(d... | insert | 6 | 6 | 6 | 7 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
dp[j] = min(d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, i, j;
cin >> n >> k;
int h[n];
for (i = 0; i < n; i++) {
cin >> h[i];
}
int dp[n];
dp[0] = 0;
for (i = 1; i < n; i++) {
dp[i] = INT_MAX;
}
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
if (j < n)
... | replace | 16 | 17 | 16 | 18 | 0 | |
p03161 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAX_N 100000
#define MAX_M 100000
const int MAX = 10000000;
const int MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecllvec vector<vector<ll>>
#define vecb vector<bool>
#define vecbvecb vector<vector<bool>>
#define... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAX_N 100000
#define MAX_M 100000
const int MAX = 10000000;
const int MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecllvec vector<vector<ll>>
#define vecb vector<bool>
#define vecbvecb vector<vector<bool>>
#define... | replace | 34 | 35 | 34 | 36 | 0 | |
p03161 | C++ | Runtime Error |
//_Hala Madrid_//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fio \
ios_base::sync_with_stdio(false); ... |
//_Hala Madrid_//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fio \
ios_base::sync_with_stdio(false); ... | replace | 40 | 41 | 40 | 41 | 0 | |
p03161 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
int solve(int n, int k, vector<int> h) {
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i + k; j++) {
if (j < n) {
dp[j] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll INF = 10e9;
int solve(int n, int k, vector<int> h) {
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... | replace | 10 | 11 | 10 | 11 | TLE | |
p03161 | Python | Runtime Error | N, K = map(int, input().split())
(*h,) = map(int, input().split())
a = [abs(h[0] - h[k]) for k in range(K)]
for n in range(N - K):
a = a[1:] + [min([a[k] + abs(h[n + k] - h[n + K]) for k in range(K)])]
print(a[K - 1])
| N, K = map(int, input().split())
K = min(N, K)
(*h,) = map(int, input().split())
a = [abs(h[0] - h[k]) for k in range(K)]
for n in range(N - K):
a = a[1:] + [min([a[k] + abs(h[n + k] - h[n + K]) for k in range(K)])]
print(a[K - 1])
| insert | 1 | 1 | 1 | 2 | 0 | |
p03161 | Python | Time Limit Exceeded | # 配るDP
# Hは1-index
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
H = [0] + list(map(int, input().split()))
dp = [10**10] * (n + 1)
dp[1] = 0
for i in range(1, n):
for j in range(1, k + 1):
if i + j <= n:
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i + j] - H[i]))
print(dp[... | # 配るDP
# Hは1-index
# PyPyじゃないと厳しい。
# 二重for loop
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
H = [0] + list(map(int, input().split()))
dp = [10**10] * (n + 1)
dp[1] = 0
for i in range(1, n):
for j in range(1, k + 1):
if i + j <= n:
dp[i + j] = min(dp[i + j], dp[i] + ab... | insert | 2 | 2 | 2 | 4 | TLE | |
p03161 | Python | Time Limit Exceeded | import math
n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [math.inf] * n
dp[0] = 0
for i in range(1, n):
for j in range(max(0, i - k), i):
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
print(dp[n - 1])
| import math
n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [math.inf] * n
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - k), i))
print(dp[n - 1])
| replace | 8 | 10 | 8 | 9 | TLE | |
p03161 | Python | Time Limit Exceeded | def compute(n, k, h):
inf = 1e9
if n == 1:
return 0
dp = [inf] * n
dp[0] = 0
for i in range(1, n):
cnt = 1
while cnt <= k and i - cnt > -1:
dp[i] = min(dp[i], dp[i - cnt] + abs(h[i] - h[i - cnt]))
return dp[-1]
if __name__ == "__main__":
N, K = map(int,... | n, k = [int(_) for _ in input().split()]
h = [int(_) for _ in input().split()]
inf = 1e9
dp = [inf] * n
dp[0] = 0
for i in range(1, n):
cnt = 1
while cnt <= k and i - cnt > -1:
dp[i] = min(dp[i], dp[i - cnt] + abs(h[i] - h[i - cnt]))
cnt += 1
print(dp[-1])
| replace | 0 | 18 | 0 | 11 | TLE | |
p03161 | Python | Time Limit Exceeded | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(1, N + K):
for j in range(1, K + 1):
v = dp[i - j] + abs(H[i] - H[i - j])
dp[i] = min(dp[i], v)
# print('dp', dp)
ans = dp[... | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(K, N + K):
h = H[i]
dp[i] = min(x + abs(y - h) for x, y in zip(dp[i - K : i], H[i - K : i]))
# for j in range(1, K + 1):
# ... | replace | 8 | 12 | 8 | 14 | TLE | |
p03161 | Python | Time Limit Exceeded | #!/usr/bin/env python3
N, K = list(map(int, input().split()))
h_list = list(map(int, input().split()))
dp_list = [float("inf")] * N
dp_list[0] = 0
for i in range(1, N):
# j番目の足場からi番目の足場に飛ぶ
for j in range(max(i - K, 0), i + 1):
# j番目の足場までの最適コスト
cum_cost = dp_list[j]
# j番目の足場から飛んだ場合のコス... | N, K = list(map(int, input().split()))
h_list = list(map(int, input().split()))
dp_list = [float("inf")] * N
dp_list[0] = 0
for i in range(1, N):
# j番目の足場からi番目の足場に飛ぶ
for j in range(max(i - K, 0), i + 1):
# j番目の足場までの最適コスト
cum_cost = dp_list[j]
# j番目の足場から飛んだ場合のコスト
cost = dp_list... | delete | 0 | 2 | 0 | 0 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.