| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1346712 | frogrammer | Traffic (IOI10_traffic) | C++20 | 0 ms | 356 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 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... | ||||
