Submission #875281

#	Time	Username	Problem	Language	Result	Execution time	Memory
875281		Cyber_Wolf	Naboj (COCI22_naboj)	C++17	0 / 110	85 ms	18656 KiB

naboj

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

using namespace std;

#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const lg N = 2e5+5;

vector<lg> adj[N];
lg in[N], state[N];

int main()
{
	fastio;
	lg n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++)
	{
		lg u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		in[v]++;
	}
	queue<lg> q;
	lg z = 0;
	for(int i = 1; i <= n; i++)
	{
		if(in[i])	continue;
		z++;
		q.push(i);
	}
	cout << n << '\n';
	vector<lg> a;
	while(q.size())
	{
		lg u = q.front();
		q.pop();
		lg x = 0;
		for(auto it : adj[u])
		{
			a.push_back(u*2+1);
			x++;
			in[it]--;
			if(!in[it])	
			{
				q.push(it);
				z++;
			}
		}
		if(adj[u].empty())
		{
			a.push_back(u*2);
		}
	}
	if(z < n)
	{
		cout << "-1\n";
		return 0;
	}
	reverse(a.begin(), a.end());
	for(auto it : a)	cout << it/2 << ' ' << it%2 << '\n';
    return 0;
}

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