Submission #2250000
Source Code Expand
#include <bits/stdc++.h> #define F first #define S second #define endl "\n" #define ll long long #define ii pair<int, int> using namespace std; ll arr[200100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for(int i = 0; i < n; i++) cin >> arr[i]; for(int i = 1; i < n; i++) arr[i] += arr[i - 1]; ll mini = (ll)(1e18); for(int i = 0; i < n - 1; i++) { ll temp = arr[n - 1] - 2 * arr[i]; if(temp < 0) temp *= -1; mini = min(mini, temp); } cout << mini; }
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | vjudge5 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 588 Byte |
Status | AC |
Exec Time | 21 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 | 11 ms | 1024 KB |
02.txt | AC | 5 ms | 512 KB |
03.txt | AC | 4 ms | 512 KB |
04.txt | AC | 14 ms | 1280 KB |
05.txt | AC | 4 ms | 512 KB |
06.txt | AC | 21 ms | 1792 KB |
07.txt | AC | 21 ms | 1792 KB |
08.txt | AC | 21 ms | 1792 KB |
09.txt | AC | 21 ms | 1792 KB |
10.txt | AC | 21 ms | 1792 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 18 ms | 1792 KB |
14.txt | AC | 1 ms | 256 KB |