Submission #1200237

#TimeUsernameProblemLanguageResultExecution timeMemory
1200237brover29Volontiranje (COCI21_volontiranje)C++17
0 / 110
11 ms23872 KiB
#include <bits/stdc++.h> //qwerty47924692 using namespace std; using ll = int; const ll N=1e6+29; const string br="617283"; #define sz(a)(ll)a.size() #define f first #define s second ll n,k,a[N],b[N],mx; vector<ll>q[N]; ll ptr[N]; vector<vector<ll>>ans; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n; for(ll i=1;i<=n;i++){ cin>>a[i]; ll j=lower_bound(b,b+mx+1,a[i])-b; if(j==mx+1){ mx++; b[mx]=a[i]; q[j].push_back(i); }else{ b[j]=a[i]; q[j].push_back(i); } } while(ptr[1]<q[1].size()){ ll v=1; ll i=q[v][ptr[v]]; // cout<<i<<' '<<v<<'\n'; ptr[v]++; vector<ll>b; b.push_back(i); ll check=1; while(v!=mx){ v++; if(ptr[v]==q[v].size()){ check=0; break; } while(q[v][ptr[v]]<i){ ptr[v]++; }if(a[q[v][ptr[v]]]<a[i]){ v--; if(q[v].size()==ptr[v]){ check=0; break; } i=q[v][ptr[v]]; // cout<<i<<' '<<v<<'\n'; ptr[v]++; b.pop_back(); b.push_back(i); continue; } i=q[v][ptr[v]]; // cout<<i<<' '<<v<<'\n'; ptr[v]++; b.push_back(i); }if(!check)break; ans.push_back(b); } cout<<ans.size()<<' '<<mx<<'\n'; for(auto vv:ans){ sort(vv.begin(),vv.end()); for(ll i:vv){ cout<<i<<' '; } cout<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...