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++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define has(c, i) ((c).find(i) != end(c))
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = ll(b) - 1; i >= a; i--)
int main() {
cout << fixed << setprecision(8);
map<ll, ll> cost;
ll n, k;
cin >> n >> k;
vl l(n);
FOR(i, 0, n) { cin >> l[i]; }
cost[0] = 0;
FOR(i, 0, n - 1) {
FOR(j, 1, k + 1) {
if (i + j == n)
break;
if (has(cost, i + j))
cost[i + j] = min(cost[i + j], cost[i] + abs(l[i] - l[i + j]));
else
cost[i + j] = cost[i] + abs(l[i] - l[i + j]);
}
}
cout << cost[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vb = vector<bool>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define has(c, i) ((c).find(i) != end(c))
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = ll(b) - 1; i >= a; i--)
int main() {
cout << fixed << setprecision(8);
unordered_map<ll, ll> cost;
ll n, k;
cin >> n >> k;
vl l(n);
FOR(i, 0, n) { cin >> l[i]; }
cost[0] = 0;
FOR(i, 0, n - 1) {
FOR(j, 1, k + 1) {
if (i + j == n)
break;
if (has(cost, i + j))
cost[i + j] = min(cost[i + j], cost[i] + abs(l[i] - l[i + j]));
else
cost[i + j] = cost[i] + abs(l[i] - l[i + j]);
}
}
cout << cost[n - 1] << endl;
}
|
replace
| 19 | 20 | 19 | 20 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int h[100100];
for (int i = 0; i < n; i++)
cin >> h[i];
vector<long long> cost(n, 0);
cost[0] = 0;
for (int i = 1; i < n; i++) {
long long tmp = INF;
for (int j = 1; j <= k; j++) {
tmp = min(tmp, cost[i - j] + abs(h[i] - h[i - j]));
}
cost[i] = tmp;
}
cout << cost[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
int h[100100];
for (int i = 0; i < n; i++)
cin >> h[i];
vector<long long> cost(n, 0);
cost[0] = 0;
for (int i = 1; i < n; i++) {
long long tmp = INF;
for (int j = 1; j <= k; j++) {
if (i - j >= 0)
tmp = min(tmp, cost[i - j] + abs(h[i] - h[i - j]));
else
continue;
}
cost[i] = tmp;
}
cout << cost[n - 1] << endl;
return 0;
}
|
replace
| 27 | 28 | 27 | 31 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n];
int cost[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i <= k; i++) {
cost[i] = abs(h[i] - h[0]);
}
for (int i = k + 1; i < n; i++) {
cost[i] = abs(h[i] - h[i - 1]) + cost[i - 1];
for (int j = 2; j <= k; j++) {
cost[i] = min(cost[i], abs(h[i] - h[i - j]) + cost[i - j]);
}
}
cout << cost[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k;
cin >> k;
int h[n];
int cost[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i <= min(k, n - 1); i++) {
cost[i] = abs(h[i] - h[0]);
}
for (int i = k + 1; i < n; i++) {
cost[i] = abs(h[i] - h[i - 1]) + cost[i - 1];
for (int j = 2; j <= k; j++) {
cost[i] = min(cost[i], abs(h[i] - h[i - j]) + cost[i - j]);
}
}
cout << cost[n - 1] << endl;
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, input, k;
cin >> n;
cin >> k;
vector<int> h;
for (int i = 0; i < n; i++) {
cin >> input;
h.push_back(input);
}
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
dp[1] = abs(h[1] - h[0]);
dp[0] = 0;
for (int j = 2; j < n; j++) {
for (int i = 1; i <= k; i++) {
dp[j] = min(dp[j], dp[j - i] + abs(h[j] - h[j - i]));
}
}
cout << dp[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, input, k;
cin >> n;
cin >> k;
vector<int> h;
for (int i = 0; i < n; i++) {
cin >> input;
h.push_back(input);
}
int dp[n];
for (int i = 0; i < n; i++)
dp[i] = 1000000000;
dp[1] = abs(h[1] - h[0]);
dp[0] = 0;
for (int j = 2; j < n; j++) {
for (int i = 1; i <= k && (j - i) >= 0; i++) {
dp[j] = min(dp[j], dp[j - i] + abs(h[j] - h[j - i]));
}
}
cout << dp[n - 1];
return 0;
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define sl(a) scanf("%lld", &a);
using namespace std;
ll dp[10005], fr[10005];
int main() {
ll n, i, j, k, l, m, mini = 100000000000;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> fr[i];
}
if (k >= n) {
k = n - 1;
}
dp[1] = 0;
for (i = 2; i <= k + 1; i++) {
dp[i] = abs(fr[i] - fr[1]);
}
for (i = k + 2; i <= n; i++) {
for (j = i - 1; j >= i - k; j--) {
l = dp[j] + abs(fr[i] - fr[j]);
mini = min(l, mini);
}
dp[i] = mini;
mini = 100000000000;
}
cout << dp[n] << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#define ll long long
#define ull unsigned long long
#define sl(a) scanf("%lld", &a);
using namespace std;
ll dp[100005], fr[100005];
int main() {
ll n, i, j, k, l, m, mini = 100000000000;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> fr[i];
}
if (k >= n) {
k = n - 1;
}
dp[1] = 0;
for (i = 2; i <= k + 1; i++) {
dp[i] = abs(fr[i] - fr[1]);
}
for (i = k + 2; i <= n; i++) {
for (j = i - 1; j >= i - k; j--) {
l = dp[j] + abs(fr[i] - fr[j]);
mini = min(l, mini);
}
dp[i] = mini;
mini = 100000000000;
}
cout << dp[n] << endl;
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <iostream>
#include <vector>
using namespace std;
#define int long long
template <class T> inline bool amin(T &a, T const &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
signed main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> dp(n + 1, INF);
dp[0] = 0;
for (int i = 1; i < n; ++i) {
for (int j = 1; j < k; ++j) {
amin(dp[i], dp[i - j] + abs(a[i] - a[i - j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
#define int long long
template <class T> inline bool amin(T &a, T const &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
signed main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> a(n);
for (int i = 0, i_len = (int)n; i < i_len; ++i)
cin >> a[i];
vector<int> dp(n + 1, INF);
dp[0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= k; ++j) {
amin(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 30 | 33 | 30 | 33 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N = 1e5 + 20;
int const INF = 1e9 + 7;
ll h[N], t, memo[N], k;
int main() {
memset(memo, INF, sizeof(memo));
cin >> t >> k;
vector<ll> v(k);
for (int i = 0; i < t; ++i)
cin >> h[i];
int a = 1;
for (auto &x : v) {
x = a;
a++;
}
memo[0] = 0;
for (int i = 0; i < t; ++i)
for (int j : v)
if (j < t)
memo[i + j] = min(memo[i + j], memo[i] + abs(h[i] - h[j + i]));
cout << memo[t - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N = 1e5 + 20;
int const INF = 1e9 + 7;
ll h[N], t, memo[N], k;
int main() {
memset(memo, INF, sizeof(memo));
cin >> t >> k;
vector<ll> v(k);
for (int i = 0; i < t; ++i)
cin >> h[i];
int a = 1;
for (auto &x : v) {
x = a;
a++;
}
memo[0] = 0;
for (int i = 0; i < t; ++i)
for (int j : v)
if (i + j < t)
memo[i + j] = min(memo[i + j], memo[i] + abs(h[i] - h[j + i]));
cout << memo[t - 1];
return 0;
}
|
replace
| 29 | 30 | 29 | 30 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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 = 1; i <= n - 1; i++) {
int it = k;
for (int j = 1; j <= it; j++) {
chmin(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
cout << cost[n - 1] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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 = 1; i <= n - 1; i++) {
int it = min(i, k);
for (int j = 1; j <= it; j++) {
chmin(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
cout << cost[n - 1] << '\n';
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int h;
for (long long int i = 1; i <= n; i++) {
cin >> h;
heights.at(i) = h;
}
dp[1] = 0;
dp[2] = abs(heights[2] - heights[1]);
for (long long int i = 3; i <= n; i++) {
long long int best = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (long long int j = 2; j <= k && j < n; j++)
best = min(best, dp[i - j] + abs(heights[i] - heights[i - j]));
dp[i] = best;
}
cout << dp[n] << endl;
}
|
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
// ifstream fin("test.in");
// #define int_max 0x3f3f3f3f
// #define int_min -0x3f3f3f3f
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> heights(n + 1, 0);
vector<long long int> dp(n + 1, 0);
long long int h;
for (long long int i = 1; i <= n; i++) {
cin >> h;
heights.at(i) = h;
}
dp[1] = 0;
dp[2] = abs(heights[2] - heights[1]);
for (long long int i = 3; i <= n; i++) {
long long int best = dp[i - 1] + abs(heights[i] - heights[i - 1]);
for (long long int j = 2; j <= k && j < i; j++)
best = min(best, dp[i - j] + abs(heights[i] - heights[i - j]));
dp[i] = best;
}
cout << dp[n] << endl;
}
|
replace
| 29 | 30 | 29 | 30 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define debug(x) cout << "### x is: " << x << "###" << endl
#define all(a) a.begin(), a.end()
#define tc \
int t; \
scanf("%d", &t); \
while (t-- 0)
#define int long long
typedef vector<int> vll;
typedef vector<vll> vvll;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
int power(int x, int p) {
int res = 1;
while (p) {
if (p % 2) {
res = (res * x) % MOD;
--p;
} else {
x = (x * x) % MOD;
p /= 2;
}
}
return res;
}
int invmod(int x) { return power(x, MOD - 2); }
int dp[N];
int a[N];
int n, k;
void go(int s, int pre, int p) {
if (s > n)
return;
dp[s] = min(dp[s], pre + abs(a[p] - a[s]));
for (int i = 1; i <= k; i++) {
go(s + i, dp[s], s);
}
}
int32_t main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n + 5; i++) {
dp[i] = LLONG_MAX;
}
go(1, 0, 1);
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define debug(x) cout << "### x is: " << x << "###" << endl
#define all(a) a.begin(), a.end()
#define tc \
int t; \
scanf("%d", &t); \
while (t-- 0)
#define int long long
typedef vector<int> vll;
typedef vector<vll> vvll;
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
int power(int x, int p) {
int res = 1;
while (p) {
if (p % 2) {
res = (res * x) % MOD;
--p;
} else {
x = (x * x) % MOD;
p /= 2;
}
}
return res;
}
int invmod(int x) { return power(x, MOD - 2); }
int dp[N];
int a[N];
int n, k;
void go(int s, int pre, int p) {
if (s > n)
return;
dp[s] = min(dp[s], pre + abs(a[p] - a[s]));
for (int i = 1; i <= k; i++) {
go(s + i, dp[s], s);
}
}
int32_t main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 0; i <= n + 5; i++) {
dp[i] = LLONG_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j <= n) {
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i + j] - a[i]));
}
}
}
cout << dp[n] << endl;
}
|
replace
| 59 | 60 | 59 | 67 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define rep(i, l, n) for (int i = (l); i < n; i++)
#define rep_cs(i, l, n) for (int i = (l); i <= n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
const ll INF = 1LL << 60;
// int max = *std::max_element(vec.begin(), vec.end());
// int sum = accumulate(list, list + size, 0);
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
using Graph = vector<vector<int>>;
Graph G;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, next_v);
}
}
int main() {
ll n, k;
cin >> n >> k;
vll h(n);
rep(i, 0, n) cin >> h[i];
ll dp[100010];
rep(i, 0, 100010) { dp[i] = INF; }
dp[0] = 0;
rep(i, 0, n) {
rep_cs(j, 1, k) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[n - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define rep(i, l, n) for (int i = (l); i < n; i++)
#define rep_cs(i, l, n) for (int i = (l); i <= n; i++)
#define rep_d(j, n) for (int j = n; j >= 0; j--)
#define rep_d_op(j, n, a) for (int j = n; j >= a; j--)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int MOD = 1000000007;
const vector<int> dx = {1, 0};
const vector<int> dy = {0, 1};
const ll INF = 1LL << 60;
// int max = *std::max_element(vec.begin(), vec.end());
// int sum = accumulate(list, list + size, 0);
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
using Graph = vector<vector<int>>;
Graph G;
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, next_v);
}
}
int main() {
ll n, k;
cin >> n >> k;
vll h(n);
rep(i, 0, n) cin >> h[i];
ll dp[110000];
rep(i, 0, 110000) { dp[i] = INF; }
dp[0] = 0;
rep(i, 0, n) {
rep_cs(j, 1, k) { chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
cout << dp[n - 1] << endl;
}
|
replace
| 63 | 65 | 63 | 65 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
// macros
#define rep(i, a, b) for (int i = a; i < b; i++)
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define tr(c, it) for (auto it = (c).begin(); it != c.end(); it++)
#define pb push_back
#define mp make_pair
#define bitcount __builtin_popcount
#define ispresent(c, x) ((c).find(x) != (c).end())
#define watch(x) cout << (#x) << " is " << (x) << "\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first << 32 | (p).second)
// template functions
template <typename T> inline void printV(vector<T> &a) {
rep(i, 0, sz(a)) { cout << a[i] << " "; }
cout << "\n";
}
template <typename T> inline void print(T a) { cout << a << "\n"; }
template <typename T> inline void print(T a, T b) {
cout << a << " " << b << "\n";
}
template <typename T> inline void print(T a, T b, T c) {
cout << a << " " << b << " " << c << "\n";
}
template <typename T> inline void print(T a, T b, T c, T d) {
cout << a << " " << b << " " << c << " " << d << "\n";
}
template <typename T> inline void printpii(pair<T, T> p) {
cout << p.first << " " << p.second << "\n";
}
template <typename T> inline void printVV(vector<vector<T>> &a) {
rep(i, 0, sz(a)) { printV(a[i]); }
cout << "\n";
}
template <typename T> inline void clearVV(vector<vector<T>> &a) {
for (auto &x : a) {
x.clear();
}
a.clear();
}
template <typename T> inline void assignVV(vector<vector<T>> &a, T val) {
for (int i = 0; i < sz(a); i++) {
for (int j = 0; j < sz(a[i]); j++) {
a[i][j] = val;
}
}
}
template <typename T> inline void readV(vector<T> &a) {
rep(i, 0, sz(a)) cin >> a[i];
}
template <typename T> inline void read(T &a) { cin >> a; }
template <typename T> inline void read(T &a, T &b) { cin >> a >> b; }
template <typename T> inline void read(T &a, T &b, T &c) { cin >> a >> b >> c; }
template <typename T> inline void read(T &a, T &b, T &c, T &d) {
cin >> a >> b >> c >> d;
}
template <typename T> inline void readpii(pair<T, T> &p) {
cin >> p.first >> p.second;
}
template <typename T> inline void readVV(vector<vector<T>> &a) {
rep(i, 0, sz(a)) { readV(a[i]); }
}
// constants
const long double eps = 1e-9;
const ll inf = 1e18;
const int modn = 1e9 + 7;
const int MAX = 1e5;
vector<ll> h;
vector<ll> dp;
int k;
ll solve(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(h[2] - h[1]);
if (dp[n] != -1)
return dp[n];
ll ans = inf;
for (int i = 1; i <= k; i++) {
ans = min(ans, solve(n - i) + abs(h[n] - h[n - i]));
}
return dp[n] = ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Your code here
int n;
cin >> n >> k;
h.resize(n + 1);
dp.resize(n + 1);
fill(all(dp), -1);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << solve(n) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
// macros
#define rep(i, a, b) for (int i = a; i < b; i++)
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define all(c) c.begin(), c.end()
#define tr(c, it) for (auto it = (c).begin(); it != c.end(); it++)
#define pb push_back
#define mp make_pair
#define bitcount __builtin_popcount
#define ispresent(c, x) ((c).find(x) != (c).end())
#define watch(x) cout << (#x) << " is " << (x) << "\n";
#define sz(x) ((int)((x).size()))
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define pii2ll(p) ((ll)(p).first << 32 | (p).second)
// template functions
template <typename T> inline void printV(vector<T> &a) {
rep(i, 0, sz(a)) { cout << a[i] << " "; }
cout << "\n";
}
template <typename T> inline void print(T a) { cout << a << "\n"; }
template <typename T> inline void print(T a, T b) {
cout << a << " " << b << "\n";
}
template <typename T> inline void print(T a, T b, T c) {
cout << a << " " << b << " " << c << "\n";
}
template <typename T> inline void print(T a, T b, T c, T d) {
cout << a << " " << b << " " << c << " " << d << "\n";
}
template <typename T> inline void printpii(pair<T, T> p) {
cout << p.first << " " << p.second << "\n";
}
template <typename T> inline void printVV(vector<vector<T>> &a) {
rep(i, 0, sz(a)) { printV(a[i]); }
cout << "\n";
}
template <typename T> inline void clearVV(vector<vector<T>> &a) {
for (auto &x : a) {
x.clear();
}
a.clear();
}
template <typename T> inline void assignVV(vector<vector<T>> &a, T val) {
for (int i = 0; i < sz(a); i++) {
for (int j = 0; j < sz(a[i]); j++) {
a[i][j] = val;
}
}
}
template <typename T> inline void readV(vector<T> &a) {
rep(i, 0, sz(a)) cin >> a[i];
}
template <typename T> inline void read(T &a) { cin >> a; }
template <typename T> inline void read(T &a, T &b) { cin >> a >> b; }
template <typename T> inline void read(T &a, T &b, T &c) { cin >> a >> b >> c; }
template <typename T> inline void read(T &a, T &b, T &c, T &d) {
cin >> a >> b >> c >> d;
}
template <typename T> inline void readpii(pair<T, T> &p) {
cin >> p.first >> p.second;
}
template <typename T> inline void readVV(vector<vector<T>> &a) {
rep(i, 0, sz(a)) { readV(a[i]); }
}
// constants
const long double eps = 1e-9;
const ll inf = 1e18;
const int modn = 1e9 + 7;
const int MAX = 1e5;
vector<ll> h;
vector<ll> dp;
int k;
ll solve(int n) {
if (n == 1)
return 0;
if (n == 2)
return abs(h[2] - h[1]);
if (dp[n] != -1)
return dp[n];
ll ans = inf;
for (int i = 1; i <= k and n - i >= 1; i++) {
ans = min(ans, solve(n - i) + abs(h[n] - h[n - i]));
}
return dp[n] = ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// Your code here
int n;
cin >> n >> k;
h.resize(n + 1);
dp.resize(n + 1);
fill(all(dp), -1);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
cout << solve(n) << "\n";
return 0;
}
|
replace
| 100 | 101 | 100 | 101 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < int(vec.size()); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table.at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < int(table.size()); i++) {
for (int j = 0; j < int(table.at(0).size()); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n, r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void Yes(bool f) {
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void YES(bool f) {
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
bool leapyear(int y) {
// 閏年かどうかを判定
if (y % 4 == 0) {
if (y % 100 == 0) {
if (y % 400 == 0) {
return true;
} else {
return false;
}
} else {
return true;
}
} else {
return false;
}
}
tuple<int, int, int> dayplus(int y, int m, int d) {
// 次の日を返す
// 31日まである月
if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) {
if (d != 31) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
}
// 30日まである月
else if (m == 4 || m == 6 || m == 9 || m == 11) {
if (d != 30) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 2月
else {
// 閏年の場合
if (leapyear(y)) {
if (d != 29) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 閏年ではない場合
else {
if (d != 28) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
}
}
tuple<int, int, int> monplus(int y, int m, int d) {
// 月を一つ先に、日を一日にする
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
bool in(vector<int> a, int x) {
if (find(a.begin(), a.end(), x) != a.end()) {
return true;
} else {
return false;
}
}
int count_bool(vector<bool> flag) {
int count = 0;
for (int i = 0; i < int(flag.size()); i++) {
if (flag[i]) {
count++;
}
}
return count;
}
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() {
const long long INF = 1LL << 60;
long long dp[100010];
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
dp[1] = 0;
int n, k;
cin >> n >> k;
vector<ll> h(100010);
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
cout << dp[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < int(vec.size()); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table.at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < int(table.size()); i++) {
for (int j = 0; j < int(table.at(0).size()); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n, r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void Yes(bool f) {
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void YES(bool f) {
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
bool leapyear(int y) {
// 閏年かどうかを判定
if (y % 4 == 0) {
if (y % 100 == 0) {
if (y % 400 == 0) {
return true;
} else {
return false;
}
} else {
return true;
}
} else {
return false;
}
}
tuple<int, int, int> dayplus(int y, int m, int d) {
// 次の日を返す
// 31日まである月
if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10 || m == 12) {
if (d != 31) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
}
// 30日まである月
else if (m == 4 || m == 6 || m == 9 || m == 11) {
if (d != 30) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 2月
else {
// 閏年の場合
if (leapyear(y)) {
if (d != 29) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
// 閏年ではない場合
else {
if (d != 28) {
d++;
return make_tuple(y, m, d);
} else {
d = 1;
m++;
return make_tuple(y, m, d);
}
}
}
}
tuple<int, int, int> monplus(int y, int m, int d) {
// 月を一つ先に、日を一日にする
d = 1;
if (m == 12) {
m = 1;
y++;
return make_tuple(y, m, d);
} else {
m++;
return make_tuple(y, m, d);
}
}
bool in(vector<int> a, int x) {
if (find(a.begin(), a.end(), x) != a.end()) {
return true;
} else {
return false;
}
}
int count_bool(vector<bool> flag) {
int count = 0;
for (int i = 0; i < int(flag.size()); i++) {
if (flag[i]) {
count++;
}
}
return count;
}
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() {
const long long INF = 1LL << 60;
long long dp[100010];
for (int i = 0; i < 100010; ++i) {
dp[i] = INF;
}
dp[1] = 0;
int n, k;
cin >> n >> k;
vector<ll> h(100010);
for (int i = 1; i <= n; ++i) {
cin >> h[i];
}
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= k; ++j) {
if (i > j) {
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
}
cout << dp[n] << endl;
}
|
replace
| 279 | 280 | 279 | 282 |
0
| |
p03161
|
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;
int k;
cin >> k;
vi arr(n);
vi dp(n, 1e9);
dp[0] = 0;
rep(i, n) cin >> arr[i];
forr(i, 1, n) for (int j = i - 1; j >= 0 && i - j <= k; j--) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
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;
int k;
cin >> k;
vi arr(n);
vi dp(n, 1e9);
dp[0] = 0;
rep(i, n) cin >> arr[i];
forr(i, 1, n) for (int j = i - 1; j >= 0 && i - j <= k; j--) dp[i] =
min(dp[i], dp[j] + abs(arr[i] - arr[j]));
cout << dp[n - 1];
cout << E;
}
return 0;
}
|
replace
| 37 | 38 | 37 | 38 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/a.in", "r", stdin);
// freopen("../IO/a.in", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::cin, std::cout);
return 0;
}
void solve(std::istream &in, std::ostream &out) {
int n, k;
in >> n >> k;
vector<int> dp(n + 1);
vector<int> h(n);
for (int &i : h) {
in >> i;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = numeric_limits<int>::max();
for (int j = 1; j <= k; ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
out << dp[n - 1] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(std::istream &in, std::ostream &out);
int main() {
#ifdef LOCAL
freopen("../IO/a.in", "r", stdin);
// freopen("../IO/a.in", "w", stdout);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
#endif
solve(std::cin, std::cout);
return 0;
}
void solve(std::istream &in, std::ostream &out) {
int n, k;
in >> n >> k;
vector<int> dp(n + 1);
vector<int> h(n);
for (int &i : h) {
in >> i;
}
dp[0] = 0;
dp[1] = abs(h[1] - h[0]);
for (int i = 2; i < n; ++i) {
dp[i] = numeric_limits<int>::max();
for (int j = 1; j <= min(k, i); ++j) {
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
out << dp[n - 1] << '\n';
}
|
replace
| 30 | 31 | 30 | 31 |
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;
#define ll long long int
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define MOD 1000000007
#define pb push_back
#define S second
#define F first
#define P pair<ll, ll>
#define PI 3.1415926535897932384626433832795028
// #define ordered_set tree<ll, null_type,less_equal<>,
// rb_tree_tag,tree_order_statistics_node_update>
int mul(int a, int b) { return (long long)a * b % MOD; }
int power(int a, int b) {
int ans = 1;
while (b > 0) {
if (b & 1)
ans = mul(ans, a);
a = mul(a, a);
b >>= 1;
}
return ans;
}
// bitset<400000010> b;
// ll n=100000;
ll p[1000100] = {0};
vector<ll> v[1000000];
void sieve(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (!p[i])
// primes.push_back(i);
for (ll j = i; j <= n; j += i) {
if (i != j)
;
p[j] = 1;
}
}
}
// ll nextPowerOf2(ll n)
// {
// ll p = 1;
// if (n && !(n & (n - 1)))
// return n;
// while (p < n)
// p <<= 1;
// return p;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll factorial(ll n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
struct segmenttree {
vector<int> st;
int n;
void init(int _n) {
n = _n;
st.clear();
st.resize(4 * _n, 0);
}
void update(int l, int r, int indup, int val, int node) {
if (l == r) {
st[node] += val;
return;
} else {
int mid = (l + r) / 2;
if (indup >= l && indup <= mid) {
update(l, mid, indup, val, node * 2 + 1);
} else {
update(mid + 1, r, indup, val, node * 2 + 2);
}
st[node] = st[2 * node + 1] + st[2 * node + 2];
}
}
int query(int si, int se, int l, int r, int node) {
if (se < l || si > r || l > r) {
return 0;
}
if (si >= l && se <= r) {
return st[node];
}
int mid = (si + se) / 2;
int q1 = query(si, mid, l, r, node * 2 + 1);
int q2 = query(mid + 1, se, l, r, node * 2 + 2);
return q1 + q2;
}
int query(int l, int r) { return query(0, n - 1, l, r, 0); }
void update(int index, int val) { update(0, n - 1, index, val, 0); }
} tree;
bool chkcow(ll n, vector<ll> &a, ll k, ll mis) {
ll sum = 0;
for (ll i = 0; i < n; i++) {
if (a[i] > mis)
sum += a[i] - mis;
if (sum >= k)
return true;
}
return false;
}
struct cmp {
bool operator()(const pair<ll, ll> &a, const pair<ll, ll> &b) const {
ll lena = a.S - a.F;
ll lenb = b.S - b.F;
if (lena == lenb)
return a.F < b.F;
return lena > lenb;
}
};
int32_t main() {
fast
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n, k;
cin >> n >> k;
ll a[n + 10];
ll dp[n + 10];
for (ll i = 0; i < n; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
// if (n <= 2) {
// cout << abs(a[0] - a[1]) << endl;
// return 0;
// }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
for (ll ii = 1; ii <= k; ii++)
if (i - ii >= 0)
dp[i] = min(dp[i], dp[i - ii] + abs(a[i] - a[i - ii]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#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;
#define ll long long int
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define MOD 1000000007
#define pb push_back
#define S second
#define F first
#define P pair<ll, ll>
#define PI 3.1415926535897932384626433832795028
// #define ordered_set tree<ll, null_type,less_equal<>,
// rb_tree_tag,tree_order_statistics_node_update>
int mul(int a, int b) { return (long long)a * b % MOD; }
int power(int a, int b) {
int ans = 1;
while (b > 0) {
if (b & 1)
ans = mul(ans, a);
a = mul(a, a);
b >>= 1;
}
return ans;
}
// bitset<400000010> b;
// ll n=100000;
ll p[1000100] = {0};
vector<ll> v[1000000];
void sieve(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (!p[i])
// primes.push_back(i);
for (ll j = i; j <= n; j += i) {
if (i != j)
;
p[j] = 1;
}
}
}
// ll nextPowerOf2(ll n)
// {
// ll p = 1;
// if (n && !(n & (n - 1)))
// return n;
// while (p < n)
// p <<= 1;
// return p;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll factorial(ll n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
struct segmenttree {
vector<int> st;
int n;
void init(int _n) {
n = _n;
st.clear();
st.resize(4 * _n, 0);
}
void update(int l, int r, int indup, int val, int node) {
if (l == r) {
st[node] += val;
return;
} else {
int mid = (l + r) / 2;
if (indup >= l && indup <= mid) {
update(l, mid, indup, val, node * 2 + 1);
} else {
update(mid + 1, r, indup, val, node * 2 + 2);
}
st[node] = st[2 * node + 1] + st[2 * node + 2];
}
}
int query(int si, int se, int l, int r, int node) {
if (se < l || si > r || l > r) {
return 0;
}
if (si >= l && se <= r) {
return st[node];
}
int mid = (si + se) / 2;
int q1 = query(si, mid, l, r, node * 2 + 1);
int q2 = query(mid + 1, se, l, r, node * 2 + 2);
return q1 + q2;
}
int query(int l, int r) { return query(0, n - 1, l, r, 0); }
void update(int index, int val) { update(0, n - 1, index, val, 0); }
} tree;
bool chkcow(ll n, vector<ll> &a, ll k, ll mis) {
ll sum = 0;
for (ll i = 0; i < n; i++) {
if (a[i] > mis)
sum += a[i] - mis;
if (sum >= k)
return true;
}
return false;
}
struct cmp {
bool operator()(const pair<ll, ll> &a, const pair<ll, ll> &b) const {
ll lena = a.S - a.F;
ll lenb = b.S - b.F;
if (lena == lenb)
return a.F < b.F;
return lena > lenb;
}
};
int32_t main() {
fast
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ll n,
k;
cin >> n >> k;
ll a[n + 10];
ll dp[n + 10];
for (ll i = 0; i < n; i++) {
cin >> a[i];
dp[i] = INT_MAX;
}
// if (n <= 2) {
// cout << abs(a[0] - a[1]) << endl;
// return 0;
// }
dp[0] = 0;
dp[1] = abs(a[1] - a[0]);
for (ll i = 2; i < n; i++) {
for (ll ii = 1; ii <= k; ii++)
if (i - ii >= 0)
dp[i] = min(dp[i], dp[i - ii] + abs(a[i] - a[i - ii]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 131 | 136 | 131 | 137 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#define pb push_back
#define f first
#define s second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vi vector<int>
#define vll vector<ll>
#define be begin
#define en end
#define endl '\n'
#define SIZE 1000000
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define value_at_idx find_by_order
#define idx order_of_key
#define MOD 1000000007
#define reset(dp) memset(dp, 0, sizeof(dp))
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
int dp[SIZE];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
reset(dp);
dp[1] = 0;
int n, k;
cin >> n >> k;
vi v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= k; j++) {
mn = min(mn, dp[i - j] + abs(v[i] - v[i - j]));
}
dp[i] = mn;
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <climits>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#define pb push_back
#define f first
#define s second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vi vector<int>
#define vll vector<ll>
#define be begin
#define en end
#define endl '\n'
#define SIZE 1000000
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define value_at_idx find_by_order
#define idx order_of_key
#define MOD 1000000007
#define reset(dp) memset(dp, 0, sizeof(dp))
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
int dp[SIZE];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
reset(dp);
dp[1] = 0;
int n, k;
cin >> n >> k;
vi v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
dp[1] = abs(v[1] - v[0]);
for (int i = 2; i < n; i++) {
int mn = INT_MAX;
for (int j = 1; j <= k; j++) {
if (i >= j)
mn = min(mn, dp[i - j] + abs(v[i] - v[i - j]));
}
dp[i] = mn;
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 52 | 53 | 52 | 54 |
0
| |
p03161
|
C++
|
Runtime Error
|
/*https://atcoder.jp/contests/dp/tasks/dp_b*/
#include <bits/stdc++.h>
#include <sstream>
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define pi 2 * acos(0.0)
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define repe(i, a, b) for (ll i = a; i <= b; ++i)
#define CPrint(c) \
for (auto i : (c)) { \
cout << i << " "; \
} \
nl
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define sz(a) int((a).size())
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
// Allows to traverse any type of macro
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
// debuggers
#define trace2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl
#define trace3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z \
<< endl
#define trace4(w, x, y, z) \
cout << #w << "=" << w << " " << #x << "=" << x << " " << #y << "=" << y \
<< " " << #z << "=" << z << endl
typedef long long ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 5;
int main() {
FAST_IO;
ll n, k;
cin >> n >> k;
vector<ll> dp(n, INF);
dp[0] = 0; // base case
vector<ll> h(n);
rep(i, 0, n) { cin >> h[i]; }
/* i+1.. i+k abs(h[i]-h[j])
*/
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
|
/*https://atcoder.jp/contests/dp/tasks/dp_b*/
#include <bits/stdc++.h>
#include <sstream>
#define FAST_IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl "\n"
#define pi 2 * acos(0.0)
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define repe(i, a, b) for (ll i = a; i <= b; ++i)
#define CPrint(c) \
for (auto i : (c)) { \
cout << i << " "; \
} \
nl
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define mp make_pair
#define sz(a) int((a).size())
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
// Allows to traverse any type of macro
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
// debuggers
#define trace2(x, y) cout << #x << "=" << x << " " << #y << "=" << y << endl
#define trace3(x, y, z) \
cout << #x << "=" << x << " " << #y << "=" << y << " " << #z << "=" << z \
<< endl
#define trace4(w, x, y, z) \
cout << #w << "=" << w << " " << #x << "=" << x << " " << #y << "=" << y \
<< " " << #z << "=" << z << endl
typedef long long ll;
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 5;
int main() {
FAST_IO;
ll n, k;
cin >> n >> k;
vector<ll> dp(n, INF);
dp[0] = 0; // base case
vector<ll> h(n);
rep(i, 0, n) { cin >> h[i]; }
/* i+1.. i+k abs(h[i]-h[j])
*/
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k && j < n; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 53 | 54 | 53 | 54 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
#define MAX 2000000000
int dp[10000];
int main() {
int N, K;
cin >> N >> K;
int A[N];
for (int i = 0; N > i; i++) {
cin >> A[i];
}
for (int i = 0; N > i; i++) {
dp[i] = MAX;
}
dp[0] = 0;
for (int i = 0; N > i; i++) {
for (int j = 0; min(K + i + 1, N) > i + j + 1; j++) {
dp[i + j + 1] = min(dp[i + j + 1], dp[i] + abs(A[i + j + 1] - A[i]));
// cout << i << " " << j << " " << i+j+1 << endl;
}
}
cout << dp[N - 1] << endl;
}
|
#include <iostream>
using namespace std;
#define MAX 2000000000
int dp[100000];
int main() {
int N, K;
cin >> N >> K;
int A[N];
for (int i = 0; N > i; i++) {
cin >> A[i];
}
for (int i = 0; N > i; i++) {
dp[i] = MAX;
}
dp[0] = 0;
for (int i = 0; N > i; i++) {
for (int j = 0; min(K + i + 1, N) > i + j + 1; j++) {
dp[i + j + 1] = min(dp[i + j + 1], dp[i] + abs(A[i + j + 1] - A[i]));
// cout << i << " " << j << " " << i+j+1 << endl;
}
}
cout << dp[N - 1] << endl;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03161
|
C++
|
Runtime Error
|
/*
...........__________
| ___ __
.............| |
| | /
.............| |
| | /
.............| | | __ | /
_______
.............|_______| _______ _______ |______ ________ /| /
| |/ | |
.............| \ | | | | | | | / | /
| |\ |
.............| \ _______| | | |_______ | | _______| |/ |
| \ |
.............| \ | | | | | | | | | | |
| \ |
......... __| \__| |______| |______| ________| | |_ |_______| |
|__| _| \__ _| .
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long int
#define ld long double
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define pf push_front
#define popb pop_back
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define prec(x) fixed << setprecision(15) << x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define fo0(i, n) for (int i = 0, i##end = n; i < i##end; i++)
#define fo1(i, n) for (int i = 1, i##end = n; i <= i##end; i++)
#define fo(i, a, b) for (int i = a, i##end = b; i <= i##end; i++)
#define foe(i, x) for (__typeof((x).end()) i = (x).begin(); i != (x).end(); ++i)
#define fre(i, x) \
for (__typeof((x).rend()) i = (x).rbegin(); i != (x).rend(); ++i)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define inf 1e18
const int mod = 1e9 + 7;
const int N = 4e5 + 10;
void raushan_kumar() {
int n, k;
cin >> n >> k;
int a[n + 1];
fo1(i, n) { cin >> a[i]; }
int dp[n + 1];
for (int i = 1; i <= n; i++) {
dp[i] = INT_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n];
}
int32_t main() {
fast;
int t = 1;
// cin>>t;
while (t--) {
raushan_kumar();
}
}
|
/*
...........__________
| ___ __
.............| |
| | /
.............| |
| | /
.............| | | __ | /
_______
.............|_______| _______ _______ |______ ________ /| /
| |/ | |
.............| \ | | | | | | | / | /
| |\ |
.............| \ _______| | | |_______ | | _______| |/ |
| \ |
.............| \ | | | | | | | | | | |
| \ |
......... __| \__| |______| |______| ________| | |_ |_______| |
|__| _| \__ _| .
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long int
#define ld long double
#define vi vector<int>
#define vii vector<pair<int, int>>
#define vvi vector<vector<int>>
#define pf push_front
#define popb pop_back
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define prec(x) fixed << setprecision(15) << x
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define fo0(i, n) for (int i = 0, i##end = n; i < i##end; i++)
#define fo1(i, n) for (int i = 1, i##end = n; i <= i##end; i++)
#define fo(i, a, b) for (int i = a, i##end = b; i <= i##end; i++)
#define foe(i, x) for (__typeof((x).end()) i = (x).begin(); i != (x).end(); ++i)
#define fre(i, x) \
for (__typeof((x).rend()) i = (x).rbegin(); i != (x).rend(); ++i)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define inf 1e18
const int mod = 1e9 + 7;
const int N = 4e5 + 10;
void raushan_kumar() {
int n, k;
cin >> n >> k;
int a[n + 1];
fo1(i, n) { cin >> a[i]; }
int dp[n + 1];
for (int i = 1; i <= n; i++) {
dp[i] = INT_MAX;
}
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k and i + j <= n; j++) {
dp[i + j] = min(dp[i + j], dp[i] + abs(a[i] - a[i + j]));
}
}
cout << dp[n];
}
int32_t main() {
fast;
int t = 1;
// cin>>t;
while (t--) {
raushan_kumar();
}
}
|
replace
| 64 | 65 | 64 | 65 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
int32_t 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 next = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j <= k; ++j) {
int cand = dp[i - j] + abs(h[i] - h[i - j]);
next = min(next, cand);
}
dp[i] = next;
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
int32_t 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 next = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; i - j >= 0 && j <= k; ++j) {
int cand = dp[i - j] + abs(h[i] - h[i - j]);
next = min(next, cand);
}
dp[i] = next;
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 20 | 21 | 20 | 21 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
int dp[100000];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int p = 0; p < n; p++) {
for (int q = 1; q <= k; q++) {
dp[p + q] = min(dp[p + q], dp[p] + abs(h[p] - h[p + q]));
}
}
cout << dp[n - 1] << endl;
}
|
#include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
int dp[100000];
for (int i = 0; i < n; i++) {
cin >> h[i];
dp[i] = INT_MAX;
}
dp[0] = 0;
for (int p = 0; p < n; p++) {
for (int q = 1; q <= k; q++) {
if (p + q >= n)
break;
dp[p + q] = min(dp[p + q], dp[p] + abs(h[p] - h[p + q]));
}
}
cout << dp[n - 1] << endl;
}
|
insert
| 16 | 16 | 16 | 18 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, m, n) for (int i = (int)m; i < (int)n; i++)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii; // 2次元配列
typedef vector<ll> vll;
typedef vector<string> vs;
const int inf = 1e9;
/*FUNCs=================================================*/
/*MAIN==================================================*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false); // cin cout 高速化
int n, k;
cin >> n >> k;
vi h(n);
rep(i, n) cin >> h[i];
vi cost(n, inf);
cost[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= k; j++) { // 1-orijin
cost[i] = min(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
cout << cost[n - 1] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, m, n) for (int i = (int)m; i < (int)n; i++)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vii; // 2次元配列
typedef vector<ll> vll;
typedef vector<string> vs;
const int inf = 1e9;
/*FUNCs=================================================*/
/*MAIN==================================================*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false); // cin cout 高速化
int n, k;
cin >> n >> k;
vi h(n);
rep(i, n) cin >> h[i];
vi cost(n, inf);
cost[0] = 0;
for (int i = 1; i < n; i++) {
for (int j = 1; (i < k ? j <= i : j <= k); j++) {
cost[i] = min(cost[i], cost[i - j] + abs(h[i] - h[i - j]));
}
}
cout << cost[n - 1] << '\n';
}
|
replace
| 26 | 28 | 26 | 28 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, dp[10001], h[10001];
fill(dp, dp + 10001, 1e9);
dp[0] = 0;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
for (int k = 1; k <= K; k++)
if (i + k < N)
dp[i + k] = min(abs(h[i + k] - h[i]) + dp[i], dp[i + k]);
cout << dp[N - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, dp[100001], h[100001];
fill(dp, dp + 100001, 1e9);
dp[0] = 0;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
for (int i = 0; i < N; i++)
for (int k = 1; k <= K; k++)
if (i + k < N)
dp[i + k] = min(abs(h[i + k] - h[i]) + dp[i], dp[i + k]);
cout << dp[N - 1] << endl;
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
cout << fixed << setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll, ll>
#define vpl vector<pll>
#define vvl vector<vector<ll>>
#define vvpl vector<vector<pll>>
#define ff first
#define ss second
#define pqueue priority_queue<ll>
#define pdqueue priority_queue<ll, vl, greater<ll>>
#define mem(a, b) memset(a, b, sizeof(a));
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
// #define x ff
// #define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &a : v)
is >> a;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v)
os << t << " ";
return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
return os << v.first << " " << v.second;
}
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll kv;
ll t, n, x, y, h, k, z, p, q, w, r;
string s, s1, s2;
// vvl v;
// vl vis,d;
int main() {
IOS;
cin >> n >> k;
vl v(n);
cin >> v;
vl a(n, 0);
for (int i = 1; i < n; i++) {
kv = inf * inf;
for (int j = i - 1; j >= i - k; j--)
kv = min(kv, a[j] + abs(v[i] - v[j]));
a[i] = kv;
}
cout << a[n - 1];
return 0;
}
|
#include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#define pb push_back
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0); \
cout << fixed << setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll, ll>
#define vpl vector<pll>
#define vvl vector<vector<ll>>
#define vvpl vector<vector<pll>>
#define ff first
#define ss second
#define pqueue priority_queue<ll>
#define pdqueue priority_queue<ll, vl, greater<ll>>
#define mem(a, b) memset(a, b, sizeof(a));
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll) a.size()
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define vl vector<ll>
// #define x ff
// #define y ss
#define pt(a) \
for (auto it : a) \
cout << it << " "; \
cout << endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;
// vector
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &a : v)
is >> a;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (const T &t : v)
os << t << " ";
return os << endl;
}
// pair
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &v) {
return os << v.first << " " << v.second;
}
double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }
long long bpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll kv;
ll t, n, x, y, h, k, z, p, q, w, r;
string s, s1, s2;
// vvl v;
// vl vis,d;
int main() {
IOS;
cin >> n >> k;
vl v(n);
cin >> v;
vl a(n, 0);
for (int i = 1; i < n; i++) {
kv = inf * inf;
for (int j = i - 1; j >= i - k && j >= 0; j--)
kv = min(kv, a[j] + abs(v[i] - v[j]));
a[i] = kv;
}
cout << a[n - 1];
return 0;
}
|
replace
| 91 | 92 | 91 | 92 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (long long i = 0; i < n; ++i)
#define REPR(i, n) for (long long i = n; i >= 0; --i)
#define REPI(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define REPIR(itr, v) for (auto itr = v.rbegin(); itr != v.rend(); ++itr)
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
#define SORT(v, n) sort(v, v + n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(), v.end()
#define llong long long
#define INF 999999999
#define SUR 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair
#define SV(v) \
{ \
for (long long sitr = 0; sitr < v.size(); ++sitr) { \
cin >> v[sitr]; \
} \
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
using namespace std;
typedef pair<int, int> pii;
int main() {
int n, K;
cin >> n >> K;
vector<llong> h(n);
REP(i, n) { cin >> h[i]; }
llong dp[100001] = {};
REP(i, 100001) { dp[i] = INF; }
dp[0] = 0;
REP(i, n) {
FOR(k, 1, K + 1)
dp[i + k] = min(dp[i + k], dp[i] + abs(h[i] - h[i + k]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (long long i = 0; i < n; ++i)
#define REPR(i, n) for (long long i = n; i >= 0; --i)
#define REPI(itr, v) for (auto itr = v.begin(); itr != v.end(); ++itr)
#define REPIR(itr, v) for (auto itr = v.rbegin(); itr != v.rend(); ++itr)
#define FOR(i, a, b) for (long long i = a; i < b; ++i)
#define SORT(v, n) sort(v, v + n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(), v.end()
#define llong long long
#define INF 999999999
#define SUR 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair
#define SV(v) \
{ \
for (long long sitr = 0; sitr < v.size(); ++sitr) { \
cin >> v[sitr]; \
} \
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
using namespace std;
typedef pair<int, int> pii;
int main() {
int n, K;
cin >> n >> K;
vector<llong> h(n);
REP(i, n) { cin >> h[i]; }
llong dp[100001] = {};
REP(i, 100001) { dp[i] = INF; }
dp[0] = 0;
REP(i, n) {
FOR(k, 1, K + 1)
if (i + k < n)
dp[i + k] = min(dp[i + k], dp[i] + abs(h[i] - h[i + k]));
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 57 | 58 | 57 | 59 |
0
| |
p03161
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e18
#define MAX_N 100005
ll N, K, h[MAX_N], memo[MAX_N];
ll dp(int p) {
if (p < 1) {
return INF;
}
if (p == 1) {
return 0;
}
if (p <= K + 1) {
return abs(h[p] - h[1]);
}
ll opt = INF;
for (int i = 1; i <= K; i++) {
opt = min(opt, abs(h[p] - h[p - i]) + dp(p - i));
}
return memo[p] = opt;
}
int main() {
scanf("%lli %lli", &N, &K);
for (int i = 1; i <= N; i++) {
scanf("%lli", &h[i]);
}
printf("%lli\n", dp(N));
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e18
#define MAX_N 100005
ll N, K, h[MAX_N], memo[MAX_N];
ll dp(int p) {
if (p < 1) {
return INF;
}
if (p == 1) {
return 0;
}
if (p <= K + 1) {
return abs(h[p] - h[1]);
}
ll opt = INF;
for (int i = 1; i <= K; i++) {
opt = min(opt, abs(h[p] - h[p - i]) + dp(p - i));
}
return memo[p] = opt;
}
int main() {
scanf("%lli %lli", &N, &K);
for (int i = 1; i <= N; i++) {
scanf("%lli", &h[i]);
}
// printf("%lli\n", dp(N));
for (int i = 2; i <= 1 + K; i++) {
memo[i] = abs(h[i] - h[1]);
}
for (int i = 2 + K; i <= N; i++) {
ll opt = INF;
for (int j = 1; j <= K; j++) {
opt = min(opt, abs(h[i] - h[i - j]) + memo[i - j]);
}
memo[i] = opt;
}
printf("%lli\n", memo[N]);
}
|
replace
| 32 | 33 | 32 | 44 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
int main() {
ll inf = 1LL << 60;
int N, K;
cin >> N >> K;
ll dp[100010];
vector<ll> hs(100100, 0);
ll h;
for (int i = 0; i < N; ++i) {
dp[i] = inf;
cin >> h;
hs[i] = h;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int y = 1; y <= K; ++y) {
dp[i + y] = min(dp[i + y], dp[i] + abs(hs[i] - hs[i + y]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
int main() {
ll inf = 1LL << 60;
int N, K;
cin >> N >> K;
ll dp[100100];
vector<ll> hs(100100, 0);
ll h;
for (int i = 0; i < N; ++i) {
dp[i] = inf;
cin >> h;
hs[i] = h;
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int y = 1; y <= K; ++y) {
dp[i + y] = min(dp[i + y], dp[i] + abs(hs[i] - hs[i + y]));
}
}
cout << dp[N - 1] << endl;
return 0;
}
|
replace
| 33 | 34 | 33 | 34 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
const LL MAX = 100005;
const LL INF = 1000 * 1000 * 1000 + 9;
LL n, k, DP[MAX] = {}, stone[MAX] = {};
LL calc(LL idx) {
if (DP[idx] != INF)
return DP[idx];
else if (idx == n - 1)
return DP[idx] = 0;
else if (idx > n - 1)
return INF;
else {
LL MIN = INF;
for (LL i0 = 1; i0 <= k; i0++) {
if (idx + i0 > n - 1)
break;
MIN = min(MIN, calc(DP[idx + i0] + abs(stone[idx + i0] - stone[idx])));
}
return DP[idx] = MIN;
}
}
int main(void) {
cin >> n >> k;
for (LL i0 = 0; i0 < n; i0++) {
cin >> stone[i0];
DP[i0] = INF;
}
cout << calc(0) << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long LL;
const LL MAX = 100005;
const LL INF = 1000 * 1000 * 1000 + 9;
LL n, k, DP[MAX] = {}, stone[MAX] = {};
LL calc(LL idx) {
if (DP[idx] != INF)
return DP[idx];
else if (idx == n - 1)
return DP[idx] = 0;
else if (idx > n - 1)
return INF;
else {
LL MIN = INF;
for (LL i0 = 1; i0 <= k; i0++) {
if (idx + i0 > n - 1)
break;
MIN = min(MIN, calc(idx + i0) + abs(stone[idx + i0] - stone[idx]));
}
return DP[idx] = MIN;
}
}
int main(void) {
cin >> n >> k;
for (LL i0 = 0; i0 < n; i0++) {
cin >> stone[i0];
DP[i0] = INF;
}
cout << calc(0) << endl;
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
-11
| |
p03161
|
C++
|
Runtime Error
|
// B - Frog 2
#include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
#define chmin(x, y) x = min(x, y)
int main() {
int INF = 1e+9, N, K;
cin >> N >> K;
vector<int> H(N), dp(N, INF);
rp(i, 0, N) cin >> H[i]; // i:[0,N-1]
dp[0] = 0;
rp(i, 1, N) { // i:[1,N-1]
for (int j = i - 1; j >= i - K; --j) // j:i-k:[i-1,i-K]
chmin(dp[i], dp[j] + abs(H[j] - H[i]));
}
cout << dp[N - 1] << endl;
}
|
// B - Frog 2
#include <bits/stdc++.h>
using namespace std;
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
#define chmin(x, y) x = min(x, y)
int main() {
int INF = 1e+9, N, K;
cin >> N >> K;
vector<int> H(N), dp(N, INF);
rp(i, 0, N) cin >> H[i]; // i:[0,N-1]
dp[0] = 0;
rp(i, 1, N) { // i:[1,N-1]
for (int j = i - 1; j >= max(0, i - K); --j) // j:i-k:[i-1,max(0,i-K)]
chmin(dp[i], dp[j] + abs(H[j] - H[i]));
}
cout << dp[N - 1] << endl;
}
|
replace
| 12 | 14 | 12 | 14 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define all(v) ((v).begin()), ((v).end())
#define rall(v) ((v).rbegin()), ((v).rend())
#define clr(v, line) memset(v, line, sizeof(v))
#define endl '\n'
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *coma = strchr(names + 1, ',');
cerr.write(names, coma - names) << " : " << arg1 << " | ";
__f(coma + 1, args...);
}
#else
#define trace(...)
#endif
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
int N, k;
std::vector<int> dp(100005, INT_MAX), h;
int main(int argc, char const *argv[]) {
file();
fast();
cin >> N >> k;
h.resize(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= min(k, N - i); ++j) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1];
}
|
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define all(v) ((v).begin()), ((v).end())
#define rall(v) ((v).rbegin()), ((v).rend())
#define clr(v, line) memset(v, line, sizeof(v))
#define endl '\n'
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *coma = strchr(names + 1, ',');
cerr.write(names, coma - names) << " : " << arg1 << " | ";
__f(coma + 1, args...);
}
#else
#define trace(...)
#endif
void file() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
int N, k;
std::vector<int> dp(100005, INT_MAX), h;
int main(int argc, char const *argv[]) {
// file();
fast();
cin >> N >> k;
h.resize(N);
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 0; i < N; ++i) {
for (int j = 1; j <= min(k, N - i); ++j) {
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[N - 1];
}
|
replace
| 43 | 44 | 43 | 44 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long h[10010];
long long dp[100010];
int main() {
int N, K;
scanf("%d%d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%lld", &h[i]);
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j < 0)
break;
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
printf("%lld", dp[N - 1]);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const long long INF = 1LL << 60;
long long h[100010];
long long dp[100010];
int main() {
int N, K;
scanf("%d%d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%lld", &h[i]);
}
for (int i = 0; i < N; i++) {
dp[i] = INF;
}
dp[0] = 0;
for (int i = 1; i < N; i++) {
for (int j = 1; j <= K; j++) {
if (i - j < 0)
break;
chmin(dp[i], dp[i - j] + abs(h[i] - h[i - j]));
}
}
printf("%lld", dp[N - 1]);
}
|
replace
| 19 | 20 | 19 | 20 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll unsigned long long int
#define loop(i, a, b) for (int i = a; i < b; i++)
int main() {
int n, k;
int h[100005];
cin >> n >> k;
loop(i, 0, n) cin >> h[i];
ll dp[100005];
loop(i, 0, 100005) dp[i] = -1;
dp[0] = 0;
int i, j;
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll unsigned long long int
#define loop(i, a, b) for (int i = a; i < b; i++)
int main() {
int n, k;
int h[100005];
cin >> n >> k;
loop(i, 0, n) cin >> h[i];
ll dp[100005];
loop(i, 0, 100005) dp[i] = -1;
dp[0] = 0;
int i, j;
for (i = 0; i < n; i++) {
for (j = i + 1; j <= i + k; j++) {
if (j < n)
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 20 | 21 | 20 | 22 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
#define EPS (1e-7)
const long long INF = 1LL << 60;
#define PI (acos(-1))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1}; // 移動方向
ll n, k;
ll h[100010];
ll dp[100010];
void input() {
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
input();
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 <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
#define EPS (1e-7)
const long long INF = 1LL << 60;
#define PI (acos(-1))
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1}; // 移動方向
ll n, k;
ll h[100010];
ll dp[100010];
void input() {
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> h[i];
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
input();
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 && i + j < 100010; ++j) {
chmin(dp[i + j], dp[i] + abs(h[i] - h[i + j]));
}
}
cout << dp[n - 1] << endl;
}
|
replace
| 42 | 43 | 42 | 43 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const int INF = 1e9 + 5;
int main() {
fastio();
int n;
cin >> n;
int k;
cin >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
for (int i = 1; i < k; ++i) {
dp[i] = abs(h[i] - h[0]);
}
for (int i = 0; i < n; i++) {
// dp[i]=min( dp[i-1]+abs(h[i]-h[i-1]) , dp[i-2]+abs(h[i]-h[i-2]) )
for (int j = i + 1; j <= i + k; ++j) {
dp[j] = min((dp[i] + abs(h[i] - h[j])), dp[j]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
const int INF = 1e9 + 5;
int main() {
fastio();
int n;
cin >> n;
int k;
cin >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> dp(n, INF);
dp[0] = 0;
// for (int i = 1; i < k; ++i)
// {
// dp[i]=abs(h[i]-h[0]);
// }
for (int i = 0; i < n; i++) {
// dp[i]=min( dp[i-1]+abs(h[i]-h[i-1]) , dp[i-2]+abs(h[i]-h[i-2]) )
for (int j = i + 1; j <= i + k; ++j) {
dp[j] = min((dp[i] + abs(h[i] - h[j])), dp[j]);
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 22 | 25 | 22 | 26 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <iostream>
#define INF 1000001
using namespace std;
int main() {
int n = 0, k = 0, buf1 = 0;
cin >> n >> k;
int *dp = new int[n + 1];
dp[0] = 0;
dp[1] = 0;
int *h = new int[k + 1];
h[0] = INF;
for (int i = 1; i < n + 1; ++i) {
cin >> buf1;
h[i] = buf1;
}
for (int i = 2; i < n + 1; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j < k + 1; ++j) {
dp[i] = min(dp[i], dp[max(i - j, 0)] + abs(h[i] - h[max(i - j, 0)]));
}
}
cout << dp[n];
delete[] dp;
delete[] h;
return 0;
}
|
#include <iostream>
#define INF 1000001
using namespace std;
int main() {
int n = 0, k = 0, buf1 = 0;
cin >> n >> k;
int *dp = new int[n + 1];
dp[0] = 0;
dp[1] = 0;
int *h = new int[n + 1];
h[0] = INF;
for (int i = 1; i < n + 1; ++i) {
cin >> buf1;
h[i] = buf1;
}
for (int i = 2; i < n + 1; ++i) {
dp[i] = dp[i - 1] + abs(h[i] - h[i - 1]);
for (int j = 2; j < k + 1; ++j) {
dp[i] = min(dp[i], dp[max(i - j, 0)] + abs(h[i] - h[max(i - j, 0)]));
}
}
cout << dp[n];
delete[] dp;
delete[] h;
return 0;
}
|
replace
| 10 | 11 | 10 | 11 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int ABS(int a) { return max(a, -a); }
ll ABS(ll a) { return max(a, -a); }
double ABS(double a) { return max(a, -a); }
const int N = 100005;
int arr[N];
int dp[N];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = 1; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], dp[i] + ABS(arr[i] - arr[i + j]));
}
}
cout << dp[n];
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int ABS(int a) { return max(a, -a); }
ll ABS(ll a) { return max(a, -a); }
double ABS(double a) { return max(a, -a); }
const int N = 100005;
int arr[N];
int dp[N];
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> arr[i];
for (int i = 1; i <= n; i++)
dp[i] = INT_MAX;
dp[1] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
if (i + j <= n)
dp[i + j] = min(dp[i + j], dp[i] + ABS(arr[i] - arr[i + j]));
}
}
cout << dp[n];
}
|
replace
| 14 | 18 | 14 | 18 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <math.h>
#include <queue>
#include <memory>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <list>
#include <iomanip>
using namespace std;
typedef long long ll;
int m[200005];
void go() {
m[0] = 1;
m[1] = 1;
for (int i = 2; i < 40000; i++) {
for (int j = i * i; j < 10000; j += i) {
m[j] = 1;
}
}
}
ll dp[(ll)1e5 + 110];
ll n;
ll q[1000005];
ll k;
ll solve(ll index) {
if (index + 1 == n)
return 0;
if (index > n)
return 1e8;
ll &re = dp[index];
if (re != -1)
return re;
ll d = (ll)1e9;
for (int i = 1; i <= k; i++) {
re = min(abs(q[index] - q[index + i]) + solve(index + i),
re == -1 ? (int)1e9 : re);
}
return re;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.in", "r", stdin);
freopen("out.out", "w", stdout);
#endif
cerr << "FUCK YOU" << endl;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof dp);
memset(q, 0, sizeof q);
int x;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> q[i];
}
cout << solve(0) << endl;
;
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <math.h>
#include <queue>
#include <memory>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <list>
#include <iomanip>
using namespace std;
typedef long long ll;
int m[200005];
void go() {
m[0] = 1;
m[1] = 1;
for (int i = 2; i < 40000; i++) {
for (int j = i * i; j < 10000; j += i) {
m[j] = 1;
}
}
}
ll dp[(ll)1e5 + 110];
ll n;
ll q[1000005];
ll k;
ll solve(ll index) {
if (index + 1 == n)
return 0;
if (index > n)
return 1e8;
ll &re = dp[index];
if (re != -1)
return re;
ll d = (ll)1e9;
for (int i = 1; i <= k; i++) {
re = min(abs(q[index] - q[index + i]) + solve(index + i),
re == -1 ? (int)1e9 : re);
}
return re;
}
int main() {
cerr << "FUCK YOU" << endl;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
memset(dp, -1, sizeof dp);
memset(q, 0, sizeof q);
int x;
cin >> n;
cin >> k;
for (int i = 0; i < n; i++) {
cin >> q[i];
}
cout << solve(0) << endl;
;
return 0;
}
|
delete
| 59 | 63 | 59 | 59 |
0
|
FUCK YOU
|
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace std;
const int MX = 1e5 + 5;
int n, k;
vector<int> v;
int dp[MX];
int solve(int pos) {
if (pos > n)
return 1e17;
if (pos == n)
return 0;
if (dp[pos] != -1)
return dp[pos];
int ans = 1e17, curr_height = v[pos], next_height;
for (int i = 1; i <= k; i++) {
if (pos + i <= n) {
next_height = v[pos + i];
ans = min(ans, solve(pos + i) + abs(curr_height - next_height));
}
}
return dp[pos] = ans;
}
int32_t main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
v.resize(n);
for (int i = 1; i <= n; i++)
cin >> v[i];
cout << solve(1);
return 0;
}
|
#include <bits/stdc++.h>
#define IO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define int long long
using namespace std;
const int MX = 1e5 + 5;
int n, k;
vector<int> v;
int dp[MX];
int solve(int pos) {
if (pos > n)
return 1e17;
if (pos == n)
return 0;
if (dp[pos] != -1)
return dp[pos];
int ans = 1e17, curr_height = v[pos], next_height;
for (int i = 1; i <= k; i++) {
if (pos + i <= n) {
next_height = v[pos + i];
ans = min(ans, solve(pos + i) + abs(curr_height - next_height));
}
}
return dp[pos] = ans;
}
int32_t main() {
memset(dp, -1, sizeof dp);
cin >> n >> k;
v.resize(n + 1);
for (int i = 1; i <= n; i++)
cin >> v[i];
cout << solve(1);
return 0;
}
|
replace
| 32 | 33 | 32 | 33 |
-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++
|
Time Limit Exceeded
|
/* ,---,
/ _=_ \.~
(,(OvO),) ##}
,-\(-"-) /{ #)\
{ '---' ( }\_
{{ ).___|__( '}} \_
{ ) ( }} \
{ / \ }} /
{ ) ( } / /
((_'_ _'_))_,\__\
*/
// ____ _ _ _ _ _ _
//| _ \ ___| |_ __ _ _ __ __| | ___ __| | / \ _ __ ___ | | ____ _
//___ ___ __| | ___
//| |_) / _ \ __/ _` | '__/ _` |/ _ \/ _` | / _ \ | '_ \ / _ \ | |/ / _` |
/// __/ _ \ / _` |/ _ \ | _ < __/ || (_| | | | (_| | __/ (_| | / ___ \| |_)
//| __/ | < (_| | | (_| (_) | (_| | __/
//|_| \_\___|\__\__,_|_| \__,_|\___|\__,_| /_/ \_\ .__/ \___| |_|\_\__,_|
//\___\___/ \__,_|\___|
// | |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<unsigned long long int> vul;
#define INF 1000000000
typedef std::numeric_limits<double> dbl;
double d = 3.14159265358979;
ull f = 1000000007;
int c[100000];
ll haha(int a[], int n, int k) {
if (n <= k) {
int b[n];
for (int i = 0; i < n; i++) {
if (c[i] == -1) {
c[i] = haha(a, i, k);
b[i] = abs(a[n] - a[i]) + c[i];
} else {
b[i] = abs(a[n] - a[i]) + c[i];
}
}
sort(b, b + n);
return b[0];
}
int b[k];
for (int i = 1; i <= k; i++) {
b[i - 1] = abs(a[n] - a[n - i]) + haha(a, n - i, k);
}
sort(b, b + k);
return b[0];
}
int main() {
for (int i = 0; i < 100000; i++) {
c[i] = -1;
}
c[0] = 0;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << haha(a, n - 1, k);
}
|
/* ,---,
/ _=_ \.~
(,(OvO),) ##}
,-\(-"-) /{ #)\
{ '---' ( }\_
{{ ).___|__( '}} \_
{ ) ( }} \
{ / \ }} /
{ ) ( } / /
((_'_ _'_))_,\__\
*/
// ____ _ _ _ _ _ _
//| _ \ ___| |_ __ _ _ __ __| | ___ __| | / \ _ __ ___ | | ____ _
//___ ___ __| | ___
//| |_) / _ \ __/ _` | '__/ _` |/ _ \/ _` | / _ \ | '_ \ / _ \ | |/ / _` |
/// __/ _ \ / _` |/ _ \ | _ < __/ || (_| | | | (_| | __/ (_| | / ___ \| |_)
//| __/ | < (_| | | (_| (_) | (_| | __/
//|_| \_\___|\__\__,_|_| \__,_|\___|\__,_| /_/ \_\ .__/ \___| |_|\_\__,_|
//\___\___/ \__,_|\___|
// | |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<unsigned long long int> vul;
#define INF 1000000000
typedef std::numeric_limits<double> dbl;
double d = 3.14159265358979;
ull f = 1000000007;
int c[100000];
ll haha(int a[], int n, int k) {
if (n <= k) {
int b[n];
for (int i = 0; i < n; i++) {
if (c[i] == -1) {
c[i] = haha(a, i, k);
b[i] = abs(a[n] - a[i]) + c[i];
} else {
b[i] = abs(a[n] - a[i]) + c[i];
}
}
sort(b, b + n);
return b[0];
}
int b[k];
for (int i = 1; i <= k; i++) {
if (c[n - i] == -1) {
c[n - i] = haha(a, n - i, k);
b[i - 1] = abs(a[n] - a[n - i]) + c[n - i];
} else {
b[i - 1] = abs(a[n] - a[n - i]) + c[n - i];
}
}
sort(b, b + k);
return b[0];
}
int main() {
for (int i = 0; i < 100000; i++) {
c[i] = -1;
}
c[0] = 0;
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << haha(a, n - 1, k);
}
|
replace
| 53 | 54 | 53 | 59 |
TLE
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
REP(i, n) cin >> h[i];
ll dp[2 * n];
REP(i, 2 * n) dp[i] = inf;
dp[0] = 0;
RREP(i, 0, n + 1) {
RREP(j, 1, k + 1) { mins(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
// REP(i, n) cout << dp[i] << endl;
cout << dp[n - 1] << endl;
// cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define maxs(x, y) x = max(x, y)
#define mins(x, y) x = min(x, y)
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
REP(i, n) cin >> h[i];
ll dp[n + k + 3];
REP(i, n + k + 3) dp[i] = INF;
dp[0] = 0;
RREP(i, 0, n + 1) {
RREP(j, 1, k + 1) { mins(dp[i + j], dp[i] + abs(h[i] - h[i + j])); }
}
// REP(i, n) cout << dp[i] << endl;
cout << dp[n - 1] << endl;
// cout << ans << endl;
return 0;
}
|
replace
| 22 | 24 | 22 | 24 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
template <typename T> bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
std::vector<int> dp;
int n, k;
std::vector<int> vec(n + 1, 0);
int INF = 1000000002;
int main() {
std::cin >> n >> k;
dp.assign(100100, INF);
for (int i = 0; i < n; i++) {
std::cin >> vec[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int p = 1; p <= k; p++) {
chmin(dp[i + p], dp[i] + std::abs(vec[i] - vec[i + p]));
}
}
std::cout << dp[n - 1] << std::endl;
}
|
#include <bits/stdc++.h>
template <typename T> bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
std::vector<int> dp;
int n, k;
std::vector<int> vec(100000 + 101, 0);
int INF = 1000000002;
int main() {
std::cin >> n >> k;
dp.assign(100100, INF);
for (int i = 0; i < n; i++) {
std::cin >> vec[i];
}
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int p = 1; p <= k; p++) {
chmin(dp[i + p], dp[i] + std::abs(vec[i] - vec[i + p]));
}
}
std::cout << dp[n - 1] << std::endl;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <bitset>
#include <map>
#include <set>
#define rep(i, a, b) for (i = a; i < b; i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define lli long long int
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define db double
#define M 1000000007
#define pi 3.1415926535897932384626433832795028841971
#define MAX 100005
using namespace std;
lli min(lli a, lli b) { return a < b ? a : b; }
lli min(lli a, lli b, lli c) {
a = min(a, b);
a = min(a, c);
return a;
}
lli max(lli a, lli b) { return a > b ? a : b; }
lli max(lli a, lli b, lli c) {
a = max(a, b);
a = max(a, c);
return a;
}
lli dsum(lli n) {
lli ans = 0;
while (n) {
ans += (n % 10);
n /= 10;
}
return ans;
}
struct pll {
lli x, y;
};
bool comp(pll a, pll b) {
if (a.x == b.x)
return a.y < b.y;
else
return a.x < b.x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
char ch;
db aa, bb, cc;
string s1, s2, s3;
lli i, j, k, a, b, c, n, m, sum = 0, ans = 0, temp;
cin >> n >> k;
lli h[n];
rep(i, 0, n) cin >> h[i];
vector<lli> dp(n, M);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
m = M;
for (j = 1; j <= k; j++) {
m = min(m, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = m;
}
cout << dp[n - 1] << endl;
return 0;
}
/* UJJWAL KESHRI */
|
#include <bits/stdc++.h>
#include <bitset>
#include <map>
#include <set>
#define rep(i, a, b) for (i = a; i < b; i++)
#define itrep(at) for (auto it = at.begin(); it != at.end(); it++)
#define lli long long int
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define db double
#define M 1000000007
#define pi 3.1415926535897932384626433832795028841971
#define MAX 100005
using namespace std;
lli min(lli a, lli b) { return a < b ? a : b; }
lli min(lli a, lli b, lli c) {
a = min(a, b);
a = min(a, c);
return a;
}
lli max(lli a, lli b) { return a > b ? a : b; }
lli max(lli a, lli b, lli c) {
a = max(a, b);
a = max(a, c);
return a;
}
lli dsum(lli n) {
lli ans = 0;
while (n) {
ans += (n % 10);
n /= 10;
}
return ans;
}
struct pll {
lli x, y;
};
bool comp(pll a, pll b) {
if (a.x == b.x)
return a.y < b.y;
else
return a.x < b.x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
char ch;
db aa, bb, cc;
string s1, s2, s3;
lli i, j, k, a, b, c, n, m, sum = 0, ans = 0, temp;
cin >> n >> k;
lli h[n];
rep(i, 0, n) cin >> h[i];
vector<lli> dp(n, M);
dp[0] = 0;
dp[1] = abs(h[0] - h[1]);
for (i = 2; i < n; i++) {
m = M;
for (j = 1; j <= k && j <= i; j++) {
m = min(m, dp[i - j] + abs(h[i] - h[i - j]));
}
dp[i] = m;
}
cout << dp[n - 1] << endl;
return 0;
}
/* UJJWAL KESHRI */
|
replace
| 63 | 64 | 63 | 64 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define speedhack \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define fromfile \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define mod int(1e9 + 7)
#define MAXN int(1e9)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, x, l;
int main() {
fromfile;
speedhack;
cin >> n >> x;
vector<int> dp(n + 1, MAXN);
vector<int> h;
h.pb(0); // shifting index
for (int j = 0; j < n; j++) {
cin >> l;
h.pb(l);
}
dp[1] = 0;
for (int k = 2; k <= n; k++) {
for (int j = 1; j <= x; j++) {
if (k - j > 0) {
dp[k] = min(dp[k], dp[k - j] + abs(h[k] - h[k - j]));
}
}
}
cout << dp[n];
}
|
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define speedhack \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr);
#define fromfile \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define mod int(1e9 + 7)
#define MAXN int(1e9)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, x, l;
int main() {
// fromfile;
speedhack;
cin >> n >> x;
vector<int> dp(n + 1, MAXN);
vector<int> h;
h.pb(0); // shifting index
for (int j = 0; j < n; j++) {
cin >> l;
h.pb(l);
}
dp[1] = 0;
for (int k = 2; k <= n; k++) {
for (int j = 1; j <= x; j++) {
if (k - j > 0) {
dp[k] = min(dp[k], dp[k - j] + abs(h[k] - h[k - j]));
}
}
}
cout << dp[n];
}
|
replace
| 25 | 26 | 25 | 26 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define FORC(cont, it) \
for (decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int h[n];
FOR(i, 0, n) { cin >> h[i]; }
long long dp[n + 5];
dp[0] = 0;
for (int i = 1; i <= k; i++) {
dp[i] = abs(h[i] - h[0]);
}
FOR(i, k + 1, n) {
int min = INT_MAX;
for (int j = 1; j <= k && j <= i; j++) {
min = (dp[i - j] + abs(h[i] - h[i - j])) < min
? (dp[i - j] + abs(h[i] - h[i - j]))
: min;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define FORC(cont, it) \
for (decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int h[n];
FOR(i, 0, n) { cin >> h[i]; }
long long dp[n + 5];
dp[0] = 0;
for (int i = 1; i <= k && i < n; i++) {
dp[i] = abs(h[i] - h[0]);
}
FOR(i, k + 1, n) {
int min = INT_MAX;
for (int j = 1; j <= k && j <= i; j++) {
min = (dp[i - j] + abs(h[i] - h[i - j])) < min
? (dp[i - j] + abs(h[i] - h[i - j]))
: min;
}
dp[i] = min;
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 40 | 41 | 40 | 41 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define ll long long int
#define mod 1000000007
const int N = 1e5 + 5;
int n, k;
int cache[N];
int val[N];
int dp(int pos) {
if (pos == 0)
return cache[pos];
for (int i = pos - 1; i >= max(0, pos - k); i--) {
cache[i] = min(cache[i], cache[pos] + abs(val[pos] - val[i]));
}
return dp(pos - 1);
}
int32_t main() {
fastIO;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int i;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> val[i];
for (i = 0; i < n; i++)
cache[i] = INT_MAX;
cache[n - 1] = 0;
cout << dp(n - 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define pb push_back
#define ll long long int
#define mod 1000000007
const int N = 1e5 + 5;
int n, k;
int cache[N];
int val[N];
int dp(int pos) {
if (pos == 0)
return cache[pos];
for (int i = pos - 1; i >= max(0, pos - k); i--) {
cache[i] = min(cache[i], cache[pos] + abs(val[pos] - val[i]));
}
return dp(pos - 1);
}
int32_t main() {
fastIO;
int i;
cin >> n >> k;
for (i = 0; i < n; i++)
cin >> val[i];
for (i = 0; i < n; i++)
cache[i] = INT_MAX;
cache[n - 1] = 0;
cout << dp(n - 1);
return 0;
}
|
delete
| 26 | 30 | 26 | 26 |
-11
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int32_t main() {
fastio
int n,
k;
cin >> n >> k;
int dp[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[n - 1] = 0;
if (n - 2 >= 0)
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--)
for (int j = i + 1; j < min(n, i + k + 1); j++)
dp[i] = min(abs(a[i] - a[i + j]) + dp[i + j], dp[i]);
cout << dp[0];
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define ff first
#define ss second
#define inf 9e18
#define pii pair<int, int>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
int32_t main() {
fastio
int n,
k;
cin >> n >> k;
int dp[n + 2], a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
dp[i] = INT_MAX;
dp[n - 1] = 0;
if (n - 2 >= 0)
dp[n - 2] = abs(a[n - 1] - a[n - 2]);
for (int i = n - 3; i >= 0; i--)
for (int j = i + 1; j < min(n, i + k + 1); j++)
dp[i] = min(abs(a[i] - a[j]) + dp[j], dp[i]);
cout << dp[0];
return 0;
}
|
replace
| 31 | 32 | 31 | 32 |
0
| |
p03161
|
C++
|
Runtime Error
|
// includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
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;
}
// macros and consts
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a) for (auto &i : a)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define accm accumulate
#define Fi first
#define Se second
#define INF 1e9
#define llINF (1LL << 60)
#define mINF -1e9
#define mllINF -(1LL << 60)
#define endl "\n"
#define CONT continue
#define BRK break
#define modulo(n, m) (((n) % (m) + (m)) % m)
// shorter types
using namespace std;
using ll = long long;
using vi = std::vector<int>;
using vc = std::vector<char>;
using vll = std::vector<long long>;
using vs = std::vector<string>;
using Mi = map<int, int>;
using Mll = map<ll, ll>;
using UMi = unordered_map<int, int>;
using UMll = unordered_map<ll, ll>;
using Pi = pair<int, int>;
using Pll = pair<ll, ll>;
using vPi = vector<Pi>;
using vPll = vector<Pll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
using pqgi = priority_queue<int, vector<int>, greater<int>>;
using pqsi = priority_queue<int, vector<int>, less<int>>;
using pqgll = priority_queue<int, vector<int>, greater<int>>;
using pssll = priority_queue<int, vector<int>, less<int>>;
template <class T> using vec = vector<T>;
#define int long long
int N;
int K;
// here begins your code
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
vector<int> h;
cin >> N;
cin >> K;
h.resize(N);
REP(i, N) { cin >> h[i]; }
vector<int> dp;
dp.resize(N + 10, llINF);
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;
// check types
// do not eb if you resize
// resize before you access by idx
return 0;
}
|
// includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
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;
}
// macros and consts
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a) for (auto &i : a)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define accm accumulate
#define Fi first
#define Se second
#define INF 1e9
#define llINF (1LL << 60)
#define mINF -1e9
#define mllINF -(1LL << 60)
#define endl "\n"
#define CONT continue
#define BRK break
#define modulo(n, m) (((n) % (m) + (m)) % m)
// shorter types
using namespace std;
using ll = long long;
using vi = std::vector<int>;
using vc = std::vector<char>;
using vll = std::vector<long long>;
using vs = std::vector<string>;
using Mi = map<int, int>;
using Mll = map<ll, ll>;
using UMi = unordered_map<int, int>;
using UMll = unordered_map<ll, ll>;
using Pi = pair<int, int>;
using Pll = pair<ll, ll>;
using vPi = vector<Pi>;
using vPll = vector<Pll>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
using pqgi = priority_queue<int, vector<int>, greater<int>>;
using pqsi = priority_queue<int, vector<int>, less<int>>;
using pqgll = priority_queue<int, vector<int>, greater<int>>;
using pssll = priority_queue<int, vector<int>, less<int>>;
template <class T> using vec = vector<T>;
#define int long long
int N;
int K;
// here begins your code
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
vector<int> h;
cin >> N;
cin >> K;
h.resize(N);
REP(i, N) { cin >> h[i]; }
vector<int> dp;
dp.resize(N + 110, llINF);
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;
// check types
// do not eb if you resize
// resize before you access by idx
return 0;
}
|
replace
| 92 | 93 | 92 | 93 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef long long ll;
const int INF = 1000000000;
const long INF64 = 1000000000000000ll;
const ll MOD = 1000000007ll;
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n), ans(n, 0);
rep(i, n) std::cin >> a[i];
ans[0] = 0;
for (int i = 1; i < n; i++) {
/* code */
int dans = INF;
for (int j = 1; j < max(k, i); j++) {
ans[i] = min(dans, ans[i - j] + abs(a[i] - a[i - j]));
}
}
std::cout << ans[n - 1] << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef long long ll;
const int INF = 1000000000;
const long INF64 = 1000000000000000ll;
const ll MOD = 1000000007ll;
int main() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n), ans(n, 0);
rep(i, n) std::cin >> a[i];
ans[0] = 0;
for (int i = 1; i < n; i++) {
/* code */
ans[i] = INF;
for (int j = 1; j <= min(k, i); j++) {
ans[i] = min(ans[i], ans[i - j] + abs(a[i] - a[i - j]));
}
}
std::cout << ans[n - 1] << std::endl;
}
|
replace
| 19 | 22 | 19 | 22 |
0
| |
p03161
|
C++
|
Runtime Error
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT32_MAX), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < k; i++) {
for (int j = 0; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
for (int i = k; i < n; i++) {
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - k + j] + abs(h[i] - h[i - k + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> dp(n, INT32_MAX), h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
dp[0] = 0;
for (int i = 1; i < k && i < n; i++) {
for (int j = 0; j < i; j++) {
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]));
}
}
for (int i = k; i < n; i++) {
for (int j = 0; j < k; j++) {
dp[i] = min(dp[i], dp[i - k + j] + abs(h[i] - h[i - k + j]));
}
}
cout << dp[n - 1] << endl;
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
// これを見る初心者の方へ:mainより上のいっぱい書いてあるやつはプログラムを簡略化するためのものです。自分も最近知りました。各種コメントをつけているので参考にしてみてください(検索すればqittaとかでも色々見つかるので探してみてください)
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) // 最大値を求める
#define MIN(x) *min_element(ALL(x)) // 最小値を求める
// 定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl // 出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} // 真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } // 配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} // 最小値更新
signed main() {
in(ll, N);
ll dp[10010][3];
ll h[10010][3];
REP(i, N) {
REP(j, 3) { cin >> h[i][j]; }
}
REP(i, N) {
REP(j, 3) {
REP(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + h[i][k]);
}
}
}
ll ans = 0;
REP(i, 3) chmax(ans, dp[N][i]);
out(ans);
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
// これを見る初心者の方へ:mainより上のいっぱい書いてあるやつはプログラムを簡略化するためのものです。自分も最近知りました。各種コメントをつけているので参考にしてみてください(検索すればqittaとかでも色々見つかるので探してみてください)
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define sort(a) sort(ALL(a)) // sortの省略
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) // 最大値を求める
#define MIN(x) *min_element(ALL(x)) // 最小値を求める
// 定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 10000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 略記
#define in(T, x) \
T x; \
cin >> x; // Tは型,xが入力値
#define vec(T, a, n, x) vector<T> a(n, x);
#define vec2(T, a, n, m) vector<vector<T>> a(n, vector<T>(m));
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
#define out(x) cout << x << endl // 出力
#define bout(b) \
if (b) { \
out("Yes"); \
} else { \
out("No"); \
} // 真偽問題に対する出力
#define ain(T, a, n) \
vector<T> a(n); \
REP(i, n) { cin >> a[i]; } // 配列の宣言と入力
#define a2in(T1, a, T2, b, n) \
vector<T1> a(n); \
vector<T2> b(n); \
REP(i, n) { cin >> a[i] >> b[i]; } // 2つの配列を同時宣言、入力
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
} // dp表とかで最大値更新するやつ
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
} // 最小値更新
signed main() {
in(ll, N);
ll dp[100010][3];
ll h[100010][3];
REP(i, N) {
REP(j, 3) { cin >> h[i][j]; }
}
REP(i, N) {
REP(j, 3) {
REP(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + h[i][k]);
}
}
}
ll ans = 0;
REP(i, 3) chmax(ans, dp[N][i]);
out(ans);
}
|
replace
| 68 | 70 | 68 | 70 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100100
int n, a[MAXN][3], dp[MAXN][3], k;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (i == 0) {
dp[i][j] = a[i][j];
} else {
dp[i][j] =
max(dp[i - 1][(j + 1) % 3], dp[i - 1][(j + 2) % 3]) + a[i][j];
}
}
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100100
int n, a[MAXN][3], dp[MAXN][3], k;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 3; ++j) {
if (i == 0) {
dp[i][j] = a[i][j];
} else {
dp[i][j] =
max(dp[i - 1][(j + 1) % 3], dp[i - 1][(j + 2) % 3]) + a[i][j];
}
}
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
/// Journey to the End of earth ///
/// Gunjan Kumar ///
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <functional> // for less
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define s(n) scanf("%d", &n)
#define ls(n) scanf("%lld", &n)
#define p(n) printf("%d", n)
// #define ln() printf("\n")
#define pln(n) printf("%d\n", n)
#define lpln(n) printf("%lld\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rev(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define gcd __gcd
#define tc \
ll t1; \
cin >> t1; \
while (t1--)
#define inp \
ll n; \
cin >> n; \
ll arr[n]; \
rep(i, 0, n) cin >> arr[i];
#define vect vector<ll>
#define sortv(v) sort(v.begin(), v.end())
#define lower(v, n) lower_bound(v.begin(), v.end(), n) - v.begin()
#define upper(v, n) upper_bound(v.begin(), v.end(), n) - v.begin()
#define bitcount(n) __builtin_popcount(n)
#define ln << endl
#define inf LONG_MAX
#define ninf LONG_MIN
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const ll mod = 1e9 + 7;
const ll N = 1e5 + 5;
int main() {
ios_base::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("new.txt", "w", stdout);
#endif
int n;
cin >> n;
ll arr[n][3];
rep(i, 0, n) rep(j, 0, 3) cin >> arr[i][j];
ll dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
rep(i, 1, n) {
dp[i][0] = max(arr[i][0] + dp[i - 1][1], arr[i][0] + dp[i - 1][2]);
dp[i][1] = max(arr[i][1] + dp[i - 1][0], arr[i][1] + dp[i - 1][2]);
dp[i][2] = max(arr[i][2] + dp[i - 1][1], arr[i][2] + dp[i - 1][0]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
return 0;
}
|
/// Journey to the End of earth ///
/// Gunjan Kumar ///
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <functional> // for less
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define s(n) scanf("%d", &n)
#define ls(n) scanf("%lld", &n)
#define p(n) printf("%d", n)
// #define ln() printf("\n")
#define pln(n) printf("%d\n", n)
#define lpln(n) printf("%lld\n", n)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rev(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define gcd __gcd
#define tc \
ll t1; \
cin >> t1; \
while (t1--)
#define inp \
ll n; \
cin >> n; \
ll arr[n]; \
rep(i, 0, n) cin >> arr[i];
#define vect vector<ll>
#define sortv(v) sort(v.begin(), v.end())
#define lower(v, n) lower_bound(v.begin(), v.end(), n) - v.begin()
#define upper(v, n) upper_bound(v.begin(), v.end(), n) - v.begin()
#define bitcount(n) __builtin_popcount(n)
#define ln << endl
#define inf LONG_MAX
#define ninf LONG_MIN
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
const ll mod = 1e9 + 7;
const ll N = 1e5 + 5;
int main() {
int n;
cin >> n;
ll arr[n][3];
rep(i, 0, n) rep(j, 0, 3) cin >> arr[i][j];
ll dp[n][3];
memset(dp, 0, sizeof(dp));
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
rep(i, 1, n) {
dp[i][0] = max(arr[i][0] + dp[i - 1][1], arr[i][0] + dp[i - 1][2]);
dp[i][1] = max(arr[i][1] + dp[i - 1][0], arr[i][1] + dp[i - 1][2]);
dp[i][2] = max(arr[i][2] + dp[i - 1][1], arr[i][2] + dp[i - 1][0]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
return 0;
}
|
delete
| 48 | 53 | 48 | 48 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long, long> pll;
typedef vector<pll> vll;
typedef set<ll> sl;
typedef map<string, int> msi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define inf 0x3f3f3f3f
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
const ll md = 1000000007;
// void mod(ll &x){if (x >= md) x -= md; if (x < 0) x += md;}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, i, j, ans;
cin >> n;
ll abc[n][4];
ll dp[n][4];
for (i = 1; i <= n; i++) {
for (j = 1; j <= 3; j++) {
cin >> abc[i][j];
}
}
dp[1][1] = abc[1][1];
dp[1][2] = abc[1][2];
dp[1][3] = abc[1][3];
for (i = 2; i <= n; i++) {
dp[i][1] = abc[i][1] + max(dp[i - 1][2], dp[i - 1][3]);
dp[i][2] = abc[i][2] + max(dp[i - 1][1], dp[i - 1][3]);
dp[i][3] = abc[i][3] + max(dp[i - 1][1], dp[i - 1][2]);
}
ans = max(dp[n][1], max(dp[n][2], dp[n][3]));
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long, long> pll;
typedef vector<pll> vll;
typedef set<ll> sl;
typedef map<string, int> msi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define inf 0x3f3f3f3f
#define gcd(a, b) __gcd((a), (b))
#define lcm(a, b) ((a) * (b)) / gcd((a), (b))
const ll md = 1000000007;
// void mod(ll &x){if (x >= md) x -= md; if (x < 0) x += md;}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, i, j, ans;
cin >> n;
ll abc[n + 1][4];
ll dp[n + 1][4];
for (i = 1; i <= n; i++) {
for (j = 1; j <= 3; j++) {
cin >> abc[i][j];
}
}
dp[1][1] = abc[1][1];
dp[1][2] = abc[1][2];
dp[1][3] = abc[1][3];
for (i = 2; i <= n; i++) {
dp[i][1] = abc[i][1] + max(dp[i - 1][2], dp[i - 1][3]);
dp[i][2] = abc[i][2] + max(dp[i - 1][1], dp[i - 1][3]);
dp[i][3] = abc[i][3] + max(dp[i - 1][1], dp[i - 1][2]);
}
ans = max(dp[n][1], max(dp[n][2], dp[n][3]));
cout << ans;
return 0;
}
|
replace
| 26 | 28 | 26 | 28 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define clr(i, j) memset(i, j, sizeof(i))
#define pb push_back
typedef long long ll;
//-*-*-*-*-*-*-*-*-
ll n;
ll dp[10000][3];
ll arr[10000][3];
int main() {
ll n, k;
cin >> n;
clr(dp, -1);
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
// cout<<arr[i][0];
}
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
for (ll j = 0; j <= 2; j++) {
for (ll h = 0; h <= 2; h++) {
if (j != h) {
if (dp[i][j] != -1) {
dp[i][j] = max(dp[i - 1][h] + arr[i][j], dp[i][j]);
} else {
dp[i][j] = dp[i - 1][h] + arr[i][j];
}
}
}
}
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
}
|
#include <bits/stdc++.h>
using namespace std;
#define clr(i, j) memset(i, j, sizeof(i))
#define pb push_back
typedef long long ll;
//-*-*-*-*-*-*-*-*-
ll n;
ll dp[100000][3];
ll arr[100000][3];
int main() {
ll n, k;
cin >> n;
clr(dp, -1);
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
// cout<<arr[i][0];
}
dp[0][0] = arr[0][0];
dp[0][1] = arr[0][1];
dp[0][2] = arr[0][2];
for (int i = 1; i < n; i++) {
for (ll j = 0; j <= 2; j++) {
for (ll h = 0; h <= 2; h++) {
if (j != h) {
if (dp[i][j] != -1) {
dp[i][j] = max(dp[i - 1][h] + arr[i][j], dp[i][j]);
} else {
dp[i][j] = dp[i - 1][h] + arr[i][j];
}
}
}
}
}
cout << max(max(dp[n - 1][0], dp[n - 1][1]), dp[n - 1][2]);
}
|
replace
| 11 | 13 | 11 | 13 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 10005;
const int oo = 1e9 + 7;
int dp[maxN][4];
int a[maxN][4];
int n;
int main() {
// freopen("Vacation.inp","r",stdin);
// freopen("Vacation.out","w",stdout);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= 3; j++) {
cin >> a[i][j];
dp[i][j] = -oo;
}
for (int j = 1; j <= 3; j++)
dp[0][j] = 0;
// Tinh bang phuong an dp[i][j]
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
if (j == 1)
dp[i][j] = max(a[i][j] + dp[i - 1][2], a[i][j] + dp[i - 1][3]);
if (j == 2)
dp[i][j] = max(a[i][j] + dp[i - 1][1], a[i][j] + dp[i - 1][3]);
if (j == 3)
dp[i][j] = max(a[i][j] + dp[i - 1][2], a[i][j] + dp[i - 1][1]);
}
}
cout << max(dp[n][1], max(dp[n][2], dp[n][3]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100005;
const int oo = 1e9 + 7;
int dp[maxN][4];
int a[maxN][4];
int n;
int main() {
// freopen("Vacation.inp","r",stdin);
// freopen("Vacation.out","w",stdout);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= 3; j++) {
cin >> a[i][j];
dp[i][j] = -oo;
}
for (int j = 1; j <= 3; j++)
dp[0][j] = 0;
// Tinh bang phuong an dp[i][j]
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
if (j == 1)
dp[i][j] = max(a[i][j] + dp[i - 1][2], a[i][j] + dp[i - 1][3]);
if (j == 2)
dp[i][j] = max(a[i][j] + dp[i - 1][1], a[i][j] + dp[i - 1][3]);
if (j == 3)
dp[i][j] = max(a[i][j] + dp[i - 1][2], a[i][j] + dp[i - 1][1]);
}
}
cout << max(dp[n][1], max(dp[n][2], dp[n][3]));
return 0;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pl pair<ll, ll>
#define vl vector<ll>
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define N 100005
ll dp[10005][5];
int main() {
ll n;
cin >> n;
ll a[n][3];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (ll i = 0; i < 3; i++)
dp[0][i] = a[0][i];
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < 3; j++) {
if (j == 0)
dp[i][j] = a[i][j] + max(dp[i - 1][j + 1], dp[i - 1][j + 2]);
else if (j == 1)
dp[i][j] = a[i][j] + max(dp[i - 1][j - 1], dp[i - 1][j + 1]);
else if (j == 2)
dp[i][j] = a[i][j] + max(dp[i - 1][j - 1], dp[i - 1][j - 2]);
}
}
ll mx = 0;
for (ll i = 0; i < 3; i++)
mx = max(mx, dp[n - 1][i]);
cout << mx << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pl pair<ll, ll>
#define vl vector<ll>
#define fastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define N 100005
ll dp[100005][5];
int main() {
ll n;
cin >> n;
ll a[n][3];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for (ll i = 0; i < 3; i++)
dp[0][i] = a[0][i];
for (ll i = 1; i < n; i++) {
for (ll j = 0; j < 3; j++) {
if (j == 0)
dp[i][j] = a[i][j] + max(dp[i - 1][j + 1], dp[i - 1][j + 2]);
else if (j == 1)
dp[i][j] = a[i][j] + max(dp[i - 1][j - 1], dp[i - 1][j + 1]);
else if (j == 2)
dp[i][j] = a[i][j] + max(dp[i - 1][j - 1], dp[i - 1][j - 2]);
}
}
ll mx = 0;
for (ll i = 0; i < 3; i++)
mx = max(mx, dp[n - 1][i]);
cout << mx << "\n";
}
|
replace
| 11 | 12 | 11 | 12 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define MAX_DOUBLE 40000000000.0
#include <math.h>
#include <unistd.h>
using namespace std;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int max(int a, int b) {
if (a < b)
return b;
return a;
}
int days[10010][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> days[i][0] >> days[i][1] >> days[i][2];
}
int maxA = days[0][0];
int maxB = days[0][1];
int maxC = days[0][2];
for (int i = 1; i < n; i++) {
int tmpA = max(maxB, maxC) + days[i][0];
int tmpB = max(maxA, maxC) + days[i][1];
int tmpC = max(maxB, maxA) + days[i][2];
maxA = tmpA;
maxB = tmpB;
maxC = tmpC;
}
cout << max(max(maxA, maxB), maxC);
}
|
#include <algorithm>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define MAX_DOUBLE 40000000000.0
#include <math.h>
#include <unistd.h>
using namespace std;
int min(int a, int b) {
if (a > b)
return b;
return a;
}
int max(int a, int b) {
if (a < b)
return b;
return a;
}
int days[100010][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> days[i][0] >> days[i][1] >> days[i][2];
}
int maxA = days[0][0];
int maxB = days[0][1];
int maxC = days[0][2];
for (int i = 1; i < n; i++) {
int tmpA = max(maxB, maxC) + days[i][0];
int tmpB = max(maxA, maxC) + days[i][1];
int tmpC = max(maxB, maxA) + days[i][2];
maxA = tmpA;
maxB = tmpB;
maxC = tmpC;
}
cout << max(max(maxA, maxB), maxC);
}
|
replace
| 29 | 30 | 29 | 30 |
0
| |
p03162
|
C++
|
Runtime Error
|
#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 VRSORT(v) sort(v.rbegin(), v.rend()); // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
ll dp[10010][3];
REP(i, 10010) REP(j, 3) dp[i][j] = 0;
for (int i = 0; i < n; i++) {
ll a, b, c;
cin >> a >> b >> c;
dp[i + 1][0] = max(dp[i][1], dp[i][2]) + a; // aを選ぶ
dp[i + 1][1] = max(dp[i][0], dp[i][2]) + b; // bを選ぶ
dp[i + 1][2] = max(dp[i][0], dp[i][1]) + c; // cを選ぶ
}
ll ans = 0;
REP(i, 3) { ans = max(ans, dp[n][i]); }
cout << ans << endl;
return 0;
}
|
#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 VRSORT(v) sort(v.rbegin(), v.rend()); // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<unsigned int> vec;
typedef vector<vec> mat;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<ll>> dp(1e5 + 10, vector<ll>(3, 0));
for (int i = 0; i < n; i++) {
ll a, b, c;
cin >> a >> b >> c;
dp[i + 1][0] = max(dp[i][1], dp[i][2]) + a; // aを選ぶ
dp[i + 1][1] = max(dp[i][0], dp[i][2]) + b; // bを選ぶ
dp[i + 1][2] = max(dp[i][0], dp[i][1]) + c; // cを選ぶ
}
ll ans = 0;
REP(i, 3) { ans = max(ans, dp[n][i]); }
cout << ans << endl;
return 0;
}
|
replace
| 29 | 31 | 29 | 31 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[3][10000], h[3][10000];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[j][i];
}
}
h[0][0] = a[0][0];
h[1][0] = a[1][0];
h[2][0] = a[2][0];
for (int i = 1; i < n; i++) {
h[0][i] = a[0][i] + max(h[2][i - 1], h[1][i - 1]);
h[1][i] = a[1][i] + max(h[2][i - 1], h[0][i - 1]);
h[2][i] = a[2][i] + max(h[1][i - 1], h[0][i - 1]);
// cout <<h[0][i]<<' '<<h[1][i]<<' '<<h[2][i]<<' '<<endl;
}
cout << max(h[0][n - 1], max(h[1][n - 1], h[2][n - 1]));
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[3][100000], h[3][100000];
// int n,a[3][3];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[j][i];
}
}
h[0][0] = a[0][0];
h[1][0] = a[1][0];
h[2][0] = a[2][0];
for (int i = 1; i < n; i++) {
h[0][i] = a[0][i] + max(h[2][i - 1], h[1][i - 1]);
h[1][i] = a[1][i] + max(h[2][i - 1], h[0][i - 1]);
h[2][i] = a[2][i] + max(h[1][i - 1], h[0][i - 1]);
// cout <<h[0][i]<<' '<<h[1][i]<<' '<<h[2][i]<<' '<<endl;
}
cout << max(h[0][n - 1], max(h[1][n - 1], h[2][n - 1]));
return 0;
}
|
replace
| 5 | 6 | 5 | 7 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
#define int long long
#define endl '\n'
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define vii vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define all(v) v.begin(), v.end()
#define loop(i, s, e) for (int i = s; i < e; i++)
#define rloop(i, e, s) for (int i = e; i >= s; i--)
#define mset(a, f) memset(a, f, sizeof(a))
#define M 1000000007
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define prvec(v) \
loop(i_u_j, 0, v.size()) cout << v[i_u_j] << " "; \
cout << endl;
#define prarr(arr, n) \
loop(i_u_j, 0, n) cout << arr[i_u_j] << " "; \
cout << endl;
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
const int N = 3e5 + 7;
int n;
int arr[N][3];
int dp[N][4];
int getans(int id, int p) {
if (dp[id][p] != -1)
return dp[id][p];
if (id == n)
return 0;
int ans = 0;
if (p == 0) {
int a1 = arr[id][1] + getans(id + 1, 1);
int a2 = arr[id][2] + getans(id + 1, 2);
ans = max(a1, a2);
} else if (p == 1) {
int a1 = arr[id][0] + getans(id + 1, 0);
int a2 = arr[id][2] + getans(id + 1, 2);
ans = max(a1, a2);
} else if (p == 2) {
int a1 = arr[id][1] + getans(id + 1, 1);
int a2 = arr[id][0] + getans(id + 1, 0);
ans = max(a1, a2);
} else {
int a1 = arr[id][1] + getans(id + 1, 1);
int a2 = arr[id][0] + getans(id + 1, 0);
int a3 = arr[id][2] + getans(id + 1, 2);
ans = max(a1, max(a3, a2));
}
return dp[id][p] = ans;
}
void solve() {
cin >> n;
loop(i, 0, n) { cin >> arr[i][0] >> arr[i][1] >> arr[i][2]; }
mset(dp, -1);
cout << getans(0, 3);
}
int32_t main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
while (t--)
solve();
}
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
|
#include <bits/stdc++.h>
using namespace std;
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
#define int long long
#define endl '\n'
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define vii vector<int>
#define pii pair<int, int>
#define vpii vector<pii>
#define all(v) v.begin(), v.end()
#define loop(i, s, e) for (int i = s; i < e; i++)
#define rloop(i, e, s) for (int i = e; i >= s; i--)
#define mset(a, f) memset(a, f, sizeof(a))
#define M 1000000007
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define prvec(v) \
loop(i_u_j, 0, v.size()) cout << v[i_u_j] << " "; \
cout << endl;
#define prarr(arr, n) \
loop(i_u_j, 0, n) cout << arr[i_u_j] << " "; \
cout << endl;
#define bug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
const int N = 3e5 + 7;
int n;
int arr[N][3];
int dp[N][4];
int getans(int id, int p) {
if (dp[id][p] != -1)
return dp[id][p];
if (id == n)
return 0;
int ans = 0;
if (p == 0) {
int a1 = arr[id][1] + getans(id + 1, 1);
int a2 = arr[id][2] + getans(id + 1, 2);
ans = max(a1, a2);
} else if (p == 1) {
int a1 = arr[id][0] + getans(id + 1, 0);
int a2 = arr[id][2] + getans(id + 1, 2);
ans = max(a1, a2);
} else if (p == 2) {
int a1 = arr[id][1] + getans(id + 1, 1);
int a2 = arr[id][0] + getans(id + 1, 0);
ans = max(a1, a2);
} else {
int a1 = arr[id][1] + getans(id + 1, 1);
int a2 = arr[id][0] + getans(id + 1, 0);
int a3 = arr[id][2] + getans(id + 1, 2);
ans = max(a1, max(a3, a2));
}
return dp[id][p] = ans;
}
void solve() {
cin >> n;
loop(i, 0, n) { cin >> arr[i][0] >> arr[i][1] >> arr[i][2]; }
mset(dp, -1);
cout << getans(0, 3);
}
int32_t main() {
fastio;
int t = 1;
// cin>>t;
while (t--)
solve();
}
// M A F I A - M A F I A - M A F I A - M A F I A - M A F I A - M A F I A //
|
delete
| 85 | 89 | 85 | 85 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<long long>> dp(n, vector<long long>(3, -1));
vector<vector<int>> h(n, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> h[i][j];
for (int i = 1; i < n; i++) {
h[i][0] = h[i][0] + max(h[i - 11][1], h[i - 1][2]);
h[i][1] = h[i][1] + max(h[i - 1][0], h[i - 1][2]);
h[i][2] = h[i][2] + max(h[i - 1][1], h[i - 1][0]);
}
int m = max({h[n - 1][0], h[n - 1][1], h[n - 1][2]});
cout << m;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<long long>> dp(n, vector<long long>(3, -1));
vector<vector<int>> h(n, vector<int>(3));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> h[i][j];
for (int i = 1; i < n; i++) {
h[i][0] = h[i][0] + max(h[i - 1][1], h[i - 1][2]);
h[i][1] = h[i][1] + max(h[i - 1][0], h[i - 1][2]);
h[i][2] = h[i][2] + max(h[i - 1][1], h[i - 1][0]);
}
int m = max({h[n - 1][0], h[n - 1][1], h[n - 1][2]});
cout << m;
}
|
replace
| 11 | 12 | 11 | 12 |
-11
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pie 3.142857143
#define ll long long int
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fv(i, a) for (auto i : a)
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define frv(i, c) for (auto i = c.begin(); i != c.end(); i++)
const int N = 1e5 + 5;
int dp[N][3];
int a[N][3];
ll yogi(int n, int k) {
ll x, y;
if (k == 0) {
x = 1;
y = 2;
}
if (k == 1) {
x = 0;
y = 2;
}
if (k == 2) {
x = 0;
y = 1;
}
if (n == 0)
return max(a[0][x], a[0][y]);
ll s = +max(a[n][x] + yogi(n - 1, x), a[n][y] + yogi(n - 1, y));
return s;
}
void solve() {
ll n;
cin >> n;
fr(i, 0, n) cin >> a[i][0] >> a[i][1] >> a[i][2];
ll x = a[n][0] + yogi(n - 1, 0);
ll y = a[n][1] + yogi(n - 1, 1);
ll z = a[n][2] + yogi(n - 1, 2);
x = max(x, max(y, z));
cout << x << endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pie 3.142857143
#define ll long long int
#define fr(i, a, n) for (ll i = a; i < n; i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fv(i, a) for (auto i : a)
#define sz(a) int((a).size())
#define all(c) (c).begin(), (c).end()
#define frv(i, c) for (auto i = c.begin(); i != c.end(); i++)
const int N = 1e5 + 5;
int dp[N][3];
int a[N][3];
ll yogi(int n, int k) {
ll x, y;
if (k == 0) {
x = 1;
y = 2;
}
if (k == 1) {
x = 0;
y = 2;
}
if (k == 2) {
x = 0;
y = 1;
}
if (n == 0)
return max(a[0][x], a[0][y]);
if (dp[n - 1][0] == 0)
dp[n - 1][0] = yogi(n - 1, 0);
if (dp[n - 1][1] == 0)
dp[n - 1][1] = yogi(n - 1, 1);
if (dp[n - 1][2] == 0)
dp[n - 1][2] = yogi(n - 1, 2);
ll s = max(a[n][x] + dp[n - 1][x], a[n][y] + dp[n - 1][y]);
return s;
}
void solve() {
ll n;
cin >> n;
fr(i, 0, n) cin >> a[i][0] >> a[i][1] >> a[i][2];
ll x = a[n][0] + yogi(n - 1, 0);
ll y = a[n][1] + yogi(n - 1, 1);
ll z = a[n][2] + yogi(n - 1, 2);
x = max(x, max(y, z));
cout << x << endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
// cin>>t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
replace
| 34 | 35 | 34 | 41 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
/*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
LL a[10005];
LL b[10005];
LL c[10005];
LL dp[10005][3];
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
// dp[i][aktywnosc];
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 1; i <= n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][1], dp[i - 1][0]);
}
cout << max(dp[n][0], max(dp[n][1], dp[n][2])) << endl;
return 0;
}
|
/*
Templatka c++ Kacper Fis
//
*/
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
typedef long long LL;
typedef vector<int> vi;
typedef list<int> li;
typedef queue<int> qi;
typedef pair<int, int> ii;
typedef map<string, int> msi; // np msi['nazwa'] = 'liczba'
typedef vector<ii> vii; // vector par<int>, do tworzenia tablicy dla grafów
// wagowych #dijkstra #Bellman_Ford
typedef priority_queue<ii, vector<ii>, greater<ii>>
pq; // kolejka priorytetowa vectorów par(top()=min) #dijkstra
vector<ii>::iterator iter;
#define print_list(x) \
for (it = (x).begin(); it != (x).end(); it++) { \
cout << *it << " "; \
}
#define print_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) { \
cout << *it2 << " "; \
}
#define search_list(x) for (it = (x).begin(); it != (x).end(); it++)
#define search_vector(x) \
for (it2 = (x).begin(); it2 != (x).end(); it2++) \
;
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define mp(x, y) make_pair(x, y)
///////////////////////////////////////////////GLOBAL
///DEFINITIONS////////////////////////////////////////////////////////
LL a[100005];
LL b[100005];
LL c[100005];
LL dp[100005][3];
///////////////////////////////////////////////////FUNCTIONS/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////MAIN////////////////////////////////////////////////////////////////
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
// dp[i][aktywnosc];
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 1; i <= n; i++) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][1], dp[i - 1][0]);
}
cout << max(dp[n][0], max(dp[n][1], dp[n][2])) << endl;
return 0;
}
|
replace
| 43 | 47 | 43 | 47 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v1, v2, v3;
int arr[3][n];
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
v1 = arr[0][0];
v2 = arr[0][1];
v3 = arr[0][2];
for (int i = 1; i < n; i++) {
int temp1 = v1;
int temp2 = v2;
int temp3 = v3;
v1 = arr[i][0] + max(temp2, temp3);
v2 = arr[i][1] + max(temp1, temp3);
v3 = arr[i][2] + max(temp1, temp2);
}
cout << max(max(v1, v2), v3) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v1, v2, v3;
int arr[n][3];
for (int i = 0; i < n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
v1 = arr[0][0];
v2 = arr[0][1];
v3 = arr[0][2];
for (int i = 1; i < n; i++) {
int temp1 = v1;
int temp2 = v2;
int temp3 = v3;
v1 = arr[i][0] + max(temp2, temp3);
v2 = arr[i][1] + max(temp1, temp3);
v3 = arr[i][2] + max(temp1, temp2);
}
cout << max(max(v1, v2), v3) << endl;
return 0;
}
|
replace
| 12 | 13 | 12 | 13 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
vector<vector<int>> inp(n, vector<int>(3));
for (int t = 0; t < n; t++) {
cin >> a >> b >> c;
inp[t][0] = a;
inp[t][1] = b;
inp[t][2] = c;
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = inp[0][0];
dp[0][1] = inp[0][1];
dp[0][2] = inp[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + inp[i][0];
dp[i][1] = max(dp[i - 1][0], dp[i - 1][2]) + inp[i][1];
dp[i][2] = max(dp[i - 1][1], dp[i - 1][0]) + inp[i][2];
}
cout << max({dp[n][0], dp[n][1], dp[n][2]}) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
vector<vector<int>> inp(n, vector<int>(3));
for (int t = 0; t < n; t++) {
cin >> a >> b >> c;
inp[t][0] = a;
inp[t][1] = b;
inp[t][2] = c;
}
vector<vector<int>> dp(n, vector<int>(3));
dp[0][0] = inp[0][0];
dp[0][1] = inp[0][1];
dp[0][2] = inp[0][2];
for (int i = 1; i < n; i++) {
dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]) + inp[i][0];
dp[i][1] = max(dp[i - 1][0], dp[i - 1][2]) + inp[i][1];
dp[i][2] = max(dp[i - 1][1], dp[i - 1][0]) + inp[i][2];
}
cout << max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]}) << '\n';
}
|
replace
| 23 | 24 | 23 | 24 |
-11
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(int argc, const char *argv[]) {
// input
ll n;
cin >> n;
ll HP[10010][3];
ll DP[10010][3];
memset(DP, 0, sizeof(DP));
memset(HP, 0, sizeof(HP));
rep(i, n) cin >> HP[i][0] >> HP[i][1] >> HP[i][2];
// DP
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
chmax(DP[i][j], DP[i - 1][k] + HP[i - 1][k]);
}
}
}
cout << max({DP[n][0], DP[n][1], DP[n][2]}) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(int argc, const char *argv[]) {
// input
ll n;
cin >> n;
ll HP[100100][3];
ll DP[100100][3];
memset(DP, 0, sizeof(DP));
memset(HP, 0, sizeof(HP));
rep(i, n) cin >> HP[i][0] >> HP[i][1] >> HP[i][2];
// DP
for (int i = 1; i <= n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
chmax(DP[i][j], DP[i - 1][k] + HP[i - 1][k]);
}
}
}
cout << max({DP[n][0], DP[n][1], DP[n][2]}) << endl;
}
|
replace
| 49 | 51 | 49 | 51 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <cmath>
#include <iostream>
int main() {
int cost[10000][3], N;
int result[10000][3];
std::cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
std::cin >> cost[i][j];
}
}
for (int i = 0; i < 3; i++)
result[0][i] = cost[0][i];
for (int i = 1; i < N; i++) {
for (int j = 0; j < 3; j++) {
result[i][0] = std::max(result[i - 1][1], result[i - 1][2]) + cost[i][0];
result[i][1] = std::max(result[i - 1][0], result[i - 1][2]) + cost[i][1];
result[i][2] = std::max(result[i - 1][0], result[i - 1][1]) + cost[i][2];
}
}
std::cout << std::max(std::max(result[N - 1][0], result[N - 1][1]),
result[N - 1][2]);
return 0;
}
|
#include <cmath>
#include <iostream>
int main() {
int cost[100000][3], N;
long long result[100000][3];
std::cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
std::cin >> cost[i][j];
}
}
for (int i = 0; i < 3; i++)
result[0][i] = cost[0][i];
for (int i = 1; i < N; i++) {
for (int j = 0; j < 3; j++) {
result[i][0] = std::max(result[i - 1][1], result[i - 1][2]) + cost[i][0];
result[i][1] = std::max(result[i - 1][0], result[i - 1][2]) + cost[i][1];
result[i][2] = std::max(result[i - 1][0], result[i - 1][1]) + cost[i][2];
}
}
std::cout << std::max(std::max(result[N - 1][0], result[N - 1][1]),
result[N - 1][2]);
return 0;
}
|
replace
| 4 | 6 | 4 | 6 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> happ(n, vector<int>(k));
int INF = 1 << 30;
for (int i = 0; i < n; ++i)
for (int j = 0; j < k; ++j)
cin >> happ[i][j];
// dp[i][j] es la mayor felicidad del dia i con la actividad anterior j
vector<vector<int>> dp(n, vector<int>(k, 0));
for (int i = 0; i < k; ++i) {
int maxi = 0;
for (int j = 0; j < k; j++) {
if (i != j)
maxi = max(maxi, happ[0][j]);
}
dp[0][i] = maxi;
}
for (int day = 1; day < n; ++day) {
for (int i = 0; i < k; ++i) {
for (int j = 0; j < k; ++j) {
if (i != j) {
dp[day][j] = max(dp[day][j], dp[day - 1][i] + happ[day][j]);
// cout << "day " << day << " i " << i << " j " << j << " dp " <<
// dp[day][j] << endl;
}
}
}
}
int maxi = -INF;
for (int i = 0; i < 3; ++i) {
maxi = max(maxi, dp[n - 1][i]);
}
cout << maxi << endl;
/*for(int i=0;i<n;++i){
for(int j=0;j<k;j++){
cout << dp[i][j] << " ";
}
cout << endl;
}*/
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n; // >> k;
k = 3;
vector<vector<int>> happ(n, vector<int>(k));
int INF = 1 << 30;
for (int i = 0; i < n; ++i)
for (int j = 0; j < k; ++j)
cin >> happ[i][j];
// dp[i][j] es la mayor felicidad del dia i con la actividad anterior j
vector<vector<int>> dp(n, vector<int>(k, 0));
for (int i = 0; i < k; ++i) {
int maxi = 0;
for (int j = 0; j < k; j++) {
if (i != j)
maxi = max(maxi, happ[0][j]);
}
dp[0][i] = maxi;
}
for (int day = 1; day < n; ++day) {
for (int i = 0; i < k; ++i) {
for (int j = 0; j < k; ++j) {
if (i != j) {
dp[day][j] = max(dp[day][j], dp[day - 1][i] + happ[day][j]);
// cout << "day " << day << " i " << i << " j " << j << " dp " <<
// dp[day][j] << endl;
}
}
}
}
int maxi = -INF;
for (int i = 0; i < 3; ++i) {
maxi = max(maxi, dp[n - 1][i]);
}
cout << maxi << endl;
/*for(int i=0;i<n;++i){
for(int j=0;j<k;j++){
cout << dp[i][j] << " ";
}
cout << endl;
}*/
return 0;
}
|
replace
| 8 | 9 | 8 | 10 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int h[10010][3], dp[100100][3];
int main() {
int n;
cin >> n;
rep(i, n) rep(j, 3) cin >> h[i][j];
rep(i, n) rep(j, 3) rep(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + h[i][k]);
}
// rep(i, n + 1)
// {
// rep(j, 3) cout << dp[i][j] << " ";
// cout << endl;
// }
int ans = 0;
rep(i, 3) ans = max(ans, dp[n][i]);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int h[100100][3], dp[100100][3];
int main() {
int n;
cin >> n;
rep(i, n) rep(j, 3) cin >> h[i][j];
rep(i, n) rep(j, 3) rep(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + h[i][k]);
}
// rep(i, n + 1)
// {
// rep(j, 3) cout << dp[i][j] << " ";
// cout << endl;
// }
int ans = 0;
rep(i, 3) ans = max(ans, dp[n][i]);
cout << ans << endl;
return 0;
}
|
replace
| 14 | 15 | 14 | 15 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define inf 10000000000000
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
ll h[n][3];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++) {
cin >> h[i][j];
}
}
pll d[3];
d[0].ff = 1;
d[0].ss = 2;
d[1].ff = 0;
d[1].ss = 2;
d[2].ss = 1;
d[2].ff = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < n; j++) {
h[i][j] += max(h[i - 1][d[j].ss], h[i - 1][d[j].ff]);
}
}
cout << max(max(h[n - 1][0], h[n - 1][1]), h[n - 1][2]);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll, ll>
#define ff first
#define ss second
#define se set<ll>
#define inf 10000000000000
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef APNA_IO
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll n;
cin >> n;
ll h[n][3];
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < 3; j++) {
cin >> h[i][j];
}
}
pll d[3];
d[0].ff = 1;
d[0].ss = 2;
d[1].ff = 0;
d[1].ss = 2;
d[2].ss = 1;
d[2].ff = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
h[i][j] += max(h[i - 1][d[j].ss], h[i - 1][d[j].ff]);
}
}
cout << max(max(h[n - 1][0], h[n - 1][1]), h[n - 1][2]);
}
|
replace
| 36 | 37 | 36 | 37 |
0
| |
p03162
|
C++
|
Runtime Error
|
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge {
c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define endl '\n'
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 10;
ll n;
vector<ll> v1(10005), v2(10005), v3(10005);
ll dp[100005][4];
// ll ans=0;
ll dfs(int x, int lastChoice) {
if (x == n)
return 0;
if (dp[x][lastChoice] != -1)
return dp[x][lastChoice];
// debug()<<imie(ans);
ll ans = 0;
if (lastChoice != 1) {
ans = max(ans, dfs(x + 1, 1) + v1[x]);
}
if (lastChoice != 2) {
ans = max(ans, dfs(x + 1, 2) + v2[x]);
}
if (lastChoice != 3) {
ans = max(ans, dfs(x + 1, 3) + v3[x]);
}
return dp[x][lastChoice] = ans;
}
int main() {
fastio memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v1[i] >> v2[i] >> v3[i];
}
cout << dfs(0, 0) << endl;
;
return 0;
}
|
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "bits/stdc++.h"
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge {
c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define endl '\n'
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 10;
ll n;
vector<ll> v1(100005), v2(100005), v3(100005);
ll dp[100005][4];
// ll ans=0;
ll dfs(int x, int lastChoice) {
if (x == n)
return 0;
if (dp[x][lastChoice] != -1)
return dp[x][lastChoice];
// debug()<<imie(ans);
ll ans = 0;
if (lastChoice != 1) {
ans = max(ans, dfs(x + 1, 1) + v1[x]);
}
if (lastChoice != 2) {
ans = max(ans, dfs(x + 1, 2) + v2[x]);
}
if (lastChoice != 3) {
ans = max(ans, dfs(x + 1, 3) + v3[x]);
}
return dp[x][lastChoice] = ans;
}
int main() {
fastio memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v1[i] >> v2[i] >> v3[i];
}
cout << dfs(0, 0) << endl;
;
return 0;
}
|
replace
| 48 | 49 | 48 | 49 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
int memo[100100][5], n, a[100050], b[100050], c[100050];
// 0 swim
// 1 Catch bugs
// 2 homework
int dp(int i, int last) {
if (i > n)
return 0;
int Res1 = -2e9, Res2 = -2e9, Res3 = -2e9;
if (last == 0) {
Res1 = dp(i + 1, 1) + b[i];
Res2 = dp(i + 1, 2) + c[i];
Res3 = max(Res1, Res2);
} else if (last == 1) {
Res1 = dp(i + 1, 0) + a[i];
Res2 = dp(i + 1, 2) + c[i];
Res3 = max(Res1, Res2);
} else {
Res1 = dp(i + 1, 0) + a[i];
Res2 = dp(i + 1, 1) + b[i];
Res3 = max(Res1, Res2);
}
return memo[i][last] = Res3;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i] >> c[i];
memset(memo, -1, sizeof(memo));
cout << max(max(dp(1, 1), dp(1, 2)), dp(1, 0));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int memo[100100][5], n, a[100050], b[100050], c[100050];
// 0 swim
// 1 Catch bugs
// 2 homework
int dp(int i, int last) {
if (i > n)
return 0;
int Res1 = -2e9, Res2 = -2e9, Res3 = -2e9;
if (memo[i][last] + 1)
return memo[i][last];
if (last == 0) {
Res1 = dp(i + 1, 1) + b[i];
Res2 = dp(i + 1, 2) + c[i];
Res3 = max(Res1, Res2);
} else if (last == 1) {
Res1 = dp(i + 1, 0) + a[i];
Res2 = dp(i + 1, 2) + c[i];
Res3 = max(Res1, Res2);
} else {
Res1 = dp(i + 1, 0) + a[i];
Res2 = dp(i + 1, 1) + b[i];
Res3 = max(Res1, Res2);
}
return memo[i][last] = Res3;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i] >> b[i] >> c[i];
memset(memo, -1, sizeof(memo));
cout << max(max(dp(1, 1), dp(1, 2)), dp(1, 0));
return 0;
}
|
insert
| 11 | 11 | 11 | 15 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int n;
cin >> n;
int a[n], b[n], c[n], dp1[n], dp2[n], dp3[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
dp1[0] = a[0];
dp2[0] = b[0];
dp3[0] = c[0];
for (int i = 1; i < n; i++) {
dp1[i] = max(dp2[i - 1] + a[i], dp3[i - 1] + a[i]);
dp2[i] = max(dp1[i - 1] + b[i], dp3[i - 1] + b[i]);
dp3[i] = max(dp1[i - 1] + c[i], dp2[i - 1] + c[i]);
}
int ans = max(max(dp1[n - 1], dp2[n - 1]), dp3[n - 1]);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n], b[n], c[n], dp1[n], dp2[n], dp3[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i] >> c[i];
}
dp1[0] = a[0];
dp2[0] = b[0];
dp3[0] = c[0];
for (int i = 1; i < n; i++) {
dp1[i] = max(dp2[i - 1] + a[i], dp3[i - 1] + a[i]);
dp2[i] = max(dp1[i - 1] + b[i], dp3[i - 1] + b[i]);
dp3[i] = max(dp1[i - 1] + c[i], dp2[i - 1] + c[i]);
}
int ans = max(max(dp1[n - 1], dp2[n - 1]), dp3[n - 1]);
cout << ans << endl;
}
|
delete
| 7 | 13 | 7 | 7 |
0
| |
p03162
|
C++
|
Runtime Error
|
// THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
#define fr(i, a, b) for (long long i = a; i < b; i++)
#define nfr(i, a, b) for (long long i = a; i <= b; i++)
#define psl pair<str, ll>
#define pls pair<ll, str>
#define pss pair<str, str>
#define ALL(a) a.begin(), a.end()
#define stl stack<ll>
#define coml complex<ll>
#define INF 0x3f3f3f3f3f3f3f3f
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
fast
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w" , stdout);
#endif*/
ll n;
cin >> n;
vector<vl> v(n, vl(3));
fr(i, 0, n) { fr(j, 0, 3) cin >> v[i][j]; }
vector<vl> dp(n, vl(3, 0));
dp[0] = v[0];
fr(i, 0, n) {
fr(j, 0, 3) {
fr(k, 0, 3) {
if (j != k)
dp[i][k] = max(dp[i][k], dp[i - 1][j] + v[i][k]);
}
}
}
cout << *max_element(ALL(dp[n - 1]));
return 0;
}
|
// THIS IS MY NINJA WAY
#include <algorithm>
#include <bits/stdc++.h>
#include <ctime>
#include <vector>
#define str string
#define dbl double
#define ll long long
#define vl vector<ll>
#define vs vector<str>
#define pll pair<ll, ll>
#define vll vector<pll>
#define sl set<ll>
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL));
#define fr(i, a, b) for (long long i = a; i < b; i++)
#define nfr(i, a, b) for (long long i = a; i <= b; i++)
#define psl pair<str, ll>
#define pls pair<ll, str>
#define pss pair<str, str>
#define ALL(a) a.begin(), a.end()
#define stl stack<ll>
#define coml complex<ll>
#define INF 0x3f3f3f3f3f3f3f3f
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
fast
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r" , stdin);
freopen("output.txt", "w" , stdout);
#endif*/
ll n;
cin >> n;
vector<vl> v(n, vl(3));
fr(i, 0, n) { fr(j, 0, 3) cin >> v[i][j]; }
vector<vl> dp(n, vl(3, 0));
dp[0] = v[0];
fr(i, 1, n) {
fr(j, 0, 3) {
fr(k, 0, 3) {
if (j != k)
dp[i][k] = max(dp[i][k], dp[i - 1][j] + v[i][k]);
}
}
}
cout << *max_element(ALL(dp[n - 1]));
return 0;
}
|
replace
| 50 | 51 | 50 | 51 |
-11
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
// for(auto x:a){
// cout<< x[0] << " "<< x[1] << " "<< x[2] << "\n";
// }
int dp[n][3];
for (int i = 0; i < n; ++i) {
dp[i][0] = 0;
dp[i][1] = 0;
dp[i][2] = 0;
}
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
// for(auto x:dp){
// cout<< x[0] << " "<< x[1] << " "<< x[2] << "\n";
// }
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (j == 0) {
dp[i][j] = max(dp[i - 1][1], dp[i - 1][2]) + a[i][0];
} else if (j == 1) {
dp[i][j] = max(dp[i - 1][0], dp[i - 1][2]) + a[i][1];
} else {
dp[i][j] = max(dp[i - 1][0], dp[i - 1][1]) + a[i][2];
}
}
}
// for(auto x:dp){
// cout<< x[0] << " "<< x[1] << " "<< x[2] << "\n";
// }
int ans = max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]});
cout << ans;
return ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n;
cin >> n;
int a[n][3];
for (int i = 0; i < n; i++) {
cin >> a[i][0] >> a[i][1] >> a[i][2];
}
// for(auto x:a){
// cout<< x[0] << " "<< x[1] << " "<< x[2] << "\n";
// }
int dp[n][3];
for (int i = 0; i < n; ++i) {
dp[i][0] = 0;
dp[i][1] = 0;
dp[i][2] = 0;
}
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
// for(auto x:dp){
// cout<< x[0] << " "<< x[1] << " "<< x[2] << "\n";
// }
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
if (j == 0) {
dp[i][j] = max(dp[i - 1][1], dp[i - 1][2]) + a[i][0];
} else if (j == 1) {
dp[i][j] = max(dp[i - 1][0], dp[i - 1][2]) + a[i][1];
} else {
dp[i][j] = max(dp[i - 1][0], dp[i - 1][1]) + a[i][2];
}
}
}
// for(auto x:dp){
// cout<< x[0] << " "<< x[1] << " "<< x[2] << "\n";
// }
int ans = max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]});
cout << ans;
return 0;
}
|
replace
| 47 | 48 | 47 | 48 |
210
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <deque>
#include <iostream>
#include <stdlib.h>
#include <string>
#define N 10005
#define ul unsigned long long
#define ll long long int
#define loop0(i, a, b) for (int i = a; i < b; ++i)
#define loop1(i, a, b) for (int i = a; i <= b; ++i)
#define ini0(i, b) for (int i = b; i >= 0; --i)
#define ini1(i, b) for (int i = b - 1; i >= 0; --i)
#define pl pair<ll, ll>
#define pi pair<int, int>
#define ff first
#define ss second
#define bg begin()
#define ed end()
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output.txt", "w", stdout);
#define test1(x) cout << #x << " : " << x << endl;
#define test2(x, y) cout << #x << " : " << x << " " << #y << " : " << y << endl;
#define test3(x, y, z) \
cout << #x << " : " << x << " " << #y << " : " << y << " " << #z << " : " \
<< z << endl;
int bgval(int n, int a) {
int rt = n / a;
if (n % a != 0)
rt++;
return rt;
}
using namespace std;
map<string, int> mp;
ll phi(ll n) {
ll result = n; // Initialize result as n
// Consider all prime factors of n and subtract their
// multiples from result
for (ll p = 2; p * p <= n; ++p) {
// Check if p is a prime factor.
if (n % p == 0) {
// If yes, then update n and result
while (n % p == 0)
n /= p;
result -= result / p;
}
}
// If n has a prime factor greater than sqrt(n)
// (There can be at-most one such prime factor)
if (n > 1)
result -= result / n;
return result;
}
bool isprime(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
int n, k = 0;
cin >> n;
/*vector<ll> vc(n,0), dp(n,INT_MAX);
for (auto &it : vc) cin >> it;
dp[0] = 0;*/
ll a, b, c;
ll ans[N][4] = {0};
for (int i = 1; i <= n; i++) {
cin >> a >> b >> c;
if (i == 1) {
ans[1][1] = a;
ans[1][2] = b;
ans[1][3] = c;
} else {
ans[i][1] += max(ans[i - 1][2], ans[i - 1][3]) + a;
ans[i][2] += max(ans[i - 1][1], ans[i - 1][3]) + b;
ans[i][3] += max(ans[i - 1][2], ans[i - 1][1]) + c;
}
}
cout << max(ans[n][1], max(ans[n][2], ans[n][3])) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#include <deque>
#include <iostream>
#include <stdlib.h>
#include <string>
#define N 100005
#define ul unsigned long long
#define ll long long int
#define loop0(i, a, b) for (int i = a; i < b; ++i)
#define loop1(i, a, b) for (int i = a; i <= b; ++i)
#define ini0(i, b) for (int i = b; i >= 0; --i)
#define ini1(i, b) for (int i = b - 1; i >= 0; --i)
#define pl pair<ll, ll>
#define pi pair<int, int>
#define ff first
#define ss second
#define bg begin()
#define ed end()
#define READ freopen("input.txt", "r", stdin);
#define WRITE freopen("output.txt", "w", stdout);
#define test1(x) cout << #x << " : " << x << endl;
#define test2(x, y) cout << #x << " : " << x << " " << #y << " : " << y << endl;
#define test3(x, y, z) \
cout << #x << " : " << x << " " << #y << " : " << y << " " << #z << " : " \
<< z << endl;
int bgval(int n, int a) {
int rt = n / a;
if (n % a != 0)
rt++;
return rt;
}
using namespace std;
map<string, int> mp;
ll phi(ll n) {
ll result = n; // Initialize result as n
// Consider all prime factors of n and subtract their
// multiples from result
for (ll p = 2; p * p <= n; ++p) {
// Check if p is a prime factor.
if (n % p == 0) {
// If yes, then update n and result
while (n % p == 0)
n /= p;
result -= result / p;
}
}
// If n has a prime factor greater than sqrt(n)
// (There can be at-most one such prime factor)
if (n > 1)
result -= result / n;
return result;
}
bool isprime(ll n) {
for (ll i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
int n, k = 0;
cin >> n;
/*vector<ll> vc(n,0), dp(n,INT_MAX);
for (auto &it : vc) cin >> it;
dp[0] = 0;*/
ll a, b, c;
ll ans[N][4] = {0};
for (int i = 1; i <= n; i++) {
cin >> a >> b >> c;
if (i == 1) {
ans[1][1] = a;
ans[1][2] = b;
ans[1][3] = c;
} else {
ans[i][1] += max(ans[i - 1][2], ans[i - 1][3]) + a;
ans[i][2] += max(ans[i - 1][1], ans[i - 1][3]) + b;
ans[i][3] += max(ans[i - 1][2], ans[i - 1][1]) + c;
}
}
cout << max(ans[n][1], max(ans[n][2], ans[n][3])) << endl;
}
return 0;
}
|
replace
| 5 | 6 | 5 | 6 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#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 f first
#define s second
using namespace std;
int arr[100005][3];
int n;
int solve(int sum, int call, int step) {
if (step == n) {
if (call == 1)
return max(arr[n][0], arr[n][2]);
else if (call == 2)
return max(arr[n][0], arr[n][1]);
else
return max(arr[n][1], arr[n][2]);
}
++step;
if (call == 0) {
return sum +
max(solve(arr[step][1], 1, step), solve(arr[step][2], 2, step));
}
if (call == 1) {
return sum +
max(solve(arr[step][0], 0, step), solve(arr[step][2], 2, step));
}
if (call == 2) {
return sum +
max(solve(arr[step][1], 1, step), solve(arr[step][0], 0, step));
}
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
int a1 = solve(arr[1][0], 0, 1);
int a2 = solve(arr[1][1], 1, 1);
int a3 = solve(arr[1][2], 2, 1);
cout << max(a1, max(a2, a3));
return 0;
}
|
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#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 f first
#define s second
using namespace std;
int arr[100005][3];
int n;
int solve(int sum, int call, int step) {
if (step == n) {
if (call == 1)
return max(arr[n][0], arr[n][2]);
else if (call == 2)
return max(arr[n][0], arr[n][1]);
else
return max(arr[n][1], arr[n][2]);
}
++step;
if (call == 0) {
return sum +
max(solve(arr[step][1], 1, step), solve(arr[step][2], 2, step));
}
if (call == 1) {
return sum +
max(solve(arr[step][0], 0, step), solve(arr[step][2], 2, step));
}
if (call == 2) {
return sum +
max(solve(arr[step][1], 1, step), solve(arr[step][0], 0, step));
}
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
// int a1 = solve(arr[1][0], 0, 1);
// int a2 = solve(arr[1][1], 1, 1);
// int a3 = solve(arr[1][2], 2, 1);
// cout<<max(a1, max(a2, a3))<<endl;
int dp[n + 1][3];
dp[1][0] = arr[1][0];
dp[1][1] = arr[1][1];
dp[1][2] = arr[1][2];
for (int i = 2; i <= n; i++) {
int A = arr[i][0] + max(dp[i - 1][1], dp[i - 1][2]);
int B = arr[i][1] + max(dp[i - 1][0], dp[i - 1][2]);
int C = arr[i][2] + max(dp[i - 1][0], dp[i - 1][1]);
dp[i][0] = A;
dp[i][1] = B;
dp[i][2] = C;
}
cout << max(dp[n][0], max(dp[n][1], dp[n][2])) << endl;
;
return 0;
}
|
replace
| 63 | 67 | 63 | 83 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
// In the name of ALLAH the most merciful the most beneficial
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#define sc(x) scanf("%d", &x)
#define ll long long
#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 ff first
#define ss second
#define sz(x) x.size()
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int con = 1e5 + 8;
static const int INF = 0x3f3f3f3f;
static const int MOD = 998244353;
int main() {
int N;
sc(N);
int arr[9][3];
FOR(i, 0, N)
sc(arr[i][0]), sc(arr[i][1]), sc(arr[i][2]);
int ind[3];
ind[0] = ind[1] = ind[2] = -1;
FOR(i, 1, N) {
FOR(j, 0, 3) {
if (j == 0) {
arr[i][j] += max(arr[i - 1][j + 1], arr[i - 1][j + 2]);
} else if (j == 1) {
arr[i][j] += max({arr[i - 1][j - 1], arr[i - 1][j + 1]});
} else {
arr[i][j] += max(arr[i - 1][j - 1], arr[i - 1][j - 2]);
}
}
}
N--;
cout << max({arr[N][0], arr[N][1], arr[N][2]});
}
|
// In the name of ALLAH the most merciful the most beneficial
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <math.h>
#define sc(x) scanf("%d", &x)
#define ll long long
#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 ff first
#define ss second
#define sz(x) x.size()
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int con = 1e5 + 8;
static const int INF = 0x3f3f3f3f;
static const int MOD = 998244353;
int main() {
int N;
sc(N);
int arr[con][3];
FOR(i, 0, N)
sc(arr[i][0]), sc(arr[i][1]), sc(arr[i][2]);
int ind[3];
ind[0] = ind[1] = ind[2] = -1;
FOR(i, 1, N) {
FOR(j, 0, 3) {
if (j == 0) {
arr[i][j] += max(arr[i - 1][j + 1], arr[i - 1][j + 2]);
} else if (j == 1) {
arr[i][j] += max({arr[i - 1][j - 1], arr[i - 1][j + 1]});
} else {
arr[i][j] += max(arr[i - 1][j - 1], arr[i - 1][j - 2]);
}
}
}
N--;
cout << max({arr[N][0], arr[N][1], arr[N][2]});
}
|
replace
| 29 | 30 | 29 | 30 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
int n;
vector<vector<ll>> dp(10005, vector<ll>(3, 0));
int main() {
cin >> n;
vector<vector<ll>> a(n, vector<ll>(3));
rep(i, n) rep(j, 3) cin >> a[i][j];
rep(i, n) {
rep(j, 3) {
rep(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + a[i][k]);
}
}
}
ll res = 0;
rep(i, 3) chmax(res, dp[n][i]);
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
int n;
// vector<vector<ll>> dp(10005,vector<ll>(3,0));
long long dp[100010][3];
int main() {
cin >> n;
vector<vector<ll>> a(n, vector<ll>(3));
rep(i, n) rep(j, 3) cin >> a[i][j];
rep(i, n) {
rep(j, 3) {
rep(k, 3) {
if (j == k)
continue;
chmax(dp[i + 1][k], dp[i][j] + a[i][k]);
}
}
}
ll res = 0;
rep(i, 3) chmax(res, dp[n][i]);
cout << res << "\n";
return 0;
}
|
replace
| 21 | 23 | 21 | 23 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int arr[10005][3];
int ans[10005][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < 3; i++) {
ans[0][i] = arr[0][i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
int Max = 0;
for (int k = 0; k < 3; k++) {
if (k != j)
Max = max(Max, arr[i][j] + ans[i - 1][k]);
}
ans[i][j] = Max;
}
}
int Max = 0;
Max = max(ans[n - 1][1], max(ans[n - 1][0], ans[n - 1][2]));
cout << Max;
return 0;
}
|
#include <iostream>
using namespace std;
int arr[1000005][3];
int ans[1000005][3];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < 3; i++) {
ans[0][i] = arr[0][i];
}
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
int Max = 0;
for (int k = 0; k < 3; k++) {
if (k != j)
Max = max(Max, arr[i][j] + ans[i - 1][k]);
}
ans[i][j] = Max;
}
}
int Max = 0;
Max = max(ans[n - 1][1], max(ans[n - 1][0], ans[n - 1][2]));
cout << Max;
return 0;
}
|
replace
| 3 | 5 | 3 | 5 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<vector<int>> v;
int dp[100001][3];
int f(int i, int j) {
if (i == v.size())
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int ans = INT_MIN;
for (int k = 0; k < 3; k++) {
if (k != j) {
ans = max(ans, v[i][k] + f(i + 1, k));
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
memset(dp, -1, sizeof(dp));
int n;
cin >> n;
v.resize(n);
for (auto &i : v) {
i.resize(3);
}
for (int i = 0; i < n; i++) {
cin >> v[i][0] >> v[i][1] >> v[i][2];
}
cout << max(f(0, 0), max(f(0, 1), f(0, 2))) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<vector<int>> v;
int dp[100001][3];
int f(int i, int j) {
if (i == v.size())
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int ans = INT_MIN;
for (int k = 0; k < 3; k++) {
if (k != j) {
ans = max(ans, v[i][k] + f(i + 1, k));
}
}
dp[i][j] = ans;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
memset(dp, -1, sizeof(dp));
int n;
cin >> n;
v.resize(n);
for (auto &i : v) {
i.resize(3);
}
for (int i = 0; i < n; i++) {
cin >> v[i][0] >> v[i][1] >> v[i][2];
}
cout << max(f(0, 0), max(f(0, 1), f(0, 2))) << "\n";
}
|
insert
| 22 | 22 | 22 | 23 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mp make_pair
#define pb push_back
#define ld long double
#define f first
#define s second
const ll N = (1e6);
const ll mod = (1e9 + 7);
int main() {
int dp[10001][3] = {};
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; ++i) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define mp make_pair
#define pb push_back
#define ld long double
#define f first
#define s second
const ll N = (1e6);
const ll mod = (1e9 + 7);
int main() {
int dp[100001][3] = {};
int n;
cin >> n;
int a[n], b[n], c[n];
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i] >> c[i];
}
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0][2] = c[0];
for (int i = 1; i < n; ++i) {
dp[i][0] = a[i] + max(dp[i - 1][1], dp[i - 1][2]);
dp[i][1] = b[i] + max(dp[i - 1][0], dp[i - 1][2]);
dp[i][2] = c[i] + max(dp[i - 1][0], dp[i - 1][1]);
}
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
bool isprime(int n) {
if (n == 1)
return true;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int lcm(int a, int b) { return (a * b) / __gcd(a, b); }
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
unsigned int factorial(unsigned int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
const int inf = 1e17 + 7;
// const int N=2e5+5;
bool visited[100005] = {false};
signed main() {
FAST int n;
cin >> n;
vector<int> ans(3, 0);
for (int i = 0; i < n; i++) {
vector<int> dp(3, 0);
vector<int> b(3);
for (int i = 0; i < 3; i++)
cin >> b[i];
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j != k) {
dp[k] = max(dp[k], ans[i] + b[j]);
}
}
}
ans = dp;
}
cout << max({ans[0], ans[1], ans[2]});
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
#define int long long
#define double long double
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define mod 1000000007
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
bool isprime(int n) {
if (n == 1)
return true;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
int lcm(int a, int b) { return (a * b) / __gcd(a, b); }
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
unsigned int factorial(unsigned int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
const int inf = 1e17 + 7;
// const int N=2e5+5;
bool visited[100005] = {false};
signed main() {
FAST int n;
cin >> n;
vector<int> ans(3, 0);
for (int i = 0; i < n; i++) {
vector<int> dp(3, 0);
vector<int> b(3);
for (int i = 0; i < 3; i++)
cin >> b[i];
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j != k) {
dp[k] = max(dp[k], ans[j] + b[k]);
}
}
}
ans = dp;
}
cout << max({ans[0], ans[1], ans[2]});
}
|
replace
| 51 | 52 | 51 | 52 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const long long INF = 2LL << 60;
using ll = long long;
using P = pair<string, ll>;
int main(int argc, char const *argv[]) {
ll n, h[3][10010], dp[3][10010];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> h[j][i];
dp[j][i] = 0;
}
}
dp[0][0] = h[0][0];
dp[1][0] = h[1][0];
dp[2][0] = h[2][0];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
chmax(dp[j][i], dp[k][i - 1] + h[j][i]);
}
}
}
cout << max(max(dp[0][n - 1], dp[1][n - 1]), dp[2][n - 1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const long long INF = 2LL << 60;
using ll = long long;
using P = pair<string, ll>;
int main(int argc, char const *argv[]) {
ll n, h[3][100100], dp[3][100100];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> h[j][i];
dp[j][i] = 0;
}
}
dp[0][0] = h[0][0];
dp[1][0] = h[1][0];
dp[2][0] = h[2][0];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
chmax(dp[j][i], dp[k][i - 1] + h[j][i]);
}
}
}
cout << max(max(dp[0][n - 1], dp[1][n - 1]), dp[2][n - 1]) << endl;
return 0;
}
|
replace
| 21 | 22 | 21 | 22 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[100100][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
long long dp[100100][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k]);
}
}
}
long long res = 0;
for (int i = 0; i < n; i++)
res = max(res, dp[n][i]);
cout << res << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long long a[100100][3];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
long long dp[100100][3] = {0};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 3; k++) {
if (j == k)
continue;
dp[i + 1][k] = max(dp[i + 1][k], dp[i][j] + a[i][k]);
}
}
}
long long res = 0;
for (int i = 0; i < 3; i++)
res = max(res, dp[n][i]);
cout << res << endl;
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
cin >> c[i];
}
int dp[n + 1]
[3]; // i-1日目にjを選んだ時のdp[i][j]はi日目までの幸福度の総和の最大値
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dp[i + 1][0] = max(dp[i][1] + b[i], dp[i][2] + c[i]);
dp[i + 1][1] = max(dp[i][2] + c[i], dp[i][0] + a[i]);
dp[i + 1][2] = max(dp[i][0] + a[i], dp[i][1] + b[i]);
// cout << dp[i+1][0] << " " << dp[i+1][1] << " " << dp[i+1][2] <<
// endl;
}
}
cout << max(max(dp[n][0], dp[n][1]), dp[n][2]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
cin >> b[i];
cin >> c[i];
}
int dp[n + 1]
[3]; // i-1日目にjを選んだ時のdp[i][j]はi日目までの幸福度の総和の最大値
dp[0][0] = 0;
dp[0][1] = 0;
dp[0][2] = 0;
for (int i = 0; i < n; i++) {
dp[i + 1][0] = max(dp[i][1] + b[i], dp[i][2] + c[i]);
dp[i + 1][1] = max(dp[i][2] + c[i], dp[i][0] + a[i]);
dp[i + 1][2] = max(dp[i][0] + a[i], dp[i][1] + b[i]);
// cout << dp[i+1][0] << " " << dp[i+1][1] << " " << dp[i+1][2] <<
// endl;
}
cout << max(max(dp[n][0], dp[n][1]), dp[n][2]) << endl;
return 0;
}
|
replace
| 35 | 42 | 35 | 40 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 100;
const int INF = 1e15;
int dp[N][4], h[N][4], n, k;
int sol(int idx, int p) {
if (idx == n + 1)
return 0;
int &ans = dp[idx][p];
if (ans != -1)
return ans;
for (int i = 1; i <= 3; i++) {
if (i != p) {
ans = max(ans, sol(idx + 1, i) + h[idx][i]);
}
}
return ans;
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i][1] >> h[i][2] >> h[i][3];
memset(dp, -1, sizeof(dp));
cout << sol(1, 0) << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 100;
const int INF = 1e15;
int dp[N][4], h[N][4], n, k;
int sol(int idx, int p) {
if (idx == n + 1)
return 0;
int &ans = dp[idx][p];
if (ans != -1)
return ans;
for (int i = 1; i <= 3; i++) {
if (i != p) {
ans = max(ans, sol(idx + 1, i) + h[idx][i]);
}
}
return ans;
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> h[i][1] >> h[i][2] >> h[i][3];
memset(dp, -1, sizeof(dp));
cout << sol(1, 0) << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
while (t--) {
solve();
}
}
|
delete
| 36 | 40 | 36 | 36 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <algorithm>
#include <cmath>
#include <ctype.h>
#include <deque> //<< fixed << setprecision()
#include <iomanip>
#include <iostream>
#include <map>
#include <queue> //priority_queue
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const double pi = (2 * acos(0));
struct point {
long double x, y;
};
double area(int x1, int y1, int x2, int y2, int x3, int y3) {
double a =
(x2 * y3) - (x3 * y2) - (x1 * y3) + (x3 * y1) + (x1 * y2) - (x2 * y1);
a /= 2;
return fabs(a);
}
long double anyarea(point p[], int n) {
long double sum1 = p[n - 1].x * p[0].y, sum2 = p[n - 1].y * p[0].x;
for (int i = 0; i < n - 1; i++) {
sum1 += p[i].x * p[i + 1].y;
sum2 += p[i].y * p[i + 1].x;
}
return fabs((sum1 - sum2) * 0.5);
}
ll fastpow(ll base, ll p, ll m) {
if (p == 0)
return 1;
ll ans = fastpow(base, p / 2, m);
ans = ((ans % m) * (ans % m)) % m;
if (p % 2)
ans = ((base % m) * ans) % m;
return ans;
}
ll GCD(ll M, ll m) {
if (M % m == 0)
return m;
M %= m;
ll x1 = M, x2 = m;
m = min(x1, x2);
M = max(x1, x2);
return GCD(M, m);
}
ll lcm(ll M, ll m) { return (M * m) / GCD(max(M, m), min(M, m)); }
int main() {
int n;
int arr[100][3], ans[100][3] = {};
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < n; i++) {
int m[3] = {};
for (int j = 0; j < 3; j++) {
if (i == 0)
ans[i][j] = arr[i][j];
else {
if (j != 0)
m[0] = max(m[0], ans[i - 1][j]);
if (j != 1)
m[1] = max(m[1], ans[i - 1][j]);
if (j != 2)
m[2] = max(m[2], ans[i - 1][j]);
}
}
for (int j = 0; j < 3; j++) {
ans[i][j] = m[j] + arr[i][j];
}
}
int res = 0;
res = max(ans[n - 1][0], max(ans[n - 1][2], ans[n - 1][1]));
cout << res;
}
|
#include <algorithm>
#include <cmath>
#include <ctype.h>
#include <deque> //<< fixed << setprecision()
#include <iomanip>
#include <iostream>
#include <map>
#include <queue> //priority_queue
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const double pi = (2 * acos(0));
struct point {
long double x, y;
};
double area(int x1, int y1, int x2, int y2, int x3, int y3) {
double a =
(x2 * y3) - (x3 * y2) - (x1 * y3) + (x3 * y1) + (x1 * y2) - (x2 * y1);
a /= 2;
return fabs(a);
}
long double anyarea(point p[], int n) {
long double sum1 = p[n - 1].x * p[0].y, sum2 = p[n - 1].y * p[0].x;
for (int i = 0; i < n - 1; i++) {
sum1 += p[i].x * p[i + 1].y;
sum2 += p[i].y * p[i + 1].x;
}
return fabs((sum1 - sum2) * 0.5);
}
ll fastpow(ll base, ll p, ll m) {
if (p == 0)
return 1;
ll ans = fastpow(base, p / 2, m);
ans = ((ans % m) * (ans % m)) % m;
if (p % 2)
ans = ((base % m) * ans) % m;
return ans;
}
ll GCD(ll M, ll m) {
if (M % m == 0)
return m;
M %= m;
ll x1 = M, x2 = m;
m = min(x1, x2);
M = max(x1, x2);
return GCD(M, m);
}
ll lcm(ll M, ll m) { return (M * m) / GCD(max(M, m), min(M, m)); }
int main() {
int n;
int arr[100005][3], ans[100005][3] = {};
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> arr[i][j];
}
}
for (int i = 0; i < n; i++) {
int m[3] = {};
for (int j = 0; j < 3; j++) {
if (i == 0)
ans[i][j] = arr[i][j];
else {
if (j != 0)
m[0] = max(m[0], ans[i - 1][j]);
if (j != 1)
m[1] = max(m[1], ans[i - 1][j]);
if (j != 2)
m[2] = max(m[2], ans[i - 1][j]);
}
}
for (int j = 0; j < 3; j++) {
ans[i][j] = m[j] + arr[i][j];
}
}
int res = 0;
res = max(ans[n - 1][0], max(ans[n - 1][2], ans[n - 1][1]));
cout << res;
}
|
replace
| 58 | 59 | 58 | 59 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> a, b, c;
vector<vector<long long>> happy;
long long dp(int day, int prev) {
if (day < 0) {
return 0;
}
// if (happy[day][prev] != 0) {
// return happy[day][prev];
// }
if (prev == 0) {
happy[day][prev] = max(dp(day - 1, 1) + b[day], dp(day - 1, 2) + c[day]);
} else if (prev == 1) {
happy[day][prev] = max(dp(day - 1, 0) + a[day], dp(day - 1, 2) + c[day]);
} else if (prev == 2) {
happy[day][prev] = max(dp(day - 1, 0) + a[day], dp(day - 1, 1) + b[day]);
} else {
return max({dp(day - 1, 0) + a[day], dp(day - 1, 1) + b[day],
dp(day - 1, 2) + c[day]});
}
// cout << day << " day : " << happy[day][prev] << endl;
return happy[day][prev];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
a.push_back(x);
b.push_back(y);
c.push_back(z);
vector<long long> m;
m.push_back(0);
m.push_back(0);
m.push_back(0);
happy.push_back(m);
}
cout << dp(n - 1, -1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> a, b, c;
vector<vector<long long>> happy;
long long dp(int day, int prev) {
if (day < 0) {
return 0;
}
if (prev >= 0 && happy[day][prev] != 0) {
return happy[day][prev];
}
if (prev == 0) {
happy[day][prev] = max(dp(day - 1, 1) + b[day], dp(day - 1, 2) + c[day]);
} else if (prev == 1) {
happy[day][prev] = max(dp(day - 1, 0) + a[day], dp(day - 1, 2) + c[day]);
} else if (prev == 2) {
happy[day][prev] = max(dp(day - 1, 0) + a[day], dp(day - 1, 1) + b[day]);
} else {
return max({dp(day - 1, 0) + a[day], dp(day - 1, 1) + b[day],
dp(day - 1, 2) + c[day]});
}
// cout << day << " day : " << happy[day][prev] << endl;
return happy[day][prev];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
a.push_back(x);
b.push_back(y);
c.push_back(z);
vector<long long> m;
m.push_back(0);
m.push_back(0);
m.push_back(0);
happy.push_back(m);
}
cout << dp(n - 1, -1) << endl;
}
|
replace
| 10 | 13 | 10 | 13 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int cost[10010][3];
long long happy[100010][3];
long long dp(int day, int prev) {
if (day < 0) {
return 0;
}
if (prev >= 0 && happy[day][prev] != 0) {
return happy[day][prev];
}
if (prev == 0) {
happy[day][prev] =
max(dp(day - 1, 1) + cost[day][1], dp(day - 1, 2) + cost[day][2]);
} else if (prev == 1) {
happy[day][prev] =
max(dp(day - 1, 0) + cost[day][0], dp(day - 1, 2) + cost[day][2]);
} else if (prev == 2) {
happy[day][prev] =
max(dp(day - 1, 0) + cost[day][0], dp(day - 1, 1) + cost[day][1]);
} else {
return max({dp(day - 1, 0) + cost[day][0], dp(day - 1, 1) + cost[day][1],
dp(day - 1, 2) + cost[day][2]});
}
// cout << day << " day : " << happy[day][prev] << endl;
return happy[day][prev];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
cost[i][0] = x;
cost[i][1] = y;
cost[i][2] = z;
}
cout << dp(n - 1, -1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int cost[100010][3];
long long happy[100010][3];
long long dp(int day, int prev) {
if (day < 0) {
return 0;
}
if (prev >= 0 && happy[day][prev] != 0) {
return happy[day][prev];
}
if (prev == 0) {
happy[day][prev] =
max(dp(day - 1, 1) + cost[day][1], dp(day - 1, 2) + cost[day][2]);
} else if (prev == 1) {
happy[day][prev] =
max(dp(day - 1, 0) + cost[day][0], dp(day - 1, 2) + cost[day][2]);
} else if (prev == 2) {
happy[day][prev] =
max(dp(day - 1, 0) + cost[day][0], dp(day - 1, 1) + cost[day][1]);
} else {
return max({dp(day - 1, 0) + cost[day][0], dp(day - 1, 1) + cost[day][1],
dp(day - 1, 2) + cost[day][2]});
}
// cout << day << " day : " << happy[day][prev] << endl;
return happy[day][prev];
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x, y, z;
cin >> x >> y >> z;
cost[i][0] = x;
cost[i][1] = y;
cost[i][2] = z;
}
cout << dp(n - 1, -1) << endl;
}
|
replace
| 3 | 4 | 3 | 4 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long double PI = 3.141592653589793238463;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
ll a[100005][5];
ll b[100005];
ll c[100005];
ll dp[100005][5];
int n, k;
int D() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 3; k++) {
if (j != k)
dp[i][j] = max(dp[i - 1][k] + a[i][j], dp[i][j]);
}
}
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
cin >> a[i][j];
}
}
D();
cout << max(dp[n][1], max(dp[n][2], dp[n][3]));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
long double PI = 3.141592653589793238463;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
ll a[100005][5];
ll b[100005];
ll c[100005];
ll dp[100005][5];
int n, k;
void D() {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
for (int k = 1; k <= 3; k++) {
if (j != k)
dp[i][j] = max(dp[i - 1][k] + a[i][j], dp[i][j]);
}
}
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 3; j++) {
cin >> a[i][j];
}
}
D();
cout << max(dp[n][1], max(dp[n][2], dp[n][3]));
return 0;
}
|
replace
| 13 | 14 | 13 | 14 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long INF = (1 << 30);
int main() {
int n;
cin >> n;
int a[100000][3];
rep(i, n) {
rep(j, 3) { cin >> a[i][j]; }
}
long long dp[100100][3] = {}; // 幸福度を0で初期化
rep(i, 3) { dp[0][i] = a[0][i]; }
rep(i, n) {
rep(j, 3) {
rep(k, 3) {
if (j == k)
continue;
dp[i + 1][j] = max(dp[i][k] + a[i + 1][j], dp[i + 1][j]);
}
}
}
long long ans = 0;
rep(i, n) { ans = max(ans, dp[n - 1][i]); }
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long INF = (1 << 30);
int main() {
int n;
cin >> n;
int a[100000][3];
rep(i, n) {
rep(j, 3) { cin >> a[i][j]; }
}
long long dp[100100][3] = {}; // 幸福度を0で初期化
rep(i, 3) { dp[0][i] = a[0][i]; }
rep(i, n) {
rep(j, 3) {
rep(k, 3) {
if (j == k)
continue;
dp[i + 1][j] = max(dp[i][k] + a[i + 1][j], dp[i + 1][j]);
}
}
}
long long ans = 0;
rep(i, 3) { ans = max(ans, dp[n - 1][i]); }
cout << ans << endl;
return 0;
}
|
replace
| 29 | 30 | 29 | 30 |
0
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long int
#define f(i, n) for (ll i = 0; i < n; i++)
#define fn(i, n) for (ll i = 1; i < n; i++)
#define F first
#define pb push_back
#define S second
using namespace std;
ll dp[100005][4];
ll n;
ll mn = INT_MAX;
ll sol(ll a[][3], ll i, ll k) {
if (i == n - 1) {
if (k == 0)
return dp[i][k] = max(a[i][1], a[i][2]);
if (k == 1)
return dp[i][k] = max(a[i][0], a[i][2]);
if (k == 2)
return dp[i][k] = max(a[i][1], a[i][0]);
return dp[i][k] = max(a[i][0], max(a[i][1], a[i][2]));
}
dp[i][0] = a[i][0] + sol(a, i + 1, 0);
dp[i][1] = a[i][1] + sol(a, i + 1, 1);
dp[i][2] = a[i][2] + sol(a, i + 1, 2);
if (k == 0) {
return max(dp[i][1], dp[i][2]);
}
if (k == 1) {
return max(dp[i][0], dp[i][2]);
}
if (k == 2) {
return max(dp[i][1], dp[i][0]);
}
return dp[i][k] =
max(a[i][1] + sol(a, i + 1, 1),
max(a[i][0] + sol(a, i + 1, 0), a[i][2] + sol(a, i + 1, 2)));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// ll n;
cin >> n;
ll a[n][3];
bool l[3];
f(i, 3) l[i] = 0;
f(i, n) { cin >> a[i][0] >> a[i][1] >> a[i][2]; }
// f(i,10) dp[i] = 100;
memset(dp, -1, sizeof(dp));
sol(a, 0, 3);
cout << dp[0][3] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define f(i, n) for (ll i = 0; i < n; i++)
#define fn(i, n) for (ll i = 1; i < n; i++)
#define F first
#define pb push_back
#define S second
using namespace std;
ll dp[100005][4];
ll n;
ll mn = INT_MAX;
ll sol(ll a[][3], ll i, ll k) {
if (i == n - 1) {
if (k == 0)
return dp[i][k] = max(a[i][1], a[i][2]);
if (k == 1)
return dp[i][k] = max(a[i][0], a[i][2]);
if (k == 2)
return dp[i][k] = max(a[i][1], a[i][0]);
return dp[i][k] = max(a[i][0], max(a[i][1], a[i][2]));
}
if (dp[i][0] == -1 || dp[i][1] == -1 || dp[i][2] == -1) {
dp[i][0] = a[i][0] + sol(a, i + 1, 0);
dp[i][1] = a[i][1] + sol(a, i + 1, 1);
dp[i][2] = a[i][2] + sol(a, i + 1, 2);
}
if (k == 0) {
return max(dp[i][1], dp[i][2]);
}
if (k == 1) {
return max(dp[i][0], dp[i][2]);
}
if (k == 2) {
return max(dp[i][1], dp[i][0]);
}
return dp[i][k] =
max(a[i][1] + sol(a, i + 1, 1),
max(a[i][0] + sol(a, i + 1, 0), a[i][2] + sol(a, i + 1, 2)));
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// ll n;
cin >> n;
ll a[n][3];
bool l[3];
f(i, 3) l[i] = 0;
f(i, n) { cin >> a[i][0] >> a[i][1] >> a[i][2]; }
// f(i,10) dp[i] = 100;
memset(dp, -1, sizeof(dp));
sol(a, 0, 3);
cout << dp[0][3] << endl;
return 0;
}
|
replace
| 25 | 29 | 25 | 30 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod = 1000000007;
ll const md = 998244353;
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;
}
ifstream in("txt.in");
ofstream out("txt.out");
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int f[100005][5];
int dp[5][100005];
int main() {
cout << fixed << setprecision(12);
cin.tie(0);
ios_base::sync_with_stdio(0);
cout.tie(0);
ll n;
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= 3; ++j) {
cin >> f[i][j];
}
}
dp[1][1] = f[1][1];
dp[1][2] = f[1][2];
dp[1][3] = f[1][3];
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= 3; ++j) {
if (j == 1)
dp[i][j] = max(dp[i - 1][2], dp[i - 1][3]) + f[i][j];
if (j == 2)
dp[i][j] = max(dp[i - 1][1], dp[i - 1][3]) + f[i][j];
if (j == 3)
dp[i][j] = max(dp[i - 1][2], dp[i - 1][1]) + f[i][j];
}
}
cout << max({dp[n][1], dp[n][2], dp[n][3]});
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll const mod = 1000000007;
ll const md = 998244353;
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;
}
ifstream in("txt.in");
ofstream out("txt.out");
#define mp make_pair
#define pb push_back
#define fi first
#define se second
int f[100005][5];
int dp[100005][5];
int main() {
cout << fixed << setprecision(12);
cin.tie(0);
ios_base::sync_with_stdio(0);
cout.tie(0);
ll n;
cin >> n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= 3; ++j) {
cin >> f[i][j];
}
}
dp[1][1] = f[1][1];
dp[1][2] = f[1][2];
dp[1][3] = f[1][3];
for (int i = 2; i <= n; ++i) {
for (int j = 1; j <= 3; ++j) {
if (j == 1)
dp[i][j] = max(dp[i - 1][2], dp[i - 1][3]) + f[i][j];
if (j == 2)
dp[i][j] = max(dp[i - 1][1], dp[i - 1][3]) + f[i][j];
if (j == 3)
dp[i][j] = max(dp[i - 1][2], dp[i - 1][1]) + f[i][j];
}
}
cout << max({dp[n][1], dp[n][2], dp[n][3]});
return 0;
}
|
replace
| 25 | 26 | 25 | 26 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define INF 1234567890
#define N (int)(1e5 + 5)
#define pi acos(-1)
void solve() {
int dp[4];
int n;
cin >> n;
for (int i = 1; i <= 3; ++i)
cin >> dp[i];
for (int i = 2; i <= n; ++i) {
int cost[4], new_dp[4];
for (int j = 1; j <= 3; ++j)
cin >> cost[j], new_dp[j] = -INF;
for (int j = 1; j <= 3; ++j)
for (int k = 1; k <= 3; ++k)
if (j != k)
new_dp[j] = max(new_dp[j], cost[j] + dp[i]);
for (int j = 1; j <= 3; ++j)
dp[j] = new_dp[j];
}
cout << max(dp[1], max(dp[2], dp[3]));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
#define INF 1234567890
#define N (int)(1e5 + 5)
#define pi acos(-1)
void solve() {
int dp[4];
int n;
cin >> n;
for (int i = 1; i <= 3; ++i)
cin >> dp[i];
for (int i = 2; i <= n; ++i) {
int cost[4], new_dp[4];
for (int j = 1; j <= 3; ++j)
cin >> cost[j], new_dp[j] = -INF;
for (int j = 1; j <= 3; ++j)
for (int k = 1; k <= 3; ++k)
if (j != k)
new_dp[j] = max(new_dp[j], cost[j] + dp[k]);
for (int j = 1; j <= 3; ++j)
dp[j] = new_dp[j];
}
cout << max(dp[1], max(dp[2], dp[3]));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
|
replace
| 21 | 22 | 21 | 22 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
vector<vector<int>> a(n, vector<int>(3)), dp(n, vector<int>(3, INT_MIN));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a[i][j];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n; i++)
for (int j = 0; j < 3; j++)
for (int k = 0; k < 3; k++)
if (j != k)
dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[i][j]);
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
}
|
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(3)), dp(n, vector<int>(3, INT_MIN));
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++)
cin >> a[i][j];
dp[0][0] = a[0][0];
dp[0][1] = a[0][1];
dp[0][2] = a[0][2];
for (int i = 1; i < n; i++)
for (int j = 0; j < 3; j++)
for (int k = 0; k < 3; k++)
if (j != k)
dp[i][j] = max(dp[i][j], dp[i - 1][k] + a[i][j]);
cout << max(dp[n - 1][0], max(dp[n - 1][1], dp[n - 1][2]));
}
|
insert
| 5 | 5 | 5 | 6 |
-11
| |
p03162
|
C++
|
Time Limit Exceeded
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define mp make_pair
#define ff first
#define ss second
#define MAXN 100005
#define endl "\n"
using namespace std;
ll n, a, b, c;
vector<int> v[3];
ll dp[MAXN][4];
ll rec(int i, int p) {
if (i == n)
return 0;
ll ans = 0;
for (int h = 0; h < 3; h++) {
if (h != p) {
ans = max(ans, rec(i + 1, h) + v[h][i]);
}
}
// cout<<i<<" "<<p<<" "<<ans<<endl;
return dp[i][p] = ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> a >> b >> c;
v[0].pb(a);
v[1].pb(b);
v[2].pb(c);
}
memset(dp, -1, sizeof(dp));
ll ans = max(rec(0, 0), rec(0, 1));
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define mp make_pair
#define ff first
#define ss second
#define MAXN 100005
#define endl "\n"
using namespace std;
ll n, a, b, c;
vector<int> v[3];
ll dp[MAXN][4];
ll rec(int i, int p) {
if (i == n)
return 0;
if (dp[i][p] != -1)
return dp[i][p];
ll ans = 0;
for (int h = 0; h < 3; h++) {
if (h != p) {
ans = max(ans, rec(i + 1, h) + v[h][i]);
}
}
// cout<<i<<" "<<p<<" "<<ans<<endl;
return dp[i][p] = ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> a >> b >> c;
v[0].pb(a);
v[1].pb(b);
v[2].pb(c);
}
memset(dp, -1, sizeof(dp));
ll ans = max(rec(0, 0), rec(0, 1));
cout << ans;
return 0;
}
|
insert
| 16 | 16 | 16 | 18 |
TLE
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
// cin >> t;
while (t--) {
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(3));
long long temp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> temp;
arr[i][j] = temp;
}
}
long long dp[10001][3];
for (int i = 0; i < n; i++) {
dp[0][i] = arr[0][i];
}
int k;
temp = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
k = i - 1;
temp = 0;
for (int p = 0; p < 3; p++) {
if (p != j && dp[k][p] > temp)
temp = dp[k][p];
}
dp[i][j] = arr[i][j] + temp;
}
}
long long ans = 0;
for (int i = 0; i < 3; i++) {
if (dp[n - 1][i] > ans)
ans = dp[n - 1][i];
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
// cin >> t;
while (t--) {
int n;
cin >> n;
vector<vector<int>> arr(n, vector<int>(3));
long long temp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> temp;
arr[i][j] = temp;
}
}
long long dp[100001][3];
for (int i = 0; i < n; i++) {
dp[0][i] = arr[0][i];
}
int k;
temp = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < 3; j++) {
k = i - 1;
temp = 0;
for (int p = 0; p < 3; p++) {
if (p != j && dp[k][p] > temp)
temp = dp[k][p];
}
dp[i][j] = arr[i][j] + temp;
}
}
long long ans = 0;
for (int i = 0; i < 3; i++) {
if (dp[n - 1][i] > ans)
ans = dp[n - 1][i];
}
cout << ans << endl;
}
}
|
replace
| 17 | 18 | 17 | 18 |
0
| |
p03162
|
C++
|
Runtime Error
|
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int INF = 1000000000;
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>> dp(N, vector<int>(3, 0));
for (int i = 0; i < N; i++) {
dp[i + 1][0] = a[i] + max(dp[i][1], dp[i][2]);
dp[i + 1][1] = b[i] + max(dp[i][0], dp[i][2]);
dp[i + 1][2] = c[i] + max(dp[i][0], dp[i][1]);
}
cout << max({dp[N][0], dp[N][1], dp[N][2]}) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long LL;
typedef pair<LL, LL> P;
const LL mod = 1e9 + 7;
const LL LINF = 1LL << 62;
const int INF = 1000000000;
int main() {
int N;
cin >> N;
vector<int> a(N), b(N), c(N);
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>> dp(N + 1, vector<int>(3, 0));
for (int i = 0; i < N; i++) {
dp[i + 1][0] = a[i] + max(dp[i][1], dp[i][2]);
dp[i + 1][1] = b[i] + max(dp[i][0], dp[i][2]);
dp[i + 1][2] = c[i] + max(dp[i][0], dp[i][1]);
}
cout << max({dp[N][0], dp[N][1], dp[N][2]}) << endl;
return 0;
}
|
replace
| 22 | 23 | 22 | 23 |
-11
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.