oj.uz

Submission #535878

# Submission time Handle Problem Language Result Execution time Memory
535878 2022-03-11T15:53:31 Z inksamurai Volontiranje (COCI21_volontiranje) C++17
50 / 110
 1000 ms 7952 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3HspL4A ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vec(int);
void print(){cout<<"\n";}
template<class T,class...E>
void print(const T&v,const E&...u){cout<<v<<' ',print(u...);}
// e 
 
signed main(){
_3HspL4A;
	int n;
	cin>>n;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	set<int> st;
	for(auto x:a){
		if(!sz(st)){
			st.insert(x);
		}else{
			auto it=st.lower_bound(x);
			if(it!=st.end()){
				st.erase(it);
			}
			st.insert(x);
		}
	}
	int len=sz(st);
	vi usd(n);
	vec(vi) pns;
	while(1){
		int n=sz(a),pok=0;
		vi dp(n);
		for(int i=0;i<n;i++){
			if(usd[i]) continue;
			dp[i]=1;
			for(int j=0;j<i;j++){
				if(usd[j]) continue;
				if(a[i]>a[j]){
					dp[i]=max(dp[i],dp[j]+1);
				}
			}
			if(dp[i]==len){
				pok=1;
				pns.pb({});
				int now=len,pj=i;
				while(1){
					int nj=-1,v=-1;
					for(int j=i;j>=0;j--){
						if(usd[j]) continue;
						if(dp[j]==now and a[pj]>=a[j]){
							if(a[j]>v){
								v=a[j];
								nj=j;
							}
						}
					}
					pns.back().pb(nj);
					pj=nj;
					now--;
					if(!now) break;
				}
				for(auto ids:pns.back()){
					usd[ids]=1;
				}
				break;
			}
		}
		if(!pok) break;
	}
	print(sz(pns),len);
	for(auto ids:pns){
		reverse(ids.begin(),ids.end());
		for(auto v:ids) cout<<v+1<<" ";
		print();
	}
//	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 320 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 324 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 13 ms 324 KB Output is correct
33 Correct 36 ms 356 KB Output is correct
34 Correct 35 ms 348 KB Output is correct
35 Correct 37 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 212 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 324 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 13 ms 324 KB Output is correct
33 Correct 36 ms 356 KB Output is correct
34 Correct 35 ms 348 KB Output is correct
35 Correct 37 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Execution timed out 1083 ms 7952 KB Time limit exceeded
48 Halted 0 ms 0 KB -