1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
//Piotr Golda
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

#define UD unsigned int
#define LIMIT 200000

UD N, M, D;
vector<UD>  G[LIMIT];
UD Degree[LIMIT];
bool Processed[LIMIT];

class Vertex
{
public:
	UD m_nr;
	UD m_dgr; // vertex degree

	Vertex(UD p_nr, UD p_dgr)
		: m_nr(p_nr), m_dgr(p_dgr)
	{
	}
};

class Compare
{
public:
	bool operator()(const Vertex& p_lhs, const Vertex& p_rhs)
	{
		return p_lhs.m_dgr > p_rhs.m_dgr;
	}
};

priority_queue<Vertex, vector<Vertex>, Compare> Queue;




void scan()
{
	cin >> N >> M >> D;
	UD x, y;
	for (int i = 0; i < M; ++i)
	{
		cin >> x >> y;
		x--; y--;
		G[x].push_back(y);
		G[y].push_back(x);
	}
}

void initialProcess()
{
	for (int i = 0; i < N; ++i)
	{
		Processed[i] = false;
		Degree[i] = G[i].size();
		Queue.push(Vertex((UD)i, G[i].size()));
	}
}

void process()
{
	Vertex v = Queue.top();
	Queue.pop();
	while (v.m_dgr < D)
	{
		if (!Processed[v.m_nr])
		{
			Processed[v.m_nr] = true;
			for (int i = 0; i < G[v.m_nr].size(); ++i)
			{
				UD vn = G[v.m_nr][i]; // vertex neighboor
				if (!Processed[vn])
				{
					Degree[vn]--;
					Queue.push(Vertex(vn, Degree[vn]));
				}
			}
		}

		if (!Queue.empty())
			v = Queue.top();
		else
			break;
		Queue.pop();
	}
}

void bfs(UD p_i, vector<UD>& V)
{
	Processed[p_i] = true;
	V.push_back(p_i);
	for (UD i = 0; i < G[p_i].size(); ++i)
	{
		if (!Processed[G[p_i][i]])
			bfs(G[p_i][i], V);
	}
}

vector<UD> findAns()
{
	vector < UD >  answer;
	for (UD i = 0; i < N; ++i)
	{
		if (!Processed[i])
		{
			vector<UD> V;
			bfs(i, V);
			if (V.size()>answer.size())
				answer = V;
		}
	}
	return answer;
}

void printAns()
{
	vector<UD> ans = findAns();
	if (ans.size() > 0)
	{
		cout << ans.size() << endl;
		sort(ans.begin(), ans.end());
		for (UD i = 0; i < ans.size(); ++i)
		{
				cout << ans[i] + 1 << ' ';
		}
	}
	else
	{
		cout << "NIE";
	}
	cout << endl;
}


int main()
{
	ios_base::sync_with_stdio(0);
	scan();
	initialProcess();
	process();
	printAns();

	return 0;
}