提出 #486457

---

ソースコード 拡げる

#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <string>
#include <climits>
#include <utility>
             
#define REP(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define REG(i, a, b) for (int (i) = ((int)(a)); (i) < ((int)(b)); i++)
#define ALL(V) (V).begin(), (V).end()
#define PRINT(STR) cout << (STR) << endl
#define ROUNDED(N) fixed << setprecision(N)
#define SPACE " "
             
typedef long long ll;
using namespace std;
             
int nextInt() { int n; cin >> n; return n; }
double nextDouble() { double d; cin >> d; return d; }
string nextString() { string str; cin >> str; return str; }
             
int main() {
	int V = nextInt();
	int E = nextInt();
	int K = nextInt();
	bool movable[21][21];
	REP(i, 21) {
		fill(movable[i], movable[i] + 21, false);
	}
             
	REP(i, E) {
		int a = nextInt();
		int b = nextInt();
		movable[a][b] = true;
		movable[b][a] = true;
	}
     
   	
	vector<int> ans;
	REP(i, V) {
		bool m[21][21];
		REP(t, V) {
			REP(u, V) {
				m[t][u] = movable[t][u];
			}
		}
		int count = 0;
		ans.clear();
		REP(j, V) {
			if (!m[i][j]) {
				ans.push_back(j);
				count++;
				REP(t, V) {
					if (movable[j][t]) m[i][t] = true;
				}
			}
		}
		if (count == K) break;
	}
             
	REP(i, ans.size()) {
		cout << ans[i] << endl;
	}
	return 0;
}

提出情報

ジャッジ結果