# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707414 | EthanKim8683 | Bitaro’s Party (JOI18_bitaro) | C++17 | 2009 ms | 66040 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 I=int;
const I N=100000;
const I MIN=-1e9;
vector<I>adjs1[N],adjs2[N];
set<I>viss;
vector<pair<I,I>>pres[N],tops[N];
set<I>curs;
I diss[N];
I tims[N];
I tim=1;
I dfs(I a){
if(tims[a]==tim)return diss[a];
tims[a]=tim,diss[a]=curs.count(a)?MIN:0;
for(auto b:adjs2[a])if(dfs(b)!=MIN)diss[a]=max(diss[a],diss[b]+1);
return diss[a];
}
I main(){
cin.tie(0)->sync_with_stdio(0);
I n,m,q;cin>>n>>m>>q;
for(I i=0;i<m;i++){
I s,e;cin>>s>>e,s--,e--;
adjs1[s].push_back(e),adjs2[e].push_back(s);
}
I siz=sqrt(n/log2(n))/7;
for(I i=0;i<n;i++){
pres[i].push_back({0,i});
sort(pres[i].begin(),pres[i].end());
viss.clear();
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... |