Submission #802021

#	Time	Username	Problem	Language	Result	Execution time	Memory
802021		tlnk07	Naboj (COCI22_naboj)	C++17	0 / 110	120 ms	12412 KiB

naboj

#include<bits/stdc++.h>
using namespace std;

long long n, m, x, y;
vector<int> vec[200001]; 
stack<int> sta;
bool check = 0, visited[200001];

void dfs(int x)
{
	visited[x] = true;
	for(int c : vec[x])
	{
		if(!visited[c])	dfs(c);
		else	check = true;
	}
	sta.push(x);
}

int main()
{
	cin >> n >> m;
	for(int i = 1; i <= m; ++i)
	{
		cin >> x >> y;
		vec[x].push_back(y);
		vec[y].push_back(x);
	}
	for(int i = 1; i <= n; ++i)
	{
		if(!visited[i])	
		{
			dfs(i);
			if(check)
			{
				cout << -1;
				return 0;
			}
		}
	}
	cout << sta.size() << "\n";
	while(!sta.empty())
	{
		cout << sta.top() << " 1\n";
		sta.pop();
	}
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 25
• Subtask 3: 0 / 70