제출 #168232

#제출 시각아이디문제언어결과실행 시간메모리
168232Thuleanx무제 (POI11_imp)C++14
0 / 100
692 ms29552 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 3000;

int n, m;
bitset<N> adj[N];
bool in[N];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin>>n>>m;
	memset(in, 1, sizeof(in));
	for (int i = 0; i < m; i++) {
		int a, b; cin>>a>>b;
		adj[--a].set(--b);
		adj[b].set(a);
	}
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (i != j && adj[i][j] == 0 && in[i] && in[j])
				in[i] = in[j] = 0;
	stringstream ss;
	for (int i = 0, cnt = 0; i < n; i++) {
		if (in[i]) {
			ss << i << " ";
			if (++cnt == n/3)
				break;
		}
	}
	cout << ss.str() << endl;

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...