Submission #977439

#	Time	Username	Problem	Language	Result	Execution time	Memory
977439		Amaarsaa	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	174 ms	26196 KiB

supertrees

#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
vector < int > adj[1002];
int used[1002];
vector < int > v;
void Go(int x) {
	used[x] = 1;
	v.push_back(x);
	for ( int X : adj[x]) {
		if (!used[X]) {
			Go(X);
		}
	}
}
int construct(vector<vector<int>> a) {
	int n = a.size(), i, j;
	vector < vector < int > > ans(n, vector<int>(n, 0));
	for ( i = 0; i < n; i++) {
		for ( j = 0; j < n; j ++) {
			if ( a[i][j] != 0 && i != j) adj[i].push_back(j);
		}
	}
	for ( i = 0; i < n; i ++) {
		if ( used[i] == 0) {
			v.clear();
			Go(i);
			for ( j = 1; j < v.size(); j ++) ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 1;
		}
	}
	
	build(ans);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:28:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |    for ( j = 1; j < v.size(); j ++) ans[v[j]][v[j - 1]] = ans[v[j - 1]][v[j]] = 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