oj.uz

답안 #73307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73307 2018-08-28T07:04:08 Z mraron Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 365152 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=300;
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 volt[100010], voltind=0;

vector<pair<int,int>> rendez(vector<int>& miket) {
	/*for(auto i:miket) {
		cerr<<i<<" ";
	}cerr<<" RENDEZ\n";*/
	if(miket.size()==0) {
		return {};
	}
	if(miket.size()==1) {
		vector<pair<int,int>> cpy=best[miket[0]];
		for(auto& i:cpy) i.first++;
		return cpy;
	}
	
	vector<int> L, R;
	for(int i=0;i<(int)miket.size()/2;++i) {
		L.push_back(miket[i]);
	}
	
	for(int i=(int)miket.size()/2;i<(int)miket.size();++i) {
		R.push_back(miket[i]);
	}
	
	auto l=rendez(L), r=rendez(R);
	int i=0, j=0;
	
	voltind++;
	
	vector<pair<int,int>> ans;
	while((i<(int)l.size() || j<(int)r.size()) && (int)ans.size()<BLKSZ) {
		//cerr<<i<<" "<<j<<"\n";cerr.flush();
		while(i<(int)l.size() && volt[l[i].second]==voltind) i++;
		while(j<(int)r.size() && volt[r[j].second]==voltind) j++;
		
		if(i<(int)l.size() && (j==(int)r.size() || l[i].first>=r[j].first)) {
			ans.push_back(l[i++]);
			assert(volt[ans.back().second]!=voltind);
			volt[ans.back().second]=voltind;
		}else if(j<(int)r.size()) {
			ans.push_back(r[j++]);
			assert(volt[ans.back().second]!=voltind);
			volt[ans.back().second]=voltind;
		}
		//cerr<<i<<" "<<j<<"\n";cerr.flush();
	}
	/*
	for(auto i:ans) {
		cerr<<i.first<<" "<<i.second<<";";
	}cerr<<"!\n";
	*/
	
	return 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});
		//cerr<<akt.second<<"==========\n";
		best[akt.second]=rendez(badj[akt.second]);
		if((int)best[akt.second].size()<BLKSZ) {
			best[akt.second].push_back({0, akt.second});
		}
		
		/*lst.push_back({0, akt.second});
		for(auto i:badj[akt.second]) {
			for(auto j:best[i]) {
				lst.push_back({j.first+1, j.second});
			}
		}
		
		sort(lst.rbegin(), lst.rend());
	
		voltind++;
		for(int i=0, j=0;i<(int)lst.size()&&j<BLKSZ;++i) {
			if(volt[lst[i].second]!=voltind) {
				volt[lst[i].second]=voltind;
				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=1;i<=n;++i) {
		cerr<<i<<": ";
		for(auto j:best[i]) {
			cerr<<j.first<<" "<<j.second<<";";
		}cerr<<"\n";
	}*/
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7432 KB Output is correct
4 Correct 10 ms 7476 KB Output is correct
5 Correct 11 ms 8064 KB Output is correct
6 Correct 13 ms 8116 KB Output is correct
7 Correct 12 ms 8116 KB Output is correct
8 Correct 19 ms 10816 KB Output is correct
9 Correct 19 ms 10816 KB Output is correct
10 Correct 18 ms 10816 KB Output is correct
11 Correct 18 ms 10816 KB Output is correct
12 Correct 14 ms 10816 KB Output is correct
13 Correct 16 ms 10816 KB Output is correct
14 Correct 19 ms 10816 KB Output is correct
15 Correct 14 ms 10816 KB Output is correct
16 Correct 16 ms 10816 KB Output is correct
17 Correct 16 ms 10816 KB Output is correct
18 Correct 16 ms 10816 KB Output is correct
19 Correct 18 ms 10816 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7432 KB Output is correct
4 Correct 10 ms 7476 KB Output is correct
5 Correct 11 ms 8064 KB Output is correct
6 Correct 13 ms 8116 KB Output is correct
7 Correct 12 ms 8116 KB Output is correct
8 Correct 19 ms 10816 KB Output is correct
9 Correct 19 ms 10816 KB Output is correct
10 Correct 18 ms 10816 KB Output is correct
11 Correct 18 ms 10816 KB Output is correct
12 Correct 14 ms 10816 KB Output is correct
13 Correct 16 ms 10816 KB Output is correct
14 Correct 19 ms 10816 KB Output is correct
15 Correct 14 ms 10816 KB Output is correct
16 Correct 16 ms 10816 KB Output is correct
17 Correct 16 ms 10816 KB Output is correct
18 Correct 16 ms 10816 KB Output is correct
19 Correct 18 ms 10816 KB Output is correct
20 Correct 914 ms 13496 KB Output is correct
21 Correct 916 ms 13496 KB Output is correct
22 Correct 923 ms 13496 KB Output is correct
23 Correct 1008 ms 13496 KB Output is correct
24 Correct 1137 ms 252420 KB Output is correct
25 Correct 1224 ms 262816 KB Output is correct
26 Correct 1182 ms 262816 KB Output is correct
27 Correct 1130 ms 360908 KB Output is correct
28 Correct 1149 ms 361024 KB Output is correct
29 Correct 1144 ms 364800 KB Output is correct
30 Correct 1166 ms 364800 KB Output is correct
31 Correct 1303 ms 364800 KB Output is correct
32 Correct 1263 ms 364800 KB Output is correct
33 Correct 1033 ms 364800 KB Output is correct
34 Correct 987 ms 364800 KB Output is correct
35 Correct 1095 ms 364800 KB Output is correct
36 Correct 1233 ms 364800 KB Output is correct
37 Correct 1181 ms 364800 KB Output is correct
38 Correct 1157 ms 364800 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7416 KB Output is correct
3 Correct 8 ms 7432 KB Output is correct
4 Correct 10 ms 7476 KB Output is correct
5 Correct 11 ms 8064 KB Output is correct
6 Correct 13 ms 8116 KB Output is correct
7 Correct 12 ms 8116 KB Output is correct
8 Correct 19 ms 10816 KB Output is correct
9 Correct 19 ms 10816 KB Output is correct
10 Correct 18 ms 10816 KB Output is correct
11 Correct 18 ms 10816 KB Output is correct
12 Correct 14 ms 10816 KB Output is correct
13 Correct 16 ms 10816 KB Output is correct
14 Correct 19 ms 10816 KB Output is correct
15 Correct 14 ms 10816 KB Output is correct
16 Correct 16 ms 10816 KB Output is correct
17 Correct 16 ms 10816 KB Output is correct
18 Correct 16 ms 10816 KB Output is correct
19 Correct 18 ms 10816 KB Output is correct
20 Correct 914 ms 13496 KB Output is correct
21 Correct 916 ms 13496 KB Output is correct
22 Correct 923 ms 13496 KB Output is correct
23 Correct 1008 ms 13496 KB Output is correct
24 Correct 1137 ms 252420 KB Output is correct
25 Correct 1224 ms 262816 KB Output is correct
26 Correct 1182 ms 262816 KB Output is correct
27 Correct 1130 ms 360908 KB Output is correct
28 Correct 1149 ms 361024 KB Output is correct
29 Correct 1144 ms 364800 KB Output is correct
30 Correct 1166 ms 364800 KB Output is correct
31 Correct 1303 ms 364800 KB Output is correct
32 Correct 1263 ms 364800 KB Output is correct
33 Correct 1033 ms 364800 KB Output is correct
34 Correct 987 ms 364800 KB Output is correct
35 Correct 1095 ms 364800 KB Output is correct
36 Correct 1233 ms 364800 KB Output is correct
37 Correct 1181 ms 364800 KB Output is correct
38 Correct 1157 ms 364800 KB Output is correct
39 Correct 1351 ms 364800 KB Output is correct
40 Correct 1244 ms 364800 KB Output is correct
41 Correct 1259 ms 364800 KB Output is correct
42 Correct 1267 ms 364800 KB Output is correct
43 Correct 1239 ms 364800 KB Output is correct
44 Correct 971 ms 364800 KB Output is correct
45 Correct 949 ms 364800 KB Output is correct
46 Correct 942 ms 364800 KB Output is correct
47 Correct 925 ms 364800 KB Output is correct
48 Correct 908 ms 364800 KB Output is correct
49 Correct 1536 ms 364800 KB Output is correct
50 Correct 1470 ms 364800 KB Output is correct
51 Correct 962 ms 364800 KB Output is correct
52 Correct 947 ms 364800 KB Output is correct
53 Correct 1386 ms 364800 KB Output is correct
54 Correct 1283 ms 364800 KB Output is correct
55 Correct 1273 ms 364800 KB Output is correct
56 Correct 1279 ms 364800 KB Output is correct
57 Correct 962 ms 364800 KB Output is correct
58 Correct 948 ms 364800 KB Output is correct
59 Correct 899 ms 364800 KB Output is correct
60 Correct 827 ms 364800 KB Output is correct
61 Correct 1805 ms 365152 KB Output is correct
62 Correct 1598 ms 365152 KB Output is correct
63 Correct 1271 ms 365152 KB Output is correct
64 Execution timed out 2063 ms 365152 KB Time limit exceeded
65 Halted 0 ms 0 KB -