Submission #862267

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
862267	2023-10-17T21:41:18 Z	AbdelmagedNour	Volontiranje (COCI21_volontiranje)	C++17	110 / 110	229 ms	86068 KB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	int a[n],lis[n]={};
	for(int i=0;i<n;i++)cin>>a[i];
	vector<int>dp;
	for(int i=0;i<n;i++){
		auto it=upper_bound(dp.begin(),dp.end(),a[i]);
		if(it==dp.end())dp.push_back(a[i]),lis[i]=dp.size();
		else *it=a[i],lis[i]=it-dp.begin()+1;
	}
	int mx=dp.size();
	vector<vector<int>>lvl(mx+1);
	for(int i=0;i<n;i++)lvl[lis[i]].push_back(i);
	for(int i=1;i<=mx;i++)reverse(lvl[i].begin(),lvl[i].end());
	vector<vector<int>>ans;
	vector<int>cur;
	while(!lvl[1].empty()||!cur.empty()){
		if(cur.empty())cur.push_back(lvl[1].back()),lvl[1].pop_back();
		else if(cur.size()==mx)ans.push_back(cur),cur.clear();
		else{
			int nxt=cur.size()+1;
			while(!lvl[nxt].empty()&&lvl[nxt].back()<cur.back())lvl[nxt].pop_back();
			if(!lvl[nxt].empty()&&a[lvl[nxt].back()]>a[cur.back()])cur.push_back(lvl[nxt].back()),lvl[nxt].pop_back();
			else cur.pop_back();
		}
	}
	cout<<ans.size()<<" "<<mx<<"\n";
	for(auto v:ans){
		for(auto x:v)cout<<x+1<<" ";
		cout<<"\n";
	}
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:27:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |   else if(cur.size()==mx)ans.push_back(cur),cur.clear();
      |           ~~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	1 ms	452 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	344 KB	Output is correct
29	Correct	1 ms	600 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	600 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	56 ms	5756 KB	Output is correct
48	Correct	58 ms	5976 KB	Output is correct
49	Correct	71 ms	8272 KB	Output is correct
50	Correct	133 ms	13908 KB	Output is correct
51	Correct	30 ms	3412 KB	Output is correct
52	Correct	196 ms	86068 KB	Output is correct
53	Correct	229 ms	75672 KB	Output is correct
54	Correct	171 ms	23104 KB	Output is correct
55	Correct	173 ms	23104 KB	Output is correct
56	Correct	1 ms	604 KB	Output is correct
57	Correct	102 ms	11348 KB	Output is correct
58	Correct	25 ms	2884 KB	Output is correct
59	Correct	22 ms	2648 KB	Output is correct
60	Correct	105 ms	11392 KB	Output is correct
61	Correct	67 ms	7536 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct

Submission #862267

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 60.0 / 60.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
60.0 / 60.0