Submission #2740201


Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int INF = 1000000007;

int main(){
	int n; cin>>n;
	ll a[210000]={0};
	for(int i=0;i<n;i++) cin>>a[i];

	ll x=0,y=0;
	for(int i=0;i<n-1;i++){
		x += a[i];
	}
	y += a[n-1];

	//cout<<x<<" "<<y<<endl;

	if(n==2) cout<< abs(x - y) <<endl;

	else{
		ll mins=abs(x - y), d=0;
		for(int i=n-2;i>=1;i--){
			x -= a[i];
			y += a[i];
			d = abs(x - y);
			mins = min(mins, d);

			//cout<<x<<" "<<y<<endl<<endl;
		}

		cout<< mins <<endl;
	}

	return 0;
}

Submission Info

Submission Time
Task C - Splitting Pile
User iketyun08
Language C++14 (GCC 5.4.1)
Score 300
Code Size 587 Byte
Status AC
Exec Time 62 ms
Memory 1920 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 16
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 2 ms 1920 KB
00_example_02.txt AC 2 ms 1920 KB
01.txt AC 32 ms 1920 KB
02.txt AC 13 ms 1920 KB
03.txt AC 10 ms 1920 KB
04.txt AC 40 ms 1920 KB
05.txt AC 10 ms 1920 KB
06.txt AC 61 ms 1920 KB
07.txt AC 62 ms 1920 KB
08.txt AC 61 ms 1920 KB
09.txt AC 61 ms 1920 KB
10.txt AC 61 ms 1920 KB
11.txt AC 2 ms 1920 KB
12.txt AC 2 ms 1920 KB
13.txt AC 48 ms 1920 KB
14.txt AC 2 ms 1920 KB