oj.uz

Submission #721970

# Submission time Handle Problem Language Result Execution time Memory
721970 2023-04-11T09:31:03 Z danikoynov Connecting Supertrees (IOI20_supertrees) C++14
75 / 100
 222 ms 30232 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;

vector < int > graph[maxn], graph2[maxn], comp;
int cap[maxn][maxn];
int used[maxn], N;
vector<std::vector<int>> answer;

void dfs2(int v)
{
    comp.push_back(v);
    used[v] = 1;
    for (int u : graph2[v])
    {
        if (!used[u])
            dfs2(u);
    }
}

void dfs(int v)
{
    comp.push_back(v);
    used[v] = 1;
    for (int u : graph[v])
    {
        if (!used[u])
            dfs(u);
    }
}

bool solve_2_component()
{
    /**for (int i = 0; i < comp.size(); i ++)
        for (int j = 0; j < comp.size(); j ++)
            if (cap[comp[i]][comp[j]] != 2)
                return false;

    if (comp.size() == 2)
        return false;*/
    if (comp.size() == 1)
        return true;
    answer[comp[0]][comp.back()] = 1;
    answer[comp.back()][comp[0]] = 1;


    for (int i = 0; i < (int)(comp.size()) - 1; i ++)
    {
        answer[comp[i]][comp[i + 1]] = 1;
        answer[comp[i + 1]][comp[i]] = 1;
    }

    /**for (int i = 0; i < comp.size(); i ++)
        for (int j = 0; j < comp.size(); j ++)
            cap[comp[i]][comp[j]] = 0;*/

    return true;

}
bool all2;
bool solve_component()
{
    for (int i = 0; i < comp.size(); i ++)
        for (int j = 0; j < comp.size(); j ++)
            if (cap[comp[i]][comp[j]] == 0)
                return false;

    if (comp.size() != 1 && all2)
    {
        if (cap[comp[0]][comp[1]] == 2)
        {
            if (comp.size() == 2)
                return false;
            answer[comp[0]][comp.back()] = 1;
            answer[comp.back()][comp[0]] = 1;
        }
    }

    for (int i = 0; i < (int)(comp.size()) - 1; i ++)
    {
        answer[comp[i]][comp[i + 1]] = 1;
        answer[comp[i + 1]][comp[i]] = 1;
    }

    for (int i = 1; i < comp.size(); i ++)
        for (int j = 0; j < N; j ++)
            if (cap[comp[i]][j] == 2)
            {
                cap[comp[i]][j] = 0;
                cap[j][comp[i]] = 0;
            }

    return true;

}
int construct(std::vector<std::vector<int>> p)
{
    int n = p.size();
    N = n;
    all2 = true;
    for (int i = 0; i < n; i++)
    {
        std::vector<int> row;
        row.resize(n, 0);
        answer.push_back(row);
    }

    for (int i = 0; i < n; i ++)
        for (int j = 0; j < n; j ++)
        {
            if (p[i][j] == 1 && i != j)
                all2 = false;
            cap[i][j] = p[i][j];
        }



    for (int i = 0; i < n; i ++)
        for (int j = 0; j < n; j ++)
        {
            if (i != j && (cap[i][j] == 1 || (cap[i][j] == 2 && all2)))
                graph[i].push_back(j);
        }

    for (int i = 0; i < n; i ++)
    {
        if (!used[i])
        {
            comp.clear();
            dfs(i);
            bool is_fine = solve_component();
            if (!is_fine)
                return 0;
        }
    }
    if (!all2)
    {

        memset(used, 0, sizeof(used));
        for (int i = 0; i < n; i ++)
            for (int j = 0; j < n; j ++)
            {
                if (i != j && cap[i][j] == 2)
                    graph2[i].push_back(j);
            }

        for (int i = 0; i < n; i ++)
        {
            if (!used[i])
            {
                comp.clear();
                dfs2(i);
                bool is_fine = solve_2_component();
                if (!is_fine)
                    return false;
            }
        }
    }
    build(answer);
    return 1;
}

Compilation message

supertrees.cpp: In function 'bool solve_component()':
supertrees.cpp:64:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for (int i = 0; i < comp.size(); i ++)
      |                     ~~^~~~~~~~~~~~~
supertrees.cpp:65:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (int j = 0; j < comp.size(); j ++)
      |                         ~~^~~~~~~~~~~~~
supertrees.cpp:86:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for (int i = 1; i < comp.size(); i ++)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2132 KB Output is correct
7 Correct 181 ms 30112 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2132 KB Output is correct
7 Correct 181 ms 30112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 8 ms 1980 KB Output is correct
13 Correct 173 ms 25960 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 88 ms 18632 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 55 ms 7820 KB Output is correct
21 Correct 174 ms 26568 KB Output is correct
22 Correct 189 ms 26040 KB Output is correct
23 Correct 187 ms 28068 KB Output is correct
24 Correct 187 ms 26060 KB Output is correct
25 Correct 74 ms 16588 KB Output is correct
26 Correct 70 ms 16060 KB Output is correct
27 Correct 218 ms 29132 KB Output is correct
28 Correct 178 ms 25956 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 8 ms 2068 KB Output is correct
9 Correct 169 ms 26288 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 2208 KB Output is correct
13 Correct 179 ms 30232 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 5 ms 1664 KB Output is correct
17 Correct 89 ms 18760 KB Output is correct
18 Correct 1 ms 352 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 46 ms 7820 KB Output is correct
22 Correct 171 ms 26608 KB Output is correct
23 Correct 182 ms 26188 KB Output is correct
24 Correct 222 ms 29444 KB Output is correct
25 Correct 71 ms 16192 KB Output is correct
26 Correct 86 ms 16856 KB Output is correct
27 Correct 175 ms 26124 KB Output is correct
28 Correct 196 ms 28232 KB Output is correct
29 Correct 71 ms 16192 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 44 ms 7748 KB Output is correct
5 Correct 186 ms 26568 KB Output is correct
6 Correct 173 ms 26056 KB Output is correct
7 Correct 196 ms 28080 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 45 ms 7796 KB Output is correct
10 Correct 174 ms 26564 KB Output is correct
11 Correct 173 ms 26044 KB Output is correct
12 Correct 191 ms 29124 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 45 ms 7744 KB Output is correct
17 Correct 189 ms 26548 KB Output is correct
18 Correct 181 ms 26296 KB Output is correct
19 Correct 177 ms 26204 KB Output is correct
20 Correct 198 ms 26004 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2132 KB Output is correct
7 Correct 181 ms 30112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 8 ms 1980 KB Output is correct
13 Correct 173 ms 25960 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 88 ms 18632 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 55 ms 7820 KB Output is correct
21 Correct 174 ms 26568 KB Output is correct
22 Correct 189 ms 26040 KB Output is correct
23 Correct 187 ms 28068 KB Output is correct
24 Correct 187 ms 26060 KB Output is correct
25 Correct 74 ms 16588 KB Output is correct
26 Correct 70 ms 16060 KB Output is correct
27 Correct 218 ms 29132 KB Output is correct
28 Correct 178 ms 25956 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 2068 KB Output is correct
37 Correct 169 ms 26288 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 8 ms 2208 KB Output is correct
41 Correct 179 ms 30232 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 352 KB Output is correct
44 Correct 5 ms 1664 KB Output is correct
45 Correct 89 ms 18760 KB Output is correct
46 Correct 1 ms 352 KB Output is correct
47 Correct 0 ms 468 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 46 ms 7820 KB Output is correct
50 Correct 171 ms 26608 KB Output is correct
51 Correct 182 ms 26188 KB Output is correct
52 Correct 222 ms 29444 KB Output is correct
53 Correct 71 ms 16192 KB Output is correct
54 Correct 86 ms 16856 KB Output is correct
55 Correct 175 ms 26124 KB Output is correct
56 Correct 196 ms 28232 KB Output is correct
57 Correct 71 ms 16192 KB Output is correct
58 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
59 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 8 ms 2132 KB Output is correct
7 Correct 181 ms 30112 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 8 ms 1980 KB Output is correct
13 Correct 173 ms 25960 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 4 ms 1748 KB Output is correct
17 Correct 88 ms 18632 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 55 ms 7820 KB Output is correct
21 Correct 174 ms 26568 KB Output is correct
22 Correct 189 ms 26040 KB Output is correct
23 Correct 187 ms 28068 KB Output is correct
24 Correct 187 ms 26060 KB Output is correct
25 Correct 74 ms 16588 KB Output is correct
26 Correct 70 ms 16060 KB Output is correct
27 Correct 218 ms 29132 KB Output is correct
28 Correct 178 ms 25956 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 8 ms 2068 KB Output is correct
37 Correct 169 ms 26288 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 8 ms 2208 KB Output is correct
41 Correct 179 ms 30232 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 352 KB Output is correct
44 Correct 5 ms 1664 KB Output is correct
45 Correct 89 ms 18760 KB Output is correct
46 Correct 1 ms 352 KB Output is correct
47 Correct 0 ms 468 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 46 ms 7820 KB Output is correct
50 Correct 171 ms 26608 KB Output is correct
51 Correct 182 ms 26188 KB Output is correct
52 Correct 222 ms 29444 KB Output is correct
53 Correct 71 ms 16192 KB Output is correct
54 Correct 86 ms 16856 KB Output is correct
55 Correct 175 ms 26124 KB Output is correct
56 Correct 196 ms 28232 KB Output is correct
57 Correct 71 ms 16192 KB Output is correct
58 Correct 0 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 44 ms 7748 KB Output is correct
62 Correct 186 ms 26568 KB Output is correct
63 Correct 173 ms 26056 KB Output is correct
64 Correct 196 ms 28080 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 45 ms 7796 KB Output is correct
67 Correct 174 ms 26564 KB Output is correct
68 Correct 173 ms 26044 KB Output is correct
69 Correct 191 ms 29124 KB Output is correct
70 Correct 0 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 45 ms 7744 KB Output is correct
74 Correct 189 ms 26548 KB Output is correct
75 Correct 181 ms 26296 KB Output is correct
76 Correct 177 ms 26204 KB Output is correct
77 Correct 198 ms 26004 KB Output is correct
78 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
79 Halted 0 ms 0 KB -