oj.uz

Submission #958914

# Submission time Handle Problem Language Result Execution time Memory
958914 2024-04-07T04:55:55 Z ono_de206 Povjerenstvo (COI22_povjerenstvo) C++14
33 / 100
 78 ms 79444 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7;
const long long inf = 1e18 + 10;
bool did[mxn];
set<int> g[mxn], d[mxn];

void go() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		int x, y;
		cin >> x >> y;
		g[x].in(y);
		d[y].in(x);
	}
	priority_queue<pair<int, int>> q;
	for(int i = 1; i <= n; i++) {
		q.emplace(-1 * (int)g[i].size(), i);
	}
	vector<int> ans;
	while(q.size()) {
		int sz, x;
		tie(sz, x) = q.top();
		q.pop();
		if(sz != -1 * (int)g[x].size() || did[x] == 1) continue;
		ans.pb(x);
		for(int y : g[x]) {
			did[y] = 1;
		}
		for(int y : d[x]) {
			if(did[y]) continue;
			did[y] = 1;
			for(int z : d[y]) {
				if(did[z]) continue;
				g[z].erase(y);
				q.emplace(-1 * (int)g[z].size(), z);
			}
		}
	}
	cout << ans.size() << endl << ans << endl;
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 78 ms 79444 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 77 ms 79440 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 19804 KB Output is correct
2 Correct 6 ms 19804 KB Output is correct
3 Correct 6 ms 19780 KB Output is correct
4 Correct 6 ms 19804 KB Output is correct
5 Correct 8 ms 19804 KB Output is correct
6 Correct 7 ms 19804 KB Output is correct
7 Correct 9 ms 19804 KB Output is correct
8 Correct 7 ms 19804 KB Output is correct
9 Correct 6 ms 19544 KB Output is correct
10 Correct 5 ms 19128 KB Output is correct
11 Correct 5 ms 19292 KB Output is correct
12 Correct 8 ms 19776 KB Output is correct
13 Correct 6 ms 19804 KB Output is correct
14 Correct 5 ms 19292 KB Output is correct
15 Correct 7 ms 19800 KB Output is correct
16 Correct 7 ms 19804 KB Output is correct
17 Correct 8 ms 19804 KB Output is correct
18 Correct 5 ms 19272 KB Output is correct
19 Correct 7 ms 19804 KB Output is correct

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Runtime error 78 ms 79444 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -