# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062872 | nvujica | Shortcut (IOI16_shortcut) | C++14 | 20 ms | 600 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 <bits/stdc++.h>
#include "shortcut.h"
#define ll long long
using namespace std;
const int maxn = 505;
const ll inf = (1LL << 60);
int n, c;
vector <int> l;
vector <int> d;
ll dpoc[maxn];
ll f(int a, int b){
ll maks = 0;
for(int x = 0; x < n; x++){
for(int y = x + 1; y < n; y++){
ll dxa = abs(dpoc[x] - dpoc[a]);
ll dxb = abs(dpoc[x] - dpoc[b]);
ll dya = abs(dpoc[y] - dpoc[a]);
ll dyb = abs(dpoc[y] - dpoc[b]);
ll dxy = abs(dpoc[x] - dpoc[y]);
dxa = min(dxa, dxb + c);
dxb = min(dxb, dxa + c);
dya = min(dya, dyb + c);
dyb = min(dyb, dya + c);
// maks = max(maks, dxy + d[x] + d[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... |
# | 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... |