Submission #3245008


Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<functional>
#include<utility>
#include<stack>
#include<queue>
#include<cmath>
#include<list>
#include<cstdint>
#include<vector>
#include<map>
#include<deque>
#define rep(i,rept)	for(ll i = 0; i<(ll)rept;++i)
typedef long long ll;
using namespace std;


int main() {
	//22日目 
	int n = 0, F = 0;
	vector<int> a;
	int sum[200000] = {};
	cin >> n;
	rep(i, n) {
		cin >> F;
		a.push_back(F);
	}
	rep(i, n) {
		if (i == 0) {
			sum[i] = a[i];
		}
		else {
			sum[i] = a[i] + sum[i - 1];
		}
	}
	int umaru = 0, b = 0, c = 0, d = 0;
	d = 99999999999;
	rep(i, n) {
		umaru = sum[i];
		b = sum[n - 1] - sum[i];
		c = std::abs(umaru - b);
		d = min(d, c);
	}
	cout << d << endl;
	return 0;
}

Submission Info

Submission Time
Task C - Splitting Pile
User hinamel
Language C++14 (GCC 5.4.1)
Score 0
Code Size 795 Byte
Status WA
Exec Time 63 ms
Memory 2168 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:4: warning: overflow in implicit constant conversion [-Woverflow]
  d = 99999999999;
    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 1
WA × 1
AC × 3
WA × 13
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 1024 KB
00_example_02.txt WA 1 ms 1024 KB
01.txt WA 32 ms 1660 KB
02.txt WA 13 ms 1408 KB
03.txt AC 10 ms 1280 KB
04.txt WA 41 ms 1660 KB
05.txt WA 10 ms 1280 KB
06.txt WA 63 ms 2168 KB
07.txt WA 62 ms 2168 KB
08.txt WA 62 ms 2168 KB
09.txt WA 63 ms 2168 KB
10.txt WA 63 ms 2168 KB
11.txt WA 1 ms 1024 KB
12.txt AC 2 ms 1024 KB
13.txt WA 48 ms 2168 KB
14.txt WA 1 ms 1024 KB