Submission #848827

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
848827	2023-09-13T14:41:55 Z	Edu175	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	12 ms	964 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define imp(v) for(auto messi:v)cout<<messi<<" "; cout<<"\n"
using namespace std;
typedef int ll;
typedef long long LL;
typedef pair<ll,ll> ii;
 
ll n,d;
ll ask(vector<ll>a, vector<ll>b){
	set<ll>sa,sb;
	for(auto i:a)sa.insert(i);
	for(auto i:b)sb.insert(i);
	a.clear(),b.clear();
	for(auto i:sa)a.pb(i);
	for(auto i:sb)b.pb(i);
	return are_connected(a,b);
}
ll find(vector<ll>&a,vector<ll>&b){
	/*vector<ll>pre;
	fore(i,0,SZ(a)){
		pre.pb(a[i]);
		if(ask(b,pre))return i;
	}*/
	ll l=0,r=SZ(a)-1;
	while(l<=r){
		ll m=(l+r)/2;
		vector<ll>pre;
		fore(i,0,m+1)pre.pb(a[i]);
		if(ask(b,pre))r=m-1;
		else l=m+1;
	}
	return l;
}
 
vector<ll> rot(vector<ll>a, ll d){ // <--
	ll n=SZ(a);
	vector<ll>ai(n);
	fore(i,0,n)ai[i]=a[(i+d)%n];
	return ai;
}
 
vector<int> longest_trip(int N, int D){
	n=N,d=D;
	vector<ll>P;
	fore(i,0,n)P.pb(i);
	//LL sd; srand((LL)&sd); 
	srand(314159265);
	random_shuffle(ALL(P));
	vector<vector<ll>>h;
	h.pb({P[0]});
	h.pb({P[1]});
	ll pr=-1;
	fore(i,2,n){
		ll x=P[i];
		if(pr==1){
			if(ask({h[0].back()},{x}))h[0].pb(x),pr=0;
			else h[1].pb(x),pr=1;
			continue;		
}
		if(ask({h[0].back()},{x}))h[0].pb(x),pr=0;
		else if(ask({h[1].back()},{x}))h[1].pb(x),pr=1;
		else {
			while(SZ(h[1]))h[0].pb(h[1].back()),h[1].pop_back();
			h[1]={x};
			pr=2;
		}
	}
	/*if(SZ(h[0])>SZ(h[1]))return h[0];
	else return h[1];*/
	//imp(h[0]); imp(h[1]);
	if(!ask({h[0][0],h[0].back()},{h[1][0],h[1].back()})){
		if(!ask(h[0],h[1])){
			if(SZ(h[0])>SZ(h[1]))return h[0];
			else return h[1];
		}
		ll x=find(h[0],h[1]);
		vector<ll>fi={h[0][x]};
		ll y=find(h[1],fi);
		h[0]=rot(h[0],x+1),h[1]=rot(h[1],y);
	}
	else if(ask({h[0].back()},{h[1][0]}));
	else if(ask({h[0].back()},{h[1].back()}))reverse(ALL(h[1]));
	else if(ask({h[0][0]},{h[1][0]}))reverse(ALL(h[0]));
	else /*if(ask({h[0][0]},{h[1].back()}))*/
		reverse(ALL(h[0])),reverse(ALL(h[1]));
	for(auto i:h[1])h[0].pb(i);
	h[1].clear();
	return h[0];
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	344 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	7 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	4 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.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	4 ms	600 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	9 ms	344 KB	Output is correct
7	Correct	8 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	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

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	340 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	600 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	8 ms	344 KB	Output is correct
7	Correct	8 ms	504 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	8 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	7 ms	344 KB	Output is correct
18	Correct	6 ms	600 KB	Output is correct
19	Correct	7 ms	344 KB	Output is correct
20	Correct	6 ms	600 KB	Output is correct
21	Correct	6 ms	344 KB	Output is correct
22	Correct	5 ms	344 KB	Output is correct
23	Correct	6 ms	344 KB	Output is correct
24	Correct	6 ms	344 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	8 ms	344 KB	Output is correct
27	Correct	7 ms	344 KB	Output is correct
28	Correct	8 ms	344 KB	Output is correct
29	Correct	7 ms	344 KB	Output is correct
30	Correct	6 ms	436 KB	Output is correct
31	Correct	5 ms	432 KB	Output is correct
32	Correct	6 ms	600 KB	Output is correct
33	Correct	4 ms	600 KB	Output is correct
34	Correct	6 ms	432 KB	Output is correct
35	Correct	5 ms	432 KB	Output is correct
36	Correct	5 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	448 KB	Output is correct
40	Correct	6 ms	344 KB	Output is correct
41	Correct	7 ms	344 KB	Output is correct
42	Correct	6 ms	600 KB	Output is correct
43	Correct	6 ms	600 KB	Output is correct
44	Correct	6 ms	344 KB	Output is correct
45	Correct	10 ms	344 KB	Output is correct
46	Correct	8 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	10 ms	344 KB	Output is correct
50	Correct	5 ms	440 KB	Output is correct
51	Correct	7 ms	436 KB	Output is correct
52	Correct	8 ms	440 KB	Output is correct
53	Correct	6 ms	600 KB	Output is correct
54	Correct	7 ms	600 KB	Output is correct
55	Correct	8 ms	444 KB	Output is correct
56	Correct	6 ms	720 KB	Output is correct
57	Correct	6 ms	720 KB	Output is correct
58	Correct	7 ms	704 KB	Output is correct
59	Correct	7 ms	708 KB	Output is correct
60	Correct	7 ms	716 KB	Output is correct
61	Correct	8 ms	856 KB	Output is correct
62	Correct	7 ms	460 KB	Output is correct
63	Correct	7 ms	616 KB	Output is correct
64	Correct	7 ms	620 KB	Output is correct

Subtask #4

60.0 / 60.0

#	Verdict	Execution time	Memory	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	4 ms	344 KB	Output is correct
5	Correct	4 ms	428 KB	Output is correct
6	Correct	9 ms	344 KB	Output is correct
7	Correct	9 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 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	5 ms	344 KB	Output is correct
14	Correct	8 ms	344 KB	Output is correct
15	Correct	9 ms	344 KB	Output is correct
16	Correct	6 ms	344 KB	Output is correct
17	Correct	6 ms	344 KB	Output is correct
18	Correct	5 ms	600 KB	Output is correct
19	Correct	5 ms	344 KB	Output is correct
20	Correct	5 ms	600 KB	Output is correct
21	Correct	11 ms	344 KB	Output is correct
22	Correct	9 ms	344 KB	Output is correct
23	Correct	8 ms	344 KB	Output is correct
24	Correct	7 ms	596 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	5 ms	436 KB	Output is correct
27	Correct	6 ms	432 KB	Output is correct
28	Correct	7 ms	440 KB	Output is correct
29	Correct	5 ms	344 KB	Output is correct
30	Correct	5 ms	344 KB	Output is correct
31	Correct	5 ms	344 KB	Output is correct
32	Correct	8 ms	344 KB	Output is correct
33	Correct	12 ms	596 KB	Output is correct
34	Correct	8 ms	344 KB	Output is correct
35	Correct	8 ms	344 KB	Output is correct
36	Correct	7 ms	344 KB	Output is correct
37	Correct	6 ms	436 KB	Output is correct
38	Correct	8 ms	432 KB	Output is correct
39	Correct	7 ms	436 KB	Output is correct
40	Correct	5 ms	600 KB	Output is correct
41	Correct	6 ms	600 KB	Output is correct
42	Correct	6 ms	604 KB	Output is correct
43	Correct	6 ms	344 KB	Output is correct
44	Correct	5 ms	596 KB	Output is correct
45	Correct	5 ms	344 KB	Output is correct
46	Correct	6 ms	344 KB	Output is correct
47	Correct	6 ms	436 KB	Output is correct
48	Correct	5 ms	344 KB	Output is correct
49	Correct	5 ms	344 KB	Output is correct
50	Correct	5 ms	612 KB	Output is correct
51	Correct	6 ms	344 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	7 ms	440 KB	Output is correct
54	Correct	6 ms	600 KB	Output is correct
55	Correct	6 ms	600 KB	Output is correct
56	Correct	5 ms	444 KB	Output is correct
57	Correct	6 ms	600 KB	Output is correct
58	Correct	6 ms	344 KB	Output is correct
59	Correct	6 ms	600 KB	Output is correct
60	Correct	6 ms	600 KB	Output is correct
61	Correct	6 ms	852 KB	Output is correct
62	Correct	7 ms	868 KB	Output is correct
63	Correct	6 ms	720 KB	Output is correct
64	Correct	7 ms	884 KB	Output is correct
65	Correct	7 ms	876 KB	Output is correct
66	Correct	7 ms	712 KB	Output is correct
67	Correct	8 ms	612 KB	Output is correct
68	Correct	7 ms	716 KB	Output is correct
69	Correct	8 ms	680 KB	Output is correct
70	Correct	7 ms	616 KB	Output is correct
71	Correct	6 ms	612 KB	Output is correct
72	Correct	7 ms	716 KB	Output is correct
73	Correct	7 ms	468 KB	Output is correct
74	Correct	7 ms	616 KB	Output is correct
75	Correct	8 ms	456 KB	Output is correct
76	Correct	7 ms	864 KB	Output is correct
77	Correct	6 ms	964 KB	Output is correct
78	Correct	6 ms	620 KB	Output is correct
79	Correct	8 ms	620 KB	Output is correct
80	Correct	8 ms	616 KB	Output is correct
81	Correct	7 ms	624 KB	Output is correct
82	Correct	7 ms	712 KB	Output is correct