제출 #403626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
403626		victoriad	Connecting Supertrees (IOI20_supertrees)	C++14	40 / 100	296 ms	31576 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <cmath>
#include <cstdio>
using namespace std;

int sub2(vector<vector<int> >p){
 int n = p.size();
	vector<vector<int> >r(n);
	vector<vector<int> >c;
    vector<int>us(n,-1);
    int cc=0;
    for(int i=0;i<n;i++){
        if(us[i]==-1){
            vector<int>s=p[i];
            c.push_back(s);
            for(int k=0;k<n;k++){
                if(s[k]!=0){
                    if(us[k]==-1){
                        us[k]=cc;
                    }
                    else if(us[k]!=cc){
                        return 0;
                        break;
                    }
                }
            }
            cc++;
        }
        else{
            int x=us[i];
            for(int k=0;k<n;k++){
                if(c[x][k]==p[i][k])continue;
                else{
                    if(c[x][k]==0 && p[i][k]!=0){
                        return 0;
                        break;
                    }
                    if(c[x][k]!=0 && p[i][k]==0){
                        return 0;
                        break;
                    }
                }
            }
        }
    }
    vector<int>a(n,0);
    for(int i=0;i<n;i++)r[i]=a;;
	for(int i=0;i<c.size();i++){
        int x=-1;
		int l=-1;
        int con=0;
        for(int k=0;k<c[i].size();k++){
            if(c[i][k]==1){
                if(l==-1)l=k;
                x=k;
                con++;
            }
            if(c[i][k]==2){
                con++;
                if(x==-1){
                    x=k;
                }
                else{
                    r[k][x]=1;
                    r[x][k]=1;
                    x=k;
                }
            }
        }
		if(con==2){
			return 0;
			break;
		}
        else if(l==x){
 
        }
		else{
			r[l][x]=1;
			r[x][l]=1;
		}
    }
	build(r);
	return 1;   
}
int sub1(std::vector<std::vector<int> > p){
  int n = p.size();
	vector<vector<int> >r(n);
	vector<vector<int> >c;
    vector<bool>us(n,false);
    for(int i=0;i<n;i++){
        vector<int>s=p[i];
         bool p=false;
        for(int k=0;k<c.size();k++){
            if(s==c[k]){
                p=true;
                break;
            }
        }
        if(!p){
           c.push_back(s); 
           for(int j=0;j<s.size();j++){
               if(s[j]==1){
                   if(us[j]){
                       return 0;
                   }
                   else{
                       us[j]=true;
                   }
               }
           }
        }
    }
    vector<int>a(n,0);
    for(int i=0;i<n;i++)r[i]=a;;
    for(int i=0;i<c.size();i++){
        int x=-1;
        for(int k=0;k<c[i].size();k++){
            if(c[i][k]==1){
                if(x==-1){
                    x=k;
                }
                else{
                    r[k][x]=1;
                    r[x][k]=1;
                    x=k;
                }
            }
        }
    }
	build(r);
	return 1;  
}

int construct(std::vector<std::vector<int> > p) {
	int n=p.size();
    int x=0;
    for(int i=0;i<n;i++){
        for(int k=0;k<n;k++){
            if(k!=i){
                if(p[k][i]!=0){
                    if(p[k][i]==1){
                        x=1;
                        break;
                    }
                    else{
                        x=2;
                        break;
                    }
                }
            }
        }
    }
    if(x==2)return sub2(p);
    else return sub1(p);
}

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

supertrees.cpp: In function 'int sub2(std::vector<std::vector<int> >)':
supertrees.cpp:49:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for(int i=0;i<c.size();i++){
      |              ~^~~~~~~~~
supertrees.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for(int k=0;k<c[i].size();k++){
      |                     ~^~~~~~~~~~~~
supertrees.cpp: In function 'int sub1(std::vector<std::vector<int> >)':
supertrees.cpp:94:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for(int k=0;k<c.size();k++){
      |                     ~^~~~~~~~~
supertrees.cpp:102:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |            for(int j=0;j<s.size();j++){
      |                        ~^~~~~~~~~
supertrees.cpp:116:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |     for(int i=0;i<c.size();i++){
      |                 ~^~~~~~~~~
supertrees.cpp:118:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |         for(int k=0;k<c[i].size();k++){
      |                     ~^~~~~~~~~~~~

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