oj.uz

Submission #522443

# Submission time Handle Problem Language Result Execution time Memory
522443 2022-02-05T03:53:30 Z krit3379 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 197 ms 28068 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(head);
            ch[head]=true;
            for(auto x:gr[head]){
                for(j=0;j<n;j++){
                    if(fpp(j)==head){
                        if(a[x][j]!=1)return false;
                    }
                    else{
                        if(a[x][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 0 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 1 ms 276 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 8 ms 1460 KB Output is correct
7 Correct 197 ms 27948 KB Output is correct

Subtask #2
10.0 / 10.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 1 ms 204 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 8 ms 1460 KB Output is correct
7 Correct 197 ms 27948 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 276 KB Output is correct
12 Correct 14 ms 1460 KB Output is correct
13 Correct 195 ms 28068 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 4 ms 796 KB Output is correct
17 Correct 91 ms 14080 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 48 ms 7236 KB Output is correct
21 Correct 185 ms 27940 KB Output is correct
22 Correct 175 ms 27900 KB Output is correct
23 Correct 187 ms 27952 KB Output is correct
24 Correct 181 ms 27996 KB Output is correct
25 Correct 76 ms 17224 KB Output is correct
26 Correct 76 ms 15172 KB Output is correct
27 Correct 197 ms 27884 KB Output is correct
28 Correct 177 ms 27972 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 7 ms 1424 KB Output is correct
9 Correct 169 ms 27900 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 292 KB Output is correct
12 Correct 7 ms 1464 KB Output is correct
13 Correct 172 ms 27892 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 844 KB Output is correct
17 Correct 75 ms 14068 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Incorrect 19 ms 4676 KB Answer gives possible 0 while actual possible 1
22 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 44 ms 7268 KB Output is correct
5 Correct 173 ms 27900 KB Output is correct
6 Correct 178 ms 27896 KB Output is correct
7 Correct 190 ms 27900 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 22 ms 4716 KB Answer gives possible 0 while actual possible 1
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 1 ms 204 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 8 ms 1460 KB Output is correct
7 Correct 197 ms 27948 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 276 KB Output is correct
12 Correct 14 ms 1460 KB Output is correct
13 Correct 195 ms 28068 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 4 ms 796 KB Output is correct
17 Correct 91 ms 14080 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 48 ms 7236 KB Output is correct
21 Correct 185 ms 27940 KB Output is correct
22 Correct 175 ms 27900 KB Output is correct
23 Correct 187 ms 27952 KB Output is correct
24 Correct 181 ms 27996 KB Output is correct
25 Correct 76 ms 17224 KB Output is correct
26 Correct 76 ms 15172 KB Output is correct
27 Correct 197 ms 27884 KB Output is correct
28 Correct 177 ms 27972 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 7 ms 1424 KB Output is correct
37 Correct 169 ms 27900 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 292 KB Output is correct
40 Correct 7 ms 1464 KB Output is correct
41 Correct 172 ms 27892 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 75 ms 14068 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Incorrect 19 ms 4676 KB Answer gives possible 0 while actual possible 1
50 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 1 ms 204 KB Output is correct
4 Correct 1 ms 276 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 8 ms 1460 KB Output is correct
7 Correct 197 ms 27948 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 276 KB Output is correct
12 Correct 14 ms 1460 KB Output is correct
13 Correct 195 ms 28068 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 276 KB Output is correct
16 Correct 4 ms 796 KB Output is correct
17 Correct 91 ms 14080 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 48 ms 7236 KB Output is correct
21 Correct 185 ms 27940 KB Output is correct
22 Correct 175 ms 27900 KB Output is correct
23 Correct 187 ms 27952 KB Output is correct
24 Correct 181 ms 27996 KB Output is correct
25 Correct 76 ms 17224 KB Output is correct
26 Correct 76 ms 15172 KB Output is correct
27 Correct 197 ms 27884 KB Output is correct
28 Correct 177 ms 27972 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 296 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 7 ms 1424 KB Output is correct
37 Correct 169 ms 27900 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 292 KB Output is correct
40 Correct 7 ms 1464 KB Output is correct
41 Correct 172 ms 27892 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 844 KB Output is correct
45 Correct 75 ms 14068 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Incorrect 19 ms 4676 KB Answer gives possible 0 while actual possible 1
50 Halted 0 ms 0 KB -