제출 #1063532

#제출 시각아이디문제언어결과실행 시간메모리
1063532YassirSalamaFish 2 (JOI22_fish2)C++17
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define int long long signed main(){ int n; cin>>n; vector<int> v(n); for(int i=0;i<n;i++){ cin>>v[i]; } int q; cin>>q; while(q--){ int t; cin>>t; if(t==1){ int i;cin>>i;i--; int x;cin>>x; v[i]=x; }else{ int ans=0; int l,r;cin>>l>>r,l--,r--; for(int i=l;i<=r;i++){ int s=v[i]; int a=i-1; int b=i+1; int c=1; while(true){ bool ok=true; if(a>=l&&s>=v[a]){ ok=false; s+=v[a];a--; c++; } if(b<=r&&s>=v[b]){ b++; s+=v[b]; c++; ok=0; } if(ok) break; } ans+=c==(r-l+1); } 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...