oj.uz

Submission #93610

# Submission time Handle Problem Language Result Execution time Memory
93610 2019-01-10T02:37:37 Z silxikys Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1579 ms 243876 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 = 75; //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);
    		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 4984 KB Output is correct
2 Correct 5 ms 4988 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 6136 KB Output is correct
6 Correct 10 ms 6264 KB Output is correct
7 Correct 10 ms 6136 KB Output is correct
8 Correct 14 ms 7288 KB Output is correct
9 Correct 13 ms 7416 KB Output is correct
10 Correct 12 ms 7288 KB Output is correct
11 Correct 13 ms 7324 KB Output is correct
12 Correct 11 ms 6776 KB Output is correct
13 Correct 13 ms 7288 KB Output is correct
14 Correct 11 ms 6392 KB Output is correct
15 Correct 9 ms 6008 KB Output is correct
16 Correct 10 ms 6392 KB Output is correct
17 Correct 11 ms 6776 KB Output is correct
18 Correct 9 ms 6392 KB Output is correct
19 Correct 11 ms 6776 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 4988 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 6136 KB Output is correct
6 Correct 10 ms 6264 KB Output is correct
7 Correct 10 ms 6136 KB Output is correct
8 Correct 14 ms 7288 KB Output is correct
9 Correct 13 ms 7416 KB Output is correct
10 Correct 12 ms 7288 KB Output is correct
11 Correct 13 ms 7324 KB Output is correct
12 Correct 11 ms 6776 KB Output is correct
13 Correct 13 ms 7288 KB Output is correct
14 Correct 11 ms 6392 KB Output is correct
15 Correct 9 ms 6008 KB Output is correct
16 Correct 10 ms 6392 KB Output is correct
17 Correct 11 ms 6776 KB Output is correct
18 Correct 9 ms 6392 KB Output is correct
19 Correct 11 ms 6776 KB Output is correct
20 Correct 559 ms 8588 KB Output is correct
21 Correct 541 ms 8440 KB Output is correct
22 Correct 545 ms 8408 KB Output is correct
23 Correct 569 ms 8696 KB Output is correct
24 Correct 1168 ms 188684 KB Output is correct
25 Correct 1020 ms 191224 KB Output is correct
26 Correct 1131 ms 190976 KB Output is correct
27 Correct 1170 ms 243852 KB Output is correct
28 Correct 1132 ms 243732 KB Output is correct
29 Correct 1171 ms 243704 KB Output is correct
30 Correct 971 ms 243688 KB Output is correct
31 Correct 1033 ms 239736 KB Output is correct
32 Correct 1016 ms 243768 KB Output is correct
33 Correct 801 ms 156416 KB Output is correct
34 Correct 638 ms 140536 KB Output is correct
35 Correct 688 ms 155388 KB Output is correct
36 Correct 893 ms 199316 KB Output is correct
37 Correct 874 ms 189436 KB Output is correct
38 Correct 802 ms 199916 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4984 KB Output is correct
2 Correct 5 ms 4988 KB Output is correct
3 Correct 5 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 10 ms 6136 KB Output is correct
6 Correct 10 ms 6264 KB Output is correct
7 Correct 10 ms 6136 KB Output is correct
8 Correct 14 ms 7288 KB Output is correct
9 Correct 13 ms 7416 KB Output is correct
10 Correct 12 ms 7288 KB Output is correct
11 Correct 13 ms 7324 KB Output is correct
12 Correct 11 ms 6776 KB Output is correct
13 Correct 13 ms 7288 KB Output is correct
14 Correct 11 ms 6392 KB Output is correct
15 Correct 9 ms 6008 KB Output is correct
16 Correct 10 ms 6392 KB Output is correct
17 Correct 11 ms 6776 KB Output is correct
18 Correct 9 ms 6392 KB Output is correct
19 Correct 11 ms 6776 KB Output is correct
20 Correct 559 ms 8588 KB Output is correct
21 Correct 541 ms 8440 KB Output is correct
22 Correct 545 ms 8408 KB Output is correct
23 Correct 569 ms 8696 KB Output is correct
24 Correct 1168 ms 188684 KB Output is correct
25 Correct 1020 ms 191224 KB Output is correct
26 Correct 1131 ms 190976 KB Output is correct
27 Correct 1170 ms 243852 KB Output is correct
28 Correct 1132 ms 243732 KB Output is correct
29 Correct 1171 ms 243704 KB Output is correct
30 Correct 971 ms 243688 KB Output is correct
31 Correct 1033 ms 239736 KB Output is correct
32 Correct 1016 ms 243768 KB Output is correct
33 Correct 801 ms 156416 KB Output is correct
34 Correct 638 ms 140536 KB Output is correct
35 Correct 688 ms 155388 KB Output is correct
36 Correct 893 ms 199316 KB Output is correct
37 Correct 874 ms 189436 KB Output is correct
38 Correct 802 ms 199916 KB Output is correct
39 Correct 1196 ms 189020 KB Output is correct
40 Correct 1112 ms 190064 KB Output is correct
41 Correct 1579 ms 190852 KB Output is correct
42 Correct 1070 ms 190456 KB Output is correct
43 Correct 1270 ms 189308 KB Output is correct
44 Correct 593 ms 8744 KB Output is correct
45 Correct 564 ms 8508 KB Output is correct
46 Correct 684 ms 8512 KB Output is correct
47 Correct 578 ms 8312 KB Output is correct
48 Correct 562 ms 8436 KB Output is correct
49 Correct 1192 ms 243876 KB Output is correct
50 Correct 1535 ms 243592 KB Output is correct
51 Correct 575 ms 9052 KB Output is correct
52 Correct 675 ms 8312 KB Output is correct
53 Correct 963 ms 198392 KB Output is correct
54 Correct 941 ms 189048 KB Output is correct
55 Correct 1570 ms 198624 KB Output is correct
56 Correct 1481 ms 189768 KB Output is correct
57 Correct 596 ms 8828 KB Output is correct
58 Correct 591 ms 8696 KB Output is correct
59 Correct 645 ms 8440 KB Output is correct
60 Correct 645 ms 8440 KB Output is correct
61 Correct 1082 ms 243576 KB Output is correct
62 Correct 833 ms 199608 KB Output is correct
63 Correct 904 ms 188328 KB Output is correct
64 Correct 1204 ms 243448 KB Output is correct
65 Correct 1064 ms 198840 KB Output is correct
66 Correct 1121 ms 189844 KB Output is correct
67 Correct 1446 ms 243496 KB Output is correct
68 Correct 1216 ms 199516 KB Output is correct
69 Correct 1250 ms 187620 KB Output is correct
70 Correct 1083 ms 243576 KB Output is correct
71 Correct 929 ms 199304 KB Output is correct
72 Correct 925 ms 188792 KB Output is correct
73 Correct 1149 ms 243656 KB Output is correct
74 Correct 906 ms 199252 KB Output is correct
75 Correct 882 ms 188676 KB Output is correct
76 Correct 1076 ms 243660 KB Output is correct
77 Correct 1469 ms 243704 KB Output is correct
78 Correct 1012 ms 243780 KB Output is correct
79 Correct 585 ms 8816 KB Output is correct
80 Correct 633 ms 8440 KB Output is correct
81 Correct 562 ms 8300 KB Output is correct
82 Correct 1184 ms 243832 KB Output is correct
83 Correct 1076 ms 239480 KB Output is correct
84 Correct 1262 ms 243576 KB Output is correct
85 Correct 1421 ms 239360 KB Output is correct
86 Correct 1031 ms 243660 KB Output is correct
87 Correct 1000 ms 239736 KB Output is correct
88 Correct 589 ms 8828 KB Output is correct
89 Correct 586 ms 8824 KB Output is correct
90 Correct 606 ms 8308 KB Output is correct
91 Correct 636 ms 8316 KB Output is correct
92 Correct 552 ms 8568 KB Output is correct
93 Correct 552 ms 8372 KB Output is correct
94 Correct 772 ms 156364 KB Output is correct
95 Correct 818 ms 139748 KB Output is correct
96 Correct 1085 ms 155512 KB Output is correct
97 Correct 1044 ms 142180 KB Output is correct
98 Correct 828 ms 156204 KB Output is correct
99 Correct 680 ms 141304 KB Output is correct
100 Correct 615 ms 8864 KB Output is correct
101 Correct 606 ms 8952 KB Output is correct
102 Correct 650 ms 8588 KB Output is correct
103 Correct 623 ms 8536 KB Output is correct
104 Correct 622 ms 8520 KB Output is correct
105 Correct 722 ms 8568 KB Output is correct
106 Correct 948 ms 198648 KB Output is correct
107 Correct 971 ms 189304 KB Output is correct
108 Correct 1226 ms 199800 KB Output is correct
109 Correct 1276 ms 188844 KB Output is correct
110 Correct 905 ms 200164 KB Output is correct
111 Correct 933 ms 189796 KB Output is correct
112 Correct 589 ms 8824 KB Output is correct
113 Correct 593 ms 8972 KB Output is correct
114 Correct 618 ms 8696 KB Output is correct
115 Correct 625 ms 8416 KB Output is correct
116 Correct 555 ms 8392 KB Output is correct
117 Correct 564 ms 8512 KB Output is correct
118 Correct 1168 ms 243292 KB Output is correct
119 Correct 847 ms 199372 KB Output is correct
120 Correct 1037 ms 188200 KB Output is correct
121 Correct 1174 ms 243292 KB Output is correct
122 Correct 1000 ms 198520 KB Output is correct
123 Correct 928 ms 187996 KB Output is correct
124 Correct 952 ms 243420 KB Output is correct
125 Correct 823 ms 200068 KB Output is correct
126 Correct 839 ms 188496 KB Output is correct