oj.uz

답안 #312144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
312144 2020-10-12T13:28:51 Z AmineTrabelsi Traffic (IOI10_traffic) C++17
0 / 100
 1 ms 384 KB 
#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;
	for(int i=1;i<=n;i++){
		res = min(res,max(sum[i-1],sum[n]-sum[i]));
	}
	return res;
	//   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;
}

*/

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -