oj.uz

답안 #867809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867809 2023-10-29T13:53:17 Z Ninedesu 슈퍼트리 잇기 (IOI20_supertrees) C++14
21 / 100
 186 ms 32336 KB 
#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;

const int N=1001;
int pa1[N],pa2[N],compo1[N],compo2[N];
bool vis1[N],vis2[N],way[N];
vector<int>adj[N],adj1[N],adj2[N],root1,root2;

int dsu1(int x){
	if(pa1[x]==x)return x;
	else return pa1[x]=dsu1(pa1[x]);
}

int dsu2(int x){
    if(pa2[x]==x)return x;
    else return pa2[x]=dsu2(pa2[x]);
}

void dfs(int u,int p){
    way[u]++;
    for(int v:adj[u]){
        if(way[v]){
            way[v]++;
            continue;
        }
        if(v!=p)dfs(v,u);
    }
}

int construct(vector<vector<int>> p) {
	int n=p.size();
	vector<vector<int>> answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		row.resize(n);
		answer.push_back(row);
		pa1[i]=i;
		pa2[i]=i;
	}
	for(int i=0; i<n; i++){
		for(int j=i+1; j<n; j++){
			if(p[i][j]==3)return 0;
			if(p[i][j]==1)pa1[dsu1(j)]=dsu1(i);
		}
	}
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(i!=j&&dsu1(i)==dsu1(j)){
                if(p[i][j]==0||p[i][j]==2)return 0;
                adj1[i].push_back(j);
                adj1[j].push_back(i);
            }
        }
    }
    for(int i=0; i<n; i++){
        if(vis1[i])continue;
        root1.push_back(i);
        compo1[i]=i;
        for(int j:adj1[i]){
            compo1[j]=i;
            vis1[j]=true;
            answer[i][j]=1;
            answer[j][i]=1;
        }
    }
    for(int i=0; i<root1.size(); i++){
        for(int j=i+1; j<root1.size(); j++){
            int a=root1[i],b=root1[j];
            if(p[a][b]==2)pa2[dsu2(a)]=dsu2(b);
        }
    }
    for(int i:root1){
        for(int j:root1){
            if(i!=j&&dsu2(i)==dsu2(j)){
                if(p[i][j]==0||p[i][j]==1)return 0;
                adj2[i].push_back(j);
                adj2[j].push_back(i);
            }
        }
    }
    for(int i:root1){
        if(vis2[i])continue;
        root2.push_back(i);
        compo2[i]=i;
        for(int j:adj2[i]){
            compo2[j]=i;
            vis2[j]=true;
        }
    }
    for(int i=0; i<n; i++){
        for(int j:root2){
            if(compo1[i]==compo1[j])compo2[i]=j;
        }
    }
    for(int i:root2){
        for(int j=1; j<adj2[i].size(); j++){
            answer[adj2[i][j]][adj2[i][j-1]]=1;
            answer[adj2[i][j-1]][adj2[i][j]]=1;
        }
		if(adj2[i].empty())continue;
        answer[adj2[i][0]][i]=1;
        answer[i][adj2[i][0]]=1;
        answer[adj2[i][adj2[i].size()-1]][i]=1;
        answer[i][adj2[i][adj2[i].size()-1]]=1;
    }
    for(int i=0; i<n; i++){
        for(int j=i+1; j<n; j++){
            if(answer[i][j]){
                adj[i].push_back(j);
                adj[j].push_back(i);
            }
        }
    }
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++)way[j]=0;
        dfs(i,-1);
        for(int j=0; j<n; j++)if(way[j]!=p[i][j])return 0;
    }

	build(answer);
	return 1;
}

/*
6
1 2 2 0 0 1
2 1 2 1 0 0
2 2 2 0 1 0
0 1 0 1 2 2
0 0 1 2 1 2
1 0 0 2 2 1
*/

Compilation message

supertrees.cpp: In function 'void dfs(int, int)':
supertrees.cpp:21:10: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
   21 |     way[u]++;
      |     ~~~~~^
supertrees.cpp:24:18: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
   24 |             way[v]++;
      |             ~~~~~^
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:67:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i=0; i<root1.size(); i++){
      |                  ~^~~~~~~~~~~~~
supertrees.cpp:68:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         for(int j=i+1; j<root1.size(); j++){
      |                        ~^~~~~~~~~~~~~
supertrees.cpp:97:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |         for(int j=1; j<adj2[i].size(); j++){
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1892 KB Output is correct
7 Correct 178 ms 32336 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1892 KB Output is correct
7 Correct 178 ms 32336 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 186 ms 24104 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 86 ms 14068 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 44 ms 6736 KB Output is correct
21 Correct 173 ms 25172 KB Output is correct
22 Correct 169 ms 24152 KB Output is correct
23 Correct 184 ms 28152 KB Output is correct
24 Correct 177 ms 24152 KB Output is correct
25 Correct 78 ms 14172 KB Output is correct
26 Correct 76 ms 14172 KB Output is correct
27 Correct 180 ms 30304 KB Output is correct
28 Correct 173 ms 24176 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1892 KB Output is correct
7 Correct 178 ms 32336 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 186 ms 24104 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 86 ms 14068 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 44 ms 6736 KB Output is correct
21 Correct 173 ms 25172 KB Output is correct
22 Correct 169 ms 24152 KB Output is correct
23 Correct 184 ms 28152 KB Output is correct
24 Correct 177 ms 24152 KB Output is correct
25 Correct 78 ms 14172 KB Output is correct
26 Correct 76 ms 14172 KB Output is correct
27 Correct 180 ms 30304 KB Output is correct
28 Correct 173 ms 24176 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 508 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 0 ms 376 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 1892 KB Output is correct
7 Correct 178 ms 32336 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 352 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 186 ms 24104 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 86 ms 14068 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 44 ms 6736 KB Output is correct
21 Correct 173 ms 25172 KB Output is correct
22 Correct 169 ms 24152 KB Output is correct
23 Correct 184 ms 28152 KB Output is correct
24 Correct 177 ms 24152 KB Output is correct
25 Correct 78 ms 14172 KB Output is correct
26 Correct 76 ms 14172 KB Output is correct
27 Correct 180 ms 30304 KB Output is correct
28 Correct 173 ms 24176 KB Output is correct
29 Correct 0 ms 352 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 508 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 0 ms 376 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -