Submission #592006

#TimeUsernameProblemLanguageResultExecution timeMemory
592006starchanNizin (COCI16_nizin)C++17
100 / 100
76 ms25852 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define in pair<int, int> #define f first #define s second #define pb push_back #define pob pop_back #define INF (int)1e17 #define MX (int)3e5+5 #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL) signed main() { fast(); int n; cin >> n; vector<int> a(n+1); vector<int> pref(n+1); vector<int> suff(n+1); for(int i = 1; i <= n; i++) cin >> a[i]; pref[1] = a[1]; suff[n] = a[n]; for(int i = 2; i <= n; i++) pref[i] = pref[i-1]+a[i]; for(int i = n-1; i >= 1; i--) suff[i] = suff[i+1]+a[i]; int l = 1; int r = n; int ans = 1; while(l < r) { if(pref[l] == suff[r]) { ans+=2; if(l+1 == r) ans--; l++; r--; continue; } if(pref[l] < suff[r]) l++; else r--; } cout << n-ans; 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...