oj.uz

Submission #1065371

# Submission time Handle Problem Language Result Execution time Memory
1065371 2024-08-19T06:43:20 Z pcc Longest Trip (IOI23_longesttrip) C++17
60 / 100
 907 ms 856 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

#define vi vector<int>

const int mxn = 300;

int ask(vector<int> a,vector<int> b){
	return are_connected(a,b);
}

int dp[mxn][mxn];
bitset<mxn> vis;
int N;

int ask(int a,int b){
	if(dp[a][b] != -1)return dp[a][b];
	return ask(vector<int>({a}),vector<int>({b}));
}

void dfs(int now){
	vis[now] = true;
	for(int i = 0;i<N;i++){
		if(dp[i]&&!vis[i])dfs(i);
	}
	return;
}

vector<int> get_max_cc(){
	//cerr<<"GETTING MAX CC: "<<endl;
	vector<int> heads;
	vis.reset();
	for(int i = 0;i<N;i++){
		if(!vis[i]){
			heads.push_back(i);
			dfs(i);
		}
	}
	int ans = 0,tar = -1;
	for(auto &i:heads){
		vis.reset();
		dfs(i);
		if(vis.count()>ans){
			ans = vis.count();
			tar = i;
		}
	}
	assert(tar != -1);
	dfs(tar);
	vector<int> re;
	for(int i = 0;i<N;i++)if(vis[i])re.push_back(i);
	return re;
}

std::vector<int> longest_trip(int NN, int D){
	N = NN;
	memset(dp,-1,sizeof(dp));
	vis.reset();
	for(int i = 0;i<N;i++){
		dp[i][i] = 1;
		for(int j = i+1;j<N;j++)dp[i][j] = dp[j][i] = ask(i,j);
	}
	dfs(1);
	if(vis.count() != N){
		return get_max_cc();
	}
	deque<int> dq[2];
	set<int> st;
	for(int i = 0;i<N;i++)st.insert(i);
	if(ask(0,1))dq[0] = {0,1};
	else if(ask(1,2))dq[0] = {1,2};
	else dq[0] = {0,2};
	for(auto &i:dq[0])st.erase(i);

	while(st.size()){
		if(dq[0].size()<dq[1].size())dq[0].swap(dq[1]);
		//cerr<<*st.begin()<<endl;
		auto now = *st.begin();
		st.erase(now);
		if(ask(now,dq[0].back())){
			dq[0].push_back(now);
			dq[0].swap(dq[1]);
		}
		else{
			dq[1].push_back(now);
		}
		if(dq[0].empty()||dq[1].empty())continue;
		int s = dq[0].front(),t = dq[0].back();
		if(!dp[s][t]){
			if(dp[s][now]){
				while(!dq[1].empty()){
					dq[0].push_front(dq[1].back());
					dq[1].pop_back();
				}
			}
			else if(dp[t][now]){
				while(!dq[1].empty()){
					dq[0].push_back(dq[1].back());
					dq[1].pop_back();
				}
			}
		}
		else{
			assert(dp[s][t]);
			int tar = -1;
			for(auto &i:dq[0]){
				if(dp[i][now])tar = i;
			}
			if(tar == -1)continue;
			while(dq[0][0] != tar){
				dq[0].push_back(dq[0][0]);
				dq[0].pop_front();
			}
			while(!dq[1].empty()){
				dq[0].push_front(dq[1].back());
				dq[1].pop_back();
			}
		}
	}

	if(dq[0].size()<dq[1].size())dq[0].swap(dq[1]);
	/*
	cerr<<"DQ: "<<endl;
	for(auto &i:dq[0])cerr<<i<<' ';cerr<<endl;
	for(auto &i:dq[1])cerr<<i<<' ';cerr<<endl;
	cerr<<endl;
	*/
	vector<int> ans;
	for(auto &i:dq[0])ans.push_back(i);
	return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> get_max_cc()':
longesttrip.cpp:44:17: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |   if(vis.count()>ans){
      |      ~~~~~~~~~~~^~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:65:17: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |  if(vis.count() != N){
      |     ~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 203 ms 764 KB Output is correct

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 600 KB Output is correct
2 Correct 31 ms 600 KB Output is correct
3 Correct 133 ms 788 KB Output is correct
4 Correct 385 ms 600 KB Output is correct
5 Correct 811 ms 772 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 600 KB Output is correct
2 Correct 23 ms 600 KB Output is correct
3 Correct 146 ms 792 KB Output is correct
4 Correct 372 ms 768 KB Output is correct
5 Correct 792 ms 772 KB Output is correct
6 Correct 12 ms 600 KB Output is correct
7 Correct 22 ms 600 KB Output is correct
8 Correct 158 ms 600 KB Output is correct
9 Correct 267 ms 768 KB Output is correct
10 Correct 856 ms 764 KB Output is correct
11 Correct 826 ms 772 KB Output is correct
12 Correct 801 ms 760 KB Output is correct
13 Correct 799 ms 764 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 600 KB Output is correct
2 Correct 23 ms 600 KB Output is correct
3 Correct 146 ms 856 KB Output is correct
4 Correct 429 ms 764 KB Output is correct
5 Correct 840 ms 768 KB Output is correct
6 Correct 9 ms 600 KB Output is correct
7 Correct 22 ms 600 KB Output is correct
8 Correct 157 ms 856 KB Output is correct
9 Correct 325 ms 600 KB Output is correct
10 Correct 862 ms 764 KB Output is correct
11 Correct 843 ms 768 KB Output is correct
12 Correct 858 ms 764 KB Output is correct
13 Correct 853 ms 768 KB Output is correct
14 Correct 13 ms 600 KB Output is correct
15 Correct 11 ms 600 KB Output is correct
16 Correct 32 ms 600 KB Output is correct
17 Correct 96 ms 856 KB Output is correct
18 Correct 134 ms 600 KB Output is correct
19 Correct 311 ms 600 KB Output is correct
20 Correct 300 ms 768 KB Output is correct
21 Correct 796 ms 764 KB Output is correct
22 Correct 839 ms 764 KB Output is correct
23 Correct 833 ms 772 KB Output is correct
24 Correct 863 ms 768 KB Output is correct
25 Correct 10 ms 600 KB Output is correct
26 Correct 15 ms 600 KB Output is correct
27 Correct 22 ms 600 KB Output is correct
28 Correct 24 ms 600 KB Output is correct
29 Correct 20 ms 600 KB Output is correct
30 Correct 228 ms 600 KB Output is correct
31 Correct 224 ms 600 KB Output is correct
32 Correct 213 ms 600 KB Output is correct
33 Correct 330 ms 772 KB Output is correct
34 Correct 352 ms 772 KB Output is correct
35 Correct 328 ms 768 KB Output is correct
36 Correct 833 ms 768 KB Output is correct
37 Correct 810 ms 768 KB Output is correct
38 Correct 824 ms 768 KB Output is correct
39 Correct 836 ms 768 KB Output is correct
40 Correct 828 ms 768 KB Output is correct
41 Correct 832 ms 768 KB Output is correct
42 Correct 851 ms 848 KB Output is correct
43 Correct 829 ms 772 KB Output is correct
44 Correct 844 ms 772 KB Output is correct
45 Correct 10 ms 600 KB Output is correct
46 Correct 10 ms 600 KB Output is correct
47 Correct 22 ms 600 KB Output is correct
48 Correct 29 ms 600 KB Output is correct
49 Correct 25 ms 600 KB Output is correct
50 Correct 177 ms 600 KB Output is correct
51 Correct 183 ms 600 KB Output is correct
52 Correct 172 ms 600 KB Output is correct
53 Correct 297 ms 764 KB Output is correct
54 Correct 313 ms 600 KB Output is correct
55 Correct 306 ms 600 KB Output is correct
56 Correct 886 ms 768 KB Output is correct
57 Correct 878 ms 848 KB Output is correct
58 Correct 866 ms 768 KB Output is correct
59 Correct 848 ms 768 KB Output is correct
60 Correct 843 ms 768 KB Output is correct
61 Correct 879 ms 768 KB Output is correct
62 Correct 840 ms 760 KB Output is correct
63 Correct 797 ms 772 KB Output is correct
64 Correct 795 ms 764 KB Output is correct

Subtask #4
19.999999998 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 600 KB Output is correct
2 Correct 30 ms 600 KB Output is correct
3 Partially correct 162 ms 600 KB Output is partially correct
4 Partially correct 421 ms 596 KB Output is partially correct
5 Partially correct 875 ms 764 KB Output is partially correct
6 Correct 8 ms 600 KB Output is correct
7 Correct 27 ms 600 KB Output is correct
8 Partially correct 145 ms 600 KB Output is partially correct
9 Partially correct 319 ms 600 KB Output is partially correct
10 Partially correct 806 ms 764 KB Output is partially correct
11 Partially correct 756 ms 764 KB Output is partially correct
12 Partially correct 712 ms 768 KB Output is partially correct
13 Partially correct 714 ms 768 KB Output is partially correct
14 Correct 10 ms 600 KB Output is correct
15 Correct 14 ms 600 KB Output is correct
16 Correct 40 ms 600 KB Output is correct
17 Partially correct 69 ms 600 KB Output is partially correct
18 Partially correct 142 ms 600 KB Output is partially correct
19 Partially correct 293 ms 784 KB Output is partially correct
20 Partially correct 275 ms 764 KB Output is partially correct
21 Correct 13 ms 600 KB Output is correct
22 Correct 11 ms 600 KB Output is correct
23 Correct 27 ms 600 KB Output is correct
24 Correct 24 ms 600 KB Output is correct
25 Correct 21 ms 600 KB Output is correct
26 Partially correct 203 ms 600 KB Output is partially correct
27 Partially correct 195 ms 600 KB Output is partially correct
28 Partially correct 214 ms 600 KB Output is partially correct
29 Partially correct 344 ms 768 KB Output is partially correct
30 Partially correct 302 ms 848 KB Output is partially correct
31 Partially correct 292 ms 768 KB Output is partially correct
32 Correct 12 ms 600 KB Output is correct
33 Correct 10 ms 600 KB Output is correct
34 Correct 25 ms 600 KB Output is correct
35 Correct 31 ms 600 KB Output is correct
36 Correct 29 ms 600 KB Output is correct
37 Partially correct 182 ms 788 KB Output is partially correct
38 Partially correct 190 ms 600 KB Output is partially correct
39 Partially correct 196 ms 768 KB Output is partially correct
40 Partially correct 263 ms 600 KB Output is partially correct
41 Partially correct 298 ms 600 KB Output is partially correct
42 Partially correct 279 ms 772 KB Output is partially correct
43 Partially correct 796 ms 772 KB Output is partially correct
44 Partially correct 798 ms 764 KB Output is partially correct
45 Partially correct 805 ms 764 KB Output is partially correct
46 Partially correct 812 ms 764 KB Output is partially correct
47 Partially correct 781 ms 768 KB Output is partially correct
48 Partially correct 710 ms 768 KB Output is partially correct
49 Partially correct 822 ms 760 KB Output is partially correct
50 Partially correct 848 ms 768 KB Output is partially correct
51 Partially correct 830 ms 760 KB Output is partially correct
52 Partially correct 802 ms 772 KB Output is partially correct
53 Partially correct 827 ms 772 KB Output is partially correct
54 Partially correct 804 ms 772 KB Output is partially correct
55 Partially correct 866 ms 768 KB Output is partially correct
56 Partially correct 875 ms 852 KB Output is partially correct
57 Partially correct 811 ms 768 KB Output is partially correct
58 Partially correct 826 ms 768 KB Output is partially correct
59 Partially correct 813 ms 764 KB Output is partially correct
60 Partially correct 875 ms 764 KB Output is partially correct
61 Partially correct 892 ms 764 KB Output is partially correct
62 Partially correct 894 ms 764 KB Output is partially correct
63 Partially correct 852 ms 768 KB Output is partially correct
64 Partially correct 817 ms 600 KB Output is partially correct
65 Partially correct 845 ms 768 KB Output is partially correct
66 Partially correct 864 ms 772 KB Output is partially correct
67 Partially correct 845 ms 768 KB Output is partially correct
68 Partially correct 812 ms 764 KB Output is partially correct
69 Partially correct 907 ms 848 KB Output is partially correct
70 Partially correct 777 ms 772 KB Output is partially correct
71 Partially correct 849 ms 760 KB Output is partially correct
72 Partially correct 806 ms 768 KB Output is partially correct
73 Partially correct 791 ms 764 KB Output is partially correct
74 Partially correct 823 ms 768 KB Output is partially correct
75 Partially correct 835 ms 768 KB Output is partially correct
76 Partially correct 849 ms 768 KB Output is partially correct
77 Partially correct 814 ms 772 KB Output is partially correct
78 Partially correct 838 ms 764 KB Output is partially correct
79 Partially correct 849 ms 772 KB Output is partially correct
80 Partially correct 877 ms 768 KB Output is partially correct
81 Partially correct 836 ms 852 KB Output is partially correct
82 Partially correct 831 ms 760 KB Output is partially correct