# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971552 | 2024-04-29T00:02:53 Z | alo_54 | Traffic (IOI10_traffic) | C++14 | 1 ms | 4472 KB |
#include "traffic.h" #include <bits/stdc++.h> using namespace std; int LocateCentre(int N, int P[], int S[], int D[]) { int sumR = 0, sumL = 0; for (int i = 1; i < N; i++) { sumR += P[i]; } int minW = sumR, maxL = -1, idxOpt = 0; for (int i = 1; i < N; i++) { sumL += P[i -1]; sumR -= P[i]; maxL = max(sumL, sumR); if (maxL < minW) { idxOpt = i; minW = maxL; } } return minW; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Incorrect | 1 ms | 4472 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Incorrect | 1 ms | 4472 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Incorrect | 1 ms | 4472 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Incorrect | 1 ms | 4472 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |