Submission #1872474
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) FOR(i,0,n) #define pb push_back #define mp make_pair typedef long long ll; typedef pair<int,int> pint; int a[200001]; int main(){ int n; cin>>n; ll sum1=0,sum2=0; rep(i,n){ cin>>a[i]; sum2+=a[i]; } sum2-=a[0]; sum1+=a[0]; ll ans=abs(sum2-sum1); FOR(i,1,n-1){ sum1+=a[i]; sum2-=a[i]; ans=min(ans,abs(sum2-sum1)); } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | ts_ |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 568 Byte |
Status | AC |
Exec Time | 78 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | AC | 39 ms | 640 KB |
02.txt | AC | 15 ms | 384 KB |
03.txt | AC | 12 ms | 384 KB |
04.txt | AC | 50 ms | 768 KB |
05.txt | AC | 12 ms | 384 KB |
06.txt | AC | 77 ms | 1024 KB |
07.txt | AC | 76 ms | 1024 KB |
08.txt | AC | 78 ms | 1024 KB |
09.txt | AC | 76 ms | 1024 KB |
10.txt | AC | 78 ms | 1024 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | AC | 55 ms | 1024 KB |
14.txt | AC | 1 ms | 256 KB |