Submission #2125819
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <utility> #include <iomanip> #include <functional> #include <queue> #include <stack> #include <cmath> #define INF 100000000 #define MOD 1000000007 using namespace std; int main(){ int N; cin >> N; long long sum=0; long long a[N]; for(int i=0; i<N; i++){ cin >> a[i]; sum+=a[i]; } long long m=abs(sum); long long s=0; for(int i=0; i<N-1; i++){ s+=a[i]; m=min(m,abs(s-(sum-s))); } cout << m << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | monptt |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 622 Byte |
Status | WA |
Exec Time | 69 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
01.txt | AC | 31 ms | 1024 KB |
02.txt | AC | 12 ms | 512 KB |
03.txt | AC | 10 ms | 512 KB |
04.txt | AC | 40 ms | 1280 KB |
05.txt | AC | 10 ms | 512 KB |
06.txt | AC | 61 ms | 1792 KB |
07.txt | AC | 61 ms | 1792 KB |
08.txt | AC | 62 ms | 1792 KB |
09.txt | AC | 65 ms | 1792 KB |
10.txt | AC | 69 ms | 1792 KB |
11.txt | WA | 1 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | WA | 48 ms | 1792 KB |
14.txt | WA | 1 ms | 256 KB |