제출 #318350

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

supertrees

#include "supertrees.h"
#include <iostream>
#include <vector>
#define pb push_back
using namespace std;
vector<vector<int>> answer;
vector <int> row,vec[1005],k;
int par[1005];
bool f[1005];
int construct(vector<vector<int>> p) {
    int n = p.size(),r=0;
    for(int i=0;i<n;i++){
        row.clear();
        for (int j=0;j<n;j++){
            if (p[i][j] == 2) r=1;
            if (p[i][j] == 3) return 0;
            if (p[i][i] != 1) return 0;
            row.pb(0);
        }
        answer.pb(row);
    }
    for(int i=0;i<n;i++)
        par[i]=i;
    for (int i=0;i<n;i++){
        if (f[i]) continue;
        for (int j=0;j<n;j++){
            if (p[i][j] == 1 && i!=j){
                vec[i].pb(j);
                f[j]=1;
                par[j] = i;
                answer[i][j]=answer[j][i]=1;
            }
        }
    }
    
    for(int i=0;i<n;i++) f[i]=0;
    for (int i=0;i<n;i++)
        for (int j=0;j<vec[i].size();j++)
        if (p[i][vec[i][j]] != 1) return 0;
      
    if (r == 0){
        for (int i=0;i<n;i++){
            for (int j=0;j<n;j++){
                if (par[i] == par[j] && p[i][j] != 1) return 0;
                if (par[i] != par[j] && p[i][j] != 0) return 0;
            }
        }
    }
    for(int i=0;i<n;i++){
        if (f[i]) continue;
        row.clear();
        for (int j=0;j<n;j++)
            if (p[i][j] == 2) f[j] = 1,row.pb(j);
        int st = i,cur = i;
        k.clear();
        k.pb(i);
        par[st] = st;
        for (int j=0;j<row.size();j++){
            k.pb(row[j]);
            par[row[j]] = st;
            answer[row[j]][cur] = answer[cur][row[j]] = 1;
            cur = row[j];
        }
        if (row.size()==0) continue;
        if (row.size() == 1) {return 0;}
        int last = row[row.size() - 1];
        answer[st][last] = answer[last][st] = 1;
    }
    if (r==1){
        for (int i=0;i<n;i++)
            for (int j=i+1;j<n;j++){
                if (par[i] == par[j] && p[i][j]!=2) return 0;
                if (par[i]!=par[j] && p[i][j]!=1) return 0;
            }
    }
    
    build(answer);
    return 1;
}

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int j=0;j<vec[i].size();j++)
      |                      ~^~~~~~~~~~~~~~
supertrees.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int j=0;j<row.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