# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774005 | boris_mihov | Rail (IOI14_rail) | C++17 | 44 ms | 476 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 "rail.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
typedef long long llong;
const int MAXN = 100000 + 10;
const int INF = 1e9;
int n;
int distA[MAXN];
int distB[MAXN];
std::vector <int> cPos;
std::vector <int> dPos;
std::vector <std::pair <int,int>> cQuery;
int myDist(int u, int v)
{
return getDistance(u - 1, v - 1);
}
void findLocation(int N, int first, int location[], int stype[])
{
n = N;
for (int i = 2 ; i <= n ; ++i)
{
distA[i] = myDist(1, i);
}
Compilation message (stderr)
# | 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... |