Submission #732735

#	Time	Username	Problem	Language	Result	Execution time	Memory
732735		raul2008487	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	207 ms	22248 KiB

supertrees

#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> ans;
	std::vector<std::vector<bool>> vis;
	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++) {
		for(int j=0;j<n;j++){
		    if(j==i+1 && p[i][j]){
		        ans[i][j]=1;
		    }
		    else if(j==i-1 && p[i][j]){
		        ans[i][j]=1;
		    }
		    else{
		        ans[i][j]=0;
		    }
		}
	}
	build(ans);
	return 1;
}

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