oj.uz

Submission #100987

# Submission time Handle Problem Language Result Execution time Memory
100987 2019-03-16T00:50:16 Z TAISA_ Bitaro’s Party (JOI18_bitaro) C++14
7 / 100
 2000 ms 9208 KB 
#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;cin>>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;cin>>c;--c;x[c]=1;
	}
	priority_queue<P,vector<P>,greater<P>> q;
	vector<int> d(n,INF);
	q.push(P(0,t));
	d[t]=0;
	while(!q.empty()){
		int v=q.top().second;q.pop();
		for(auto e:G[v]){
			if(d[e]<=d[v]-1)continue;
			d[e]=d[v]-1;
			q.push(P(d[e],e));
		}
	}
	int ma=-1;
	for(int i=0;i<n;i++){
		if(x[i])continue;
		if(d[i]==INF)continue;
		chmax(ma,-d[i]);
	}
	cout<<ma<<endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 125 ms 3020 KB Output is correct
21 Correct 108 ms 3008 KB Output is correct
22 Correct 150 ms 3064 KB Output is correct
23 Correct 122 ms 3192 KB Output is correct
24 Correct 222 ms 8784 KB Output is correct
25 Correct 222 ms 8820 KB Output is correct
26 Correct 248 ms 8696 KB Output is correct
27 Execution timed out 2056 ms 9208 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 125 ms 3020 KB Output is correct
21 Correct 108 ms 3008 KB Output is correct
22 Correct 150 ms 3064 KB Output is correct
23 Correct 122 ms 3192 KB Output is correct
24 Correct 222 ms 8784 KB Output is correct
25 Correct 222 ms 8820 KB Output is correct
26 Correct 248 ms 8696 KB Output is correct
27 Execution timed out 2056 ms 9208 KB Time limit exceeded
28 Halted 0 ms 0 KB -