Submission #1207203

#TimeUsernameProblemLanguageResultExecution timeMemory
1207203adriines06Traffic (IOI10_traffic)C++20
50 / 100
165 ms23816 KiB
#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;
int LocateCentre(int N, int pp[], int S[], int D[]) {
   vector<int>p(N);
   for(int i=0;i<N;i++){
      p[i]=pp[i];
   }

   vector<int>izq(N+1),der(N+1);
   izq[0]=der[0]=0;
   for(int i=0;i<N;i++){
      izq[i+1]=p[i]+izq[i];
   }
   reverse(p.begin(),p.end());
   for(int i=0;i<N;i++){
      der[i+1]=p[i]+der[i];
   }

   for(int i=0;i<=N;i++){
      //cout<<izq[i]<<" ";
   }
   //cout<<"\n";
   for(int i=0;i<=N;i++){
      //cout<<der[i]<<" ";
   }

   int mini=2e9+5,ans;
   for(int i=0;i<N;i++){
      int a,b,m;
      a=izq[i];
      b=der[N-i-1];
      //cout<<i<<" "<<a<<" "<<b<<"\n";
      m=max(a,b);
      if(m<mini){
         mini=m;
         ans=i;
      }
      
   }

   return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...