#include <bits/stdc++.h>
#include "traffic.h"
using namespace std;
vector<long> s;
void sum(int N, int pp[])
{
s.resize(N+1);
s[0]=0;
for(long i=0;i<N;i++)
s[i+1]=s[i]+pp[i];
}
int LocateCentre(int N, int pp[], int S[], int D[]) {
long mn=1e9,c;
int pos;
sum(N,pp);
for(int i=0;i<N;i++)
{
c=mn, mn=min(mn,(max(s[i+1]-pp[i],s[N]-s[i+1])));
if(c!=mn) pos=i;
}
return pos;
}
# | 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... |