oj.uz

Submission #213040

# Submission time Handle Problem Language Result Execution time Memory
213040 2020-03-24T19:30:38 Z bash Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1888 ms 483832 KB 
/**
Think about 1e5, what comes with limit 1e5
may be n*sqrt(n)
then think about how can we do
if sz > sqrt(n) then we can solve dummy o(n+m) in worst case o((n + m) * sqrt(n))
else we can store sqrt(n) furthest vertecies for all vertecies. (Because our query size < sqrt we will eventually find at least one ans)
*/
/**
SXR0aXAkI0JwbXptI3FhI3Z3I293bCNqY2IjUG0jMCNicG0jVHFkcXZvLyNCcG0jQW10bjBhY2phcWFicXZvLyNNYm16dml0MSNWdyNhdGN1am16I2tpdiNhbXF9bSNQcXUjVnd6I0F0bW14MSNQcWEjaXptI2l0dCNicHF2b2EjUXYjYnBtI3BtaWRtdmEjaXZsI3d2I21pemJwMSNFcHcjcWEjYnBtem0ja2l2I3F2Ym16a21sbSNRdiNQcWEjeHptYW12a20jbXtrbXhiI0lhI3BtI3htenVxYmJtYnBHI1BtI3N2d2VtYnAjRXBpYiMraXh4bWl6bWJwI2J3I1BxYSNrem1pYmN6bWEjSWEsI0ptbnd6bSN3eiNJbmJteiN3eiNKbXBxdmwjYnBtdTEjVnd6I2FwaXR0I2JwbXwja3d1eGlhYSNJY29wYiN3biNwcWEjc3Z3ZXRtbG9tI017a214YiNpYSNQbSNlcXR0bWJwMSNQcWEjYnB6d3ZtI2x3YnAjbXtibXZsI1dkbXojYnBtI3BtaWRtdmEjSXZsI3d2I21pemJwLyNpdmwjUG0jbm1tdG1icCNWdyNuaWJxb2NtI3F2I29jaXpscXZvI0l2bCN4em1hbXpkcXZvI2JwbXUvI053eiNQbSNxYSNicG0jVXdhYiNQcW9wMSNCcG0jQWN4em11bSMrcXYjb3R3enwsMQ==
*/
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
 
#define F first
#define S second
#define endl '\n'
#define deb(x) cout<<#x<<' '<<x<<endl;
#define pb push_back
 using namespace __gnu_pbds;
using namespace std;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
#ifdef IZI_KATKA
#define int __int64_t
#else
#define int __int64
#endif
*/
const long long MOD = 1e9 + 7;
const long long MAXN = 1e6 + 1;

typedef long long ll;

#define pii pair<int,int>
 
long long readInt() {
    bool minus1 = false;
    long long result = 0;
    char ch;
    ch = getchar();
    while (true) {
        if (ch == '-') break;
        if (ch >= '0' && ch <= '9') break;
        ch = getchar();
    }
    if (ch == '-') minus1 = true; else result = ch-'0';
    while (true) {
        ch = getchar();
        if (ch < '0' || ch > '9') break;
        result = result*10 + (ch - '0');
    }
    if (minus1)
        return -result;
    else
        return result;
}

int n;
int used[MAXN];
vector<int> g[MAXN];
vector<int> g_rev[MAXN];
int dp[MAXN];


int slow(int start) {
	fill(dp, dp + n + 1, -MOD);
	dp[start] = 0;
	int ans = -1;
	for (int i = start; i >= 1; i--) {
		for (int j : g[i]) {
			dp[i] = max(dp[i], dp[j] + 1);	
		}
		if (!used[i]) {
			ans = max(ans, dp[i]);
		}
	}	
	return ans;
}

vector<pii> kth[MAXN];
int sq;

void init() {
	for (int i = 1; i <= n; i++) {
		kth[i].pb({0, i});
		for (int j : g_rev[i]) {
			vector<pii> nxt = kth[j];
			vector<pii> prv = kth[i];
			kth[i].clear();
			int ptr = 0;
			for (auto k : nxt) {
				k.first++;
				while(ptr < prv.size() && prv[ptr].first >= k.first) {
					if (used[prv[ptr].second]) {
						ptr++;
						continue;
					}
					used[prv[ptr].second] = 1;
					kth[i].pb(prv[ptr]);
					ptr++;
				}
				if (used[k.second]) continue;
				used[k.second] = 1;
				kth[i].pb(k);
			}
			while(ptr < prv.size()){
				if(used[prv[ptr].second]){
					ptr++;
					continue;
				}
				used[prv[ptr].second] = 1;
				kth[i].push_back(prv[ptr]);
				ptr++;
			}
			for(auto &z : nxt) used[z.second] = 0;
			for(auto &z : prv) used[z.second] = 0;
			while(kth[i].size() > sq) kth[i].pop_back();
		}		
	}
}

int main() {
	#ifdef IZI_KATKA
	assert(freopen("input", "r", stdin));
    assert(freopen("output", "w", stdout));
    #endif
    n = readInt(); int m = readInt(), q = readInt();
    sq = sqrt(n);
    for (int i = 1; i <= m; i++) {
		int from = readInt(), to = readInt();
		g[from].pb(to);
		g_rev[to].pb(from);
    }
    init();
	while(q--) {
		int start = readInt();
		int sz = readInt();
		vector<int> tmp(sz);
		for (int &i : tmp) {
			i = readInt();			
			used[i] = 1;
		}
		if (sz >= sq) {	
			/// dummy sol
			cout << slow(start) << endl;
		} else {
			/// take sqrt(n) furthest vertecies
	    	int ans = -1;
	    	for (auto i : kth[start]) {
	    		if (!used[i.second]) {
	    			ans = i.first;
	    			break;
	    		}
	    	}
	    	cout << ans << endl;
		}
		for (int i : tmp) {
			used[i] = 0;
		}
	}    
    return 0;
}

Compilation message

bitaro.cpp: In function 'void init()':
bitaro.cpp:121:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ptr < prv.size() && prv[ptr].first >= k.first) {
           ~~~~^~~~~~~~~~~~
bitaro.cpp:134:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(ptr < prv.size()){
          ~~~~^~~~~~~~~~~~
bitaro.cpp:145:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(kth[i].size() > sq) kth[i].pop_back();
          ~~~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 70648 KB Output is correct
2 Correct 43 ms 70648 KB Output is correct
3 Correct 41 ms 70776 KB Output is correct
4 Correct 41 ms 70648 KB Output is correct
5 Correct 43 ms 71160 KB Output is correct
6 Correct 43 ms 71160 KB Output is correct
7 Correct 45 ms 71160 KB Output is correct
8 Correct 43 ms 71160 KB Output is correct
9 Correct 44 ms 71160 KB Output is correct
10 Correct 46 ms 71160 KB Output is correct
11 Correct 43 ms 71168 KB Output is correct
12 Correct 50 ms 71296 KB Output is correct
13 Correct 43 ms 71168 KB Output is correct
14 Correct 43 ms 71160 KB Output is correct
15 Correct 42 ms 71160 KB Output is correct
16 Correct 43 ms 71168 KB Output is correct
17 Correct 44 ms 71164 KB Output is correct
18 Correct 44 ms 71160 KB Output is correct
19 Correct 45 ms 71160 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 70648 KB Output is correct
2 Correct 43 ms 70648 KB Output is correct
3 Correct 41 ms 70776 KB Output is correct
4 Correct 41 ms 70648 KB Output is correct
5 Correct 43 ms 71160 KB Output is correct
6 Correct 43 ms 71160 KB Output is correct
7 Correct 45 ms 71160 KB Output is correct
8 Correct 43 ms 71160 KB Output is correct
9 Correct 44 ms 71160 KB Output is correct
10 Correct 46 ms 71160 KB Output is correct
11 Correct 43 ms 71168 KB Output is correct
12 Correct 50 ms 71296 KB Output is correct
13 Correct 43 ms 71168 KB Output is correct
14 Correct 43 ms 71160 KB Output is correct
15 Correct 42 ms 71160 KB Output is correct
16 Correct 43 ms 71168 KB Output is correct
17 Correct 44 ms 71164 KB Output is correct
18 Correct 44 ms 71160 KB Output is correct
19 Correct 45 ms 71160 KB Output is correct
20 Correct 175 ms 73336 KB Output is correct
21 Correct 178 ms 73336 KB Output is correct
22 Correct 178 ms 73336 KB Output is correct
23 Correct 176 ms 73336 KB Output is correct
24 Correct 1229 ms 322808 KB Output is correct
25 Correct 1235 ms 334588 KB Output is correct
26 Correct 1226 ms 333816 KB Output is correct
27 Correct 1527 ms 480248 KB Output is correct
28 Correct 1491 ms 480248 KB Output is correct
29 Correct 1487 ms 480248 KB Output is correct
30 Correct 1458 ms 479096 KB Output is correct
31 Correct 1535 ms 464632 KB Output is correct
32 Correct 1514 ms 478968 KB Output is correct
33 Correct 1155 ms 321912 KB Output is correct
34 Correct 1103 ms 335480 KB Output is correct
35 Correct 1134 ms 320120 KB Output is correct
36 Correct 1323 ms 400632 KB Output is correct
37 Correct 1309 ms 369656 KB Output is correct
38 Correct 1329 ms 401784 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 70648 KB Output is correct
2 Correct 43 ms 70648 KB Output is correct
3 Correct 41 ms 70776 KB Output is correct
4 Correct 41 ms 70648 KB Output is correct
5 Correct 43 ms 71160 KB Output is correct
6 Correct 43 ms 71160 KB Output is correct
7 Correct 45 ms 71160 KB Output is correct
8 Correct 43 ms 71160 KB Output is correct
9 Correct 44 ms 71160 KB Output is correct
10 Correct 46 ms 71160 KB Output is correct
11 Correct 43 ms 71168 KB Output is correct
12 Correct 50 ms 71296 KB Output is correct
13 Correct 43 ms 71168 KB Output is correct
14 Correct 43 ms 71160 KB Output is correct
15 Correct 42 ms 71160 KB Output is correct
16 Correct 43 ms 71168 KB Output is correct
17 Correct 44 ms 71164 KB Output is correct
18 Correct 44 ms 71160 KB Output is correct
19 Correct 45 ms 71160 KB Output is correct
20 Correct 175 ms 73336 KB Output is correct
21 Correct 178 ms 73336 KB Output is correct
22 Correct 178 ms 73336 KB Output is correct
23 Correct 176 ms 73336 KB Output is correct
24 Correct 1229 ms 322808 KB Output is correct
25 Correct 1235 ms 334588 KB Output is correct
26 Correct 1226 ms 333816 KB Output is correct
27 Correct 1527 ms 480248 KB Output is correct
28 Correct 1491 ms 480248 KB Output is correct
29 Correct 1487 ms 480248 KB Output is correct
30 Correct 1458 ms 479096 KB Output is correct
31 Correct 1535 ms 464632 KB Output is correct
32 Correct 1514 ms 478968 KB Output is correct
33 Correct 1155 ms 321912 KB Output is correct
34 Correct 1103 ms 335480 KB Output is correct
35 Correct 1134 ms 320120 KB Output is correct
36 Correct 1323 ms 400632 KB Output is correct
37 Correct 1309 ms 369656 KB Output is correct
38 Correct 1329 ms 401784 KB Output is correct
39 Correct 1248 ms 325752 KB Output is correct
40 Correct 1219 ms 328184 KB Output is correct
41 Correct 1220 ms 330872 KB Output is correct
42 Correct 1324 ms 329208 KB Output is correct
43 Correct 1240 ms 328568 KB Output is correct
44 Correct 206 ms 73720 KB Output is correct
45 Correct 181 ms 73336 KB Output is correct
46 Correct 371 ms 73336 KB Output is correct
47 Correct 195 ms 73336 KB Output is correct
48 Correct 181 ms 73336 KB Output is correct
49 Correct 1688 ms 480248 KB Output is correct
50 Correct 1608 ms 482168 KB Output is correct
51 Correct 200 ms 75896 KB Output is correct
52 Correct 378 ms 75128 KB Output is correct
53 Correct 1358 ms 402424 KB Output is correct
54 Correct 1347 ms 372856 KB Output is correct
55 Correct 1318 ms 401912 KB Output is correct
56 Correct 1319 ms 372856 KB Output is correct
57 Correct 202 ms 76024 KB Output is correct
58 Correct 202 ms 75896 KB Output is correct
59 Correct 371 ms 75128 KB Output is correct
60 Correct 371 ms 75128 KB Output is correct
61 Correct 1606 ms 482680 KB Output is correct
62 Correct 1420 ms 403576 KB Output is correct
63 Correct 1386 ms 371448 KB Output is correct
64 Correct 1888 ms 482680 KB Output is correct
65 Correct 1604 ms 402040 KB Output is correct
66 Correct 1563 ms 373368 KB Output is correct
67 Correct 1626 ms 482296 KB Output is correct
68 Correct 1356 ms 403192 KB Output is correct
69 Correct 1293 ms 369020 KB Output is correct
70 Correct 1638 ms 482808 KB Output is correct
71 Correct 1343 ms 403704 KB Output is correct
72 Correct 1321 ms 372728 KB Output is correct
73 Correct 1657 ms 482808 KB Output is correct
74 Correct 1365 ms 403704 KB Output is correct
75 Correct 1397 ms 372600 KB Output is correct
76 Correct 1667 ms 483832 KB Output is correct
77 Correct 1625 ms 482552 KB Output is correct
78 Correct 1672 ms 482936 KB Output is correct
79 Correct 207 ms 76168 KB Output is correct
80 Correct 341 ms 75256 KB Output is correct
81 Correct 187 ms 74872 KB Output is correct
82 Correct 1567 ms 482552 KB Output is correct
83 Correct 1641 ms 468344 KB Output is correct
84 Correct 1477 ms 481144 KB Output is correct
85 Correct 1549 ms 466680 KB Output is correct
86 Correct 1502 ms 481656 KB Output is correct
87 Correct 1581 ms 467964 KB Output is correct
88 Correct 205 ms 76152 KB Output is correct
89 Correct 207 ms 76152 KB Output is correct
90 Correct 349 ms 75256 KB Output is correct
91 Correct 348 ms 75256 KB Output is correct
92 Correct 180 ms 74876 KB Output is correct
93 Correct 177 ms 74872 KB Output is correct
94 Correct 1157 ms 325368 KB Output is correct
95 Correct 1169 ms 347000 KB Output is correct
96 Correct 1116 ms 323064 KB Output is correct
97 Correct 1160 ms 350328 KB Output is correct
98 Correct 1146 ms 324344 KB Output is correct
99 Correct 1168 ms 346616 KB Output is correct
100 Correct 206 ms 76280 KB Output is correct
101 Correct 211 ms 76152 KB Output is correct
102 Correct 322 ms 75256 KB Output is correct
103 Correct 325 ms 75384 KB Output is correct
104 Correct 179 ms 74872 KB Output is correct
105 Correct 185 ms 75012 KB Output is correct
106 Correct 1419 ms 403192 KB Output is correct
107 Correct 1418 ms 373500 KB Output is correct
108 Correct 1369 ms 404216 KB Output is correct
109 Correct 1307 ms 371900 KB Output is correct
110 Correct 1368 ms 404728 KB Output is correct
111 Correct 1348 ms 373496 KB Output is correct
112 Correct 206 ms 76152 KB Output is correct
113 Correct 205 ms 76152 KB Output is correct
114 Correct 344 ms 75128 KB Output is correct
115 Correct 348 ms 75128 KB Output is correct
116 Correct 189 ms 74872 KB Output is correct
117 Correct 181 ms 74872 KB Output is correct
118 Correct 1635 ms 482192 KB Output is correct
119 Correct 1357 ms 403832 KB Output is correct
120 Correct 1361 ms 371576 KB Output is correct
121 Correct 1679 ms 482296 KB Output is correct
122 Correct 1371 ms 402424 KB Output is correct
123 Correct 1315 ms 371608 KB Output is correct
124 Correct 1661 ms 482168 KB Output is correct
125 Correct 1361 ms 404088 KB Output is correct
126 Correct 1316 ms 370680 KB Output is correct