oj.uz

답안 #434671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
434671 2021-06-21T14:22:40 Z pere_gil 슈퍼트리 잇기 (IOI20_supertrees) C++14
56 / 100
 279 ms 22188 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;

#define vvi vector<vector<int> >

void pri_graph(vvi &v){
	for(int i=0;i<v.size();i++)
		for(int j=i;j<v.size();j++)
			if(v[i][j]) printf("%d <-> %d\n",i,j);
	printf("\n");
}

void init(int n, vector<int> &p){
	for(int i=0;i<n;i++) p[i]=i;
}

int find_set(int n, vector<int> &p){
	return (n==p[n]) ? n : p[n]=find_set(p[n],p);
}

bool same_set(int a, int b, vector<int> &p){
	return find_set(a,p)==find_set(b,p);
}

void union_set(int a, int b, vector<int> &p){
	if(!same_set(a,b,p)) p[find_set(a,p)]=find_set(b,p);
}

vector<int> to_vector(unordered_set<int> &s){
	unordered_set<int> :: iterator it;
	vector<int> v;
	for(it=s.begin();it!=s.end();it++)
		v.push_back(*it);
	return v;
}

void join_1(vector<int> &g, vvi &res){
	for(int i=1;i<g.size();i++)
		res[g[i-1]][g[i]]=res[g[i]][g[i-1]]=1;
}

void join_2(vector<int> &g, vvi &res){
	if(g.size()<3) return;
	for(int i=0;i<g.size();i++){
		int j=(i+1)%g.size();
		res[g[i]][g[j]]=res[g[j]][g[i]]=1;
	}
}

void make_group(int n, vector<int> &g, vvi &v, vvi &res){
	vector<int> p(n);
	init(n,p);

	unordered_set<int> mid;
	for(int i=0;i<g.size();i++){
		int aux=0;
		for(int j=0;j<g.size();j++)
			if(v[g[i]][g[j]]==1) union_set(g[i],g[j],p);
			else aux++;
		if(aux==g.size()-1) mid.insert(g[i]);
	}
	vvi one(n);
	for(int i=0;i<g.size();i++){
		if(mid.find(g[i])==mid.end())
			one[find_set(g[i],p)].push_back(g[i]);
		if(g[i]==find_set(g[i],p)) mid.insert(g[i]);
	}
	vector<int> v_mid=to_vector(mid);

	/*
	printf("The middle: ");
	for(int i=0;i<v_mid.size();i++) printf("%d ",v_mid[i]);
	printf("\nGroup of one\n");
	for(int i=0;i<n;i++){
		if(!one[i].size()) continue;
		for(int j=0;j<one[i].size();j++) printf("%d ",one[i][j]);
		printf("\n");
	}
	*/

	join_2(v_mid,res);
	for(int i=0;i<n;i++)
		if(one[i].size()) join_1(one[i],res);
}

int construct(vvi v){
	int n=v.size();

	vector<int> p(n);
	init(n,p);
	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(v[i][j]) union_set(i,j,p);

    vvi g(n);
	for(int i=0;i<n;i++)
		g[find_set(i,p)].push_back(i);

	for(int i=0;i<n;i++)
		for(int j=0;j<n;j++)
			if(same_set(i,j,p) && v[i][j]==0) return 0;

	vvi res(n,vector<int> (n,0));
	for(int i=0;i<n;i++)
		if(g[i].size()>0)
			make_group(n,g[i],v,res);
	
	//pri_graph(res);
	
	build(res);
	return 1;
}

Compilation message

supertrees.cpp: In function 'void pri_graph(std::vector<std::vector<int> >&)':
supertrees.cpp:8:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~
supertrees.cpp:9:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |   for(int j=i;j<v.size();j++)
      |               ~^~~~~~~~~
supertrees.cpp: In function 'void join_1(std::vector<int>&, std::vector<std::vector<int> >&)':
supertrees.cpp:39:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i=1;i<g.size();i++)
      |              ~^~~~~~~~~
supertrees.cpp: In function 'void join_2(std::vector<int>&, std::vector<std::vector<int> >&)':
supertrees.cpp:45:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp: In function 'void make_group(int, std::vector<int>&, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&)':
supertrees.cpp:56:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp:58:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int j=0;j<g.size();j++)
      |               ~^~~~~~~~~
supertrees.cpp:61:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |   if(aux==g.size()-1) mid.insert(g[i]);
      |      ~~~^~~~~~~~~~~~
supertrees.cpp:64:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |  for(int i=0;i<g.size();i++){
      |              ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1160 KB Output is correct
7 Correct 251 ms 22084 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1160 KB Output is correct
7 Correct 251 ms 22084 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1168 KB Output is correct
13 Correct 253 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 123 ms 8200 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 73 ms 5760 KB Output is correct
21 Correct 255 ms 22012 KB Output is correct
22 Correct 239 ms 22080 KB Output is correct
23 Correct 264 ms 21960 KB Output is correct
24 Correct 243 ms 22016 KB Output is correct
25 Correct 102 ms 8132 KB Output is correct
26 Correct 97 ms 8184 KB Output is correct
27 Correct 262 ms 22032 KB Output is correct
28 Correct 235 ms 22188 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 59 ms 5756 KB Output is correct
5 Correct 251 ms 21972 KB Output is correct
6 Correct 247 ms 22024 KB Output is correct
7 Correct 257 ms 22084 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 61 ms 5752 KB Output is correct
10 Correct 249 ms 22084 KB Output is correct
11 Correct 247 ms 21972 KB Output is correct
12 Correct 279 ms 21976 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 60 ms 5760 KB Output is correct
17 Correct 266 ms 22020 KB Output is correct
18 Correct 259 ms 22036 KB Output is correct
19 Correct 256 ms 22084 KB Output is correct
20 Correct 236 ms 22016 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1160 KB Output is correct
7 Correct 251 ms 22084 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1168 KB Output is correct
13 Correct 253 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 123 ms 8200 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 73 ms 5760 KB Output is correct
21 Correct 255 ms 22012 KB Output is correct
22 Correct 239 ms 22080 KB Output is correct
23 Correct 264 ms 21960 KB Output is correct
24 Correct 243 ms 22016 KB Output is correct
25 Correct 102 ms 8132 KB Output is correct
26 Correct 97 ms 8184 KB Output is correct
27 Correct 262 ms 22032 KB Output is correct
28 Correct 235 ms 22188 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 14 ms 1160 KB Output is correct
7 Correct 251 ms 22084 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 12 ms 1168 KB Output is correct
13 Correct 253 ms 22084 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 588 KB Output is correct
17 Correct 123 ms 8200 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 73 ms 5760 KB Output is correct
21 Correct 255 ms 22012 KB Output is correct
22 Correct 239 ms 22080 KB Output is correct
23 Correct 264 ms 21960 KB Output is correct
24 Correct 243 ms 22016 KB Output is correct
25 Correct 102 ms 8132 KB Output is correct
26 Correct 97 ms 8184 KB Output is correct
27 Correct 262 ms 22032 KB Output is correct
28 Correct 235 ms 22188 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -