Submission #980033

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
980033	2024-05-11T19:29:43 Z	logangd	Longest Trip (IOI23_longesttrip)	C++17	85 / 100	15 ms	856 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> longest_trip(int N, int D){
	vector<int> r1,r2,R;
	r1.push_back(0);
	for(int i=1;i<N;i++){
		vector<int>e1,e2,e3,e4;
		if(!r2.empty()){
			e1.push_back(r1.back());
			e2.push_back(r2.back());
			if(are_connected(e1,e2)){
				while(!r2.empty()){
					r1.push_back(r2.back());
					r2.pop_back();
				}
			}
		}
		e3.push_back(r1.back());
		e4.push_back(i);
		if(are_connected(e3,e4))r1.push_back(i);
		else r2.push_back(i);		
	}
	if(r2.empty())return r1;
	vector<int>e1,e2,e3,e4;
	e1.push_back(r1[0]);
	e2.push_back(r1.back());
	e3.push_back(r2[0]);
	e4.push_back(r2.back());
	if(1<r1.size()&&!are_connected(e1,e2)){
		if(are_connected(e1,e3))reverse(r1.begin(),r1.end());
		reverse(r2.begin(),r2.end());
		while(!r2.empty()){
			r1.push_back(r2.back());
			r2.pop_back();
		}
		return r1;
	}
	if(1<r2.size()&&!are_connected(e3,e4)){
		if(are_connected(e1,e3))reverse(r2.begin(),r2.end());
		reverse(r1.begin(),r1.end());
		while(!r1.empty()){
			r2.push_back(r1.back());
			r1.pop_back();
		}
		return r2;
	}
	else if(are_connected(r1,r2)){
		vector<int>t_1,t_2;
		for(auto i:r1)t_1.push_back(i);
		while(1<t_1.size()){
			vector<int>t1,t2;
			int p=0;
			for(auto i:t_1){
				if(p&1)t1.push_back(i);
				else t2.push_back(i);
				p++;
			}
			if(are_connected(t1,r2))swap(t_1,t1);
			else swap(t_1,t2);
		}
		for(auto i:r2)t_2.push_back(i);
		while(1<t_2.size()){
			vector<int>t1,t2;
			int p=0;
			for(auto i:t_2){
				if(p&1)t1.push_back(i);
				else t2.push_back(i);
				p++;
			}
			if(are_connected(t_1,t1))swap(t_2,t1);
			else swap(t_2,t2);
		}
		bool b=0;
		for(auto i:r1){
			if(b)R.push_back(i);
			if(i==t_1[0])b=1;
		}
		for(auto i:r1){
			R.push_back(i);
			if(i==t_1[0])break;
		}
		b=0;
		for(auto i:r2){
			if(i==t_2[0])b=1;
			if(b)R.push_back(i);
		}
		for(auto i:r2){
			if(i==t_2[0])break;
			R.push_back(i);
		}
		return R;
	}else if(r1.size()>r2.size())return r1;
	else return r2;
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	2 ms	600 KB	Output is correct

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	6 ms	600 KB	Output is correct
6	Correct	9 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	5 ms	432 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	344 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	5 ms	684 KB	Output is correct
6	Correct	9 ms	344 KB	Output is correct
7	Correct	7 ms	344 KB	Output is correct
8	Correct	6 ms	500 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	6 ms	436 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	11 ms	344 KB	Output is correct
15	Correct	12 ms	344 KB	Output is correct
16	Correct	11 ms	344 KB	Output is correct
17	Correct	9 ms	344 KB	Output is correct
18	Correct	7 ms	344 KB	Output is correct
19	Correct	7 ms	600 KB	Output is correct
20	Correct	7 ms	344 KB	Output is correct
21	Correct	11 ms	600 KB	Output is correct
22	Correct	6 ms	600 KB	Output is correct
23	Correct	7 ms	344 KB	Output is correct
24	Correct	6 ms	600 KB	Output is correct
25	Correct	9 ms	344 KB	Output is correct
26	Correct	14 ms	344 KB	Output is correct
27	Correct	9 ms	344 KB	Output is correct
28	Correct	8 ms	344 KB	Output is correct
29	Correct	8 ms	344 KB	Output is correct
30	Correct	8 ms	344 KB	Output is correct
31	Correct	10 ms	344 KB	Output is correct
32	Correct	10 ms	344 KB	Output is correct
33	Correct	11 ms	344 KB	Output is correct
34	Correct	10 ms	596 KB	Output is correct
35	Correct	10 ms	344 KB	Output is correct
36	Correct	7 ms	352 KB	Output is correct
37	Correct	12 ms	600 KB	Output is correct
38	Correct	10 ms	600 KB	Output is correct
39	Correct	11 ms	344 KB	Output is correct
40	Correct	10 ms	600 KB	Output is correct
41	Correct	10 ms	600 KB	Output is correct
42	Correct	10 ms	512 KB	Output is correct
43	Correct	10 ms	344 KB	Output is correct
44	Correct	12 ms	600 KB	Output is correct
45	Correct	12 ms	596 KB	Output is correct
46	Correct	12 ms	344 KB	Output is correct
47	Correct	10 ms	344 KB	Output is correct
48	Correct	8 ms	344 KB	Output is correct
49	Correct	9 ms	344 KB	Output is correct
50	Correct	8 ms	344 KB	Output is correct
51	Correct	11 ms	344 KB	Output is correct
52	Correct	13 ms	344 KB	Output is correct
53	Correct	8 ms	344 KB	Output is correct
54	Correct	9 ms	600 KB	Output is correct
55	Correct	11 ms	440 KB	Output is correct
56	Correct	6 ms	344 KB	Output is correct
57	Correct	11 ms	688 KB	Output is correct
58	Correct	12 ms	604 KB	Output is correct
59	Correct	11 ms	600 KB	Output is correct
60	Correct	12 ms	604 KB	Output is correct
61	Correct	11 ms	600 KB	Output is correct
62	Correct	10 ms	344 KB	Output is correct
63	Correct	12 ms	604 KB	Output is correct
64	Correct	11 ms	600 KB	Output is correct

Subtask #4

45.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	6 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	5 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	10 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	6 ms	344 KB	Output is correct
11	Correct	5 ms	600 KB	Output is correct
12	Correct	5 ms	600 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	15 ms	344 KB	Output is correct
15	Correct	11 ms	344 KB	Output is correct
16	Correct	11 ms	344 KB	Output is correct
17	Correct	8 ms	512 KB	Output is correct
18	Correct	7 ms	344 KB	Output is correct
19	Correct	8 ms	600 KB	Output is correct
20	Correct	9 ms	344 KB	Output is correct
21	Correct	10 ms	344 KB	Output is correct
22	Correct	11 ms	344 KB	Output is correct
23	Correct	10 ms	344 KB	Output is correct
24	Correct	10 ms	344 KB	Output is correct
25	Correct	9 ms	344 KB	Output is correct
26	Correct	8 ms	344 KB	Output is correct
27	Correct	9 ms	344 KB	Output is correct
28	Correct	11 ms	344 KB	Output is correct
29	Correct	8 ms	344 KB	Output is correct
30	Correct	7 ms	344 KB	Output is correct
31	Correct	10 ms	344 KB	Output is correct
32	Correct	11 ms	344 KB	Output is correct
33	Correct	10 ms	344 KB	Output is correct
34	Correct	9 ms	344 KB	Output is correct
35	Correct	9 ms	344 KB	Output is correct
36	Correct	11 ms	344 KB	Output is correct
37	Correct	8 ms	344 KB	Output is correct
38	Correct	10 ms	344 KB	Output is correct
39	Correct	10 ms	344 KB	Output is correct
40	Correct	9 ms	344 KB	Output is correct
41	Correct	10 ms	600 KB	Output is correct
42	Correct	9 ms	344 KB	Output is correct
43	Correct	8 ms	600 KB	Output is correct
44	Correct	6 ms	344 KB	Output is correct
45	Correct	6 ms	344 KB	Output is correct
46	Correct	6 ms	344 KB	Output is correct
47	Partially correct	8 ms	344 KB	Output is partially correct
48	Partially correct	9 ms	344 KB	Output is partially correct
49	Partially correct	9 ms	344 KB	Output is partially correct
50	Partially correct	11 ms	600 KB	Output is partially correct
51	Partially correct	9 ms	600 KB	Output is partially correct
52	Partially correct	10 ms	600 KB	Output is partially correct
53	Partially correct	8 ms	344 KB	Output is partially correct
54	Partially correct	12 ms	600 KB	Output is partially correct
55	Partially correct	11 ms	344 KB	Output is partially correct
56	Partially correct	9 ms	600 KB	Output is partially correct
57	Partially correct	9 ms	600 KB	Output is partially correct
58	Partially correct	12 ms	600 KB	Output is partially correct
59	Partially correct	9 ms	600 KB	Output is partially correct
60	Partially correct	8 ms	344 KB	Output is partially correct
61	Partially correct	9 ms	600 KB	Output is partially correct
62	Correct	6 ms	344 KB	Output is correct
63	Partially correct	9 ms	600 KB	Output is partially correct
64	Partially correct	10 ms	436 KB	Output is partially correct
65	Partially correct	10 ms	604 KB	Output is partially correct
66	Partially correct	13 ms	856 KB	Output is partially correct
67	Partially correct	10 ms	600 KB	Output is partially correct
68	Partially correct	9 ms	600 KB	Output is partially correct
69	Partially correct	10 ms	604 KB	Output is partially correct
70	Partially correct	10 ms	604 KB	Output is partially correct
71	Partially correct	10 ms	856 KB	Output is partially correct
72	Partially correct	9 ms	436 KB	Output is partially correct
73	Partially correct	9 ms	604 KB	Output is partially correct
74	Partially correct	9 ms	440 KB	Output is partially correct
75	Partially correct	9 ms	344 KB	Output is partially correct
76	Partially correct	9 ms	344 KB	Output is partially correct
77	Partially correct	9 ms	856 KB	Output is partially correct
78	Partially correct	11 ms	448 KB	Output is partially correct
79	Partially correct	10 ms	604 KB	Output is partially correct
80	Partially correct	12 ms	856 KB	Output is partially correct
81	Partially correct	9 ms	344 KB	Output is partially correct
82	Partially correct	10 ms	608 KB	Output is partially correct