Submission #1209310

#TimeUsernameProblemLanguageResultExecution timeMemory
1209310wazj2024Traffic (IOI10_traffic)C++20
0 / 100
0 ms320 KiB
#include "traffic.h" #include <bits/stdc++.h> using namespace std; static int N, P[1000000], S[1000000], D[1000000]; int LocateCentre(int N, int P[], int S[], int D[]) { int maxPos = 0; for (int i = 0; i < N; ++i) { if (P[i] > P[maxPos]) { maxPos = i; } } sort(P, P + N); return maxPos+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...