| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1207290 | Dpika | Traffic (IOI10_traffic) | C++20 | 0 ms | 776 KiB |
#include "traffic.h"
#include <bits/stdc++.h>
int LocateCentre(int N, int pp[], int S[], int D[]) {
long long v=0;
for(int i=0;i<N;i++){
v=v+pp[i];
}
long long xd=2e9+1;
long long c;
int Bv;
for(int i=0;i<N;i++){
c=v-pp[i];
if(c<xd){
xd=c;
Bv=i;
}
}
return Bv;
}
| # | 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... | ||||
