Submission #1063564

#TimeUsernameProblemLanguageResultExecution timeMemory
1063564YassirSalamaFish 2 (JOI22_fish2)C++17
0 / 100
4070 ms6484 KiB
#include<bits/stdc++.h> using namespace std; #define int long long const int maxn=1e5+100; bool visited[maxn]; int n; vector<int> v; void solve(int l,int r,int s){ if(l==r){ visited[l]=true; return; } if(s-v[l]>=v[l]){ solve(l+1,r,s-v[l]); } if(s-v[r]>=v[r]){ solve(l,r-1,s-v[r]); } } signed main(){ int n; cin>>n; v.resize(n); for(int i=0;i<n;i++){ cin>>v[i]; } int s=0; for(auto x:v) s+=x; solve(0,n-1,s); int q; cin>>q; while(q--){ int t,l,r; cin>>t>>l>>r; int ans=0; for(int i=0;i<n;i++) ans+=visited[i]; cout<<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...