# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1210921 | cuenta_verdadera | Traffic (IOI10_traffic) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
int LocateCentre(int N, int pp[], int S[], int D[]) {
int c=0,m=1e9,s=0;
for(int i=0; i<=N; i++) {
s+=pp[i];
}
for(int i=0; i<=N; i++) {
int r=s-pp[i];
if(r<m){
m=r;
c=i+1;
}
}
return c;
}
# | 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... |