Submission #2119244
Source Code Expand
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:336777216")
using namespace std;
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define ldb ldouble
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;
int IT_MAX = 1 << 19;
int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;
#define szz(x) (int)(x).size()
#define rep(i, n) for(int i=0;i<n;i++)
#define Se second
#define Fi first
const int MX = 200005;
const int MM = 1000000007;
int N, M;
int D[MX];
ll S[MX];
int main()
{
scanf("%d", &N);
for(int i = 1; i <= N; i++) scanf("%d", D+i), S[i] = S[i-1] + D[i];
ll mn = 1e18;
for(int i = 1; i < N; i++){
mn = min(mn, abs(S[N] - S[i] * 2));
}
printf("%lld\n", mn);
}
Submission Info
Submission Time |
|
Task |
C - Splitting Pile |
User |
zigui |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1445 Byte |
Status |
AC |
Exec Time |
23 ms |
Memory |
2560 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:61:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &N);
^
./Main.cpp:62:68: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for(int i = 1; i <= N; i++) scanf("%d", D+i), S[i] = S[i-1] + D[i];
^
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 |
12 ms |
1408 KB |
02.txt |
AC |
5 ms |
640 KB |
03.txt |
AC |
4 ms |
640 KB |
04.txt |
AC |
15 ms |
1792 KB |
05.txt |
AC |
4 ms |
640 KB |
06.txt |
AC |
23 ms |
2560 KB |
07.txt |
AC |
23 ms |
2560 KB |
08.txt |
AC |
23 ms |
2560 KB |
09.txt |
AC |
23 ms |
2560 KB |
10.txt |
AC |
23 ms |
2560 KB |
11.txt |
AC |
1 ms |
256 KB |
12.txt |
AC |
1 ms |
256 KB |
13.txt |
AC |
20 ms |
2560 KB |
14.txt |
AC |
1 ms |
256 KB |