| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 582120 | kamalsharmaa9 | Bitaro’s Party (JOI18_bitaro) | C++14 | 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.
//#pragma GCC target("popcnt")
//https://pastebin.com/jVURaNCJ
#include<bits/stdc++.h>
#include <cstdio>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define N 300002
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define w(x) int x; cin>>x; while(x--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
uniform_int_distribution<int> dist(1, (int) 2e9);
void c_p_c()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
int B;
bitset<101000>visited;
vector<int>gr[N];
vector<pii>dc[N];
void dfs(int node)
{
visited[node] = 1;
dc[node].pb({0, node});
sort(dc[node].begin(), dc[node].end(), greater<pii>());
while (dc[node].size() > B)
{
dc[node].pop_back();
}
for (auto child : gr[node])
{
for (int j = 0; j < dc[node].size(); j++)
{
dc[child].pb({dc[node][j].first + 1, dc[node][j].second});
}
}
}
int32_t main() {
c_p_c();
B = 120;
int n, m, q;
cin >> n >> m >> q;
for (int i = 1; i <= m; i++)
{
int a, b;
cin >> a >> b;
gr[a].pb(b);
}
for (int i = 1; i <= n; i++)
{
if (visited[i] == 0)
dfs(i);
}
while (q--)
{
int a, c;
cin >> a >> c;
map<int, int>v;
for (int i = 1; i <= c; i++)
{
int d;
cin >> d;
v[d]++;
}
if (c < B)
{
int maxi = 0;
for (int j = 0; j < dc[a].size(); j++)
{
if (v.find(dc[a][j].second) == v.end())
{
maxi = dc[a][j].first;
break;
}
}
cout << maxi << '\n';
}
else
{
vector<int>dp(n + 1, 0);
for (int i = 1; i <= n; i++)
{
//cout << i << endl;
if (v.find(i) != v.end() && dp[i] == 0)
{
continue;
}
for (auto child : gr[i])
{
indegree[child]++;
dp[child] = max(dp[child], dp[i] + 1);
}
}
if(v.find(a)!=v.end() && dp[a]==0)
cout <<-1<< '\n';
else
cout<<dp[a]<<'\n';
}
}
}