# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230968 | AlexLuchianov | Collecting Stamps 3 (JOI20_ho_t3) | C++14 | 1087 ms | 978700 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 200;
ll const inf = 2000000000;
ll v[5 + nmax], t[5 + nmax];
ll dp[5 + 2 * nmax][5 + 2 * nmax][5 + nmax][2];
int n;
ll extract(int x, int y, int val, int h){
if(val < 0)
return inf;
else
return dp[x][y][val][h];
}
ll dist(int x, int y){
return fabs(v[x] - v[y]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |