제출 #1346712

#제출 시각아이디문제언어결과실행 시간메모리
1346712frogrammerTraffic (IOI10_traffic)C++20
0 / 100
0 ms356 KiB
#include "traffic.h"
#include <bits/stdc++.h>
using namespace std;

int LocateCentre(int N, int P[], int S[], int D[]) {
    vector<long long> suma(N);
    suma[0] = P[0];
    for(int i=1;i<N;i++) suma[i] = suma[i-1] + P[i];
    
    long long minRoad = suma[N-1]-P[0];
    int idx = 0;
    for(int i=1;i<N-1;i++){
        long long road = max(suma[i-1],suma[N-1]-suma[i]);
        if(road<minRoad){
            minRoad = road;
            idx = i;
        }
    }
    return idx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...