oj.uz

답안 #300843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300843 2020-09-17T14:15:30 Z Dilshod_Imomov 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 276 ms 22268 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 ) {
                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] && 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++ ) {
            for ( int j = 0; j < nn; j++ ) {
                if ( i != j && p[i][j] == 1 ) {
                    answer[i][j] = 1;
                    answer[j][i] = 1;
                }
            }
        }
        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
*/

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:16:16: warning: variable 'cnt0' set but not used [-Wunused-but-set-variable]
   16 |  int sub1 = 1, cnt0 = 0, cnt1 = 0, cnt2 = 0;
      |                ^~~~
supertrees.cpp:16:26: warning: variable 'cnt1' set but not used [-Wunused-but-set-variable]
   16 |  int sub1 = 1, cnt0 = 0, cnt1 = 0, cnt2 = 0;
      |                          ^~~~
supertrees.cpp:16:36: warning: variable 'cnt2' set but not used [-Wunused-but-set-variable]
   16 |  int sub1 = 1, cnt0 = 0, cnt1 = 0, cnt2 = 0;
      |                                    ^~~~

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 0 ms 384 KB Output is correct
4 Correct 0 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 263 ms 22136 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 0 ms 384 KB Output is correct
4 Correct 0 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 263 ms 22136 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 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 246 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 6 ms 896 KB Output is correct
17 Correct 114 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 62 ms 5852 KB Output is correct
21 Correct 256 ms 22136 KB Output is correct
22 Correct 248 ms 22140 KB Output is correct
23 Correct 260 ms 22148 KB Output is correct
24 Correct 245 ms 22264 KB Output is correct
25 Correct 109 ms 12280 KB Output is correct
26 Correct 107 ms 12280 KB Output is correct
27 Correct 276 ms 22136 KB Output is correct
28 Correct 252 ms 22268 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 0 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 245 ms 22136 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 261 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 6 ms 896 KB Output is correct
17 Correct 114 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 62 ms 5880 KB Output is correct
22 Correct 255 ms 22156 KB Output is correct
23 Correct 250 ms 22136 KB Output is correct
24 Correct 260 ms 22264 KB Output is correct
25 Correct 110 ms 12280 KB Output is correct
26 Correct 117 ms 12280 KB Output is correct
27 Correct 260 ms 22264 KB Output is correct
28 Correct 255 ms 22136 KB Output is correct
29 Correct 110 ms 12280 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 63 ms 5880 KB Output is correct
5 Correct 252 ms 22136 KB Output is correct
6 Correct 252 ms 22136 KB Output is correct
7 Correct 263 ms 22212 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 65 ms 5880 KB Output is correct
10 Correct 253 ms 22148 KB Output is correct
11 Correct 256 ms 22264 KB Output is correct
12 Correct 262 ms 22264 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 0 ms 384 KB Output is correct
4 Correct 0 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 263 ms 22136 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 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 246 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 6 ms 896 KB Output is correct
17 Correct 114 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 62 ms 5852 KB Output is correct
21 Correct 256 ms 22136 KB Output is correct
22 Correct 248 ms 22140 KB Output is correct
23 Correct 260 ms 22148 KB Output is correct
24 Correct 245 ms 22264 KB Output is correct
25 Correct 109 ms 12280 KB Output is correct
26 Correct 107 ms 12280 KB Output is correct
27 Correct 276 ms 22136 KB Output is correct
28 Correct 252 ms 22268 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 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 0 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 245 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 261 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 6 ms 896 KB Output is correct
45 Correct 114 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 62 ms 5880 KB Output is correct
50 Correct 255 ms 22156 KB Output is correct
51 Correct 250 ms 22136 KB Output is correct
52 Correct 260 ms 22264 KB Output is correct
53 Correct 110 ms 12280 KB Output is correct
54 Correct 117 ms 12280 KB Output is correct
55 Correct 260 ms 22264 KB Output is correct
56 Correct 255 ms 22136 KB Output is correct
57 Correct 110 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 6 ms 896 KB Output is correct
61 Correct 120 ms 12280 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 0 ms 384 KB Output is correct
4 Correct 0 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 263 ms 22136 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 0 ms 384 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 246 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 6 ms 896 KB Output is correct
17 Correct 114 ms 12280 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 62 ms 5852 KB Output is correct
21 Correct 256 ms 22136 KB Output is correct
22 Correct 248 ms 22140 KB Output is correct
23 Correct 260 ms 22148 KB Output is correct
24 Correct 245 ms 22264 KB Output is correct
25 Correct 109 ms 12280 KB Output is correct
26 Correct 107 ms 12280 KB Output is correct
27 Correct 276 ms 22136 KB Output is correct
28 Correct 252 ms 22268 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 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 0 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 245 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 11 ms 1280 KB Output is correct
41 Correct 261 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 6 ms 896 KB Output is correct
45 Correct 114 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 62 ms 5880 KB Output is correct
50 Correct 255 ms 22156 KB Output is correct
51 Correct 250 ms 22136 KB Output is correct
52 Correct 260 ms 22264 KB Output is correct
53 Correct 110 ms 12280 KB Output is correct
54 Correct 117 ms 12280 KB Output is correct
55 Correct 260 ms 22264 KB Output is correct
56 Correct 255 ms 22136 KB Output is correct
57 Correct 110 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 1 ms 384 KB Output is correct
61 Correct 63 ms 5880 KB Output is correct
62 Correct 252 ms 22136 KB Output is correct
63 Correct 252 ms 22136 KB Output is correct
64 Correct 263 ms 22212 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 65 ms 5880 KB Output is correct
67 Correct 253 ms 22148 KB Output is correct
68 Correct 256 ms 22264 KB Output is correct
69 Correct 262 ms 22264 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 -