제출 #312145

#제출 시각아이디문제언어결과실행 시간메모리
312145AmineTrabelsiTraffic (IOI10_traffic)C++17
50 / 100
403 ms37752 KiB
#include "bits/stdc++.h" using namespace std; using ll = long long; #define pb push_back #define mp make_pair #define f first #define s second #define sz(x) ((int)x.size()) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() // Hi ll LocateCentre(int n,int p[],int ff[],int d[]){ // assuming all the cities are in straight line // s[i] = i , d[i] = i+1; vector<ll> sum(n+1,0); for(int i=0;i<n;i++){ sum[i+1] = sum[i]+p[i]; } ll res = 1e18; int city = 0; for(int i=1;i<=n;i++){ ll x = max(sum[i-1],sum[n]-sum[i]); if(x <= res){ city = i; res = x; } } return city-1; // 1 2 3 // 0 1 3 6 } /* int main(){ int p[5] = {10,10,10,20,20},s[4] = {0,1,2,3},d[4] = {1,2,3,4}; cout<<LocateCentre(5,p,s,d)<<'\n'; return 0; } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...