| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 560585 | colossal_pepe | Bitaro’s Party (JOI18_bitaro) | C++17 | 0 ms | 0 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1e9;
const int BLOCK_SZ = 450;
int n, m, q;
vector<vector<int>> g;
vector<vector<pair<int, int>>> d;
void precomp() {
for (int u = 0; u < n; u++) {
d[u] = {{0, u}};
for (int v : g[u]) {
for (auto [x, y] : d[v]) {
d.push_back({x + 1, y});
}
}
sort(d[u].begin(), d[u].end(), greater<>());
while (d[u].size() > BLOCK_SZ) d[u].pop_back();
}
}
int getAns(int t, bool is_busy[]) {
int i = 0;
while (i < d[t].size() and is_busy[d[t][i].second]) i++;
return (i < d[t].size() ? d[t][i].first : -1);
}
int comptueAns(int t, bool is_busy[]) {
int dp[t];
for (int u = 0; u <= t; u++) {
dp[u] = -INF;
for (int v : g[u]) {
dp[u] = max(dp[u], dpv[v] + 1);
}
if (not is_busy[u]) dp[u] = max(dp[u], 0);
}
return max(dp[u], -1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> q;
g.resize(n), d.resize(n);
while (m--) {
int u, v;
cin >> u >> v;
u--, v--;
g[v].push_back(u);
}
precomp();
vector<int> busy_ppl;
bool is_busy[n] = {0};
while (q--) {
int t, y;
cin >> t >> y;
t--;
busy_ppl.resize(y);
for (int &c : busy_ppl) {
cin >> c;
c--;
is_busy[c] = 1;
}
cout << (y < BLOCK_SZ ? getAns(t, is_busy) : comptueAns(t, is_busy)) << '\n';
for (int &c : busy_ppl) {
is_busy[c] = 0;
}
busy_ppl.clear();
}
return 0;
}