oj.uz

Submission #73076

# Submission time Handle Problem Language Result Execution time Memory
73076 2018-08-27T15:07:34 Z mraron Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 71568 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> adj[100001];
vector<int> badj[100001];
int indeg[100001];
int BLKSZ=50;
vector<pair<int,int>> best[100001];
int dp[100010];
int bannolt[100010];

int dfs(int x) {
	if(dp[x]!=-2) {
		return dp[x];
	}
	
	int ans=-1;
	if(!bannolt[x]) {
		ans=0;
	}
	
	for(auto i:badj[x]) {
		if(dfs(i)>=0) {
			ans=max(ans, dfs(i)+1);
		}
	}
	
//	cerr<<x<<"->"<<ans<<" | "<<bannolt[x]<<"\n";
	
	return dp[x]=ans;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m,q;
	cin>>n>>m>>q;
	for(int i=0;i<m;++i) {
		int a,b;
		cin>>a>>b;
		adj[a].pb(b);
		badj[b].pb(a);
		indeg[b]++;
	}
	
	vector<pair<int,int>> st;
	for(int i=1;i<=n;++i) {
		if(indeg[i]==0) st.push_back({indeg[i], i});
	}
			
		

	while(!st.empty()) {
		pair<int,int> akt=st.back();
		st.pop_back();
		
		//priority_queue<pair<int,int>> pq; //(dist, honnan)
		//pq.push({0, akt.second});
		map<int,int> mx;
		mx[akt.second]=0;
		for(auto i:badj[akt.second]) {
			for(auto j:best[i]) {
				mx[j.second]=max(mx[j.second], j.first+1);
			}
		}
		
		vector<pair<int,int>> lst;
		for(auto i:mx) {
			lst.push_back({i.second, i.first});
		}
		
		sort(lst.begin(), lst.end());		
		
		for(int i=(int)lst.size()-1, j=0;i>=0 && j<BLKSZ;--i, j++) {
			best[akt.second].push_back(lst[i]);
		}
	
		for(auto i:adj[akt.second]) {
			indeg[i]--;
	
			if(indeg[i]==0) st.pb({indeg[i], i});
		}
	}
	
	
	for(int i=0;i<q;++i) {
		int place;
		int cnt;
		cin>>place>>cnt;
		vector<int> banned(cnt);
		
		for(int i=0;i<cnt;++i) {
			cin>>banned[i];
			bannolt[banned[i]]=1;
		}
		
		bool ok=false;
		for(int j=0;j<(int)best[place].size();++j) {
			if(!bannolt[best[place][j].second]) {
				ok=true;
				cout<<best[place][j].first<<"\n";
				break ;
			}
		}
		
		if(ok) {
			for(int i=0;i<cnt;++i) {
				bannolt[banned[i]]=0;
			}
			continue ;
		}else if((int)best[place].size()<BLKSZ) {
			cout<<"-1\n";
			for(int i=0;i<cnt;++i) {
				bannolt[banned[i]]=0;
			}
			continue ;
		}
		
		for(int i=1;i<=place;++i) {
			dp[i]=-2;
		}
		

		cout<<dfs(place)<<"\n";
		
		for(int i=0;i<cnt;++i) {
			bannolt[banned[i]]=0;
		}
		
	}
	
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7420 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 9 ms 7540 KB Output is correct
5 Correct 20 ms 8052 KB Output is correct
6 Correct 19 ms 8052 KB Output is correct
7 Correct 19 ms 8128 KB Output is correct
8 Correct 18 ms 8156 KB Output is correct
9 Correct 15 ms 8156 KB Output is correct
10 Correct 19 ms 8156 KB Output is correct
11 Correct 19 ms 8156 KB Output is correct
12 Correct 21 ms 8156 KB Output is correct
13 Correct 19 ms 8172 KB Output is correct
14 Correct 19 ms 8172 KB Output is correct
15 Correct 21 ms 8172 KB Output is correct
16 Correct 18 ms 8172 KB Output is correct
17 Correct 19 ms 8172 KB Output is correct
18 Correct 20 ms 8172 KB Output is correct
19 Correct 18 ms 8172 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7420 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 9 ms 7540 KB Output is correct
5 Correct 20 ms 8052 KB Output is correct
6 Correct 19 ms 8052 KB Output is correct
7 Correct 19 ms 8128 KB Output is correct
8 Correct 18 ms 8156 KB Output is correct
9 Correct 15 ms 8156 KB Output is correct
10 Correct 19 ms 8156 KB Output is correct
11 Correct 19 ms 8156 KB Output is correct
12 Correct 21 ms 8156 KB Output is correct
13 Correct 19 ms 8172 KB Output is correct
14 Correct 19 ms 8172 KB Output is correct
15 Correct 21 ms 8172 KB Output is correct
16 Correct 18 ms 8172 KB Output is correct
17 Correct 19 ms 8172 KB Output is correct
18 Correct 20 ms 8172 KB Output is correct
19 Correct 18 ms 8172 KB Output is correct
20 Correct 245 ms 10420 KB Output is correct
21 Correct 241 ms 10420 KB Output is correct
22 Correct 243 ms 10552 KB Output is correct
23 Correct 259 ms 10552 KB Output is correct
24 Correct 1636 ms 55256 KB Output is correct
25 Correct 1726 ms 55420 KB Output is correct
26 Correct 1753 ms 55420 KB Output is correct
27 Correct 1020 ms 66892 KB Output is correct
28 Correct 1034 ms 66892 KB Output is correct
29 Correct 988 ms 70900 KB Output is correct
30 Correct 1008 ms 70900 KB Output is correct
31 Correct 1558 ms 70900 KB Output is correct
32 Correct 978 ms 70900 KB Output is correct
33 Correct 965 ms 70900 KB Output is correct
34 Correct 1601 ms 70900 KB Output is correct
35 Correct 957 ms 70900 KB Output is correct
36 Correct 978 ms 70900 KB Output is correct
37 Correct 1713 ms 70900 KB Output is correct
38 Correct 1014 ms 70900 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 9 ms 7420 KB Output is correct
3 Correct 8 ms 7496 KB Output is correct
4 Correct 9 ms 7540 KB Output is correct
5 Correct 20 ms 8052 KB Output is correct
6 Correct 19 ms 8052 KB Output is correct
7 Correct 19 ms 8128 KB Output is correct
8 Correct 18 ms 8156 KB Output is correct
9 Correct 15 ms 8156 KB Output is correct
10 Correct 19 ms 8156 KB Output is correct
11 Correct 19 ms 8156 KB Output is correct
12 Correct 21 ms 8156 KB Output is correct
13 Correct 19 ms 8172 KB Output is correct
14 Correct 19 ms 8172 KB Output is correct
15 Correct 21 ms 8172 KB Output is correct
16 Correct 18 ms 8172 KB Output is correct
17 Correct 19 ms 8172 KB Output is correct
18 Correct 20 ms 8172 KB Output is correct
19 Correct 18 ms 8172 KB Output is correct
20 Correct 245 ms 10420 KB Output is correct
21 Correct 241 ms 10420 KB Output is correct
22 Correct 243 ms 10552 KB Output is correct
23 Correct 259 ms 10552 KB Output is correct
24 Correct 1636 ms 55256 KB Output is correct
25 Correct 1726 ms 55420 KB Output is correct
26 Correct 1753 ms 55420 KB Output is correct
27 Correct 1020 ms 66892 KB Output is correct
28 Correct 1034 ms 66892 KB Output is correct
29 Correct 988 ms 70900 KB Output is correct
30 Correct 1008 ms 70900 KB Output is correct
31 Correct 1558 ms 70900 KB Output is correct
32 Correct 978 ms 70900 KB Output is correct
33 Correct 965 ms 70900 KB Output is correct
34 Correct 1601 ms 70900 KB Output is correct
35 Correct 957 ms 70900 KB Output is correct
36 Correct 978 ms 70900 KB Output is correct
37 Correct 1713 ms 70900 KB Output is correct
38 Correct 1014 ms 70900 KB Output is correct
39 Correct 1781 ms 70900 KB Output is correct
40 Correct 1569 ms 70900 KB Output is correct
41 Correct 1493 ms 70900 KB Output is correct
42 Correct 1638 ms 70900 KB Output is correct
43 Correct 1540 ms 70900 KB Output is correct
44 Correct 286 ms 70900 KB Output is correct
45 Correct 258 ms 70900 KB Output is correct
46 Correct 257 ms 70900 KB Output is correct
47 Correct 253 ms 70900 KB Output is correct
48 Correct 250 ms 70900 KB Output is correct
49 Correct 1155 ms 70900 KB Output is correct
50 Execution timed out 2033 ms 71568 KB Time limit exceeded
51 Halted 0 ms 0 KB -