oj.uz

Submission #1066034

# Submission time Handle Problem Language Result Execution time Memory
1066034 2024-08-19T14:18:13 Z pcc Longest Trip (IOI23_longesttrip) C++17
15 / 100
 867 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[now][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 Incorrect 1 ms 600 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 600 KB Output is correct
2 Correct 24 ms 600 KB Output is correct
3 Correct 144 ms 792 KB Output is correct
4 Correct 375 ms 600 KB Output is correct
5 Correct 770 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 32 ms 600 KB Output is correct
3 Correct 134 ms 856 KB Output is correct
4 Correct 392 ms 764 KB Output is correct
5 Correct 814 ms 764 KB Output is correct
6 Correct 9 ms 600 KB Output is correct
7 Correct 24 ms 600 KB Output is correct
8 Correct 163 ms 788 KB Output is correct
9 Correct 306 ms 600 KB Output is correct
10 Correct 859 ms 764 KB Output is correct
11 Correct 787 ms 768 KB Output is correct
12 Correct 851 ms 784 KB Output is correct
13 Correct 844 ms 780 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 600 KB Output is correct
2 Correct 21 ms 600 KB Output is correct
3 Correct 137 ms 788 KB Output is correct
4 Correct 411 ms 600 KB Output is correct
5 Correct 867 ms 788 KB Output is correct
6 Correct 11 ms 600 KB Output is correct
7 Correct 30 ms 600 KB Output is correct
8 Correct 161 ms 600 KB Output is correct
9 Correct 312 ms 600 KB Output is correct
10 Correct 846 ms 848 KB Output is correct
11 Correct 830 ms 848 KB Output is correct
12 Correct 846 ms 768 KB Output is correct
13 Correct 782 ms 768 KB Output is correct
14 Incorrect 1 ms 600 KB Incorrect
15 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 600 KB Output is correct
2 Correct 23 ms 600 KB Output is correct
3 Partially correct 119 ms 600 KB Output is partially correct
4 Partially correct 306 ms 764 KB Output is partially correct
5 Partially correct 781 ms 772 KB Output is partially correct
6 Correct 10 ms 600 KB Output is correct
7 Correct 27 ms 600 KB Output is correct
8 Partially correct 135 ms 856 KB Output is partially correct
9 Partially correct 280 ms 792 KB Output is partially correct
10 Partially correct 742 ms 768 KB Output is partially correct
11 Partially correct 684 ms 768 KB Output is partially correct
12 Partially correct 799 ms 768 KB Output is partially correct
13 Partially correct 791 ms 764 KB Output is partially correct
14 Incorrect 1 ms 600 KB Incorrect
15 Halted 0 ms 0 KB -