Submission #403506

#	Time	Username	Problem	Language	Result	Execution time	Memory
403506		victoriad	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1 ms	204 KiB

supertrees

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

int construct(std::vector<std::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++;
        }
    }
    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 p=-1;
        for(int k=0;k<c[i].size();k++){
            if(c[i][k]==1){
                if(p==-1)p=k;
                x=k;
            }
            if(c[i][k]==2){
				if(p==-1)p=k;
                if(x==-1){
                    x=k;
                }
                else{
                    r[k][x]=1;
                    r[x][k]=1;
                    x=k;
                }
            }
        }
		if(r[p][x]==1){
			return 0;
			break;
		}
		else{
			r[p][x]=1;
			r[x][p]=1;
		}
    }
	build(r);
	return 1;
}

Compilation message (stderr)

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

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