제출 #1235380

#제출 시각아이디문제언어결과실행 시간메모리
1235380islam_2010Traffic (IOI10_traffic)C++20
0 / 100
0 ms320 KiB
#include "traffic.h" #include <bits/stdc++.h> using namespace std; int LocateCentre(int n, int p[], int s[], int d[]){ vector<int> pref(n+1, 0), suff(n+1, 0); pref[0] = p[0]; suff[n-1] = p[n-1]; for(int i = 1; i < n; i++){ pref[i] += pref[i-1] + p[i]; } for(int j = n-2; j >= 0; j--){ suff[j] += suff[j+1] + p[j]; }int mn = INT_MAX; for(int i = 0; i < n; i++){ mn = min(mn, max(pref[i]-p[i], suff[i]-p[i])); }cout << mn << endl; }

컴파일 시 표준 에러 (stderr) 메시지

traffic.cpp: In function 'int LocateCentre(int, int*, int*, int*)':
traffic.cpp:18:1: warning: no return statement in function returning non-void [-Wreturn-type]
   18 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...