제출 #377696

#제출 시각아이디문제언어결과실행 시간메모리
377696AlexRex0Traffic (IOI10_traffic)C++14
0 / 100
1 ms364 KiB
#include "traffic.h" #include <bits/stdc++.h> using namespace std; int LocateCentre(int N, int pp[], int S[], int D[]) { int res = 0; long long int menor = 2000000000000001; long long int a[1000002]; for(int i = 1; i <= N; ++i){ a[i] = pp[i - 1] + a[i - 1]; } for(int i = 2; i < N; ++i){ long long int aux = a[N] - a[i]; long long int aux2 = a[i - 1]; aux = max(aux, aux2); if(aux < menor){ menor = aux; res = i; } } long long int aux = 0; aux = a[N] - a[1]; if(aux < menor){ menor = aux; res = 1; } aux = a[N - 1]; if(aux < menor){ menor = aux; res = N - 1; } res--; return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...