Submission #864019

#	Time	Username	Problem	Language	Result	Execution time	Memory
864019		serifefedartar	Povjerenstvo (COI22_povjerenstvo)	C++17	0 / 100	113 ms	61400 KiB

Main

#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll LOGN = 20; 
const ll MAXN = 1e5 + 5;

vector<vector<int>> graph;
int color[MAXN];

int main() {
	fast
	memset(color, -1, sizeof(color));
	int N, M, a, b;
	cin >> N >> M;

	graph = vector<vector<int>>(N+1, vector<int>());
	for (int i = 0; i < M; i++) {
		cin >> a >> b;
		graph[a].push_back(b);
		graph[b].push_back(a);
	}

	queue<int> q;
	q.push(1);
	color[1] = 1;
	while (!q.empty()) {
		int node = q.front();
		q.pop();
		for (auto u : graph[node]) {
			if (color[u] != -1)
				continue;
			color[u] = !(color[node]);
			q.push(u);
		}
	}

	vector<int> ans;
	for (int i = 1; i <= N; i++) {
		if (color[i])
			ans.push_back(i);
	}

	cout << ans.size() << "\n";
	for (auto u : ans)
		cout << u << " ";
	cout << "\n";
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 21
• Subtask 3: 0 / 33
• Subtask 4: 0 / 33