제출 #1136802

#제출 시각아이디문제언어결과실행 시간메모리
1136802toast12Nizin (COCI16_nizin)C++20
100 / 100
96 ms12100 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) cin >> a[i]; vector<int> pref(1), suff(1); for (int i = 0; i < n; i++) { pref.push_back(pref[i]+a[i]); suff.push_back(suff[i]+a[n-i-1]); } reverse(suff.begin()+1, suff.end()); int p = 1, s = n; int ans = 0; while (p < s) { if (pref[p] == suff[s]) p++, s--; else { if (pref[p] < suff[s]) p++; else s--; ans++; } } cout << ans << '\n'; return 0; }
#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...