oj.uz

답안 #1066020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066020 2024-08-19T14:11:44 Z pcc 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 18 ms 912 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){
	/*
	cerr<<"ASK: ";
	for(auto i:a)cerr<<i<<',';cerr<<endl;
	for(auto i:b)cerr<<i<<',';cerr<<endl;
	*/
	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}));
}

int ask(deque<int> a,int b){
	vi v;
	for(auto &i:a)v.push_back(i);
	return ask(v,vi({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();
	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(!ask(s,t)){
			if(ask(s,now)){
				while(!dq[1].empty()){
					dq[0].push_front(dq[1].back());
					dq[1].pop_back();
				}
			}
			else if(ask(t,now)){
				while(!dq[1].empty()){
					dq[0].push_back(dq[1].back());
					dq[1].pop_back();
				}
			}
		}
		else{
			int tar = -1;
			deque<int> c = dq[0];
			while(c.size()>1){
				int mid = c.size()>>1;
				deque<int> tmp;
				for(int i = 0;i<mid;i++)tmp.push_back(c[i]);
				if(ask(tmp,now)){
					int s = c.size();
					for(int i = mid;i<s;i++)c.pop_back();
				}
				else{
					for(int i = 0;i<mid;i++)c.pop_front();
				}
			}
			//cerr<<now<<":"<<c.size()<<' '<<c[0]<<endl;
			if(c.size()&&!ask(c,now))c.clear();
			if(c.size())tar = c[0];
			if(tar == -1)continue;
			assert(c.size() == 1);
			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:55:17: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |   if(vis.count()>ans){
      |      ~~~~~~~~~~~^~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:72:17: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   72 |  if(vis.count() != N){
      |     ~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 5 ms 856 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 600 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 6 ms 600 KB Output is correct
4 Correct 5 ms 600 KB Output is correct
5 Correct 8 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 600 KB Output is correct
2 Correct 6 ms 600 KB Output is correct
3 Correct 7 ms 600 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 8 ms 600 KB Output is correct
8 Correct 7 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 816 KB Output is correct
11 Correct 8 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 8 ms 856 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 6 ms 600 KB Output is correct
3 Correct 8 ms 600 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 11 ms 600 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 5 ms 800 KB Output is correct
10 Correct 6 ms 912 KB Output is correct
11 Correct 8 ms 600 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 9 ms 600 KB Output is correct
14 Correct 18 ms 852 KB Output is correct
15 Incorrect 1 ms 600 KB non-disjoint arrays
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 600 KB Output is correct
2 Correct 6 ms 600 KB Output is correct
3 Correct 6 ms 600 KB Output is correct
4 Correct 7 ms 600 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 13 ms 600 KB Output is correct
7 Correct 8 ms 600 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Correct 6 ms 820 KB Output is correct
11 Correct 7 ms 600 KB Output is correct
12 Correct 7 ms 600 KB Output is correct
13 Correct 9 ms 600 KB Output is correct
14 Correct 12 ms 600 KB Output is correct
15 Incorrect 1 ms 600 KB non-disjoint arrays
16 Halted 0 ms 0 KB -