| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1207316 | wazj2024 | Traffic (IOI10_traffic) | C++20 | 0 ms | 320 KiB |
#include "traffic.h"
#include <stdio.h>
#include <vector>
using namespace std;
int LocateCentre(int N, int pp[], int S[], int D[]) {
int total_pp=0;
for(int i=0;i<N-1;i++)
{
total_pp+=pp[i];
}
int maxtrafico=0;
int cuidad;
for(int i=0;i<N-1;i++)
{
if((total_pp-pp[i])>maxtrafico){
maxtrafico=total_pp-pp[i];
cuidad=i;
}
}
return cuidad;
}| # | 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... | ||||
