제출 #1207316

#제출 시각아이디문제언어결과실행 시간메모리
1207316wazj2024Traffic (IOI10_traffic)C++20
0 / 100
0 ms320 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...