# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100989 | TAISA_ | Bitaro’s Party (JOI18_bitaro) | C++14 | 3 ms | 384 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>
#define all(vec) vec.begin(),vec.end()
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll MOD=1000000007LL;
const ll INF=(1<<30);
const ll LINF=(1LL<<60);
template<typename T> void chmax(T &a,T b){a=max(a,b);}
template<typename T> void chmin(T &a,T b){a=min(a,b);}
int main(){
int n,m,qu;cin>>n>>m>>qu;if(qu>1)return 0;
vector<vector<int>> G(n);
for(int i=0;i<m;i++){
int a,b;scanf("%d%d",&a,&b);--a;--b;
G[b].push_back(a);
}
int t,y;cin>>t>>y;--t;
vector<int> x(n);
for(int i=0;i<y;i++){
int c;scanf("%d",&c);--c;x[c]=1;
}
vector<int> d(n,-INF);
d[t]=0;
for(int i=t;i>=0;i--){
for(auto e:G[i]){
chmax(d[e],d[t]+1);
}
}
int ma=-1;
for(int i=0;i<n;i++){
if(x[i])continue;
chmax(ma,d[i]);
}
cout<<ma<<endl;
}
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... |