oj.uz

Submission #848598

# Submission time Handle Problem Language Result Execution time Memory
848598 2023-09-13T02:21:13 Z Edu175 Longest Trip (IOI23_longesttrip) C++17
85 / 100
 13 ms 1412 KB 
#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;
map<pair<vector<ll>,vector<ll>>,ll>did;
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);
	if(a>b)swap(a,b);
	if(did.count({a,b}))return did[{a,b}];
	return did[{a,b}]=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<vector<ll>>h;
bool f(ll x, ll b, ll c){
	if(b==0){
		if(c||ask({h[0].back()},{x})){
			h[0].pb(x);
			return 1;
		}
	}
	if(b==1){
		if(c||ask({h[1].back()},{x})){
			h[1].pb(x);
			return 1;
		}
	}
	if(b==2){
		if(c||ask({h[0].back()},{h[1].back()})){
			while(SZ(h[1]))h[0].pb(h[1].back()),h[1].pop_back();
			h[1]={x};
			return 1;
		}
	}
	return 0;
}

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(3);
	random_shuffle(ALL(P));
	did.clear();
	h.clear();
	h.pb({P[0]});
	h.pb({P[1]});
	fore(i,2,n){
		ll x=P[i];
		vector<ll>q={0,1,2};
		fore(j,0,2)if(rand()%2)reverse(ALL(h[j]));
		if(rand()%2)swap(h[0],h[1]);
		random_shuffle(ALL(q));
		fore(j,0,3){
			if(j==2)f(x,q[j],1);
			else if(f(x,q[j],0))break;
		}
	}
	/*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 600 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 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 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 8 ms 344 KB Output is correct
8 Correct 5 ms 440 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 800 KB Output is correct
11 Correct 8 ms 856 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 6 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 10 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 7 ms 344 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 6 ms 600 KB Output is correct
12 Correct 6 ms 476 KB Output is correct
13 Correct 6 ms 600 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 600 KB Output is correct
17 Correct 7 ms 600 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 800 KB Output is correct
21 Correct 7 ms 600 KB Output is correct
22 Correct 6 ms 484 KB Output is correct
23 Correct 6 ms 600 KB Output is correct
24 Correct 7 ms 600 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 9 ms 344 KB Output is correct
27 Correct 8 ms 344 KB Output is correct
28 Correct 8 ms 344 KB Output is correct
29 Correct 9 ms 344 KB Output is correct
30 Correct 7 ms 688 KB Output is correct
31 Correct 7 ms 432 KB Output is correct
32 Correct 8 ms 688 KB Output is correct
33 Correct 6 ms 856 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 7 ms 600 KB Output is correct
36 Correct 7 ms 868 KB Output is correct
37 Correct 8 ms 344 KB Output is correct
38 Correct 8 ms 628 KB Output is correct
39 Correct 9 ms 756 KB Output is correct
40 Correct 8 ms 344 KB Output is correct
41 Correct 10 ms 600 KB Output is correct
42 Correct 11 ms 1112 KB Output is correct
43 Correct 10 ms 856 KB Output is correct
44 Correct 8 ms 600 KB Output is correct
45 Correct 13 ms 344 KB Output is correct
46 Correct 10 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 12 ms 596 KB Output is correct
50 Correct 7 ms 440 KB Output is correct
51 Correct 10 ms 944 KB Output is correct
52 Correct 9 ms 696 KB Output is correct
53 Correct 6 ms 608 KB Output is correct
54 Correct 8 ms 1112 KB Output is correct
55 Correct 10 ms 1116 KB Output is correct
56 Correct 7 ms 1172 KB Output is correct
57 Correct 11 ms 1252 KB Output is correct
58 Correct 10 ms 628 KB Output is correct
59 Correct 10 ms 892 KB Output is correct
60 Correct 11 ms 896 KB Output is correct
61 Correct 10 ms 908 KB Output is correct
62 Correct 10 ms 764 KB Output is correct
63 Correct 10 ms 632 KB Output is correct
64 Correct 11 ms 1248 KB Output is correct

Subtask #4
45.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 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 9 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 6 ms 444 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 6 ms 352 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 6 ms 876 KB Output is correct
13 Correct 6 ms 600 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 7 ms 344 KB Output is correct
17 Correct 6 ms 420 KB Output is correct
18 Correct 8 ms 756 KB Output is correct
19 Correct 6 ms 948 KB Output is correct
20 Correct 6 ms 344 KB Output is correct
21 Correct 8 ms 344 KB Output is correct
22 Correct 9 ms 540 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 7 ms 344 KB Output is correct
26 Correct 8 ms 700 KB Output is correct
27 Correct 8 ms 436 KB Output is correct
28 Correct 8 ms 436 KB Output is correct
29 Correct 7 ms 600 KB Output is correct
30 Correct 8 ms 856 KB Output is correct
31 Correct 8 ms 856 KB Output is correct
32 Correct 8 ms 344 KB Output is correct
33 Correct 11 ms 344 KB Output is correct
34 Correct 8 ms 344 KB Output is correct
35 Correct 9 ms 344 KB Output is correct
36 Correct 9 ms 344 KB Output is correct
37 Correct 7 ms 688 KB Output is correct
38 Correct 10 ms 440 KB Output is correct
39 Correct 11 ms 344 KB Output is correct
40 Correct 8 ms 856 KB Output is correct
41 Correct 8 ms 728 KB Output is correct
42 Correct 9 ms 860 KB Output is correct
43 Correct 6 ms 344 KB Output is correct
44 Correct 6 ms 344 KB Output is correct
45 Correct 6 ms 344 KB Output is correct
46 Correct 7 ms 1112 KB Output is correct
47 Correct 8 ms 876 KB Output is correct
48 Correct 9 ms 856 KB Output is correct
49 Correct 10 ms 344 KB Output is correct
50 Partially correct 8 ms 920 KB Output is partially correct
51 Correct 8 ms 600 KB Output is correct
52 Partially correct 10 ms 600 KB Output is partially correct
53 Correct 11 ms 600 KB Output is correct
54 Correct 8 ms 600 KB Output is correct
55 Correct 8 ms 600 KB Output is correct
56 Correct 8 ms 744 KB Output is correct
57 Correct 9 ms 600 KB Output is correct
58 Correct 8 ms 852 KB Output is correct
59 Partially correct 11 ms 1412 KB Output is partially correct
60 Correct 9 ms 600 KB Output is correct
61 Partially correct 8 ms 600 KB Output is partially correct
62 Correct 7 ms 624 KB Output is correct
63 Correct 9 ms 1144 KB Output is correct
64 Partially correct 11 ms 772 KB Output is partially correct
65 Partially correct 9 ms 780 KB Output is partially correct
66 Partially correct 9 ms 924 KB Output is partially correct
67 Partially correct 10 ms 792 KB Output is partially correct
68 Partially correct 11 ms 920 KB Output is partially correct
69 Partially correct 11 ms 788 KB Output is partially correct
70 Partially correct 11 ms 780 KB Output is partially correct
71 Partially correct 8 ms 900 KB Output is partially correct
72 Correct 11 ms 656 KB Output is correct
73 Partially correct 9 ms 772 KB Output is partially correct
74 Partially correct 11 ms 884 KB Output is partially correct
75 Partially correct 9 ms 908 KB Output is partially correct
76 Partially correct 9 ms 900 KB Output is partially correct
77 Partially correct 10 ms 1144 KB Output is partially correct
78 Partially correct 10 ms 908 KB Output is partially correct
79 Partially correct 9 ms 628 KB Output is partially correct
80 Partially correct 9 ms 904 KB Output is partially correct
81 Partially correct 10 ms 628 KB Output is partially correct
82 Partially correct 10 ms 780 KB Output is partially correct