Submission #939741

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
939741	2024-03-06T17:25:23 Z	jamjanek	Longest Trip (IOI23_longesttrip)	C++17	25 / 100	8 ms	856 KB

longesttrip

#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
bool czy[300];
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()>=tab[1].size())return tab[0];
	return tab[1];
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #1

0.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #2

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-

Subtask #3

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 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	5 ms	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	4 ms	344 KB	Output is correct
7	Correct	4 ms	344 KB	Output is correct
8	Correct	4 ms	344 KB	Output is correct
9	Correct	5 ms	432 KB	Output is correct
10	Correct	4 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	5 ms	344 KB	Output is correct
15	Correct	5 ms	344 KB	Output is correct
16	Correct	5 ms	344 KB	Output is correct
17	Correct	5 ms	344 KB	Output is correct
18	Correct	6 ms	344 KB	Output is correct
19	Correct	5 ms	600 KB	Output is correct
20	Correct	5 ms	600 KB	Output is correct
21	Correct	6 ms	856 KB	Output is correct
22	Correct	5 ms	344 KB	Output is correct
23	Correct	5 ms	344 KB	Output is correct
24	Correct	5 ms	600 KB	Output is correct
25	Correct	4 ms	344 KB	Output is correct
26	Correct	5 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	6 ms	344 KB	Output is correct
30	Correct	4 ms	344 KB	Output is correct
31	Correct	5 ms	344 KB	Output is correct
32	Correct	6 ms	344 KB	Output is correct
33	Correct	4 ms	344 KB	Output is correct
34	Correct	4 ms	344 KB	Output is correct
35	Correct	4 ms	344 KB	Output is correct
36	Correct	5 ms	600 KB	Output is correct
37	Correct	5 ms	344 KB	Output is correct
38	Correct	4 ms	344 KB	Output is correct
39	Correct	5 ms	596 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	600 KB	Output is correct
43	Correct	7 ms	344 KB	Output is correct
44	Correct	7 ms	600 KB	Output is correct
45	Correct	5 ms	344 KB	Output is correct
46	Correct	5 ms	344 KB	Output is correct
47	Correct	5 ms	344 KB	Output is correct
48	Correct	8 ms	344 KB	Output is correct
49	Correct	4 ms	344 KB	Output is correct
50	Correct	4 ms	344 KB	Output is correct
51	Correct	7 ms	344 KB	Output is correct
52	Correct	5 ms	344 KB	Output is correct
53	Correct	4 ms	436 KB	Output is correct
54	Correct	5 ms	344 KB	Output is correct
55	Correct	5 ms	436 KB	Output is correct
56	Correct	4 ms	600 KB	Output is correct
57	Correct	5 ms	344 KB	Output is correct
58	Correct	6 ms	600 KB	Output is correct
59	Correct	6 ms	344 KB	Output is correct
60	Correct	6 ms	600 KB	Output is correct
61	Correct	5 ms	344 KB	Output is correct
62	Correct	6 ms	344 KB	Output is correct
63	Correct	7 ms	436 KB	Output is correct
64	Correct	7 ms	600 KB	Output is correct

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Incorrect
2	Halted	0 ms	0 KB	-