Submission #88251

#	Time	Username	Problem	Language	Result	Execution time	Memory
88251		jasony123123	Nizin (COCI16_nizin)	C++11	100 / 100	75 ms	8456 KiB

nizin

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 Contest 2 Problem 3 *************************/

const int MAXN = 1000000;
int N;
ll A[MAXN];

int main() {
	io();
	cin >> N;
	if (N == 1) {
		cout << 0 << "\n";
		return 0;
	}
	FOR(i, 0, N) cin >> A[i];
	int i = 0, j = N - 1;
	ll sumi = A[i], sumj = A[j];
	int ans = 0;
	while (1) {
		if (i + 1 == j) {
			if (sumi == sumj) 
				ans += 2;
			else 
				ans++;
			break;
		}
		else if (i + 2 == j) {
			if (sumi == sumj) {
				ans += 3;
				break;
			}
			else if (sumi < sumj)
				sumi += A[++i];
			else  // sumi > sumj
				sumj += A[--j];
		}
		else {
			if (sumi == sumj) 
				ans += 2, sumi = A[++i], sumj = A[--j];
			else if (sumi < sumj)
				sumi += A[++i];
			else  // sumi > sumj
				sumj += A[--j];
		}
	}
	cout << N - ans << "\n";
	return 0;
}
/*
...
*/

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10