oj.uz

Submission #301596

# Submission time Handle Problem Language Result Execution time Memory
301596 2020-09-18T05:10:34 Z Dilshod_Imomov Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 309 ms 22296 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int nn, comp, used[N], cc[N], cmp[N], ok, first[N], nb[N][2];
set < int > sz[N];

int construct(std::vector<std::vector<int>> p) {
	nn = p.size();
	std::vector<std::vector<int>> answer;
	vector < pair < int, int > > vc;
	for (int i = 0; i < nn; i++) {
		std::vector<int> row;
		row.resize(nn);
		answer.push_back(row);
	}
	int sub1 = 1, sub2 = 0;
	for ( int i = 0; i < nn; i++ ) {
        for ( int j = 0; j < nn ;j++ ) {
            if ( p[i][j] == 2 ) {
                sub1 = 0;
            }
        }
	}
	if ( !sub1 ) {
        for ( int i = 0; i < nn; i++ ) {
            for ( int j = 0; j < nn; j++ ) {
                if ( p[i][j] == 1 && i != j ) {
                    p[i][j] = 2;
                    p[j][i] = 2;
                    vc.push_back( { i, j } );
                    vc.push_back( { j, i } );
                    sub2 = 1;
                }
            }
        }
	}
	for ( int i = 0; i < nn; i++ ) {
        if ( !cc[i] ) {
            cc[i] = ++comp;
            first[comp] = i;
            sz[cc[i]].insert(i);
        }
        cmp[ cc[i] ] = i;
        for ( int j = 0; j < nn; j++ ) {
            if ( p[i][j] && i != j ) {
                if ( cc[j] && cc[j] != cc[i] ) {
                    return 0;
                }
                if(  cc[j] ) {
                    continue;
                }
                cc[j] = cc[i];
                sz[cc[i]].insert(j);
                nb[ cmp[ cc[i] ] ][1] = j;
                nb[ j ][0] = cmp[ cc[i] ];
                answer[ cmp[ cc[i] ] ][j] = 1;
                answer[ j ][ cmp[ cc[i] ] ] = 1;
                cmp[ cc[i] ] = j;
            }
        }
	}
	if ( !sub1 ) {
        for ( int i = 1; i <= comp; i++ ) {
            if ( !sub1 && sub2 ) {
                if ( sz[i].size() == 2 ) {
                    auto it = sz[i].begin();
                    used[*it] = 1;
                    it++;
                    used[*it] = 1;
                    continue;
                }
            }
            if ( cmp[ i ] != first[i] ) {
                answer[cmp[i]][first[i]] = 1;
                answer[ first[i] ][cmp[i]] = 1;
                nb[ cmp[i] ][1] = first[i];
                nb[ first[i] ][0] = cmp[i];
            }
            if ( sz[i].size() == 2 ) {
                return 0;
            }
        }
	}
	if ( !sub1 && sub2 ) {
        for ( auto pr: vc ) {
            int u = pr.first, v = pr.second;
            if ( used[u] || used[v] ) {
                continue;
            }
            //cout << u << ' ' << v << endl;
            //cout << nb[u][0] << ' ' << u << ' ' << nb[u][1] << '\n';
            if ( nb[u][1] == v ) {
                //cout << 1 << endl;
                answer[v][ nb[v][1] ] = 0;
                answer[ nb[v][1] ][v] = 0;
                answer[ u ][ nb[v][1] ] = 1;
                answer[ nb[v][1] ][ u ] = 1;
                used[v] = 1;
                nb[u][1] = nb[v][1];
                nb[ nb[v][1] ][0] = u;
            }
            else {
                //cout << 2 << endl;
                answer[v][ nb[v][0] ] = 0;
                answer[ nb[v][0] ][v] = 0;
                answer[ u ][ nb[v][0] ] = 1;
                answer[ nb[v][0] ][ u ] = 1;
                used[v] = 1;
                nb[u][0] = nb[v][0];
                nb[ nb[v][0] ][1] = u;
            }
            //cout << nb[u][0] << ' ' << u << ' ' << nb[u][1] << endl;
        }
	}
    for ( int i = 0; i < nn; i++ ) {
        for ( int j = 0; j < nn; j++ ) {
            if ( cc[i] == cc[j] ) {
                if ( !p[i][j] || !p[j][i] ) {
                    return 0;
                }
            }
        }
    }
	build(answer);
	return 1;
}
/*
7
1 2 2 2 1 0 0
2 1 2 2 2 0 0
2 2 1 1 2 0 0
2 2 1 1 2 0 0
1 2 2 2 1 0 0
0 0 0 0 0 1 1
0 0 0 0 0 1 1
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 244 ms 22152 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 244 ms 22152 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 10 ms 1256 KB Output is correct
13 Correct 237 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 111 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 244 ms 22156 KB Output is correct
22 Correct 240 ms 22196 KB Output is correct
23 Correct 278 ms 22212 KB Output is correct
24 Correct 281 ms 22292 KB Output is correct
25 Correct 102 ms 12300 KB Output is correct
26 Correct 130 ms 12296 KB Output is correct
27 Correct 263 ms 22264 KB Output is correct
28 Correct 257 ms 22168 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 416 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 416 KB Output is correct
6 Correct 1 ms 416 KB Output is correct
7 Correct 1 ms 416 KB Output is correct
8 Correct 13 ms 1280 KB Output is correct
9 Correct 258 ms 22208 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 295 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 108 ms 12280 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 88 ms 5880 KB Output is correct
22 Correct 307 ms 22136 KB Output is correct
23 Correct 241 ms 22136 KB Output is correct
24 Correct 261 ms 22152 KB Output is correct
25 Correct 101 ms 12280 KB Output is correct
26 Correct 113 ms 12292 KB Output is correct
27 Correct 260 ms 22168 KB Output is correct
28 Correct 267 ms 22264 KB Output is correct
29 Correct 120 ms 12312 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 94 ms 5912 KB Output is correct
5 Correct 243 ms 22208 KB Output is correct
6 Correct 245 ms 22164 KB Output is correct
7 Correct 309 ms 22296 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 60 ms 5880 KB Output is correct
10 Correct 247 ms 22264 KB Output is correct
11 Correct 241 ms 22264 KB Output is correct
12 Correct 251 ms 22136 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Incorrect 1 ms 384 KB b[4][4] is not 0
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 244 ms 22152 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 10 ms 1256 KB Output is correct
13 Correct 237 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 111 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 244 ms 22156 KB Output is correct
22 Correct 240 ms 22196 KB Output is correct
23 Correct 278 ms 22212 KB Output is correct
24 Correct 281 ms 22292 KB Output is correct
25 Correct 102 ms 12300 KB Output is correct
26 Correct 130 ms 12296 KB Output is correct
27 Correct 263 ms 22264 KB Output is correct
28 Correct 257 ms 22168 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 360 KB Output is correct
31 Correct 1 ms 416 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 416 KB Output is correct
34 Correct 1 ms 416 KB Output is correct
35 Correct 1 ms 416 KB Output is correct
36 Correct 13 ms 1280 KB Output is correct
37 Correct 258 ms 22208 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 416 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 295 ms 22136 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 108 ms 12280 KB Output is correct
46 Correct 1 ms 360 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 88 ms 5880 KB Output is correct
50 Correct 307 ms 22136 KB Output is correct
51 Correct 241 ms 22136 KB Output is correct
52 Correct 261 ms 22152 KB Output is correct
53 Correct 101 ms 12280 KB Output is correct
54 Correct 113 ms 12292 KB Output is correct
55 Correct 260 ms 22168 KB Output is correct
56 Correct 267 ms 22264 KB Output is correct
57 Correct 120 ms 12312 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 9 ms 1152 KB Output is correct
61 Correct 123 ms 16624 KB Output is correct
62 Correct 1 ms 416 KB Output is correct
63 Incorrect 1 ms 384 KB b[0][0] is not 0
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1280 KB Output is correct
7 Correct 244 ms 22152 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 416 KB Output is correct
12 Correct 10 ms 1256 KB Output is correct
13 Correct 237 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 111 ms 12280 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 60 ms 5880 KB Output is correct
21 Correct 244 ms 22156 KB Output is correct
22 Correct 240 ms 22196 KB Output is correct
23 Correct 278 ms 22212 KB Output is correct
24 Correct 281 ms 22292 KB Output is correct
25 Correct 102 ms 12300 KB Output is correct
26 Correct 130 ms 12296 KB Output is correct
27 Correct 263 ms 22264 KB Output is correct
28 Correct 257 ms 22168 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 360 KB Output is correct
31 Correct 1 ms 416 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 416 KB Output is correct
34 Correct 1 ms 416 KB Output is correct
35 Correct 1 ms 416 KB Output is correct
36 Correct 13 ms 1280 KB Output is correct
37 Correct 258 ms 22208 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 416 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 295 ms 22136 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 896 KB Output is correct
45 Correct 108 ms 12280 KB Output is correct
46 Correct 1 ms 360 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 88 ms 5880 KB Output is correct
50 Correct 307 ms 22136 KB Output is correct
51 Correct 241 ms 22136 KB Output is correct
52 Correct 261 ms 22152 KB Output is correct
53 Correct 101 ms 12280 KB Output is correct
54 Correct 113 ms 12292 KB Output is correct
55 Correct 260 ms 22168 KB Output is correct
56 Correct 267 ms 22264 KB Output is correct
57 Correct 120 ms 12312 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 94 ms 5912 KB Output is correct
62 Correct 243 ms 22208 KB Output is correct
63 Correct 245 ms 22164 KB Output is correct
64 Correct 309 ms 22296 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 60 ms 5880 KB Output is correct
67 Correct 247 ms 22264 KB Output is correct
68 Correct 241 ms 22264 KB Output is correct
69 Correct 251 ms 22136 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Incorrect 1 ms 384 KB b[4][4] is not 0
72 Halted 0 ms 0 KB -