제출 #586053

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

supertrees

#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
vector<vector<int> >erg;
vector<int>cmp[2000] , comp;
int vis[2000] , visi[2000] , f[2000];
set<int> s;
int construct(vector<vector<int>> p) {
	int menge = p.size() , pl = 1;
	for(int i = 0 ; i < menge ; i++){
		erg.push_back(vector<int>() );
		for(int j = 0 ; j < menge ; j++){
			erg[i].push_back(0);
		}
	}
	for(int i = 0 ; i < menge  ; i++){
		p[i][i] = 1;
	}
	for(int i = 0 ; i < menge ; i++){
		if(vis[i] == 0){
			vis[i] = pl;
			for(int j = 0 ; j < menge ; j++){
				if(p[i][j] == 1){
					cmp[pl].push_back(j);
					vis[j] = pl;
				}
			}
			int fl = 1;
			for(int j = 0 ; j < menge ; j++){
				for(int k = 0 ; k < cmp[pl].size() ; k++){
					if(p[i][j] != p[cmp[pl][k]][j]){
						fl = 0;
						break;
					}
				}
			}
			for(int j = 0 ; j < cmp[pl].size() - 1 ; j++){
				erg[cmp[pl][j]][cmp[pl][j + 1]] = 1;
				erg[cmp[pl][j + 1]][cmp[pl][j]] = 1;
			}
			if(fl == 0){
				return 0;
			}
			pl++;
            f[pl] = i;
		}
	}
    int c = 1;
    for(int i = 1 ; i < pl; i++){
        s.clear();
        comp.clear();
        int kan = f[i];
        if(visi[i] == 0){
            visi[i] = c;
            for(int j = 0 ; j < menge ; j++){
                if(p[kan][j] == 2){
                    if(s.count(vis[j]) == 0){
                        s.insert(vis[j]);
                        comp.push_back(f[vis[j]]);
                        visi[vis[j]] = c;
                    }
                }
            }
            int fl = 1;

            for(int j = 0 ; j < menge ; j++){
                for(int k = 0 ; k < comp.size() ; k++){
                    if( (p[kan][j] == 2 && p[comp[k]][j] != 2) || (p[kan][j] != 2 && p[comp[k]][j] == 2) ){
                        fl = 0;
                        break;
                    }
                    if((p[kan][j] == 0 && p[comp[k]][j] != 0) || (p[kan][j] != 0 && p[comp[k]][j] == 0)){
                        fl = 0;
                        break;
                    }
                }
            }
            if(fl == 0){
                return 0;
            }
            comp.push_back(kan);
            for(int i = 0 ; i < comp.size() ; i++){
                if(i != (i + 1) % comp.size()){

                    erg[i][(i + 1) % comp.size()] = 1;
                    erg[(i + 1) % comp.size()][i] = 1;
                }
            }
        }
    }
	build(erg);
	return 1;
}

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

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int k = 0 ; k < cmp[pl].size() ; k++){
      |                     ~~^~~~~~~~~~~~~~~~
supertrees.cpp:38:22: 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 < cmp[pl].size() - 1 ; j++){
      |                    ~~^~~~~~~~~~~~~~~~~~~~
supertrees.cpp:68:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |                 for(int k = 0 ; k < comp.size() ; k++){
      |                                 ~~^~~~~~~~~~~~~
supertrees.cpp:83:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |             for(int i = 0 ; i < comp.size() ; i++){
      |                             ~~^~~~~~~~~~~~~
supertrees.cpp:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |                 if(i != (i + 1) % comp.size()){
      |                    ~~^~~~~~~~~~~~~~~~~~~~~~~~

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