Submission #1207320

#TimeUsernameProblemLanguageResultExecution timeMemory
1207320Vale_sTraffic (IOI10_traffic)C++17
0 / 100
0 ms328 KiB
#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;

int LocateCentre(int N, int p[], int S[], int D[]) {
   if (N==1){
      return 0;
   }
   else if(N==2){
      int m=max(p[0],p[1]);
      return m;
   }
   else{
      int s=0;
      int ls[N];
      for(int i=0;i<N;i++){
         s+=p[i];
         ls[i]=s;
      }
      if (p[0]>=s-p[0]){
         return 0;
      }
      else if (p[N-1]>=s-p[N-1]){
         return N-1;
      }
      
      else{
         int sd,si,c,m;
         int mnabs=1000000;
         for(int i=1;i<N-1;i++){
            c=p[i];
            si=ls[i-1];
            sd=ls[N-1]-ls[i];
            if(abs(si-sd)<mnabs){
               mnabs=abs(si-sd);
               m=i;
            }
            if (c>=si-sd){
               m=i;
            }
        }
         return m;

      }  
   }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...