| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1210951 | arielcruz2 | Traffic (IOI10_traffic) | C++20 | 166 ms | 12004 KiB | 
#include "traffic.h"
int LocateCentre(int N, int pp[], int S[], int D[]) {
   int min=0,izq=0,cont=0;
   for(int i=0;i<N;i++){
      min+=pp[i];
   }
   for(int i=0;i<N;i++){
      izq+=pp[i];
      min-=pp[i];
      if(izq>min){
         return i;
      }
      cont=i;
   }
   return cont;
}
| # | 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... | ||||
