| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1207362 | wazj2024 | Traffic (IOI10_traffic) | C++20 | 0 ms | 324 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 a = -1;
int m = INT_MAX;
for (int i = 0; i < N; ++i) {
int c = 0;
for (int j = 0; j < N; ++j) {
if (j != i) {
c = max(c, P[j]);
}
}
if (c < m) {
m = c;
a = i;
}
}
return a;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
