oj.uz

답안 #300853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300853 2020-09-17T14:26:11 Z Dilshod_Imomov 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 280 ms 22272 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];
set < int > sz[N];

int construct(std::vector<std::vector<int>> p) {
	nn = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < nn; i++) {
		std::vector<int> row;
		row.resize(nn);
		answer.push_back(row);
	}
	int sub1 = 1, cnt0 = 0, cnt1 = 0, cnt2 = 0;
	for ( int i = 0; i < nn; i++ ) {
        for ( int j = 0; j < nn ;j++ ) {
            if ( p[i][j] == 2 ) {
                sub1 = 0;
                cnt2 = 1;
            }
            if ( p[i][j] == 1 && i != j ) {
                cnt1 = 1;
            }
            if ( p[i][j] == 0 ) {
                cnt0 = 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] == (sub1?1:2) && i != j ) {
                if ( cc[j] && cc[j] != cc[i] ) {
                    return 0;
                }
                if(  cc[j] ) {
                    continue;
                }
                cc[j] = cc[i];
                sz[cc[i]].insert(j);
                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 ( cmp[ i ] != first[i] ) {
                answer[cmp[i]][first[i]] = 1;
                answer[ first[i] ][cmp[i]] = 1;
            }
            if ( sz[i].size() == 2 ) {
                return 0;
            }
        }
	}
    if ( cnt0 && cnt1 && cnt2 ) {
        for ( int i = 0; i < nn; i++ ) {
            if ( !cc[i] ) {
                cc[i] = ++comp;
            }
            cmp[ cc[i] ] = i;
            for ( int j = 0; j < nn; j++ ) {
                if ( p[i][j] == 1 && i != j ) {
                    cc[j] = cc[i];
                    answer[ cmp[ cc[i] ] ][j] = 1;
                    answer[ j ][ cmp[ cc[i] ] ] = 1;
                    cmp[ cc[i] ] = j;
                }
            }
        }
        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 0 0 0 0
2 1 2 0 0 0 0
2 2 1 0 0 0 0
0 0 0 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
4
1 2 2 0
2 1 2 0
2 2 1 1
0 0 1 1
*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 251 ms 22272 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 251 ms 22272 KB Output is correct
8 Correct 0 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 0 ms 384 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 251 ms 22156 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 112 ms 12408 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 251 ms 22264 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 244 ms 22264 KB Output is correct
25 Correct 106 ms 12280 KB Output is correct
26 Correct 106 ms 12208 KB Output is correct
27 Correct 276 ms 22264 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 237 ms 22136 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 1408 KB Output is correct
13 Correct 265 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 8 ms 896 KB Output is correct
17 Correct 140 ms 12296 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 61 ms 5880 KB Output is correct
22 Correct 265 ms 22268 KB Output is correct
23 Correct 280 ms 22152 KB Output is correct
24 Correct 263 ms 22156 KB Output is correct
25 Correct 140 ms 12280 KB Output is correct
26 Correct 102 ms 12280 KB Output is correct
27 Correct 241 ms 22136 KB Output is correct
28 Correct 261 ms 22244 KB Output is correct
29 Correct 105 ms 12280 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 62 ms 5880 KB Output is correct
5 Correct 249 ms 22136 KB Output is correct
6 Correct 239 ms 22136 KB Output is correct
7 Correct 261 ms 22136 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 66 ms 5880 KB Output is correct
10 Correct 258 ms 22264 KB Output is correct
11 Correct 259 ms 22216 KB Output is correct
12 Correct 271 ms 22152 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Incorrect 0 ms 384 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 251 ms 22272 KB Output is correct
8 Correct 0 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 0 ms 384 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 251 ms 22156 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 112 ms 12408 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 251 ms 22264 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 244 ms 22264 KB Output is correct
25 Correct 106 ms 12280 KB Output is correct
26 Correct 106 ms 12208 KB Output is correct
27 Correct 276 ms 22264 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 237 ms 22136 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 1408 KB Output is correct
41 Correct 265 ms 22136 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 8 ms 896 KB Output is correct
45 Correct 140 ms 12296 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 265 ms 22268 KB Output is correct
51 Correct 280 ms 22152 KB Output is correct
52 Correct 263 ms 22156 KB Output is correct
53 Correct 140 ms 12280 KB Output is correct
54 Correct 102 ms 12280 KB Output is correct
55 Correct 241 ms 22136 KB Output is correct
56 Correct 261 ms 22244 KB Output is correct
57 Correct 105 ms 12280 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 896 KB Output is correct
61 Correct 114 ms 12168 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Incorrect 0 ms 384 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 251 ms 22272 KB Output is correct
8 Correct 0 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 0 ms 384 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 251 ms 22156 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 112 ms 12408 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 61 ms 5880 KB Output is correct
21 Correct 251 ms 22264 KB Output is correct
22 Correct 244 ms 22136 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 244 ms 22264 KB Output is correct
25 Correct 106 ms 12280 KB Output is correct
26 Correct 106 ms 12208 KB Output is correct
27 Correct 276 ms 22264 KB Output is correct
28 Correct 241 ms 22136 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 237 ms 22136 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 1408 KB Output is correct
41 Correct 265 ms 22136 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 8 ms 896 KB Output is correct
45 Correct 140 ms 12296 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 61 ms 5880 KB Output is correct
50 Correct 265 ms 22268 KB Output is correct
51 Correct 280 ms 22152 KB Output is correct
52 Correct 263 ms 22156 KB Output is correct
53 Correct 140 ms 12280 KB Output is correct
54 Correct 102 ms 12280 KB Output is correct
55 Correct 241 ms 22136 KB Output is correct
56 Correct 261 ms 22244 KB Output is correct
57 Correct 105 ms 12280 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 0 ms 384 KB Output is correct
60 Correct 3 ms 384 KB Output is correct
61 Correct 62 ms 5880 KB Output is correct
62 Correct 249 ms 22136 KB Output is correct
63 Correct 239 ms 22136 KB Output is correct
64 Correct 261 ms 22136 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 66 ms 5880 KB Output is correct
67 Correct 258 ms 22264 KB Output is correct
68 Correct 259 ms 22216 KB Output is correct
69 Correct 271 ms 22152 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Incorrect 0 ms 384 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -