Submission #735077

#	Time	Username	Problem	Language	Result	Execution time	Memory
735077		NemanjaSo2005	Mizuyokan 2 (JOI23_mizuyokan2)	C++14	0 / 100	188 ms	2252 KiB

mizuyokan2

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll N,Q,niz[250005];
/*
1 veci
-1 manji
*/
ll duzina(ll gde,ll duz,ll vp,ll tip,ll kraj){
   if(gde>kraj)
      return 0;
  // cout<<gde<<" "<<duz<<" "<<vp<<" "<<tip<<" "<<kraj<<endl;
   if((duz+niz[gde])*tip>vp*tip)
      return 1+duzina(gde+1,0,duz+niz[gde],tip*-1,kraj);
   if(tip==1)
      return duzina(gde+1,duz+niz[gde],vp,tip,kraj);
   else
      return duzina(gde+1,0,vp+niz[gde],tip,kraj);
}
int main(){
   cin>>N;
   for(int i=1;i<=N;i++)
      cin>>niz[i];
   cin>>Q;
   while(Q--){
      ll a,b,L,R;
      cin>>a>>b>>L>>R;
      L++;
      niz[a]=b;
      cout<<max(duzina(L,0,1e18,-1,R),duzina(L,0,-1e18,1,R))<<endl;
   }
   return 0;
}
/*
4
6 2 3 2
1
3 2 1 3
*/

• Subtask 1: 0 / 6
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 32
• Subtask 5: 0 / 29
• Subtask 6: 0 / 11