제출 #1173944

#제출 시각아이디문제언어결과실행 시간메모리
1173944nuutsnoyntonNizin (COCI16_nizin)C++20
0 / 100
545 ms119756 KiB
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
map < ll, ll > mp;
int main() {
	ll n, m, r, x, s, y, i, j, ans, t;

	cin >> n;
	
	ll a[n + 2];
	
	s = 0;
	for (i = 1; i <= n; i++) {
		cin >> a[i];
		s += a[i];
		mp[s]= i;
	}
	s = 0;
	ans =0;
	for (i = n; i >= 1; i --) {
		s += a[i];
		if (mp[s] != 0 &&  mp[s] < i) {
			ans += mp[s];
		}
	}
	cout <<n -  ans << endl;
	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...