oj.uz

답안 #1066077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066077 2024-08-19T14:49:33 Z pcc 가장 긴 여행 (IOI23_longesttrip) C++17
70 / 100
 71 ms 1112 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

#define vi vector<int>

const int mxn = 300;

vector<int> perm;
 
int ask(vector<int> a,vector<int> b){
	for(auto &i:a)i = perm[i];
	for(auto &i:b)i = perm[i];
	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];
	//cerr<<"ASK: "<<a<<','<<b<<endl;
	return dp[a][b] = dp[b][a] = 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(i != now&&!vis[i]&&ask(now,i))dfs(i);
	}
	return;
}


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

std::vector<int> longest_trip(int NN, int D){
	N = NN;
	perm = vector<int>(N);iota(perm.begin(),perm.end(),0);
	memset(dp,-1,sizeof(dp));
	vis.reset();
	for(int i = 0;i<N;i++){
		dp[i][i] = 1;
	}
	/*
	dfs(1);
	if(vis.count() != N){
		return get_max_cc();
	}
	*/
	cerr<<"------------------------"<<endl;
	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{
			auto c = dq[0];
			while(c.size()>1){
				int mid = c.size()/2;
				deque<int> tmp;
				for(int i = 0;i<mid;i++)tmp.push_back(c[i]);
				if(ask(tmp,now))while(c.size()>mid)c.pop_back();
				else for(int i = 0;i<mid;i++)c.pop_front();
			}
			int tar = -1;
			//cerr<<now<<"::";for(auto &i:c)cerr<<i<<',';cerr<<endl;
			if(c.size()==1&&ask(c,now))tar = c[0];
			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);
	for(auto &i:ans)i = perm[i];
	return ans;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> get_max_cc()':
longesttrip.cpp:50:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::size_t' {aka 'long unsigned int'} [-Wsign-compare]
   50 |    if(ans<vis.count()){
      |       ~~~^~~~~~~~~~~~
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:124:35: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |     if(ask(tmp,now))while(c.size()>mid)c.pop_back();
      |                           ~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 6 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 6 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 10 ms 804 KB Output is correct
7 Correct 8 ms 600 KB Output is correct
8 Correct 6 ms 600 KB Output is correct
9 Correct 7 ms 856 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 8 ms 812 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 7 ms 812 KB Output is correct
14 Correct 14 ms 600 KB Output is correct
15 Correct 17 ms 856 KB Output is correct
16 Correct 13 ms 600 KB Output is correct
17 Correct 11 ms 600 KB Output is correct
18 Correct 10 ms 600 KB Output is correct
19 Correct 9 ms 600 KB Output is correct
20 Correct 11 ms 600 KB Output is correct
21 Correct 15 ms 1112 KB Output is correct
22 Correct 12 ms 816 KB Output is correct
23 Correct 9 ms 600 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 13 ms 600 KB Output is correct
26 Correct 14 ms 856 KB Output is correct
27 Correct 16 ms 600 KB Output is correct
28 Correct 10 ms 600 KB Output is correct
29 Correct 11 ms 600 KB Output is correct
30 Correct 9 ms 600 KB Output is correct
31 Correct 34 ms 600 KB Output is correct
32 Correct 48 ms 600 KB Output is correct
33 Correct 9 ms 600 KB Output is correct
34 Correct 13 ms 600 KB Output is correct
35 Correct 19 ms 600 KB Output is correct
36 Correct 6 ms 600 KB Output is correct
37 Correct 19 ms 600 KB Output is correct
38 Correct 39 ms 600 KB Output is correct
39 Correct 65 ms 1072 KB Output is correct
40 Correct 71 ms 856 KB Output is correct
41 Correct 55 ms 600 KB Output is correct
42 Correct 62 ms 812 KB Output is correct
43 Correct 55 ms 600 KB Output is correct
44 Correct 53 ms 820 KB Output is correct
45 Correct 15 ms 856 KB Output is correct
46 Correct 11 ms 600 KB Output is correct
47 Correct 15 ms 600 KB Output is correct
48 Correct 8 ms 600 KB Output is correct
49 Correct 12 ms 600 KB Output is correct
50 Correct 6 ms 600 KB Output is correct
51 Correct 22 ms 600 KB Output is correct
52 Correct 28 ms 600 KB Output is correct
53 Correct 9 ms 600 KB Output is correct
54 Correct 11 ms 600 KB Output is correct
55 Correct 13 ms 800 KB Output is correct
56 Correct 5 ms 600 KB Output is correct
57 Correct 14 ms 824 KB Output is correct
58 Correct 35 ms 1100 KB Output is correct
59 Correct 42 ms 600 KB Output is correct
60 Correct 47 ms 852 KB Output is correct
61 Correct 21 ms 600 KB Output is correct
62 Correct 40 ms 600 KB Output is correct
63 Correct 45 ms 804 KB Output is correct
64 Correct 40 ms 600 KB Output is correct

Subtask #4
30.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 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 5 ms 600 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 11 ms 800 KB Output is correct
7 Correct 8 ms 600 KB Output is correct
8 Correct 11 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 8 ms 600 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 6 ms 808 KB Output is correct
14 Correct 12 ms 600 KB Output is correct
15 Correct 21 ms 600 KB Output is correct
16 Correct 12 ms 600 KB Output is correct
17 Correct 11 ms 600 KB Output is correct
18 Correct 9 ms 600 KB Output is correct
19 Correct 14 ms 600 KB Output is correct
20 Correct 11 ms 600 KB Output is correct
21 Correct 19 ms 600 KB Output is correct
22 Correct 14 ms 856 KB Output is correct
23 Correct 12 ms 600 KB Output is correct
24 Correct 10 ms 600 KB Output is correct
25 Correct 11 ms 596 KB Output is correct
26 Correct 9 ms 600 KB Output is correct
27 Correct 35 ms 600 KB Output is correct
28 Partially correct 29 ms 600 KB Output is partially correct
29 Correct 7 ms 596 KB Output is correct
30 Correct 13 ms 600 KB Output is correct
31 Partially correct 18 ms 600 KB Output is partially correct
32 Correct 15 ms 600 KB Output is correct
33 Correct 13 ms 800 KB Output is correct
34 Correct 10 ms 600 KB Output is correct
35 Correct 9 ms 596 KB Output is correct
36 Correct 10 ms 600 KB Output is correct
37 Correct 6 ms 600 KB Output is correct
38 Correct 29 ms 600 KB Output is correct
39 Correct 25 ms 600 KB Output is correct
40 Correct 9 ms 600 KB Output is correct
41 Correct 12 ms 856 KB Output is correct
42 Correct 10 ms 600 KB Output is correct
43 Partially correct 10 ms 856 KB Output is partially correct
44 Partially correct 10 ms 600 KB Output is partially correct
45 Partially correct 9 ms 600 KB Output is partially correct
46 Partially correct 14 ms 596 KB Output is partially correct
47 Partially correct 12 ms 600 KB Output is partially correct
48 Partially correct 28 ms 856 KB Output is partially correct
49 Partially correct 44 ms 600 KB Output is partially correct
50 Partially correct 53 ms 856 KB Output is partially correct
51 Partially correct 52 ms 856 KB Output is partially correct
52 Partially correct 52 ms 600 KB Output is partially correct
53 Partially correct 61 ms 856 KB Output is partially correct
54 Partially correct 49 ms 852 KB Output is partially correct
55 Partially correct 57 ms 856 KB Output is partially correct
56 Partially correct 18 ms 600 KB Output is partially correct
57 Partially correct 41 ms 852 KB Output is partially correct
58 Partially correct 61 ms 600 KB Output is partially correct
59 Partially correct 55 ms 796 KB Output is partially correct
60 Partially correct 52 ms 600 KB Output is partially correct
61 Partially correct 54 ms 812 KB Output is partially correct
62 Correct 5 ms 600 KB Output is correct
63 Partially correct 21 ms 856 KB Output is partially correct
64 Partially correct 39 ms 600 KB Output is partially correct
65 Partially correct 40 ms 600 KB Output is partially correct
66 Partially correct 44 ms 600 KB Output is partially correct
67 Partially correct 27 ms 600 KB Output is partially correct
68 Partially correct 40 ms 596 KB Output is partially correct
69 Partially correct 41 ms 600 KB Output is partially correct
70 Partially correct 40 ms 812 KB Output is partially correct
71 Partially correct 17 ms 860 KB Output is partially correct
72 Partially correct 30 ms 808 KB Output is partially correct
73 Partially correct 25 ms 856 KB Output is partially correct
74 Partially correct 41 ms 600 KB Output is partially correct
75 Partially correct 32 ms 812 KB Output is partially correct
76 Partially correct 47 ms 856 KB Output is partially correct
77 Partially correct 17 ms 600 KB Output is partially correct
78 Partially correct 40 ms 800 KB Output is partially correct
79 Partially correct 36 ms 600 KB Output is partially correct
80 Partially correct 46 ms 600 KB Output is partially correct
81 Partially correct 39 ms 600 KB Output is partially correct
82 Partially correct 29 ms 788 KB Output is partially correct