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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
/*
Tomasz Stepanko
PA2015 Runda2 
Zadanie B - Mistrzostwa
*/
#include <stdio.h>
#include <stack>
#include <algorithm>

struct roadNode{
	int targetId;
	roadNode* next;
	roadNode():targetId(-1),next(NULL)
	{
	}
};

int main()
{
	int n, m, d;
	scanf("%d %d %d", &n, &m, &d);
	roadNode** graph = new roadNode*[n];
	bool* visitedNodes = new bool[n];
	for(int i = 0; i < n; i++)
	{
		graph[i] = NULL;
		visitedNodes[i] = false;
	}
	for(int i = 0 ; i < m; i++)
	{
		int a, b;
		scanf("%d %d", &a, &b);
		roadNode** node = &graph[a-1];
		while(*node != NULL)
		{
			node = &(*node)->next;
		}
		*node = new roadNode();
		(*node)->targetId = b-1;
		
		node = &graph[b-1];
		while(*node != NULL)
		{
			node = &(*node)->next;
		}
		*node = new roadNode();
		(*node)->targetId = a-1;
		//printf("%d -> %d added\n", a-1, graph[a-1]->targetId);
		//printf("%d -> %d added\n", b-1, graph[b-1]->targetId);
	}
	
	/* DEBUG ONLY
	for(int i = 0; i < n; i++)
	{
		printf("%d -> ", i+1);
		roadNode* node = graph[i];
		while(node != NULL)
		{
			printf("%d ", node->targetId+1);
			node = node->next;
		}
		printf("\n");
	}
	*/
	
	//removing with degree less than d by marking them as visited
	for(int i = 0; i < n; i++)
	{
		int degree = 0;
		roadNode* node = graph[i];
		while(node != NULL)
		{
			degree++;
			node = node->next;
		}
		//printf("Node %d has degree %d.\n", i, degree);
		if(degree < d)
		{
			//printf("Node %d has to fewer neighbor... removing\n", i);
			visitedNodes[i] = true;
		}
	}
	
	/* DEBUG ONLY
	for(int i = 0; i < n; i++)
	{
		printf("%d -> ", i+1);
		if (visitedNodes[i])
		{
			printf("VISITED");
		}
		else
		{
			roadNode* node = graph[i];
			while(node != NULL)
			{
				printf("%d ", node->targetId+1);
				node = node->next;
			}
		}
		printf("\n");
	}*/
	
	int beginOfBiggestComponent = 0;
	int citiesCounterOfBiggestComponent = 0;
	int* result = NULL;
	for(int i = 0; i < n; i++)
	{
		if(!visitedNodes[i])
		{
			int beginOfComponent = i;
			int citiesCounter = 0;
			int* tmpResult = new int[n];
			std::stack<int> nodesStack;
			nodesStack.push(i);
			visitedNodes[i] = true;
			while(!nodesStack.empty())
			{
				int currentNode = nodesStack.top();
				nodesStack.pop();
				tmpResult[citiesCounter++] = currentNode+1;
				//printf("Processing %d\n", currentNode+1);
				roadNode* neighbor = graph[currentNode];
				//printf("Checking neighbor...\n");
				while(neighbor != NULL)
				{
					if(!visitedNodes[neighbor->targetId])
					{
						nodesStack.push(neighbor->targetId);
						visitedNodes[neighbor->targetId] = true;
					}
					/*else
					{
						printf("%d VISITED\n", neighbor->targetId + 1);
					}*/
					neighbor = neighbor->next;
				}
			}
			if(citiesCounter > citiesCounterOfBiggestComponent)
			{
				citiesCounterOfBiggestComponent = citiesCounter;
				beginOfBiggestComponent = beginOfComponent;
				delete result;
				result = tmpResult;
			}
		}
	}
	
	if(citiesCounterOfBiggestComponent > 1)
	{
		printf("%d\n", citiesCounterOfBiggestComponent);
		std::sort(result, result + citiesCounterOfBiggestComponent);
		for(int i = 0; i < citiesCounterOfBiggestComponent; i++)
		{
			printf("%d ", result[i]);
		}
	}
	else
	{
		printf("NIE\n");
	}
	
	return 0;
}