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
#include <cstdio>
#include <vector>
#include <queue>

#define MAX_N 200002

typedef std::vector<int> TNeighbourList;

int n, m, d;

//int remainingVertices;
int maxConnectedComponentId = -1;
int maxConnectedComponentSize = 0;

bool isInQueue[MAX_N];
bool isRemoved[MAX_N];
int remainingNeighboursCount[MAX_N];
TNeighbourList neighbours[MAX_N];
int connectedComponentId[MAX_N];

std::queue<int> queueToProcess;

void processNode(int node)
{
	//printf("processing %d\n", node);
	if (remainingNeighboursCount[node] < d)
	{
		//printf("removing %d\n", node);
		//remainingVertices--;
		isRemoved[node] = true;
		for (TNeighbourList::iterator it = neighbours[node].begin(); it != neighbours[node].end(); ++it)
		{
			if (!isRemoved[*it])
			{
				//printf("adding %d to q\n", *it);
				remainingNeighboursCount[*it]--;
				if (!isInQueue[*it])
				{
					queueToProcess.push(*it);
					isInQueue[*it] = true;
				}
			}
		}
	}
}

int checkConnectedComponent(int start)
{
	for (int i = 1; i <= n; ++i)
	{
		isInQueue[i] = false;
	}
	
	queueToProcess.push(start);
	isInQueue[start] = true;
	
	int thisComponentSize = 0;
	
	while (!queueToProcess.empty())
	{
		int node = queueToProcess.front();
		connectedComponentId[node] = start;
		thisComponentSize++;
		for (TNeighbourList::iterator it = neighbours[node].begin(); it != neighbours[node].end(); ++it)
		{
			if (!isRemoved[*it] && !isInQueue[*it])
			{
				queueToProcess.push(*it);
				isInQueue[*it] = true;
			}
		}
		queueToProcess.pop();
	}
	
	if (thisComponentSize > maxConnectedComponentSize)
	{
		maxConnectedComponentSize = thisComponentSize;
		maxConnectedComponentId = start;
	}
}

int main()
{
	scanf("%d%d%d", &n, &m, &d);
	
	//remainingVertices = n;
	
	for (int i = 0; i < m; ++i)
	{
		int from, to;
		scanf("%d%d", &from, &to);
		neighbours[from].push_back(to);
		remainingNeighboursCount[from]++;
		neighbours[to].push_back(from);
		remainingNeighboursCount[to]++;
	}
	
	for (int i = 1; i <= n; ++i)
	{
		if (!isRemoved[i])
		{
			//printf("inside for. adding %d to q\n", i);
			queueToProcess.push(i);
			isInQueue[i] = true;
		}
	}
	
	while (!queueToProcess.empty())
	{
		processNode(queueToProcess.front());
		isInQueue[queueToProcess.front()] = false;
		queueToProcess.pop();
	}
	
	//check connected components:
	for (int i = 1; i <= n; ++i)
	{
		if ((!isRemoved[i]) && (connectedComponentId[i] == 0))
		{
			checkConnectedComponent(i);
		}
	}
	
	if (maxConnectedComponentSize > 0)
	{
		printf("%d\n", maxConnectedComponentSize);
		for (int i = 1; i <= n; ++i)
		{
			if (connectedComponentId[i] == maxConnectedComponentId)
			{
				printf("%d ", i);
			}
		}
		printf("\n");
	}
	else
	{
		printf("NIE\n");
	}

	return 0;
}