Submission #557643

# Submission time Handle Problem Language Result Execution time Memory
557643 2022-05-05T17:04:46 Z ojoConmigo Traffic (IOI10_traffic) C++17
0 / 100
1 ms 212 KB
#include "traffic.h"

int LocateCentre(int N, int pp[], int S[], int D[]) {
   long long pre[N];
   pre[0] = pp[0];
   for(int i=1; i<N; i++){
      pre[i] = pre[i-1] + pp[i];
   }
   int sol = -1;
   long long congestion = 1e18;
   for(int i=0; i<N; i++){
      long long mayor = (pre[i] - pp[i] > pre[N-1] - pre[i] ? pre[i] - pp[i] : pre[N-1] - pre[i]);
      if(mayor < congestion){
         mayor = congestion;
         sol = i;
      }
   }
   return sol;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -