oj.uz

Submission #697684

# Submission time Handle Problem Language Result Execution time Memory
697684 2023-02-10T17:42:12 Z DJeniUp Connecting Supertrees (IOI20_supertrees) C++17
100 / 100
 177 ms 22160 KB 
#include "supertrees.h"
#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<ll,ll>pairll;

#define pb push_back
#define fr first
#define sc second
#define INF 10000000007

vector<vector<int> >ans;

ll h,f[1007],pr[1007],k[1007];

vector<ll>v[1007];

ll A(ll x){
    if(pr[x]!=x)pr[x]=A(pr[x]);
    return pr[x];
}

void S(ll x,ll y){
    if(rand()%2==0)swap(x,y);
    pr[A(x)]=A(y);
    return ;
}

int construct(std::vector<std::vector<int>> p) {
	ll n = p.size();
    
	for (int i = 0; i < n; i++) {
        pr[i]=i;
		std::vector<int> row;
		row.resize(n);
		ans.pb(row);
	}
    for(int i=0;i<n;i++){
        if(f[i]==0){
            for(int j=0;j<i;j++){
                if(p[i][j]==1){
                    ans[i][j]=1;
                    ans[j][i]=1;
                    S(i,j);
                    break;
                }
            }
        }
    }
    for(int i=0;i<n;i++){
        for(int j=1;j<=h;j++){
            ll fl=0;
            for(auto it:v[j]){
                if(p[i][it]!=2)fl=1;
            }
            if(f[i]==2 && fl==0 && A(i)!=A(v[j][0]))return 0;
            if(fl==0 && A(i)!=A(v[j][0])){
                //cout<<i<<" "<<j<<endl;
                S(i,v[j][0]);
                v[j].pb(i);
                f[i]=2;
            }
        }
        if(f[i]!=2){
            for(int j=0;j<i;j++){
                if(p[i][j]==2 && A(i)!=A(j)){
                    
                    h++;
                    S(i,j);
                    //cout<<i<<" "<<h<<endl;
                    //cout<<j<<" "<<h<<endl;
                    f[i]=2;
                    f[j]=2;
                    v[h].pb(i);
                    v[h].pb(j);
                    break;
                }
            }
        }
    }
    //cout<<1<<endl;
    for(int i=0;i<n;i++){
        if(f[i]==0){
            for(int j=0;j<n;j++){
                if(p[i][j]==1 && f[j]==2){
                    f[i]=3;
                    k[i]=j;
                    break;
                }
            }
        }
    }
    //for(int i=0;i<n;i++)cout<<f[i]<<" ";
    //cout<<endl;
    
    for(int i=0;i<n;i++){
        for(int j=0;j<i;j++){
            if(p[i][j]==0){
                if(A(j)==A(i))return 0;
            }
            if(p[i][j]==1){
                if(f[i]==3 && f[j]==3 && k[i]==k[j])continue;
                else if(f[i]==2 && f[j]==3 && i==k[j])continue;
                else if(f[i]==3 && f[j]==2 && j==k[i])continue;
                else if(f[i]==0 && f[j]==0 && A(i)==A(j))continue;
                else return 0;
            }
            if(p[i][j]==2){
                if(f[i]==2 && f[j]==2 && A(i)==A(j))continue;
                else if(f[i]==2 && f[j]==3 && k[j]!=i)continue;
                else if(f[i]==3 && f[j]==2 && k[i]!=j)continue;
                else if(f[i]==3 && f[j]==3 && k[i]!=k[j])continue;
                else return 0;
            }
            if(p[i][j]==3)return 0;
        }
    }
    //cout<<2<<endl;
    for(int i=1;i<=h;i++){
        if(v[i].size()<=2)return 0;
        for(int j=1;j<v[i].size();j++){
            ans[v[i][j]][v[i][j-1]]=1;
            ans[v[i][j-1]][v[i][j]]=1;
        }
        ans[v[i][v[i].size()-1]][v[i][0]]=1;
        ans[v[i][0]][v[i][v[i].size()-1]]=1;
    }
    //cout<<3<<endl;
	build(ans);
	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 155 ms 22044 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 155 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1156 KB Output is correct
13 Correct 163 ms 22008 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 77 ms 12064 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 5776 KB Output is correct
21 Correct 163 ms 22060 KB Output is correct
22 Correct 156 ms 22040 KB Output is correct
23 Correct 172 ms 22064 KB Output is correct
24 Correct 158 ms 22052 KB Output is correct
25 Correct 70 ms 12060 KB Output is correct
26 Correct 67 ms 12064 KB Output is correct
27 Correct 168 ms 22092 KB Output is correct
28 Correct 162 ms 22052 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1160 KB Output is correct
9 Correct 165 ms 22056 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 156 ms 22044 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 75 ms 12060 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 42 ms 5708 KB Output is correct
22 Correct 164 ms 22100 KB Output is correct
23 Correct 161 ms 22068 KB Output is correct
24 Correct 169 ms 22112 KB Output is correct
25 Correct 66 ms 12196 KB Output is correct
26 Correct 67 ms 12188 KB Output is correct
27 Correct 158 ms 22064 KB Output is correct
28 Correct 171 ms 22128 KB Output is correct
29 Correct 67 ms 12108 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 51 ms 5752 KB Output is correct
5 Correct 177 ms 22048 KB Output is correct
6 Correct 158 ms 22044 KB Output is correct
7 Correct 173 ms 22092 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 40 ms 5768 KB Output is correct
10 Correct 164 ms 22160 KB Output is correct
11 Correct 168 ms 22056 KB Output is correct
12 Correct 171 ms 22048 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 41 ms 5708 KB Output is correct
17 Correct 161 ms 22044 KB Output is correct
18 Correct 160 ms 22092 KB Output is correct
19 Correct 156 ms 22052 KB Output is correct
20 Correct 155 ms 22048 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 155 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1156 KB Output is correct
13 Correct 163 ms 22008 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 77 ms 12064 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 5776 KB Output is correct
21 Correct 163 ms 22060 KB Output is correct
22 Correct 156 ms 22040 KB Output is correct
23 Correct 172 ms 22064 KB Output is correct
24 Correct 158 ms 22052 KB Output is correct
25 Correct 70 ms 12060 KB Output is correct
26 Correct 67 ms 12064 KB Output is correct
27 Correct 168 ms 22092 KB Output is correct
28 Correct 162 ms 22052 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1160 KB Output is correct
37 Correct 165 ms 22056 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1236 KB Output is correct
41 Correct 156 ms 22044 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 75 ms 12060 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 5708 KB Output is correct
50 Correct 164 ms 22100 KB Output is correct
51 Correct 161 ms 22068 KB Output is correct
52 Correct 169 ms 22112 KB Output is correct
53 Correct 66 ms 12196 KB Output is correct
54 Correct 67 ms 12188 KB Output is correct
55 Correct 158 ms 22064 KB Output is correct
56 Correct 171 ms 22128 KB Output is correct
57 Correct 67 ms 12108 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 3 ms 724 KB Output is correct
61 Correct 74 ms 12192 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 42 ms 5780 KB Output is correct
66 Correct 66 ms 14156 KB Output is correct
67 Correct 68 ms 14104 KB Output is correct
68 Correct 66 ms 14108 KB Output is correct
69 Correct 67 ms 14108 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 155 ms 22044 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1156 KB Output is correct
13 Correct 163 ms 22008 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 77 ms 12064 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 41 ms 5776 KB Output is correct
21 Correct 163 ms 22060 KB Output is correct
22 Correct 156 ms 22040 KB Output is correct
23 Correct 172 ms 22064 KB Output is correct
24 Correct 158 ms 22052 KB Output is correct
25 Correct 70 ms 12060 KB Output is correct
26 Correct 67 ms 12064 KB Output is correct
27 Correct 168 ms 22092 KB Output is correct
28 Correct 162 ms 22052 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1160 KB Output is correct
37 Correct 165 ms 22056 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1236 KB Output is correct
41 Correct 156 ms 22044 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 75 ms 12060 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 42 ms 5708 KB Output is correct
50 Correct 164 ms 22100 KB Output is correct
51 Correct 161 ms 22068 KB Output is correct
52 Correct 169 ms 22112 KB Output is correct
53 Correct 66 ms 12196 KB Output is correct
54 Correct 67 ms 12188 KB Output is correct
55 Correct 158 ms 22064 KB Output is correct
56 Correct 171 ms 22128 KB Output is correct
57 Correct 67 ms 12108 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 51 ms 5752 KB Output is correct
62 Correct 177 ms 22048 KB Output is correct
63 Correct 158 ms 22044 KB Output is correct
64 Correct 173 ms 22092 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 40 ms 5768 KB Output is correct
67 Correct 164 ms 22160 KB Output is correct
68 Correct 168 ms 22056 KB Output is correct
69 Correct 171 ms 22048 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 41 ms 5708 KB Output is correct
74 Correct 161 ms 22044 KB Output is correct
75 Correct 160 ms 22092 KB Output is correct
76 Correct 156 ms 22052 KB Output is correct
77 Correct 155 ms 22048 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 0 ms 212 KB Output is correct
80 Correct 3 ms 724 KB Output is correct
81 Correct 74 ms 12192 KB Output is correct
82 Correct 0 ms 340 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 42 ms 5780 KB Output is correct
86 Correct 66 ms 14156 KB Output is correct
87 Correct 68 ms 14104 KB Output is correct
88 Correct 66 ms 14108 KB Output is correct
89 Correct 67 ms 14108 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 5 ms 852 KB Output is correct
93 Correct 73 ms 14092 KB Output is correct
94 Correct 1 ms 340 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 340 KB Output is correct
97 Correct 18 ms 3788 KB Output is correct
98 Correct 70 ms 14100 KB Output is correct
99 Correct 67 ms 14104 KB Output is correct
100 Correct 65 ms 14144 KB Output is correct
101 Correct 65 ms 14028 KB Output is correct
102 Correct 67 ms 14100 KB Output is correct
103 Correct 67 ms 14128 KB Output is correct
104 Correct 69 ms 14096 KB Output is correct
105 Correct 75 ms 14092 KB Output is correct