제출 #481618

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481618		ssense	Traffic (IOI10_traffic)	C++14	50 / 100	244 ms	29732 KiB

traffic

#include <bits/stdc++.h>
#include "traffic.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
//																																					int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//ssense

int LocateCentre(int n, int p[], int s[], int d[])
{
	ll sum1 = 0;
	for(ll i = 1; i < n; i++)
	{
		sum1 += 1LL*p[i];
	}
	ll sum2 = 0LL;
	long long ans = 2000000001;
	int node = 0;
	for(ll i = 0; i < n; i++)
	{
		ll now = max(sum2, sum1);
		if(now < ans)
		{
			node = (int)i;
		}
		ans = min(ans, now);
		if(i == 1LL*(n-1))
		{
			break;
		}
		sum2+=(ll)p[i];
		sum1-=(ll)p[i+1];
	}
	return node;
}
/*
 
 */

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25