# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
717611 | qwerasdfzxcl | Fun Tour (APIO20_fun) | C++17 | 114 ms | 16092 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 "fun.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, cent, D[100100];
vector<int> V[4], ans;
int dist(int x, int y){
--x, --y;
return hoursRequired(x, y);
}
int query(int x, int y){
--x, --y;
return attractionsBehind(x, y);
}
void getCent(){
cent = 1;
for (int i=2;i<=n;i++) if (query(cent, i) * 2 > n){
cent = i;
}
}
void init(){
vector<int> X;
for (int i=1;i<=n;i++){
D[i] = dist(cent, i);
if (D[i]==1){
# | 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... |