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;
const int N = 105;
int ar[2][N];
void findLocation(int n, int first, int ans[], int type[])
{
type[0] = 1;
ans[0] = first;
int in = 1;
for (int i = 1; i < n; i++)
{
ar[0][i] = getDistance( 0, i );
if (ar[0][in] > ar[0][i])
in = i;
}
for (int i = 1; i < n; i++)
ar[1][i] = getDistance( in, i );
for (int i = 1; i < n; i++)
{
if ( i == in )
{
type[i] = 2;
ans[i] = first + ar[0][in];
continue;
}
if (ar[0][i] > ar[1][i])
{
type[i] = 1;
ans[i] = first + ar[0][in] - ar[1][i];
}
else
{
type[i] = 2;
ans[i] = first + ar[0][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... |