oj.uz

Submission #93608

# Submission time Handle Problem Language Result Execution time Memory
93608 2019-01-10T02:26:17 Z silxikys Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1615 ms 169216 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 1e5+5, INF = 987654321;
int N, M, Q;
vector<int> ancestors[maxn];
int SZ;
list<pair<int,int>> bests[maxn];
auto cmp = [](const pair<int,int>& a, const pair<int,int>& b) { return a.first > b.first; };

bool used[maxn], isBusy[maxn];
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> M >> Q;
    for (int i = 0; i < M; i++) {
    	int s, e; cin >> s >> e;
    	ancestors[e].push_back(s);
    }
    SZ = 50; //each node will store at least the top SZ nodes
    //small queries are <= SZ - 1
    for (int i = 1; i <= N; i++) {
    	list<pair<int,int>>& li = bests[i];
    	li.push_back({0,i});
    	for (int j: ancestors[i]) {
    		list<pair<int,int>> add;
    		for (auto p: bests[j]) {
    			add.push_back({p.first+1,p.second});
    			if ((int)add.size() >= SZ) break;
    		}
    		li.merge(add,cmp);
    		li.unique();
    		for (auto it = li.begin(); it != li.end();) {
	    		if (used[it->second]) it = li.erase(it);
	    		else { used[it->second] = true;	++it; }
	    	}
	    	for (auto& p: li) used[p.second] = false; //reset for next one
	    	while ((int)li.size() > SZ) li.pop_back();
    	}
    	
    	
    	/*
    	cout << i << ": \n";
    	for (auto p: li) {
    		cout << p.first << ' ' << p.second << '\n';
    	}
    	cout << '\n';
    	*/
    }

	while (Q--) {
		int town, num; cin >> town >> num;
		vector<int> busy(num);
		for (int i = 0; i < num; i++) {
			cin >> busy[i];
			isBusy[busy[i]] = true;
		}
		if (num <= SZ - 1) {
			//answer will be in first SZ answers, if it exists
			bool found = false;
			for (auto& p: bests[town]) {
				if (!isBusy[p.second]) {
					found = true;
					cout << p.first << '\n';
					break;
				}
			}
			if (!found) {
				cout << -1 << '\n';
			}
		}
		else {
			//do normal O(N) DP
			//this only happens about sqrt(N) times
			vector<int> dp(N+1,-INF);
			for (int i = 1; i <= town; i++) {
				if (!isBusy[i]) dp[i] = 0;
				for (int j: ancestors[i]) {
					dp[i] = max(dp[i],dp[j]+1);
				}
			}
			int ans = dp[town] >= 0 ? dp[town] : -1;
			cout << ans << '\n';
		}
		//reset isBusy[] for next query
		for (int i: busy) isBusy[i] = false;
	}
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 5 ms 5116 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 9 ms 6008 KB Output is correct
6 Correct 10 ms 6008 KB Output is correct
7 Correct 9 ms 6008 KB Output is correct
8 Correct 11 ms 6648 KB Output is correct
9 Correct 11 ms 6648 KB Output is correct
10 Correct 11 ms 6648 KB Output is correct
11 Correct 10 ms 6520 KB Output is correct
12 Correct 9 ms 6264 KB Output is correct
13 Correct 10 ms 6520 KB Output is correct
14 Correct 9 ms 5980 KB Output is correct
15 Correct 8 ms 5752 KB Output is correct
16 Correct 9 ms 6008 KB Output is correct
17 Correct 10 ms 6264 KB Output is correct
18 Correct 9 ms 6008 KB Output is correct
19 Correct 9 ms 6264 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 5 ms 5116 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 9 ms 6008 KB Output is correct
6 Correct 10 ms 6008 KB Output is correct
7 Correct 9 ms 6008 KB Output is correct
8 Correct 11 ms 6648 KB Output is correct
9 Correct 11 ms 6648 KB Output is correct
10 Correct 11 ms 6648 KB Output is correct
11 Correct 10 ms 6520 KB Output is correct
12 Correct 9 ms 6264 KB Output is correct
13 Correct 10 ms 6520 KB Output is correct
14 Correct 9 ms 5980 KB Output is correct
15 Correct 8 ms 5752 KB Output is correct
16 Correct 9 ms 6008 KB Output is correct
17 Correct 10 ms 6264 KB Output is correct
18 Correct 9 ms 6008 KB Output is correct
19 Correct 9 ms 6264 KB Output is correct
20 Correct 453 ms 7752 KB Output is correct
21 Correct 440 ms 7544 KB Output is correct
22 Correct 448 ms 7676 KB Output is correct
23 Correct 450 ms 7672 KB Output is correct
24 Correct 999 ms 131564 KB Output is correct
25 Correct 908 ms 132308 KB Output is correct
26 Correct 907 ms 132220 KB Output is correct
27 Correct 779 ms 165636 KB Output is correct
28 Correct 816 ms 165624 KB Output is correct
29 Correct 757 ms 168056 KB Output is correct
30 Correct 738 ms 168336 KB Output is correct
31 Correct 779 ms 166008 KB Output is correct
32 Correct 722 ms 168104 KB Output is correct
33 Correct 498 ms 111736 KB Output is correct
34 Correct 929 ms 103032 KB Output is correct
35 Correct 494 ms 111176 KB Output is correct
36 Correct 730 ms 138912 KB Output is correct
37 Correct 806 ms 133240 KB Output is correct
38 Correct 678 ms 139128 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 5 ms 5116 KB Output is correct
4 Correct 5 ms 5112 KB Output is correct
5 Correct 9 ms 6008 KB Output is correct
6 Correct 10 ms 6008 KB Output is correct
7 Correct 9 ms 6008 KB Output is correct
8 Correct 11 ms 6648 KB Output is correct
9 Correct 11 ms 6648 KB Output is correct
10 Correct 11 ms 6648 KB Output is correct
11 Correct 10 ms 6520 KB Output is correct
12 Correct 9 ms 6264 KB Output is correct
13 Correct 10 ms 6520 KB Output is correct
14 Correct 9 ms 5980 KB Output is correct
15 Correct 8 ms 5752 KB Output is correct
16 Correct 9 ms 6008 KB Output is correct
17 Correct 10 ms 6264 KB Output is correct
18 Correct 9 ms 6008 KB Output is correct
19 Correct 9 ms 6264 KB Output is correct
20 Correct 453 ms 7752 KB Output is correct
21 Correct 440 ms 7544 KB Output is correct
22 Correct 448 ms 7676 KB Output is correct
23 Correct 450 ms 7672 KB Output is correct
24 Correct 999 ms 131564 KB Output is correct
25 Correct 908 ms 132308 KB Output is correct
26 Correct 907 ms 132220 KB Output is correct
27 Correct 779 ms 165636 KB Output is correct
28 Correct 816 ms 165624 KB Output is correct
29 Correct 757 ms 168056 KB Output is correct
30 Correct 738 ms 168336 KB Output is correct
31 Correct 779 ms 166008 KB Output is correct
32 Correct 722 ms 168104 KB Output is correct
33 Correct 498 ms 111736 KB Output is correct
34 Correct 929 ms 103032 KB Output is correct
35 Correct 494 ms 111176 KB Output is correct
36 Correct 730 ms 138912 KB Output is correct
37 Correct 806 ms 133240 KB Output is correct
38 Correct 678 ms 139128 KB Output is correct
39 Correct 900 ms 134796 KB Output is correct
40 Correct 838 ms 134424 KB Output is correct
41 Correct 1548 ms 135396 KB Output is correct
42 Correct 959 ms 135272 KB Output is correct
43 Correct 899 ms 134244 KB Output is correct
44 Correct 479 ms 10488 KB Output is correct
45 Correct 447 ms 9696 KB Output is correct
46 Correct 531 ms 9708 KB Output is correct
47 Correct 517 ms 9340 KB Output is correct
48 Correct 441 ms 9096 KB Output is correct
49 Correct 794 ms 168696 KB Output is correct
50 Correct 1394 ms 168036 KB Output is correct
51 Correct 464 ms 10324 KB Output is correct
52 Correct 553 ms 9648 KB Output is correct
53 Correct 726 ms 139000 KB Output is correct
54 Correct 722 ms 133752 KB Output is correct
55 Correct 1192 ms 138208 KB Output is correct
56 Correct 1314 ms 133540 KB Output is correct
57 Correct 477 ms 10488 KB Output is correct
58 Correct 484 ms 10488 KB Output is correct
59 Correct 573 ms 9568 KB Output is correct
60 Correct 563 ms 9580 KB Output is correct
61 Correct 867 ms 168032 KB Output is correct
62 Correct 710 ms 138836 KB Output is correct
63 Correct 821 ms 132712 KB Output is correct
64 Correct 942 ms 168036 KB Output is correct
65 Correct 865 ms 138552 KB Output is correct
66 Correct 818 ms 133476 KB Output is correct
67 Correct 986 ms 167908 KB Output is correct
68 Correct 892 ms 138864 KB Output is correct
69 Correct 1185 ms 132184 KB Output is correct
70 Correct 882 ms 168080 KB Output is correct
71 Correct 700 ms 138828 KB Output is correct
72 Correct 695 ms 132960 KB Output is correct
73 Correct 849 ms 168152 KB Output is correct
74 Correct 623 ms 138876 KB Output is correct
75 Correct 663 ms 132936 KB Output is correct
76 Correct 889 ms 169216 KB Output is correct
77 Correct 1247 ms 168276 KB Output is correct
78 Correct 833 ms 168420 KB Output is correct
79 Correct 466 ms 10484 KB Output is correct
80 Correct 505 ms 9592 KB Output is correct
81 Correct 434 ms 9252 KB Output is correct
82 Correct 794 ms 169100 KB Output is correct
83 Correct 795 ms 166940 KB Output is correct
84 Correct 1329 ms 168372 KB Output is correct
85 Correct 1401 ms 166164 KB Output is correct
86 Correct 935 ms 168288 KB Output is correct
87 Correct 869 ms 166300 KB Output is correct
88 Correct 480 ms 10744 KB Output is correct
89 Correct 469 ms 10488 KB Output is correct
90 Correct 506 ms 9692 KB Output is correct
91 Correct 509 ms 9564 KB Output is correct
92 Correct 437 ms 9208 KB Output is correct
93 Correct 438 ms 9336 KB Output is correct
94 Correct 587 ms 112632 KB Output is correct
95 Correct 598 ms 103672 KB Output is correct
96 Correct 1024 ms 111608 KB Output is correct
97 Correct 905 ms 104292 KB Output is correct
98 Correct 527 ms 112352 KB Output is correct
99 Correct 532 ms 103540 KB Output is correct
100 Correct 545 ms 10684 KB Output is correct
101 Correct 473 ms 10616 KB Output is correct
102 Correct 501 ms 9592 KB Output is correct
103 Correct 500 ms 9720 KB Output is correct
104 Correct 445 ms 9208 KB Output is correct
105 Correct 448 ms 9484 KB Output is correct
106 Correct 629 ms 139536 KB Output is correct
107 Correct 708 ms 134224 KB Output is correct
108 Correct 1337 ms 139428 KB Output is correct
109 Correct 1241 ms 133092 KB Output is correct
110 Correct 752 ms 139688 KB Output is correct
111 Correct 716 ms 133860 KB Output is correct
112 Correct 472 ms 10616 KB Output is correct
113 Correct 470 ms 10616 KB Output is correct
114 Correct 532 ms 9596 KB Output is correct
115 Correct 507 ms 9592 KB Output is correct
116 Correct 441 ms 9280 KB Output is correct
117 Correct 431 ms 9212 KB Output is correct
118 Correct 817 ms 167524 KB Output is correct
119 Correct 644 ms 138528 KB Output is correct
120 Correct 726 ms 132472 KB Output is correct
121 Correct 792 ms 167532 KB Output is correct
122 Correct 689 ms 138104 KB Output is correct
123 Correct 797 ms 132340 KB Output is correct
124 Correct 1615 ms 167908 KB Output is correct
125 Correct 1340 ms 139244 KB Output is correct
126 Correct 1284 ms 132888 KB Output is correct