Submission #867101

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
867101	2023-10-27T16:54:01 Z	Ninedesu	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	200 ms	32188 KB

supertrees

#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],chk1,chk2;
vector<int>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]);
}

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: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;
    }

	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:58:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i=0; i<root1.size(); i++){
      |                  ~^~~~~~~~~~~~~
supertrees.cpp:59:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for(int j=i+1; j<root1.size(); j++){
      |                        ~^~~~~~~~~~~~~
supertrees.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(int j=1; j<adj2[i].size(); j++){
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1716 KB	Output is correct
7	Correct	200 ms	32188 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1716 KB	Output is correct
7	Correct	200 ms	32188 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	488 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	7 ms	1372 KB	Output is correct
13	Correct	168 ms	24024 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	984 KB	Output is correct
17	Correct	66 ms	14272 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	42 ms	6484 KB	Output is correct
21	Correct	154 ms	25168 KB	Output is correct
22	Correct	153 ms	24064 KB	Output is correct
23	Correct	160 ms	28244 KB	Output is correct
24	Correct	178 ms	24148 KB	Output is correct
25	Correct	60 ms	14160 KB	Output is correct
26	Correct	59 ms	14160 KB	Output is correct
27	Correct	170 ms	30292 KB	Output is correct
28	Correct	158 ms	23992 KB	Output is correct

Subtask #3
0 / 19.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	484 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Incorrect	344 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 KB	-

Subtask #4
0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	38 ms	6448 KB	Output is correct
5	Correct	156 ms	25172 KB	Output is correct
6	Correct	153 ms	24144 KB	Output is correct
7	Correct	187 ms	28364 KB	Output is correct
8	Incorrect	0 ms	348 KB	Too many ways to get from 0 to 3, should be 2 found no less than 3
9	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1716 KB	Output is correct
7	Correct	200 ms	32188 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	488 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	7 ms	1372 KB	Output is correct
13	Correct	168 ms	24024 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	984 KB	Output is correct
17	Correct	66 ms	14272 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	42 ms	6484 KB	Output is correct
21	Correct	154 ms	25168 KB	Output is correct
22	Correct	153 ms	24064 KB	Output is correct
23	Correct	160 ms	28244 KB	Output is correct
24	Correct	178 ms	24148 KB	Output is correct
25	Correct	60 ms	14160 KB	Output is correct
26	Correct	59 ms	14160 KB	Output is correct
27	Correct	170 ms	30292 KB	Output is correct
28	Correct	158 ms	23992 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	484 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	7 ms	1716 KB	Output is correct
7	Correct	200 ms	32188 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	488 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	7 ms	1372 KB	Output is correct
13	Correct	168 ms	24024 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	3 ms	984 KB	Output is correct
17	Correct	66 ms	14272 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	42 ms	6484 KB	Output is correct
21	Correct	154 ms	25168 KB	Output is correct
22	Correct	153 ms	24064 KB	Output is correct
23	Correct	160 ms	28244 KB	Output is correct
24	Correct	178 ms	24148 KB	Output is correct
25	Correct	60 ms	14160 KB	Output is correct
26	Correct	59 ms	14160 KB	Output is correct
27	Correct	170 ms	30292 KB	Output is correct
28	Correct	158 ms	23992 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	484 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	0 ms	344 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Submission #867101

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0