oj.uz

Submission #300710

# Submission time Handle Problem Language Result Execution time Memory
300710 2020-09-17T12:29:02 Z IgorI Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 281 ms 22232 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 = 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

# Verdict Execution time Memory 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 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct
8 Correct 1 ms 384 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 10 ms 1152 KB Output is correct
13 Correct 245 ms 22208 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 116 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 252 ms 22136 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 281 ms 22136 KB Output is correct
24 Correct 249 ms 22136 KB Output is correct
25 Correct 104 ms 8188 KB Output is correct
26 Correct 104 ms 8184 KB Output is correct
27 Correct 268 ms 22100 KB Output is correct
28 Correct 251 ms 22232 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory 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 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 KB Too few ways to get from 0 to 1, should be 2 found 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory 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 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct
8 Correct 1 ms 384 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 10 ms 1152 KB Output is correct
13 Correct 245 ms 22208 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 116 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 252 ms 22136 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 281 ms 22136 KB Output is correct
24 Correct 249 ms 22136 KB Output is correct
25 Correct 104 ms 8188 KB Output is correct
26 Correct 104 ms 8184 KB Output is correct
27 Correct 268 ms 22100 KB Output is correct
28 Correct 251 ms 22232 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 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory 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 1152 KB Output is correct
7 Correct 254 ms 22136 KB Output is correct
8 Correct 1 ms 384 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 10 ms 1152 KB Output is correct
13 Correct 245 ms 22208 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 116 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 67 ms 5880 KB Output is correct
21 Correct 252 ms 22136 KB Output is correct
22 Correct 260 ms 22136 KB Output is correct
23 Correct 281 ms 22136 KB Output is correct
24 Correct 249 ms 22136 KB Output is correct
25 Correct 104 ms 8188 KB Output is correct
26 Correct 104 ms 8184 KB Output is correct
27 Correct 268 ms 22100 KB Output is correct
28 Correct 251 ms 22232 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 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -