oj.uz

답안 #300711

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300711 2020-09-17T12:33:30 Z IgorI 슈퍼트리 잇기 (IOI20_supertrees) C++17
40 / 100
 284 ms 22392 KB 
#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)

void build(vector<vector<int> > b) ;

void build(vector<vector<int> > b) ;

const int N = 5000;
int root[N], sz[N];

int Root(int x)
{
    if (x == root[x]) return x;
    return root[x] = Root(root[x]);
}

void Merge(int v, int u)
{
    v = Root(v), u = Root(u);
    if (v == u) return;
    if (sz[v] > sz[u]) swap(v, u);
    sz[u] += sz[v];
    root[v] = u;
}

int construct(vector<vector<int> > p)
{
    int n = p.size();
    for (int i = 0; i < n; i++) root[i] = i, sz[i] = 1;
    int t = 0;
    forn(i, n)
    {
        forn(j, n)
        {
            if (p[i][j])
            {
                Merge(i, j);
                t = max(t, p[i][j]);
            }
        }
    }
    forn(i, n)
    {
        forn(j, n)
        {
            if (p[i][j] == 0 && Root(i) == Root(j))
                return 0;
        }
    }
    vector<vector<int> > b(n, vector<int>(n));
    if (t == 0)
    {
        build(b);
        return 1;
    }
    for (int i = 0; i < n; i++)
    {
        vector<int> L;
        forn(j, n)
        {
            if (Root(j) == i) L.push_back(j);
        }
        for (int j = 0; j + 1 < L.size(); j++)
        {
            b[L[j]][L[j + 1]] = 1;
            b[L[j + 1]][L[j]] = 1;
        }
        if (t == 2)
        {
            if (L.size() == 2)
            {
                return 0;
            }
            if (L.size() > 2)
            {
                b[L[0]][L.back()] = 1;
                b[L.back()][L[0]] = 1;
            }
        }
    }
    build(b);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
      |                             ^
supertrees.cpp:34:5: note: in expansion of macro 'forn'
   34 |     forn(i, n)
      |     ^~~~
supertrees.cpp:5:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    5 | #define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
      |                             ^
supertrees.cpp:36:9: note: in expansion of macro 'forn'
   36 |         forn(j, n)
      |         ^~~~
supertrees.cpp:5:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    5 | #define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
      |                             ^
supertrees.cpp:45:5: note: in expansion of macro 'forn'
   45 |     forn(i, n)
      |     ^~~~
supertrees.cpp:5:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    5 | #define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
      |                             ^
supertrees.cpp:47:9: note: in expansion of macro 'forn'
   47 |         forn(j, n)
      |         ^~~~
supertrees.cpp:5:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    5 | #define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
      |                             ^
supertrees.cpp:62:9: note: in expansion of macro 'forn'
   62 |         forn(j, n)
      |         ^~~~
supertrees.cpp:66:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |         for (int j = 0; j + 1 < L.size(); j++)
      |                         ~~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1184 KB Output is correct
7 Correct 251 ms 22264 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1184 KB Output is correct
7 Correct 251 ms 22264 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 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 5 ms 640 KB Output is correct
17 Correct 112 ms 8312 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 5880 KB Output is correct
21 Correct 244 ms 22136 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 265 ms 22264 KB Output is correct
24 Correct 260 ms 22136 KB Output is correct
25 Correct 100 ms 8184 KB Output is correct
26 Correct 97 ms 8184 KB Output is correct
27 Correct 263 ms 22136 KB Output is correct
28 Correct 269 ms 22228 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 256 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 240 ms 22268 KB Output is correct
10 Correct 1 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 247 ms 22140 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 640 KB Output is correct
17 Correct 110 ms 8184 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 61 ms 5880 KB Output is correct
22 Correct 246 ms 22236 KB Output is correct
23 Correct 244 ms 22136 KB Output is correct
24 Correct 263 ms 22136 KB Output is correct
25 Correct 102 ms 12152 KB Output is correct
26 Correct 99 ms 8188 KB Output is correct
27 Correct 243 ms 22136 KB Output is correct
28 Correct 264 ms 22136 KB Output is correct
29 Correct 108 ms 12152 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 62 ms 5752 KB Output is correct
5 Correct 263 ms 22136 KB Output is correct
6 Correct 246 ms 22136 KB Output is correct
7 Correct 267 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 62 ms 5884 KB Output is correct
10 Correct 248 ms 22136 KB Output is correct
11 Correct 251 ms 22116 KB Output is correct
12 Correct 284 ms 22392 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Incorrect 1 ms 256 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 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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1184 KB Output is correct
7 Correct 251 ms 22264 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 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 5 ms 640 KB Output is correct
17 Correct 112 ms 8312 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 5880 KB Output is correct
21 Correct 244 ms 22136 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 265 ms 22264 KB Output is correct
24 Correct 260 ms 22136 KB Output is correct
25 Correct 100 ms 8184 KB Output is correct
26 Correct 97 ms 8184 KB Output is correct
27 Correct 263 ms 22136 KB Output is correct
28 Correct 269 ms 22228 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 240 ms 22268 KB Output is correct
38 Correct 1 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 247 ms 22140 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 110 ms 8184 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 61 ms 5880 KB Output is correct
50 Correct 246 ms 22236 KB Output is correct
51 Correct 244 ms 22136 KB Output is correct
52 Correct 263 ms 22136 KB Output is correct
53 Correct 102 ms 12152 KB Output is correct
54 Correct 99 ms 8188 KB Output is correct
55 Correct 243 ms 22136 KB Output is correct
56 Correct 264 ms 22136 KB Output is correct
57 Correct 108 ms 12152 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 6 ms 640 KB Output is correct
61 Correct 110 ms 8184 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Incorrect 1 ms 256 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 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 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 11 ms 1184 KB Output is correct
7 Correct 251 ms 22264 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 1152 KB Output is correct
13 Correct 241 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 5 ms 640 KB Output is correct
17 Correct 112 ms 8312 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 64 ms 5880 KB Output is correct
21 Correct 244 ms 22136 KB Output is correct
22 Correct 247 ms 22136 KB Output is correct
23 Correct 265 ms 22264 KB Output is correct
24 Correct 260 ms 22136 KB Output is correct
25 Correct 100 ms 8184 KB Output is correct
26 Correct 97 ms 8184 KB Output is correct
27 Correct 263 ms 22136 KB Output is correct
28 Correct 269 ms 22228 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 240 ms 22268 KB Output is correct
38 Correct 1 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 247 ms 22140 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 640 KB Output is correct
45 Correct 110 ms 8184 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 61 ms 5880 KB Output is correct
50 Correct 246 ms 22236 KB Output is correct
51 Correct 244 ms 22136 KB Output is correct
52 Correct 263 ms 22136 KB Output is correct
53 Correct 102 ms 12152 KB Output is correct
54 Correct 99 ms 8188 KB Output is correct
55 Correct 243 ms 22136 KB Output is correct
56 Correct 264 ms 22136 KB Output is correct
57 Correct 108 ms 12152 KB Output is correct
58 Correct 1 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 62 ms 5752 KB Output is correct
62 Correct 263 ms 22136 KB Output is correct
63 Correct 246 ms 22136 KB Output is correct
64 Correct 267 ms 22136 KB Output is correct
65 Correct 1 ms 256 KB Output is correct
66 Correct 62 ms 5884 KB Output is correct
67 Correct 248 ms 22136 KB Output is correct
68 Correct 251 ms 22116 KB Output is correct
69 Correct 284 ms 22392 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Incorrect 1 ms 256 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -