# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
280191 | SamAnd | 철로 (IOI14_rail) | C++17 | 86 ms | 632 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 <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 5003;
int n;
void findLocation(int N_, int first, int location[], int stype[])
{
n = N_;
int minu = N * 5;
int minx;
for (int x = 1; x < n; ++x)
{
int d = getDistance(0, x);
if (d < minu)
{
minu = d;
minx = x;
}
}
location[0] = first;
stype[0] = 1;
location[minx] = first + minu;
stype[minx] = 2;
for (int x = 0; x < n; ++x)
{
if (x == 0 || x == minx)
continue;
int d1 = getDistance(0, x);
int d2 = getDistance(minx, x);
if (d1 < d2)
{
location[x] = location[0] + d1;
stype[x] = 2;
}
else
{
location[x] = location[minx] - d2;
stype[x] = 1;
}
}
}
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... |