# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200810 | ekrem | Bitaro’s Party (JOI18_bitaro) | C++98 | 14 ms | 12024 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 optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,vis[li],hedef;
int cev;
string s;
vector<int> v[li];
inline void dfs(int node,int der){
//~ cout<<node<<" : : "<<vis[node]<<endl;
if(vis[node]==2)return ;
vis[node]=2;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
dfs(go,der+1);
}
if(node==hedef)cev=max(cev,der);
}
int main(void){
scanf("%d %d %d",&n,&m,&t);
for(int i=1;i<=m;i++){
int x,y;
scanf("%d %d",&x,&y);
v[x].pb(y);
}
while(t--){
cev=0;
scanf("%d",&hedef);
scanf("%d",&k);
FOR vis[i]=0;
for(int i=1;i<=k;i++){
int x;
scanf("%d",&x);
vis[x]=1;
}
FOR{
if(vis[i]==0){dfs(i,0);break;}
}
printf("%d\n",cev);
}
return 0;
}
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... |