Submission #1171205

#TimeUsernameProblemLanguageResultExecution timeMemory
1171205samiaBouquet (EGOI24_bouquet)C++20
0 / 100
41 ms3680 KiB
#include <bits/stdc++.h>
using namespace std;
vector<int>v;
vector<int>slm;




int main() {
int n;
cin>>n;

int x,y;
int r=n;
while(r--){
   
    cin>>x>>y;
     v.push_back(x);
            slm.push_back(y);

}
int tab[n];

tab[0]=1;
int t[n];
t[0]=1;
for(int so=1;so<n;so++){
t[so]=1;
tab[so]=0;
   if(v[so]==1 or v[so]==0){  
       if(so>=2){
           if(slm[so-2]<=1){
           t[so]+=tab[so-2];}
           
       }
     
     
   }
    if(v[so]==0){
        if(slm[so-1]==0){
         t[so]=max(t[so],tab[so-1]+1);}
    }
    
    
    if(so>=3){
    t[so]=max(t[so],tab[so-3]+1);}
    tab[so]=max(tab[so-1],t[so]);
}

sort(t,t+n);
cout<<t[n-1]<<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...