# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107205 | ozner77 | Traffic (IOI10_traffic) | C++17 | 1 ms | 4432 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 <traffic.h>
#include <bits/stdc++.h>
using namespace std;
int LocateCentre(int N, int P[], int S[], int D[]){
vector<long long> V;
vector<long long> V1;
V.push_back(P[0]);
V1.push_back(P[0]);
for(int i=1;i<N;i++){
V.push_back(V[i-1]+P[i]);
V1.push_back(P[i]);
}
long long minmax=10000000000;
long long res;
for(int i=0;i<N;i++){
long long a=V[N-1]-V[i];
long long b=V[i]-P[i];
long long c=max(a,b);
if(c<minmax){
minmax=c;
res=i;
}
}
return res+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... |