oj.uz

Submission #73025

# Submission time Handle Problem Language Result Execution time Memory
73025 2018-08-27T13:45:58 Z mraron Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 34012 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> adj[100001];
vector<int> badj[100001];
int indeg[100001];
const int BLKSZ=15;
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() {
	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]++;
	}
	
	set<pair<int,int>> st;
	for(int i=1;i<=n;++i) {
		st.insert({indeg[i], i});
	}
	
	while(!st.empty()) {
		pair<int,int> akt=*st.begin();
		st.erase(st.begin());
		
		//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());
		reverse(lst.begin(), lst.end());
		
		
		for(int i=0;i<(int)lst.size() && i<BLKSZ;++i) {
			best[akt.second].push_back(lst[i]);
		}
	
		for(auto i:adj[akt.second]) {
			auto it=st.lower_bound({indeg[i], i});
			auto val=*it;
			st.erase(it);
			
			val.first--;
			indeg[i]--;
			
			st.insert(val);
		}
	}

	
	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(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 7288 KB Output is correct
2 Correct 8 ms 7540 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct
4 Correct 10 ms 7540 KB Output is correct
5 Correct 16 ms 7632 KB Output is correct
6 Correct 15 ms 7812 KB Output is correct
7 Correct 15 ms 7812 KB Output is correct
8 Correct 11 ms 7812 KB Output is correct
9 Correct 13 ms 7812 KB Output is correct
10 Correct 14 ms 7812 KB Output is correct
11 Correct 14 ms 7812 KB Output is correct
12 Correct 16 ms 7812 KB Output is correct
13 Correct 13 ms 7812 KB Output is correct
14 Correct 14 ms 7840 KB Output is correct
15 Correct 18 ms 7840 KB Output is correct
16 Correct 15 ms 7840 KB Output is correct
17 Correct 15 ms 7840 KB Output is correct
18 Correct 16 ms 7840 KB Output is correct
19 Correct 15 ms 7912 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7288 KB Output is correct
2 Correct 8 ms 7540 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct
4 Correct 10 ms 7540 KB Output is correct
5 Correct 16 ms 7632 KB Output is correct
6 Correct 15 ms 7812 KB Output is correct
7 Correct 15 ms 7812 KB Output is correct
8 Correct 11 ms 7812 KB Output is correct
9 Correct 13 ms 7812 KB Output is correct
10 Correct 14 ms 7812 KB Output is correct
11 Correct 14 ms 7812 KB Output is correct
12 Correct 16 ms 7812 KB Output is correct
13 Correct 13 ms 7812 KB Output is correct
14 Correct 14 ms 7840 KB Output is correct
15 Correct 18 ms 7840 KB Output is correct
16 Correct 15 ms 7840 KB Output is correct
17 Correct 15 ms 7840 KB Output is correct
18 Correct 16 ms 7840 KB Output is correct
19 Correct 15 ms 7912 KB Output is correct
20 Correct 241 ms 10048 KB Output is correct
21 Correct 234 ms 10048 KB Output is correct
22 Correct 237 ms 10068 KB Output is correct
23 Correct 237 ms 10220 KB Output is correct
24 Correct 858 ms 26004 KB Output is correct
25 Correct 931 ms 26140 KB Output is correct
26 Correct 870 ms 26140 KB Output is correct
27 Correct 730 ms 29464 KB Output is correct
28 Correct 767 ms 29484 KB Output is correct
29 Correct 806 ms 33292 KB Output is correct
30 Correct 712 ms 33292 KB Output is correct
31 Correct 841 ms 33292 KB Output is correct
32 Correct 705 ms 33292 KB Output is correct
33 Correct 715 ms 33292 KB Output is correct
34 Correct 974 ms 33292 KB Output is correct
35 Correct 767 ms 33292 KB Output is correct
36 Correct 742 ms 33292 KB Output is correct
37 Correct 953 ms 33292 KB Output is correct
38 Correct 677 ms 33292 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7288 KB Output is correct
2 Correct 8 ms 7540 KB Output is correct
3 Correct 9 ms 7540 KB Output is correct
4 Correct 10 ms 7540 KB Output is correct
5 Correct 16 ms 7632 KB Output is correct
6 Correct 15 ms 7812 KB Output is correct
7 Correct 15 ms 7812 KB Output is correct
8 Correct 11 ms 7812 KB Output is correct
9 Correct 13 ms 7812 KB Output is correct
10 Correct 14 ms 7812 KB Output is correct
11 Correct 14 ms 7812 KB Output is correct
12 Correct 16 ms 7812 KB Output is correct
13 Correct 13 ms 7812 KB Output is correct
14 Correct 14 ms 7840 KB Output is correct
15 Correct 18 ms 7840 KB Output is correct
16 Correct 15 ms 7840 KB Output is correct
17 Correct 15 ms 7840 KB Output is correct
18 Correct 16 ms 7840 KB Output is correct
19 Correct 15 ms 7912 KB Output is correct
20 Correct 241 ms 10048 KB Output is correct
21 Correct 234 ms 10048 KB Output is correct
22 Correct 237 ms 10068 KB Output is correct
23 Correct 237 ms 10220 KB Output is correct
24 Correct 858 ms 26004 KB Output is correct
25 Correct 931 ms 26140 KB Output is correct
26 Correct 870 ms 26140 KB Output is correct
27 Correct 730 ms 29464 KB Output is correct
28 Correct 767 ms 29484 KB Output is correct
29 Correct 806 ms 33292 KB Output is correct
30 Correct 712 ms 33292 KB Output is correct
31 Correct 841 ms 33292 KB Output is correct
32 Correct 705 ms 33292 KB Output is correct
33 Correct 715 ms 33292 KB Output is correct
34 Correct 974 ms 33292 KB Output is correct
35 Correct 767 ms 33292 KB Output is correct
36 Correct 742 ms 33292 KB Output is correct
37 Correct 953 ms 33292 KB Output is correct
38 Correct 677 ms 33292 KB Output is correct
39 Correct 1219 ms 33292 KB Output is correct
40 Correct 890 ms 33292 KB Output is correct
41 Correct 847 ms 33292 KB Output is correct
42 Correct 901 ms 33292 KB Output is correct
43 Correct 845 ms 33292 KB Output is correct
44 Correct 495 ms 33292 KB Output is correct
45 Correct 280 ms 33292 KB Output is correct
46 Correct 259 ms 33292 KB Output is correct
47 Correct 225 ms 33292 KB Output is correct
48 Correct 235 ms 33292 KB Output is correct
49 Correct 1032 ms 33292 KB Output is correct
50 Execution timed out 2077 ms 34012 KB Time limit exceeded
51 Halted 0 ms 0 KB -