제출 #422982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422982		albertolg101	Simurgh (IOI17_simurgh)	C++17	0 / 100	1 ms	204 KiB

simurgh

#include <bits/stdc++.h>
#include "simurgh.h"

using namespace std;
using pii = pair<int, int>;

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	
	vector<vector<int>> g(n, vector<int> (n));

	for(int i = 0 ; i < n ; i++)
	{
		int a = u[i], b = v[i];
		g[a][b] = g[b][a] = i;
	}

	int nextNod = 0;
	vector<int> vans, perm(n);

	for(int i = 0 ; i < n ; i++)
		perm[i] = i;

	function<void(int)> dfs = [&](int nod)
	{
		nextNod++;

		while(nextNod < perm.size() and g[nod][perm[nextNod]] != -1)
		{
			vans.push_back(g[nod][perm[nextNod]]);
			dfs(perm[nextNod]);
		}
	};

	do
	{
		vans.clear();
		nextNod = 0;
		dfs(perm[0]);
		if(count_common_roads(vans) == n - 1)
			return vans;

	} while(next_permutation(perm.begin(), perm.end()));
}

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

simurgh.cpp: In lambda function:
simurgh.cpp:27:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |   while(nextNod < perm.size() and g[nod][perm[nextNod]] != -1)
      |         ~~~~~~~~^~~~~~~~~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:9:42: warning: control reaches end of non-void function [-Wreturn-type]
    9 |  vector<vector<int>> g(n, vector<int> (n));
      |                                          ^

• Subtask 1: 0 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30