oj.uz

Submission #875841

# Submission time Handle Problem Language Result Execution time Memory
875841 2023-11-20T15:34:15 Z Mizo_Compiler Naboj (COCI22_naboj) C++17
0 / 110
 91 ms 16068 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 2e5+5;
int n, m, in[N];
vector<int> adj[N];
vector<pair<int, int>> ans;
int cnt = 0;

int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		--u, --v;
		adj[u].pb(v);
		in[v]++;
	}
	queue<int> q;
	for (int i = 0; i < n; i++) {
		if (!in[i])q.push(i);
	}
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		cnt++;
		for (auto &v : adj[u]) {
			if (--in[v] == 0)q.push(v);
		}
		if (adj[u].empty())ans.pb({u, 0});
		else ans.pb({u, 1});
	}
	if (cnt != n) {
		cout << -1;
		return 0;
	}
	cout << sz(ans) << "\n";
	for (auto &[x, y] : ans)cout << x+1 << " " << y << "\n";
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 5156 KB Output is correct
6 Correct 2 ms 5208 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Incorrect 1 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 91 ms 16068 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 5156 KB Output is correct
6 Correct 2 ms 5208 KB Output is correct
7 Correct 1 ms 4952 KB Output is correct
8 Incorrect 1 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -