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 "traffic.h"
#include<bits/stdc++.h>
using namespace std ;
int LocateCentre(int N, int pp[], int S[], int D[]) {
int mx = 1e9 + 9 ;
mx = 0 ;
for(int i = 0 ; i < N ; i ++)
mx = max(mx , pp[i]);
for(int i = 0 ; i < N ; i ++)
if(mx == pp[i])return i ;
return N/2;
}
# | 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... |