Submission #2740007


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;
	int a[210000]={0};
	for(int i=0;i<n;i++) cin>>a[i];

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

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

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

		cout<< mins <<endl;
	}
	
	return 0;
}

Submission Info

Submission Time
Task C - Splitting Pile
User iketyun08
Language C++14 (GCC 5.4.1)
Score 0
Code Size 516 Byte
Status WA
Exec Time 78 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 7
WA × 9
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 1024 KB
00_example_02.txt AC 2 ms 1024 KB
01.txt WA 39 ms 1024 KB
02.txt WA 15 ms 1024 KB
03.txt AC 13 ms 1024 KB
04.txt WA 50 ms 1024 KB
05.txt WA 12 ms 1024 KB
06.txt WA 78 ms 1024 KB
07.txt WA 78 ms 1024 KB
08.txt WA 78 ms 1024 KB
09.txt WA 78 ms 1024 KB
10.txt WA 76 ms 1024 KB
11.txt AC 2 ms 1024 KB
12.txt AC 2 ms 1024 KB
13.txt AC 55 ms 1024 KB
14.txt AC 2 ms 1024 KB