# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19033 | suhgyuho_william | Rail (IOI14_rail) | C++98 | 201 ms | 892 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 <stdio.h>
using namespace std;
int dis0[5010];
int disx[5010];
int bef[5010],next[5010];
int op[5010],num[5010];
bool cmp(int x,int y){
return dis0[x] < dis0[y];
}
bool cmp2(int x,int y){
return disx[x] < disx[y];
}
void findLocation(int N, int first, int location[], int stype[]){
int i,j,k;
int small,x;
int t,v,nv;
int rear,tmp;
location[0] = first; stype[0] = 1;
small = 999999999;
for(i=1; i<N; i++){
dis0[i] = getDistance(0,i);
if(small > dis0[i]){
small = dis0[i];
x = 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... |