oj.uz

Submission #301601

# Submission time Handle Problem Language Result Execution time Memory
301601 2020-09-18T05:14:10 Z Dilshod_Imomov Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 272 ms 22264 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++ ) {
            answer[i][i] = 0;
        }
        build(answer);
        return 1;
	}
    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 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 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 249 ms 22140 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 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 249 ms 22140 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1348 KB Output is correct
13 Correct 250 ms 22148 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 116 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 75 ms 5880 KB Output is correct
21 Correct 251 ms 22148 KB Output is correct
22 Correct 251 ms 22264 KB Output is correct
23 Correct 258 ms 22264 KB Output is correct
24 Correct 251 ms 22136 KB Output is correct
25 Correct 116 ms 12280 KB Output is correct
26 Correct 113 ms 12280 KB Output is correct
27 Correct 260 ms 22136 KB Output is correct
28 Correct 252 ms 22224 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 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 246 ms 22264 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 254 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 6 ms 896 KB Output is correct
17 Correct 116 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 65 ms 5880 KB Output is correct
22 Correct 254 ms 22264 KB Output is correct
23 Correct 260 ms 22148 KB Output is correct
24 Correct 269 ms 22264 KB Output is correct
25 Correct 118 ms 12300 KB Output is correct
26 Correct 121 ms 12280 KB Output is correct
27 Correct 272 ms 22264 KB Output is correct
28 Correct 262 ms 22228 KB Output is correct
29 Correct 113 ms 12280 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 258 ms 22200 KB Output is correct
6 Correct 252 ms 22156 KB Output is correct
7 Correct 265 ms 22152 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 62 ms 5880 KB Output is correct
10 Correct 248 ms 22136 KB Output is correct
11 Correct 258 ms 22264 KB Output is correct
12 Correct 261 ms 22224 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Incorrect 1 ms 360 KB Too few ways to get from 4 to 8, should be 1 found 0
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 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 249 ms 22140 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1348 KB Output is correct
13 Correct 250 ms 22148 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 116 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 75 ms 5880 KB Output is correct
21 Correct 251 ms 22148 KB Output is correct
22 Correct 251 ms 22264 KB Output is correct
23 Correct 258 ms 22264 KB Output is correct
24 Correct 251 ms 22136 KB Output is correct
25 Correct 116 ms 12280 KB Output is correct
26 Correct 113 ms 12280 KB Output is correct
27 Correct 260 ms 22136 KB Output is correct
28 Correct 252 ms 22224 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 246 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 254 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 6 ms 896 KB Output is correct
45 Correct 116 ms 12280 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 65 ms 5880 KB Output is correct
50 Correct 254 ms 22264 KB Output is correct
51 Correct 260 ms 22148 KB Output is correct
52 Correct 269 ms 22264 KB Output is correct
53 Correct 118 ms 12300 KB Output is correct
54 Correct 121 ms 12280 KB Output is correct
55 Correct 272 ms 22264 KB Output is correct
56 Correct 262 ms 22228 KB Output is correct
57 Correct 113 ms 12280 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Incorrect 1 ms 384 KB Answer gives possible 1 while actual possible 0
60 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 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 249 ms 22140 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1348 KB Output is correct
13 Correct 250 ms 22148 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 5 ms 896 KB Output is correct
17 Correct 116 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 75 ms 5880 KB Output is correct
21 Correct 251 ms 22148 KB Output is correct
22 Correct 251 ms 22264 KB Output is correct
23 Correct 258 ms 22264 KB Output is correct
24 Correct 251 ms 22136 KB Output is correct
25 Correct 116 ms 12280 KB Output is correct
26 Correct 113 ms 12280 KB Output is correct
27 Correct 260 ms 22136 KB Output is correct
28 Correct 252 ms 22224 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 246 ms 22264 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 254 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 6 ms 896 KB Output is correct
45 Correct 116 ms 12280 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 65 ms 5880 KB Output is correct
50 Correct 254 ms 22264 KB Output is correct
51 Correct 260 ms 22148 KB Output is correct
52 Correct 269 ms 22264 KB Output is correct
53 Correct 118 ms 12300 KB Output is correct
54 Correct 121 ms 12280 KB Output is correct
55 Correct 272 ms 22264 KB Output is correct
56 Correct 262 ms 22228 KB Output is correct
57 Correct 113 ms 12280 KB Output is correct
58 Correct 1 ms 416 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 258 ms 22200 KB Output is correct
63 Correct 252 ms 22156 KB Output is correct
64 Correct 265 ms 22152 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 62 ms 5880 KB Output is correct
67 Correct 248 ms 22136 KB Output is correct
68 Correct 258 ms 22264 KB Output is correct
69 Correct 261 ms 22224 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Incorrect 1 ms 360 KB Too few ways to get from 4 to 8, should be 1 found 0
72 Halted 0 ms 0 KB -