oj.uz

Submission #73014

# Submission time Handle Problem Language Result Execution time Memory
73014 2018-08-27T13:18:44 Z mraron Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 1948 ms 71112 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=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() {
	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();
		//cerr<<akt.first<<" "<<akt.second<<"\n";
		st.erase(st.begin());
		
		priority_queue<pair<int,int>> pq; //(dist, honnan)
		pq.push({0, akt.second});
		for(auto i:badj[akt.second]) {
			for(auto j:best[i]) {
				pq.push({-j.first-1, j.second});
			}
			
			while(pq.size()>BLKSZ) {
				pq.pop();
			}
		}
		
		while(!pq.empty()) {
			best[akt.second].push_back({-pq.top().first, pq.top().second});
			pq.pop();
		}
		
		reverse(best[akt.second].begin(), best[akt.second].end());
		
		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) {
			continue ;
		}else if(best[place].size()<BLKSZ) {
			cout<<"-1\n";
			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 10 ms 7288 KB Output is correct
2 Correct 11 ms 7412 KB Output is correct
3 Correct 6 ms 7520 KB Output is correct
4 Correct 11 ms 7652 KB Output is correct
5 Correct 22 ms 8044 KB Output is correct
6 Correct 18 ms 8044 KB Output is correct
7 Correct 19 ms 8044 KB Output is correct
8 Correct 18 ms 8140 KB Output is correct
9 Correct 18 ms 8140 KB Output is correct
10 Correct 18 ms 8268 KB Output is correct
11 Correct 19 ms 8268 KB Output is correct
12 Correct 19 ms 8268 KB Output is correct
13 Correct 20 ms 8268 KB Output is correct
14 Correct 20 ms 8268 KB Output is correct
15 Correct 18 ms 8268 KB Output is correct
16 Correct 18 ms 8268 KB Output is correct
17 Correct 22 ms 8268 KB Output is correct
18 Correct 21 ms 8268 KB Output is correct
19 Correct 22 ms 8268 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7288 KB Output is correct
2 Correct 11 ms 7412 KB Output is correct
3 Correct 6 ms 7520 KB Output is correct
4 Correct 11 ms 7652 KB Output is correct
5 Correct 22 ms 8044 KB Output is correct
6 Correct 18 ms 8044 KB Output is correct
7 Correct 19 ms 8044 KB Output is correct
8 Correct 18 ms 8140 KB Output is correct
9 Correct 18 ms 8140 KB Output is correct
10 Correct 18 ms 8268 KB Output is correct
11 Correct 19 ms 8268 KB Output is correct
12 Correct 19 ms 8268 KB Output is correct
13 Correct 20 ms 8268 KB Output is correct
14 Correct 20 ms 8268 KB Output is correct
15 Correct 18 ms 8268 KB Output is correct
16 Correct 18 ms 8268 KB Output is correct
17 Correct 22 ms 8268 KB Output is correct
18 Correct 21 ms 8268 KB Output is correct
19 Correct 22 ms 8268 KB Output is correct
20 Correct 656 ms 10376 KB Output is correct
21 Correct 662 ms 10376 KB Output is correct
22 Correct 674 ms 10484 KB Output is correct
23 Correct 650 ms 10484 KB Output is correct
24 Correct 1524 ms 55532 KB Output is correct
25 Correct 1500 ms 55544 KB Output is correct
26 Correct 1501 ms 55544 KB Output is correct
27 Correct 1191 ms 69896 KB Output is correct
28 Correct 1136 ms 69896 KB Output is correct
29 Correct 1329 ms 71112 KB Output is correct
30 Correct 1259 ms 71112 KB Output is correct
31 Correct 1621 ms 71112 KB Output is correct
32 Correct 1308 ms 71112 KB Output is correct
33 Correct 1163 ms 71112 KB Output is correct
34 Correct 1305 ms 71112 KB Output is correct
35 Correct 1250 ms 71112 KB Output is correct
36 Correct 1238 ms 71112 KB Output is correct
37 Correct 1623 ms 71112 KB Output is correct
38 Correct 1353 ms 71112 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7288 KB Output is correct
2 Correct 11 ms 7412 KB Output is correct
3 Correct 6 ms 7520 KB Output is correct
4 Correct 11 ms 7652 KB Output is correct
5 Correct 22 ms 8044 KB Output is correct
6 Correct 18 ms 8044 KB Output is correct
7 Correct 19 ms 8044 KB Output is correct
8 Correct 18 ms 8140 KB Output is correct
9 Correct 18 ms 8140 KB Output is correct
10 Correct 18 ms 8268 KB Output is correct
11 Correct 19 ms 8268 KB Output is correct
12 Correct 19 ms 8268 KB Output is correct
13 Correct 20 ms 8268 KB Output is correct
14 Correct 20 ms 8268 KB Output is correct
15 Correct 18 ms 8268 KB Output is correct
16 Correct 18 ms 8268 KB Output is correct
17 Correct 22 ms 8268 KB Output is correct
18 Correct 21 ms 8268 KB Output is correct
19 Correct 22 ms 8268 KB Output is correct
20 Correct 656 ms 10376 KB Output is correct
21 Correct 662 ms 10376 KB Output is correct
22 Correct 674 ms 10484 KB Output is correct
23 Correct 650 ms 10484 KB Output is correct
24 Correct 1524 ms 55532 KB Output is correct
25 Correct 1500 ms 55544 KB Output is correct
26 Correct 1501 ms 55544 KB Output is correct
27 Correct 1191 ms 69896 KB Output is correct
28 Correct 1136 ms 69896 KB Output is correct
29 Correct 1329 ms 71112 KB Output is correct
30 Correct 1259 ms 71112 KB Output is correct
31 Correct 1621 ms 71112 KB Output is correct
32 Correct 1308 ms 71112 KB Output is correct
33 Correct 1163 ms 71112 KB Output is correct
34 Correct 1305 ms 71112 KB Output is correct
35 Correct 1250 ms 71112 KB Output is correct
36 Correct 1238 ms 71112 KB Output is correct
37 Correct 1623 ms 71112 KB Output is correct
38 Correct 1353 ms 71112 KB Output is correct
39 Incorrect 1948 ms 71112 KB Output isn't correct
40 Halted 0 ms 0 KB -