oj.uz

답안 #300804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300804 2020-09-17T13:48:16 Z fpc_coder 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 290 ms 22232 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;

int construct(vector<vector<int>> p) {
    vector<vector<int>> b(p.size(), vector<int>(p.size(), 0));
    int n = (int) p.size();
    vector<int> par(n);
    vector<bool> vis(n, false);
    bool subtask3 = false;
    for (int i = 0; i < n; i++) {
        if (*max_element(p[i].begin(), p[i].end()) == 2) {
            subtask3 = true;
            break;
        }
    }
    if (!subtask3) {
        for (int i = 0; i < n; i++) par[i] = i;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (p[i][j]) par[j] = i;
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (par[i] == par[j] && p[i][j] == 0) return 0;
                if (par[i] != par[j] && p[i][j] == 1) return 0;
            }
        }
        for (int i = 0; i < n; i++) {
            if (par[i] != i) {
                b[i][par[i]] = 1;
                b[par[i]][i] = 1;
            }
        }
        build(b);
        return 1;
    }
    else {
        for (int i = 0; i < n; i++) {
            vector<int> v;
            if (!vis[i]) {
                for (int j = 0; j < n; j++) {
                    if (p[i][j] == 2) {
                        v.push_back(j);
                        vis[i] = true; vis[j] = true;
                    }
                }
                if ((int) v.size() == 1) return 0;
                if ((int) v.size() >= 2) {
                    for (int j = 0; j + 1 < (int) v.size(); j++) {
                        b[v[j]][v[j + 1]] = 1;
                        b[v[j + 1]][v[j]] = 1;
                    }
                    b[v[0]][i] = 1;
                    b[i][v[0]] = 1;
                    b[v[(int) v.size() - 1]][i] = 1;
                    b[i][v[(int) v.size() - 1]] = 1;
                }
            }
        }
        for (int i = 0; i < n; i++) par[i] = i;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (p[i][j] == 2) par[j] = i;
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (par[i] == par[j] && p[i][j] == 0) return 0;
                if (par[i] != par[j] && p[i][j] == 2) return 0;
            }
        }
        build(b);
        return 1;
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 290 ms 22104 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 290 ms 22104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 14 ms 1152 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 108 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 112 ms 5756 KB Output is correct
21 Correct 240 ms 22136 KB Output is correct
22 Correct 238 ms 22060 KB Output is correct
23 Correct 259 ms 22136 KB Output is correct
24 Correct 259 ms 22136 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 105 ms 12116 KB Output is correct
27 Correct 259 ms 22136 KB Output is correct
28 Correct 238 ms 22104 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 235 ms 22136 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1152 KB Output is correct
13 Correct 245 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 8 ms 768 KB Output is correct
17 Correct 107 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 60 ms 5752 KB Output is correct
22 Correct 244 ms 22140 KB Output is correct
23 Correct 237 ms 22136 KB Output is correct
24 Correct 242 ms 22136 KB Output is correct
25 Correct 109 ms 12156 KB Output is correct
26 Correct 102 ms 12152 KB Output is correct
27 Correct 236 ms 22208 KB Output is correct
28 Correct 248 ms 22136 KB Output is correct
29 Correct 106 ms 12156 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 60 ms 5752 KB Output is correct
5 Correct 250 ms 22136 KB Output is correct
6 Correct 248 ms 22104 KB Output is correct
7 Correct 267 ms 22232 KB Output is correct
8 Correct 1 ms 360 KB Output is correct
9 Correct 66 ms 5752 KB Output is correct
10 Correct 244 ms 22136 KB Output is correct
11 Correct 246 ms 22136 KB Output is correct
12 Correct 240 ms 22136 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Incorrect 0 ms 256 KB Too few ways to get from 4 to 5, should be 1 found 0
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 290 ms 22104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 14 ms 1152 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 108 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 112 ms 5756 KB Output is correct
21 Correct 240 ms 22136 KB Output is correct
22 Correct 238 ms 22060 KB Output is correct
23 Correct 259 ms 22136 KB Output is correct
24 Correct 259 ms 22136 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 105 ms 12116 KB Output is correct
27 Correct 259 ms 22136 KB Output is correct
28 Correct 238 ms 22104 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 235 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 10 ms 1152 KB Output is correct
41 Correct 245 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 8 ms 768 KB Output is correct
45 Correct 107 ms 12152 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 60 ms 5752 KB Output is correct
50 Correct 244 ms 22140 KB Output is correct
51 Correct 237 ms 22136 KB Output is correct
52 Correct 242 ms 22136 KB Output is correct
53 Correct 109 ms 12156 KB Output is correct
54 Correct 102 ms 12152 KB Output is correct
55 Correct 236 ms 22208 KB Output is correct
56 Correct 248 ms 22136 KB Output is correct
57 Correct 106 ms 12156 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 8 ms 768 KB Output is correct
61 Correct 106 ms 12152 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Incorrect 1 ms 256 KB Too few ways to get from 0 to 1, should be 1 found 0
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 290 ms 22104 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 14 ms 1152 KB Output is correct
13 Correct 240 ms 22136 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 108 ms 12152 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 112 ms 5756 KB Output is correct
21 Correct 240 ms 22136 KB Output is correct
22 Correct 238 ms 22060 KB Output is correct
23 Correct 259 ms 22136 KB Output is correct
24 Correct 259 ms 22136 KB Output is correct
25 Correct 111 ms 12152 KB Output is correct
26 Correct 105 ms 12116 KB Output is correct
27 Correct 259 ms 22136 KB Output is correct
28 Correct 238 ms 22104 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 10 ms 1152 KB Output is correct
37 Correct 235 ms 22136 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 10 ms 1152 KB Output is correct
41 Correct 245 ms 22136 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 8 ms 768 KB Output is correct
45 Correct 107 ms 12152 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 256 KB Output is correct
48 Correct 1 ms 256 KB Output is correct
49 Correct 60 ms 5752 KB Output is correct
50 Correct 244 ms 22140 KB Output is correct
51 Correct 237 ms 22136 KB Output is correct
52 Correct 242 ms 22136 KB Output is correct
53 Correct 109 ms 12156 KB Output is correct
54 Correct 102 ms 12152 KB Output is correct
55 Correct 236 ms 22208 KB Output is correct
56 Correct 248 ms 22136 KB Output is correct
57 Correct 106 ms 12156 KB Output is correct
58 Correct 0 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 1 ms 256 KB Output is correct
61 Correct 60 ms 5752 KB Output is correct
62 Correct 250 ms 22136 KB Output is correct
63 Correct 248 ms 22104 KB Output is correct
64 Correct 267 ms 22232 KB Output is correct
65 Correct 1 ms 360 KB Output is correct
66 Correct 66 ms 5752 KB Output is correct
67 Correct 244 ms 22136 KB Output is correct
68 Correct 246 ms 22136 KB Output is correct
69 Correct 240 ms 22136 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Incorrect 0 ms 256 KB Too few ways to get from 4 to 5, should be 1 found 0
72 Halted 0 ms 0 KB -