Submission #1107207

#TimeUsernameProblemLanguageResultExecution timeMemory
1107207ozner77Traffic (IOI10_traffic)C++17
0 / 100
1 ms4432 KiB
#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=0;
    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;
        }
    }
    res=res+1;
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...