답안 #939824

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939824	2024-03-06T19:31:50 Z	weajink	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	11 ms	948 KB

longesttrip

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

vector<int> sciezka[2];

void dodaj_wierzcholek(int v){
	if (!sciezka[0].size() || are_connected({v},{sciezka[0].back()})){
		sciezka[0].push_back(v);
		return;
	}
	if (!sciezka[1].size() || are_connected({v},{sciezka[1].back()})){
		sciezka[1].push_back(v);
		return;
	}
	for (int i = (int)sciezka[1].size()-1; i >= 0; i--) sciezka[0].push_back(sciezka[1][i]);
	sciezka[1] = {v};
}
void dodaj_wierzcholki(int v1, int v2){
	if (are_connected({v1},{v2})){
		dodaj_wierzcholek(v1);
		if (sciezka[0].back() == v1) sciezka[0].push_back(v2);
		else sciezka[1].push_back(v2);
		return;
	}
	dodaj_wierzcholek(v1);
	dodaj_wierzcholek(v2);
	return;
	if (are_connected({v1},{sciezka[0].back()})) sciezka[0].push_back(v1);
	else sciezka[0].push_back(v2);
	if (are_connected({v1},{sciezka[1].back()})) sciezka[1].push_back(v1);
	else sciezka[1].push_back(v2);
}
int zbinsearchuj(vector<int> A, vector<int> B){
	if (A.size() == 1) return A.back();
	vector<int> polowy[2];
	for (int i = 0; i < (int)A.size(); i++){
		polowy[i>=((int)A.size()/2)].push_back(A[i]);
	}
	if (are_connected(polowy[0],B)) return zbinsearchuj(polowy[0],B);
	else return zbinsearchuj(polowy[1],B); 
}	
vector<int> longest_trip(int N, int D){
	sciezka[0].clear();
	sciezka[1].clear();
	for (int i = 0; i < N; i++){
		if (sciezka[0].size() && sciezka[1].size() && i < N-1){
			dodaj_wierzcholki(i,i+1);
			i++;
		}else dodaj_wierzcholek(i);
	}
	if (sciezka[0].size() < sciezka[1].size()) swap(sciezka[0],sciezka[1]);
	if (!sciezka[1].size()) return sciezka[0];
	if (!are_connected(sciezka[0],sciezka[1])) return sciezka[0];
	//
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	reverse(sciezka[0].begin(),sciezka[0].end());
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	reverse(sciezka[1].begin(),sciezka[1].end());
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	reverse(sciezka[0].begin(),sciezka[0].end());
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	//
	int a = zbinsearchuj(sciezka[0],sciezka[1]);
	int b = zbinsearchuj(sciezka[1],{a});
	vector<int> wy[2];
	bool flag = 0;
	for (int x : sciezka[0]){
		wy[flag].push_back(x);
		if (x == a) flag = 1;
	}
	vector<int> wynik;
	for (int x : wy[1]) wynik.push_back(x);
	for (int x : wy[0]) wynik.push_back(x);
	wy[0] = wy[1] = {};	
	flag = 0;
	for (int x : sciezka[1]){
		if (x == b) flag = 1;
		wy[flag].push_back(x);
	}
	for (int x : wy[1]) wynik.push_back(x);
	for (int x : wy[0]) wynik.push_back(x);
	return wynik;
}

Subtask #0

0.0 / 0.0

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

Subtask #1

5.0 / 5.0

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

Subtask #3

25.0 / 25.0

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

Subtask #4

45.0 / 60.0

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