# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47756 | Just_Solve_The_Problem | Bitaro’s Party (JOI18_bitaro) | C++11 | 199 ms | 18172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random (rand() ^ (rand() << 15))
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
int n, m, q, t, y;
vector < int > gr[N];
vector < int > revgr[N];
int used[N], h[N], deg[N], u[N];
void dfs(int v) {
u[v] = 1;
for (int to : gr[v]) {
if (!u[to])
dfs(to);
h[v] = max(h[to] + 1, h[v]);
}
}
main() {
scanf("%d %d %d", &n, &m, &q);
if (q != 1) return 0;
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d %d", &u, &v);
gr[u].pb(v);
deg[v]++;
revgr[v].pb(u);
}
fill(h + 1, h + n + 1, -inf);
while (q--) {
scanf("%d %d", &t, &y);
for (int i = 1; i <= y; i++) {
int x;
scanf("%d", &x);
used[x] = 1;
}
}
h[t] = 0;
for (int i = 1; i <= n; i++) {
if (!deg[i]) dfs(i);
}
int mx = -1;
for (int i = 1; i <= n; i++) {
if (!used[i]) {
mx = max(mx, h[i]);
}
}
cout << mx << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |