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;
void findLocation(int N, int first, int location[], int stype[])
{
location[0]=first;
stype[0]=1;
pair<int, int> mn={INT_MAX, 0};
for (int i=1; i<N; i++) location[i]=first+getDistance(0, i), stype[i]=2, mn=min(mn, {getDistance(0, i), i});
for (int i=1; i<N; i++)
{
if (i==mn.second) continue;
if (getDistance(mn.second, i)<getDistance(0, i)) stype[i]=1, location[i]=location[mn.second]-getDistance(mn.second, i);
}
}
# | 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... |