oj.uz

Submission #503197

# Submission time Handle Problem Language Result Execution time Memory
503197 2022-01-07T13:20:53 Z LouayFarah Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 233 ms 24108 KB 
#include "bits/stdc++.h"

using namespace std;

#define endl "\n"
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const long long MOD = 1e9+7;
const long long INF = 1e18;

int nx[4] = {0, 0, -1, 1};
int ny[4] = {1, -1, 0, 0};

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

struct dsu
{
    vector<int> len;
    vector<int> link;

    void init(int n)
    {
        len.assign(n, 1);
        link.assign(n, 0);
        for(int i = 0; i<n; i++)
        {
            link[i] = i;
        }
    }

    int search(int x)
    {
        if(x!=link[x])
            link[x] = search(link[x]);
        return link[x];
    }

    bool check(int a, int b)
    {
        return search(a)==search(b);
    }

    void join(int a, int b)
    {
        a = search(a);
        b = search(b);

        if(a!=b)
        {
            if(len[a]<len[b])
                swap(a, b);

            len[a]+=len[b];
            link[b] = a;
        }
    }
};

int construct(vector<vector<int>> p)
{
    int n = int(p[0].size());

    vector<vector<int>> b(n, vector<int>(n, 0));

    dsu d;
    d.init(n);

    bool flag1 = false;
    bool flag2 = true;

    for(int i = 0; i<n; i++)
    {
        for(int j = i+1; j<n; j++)
        {
            if(p[i][j]==1)
            {
                d.join(i, j);
                flag1 = true;
            }
            if(p[i][j]==2)
            {
                d.join(i, j);
                flag2 = true;
            }
        }
    }

    vector<vector<int>> groups(n);
    for(int i = 0; i<n; i++)
    {
        int parent = d.search(i);
        groups[parent].pb(i);
    }

    /*for(int i = 0; i<n; i++)
    {
        cout << i << ": ";
        for(auto elt: groups[i])
            cout << elt << ' ';
        cout << endl;
    }*/


    if(!flag2&&flag1)
    {
        for(int i = 0; i<n; i++)
        {
            if(groups[i].empty())
                continue;

            int len = int(groups[i].size());
            for(int j = 0; j<len-1; j++)
            {

                int A = groups[i][j];
                int B = groups[i][j+1];

                b[A][B] = 1;
                b[B][A] = 1;
            }
        }
    }
    else if(!flag1&&flag2)
    {
        for(int i = 0; i<n; i++)
        {
            if(groups[i].empty())
                continue;

            if(int(groups[i].size())==2)
                return 0;

            int len = int(groups[i].size());
            for(int j = 0; j<len-1; j++)
            {

                int A = groups[i][j];
                int B = groups[i][j+1];

                b[A][B] = 1;
                b[B][A] = 1;
            }
            int A = groups[i][len-1];
            int B = groups[i][0];

            b[A][B] = 1;
            b[B][A] = 1;
        }
    }
    else
    {
        for(auto group: groups)
        {
            if(group.empty())
                continue;


            vector<int> one, two;
            int len = int(group.size());
            for(int i = 0; i<len; i++)
            {
                int A = group[i];
                bool only2 = true;
                for(int j = 0; j<len; j++)
                {
                    if(i==j)
                        continue;
                    int B = group[j];
                    if(p[A][B]==1)
                    {
                        only2 = false;
                        break;
                    }
                }

                if(only2)
                    two.pb(A);
                else
                    one.pb(A);
            }

            if(two.empty())
            {
                for(int j = 0; j<int(one.size())-1; j++)
                {

                    int A = one[j];
                    int B = one[j+1];

                    b[A][B] = 1;
                    b[B][A] = 1;
                }
            }
            else if(one.empty())
            {
                if(int(two.size())==2)
                    return 0;
                for(int j = 0; j<int(two.size())-1; j++)
                {
                    int A = two[j];
                    int B = two[j+1];

                    b[A][B] = 1;
                    b[B][A] = 1;
                }
                int A = two[int(two.size())-1];
                int B = two[0];

                b[A][B] = 1;
                b[B][A] = 1;
            }
            else
            {
                for(int j = 0; j<int(one.size())-1; j++)
                {

                    int A = one[j];
                    int B = one[j+1];

                    b[A][B] = 1;
                    b[B][A] = 1;
                }

                for(int j = 0; j<int(two.size())-1; j++)
                {
                    int A = two[j];
                    int B = two[j+1];

                    b[A][B] = 1;
                    b[B][A] = 1;
                }

                int A = one[int(one.size())-1];
                int B = two[0];
                int C = two[int(two.size())-1];

                b[A][B] = 1;
                b[B][A] = 1;
                b[A][C] = 1;
                b[C][A] = 1;
            }
        }
    }

    for(int i = 0; i<n; i++)
    {
        for(int j = i+1; j<n; j++)
        {
            if(p[i][j]==0&&d.check(i, j))
                return 0;
            if(!d.check(i, j)&&p[i][j]!=0)
                return 0;
        }
    }

    for(int i = 0; i<n; i++)
    {
        b[i][i]  = 0;
    }

    build(b);
    return 1;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 182 ms 23976 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 182 ms 23976 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 180 ms 23968 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 828 KB Output is correct
17 Correct 81 ms 14072 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 43 ms 6248 KB Output is correct
21 Correct 179 ms 24004 KB Output is correct
22 Correct 177 ms 24036 KB Output is correct
23 Correct 181 ms 24108 KB Output is correct
24 Correct 167 ms 23944 KB Output is correct
25 Correct 85 ms 14072 KB Output is correct
26 Correct 73 ms 14076 KB Output is correct
27 Correct 178 ms 24028 KB Output is correct
28 Correct 175 ms 23988 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 288 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 296 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 9 ms 1164 KB Output is correct
9 Correct 181 ms 24040 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 1180 KB Output is correct
13 Correct 172 ms 24076 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 868 KB Output is correct
17 Correct 79 ms 14056 KB Output is correct
18 Correct 0 ms 296 KB Output is correct
19 Correct 0 ms 288 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 46 ms 6340 KB Output is correct
22 Correct 186 ms 23916 KB Output is correct
23 Correct 172 ms 23976 KB Output is correct
24 Correct 203 ms 23912 KB Output is correct
25 Correct 74 ms 14108 KB Output is correct
26 Correct 81 ms 14064 KB Output is correct
27 Correct 233 ms 24032 KB Output is correct
28 Correct 188 ms 24004 KB Output is correct
29 Correct 71 ms 14060 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 45 ms 6244 KB Output is correct
5 Correct 174 ms 23920 KB Output is correct
6 Correct 189 ms 23912 KB Output is correct
7 Correct 186 ms 24040 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 50 ms 6200 KB Output is correct
10 Correct 167 ms 24004 KB Output is correct
11 Correct 198 ms 23924 KB Output is correct
12 Correct 177 ms 24004 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Incorrect 61 ms 6228 KB Too few ways to get from 0 to 24, should be 2 found 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 182 ms 23976 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 180 ms 23968 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 828 KB Output is correct
17 Correct 81 ms 14072 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 43 ms 6248 KB Output is correct
21 Correct 179 ms 24004 KB Output is correct
22 Correct 177 ms 24036 KB Output is correct
23 Correct 181 ms 24108 KB Output is correct
24 Correct 167 ms 23944 KB Output is correct
25 Correct 85 ms 14072 KB Output is correct
26 Correct 73 ms 14076 KB Output is correct
27 Correct 178 ms 24028 KB Output is correct
28 Correct 175 ms 23988 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 288 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 296 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 292 KB Output is correct
36 Correct 9 ms 1164 KB Output is correct
37 Correct 181 ms 24040 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 7 ms 1180 KB Output is correct
41 Correct 172 ms 24076 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 868 KB Output is correct
45 Correct 79 ms 14056 KB Output is correct
46 Correct 0 ms 296 KB Output is correct
47 Correct 0 ms 288 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 46 ms 6340 KB Output is correct
50 Correct 186 ms 23916 KB Output is correct
51 Correct 172 ms 23976 KB Output is correct
52 Correct 203 ms 23912 KB Output is correct
53 Correct 74 ms 14108 KB Output is correct
54 Correct 81 ms 14064 KB Output is correct
55 Correct 233 ms 24032 KB Output is correct
56 Correct 188 ms 24004 KB Output is correct
57 Correct 71 ms 14060 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 288 KB Output is correct
60 Correct 4 ms 844 KB Output is correct
61 Correct 79 ms 14088 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Incorrect 47 ms 6184 KB Too few ways to get from 1 to 11, should be 2 found 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 7 ms 1152 KB Output is correct
7 Correct 182 ms 23976 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 288 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 8 ms 1196 KB Output is correct
13 Correct 180 ms 23968 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 4 ms 828 KB Output is correct
17 Correct 81 ms 14072 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 296 KB Output is correct
20 Correct 43 ms 6248 KB Output is correct
21 Correct 179 ms 24004 KB Output is correct
22 Correct 177 ms 24036 KB Output is correct
23 Correct 181 ms 24108 KB Output is correct
24 Correct 167 ms 23944 KB Output is correct
25 Correct 85 ms 14072 KB Output is correct
26 Correct 73 ms 14076 KB Output is correct
27 Correct 178 ms 24028 KB Output is correct
28 Correct 175 ms 23988 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 288 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 296 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 292 KB Output is correct
36 Correct 9 ms 1164 KB Output is correct
37 Correct 181 ms 24040 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 7 ms 1180 KB Output is correct
41 Correct 172 ms 24076 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 4 ms 868 KB Output is correct
45 Correct 79 ms 14056 KB Output is correct
46 Correct 0 ms 296 KB Output is correct
47 Correct 0 ms 288 KB Output is correct
48 Correct 0 ms 204 KB Output is correct
49 Correct 46 ms 6340 KB Output is correct
50 Correct 186 ms 23916 KB Output is correct
51 Correct 172 ms 23976 KB Output is correct
52 Correct 203 ms 23912 KB Output is correct
53 Correct 74 ms 14108 KB Output is correct
54 Correct 81 ms 14064 KB Output is correct
55 Correct 233 ms 24032 KB Output is correct
56 Correct 188 ms 24004 KB Output is correct
57 Correct 71 ms 14060 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 45 ms 6244 KB Output is correct
62 Correct 174 ms 23920 KB Output is correct
63 Correct 189 ms 23912 KB Output is correct
64 Correct 186 ms 24040 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 50 ms 6200 KB Output is correct
67 Correct 167 ms 24004 KB Output is correct
68 Correct 198 ms 23924 KB Output is correct
69 Correct 177 ms 24004 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Incorrect 61 ms 6228 KB Too few ways to get from 0 to 24, should be 2 found 1
74 Halted 0 ms 0 KB -