Submission #720124

#TimeUsernameProblemLanguageResultExecution timeMemory
720124mseebacher슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
0 ms212 KiB
#include "supertrees.h"
#include <bits/stdc++.h> 
 
using namespace std;
 
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> comp(n);
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			if(p[i][j]){
				comp[i].push_back(j);
			}
		}
	}
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			if(p[i][j] && comp[i] != comp[j]) return 0;
		}
	}
	
	vector<bool> vis(n,0);
	vector<vector<int>> ans(n,vector<int>(n,0));
	for(int i = 0;i<n;i++){
		if(!vis[i]){
			for(int j = 0;j<(int)comp[i].size();j++){
				vis[comp[i][j]] = 1;
				if(j == comp[i].size()-1) {
					ans[comp[i][j]][comp[i][0]] = 1;
					ans[comp[i][0]][comp[i][j]] = 1;
				}else{
					ans[comp[i][j]][comp[i][j+1]] = 1;
					ans[comp[i][j+1]][comp[i][j]] = 1;
				}
			}
		}
	}
	
	build(ans);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:28:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     if(j == comp[i].size()-1) {
      |        ~~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...