oj.uz

Submission #768443

# Submission time Handle Problem Language Result Execution time Memory
768443 2023-06-28T07:32:49 Z Khizri Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 207 ms 34124 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=1e3+5;
int n,color[mxn],k,color2[mxn],sz,lst,arr[mxn][mxn];
vector<int>vt[mxn];
vector<int>vt2[mxn];
vector<vector<int>>p;
void dfs(int u){
    color[u]=k;
    sz++;
    for(int v:vt[u]){
        if(!color[v]){
            arr[u][v]=1;
            arr[v][u]=1;
            dfs(v);
        }
    }
}
void dfs2(int u){
    color2[u]=k;
    sz++;
    lst=u;
    for(int vv:vt2[u]){
        int v=color[vv];
        if(!color2[v]){
            arr[u][v]=1;
            arr[v][u]=1;
            dfs2(v);
        }
    }
}
int construct(vector<vector<int>> pp) {
    p=pp;
	n=p.size();
	for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(p[i][j]==1){
                vt[i+1].pb(j+1);
                vt[j+1].pb(i+1);
            }
            else if(p[i][j]==2){
                vt2[i+1].pb(j+1);
                vt2[j+1].pb(i+1);
            }
            else if(p[i][j]==3){
                //cout<<"X1"<<endl;
                return 0;
            }
        }
	}
	for(int i=1;i<=n;i++){
        if(!color[i]){
            k=i;
            sz=0;
            dfs(i);
        }
	}
	for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(color[i]==color[j]&&p[i-1][j-1]!=1){
                //cout<<i<<' '<<j<<endl;
                //cout<<"X2"<<endl;
                return 0;
            }
        }
	}
	vector<pii>v;
	for(int id=1;id<=n;id++){
        int i=color[id];
        if(color2[i]) continue;
        k=i;
        sz=0;
        dfs2(i);
        if(lst==i){
            color2[i]=0;
        }
        else{
            if(sz<=2) return 0;
            arr[i][lst]=1;
            arr[lst][i]=1;
            v.pb({i,lst});
        }
	}
	for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(color2[i]>0&&color2[i]==color2[j]&&p[i-1][j-1]!=2){
                //cout<<"X3"<<endl;
                return 0;
            }
        }
	}
	for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(p[i-1][j-1]==2&&color2[i]!=color2[j]){
                int a=color[i];
                int b=color2[j];
                int c=color2[i];
                int d=color[j];
                if(a&&b){
                    arr[a][b]=1;
                    arr[b][a]=1;
                }
                else{
                    arr[c][d]=1;
                    arr[d][c]=1;
                }
            }
        }
	}
	vector<vector<int>>ans;
	for(int i=1;i<=n;i++){
        vector<int>vt;
        for(int j=1;j<=n;j++){
            vt.pb(arr[i][j]);
        }
        ans.pb(vt);
	}
	build(ans);
	return 1;
}
/*
4
1 1 2 2
1 1 2 2
2 2 1 2
2 2 2 1
7
1 2 2 2 0 0 0
2 1 2 2 0 0 0
2 2 1 2 0 0 0
2 2 2 1 0 0 0
0 0 0 0 1 2 2
0 0 0 0 2 1 2
0 0 0 0 2 2 1
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 2404 KB Output is correct
7 Correct 166 ms 34116 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 2404 KB Output is correct
7 Correct 166 ms 34116 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1412 KB Output is correct
13 Correct 155 ms 25984 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 72 ms 18884 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 44 ms 8680 KB Output is correct
21 Correct 158 ms 30536 KB Output is correct
22 Correct 156 ms 29624 KB Output is correct
23 Correct 162 ms 32068 KB Output is correct
24 Correct 185 ms 26304 KB Output is correct
25 Correct 66 ms 16588 KB Output is correct
26 Correct 64 ms 15672 KB Output is correct
27 Correct 163 ms 33104 KB Output is correct
28 Correct 176 ms 26312 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 155 ms 26056 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2388 KB Output is correct
13 Correct 163 ms 34124 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 73 ms 19008 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 42 ms 8712 KB Output is correct
22 Correct 158 ms 30540 KB Output is correct
23 Correct 160 ms 30000 KB Output is correct
24 Correct 177 ms 33100 KB Output is correct
25 Correct 63 ms 12344 KB Output is correct
26 Correct 67 ms 16588 KB Output is correct
27 Correct 156 ms 29900 KB Output is correct
28 Correct 164 ms 32068 KB Output is correct
29 Correct 69 ms 12348 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 41 ms 8624 KB Output is correct
5 Correct 207 ms 30536 KB Output is correct
6 Correct 162 ms 29616 KB Output is correct
7 Correct 162 ms 32076 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 41 ms 8612 KB Output is correct
10 Correct 167 ms 30628 KB Output is correct
11 Correct 157 ms 30028 KB Output is correct
12 Correct 168 ms 33092 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Incorrect 0 ms 340 KB b[0][0] is not 0
16 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 2404 KB Output is correct
7 Correct 166 ms 34116 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1412 KB Output is correct
13 Correct 155 ms 25984 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 72 ms 18884 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 44 ms 8680 KB Output is correct
21 Correct 158 ms 30536 KB Output is correct
22 Correct 156 ms 29624 KB Output is correct
23 Correct 162 ms 32068 KB Output is correct
24 Correct 185 ms 26304 KB Output is correct
25 Correct 66 ms 16588 KB Output is correct
26 Correct 64 ms 15672 KB Output is correct
27 Correct 163 ms 33104 KB Output is correct
28 Correct 176 ms 26312 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 1364 KB Output is correct
37 Correct 155 ms 26056 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 2388 KB Output is correct
41 Correct 163 ms 34124 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 4 ms 1748 KB Output is correct
45 Correct 73 ms 19008 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 42 ms 8712 KB Output is correct
50 Correct 158 ms 30540 KB Output is correct
51 Correct 160 ms 30000 KB Output is correct
52 Correct 177 ms 33100 KB Output is correct
53 Correct 63 ms 12344 KB Output is correct
54 Correct 67 ms 16588 KB Output is correct
55 Correct 156 ms 29900 KB Output is correct
56 Correct 164 ms 32068 KB Output is correct
57 Correct 69 ms 12348 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 4 ms 1748 KB Output is correct
61 Correct 74 ms 20672 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 340 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Incorrect 40 ms 8640 KB b[1][1] is not 0
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 7 ms 2404 KB Output is correct
7 Correct 166 ms 34116 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 7 ms 1412 KB Output is correct
13 Correct 155 ms 25984 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 72 ms 18884 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 44 ms 8680 KB Output is correct
21 Correct 158 ms 30536 KB Output is correct
22 Correct 156 ms 29624 KB Output is correct
23 Correct 162 ms 32068 KB Output is correct
24 Correct 185 ms 26304 KB Output is correct
25 Correct 66 ms 16588 KB Output is correct
26 Correct 64 ms 15672 KB Output is correct
27 Correct 163 ms 33104 KB Output is correct
28 Correct 176 ms 26312 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 1364 KB Output is correct
37 Correct 155 ms 26056 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 7 ms 2388 KB Output is correct
41 Correct 163 ms 34124 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 4 ms 1748 KB Output is correct
45 Correct 73 ms 19008 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 42 ms 8712 KB Output is correct
50 Correct 158 ms 30540 KB Output is correct
51 Correct 160 ms 30000 KB Output is correct
52 Correct 177 ms 33100 KB Output is correct
53 Correct 63 ms 12344 KB Output is correct
54 Correct 67 ms 16588 KB Output is correct
55 Correct 156 ms 29900 KB Output is correct
56 Correct 164 ms 32068 KB Output is correct
57 Correct 69 ms 12348 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 41 ms 8624 KB Output is correct
62 Correct 207 ms 30536 KB Output is correct
63 Correct 162 ms 29616 KB Output is correct
64 Correct 162 ms 32076 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 41 ms 8612 KB Output is correct
67 Correct 167 ms 30628 KB Output is correct
68 Correct 157 ms 30028 KB Output is correct
69 Correct 168 ms 33092 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Incorrect 0 ms 340 KB b[0][0] is not 0
73 Halted 0 ms 0 KB -