oj.uz

Submission #522447

# Submission time Handle Problem Language Result Execution time Memory
522447 2022-02-05T04:08:44 Z krit3379 Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 222 ms 28008 KB 
#include<bits/stdc++.h>
using namespace std;
#include "supertrees.h"
#define N 1005

int p[N],pp[N];
vector<int> v;
vector<vector<int>> a,b;
bitset<N> vis,ch;

int fp(int v){return (v==p[v])?v:p[v]=fp(p[v]);}
int fpp(int v){return (v==pp[v])?v:pp[v]=fpp(pp[v]);}

bool sol(int n){
    int i,j,cy=0,head,num;
    vector<int> gr[N],u;
    ch=0;
    iota(pp,pp+n,0);
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            num=a[v[i]][v[j]];
            if(num==1){
                if(fpp(i)!=fpp(j))pp[fpp(i)]=fpp(j);
            }
            else if(!cy){
                cy=num;
            }
            else if(cy!=num)return false;

        }
    }
    for(i=0;i<n;i++)gr[fpp(i)].push_back(v[i]);
    if(!cy){
        for(i=1;i<n;i++)b[v[i]][v[i-1]]=b[v[i-1]][v[i]]=1;
        return true;
    }
    else{
        for(i=0;i<n;i++){
            if(ch[fpp(i)])continue;
            head=fpp(i);
            u.push_back(v[head]);
            ch[head]=true;
            for(auto x:gr[head]){
                for(j=0;j<n;j++){
                    if(fpp(j)==head){
                        if(a[x][v[j]]!=1)return false;
                    }
                    else{
                        if(a[x][v[j]]!=cy)return false;
                    }
                }
            }
        }
        for(i=0;i<n;i++)
            for(j=1;j<gr[i].size();j++)b[gr[i][j]][gr[i][j-1]]=b[gr[i][j-1]][gr[i][j]]=1;
        if(cy==2){
            if(u.size()<3)return false;
            for(i=1;i<u.size();i++)b[u[i]][u[i-1]]=b[u[i-1]][u[i]]=1;
            b[u[0]][u.back()]=b[u.back()][u[0]]=1;
            return true;
        }
        else{
            if(u.size()<4)return false;
            for(i=1;i<u.size();i++)b[u[i]][u[i-1]]=b[u[i-1]][u[i]]=1;
            b[u[0]][u.back()]=b[u.back()][u[0]]=1;
            b[u[0]][u[2]]=b[u[2]][u[0]]=1;
            return true;
        }
    }
}

int construct(vector<vector<int>> input) {
    a=input;
	int n=a.size(),i,j,m;
	bool flag;
	iota(p,p+n,0);
	for(i=0;i<n;i++){
        b.push_back({});
        b[i].resize(n);
        for(j=0;j<n;j++){
            if(a[i][j]){
                if(fp(i)==fp(j))continue;
                p[fp(i)]=fp(j);
            }
            else if(fp(i)==fp(j))return 0;
        }
	}
	for(i=0;i<n;i++){
        if(!vis[fp(i)]){
            vis[fp(i)]=true;
            for(j=0;j<n;j++)if(fp(i)==fp(j))v.push_back(j);
            m=v.size();
            flag=sol(m);
            v.clear();
            if(!flag)return 0;
        }
	}
	build(b);
	return 1;
}

Compilation message

supertrees.cpp: In function 'bool sol(int)':
supertrees.cpp:55:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |             for(j=1;j<gr[i].size();j++)b[gr[i][j]][gr[i][j-1]]=b[gr[i][j-1]][gr[i][j]]=1;
      |                     ~^~~~~~~~~~~~~
supertrees.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |             for(i=1;i<u.size();i++)b[u[i]][u[i-1]]=b[u[i-1]][u[i]]=1;
      |                     ~^~~~~~~~~
supertrees.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             for(i=1;i<u.size();i++)b[u[i]][u[i-1]]=b[u[i-1]][u[i]]=1;
      |                     ~^~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1352 KB Output is correct
7 Correct 174 ms 25992 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1352 KB Output is correct
7 Correct 174 ms 25992 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 179 ms 25912 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 77 ms 12036 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 46 ms 6852 KB Output is correct
21 Correct 175 ms 25996 KB Output is correct
22 Correct 179 ms 25928 KB Output is correct
23 Correct 180 ms 25996 KB Output is correct
24 Correct 176 ms 25984 KB Output is correct
25 Correct 80 ms 15232 KB Output is correct
26 Correct 74 ms 13184 KB Output is correct
27 Correct 177 ms 26008 KB Output is correct
28 Correct 181 ms 26108 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 8 ms 1356 KB Output is correct
9 Correct 193 ms 25992 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 9 ms 1348 KB Output is correct
13 Correct 176 ms 25984 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 5 ms 708 KB Output is correct
17 Correct 79 ms 12040 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 43 ms 6720 KB Output is correct
22 Correct 170 ms 27876 KB Output is correct
23 Correct 196 ms 27916 KB Output is correct
24 Correct 180 ms 27936 KB Output is correct
25 Correct 96 ms 17988 KB Output is correct
26 Correct 69 ms 14188 KB Output is correct
27 Correct 171 ms 27920 KB Output is correct
28 Correct 184 ms 27892 KB Output is correct
29 Correct 76 ms 18036 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 44 ms 6720 KB Output is correct
5 Correct 173 ms 25980 KB Output is correct
6 Correct 184 ms 26040 KB Output is correct
7 Correct 180 ms 26000 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 46 ms 6764 KB Output is correct
10 Correct 173 ms 27932 KB Output is correct
11 Correct 177 ms 27908 KB Output is correct
12 Correct 222 ms 27964 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 44 ms 7264 KB Output is correct
17 Correct 204 ms 27904 KB Output is correct
18 Correct 215 ms 27924 KB Output is correct
19 Correct 178 ms 27884 KB Output is correct
20 Correct 169 ms 27904 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1352 KB Output is correct
7 Correct 174 ms 25992 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 179 ms 25912 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 77 ms 12036 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 46 ms 6852 KB Output is correct
21 Correct 175 ms 25996 KB Output is correct
22 Correct 179 ms 25928 KB Output is correct
23 Correct 180 ms 25996 KB Output is correct
24 Correct 176 ms 25984 KB Output is correct
25 Correct 80 ms 15232 KB Output is correct
26 Correct 74 ms 13184 KB Output is correct
27 Correct 177 ms 26008 KB Output is correct
28 Correct 181 ms 26108 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 8 ms 1356 KB Output is correct
37 Correct 193 ms 25992 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 9 ms 1348 KB Output is correct
41 Correct 176 ms 25984 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 708 KB Output is correct
45 Correct 79 ms 12040 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 43 ms 6720 KB Output is correct
50 Correct 170 ms 27876 KB Output is correct
51 Correct 196 ms 27916 KB Output is correct
52 Correct 180 ms 27936 KB Output is correct
53 Correct 96 ms 17988 KB Output is correct
54 Correct 69 ms 14188 KB Output is correct
55 Correct 171 ms 27920 KB Output is correct
56 Correct 184 ms 27892 KB Output is correct
57 Correct 76 ms 18036 KB Output is correct
58 Correct 1 ms 296 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 4 ms 820 KB Output is correct
61 Correct 85 ms 14060 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 292 KB Output is correct
65 Correct 46 ms 7280 KB Output is correct
66 Correct 70 ms 14120 KB Output is correct
67 Correct 67 ms 14076 KB Output is correct
68 Correct 76 ms 15600 KB Output is correct
69 Correct 71 ms 17960 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory 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 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 7 ms 1352 KB Output is correct
7 Correct 174 ms 25992 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 179 ms 25912 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 7 ms 716 KB Output is correct
17 Correct 77 ms 12036 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 46 ms 6852 KB Output is correct
21 Correct 175 ms 25996 KB Output is correct
22 Correct 179 ms 25928 KB Output is correct
23 Correct 180 ms 25996 KB Output is correct
24 Correct 176 ms 25984 KB Output is correct
25 Correct 80 ms 15232 KB Output is correct
26 Correct 74 ms 13184 KB Output is correct
27 Correct 177 ms 26008 KB Output is correct
28 Correct 181 ms 26108 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 8 ms 1356 KB Output is correct
37 Correct 193 ms 25992 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 9 ms 1348 KB Output is correct
41 Correct 176 ms 25984 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 0 ms 204 KB Output is correct
44 Correct 5 ms 708 KB Output is correct
45 Correct 79 ms 12040 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 43 ms 6720 KB Output is correct
50 Correct 170 ms 27876 KB Output is correct
51 Correct 196 ms 27916 KB Output is correct
52 Correct 180 ms 27936 KB Output is correct
53 Correct 96 ms 17988 KB Output is correct
54 Correct 69 ms 14188 KB Output is correct
55 Correct 171 ms 27920 KB Output is correct
56 Correct 184 ms 27892 KB Output is correct
57 Correct 76 ms 18036 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 44 ms 6720 KB Output is correct
62 Correct 173 ms 25980 KB Output is correct
63 Correct 184 ms 26040 KB Output is correct
64 Correct 180 ms 26000 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 46 ms 6764 KB Output is correct
67 Correct 173 ms 27932 KB Output is correct
68 Correct 177 ms 27908 KB Output is correct
69 Correct 222 ms 27964 KB Output is correct
70 Correct 1 ms 296 KB Output is correct
71 Correct 1 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 44 ms 7264 KB Output is correct
74 Correct 204 ms 27904 KB Output is correct
75 Correct 215 ms 27924 KB Output is correct
76 Correct 178 ms 27884 KB Output is correct
77 Correct 169 ms 27904 KB Output is correct
78 Correct 1 ms 296 KB Output is correct
79 Correct 1 ms 204 KB Output is correct
80 Correct 4 ms 820 KB Output is correct
81 Correct 85 ms 14060 KB Output is correct
82 Correct 0 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 292 KB Output is correct
85 Correct 46 ms 7280 KB Output is correct
86 Correct 70 ms 14120 KB Output is correct
87 Correct 67 ms 14076 KB Output is correct
88 Correct 76 ms 15600 KB Output is correct
89 Correct 71 ms 17960 KB Output is correct
90 Correct 1 ms 204 KB Output is correct
91 Correct 1 ms 204 KB Output is correct
92 Correct 4 ms 844 KB Output is correct
93 Correct 107 ms 14064 KB Output is correct
94 Correct 1 ms 204 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 292 KB Output is correct
97 Correct 21 ms 3940 KB Output is correct
98 Correct 101 ms 14324 KB Output is correct
99 Correct 90 ms 14660 KB Output is correct
100 Correct 76 ms 14316 KB Output is correct
101 Correct 85 ms 18032 KB Output is correct
102 Incorrect 187 ms 28008 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -