# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
757498 | mgl_diamond | Bitaro’s Party (JOI18_bitaro) | C++14 | 2081 ms | 422460 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;
using ll = long long;
using ii = pair<int, int>;
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l; i>=(r); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define fi first
#define se second
const int N = 1e5+5;
const int INF = 1e9;
const int SIZE = 331;
int n, m, q;
bool allow[N], used[N], calc[N];
int p[N], block[N];
vector<ii> best[N];
vector<int> graph[N], adj[N];
bool comp(ii a, ii b) {
return a.se > b.se;
}
void dfs(int u) {
if (calc[u]) return;
calc[u] = 1;
for(int i=0; i<graph[u].size(); ++i) {
p[i] = 0;
dfs(graph[u][i]);
}
for(int r=0; r<SIZE; ++r) {
int cur = -1;
for(int i=0; i<graph[u].size(); ++i) {
int v = graph[u][i];
while (p[i] < best[v].size() && used[best[v][p[i]].fi]) ++p[i];
if (p[i] == best[v].size()) continue;
if (cur == -1 || comp(best[v][p[i]], best[graph[u][cur]][p[cur]])) cur = i;
}
if (cur == -1) break;
best[u].emplace_back(best[graph[u][cur]][p[cur]]);
used[best[graph[u][cur]][p[cur]].fi] = 1;
}
if (best[u].size() < SIZE) best[u].emplace_back(u, -1);
for(auto &v : best[u]) {
used[v.fi] = 0;
++v.se;
}
}
int dp[N];
void work2(int u) {
if (calc[u]) return;
calc[u] = 1;
for(int v : adj[u]) {
if (!calc[v]) work2(v);
if (dp[v] != -1) dp[u] = max(dp[u], dp[v] + 1);
}
}
void solve() {
cin >> n >> m >> q;
for(int i=0; i<m; ++i) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
graph[v].push_back(u);
}
for(int i=1; i<=n; ++i) {
allow[i] = 1;
dfs(i);
}
for(int t=0; t<q; ++t) {
int s, m;
cin >> s >> m;
for(int j=0; j<m; ++j) {
cin >> block[j];
allow[block[j]] = 0;
}
if (s < SIZE) {
bool found = 0;
for(auto cand : best[s]) if (allow[cand.fi]) {
cout << cand.se << "\n";
found = 1;
break;
}
if (!found) cout << "-1\n";
}
else {
for(int i=1; i<=n; ++i) {
calc[i] = 0;
dp[i] = -1;
}
dp[s] = 0;
calc[s] = 1;
int ans = -1;
for(int i=1; i<=n; ++i) if (allow[i]) {
work2(i);
ans = max(ans, dp[i]);
}
cout << ans << "\n";
}
for(int j=0; j<m; ++j) {
allow[block[j]] = 1;
}
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen("input.inp", "r")) {
freopen("input.inp", "r", stdin);
freopen("input.out", "w", stdout);
}
solve();
}
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... |