Submission #1207353

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207353		wazj2024	Traffic (IOI10_traffic)	C++20	0 / 100	0 ms	320 KiB

traffic

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int LocateCentre(int N, int pp[], int S[], int D[]) {
    int bestCity = -1;
    int minMaxCongestion = 2000000;
    for (int i = 0; i < N; i++) {
        int maxCongestion = 0;
        for (int i = 0; i < N; i++) {
            if (i != i) {
                int pathCongestion = pp[i];
                maxCongestion = max(maxCongestion, pathCongestion);
            }
        }
        if (maxCongestion<minMaxCongestion) {
            minMaxCongestion=maxCongestion;
            bestCity=i;
        }
    }

    return bestCity;
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25