oj.uz

Submission #860568

# Submission time Handle Problem Language Result Execution time Memory
860568 2023-10-13T10:12:08 Z phoenix0423 Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 1025 ms 421148 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
const int maxn = 1e5 + 5;
const int INF = 1e9;
vector<int> adj[maxn], radj[maxn];
int n, m, q, sn;
vector<pll> p[maxn];
int used[maxn], bad[maxn];
int dist[maxn];

void init(){
	for(int i = 0; i < n; i++){
		for(auto x : radj[i]){
			vector<pll> nw;
			int l1 = 0, l2 = 0;
			while(nw.size() < sn){
				while(l1 < p[i].size() && used[p[i][l1].s]) l1++;
				while(l2 < p[x].size() && used[p[x][l2].s]) l2++;
				if(l1 == p[i].size() && l2 == p[x].size()) break;
				if(l1 == p[i].size()) used[p[x][l2].s] = 1, nw.pb(p[x][l2++]);
				else if(l2 == p[x].size()) used[p[i][l1].s] = 1, nw.pb(p[i][l1++]);
				else if(p[i][l1].f >= p[x][l2].f) used[p[i][l1].s] = 1, nw.pb(p[i][l1++]);
				else used[p[x][l2].s] = 1, nw.pb(p[x][l2++]);
			}
			swap(p[i], nw);
			for(auto [val, id] : p[i]) used[id] = 0;
		}
		for(int j = 0; j < p[i].size(); j++) p[i][j].f ++;
		if(p[i].size() < sn) p[i].pb({0, i});
	}
}

int find_max_path(int tar){
	for(int i = 0; i < n; i++) dist[i] = -INF;
	dist[tar] = 0;
	int ans = -1;
	for(int i = tar; i >= 0; i--){
		for(auto x : adj[i]) dist[i] = max(dist[i], dist[x] + 1);
		if(!bad[i]) ans = max(ans, dist[i]);
	}
	return ans;
}

int main(void){
	fastio;
	cin>>n>>m>>q;
	sn = sqrt(n);
	for(int i = 0; i < m; i++){
		int a, b;
		cin>>a>>b;
		a--, b--;
		adj[a].pb(b);
		radj[b].pb(a);
	}
	init();
	for(int i = 0; i < q; i++){
		int t, y;
		cin>>t>>y;
		t--;
		vector<int> ng(y);
		for(int j = 0; j < y; j++){
			cin>>ng[j];
			ng[j] --;
			bad[ng[j]] = 1;
		}
		if(y >= sn){
			cout<<find_max_path(t)<<"\n";
		}
		else{
			int ans = -1;
			for(auto [val, id] : p[t]){
				if(!bad[id]){
					ans = val;
					break;
				}
			}
			cout<<ans<<"\n";
		}
		for(auto x : ng) bad[x] = 0;
	}

}

Compilation message

bitaro.cpp: In function 'void init()':
bitaro.cpp:24:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |    while(nw.size() < sn){
      |          ~~~~~~~~~~^~~~
bitaro.cpp:25:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     while(l1 < p[i].size() && used[p[i][l1].s]) l1++;
      |           ~~~^~~~~~~~~~~~~
bitaro.cpp:26:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     while(l2 < p[x].size() && used[p[x][l2].s]) l2++;
      |           ~~~^~~~~~~~~~~~~
bitaro.cpp:27:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     if(l1 == p[i].size() && l2 == p[x].size()) break;
      |        ~~~^~~~~~~~~~~~~~
bitaro.cpp:27:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     if(l1 == p[i].size() && l2 == p[x].size()) break;
      |                             ~~~^~~~~~~~~~~~~~
bitaro.cpp:28:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     if(l1 == p[i].size()) used[p[x][l2].s] = 1, nw.pb(p[x][l2++]);
      |        ~~~^~~~~~~~~~~~~~
bitaro.cpp:29:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     else if(l2 == p[x].size()) used[p[i][l1].s] = 1, nw.pb(p[i][l1++]);
      |             ~~~^~~~~~~~~~~~~~
bitaro.cpp:36:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for(int j = 0; j < p[i].size(); j++) p[i][j].f ++;
      |                  ~~^~~~~~~~~~~~~
bitaro.cpp:37:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |   if(p[i].size() < sn) p[i].pb({0, i});
      |      ~~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 3 ms 8280 KB Output is correct
3 Correct 2 ms 8484 KB Output is correct
4 Correct 3 ms 8280 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 4 ms 8764 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 3 ms 8764 KB Output is correct
11 Correct 4 ms 8792 KB Output is correct
12 Correct 4 ms 8796 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 5 ms 8624 KB Output is correct
16 Correct 5 ms 8536 KB Output is correct
17 Correct 6 ms 7772 KB Output is correct
18 Correct 6 ms 7772 KB Output is correct
19 Correct 5 ms 7772 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 3 ms 8280 KB Output is correct
3 Correct 2 ms 8484 KB Output is correct
4 Correct 3 ms 8280 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 4 ms 8764 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 3 ms 8764 KB Output is correct
11 Correct 4 ms 8792 KB Output is correct
12 Correct 4 ms 8796 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 5 ms 8624 KB Output is correct
16 Correct 5 ms 8536 KB Output is correct
17 Correct 6 ms 7772 KB Output is correct
18 Correct 6 ms 7772 KB Output is correct
19 Correct 5 ms 7772 KB Output is correct
20 Correct 85 ms 11488 KB Output is correct
21 Correct 81 ms 12340 KB Output is correct
22 Correct 77 ms 12276 KB Output is correct
23 Correct 77 ms 12368 KB Output is correct
24 Correct 582 ms 260212 KB Output is correct
25 Correct 715 ms 271960 KB Output is correct
26 Correct 588 ms 270932 KB Output is correct
27 Correct 680 ms 419724 KB Output is correct
28 Correct 694 ms 419608 KB Output is correct
29 Correct 689 ms 419504 KB Output is correct
30 Correct 667 ms 418568 KB Output is correct
31 Correct 703 ms 404100 KB Output is correct
32 Correct 676 ms 418360 KB Output is correct
33 Correct 511 ms 261516 KB Output is correct
34 Correct 480 ms 215080 KB Output is correct
35 Correct 494 ms 259608 KB Output is correct
36 Correct 593 ms 339248 KB Output is correct
37 Correct 608 ms 308576 KB Output is correct
38 Correct 618 ms 341380 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8280 KB Output is correct
2 Correct 3 ms 8280 KB Output is correct
3 Correct 2 ms 8484 KB Output is correct
4 Correct 3 ms 8280 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 4 ms 8764 KB Output is correct
8 Correct 3 ms 8796 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 3 ms 8764 KB Output is correct
11 Correct 4 ms 8792 KB Output is correct
12 Correct 4 ms 8796 KB Output is correct
13 Correct 4 ms 8796 KB Output is correct
14 Correct 4 ms 8540 KB Output is correct
15 Correct 5 ms 8624 KB Output is correct
16 Correct 5 ms 8536 KB Output is correct
17 Correct 6 ms 7772 KB Output is correct
18 Correct 6 ms 7772 KB Output is correct
19 Correct 5 ms 7772 KB Output is correct
20 Correct 85 ms 11488 KB Output is correct
21 Correct 81 ms 12340 KB Output is correct
22 Correct 77 ms 12276 KB Output is correct
23 Correct 77 ms 12368 KB Output is correct
24 Correct 582 ms 260212 KB Output is correct
25 Correct 715 ms 271960 KB Output is correct
26 Correct 588 ms 270932 KB Output is correct
27 Correct 680 ms 419724 KB Output is correct
28 Correct 694 ms 419608 KB Output is correct
29 Correct 689 ms 419504 KB Output is correct
30 Correct 667 ms 418568 KB Output is correct
31 Correct 703 ms 404100 KB Output is correct
32 Correct 676 ms 418360 KB Output is correct
33 Correct 511 ms 261516 KB Output is correct
34 Correct 480 ms 215080 KB Output is correct
35 Correct 494 ms 259608 KB Output is correct
36 Correct 593 ms 339248 KB Output is correct
37 Correct 608 ms 308576 KB Output is correct
38 Correct 618 ms 341380 KB Output is correct
39 Correct 645 ms 264484 KB Output is correct
40 Correct 595 ms 266164 KB Output is correct
41 Correct 585 ms 268896 KB Output is correct
42 Correct 651 ms 266764 KB Output is correct
43 Correct 605 ms 266280 KB Output is correct
44 Correct 104 ms 13688 KB Output is correct
45 Correct 100 ms 13140 KB Output is correct
46 Correct 229 ms 12952 KB Output is correct
47 Correct 99 ms 12468 KB Output is correct
48 Correct 98 ms 12488 KB Output is correct
49 Correct 938 ms 420512 KB Output is correct
50 Correct 652 ms 419280 KB Output is correct
51 Correct 99 ms 13424 KB Output is correct
52 Correct 226 ms 12820 KB Output is correct
53 Correct 625 ms 339744 KB Output is correct
54 Correct 611 ms 309752 KB Output is correct
55 Correct 580 ms 339076 KB Output is correct
56 Correct 583 ms 309236 KB Output is correct
57 Correct 99 ms 13460 KB Output is correct
58 Correct 106 ms 14024 KB Output is correct
59 Correct 234 ms 12632 KB Output is correct
60 Correct 225 ms 12672 KB Output is correct
61 Correct 913 ms 419764 KB Output is correct
62 Correct 636 ms 340560 KB Output is correct
63 Correct 635 ms 308240 KB Output is correct
64 Correct 1025 ms 420092 KB Output is correct
65 Correct 732 ms 339236 KB Output is correct
66 Correct 726 ms 310072 KB Output is correct
67 Correct 625 ms 419204 KB Output is correct
68 Correct 583 ms 340304 KB Output is correct
69 Correct 578 ms 305748 KB Output is correct
70 Correct 873 ms 419864 KB Output is correct
71 Correct 586 ms 340820 KB Output is correct
72 Correct 584 ms 309488 KB Output is correct
73 Correct 886 ms 419556 KB Output is correct
74 Correct 603 ms 340940 KB Output is correct
75 Correct 606 ms 309200 KB Output is correct
76 Correct 895 ms 421148 KB Output is correct
77 Correct 647 ms 419744 KB Output is correct
78 Correct 864 ms 420012 KB Output is correct
79 Correct 115 ms 13796 KB Output is correct
80 Correct 206 ms 13140 KB Output is correct
81 Correct 83 ms 12380 KB Output is correct
82 Correct 903 ms 419564 KB Output is correct
83 Correct 890 ms 405332 KB Output is correct
84 Correct 640 ms 418600 KB Output is correct
85 Correct 864 ms 403540 KB Output is correct
86 Correct 852 ms 418436 KB Output is correct
87 Correct 875 ms 404816 KB Output is correct
88 Correct 105 ms 13648 KB Output is correct
89 Correct 101 ms 13664 KB Output is correct
90 Correct 214 ms 13136 KB Output is correct
91 Correct 207 ms 12884 KB Output is correct
92 Correct 80 ms 12560 KB Output is correct
93 Correct 79 ms 12376 KB Output is correct
94 Correct 542 ms 262608 KB Output is correct
95 Correct 493 ms 215388 KB Output is correct
96 Correct 508 ms 260180 KB Output is correct
97 Correct 472 ms 218192 KB Output is correct
98 Correct 513 ms 261204 KB Output is correct
99 Correct 473 ms 217684 KB Output is correct
100 Correct 100 ms 13836 KB Output is correct
101 Correct 99 ms 13652 KB Output is correct
102 Correct 182 ms 12884 KB Output is correct
103 Correct 185 ms 12884 KB Output is correct
104 Correct 79 ms 12368 KB Output is correct
105 Correct 81 ms 12600 KB Output is correct
106 Correct 608 ms 340304 KB Output is correct
107 Correct 606 ms 310100 KB Output is correct
108 Correct 581 ms 341324 KB Output is correct
109 Correct 559 ms 308568 KB Output is correct
110 Correct 584 ms 341724 KB Output is correct
111 Correct 602 ms 310084 KB Output is correct
112 Correct 99 ms 13652 KB Output is correct
113 Correct 102 ms 13652 KB Output is correct
114 Correct 204 ms 12936 KB Output is correct
115 Correct 208 ms 12884 KB Output is correct
116 Correct 84 ms 12532 KB Output is correct
117 Correct 79 ms 12776 KB Output is correct
118 Correct 852 ms 419276 KB Output is correct
119 Correct 580 ms 340892 KB Output is correct
120 Correct 572 ms 308524 KB Output is correct
121 Correct 854 ms 419512 KB Output is correct
122 Correct 580 ms 339608 KB Output is correct
123 Correct 560 ms 308308 KB Output is correct
124 Correct 623 ms 419172 KB Output is correct
125 Correct 593 ms 341328 KB Output is correct
126 Correct 571 ms 307628 KB Output is correct