Submission #1422590
Source Code Expand
#include <iostream> #include <cmath> #define REP(i, a, n) for(int i = ((int) a); i < ((int) n); i++) #define INF (1LL << 60) using namespace std; typedef long long ll; int N; ll A[200000]; int main(void) { cin >> N; REP(i, 0, N) cin >> A[i]; ll sum = 0; REP(i, 0, N) sum += A[i]; ll s = 0; ll ans = INF; REP(i, 0, N - 1) { s += A[i]; ans = min(ans, abs(s - (sum - s))); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | kshinya |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 450 Byte |
Status | AC |
Exec Time | 62 ms |
Memory | 1792 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 | 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 | 62 ms | 1792 KB |
10.txt | AC | 62 ms | 1792 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | AC | 47 ms | 1792 KB |
14.txt | AC | 1 ms | 256 KB |