# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1129008 | gyg | Povjerenstvo (COI22_povjerenstvo) | C++20 | 1099 ms | 115680 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array
#define vec vector
#define pii pair<int, int>
#define fir first
#define sec second
const int N = 5e5 + 5;
int n, m;
arr<vec<int>, N> in, out;
arr<int, N> cnt;
arr<bool, N> dlt;
set<pii> ord;
void rmv(int u) {
ord.erase({cnt[u], u});
dlt[u] = true;
for (int v : in[u]) {
if (dlt[v]) continue;
ord.erase({cnt[v], v});
cnt[v]--;
ord.insert({cnt[v], v});
}
}
arr<int, N> cl;
void dfs(int u) {
for (int v : in[u]) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |