Submission #1119136

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119136		alexdd	Connecting Supertrees (IOI20_supertrees)	C++17	46 / 100	203 ms	28396 KiB

supertrees

#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
int n;
bool visited[1005];
vector<int> comp;
vector<vector<int>> p;
void dfs(int nod)
{
    comp.push_back(nod);
    visited[nod]=1;
    for(int i=0;i<n;i++)
        if(!visited[i] && p[nod][i]>0)
            dfs(i);
}
vector<int> aux;
void dfs2(int nod)
{
    visited[nod]=1;
    aux.push_back(nod);
    for(int i=0;i<n;i++)
        if(!visited[i] && p[nod][i]==1)
            dfs2(i);
}
int construct(vector<vector<int>> copp)
{
    p = copp;
    n = p.size();
    vector<vector<int>> b(n, vector<int>(n));
    for(int i=0;i<n;i++)
    {
        if(!visited[i])
        {
            comp.clear();
            dfs(i);
            for(int x:comp)
                visited[x]=0;
            vector<int> roots;
            for(int x:comp)
            {
                if(!visited[x])
                {
                    roots.push_back(x);
                    aux.clear();
                    dfs2(x);
                    for(auto y:aux)
                        if(y!=x)
                            b[x][y]=b[y][x]=1;
                }
            }
            if((int)roots.size() == 2)
                return 0;
            if((int)roots.size() > 1)
            {
                for(int i=0;i+1<roots.size();i++)
                    b[roots[i]][roots[i+1]] = b[roots[i+1]][roots[i]] = 1;
                b[roots[0]][roots.back()] = b[roots.back()][roots[0]] = 1;
            }
        }
    }
    build(b);
    return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:55:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |                 for(int i=0;i+1<roots.size();i++)
      |                             ~~~^~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 35 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4