제출 #309935

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309935		Genius1506	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	256 ms	22268 KiB

supertrees

#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;

const int mxN = 1002;
int par[mxN];
void init(int n){
    for(int i = 0; i <= n; i++)
        par[i] = i;
}
int find(int x){
    if(par[x]!=x)
        return par[x] = find(par[x]);
    return par[x];
}
void merge(int x, int y){
    x = find(x);
    y = find(y);
    if(x==y)
        return;
    par[x]=y;
}
int construct(vector<vector<int>> p){
    for(auto x : p){
        for(auto y: x)
            if(y==3)
                return 0;
    }
    int n = p.size();
    vector<vector<int>>ans(n,vector<int>(n,0)),comp(n,vector<int>()),tree(n,vector<int>());
    init(n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(p[i][j]==1)
                merge(i,j);
        }
    }
    for(int i = 0; i < n; i++)
        comp[find(i)].push_back(i);
    init(n);
    for(int i = 0; i < n; i++){
        for(int c1 : comp[i]){
            for(int c2 : comp[i]){
                if(p[c1][c2]==0)
                    return 0;
                else if(p[c1][c2]==1)
                    merge(c1,c2);
            }
        }
        vector<int>cycle;
        for(int x : comp[i]){
            tree[find(x)].push_back(x);
            if(find(x)==x)
                cycle.push_back(x);
        }
        if(cycle.size()==2)
            return 0;
        if(cycle.size()==1)
            continue;
        for(int j=0,x=1;j<cycle.size();j++,x++){
            if(x==cycle.size())
                x=0;
            ans[cycle[j]][cycle[x]]=1;
            ans[cycle[x]][cycle[j]]=1;
        }
    }
    for(int i = 0; i < n; i++){
        if(tree[i].size()==0)
            continue;
        int repn = tree[i][0];
        for(int j = 1; j < tree[i].size(); j++){
            ans[repn][tree[i][j]]=1;
            ans[tree[i][j]][repn]=1;
        }
    }
    build(ans);
    return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:60:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int j=0,x=1;j<cycle.size();j++,x++){
      |                         ~^~~~~~~~~~~~~
supertrees.cpp:61:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             if(x==cycle.size())
      |                ~^~~~~~~~~~~~~~
supertrees.cpp:71:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for(int j = 1; j < tree[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~~

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