Submission #1871517
Source Code Expand
#include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<climits> #include<iostream> #include<sstream> #include<utility> #include<map> #include<vector> #include<queue> #include<algorithm> #include<set> #include<stack> using namespace std; typedef long long ll; typedef pair<int,int>P; int N; vector<ll>A,S; int main() { cin>>N; for(int i=0;i<N;i++) { ll a; cin>>a; A.push_back(a); if(i==0)S.push_back(a); else S.push_back(S[i-1]+a); } ll r=abs(S[0]-(S[N-1]-S[0])); for(int i=0;i<N-1;i++) { r=min(r,abs(S[i]-(S[N-1]-S[i]))); } cout<<r<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Splitting Pile |
User | Iceman0 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 624 Byte |
Status | AC |
Exec Time | 65 ms |
Memory | 3564 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 | 33 ms | 2036 KB |
02.txt | AC | 13 ms | 1276 KB |
03.txt | AC | 10 ms | 892 KB |
04.txt | AC | 42 ms | 2412 KB |
05.txt | AC | 10 ms | 892 KB |
06.txt | AC | 65 ms | 3564 KB |
07.txt | AC | 64 ms | 3564 KB |
08.txt | AC | 64 ms | 3564 KB |
09.txt | AC | 64 ms | 3564 KB |
10.txt | AC | 65 ms | 3564 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | AC | 49 ms | 3564 KB |
14.txt | AC | 1 ms | 256 KB |