Submission #732774

#	Time	Username	Problem	Language	Result	Execution time	Memory
732774		raul2008487	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	225 ms	28008 KiB

supertrees

#include "supertrees.h"
#include<algorithm>
#include <vector>
std::vector<std::vector<int>> ans;
std::vector<bool> vis;
std::vector<std::vector<int>> dp;
std::vector<std::pair<int,int>> pp;
void dfs(int i, int j, int n){
    vis[j]=1;
    pp.push_back({i,j});
    for(int k1=0;k1<n;k1++){
        if(dp[j][k1] && !vis[k1]){
            ans[j][k1]=ans[k1][j]=1;
            dfs(j,k1,n);
        }
    }
}	
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vis.resize(n,false);
	for(int i=0;i<n;i++){
	    std::vector<int> row;
	    row.resize(n,0);
	    ans.push_back(row);
	}
	for(int i=0;i<n;i++){
	    std::vector<int> d;
	    for(int j=0;j<n;j++){
	        d.push_back(p[i][j]);
	    }
	    dp.push_back(d);
	}
	for (int i = 0; i < n; i++) {
	    if(!vis[i]){
	        vis[i]=1;
	        for(int j=i+1;j<n;j++){
		        if(p[i][j] && !vis[j]){ 
		            ans[i][j]=ans[j][i]=1;
		            dfs(i,j,n);
		        }
		    }
	    }
	}
	for(int i=0;i<pp.size();i++){
	    for(int j=0;j<n;j++){
	        if((p[pp[i].first][j] && !p[pp[i].second][j]) || (!p[pp[i].first][j] && p[pp[i].second][j])){
	            return 0;
	        }
	    }
	}
	build(ans);
	return 1;
}

Compilation message (stderr)

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

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