oj.uz

답안 #43975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
43975 2018-03-29T02:24:25 Z wzy Bitaro’s Party (JOI18_bitaro) C++11
14 / 100
 2000 ms 418856 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
vector<pii> ans[100005];
vector<int> adj[100005];
const int bucket = 350;
int dg[100005];
bool sq[100005];
int dp[100005];
int n , m , qq , target;
int read(){
	char c;
	int a = 0;
	while(!(c>='0' && c<='9'))c = getchar();
	while( c>='0' && c <= '9') a = 10*a + (c - '0') , c = getchar();
	return a;
}


int solve(int i){
	if(i == target) return dp[i] = 0;
	if(dp[i] != -10000000 ) return dp[i];
	for(auto p : adj[i]){
		dp[i] = max(dp[i] , solve(p) + 1);
	}
	return dp[i];
}


int main(){
	n = read() , m = read() , qq = read();
	for(int i = 0 ; i < n; i ++ ) ans[i].pb(pii(0 , i)) , dg[i] = 0;
	for(int i = 0 ; i < m ; i++){
		int x = read() , y = read();
		adj[x-1].pb(y-1);
		dg[y-1]++;
	}
	queue<int> q;
	for(int i = 0 ; i < n; i++) if(dg[i] == 0) q.push(i);
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int p : adj[u]){
			dg[p]--;
			vector<pii> a  = ans[u], b = ans[p];
			ans[p].clear();
			int x = 0 , y = 0;
			for(int i = 0 ; i < a.size() + b.size() ; i++){
				if(x == a.size()){
					if(sq[b[y].S] == false)
					ans[p].push_back(pii(b[y].F  , b[y].S)) , sq[b[y].S] = true;
					y++;
				}
				else if(y == b.size()){
					if(sq[a[x].S] == false)
					ans[p].push_back(pii(a[x].F + 1 , a[x].S)) , sq[a[x].S] = true;
					x++;
				}
				else{
					if(a[x].F +1> b[y].F){
						if(sq[a[x].S] == false)
						ans[p].push_back(pii(a[x].F + 1 , a[x].S)) , sq[a[x].S] = true;
						x++;
					}
					else{
						if(sq[b[y].S] == false)
						ans[p].push_back(pii(b[y].F  , b[y].S)) , sq[b[y].S] = true;
						y++;
					}
				}
			}
			a.clear() , b.clear();
			while(ans[p].size() >= bucket)  sq[ans[p].back().S] = 0 , ans[p].pop_back();
			for(int i = 0 ; i < ans[p].size() ; i++) sq[ans[p][i].S] = false;
			if(dg[p] == 0) q.push(p);
		}
	}
	while(qq--){
		int t  = read() , y = read();
		t--;
		vector<int> w(y);
		for(int i = 0 ; i < y ; i ++){
			w[i] = read();
			sq[w[i] - 1] = 1;
		}
		int ansj = -1;
		
		if(y < 337){
			for(int j = 0 ; j < ans[t].size() ; j++){
				if(sq[ans[t][j].S]) continue;
				ansj = max(ansj , ans[t][j].F);
			}
			printf("%d\n" , ansj);
		}	
		else{
			for(int i = 0 ; i < n; i++) dp[i] = -10000000;
			target = t;
			for(int i = 0 ; i <= t ; i++){
				if(sq[i]) continue;
				solve(i);
			}
			for(int i = 0 ; i <= t ;i++){
				if(sq[i]) continue;
				ansj = max(dp[i] , ansj);
			}
			printf("%d\n" , ansj);
		}
		for(int i = 0 ; i < y ; i ++){
			sq[w[i] - 1] = 0;
		}
	}
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:51:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0 ; i < a.size() + b.size() ; i++){
                    ~~^~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:52:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(x == a.size()){
        ~~^~~~~~~~~~~
bitaro.cpp:57:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     else if(y == b.size()){
             ~~^~~~~~~~~~~
bitaro.cpp:77:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0 ; i < ans[p].size() ; i++) sq[ans[p][i].S] = false;
                    ~~^~~~~~~~~~~~~~~
bitaro.cpp:92:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j = 0 ; j < ans[t].size() ; j++){
                    ~~^~~~~~~~~~~~~~~
bitaro.cpp: In function 'int read()':
bitaro.cpp:17:8: warning: 'c' is used uninitialized in this function [-Wuninitialized]
  while(!(c>='0' && c<='9'))c = getchar();
        ^~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4988 KB Output is correct
2 Correct 6 ms 5104 KB Output is correct
3 Correct 7 ms 5184 KB Output is correct
4 Correct 6 ms 5184 KB Output is correct
5 Correct 10 ms 5844 KB Output is correct
6 Correct 9 ms 5844 KB Output is correct
7 Correct 9 ms 5844 KB Output is correct
8 Correct 19 ms 8992 KB Output is correct
9 Correct 20 ms 8992 KB Output is correct
10 Correct 19 ms 8992 KB Output is correct
11 Correct 17 ms 8992 KB Output is correct
12 Correct 12 ms 8992 KB Output is correct
13 Correct 17 ms 8992 KB Output is correct
14 Correct 17 ms 8992 KB Output is correct
15 Correct 11 ms 8992 KB Output is correct
16 Correct 16 ms 8992 KB Output is correct
17 Correct 14 ms 8992 KB Output is correct
18 Correct 12 ms 8992 KB Output is correct
19 Correct 15 ms 8992 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4988 KB Output is correct
2 Correct 6 ms 5104 KB Output is correct
3 Correct 7 ms 5184 KB Output is correct
4 Correct 6 ms 5184 KB Output is correct
5 Correct 10 ms 5844 KB Output is correct
6 Correct 9 ms 5844 KB Output is correct
7 Correct 9 ms 5844 KB Output is correct
8 Correct 19 ms 8992 KB Output is correct
9 Correct 20 ms 8992 KB Output is correct
10 Correct 19 ms 8992 KB Output is correct
11 Correct 17 ms 8992 KB Output is correct
12 Correct 12 ms 8992 KB Output is correct
13 Correct 17 ms 8992 KB Output is correct
14 Correct 17 ms 8992 KB Output is correct
15 Correct 11 ms 8992 KB Output is correct
16 Correct 16 ms 8992 KB Output is correct
17 Correct 14 ms 8992 KB Output is correct
18 Correct 12 ms 8992 KB Output is correct
19 Correct 15 ms 8992 KB Output is correct
20 Correct 815 ms 10216 KB Output is correct
21 Correct 782 ms 10356 KB Output is correct
22 Correct 781 ms 10356 KB Output is correct
23 Correct 958 ms 10356 KB Output is correct
24 Correct 1401 ms 272992 KB Output is correct
25 Correct 1461 ms 283140 KB Output is correct
26 Correct 1437 ms 283140 KB Output is correct
27 Correct 1785 ms 414784 KB Output is correct
28 Correct 1772 ms 417568 KB Output is correct
29 Correct 1815 ms 418416 KB Output is correct
30 Correct 1786 ms 418416 KB Output is correct
31 Correct 1957 ms 418416 KB Output is correct
32 Correct 1752 ms 418856 KB Output is correct
33 Correct 1259 ms 418856 KB Output is correct
34 Correct 1370 ms 418856 KB Output is correct
35 Correct 1225 ms 418856 KB Output is correct
36 Correct 1527 ms 418856 KB Output is correct
37 Correct 1690 ms 418856 KB Output is correct
38 Correct 1538 ms 418856 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4988 KB Output is correct
2 Correct 6 ms 5104 KB Output is correct
3 Correct 7 ms 5184 KB Output is correct
4 Correct 6 ms 5184 KB Output is correct
5 Correct 10 ms 5844 KB Output is correct
6 Correct 9 ms 5844 KB Output is correct
7 Correct 9 ms 5844 KB Output is correct
8 Correct 19 ms 8992 KB Output is correct
9 Correct 20 ms 8992 KB Output is correct
10 Correct 19 ms 8992 KB Output is correct
11 Correct 17 ms 8992 KB Output is correct
12 Correct 12 ms 8992 KB Output is correct
13 Correct 17 ms 8992 KB Output is correct
14 Correct 17 ms 8992 KB Output is correct
15 Correct 11 ms 8992 KB Output is correct
16 Correct 16 ms 8992 KB Output is correct
17 Correct 14 ms 8992 KB Output is correct
18 Correct 12 ms 8992 KB Output is correct
19 Correct 15 ms 8992 KB Output is correct
20 Correct 815 ms 10216 KB Output is correct
21 Correct 782 ms 10356 KB Output is correct
22 Correct 781 ms 10356 KB Output is correct
23 Correct 958 ms 10356 KB Output is correct
24 Correct 1401 ms 272992 KB Output is correct
25 Correct 1461 ms 283140 KB Output is correct
26 Correct 1437 ms 283140 KB Output is correct
27 Correct 1785 ms 414784 KB Output is correct
28 Correct 1772 ms 417568 KB Output is correct
29 Correct 1815 ms 418416 KB Output is correct
30 Correct 1786 ms 418416 KB Output is correct
31 Correct 1957 ms 418416 KB Output is correct
32 Correct 1752 ms 418856 KB Output is correct
33 Correct 1259 ms 418856 KB Output is correct
34 Correct 1370 ms 418856 KB Output is correct
35 Correct 1225 ms 418856 KB Output is correct
36 Correct 1527 ms 418856 KB Output is correct
37 Correct 1690 ms 418856 KB Output is correct
38 Correct 1538 ms 418856 KB Output is correct
39 Correct 1583 ms 418856 KB Output is correct
40 Correct 1475 ms 418856 KB Output is correct
41 Correct 1381 ms 418856 KB Output is correct
42 Execution timed out 2041 ms 418856 KB Time limit exceeded
43 Halted 0 ms 0 KB -