oj.uz

Submission #721965

# Submission time Handle Problem Language Result Execution time Memory
721965 2023-04-11T09:27:17 Z danikoynov Connecting Supertrees (IOI20_supertrees) C++14
56 / 100
 218 ms 31972 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 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)
    {
        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;
    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 ++)
            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)
                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;
        }
    }
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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 2260 KB Output is correct
7 Correct 181 ms 31972 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 2260 KB Output is correct
7 Correct 181 ms 31972 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 171 ms 28060 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 1748 KB Output is correct
17 Correct 86 ms 20516 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 45 ms 8268 KB Output is correct
21 Correct 184 ms 28452 KB Output is correct
22 Correct 177 ms 27852 KB Output is correct
23 Correct 182 ms 29864 KB Output is correct
24 Correct 173 ms 27944 KB Output is correct
25 Correct 78 ms 18444 KB Output is correct
26 Correct 73 ms 17964 KB Output is correct
27 Correct 185 ms 30988 KB Output is correct
28 Correct 170 ms 27952 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 45 ms 8168 KB Output is correct
5 Correct 180 ms 28388 KB Output is correct
6 Correct 177 ms 27812 KB Output is correct
7 Correct 192 ms 29852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 46 ms 8220 KB Output is correct
10 Correct 185 ms 28376 KB Output is correct
11 Correct 173 ms 27804 KB Output is correct
12 Correct 181 ms 30976 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 352 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 45 ms 8240 KB Output is correct
17 Correct 178 ms 28460 KB Output is correct
18 Correct 218 ms 28316 KB Output is correct
19 Correct 170 ms 28168 KB Output is correct
20 Correct 180 ms 27984 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 2260 KB Output is correct
7 Correct 181 ms 31972 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 171 ms 28060 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 1748 KB Output is correct
17 Correct 86 ms 20516 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 45 ms 8268 KB Output is correct
21 Correct 184 ms 28452 KB Output is correct
22 Correct 177 ms 27852 KB Output is correct
23 Correct 182 ms 29864 KB Output is correct
24 Correct 173 ms 27944 KB Output is correct
25 Correct 78 ms 18444 KB Output is correct
26 Correct 73 ms 17964 KB Output is correct
27 Correct 185 ms 30988 KB Output is correct
28 Correct 170 ms 27952 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 356 KB Output is correct
32 Incorrect 1 ms 340 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 356 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 9 ms 2260 KB Output is correct
7 Correct 181 ms 31972 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 8 ms 2004 KB Output is correct
13 Correct 171 ms 28060 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 1748 KB Output is correct
17 Correct 86 ms 20516 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 45 ms 8268 KB Output is correct
21 Correct 184 ms 28452 KB Output is correct
22 Correct 177 ms 27852 KB Output is correct
23 Correct 182 ms 29864 KB Output is correct
24 Correct 173 ms 27944 KB Output is correct
25 Correct 78 ms 18444 KB Output is correct
26 Correct 73 ms 17964 KB Output is correct
27 Correct 185 ms 30988 KB Output is correct
28 Correct 170 ms 27952 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 356 KB Output is correct
32 Incorrect 1 ms 340 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -