제출 #888220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
888220		12345678	슈퍼트리 잇기 (IOI20_supertrees)	C++17	30 / 100	167 ms	22356 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;
bool vs[nx];
vector<int> c[nx], l[nx];

int construct(std::vector<std::vector<int>> p) {
	int n = p.size(), cnt=0;
    for (int i=0; i<n; i++) for (int j=0; j<n; j++) if (p[i][j]==3) return 0;
	vector<vector<int>> answer(n, vector<int> (n, 0));
    vector<int> h;
	for (int i=0; i<n; i++)
    {
        if (vs[i]) continue;
        vector<int> d;
        for (int j=0; j<n; j++) if (p[i][j]==1) vs[j]=1, d.push_back(j);
        for (auto u:d) for (auto v:d) if (p[u][v]!=1) return 0;
        h.push_back(i);
        c[i]=d;
        int sz=d.size();
        for (int j=0; j<sz-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
    }
    for (int i=0; i<n; i++) vs[i]=0;
    for (int i=0; i<h.size(); i++)
    {
        if (vs[h[i]]) continue;
        vector<int> d;
        for (auto j:h) if (p[i][j]) d.push_back(j), vs[j]=1;
        for (auto u:d)
        {
            for (auto x:c[u]) l[cnt].push_back(x);
            for (auto v:d)
            {
                if (v==u) continue;
                for (auto x:c[u]) for (auto y:c[v]) if (p[x][y]!=2) return 0;
            }
        }
        cnt++;
        if (d.size()==2) return 0;
        if (d.size()==1) continue;
        int sz=d.size();
        for (int j=0; j<sz-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
        answer[d[0]][d[sz-1]]=answer[d[sz-1]][d[0]]=1;
    }
    //cout<<cnt<<'\n';
    for (int i=0; i<cnt; i++)
    {
        for (int j=i+1; j<cnt; j++)
        {
            for (auto x:l[i]) for (auto y:l[j]) if (p[x][y]!=0) return 0;
        }
    }
	build(answer);
	return 1;
}

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

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

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