Submission #3810958
Source Code Expand
// Header {{{ #include <bits/stdc++.h> using namespace std; template<typename T> using reversed_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T> >; typedef unsigned long long int ull; typedef long long int ll; #define rep(i,a,b) for (ll i=(a); i<(b); i++) typedef pair<ll,ll> PLL; // }}} signed main() { ll N,x=0,y=0,ans=1e10; cin>>N; vector<ll> v(N); rep(i,0,N){ cin>>v[i]; (i==0?x:y)+=v[i]; } ans=abs(x-y); rep(i,1,N-1){ x += v[i]; y -= v[i]; ans=min(ans, abs(x-y)); } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | bobuhiro11 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 634 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 | 32 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 | 62 ms | 1792 KB |
07.txt | AC | 62 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 |