답안 #939830

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939830	2024-03-06T19:35:41 Z	jamjanek	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	14 ms	1052 KB

longesttrip

#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
bool czy[300];
vector<int>polacz(vector<int>a, vector<int>b){
	while(b.size()){
		a.push_back(b.back());
		b.pop_back();
	}
	return a;
}
vector<int>prefix(vector<int>A, int ile){
    while((int)A.size()>ile)A.pop_back();
    return A;
}
vector<int> longest_trip(int n, int d)
{
	int i;
	vector<int>tab[2];tab[0].push_back(0);tab[1].push_back(1);
	for(i=1;i<n/2;i++){
		int a = i*2, b = i*2+1;
		if(are_connected({a}, {b})){
			if(are_connected({a}, {tab[0].back()})){
				tab[0].push_back(a);
				tab[0].push_back(b);
			}
			else if(are_connected({a}, {tab[1].back()})){
				tab[1].push_back(a);
				tab[1].push_back(b);				
			}
			else{
				while(tab[1].size()){
					tab[0].push_back(tab[1].back());
					tab[1].pop_back();
				}
				tab[1].push_back(a);
				tab[1].push_back(b);
			}
		}
		else{
			if(are_connected({a}, {tab[0].back()})){
				tab[0].push_back(a);
				if(are_connected({b}, {tab[1].back()}))
					tab[1].push_back({b});
				else{
					while(tab[1].size()){
						tab[0].push_back(tab[1].back());
						tab[1].pop_back();
					}
					tab[1].push_back(b);
				}
			}
			else{
				tab[0].push_back(b);
				if(are_connected({a}, {tab[1].back()}))
					tab[1].push_back({a});
				else{
					while(tab[1].size()){
						tab[0].push_back(tab[1].back());
						tab[1].pop_back();
					}
					tab[1].push_back(a);
				}
			}
		}
	}
	if(n%2){
		if(are_connected({n-1}, {tab[0].back()}))
			tab[0].push_back(n-1);
		else if(are_connected({n-1}, {tab[1].back()}))
			tab[1].push_back(n-1);
		else{
			while(tab[1].size()){
				tab[0].push_back(tab[1].back());
				tab[1].pop_back();
			}
			tab[1].push_back(n-1);			
		}
	}
	
	if(tab[0].size()==0)return tab[1];
	if(tab[1].size()==0)return tab[0];

	if(!are_connected(tab[0], tab[1])){
    	if(tab[0].size()>=tab[1].size())return tab[0];
    	return tab[1];
	}
	

	if(are_connected({tab[0].back()}, {tab[1].back()})){
		tab[0] = polacz(tab[0], tab[1]);
		tab[1].clear();
	}
	else if(are_connected({tab[0].back()}, {tab[1][0]})){
		reverse(tab[1].begin(), tab[1].end());
		tab[0] = polacz(tab[0], tab[1]);
		tab[1].clear();
	}
	else if(are_connected({tab[0][0]}, {tab[1].back()})){
		reverse(tab[0].begin(), tab[0].end());
		tab[0] = polacz(tab[0], tab[1]);
		tab[1].clear();
	}
	else if(are_connected({tab[0][0]}, {tab[1][0]})){
		reverse(tab[0].begin(), tab[0].end());
		reverse(tab[1].begin(), tab[1].end());
		tab[0] = polacz(tab[0], tab[1]);
		tab[1].clear();
	}
	if(tab[1].size()==0)return tab[0];



	int pocz=1, kon = tab[0].size(), srodek;
	while(pocz<kon){
	    srodek = (pocz+kon)/2;
	    if(are_connected(prefix(tab[0], srodek), tab[1]))
	        kon = srodek;
		else
			pocz = srodek+1;
	}



	vector<int>pom;
	for(i=kon;i<(int)tab[0].size();i++)
	    pom.push_back(tab[0][i]);
	for(i=0;i<kon;i++)
	    pom.push_back(tab[0][i]);
    tab[0] = pom;


    
	pocz=1, kon = tab[1].size();
	while(pocz<kon){
	    srodek = (pocz+kon)/2;
	    if(are_connected(prefix(tab[1], srodek), {tab[0].back()}))
	        kon = srodek;
	   else
	        pocz = srodek+1;
	}
	pom.clear();
	for(i=kon;i<(int)tab[1].size();i++)
	    pom.push_back(tab[1][i]);
	for(i=0;i<kon;i++)
	    pom.push_back(tab[1][i]);
    tab[1] = pom;


	while(tab[1].size()){
	    tab[0].push_back(tab[1].back());
	    tab[1].pop_back();
	}
	return tab[0];	
}

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	2 ms	344 KB	Output is correct

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 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	4 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	340 KB	Output is correct
2	Correct	5 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	5 ms	600 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	600 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	604 KB	Output is correct
11	Correct	5 ms	604 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	4 ms	1052 KB	Output is correct

Subtask #3

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	5 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	14 ms	344 KB	Output is correct
7	Correct	6 ms	344 KB	Output is correct
8	Correct	4 ms	600 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	440 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	440 KB	Output is correct
14	Correct	6 ms	344 KB	Output is correct
15	Correct	8 ms	344 KB	Output is correct
16	Correct	7 ms	344 KB	Output is correct
17	Correct	5 ms	852 KB	Output is correct
18	Correct	6 ms	436 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	6 ms	604 KB	Output is correct
21	Correct	5 ms	440 KB	Output is correct
22	Correct	5 ms	440 KB	Output is correct
23	Correct	6 ms	440 KB	Output is correct
24	Correct	5 ms	856 KB	Output is correct
25	Correct	8 ms	344 KB	Output is correct
26	Correct	8 ms	344 KB	Output is correct
27	Correct	6 ms	344 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	5 ms	344 KB	Output is correct
31	Correct	7 ms	344 KB	Output is correct
32	Correct	6 ms	344 KB	Output is correct
33	Correct	5 ms	344 KB	Output is correct
34	Correct	5 ms	344 KB	Output is correct
35	Correct	5 ms	344 KB	Output is correct
36	Correct	4 ms	344 KB	Output is correct
37	Correct	5 ms	344 KB	Output is correct
38	Correct	5 ms	344 KB	Output is correct
39	Correct	5 ms	344 KB	Output is correct
40	Correct	6 ms	344 KB	Output is correct
41	Correct	6 ms	344 KB	Output is correct
42	Correct	6 ms	344 KB	Output is correct
43	Correct	6 ms	344 KB	Output is correct
44	Correct	6 ms	344 KB	Output is correct
45	Correct	8 ms	344 KB	Output is correct
46	Correct	9 ms	344 KB	Output is correct
47	Correct	7 ms	344 KB	Output is correct
48	Correct	7 ms	344 KB	Output is correct
49	Correct	7 ms	344 KB	Output is correct
50	Correct	5 ms	344 KB	Output is correct
51	Correct	7 ms	344 KB	Output is correct
52	Correct	7 ms	344 KB	Output is correct
53	Correct	5 ms	344 KB	Output is correct
54	Correct	6 ms	344 KB	Output is correct
55	Correct	6 ms	344 KB	Output is correct
56	Correct	6 ms	600 KB	Output is correct
57	Correct	7 ms	604 KB	Output is correct
58	Correct	7 ms	856 KB	Output is correct
59	Correct	6 ms	436 KB	Output is correct
60	Correct	7 ms	600 KB	Output is correct
61	Correct	7 ms	600 KB	Output is correct
62	Correct	9 ms	436 KB	Output is correct
63	Correct	8 ms	600 KB	Output is correct
64	Correct	7 ms	444 KB	Output is correct

Subtask #4

60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 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	340 KB	Output is correct
6	Correct	9 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	5 ms	600 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	5 ms	440 KB	Output is correct
11	Correct	6 ms	444 KB	Output is correct
12	Correct	5 ms	428 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct
14	Correct	6 ms	344 KB	Output is correct
15	Correct	7 ms	344 KB	Output is correct
16	Correct	6 ms	344 KB	Output is correct
17	Correct	6 ms	600 KB	Output is correct
18	Correct	5 ms	344 KB	Output is correct
19	Correct	5 ms	440 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	6 ms	344 KB	Output is correct
22	Correct	6 ms	344 KB	Output is correct
23	Correct	7 ms	344 KB	Output is correct
24	Correct	5 ms	344 KB	Output is correct
25	Correct	6 ms	344 KB	Output is correct
26	Correct	5 ms	344 KB	Output is correct
27	Correct	5 ms	340 KB	Output is correct
28	Correct	7 ms	344 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	4 ms	344 KB	Output is correct
31	Correct	6 ms	344 KB	Output is correct
32	Correct	8 ms	344 KB	Output is correct
33	Correct	8 ms	344 KB	Output is correct
34	Correct	9 ms	344 KB	Output is correct
35	Correct	10 ms	344 KB	Output is correct
36	Correct	8 ms	344 KB	Output is correct
37	Correct	7 ms	344 KB	Output is correct
38	Correct	7 ms	344 KB	Output is correct
39	Correct	8 ms	344 KB	Output is correct
40	Correct	6 ms	344 KB	Output is correct
41	Correct	6 ms	600 KB	Output is correct
42	Correct	6 ms	600 KB	Output is correct
43	Correct	5 ms	444 KB	Output is correct
44	Correct	6 ms	436 KB	Output is correct
45	Correct	5 ms	600 KB	Output is correct
46	Correct	5 ms	436 KB	Output is correct
47	Correct	5 ms	344 KB	Output is correct
48	Correct	5 ms	344 KB	Output is correct
49	Correct	5 ms	600 KB	Output is correct
50	Correct	5 ms	600 KB	Output is correct
51	Correct	6 ms	344 KB	Output is correct
52	Correct	7 ms	600 KB	Output is correct
53	Correct	6 ms	596 KB	Output is correct
54	Correct	6 ms	344 KB	Output is correct
55	Correct	6 ms	344 KB	Output is correct
56	Correct	5 ms	344 KB	Output is correct
57	Correct	5 ms	344 KB	Output is correct
58	Correct	5 ms	344 KB	Output is correct
59	Correct	6 ms	344 KB	Output is correct
60	Correct	5 ms	344 KB	Output is correct
61	Correct	6 ms	432 KB	Output is correct
62	Correct	6 ms	344 KB	Output is correct
63	Correct	7 ms	432 KB	Output is correct
64	Correct	7 ms	600 KB	Output is correct
65	Correct	8 ms	440 KB	Output is correct
66	Correct	7 ms	436 KB	Output is correct
67	Correct	7 ms	600 KB	Output is correct
68	Correct	8 ms	444 KB	Output is correct
69	Correct	6 ms	600 KB	Output is correct
70	Correct	9 ms	692 KB	Output is correct
71	Correct	5 ms	344 KB	Output is correct
72	Correct	6 ms	440 KB	Output is correct
73	Correct	7 ms	600 KB	Output is correct
74	Correct	7 ms	444 KB	Output is correct
75	Correct	7 ms	344 KB	Output is correct
76	Correct	7 ms	600 KB	Output is correct
77	Correct	5 ms	344 KB	Output is correct
78	Correct	6 ms	600 KB	Output is correct
79	Correct	7 ms	344 KB	Output is correct
80	Correct	8 ms	440 KB	Output is correct
81	Correct	7 ms	344 KB	Output is correct
82	Correct	7 ms	344 KB	Output is correct