oj.uz

Submission #984027

# Submission time Handle Problem Language Result Execution time Memory
984027 2024-05-16T09:24:39 Z Amaarsaa Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 988 ms 61868 KB 
#include<bits/stdc++.h>
 
using namespace std;
using ll = int ;
using pll = pair < ll, ll >;
ll used[100001], cant[100001], c[100001], dp[100001];
vector < ll > adj[100001], radj[100001];
vector < pll > good[100001];
int main() {
//	freopen("moocast.in", "r", stdin);
//	freopen("moocast.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	ll n, m, q, i, ans, x, y, I, I1, i1, t;
 
	cin >> n >> m >> q;
	
	for (i = 1; i <= m; i ++) {
		cin >> x >> y;
		adj[x].push_back(y);
		radj[y].push_back(x);
	}
	for (i = 1; i <= n; i ++) {
		vector < pll > v;
		for ( ll I : radj[i]) {
			i1 = I1 = 0;
			good[i].push_back({0, i});
			used[0] = 1;
			while ( good[i].size() < 350 && (i1 < good[i].size() || I1 < good[I].size())) {
				if (i1 == good[i].size() || (I1 != good[I].size() && good[I][I1].first + 1 >= good[i][i1].first )) {
					good[I][I1].first ++;
					v.push_back(good[I][I1]);
					used[good[I][I1].second] = 1;
					good[I][I1].first --;
					I1 ++;
				}
				else {
					v.push_back(good[i][i1]);
					used[good[i][i1].second] = 1;
					i1 ++;
				}
				while (i1 < good[i].size() && used[good[i][i1].second]) i1 ++;
				while (I1 < good[I].size() && used[good[I][I1].second]) I1 ++;
				
			}
			good[i].pop_back();
			for ( pll A : good[i]) used[A.second] = 0;
			swap(good[i], v);
		}	
		
		
		
	}
	while ( q --) {
		cin >> t >> m;
		for ( i = 1; i <= m; i ++) {
			cin >> c[i];
			cant[c[i]] = 1;
		}
		ans = -1;
		if ( m <= 350) {
			for ( pll &A : good[t]) {
				if (!cant[A.second]) {
					ans = A.first;
					break;
				}
			}
			if (!cant[t]) ans = max(ans, int(0));
		}
		else {
			for (i = 1; i <= n; i ++) dp[i] = -1;
			for (i = 1; i <= n; i ++) {
				if ( cant[i] == 1 && dp[i] == -1) continue;
				dp[i] = max(int(0), dp[i]);
				for ( int I : adj[i]) {
					dp[I] = max(dp[I], dp[i] + 1);
				}
			}
			ans = dp[t];
		}
		for (i =1 ; i <= m; i ++) cant[c[i]] = 0;
		cout << ans << endl;
	}
	/*
	for (i = 1; i <= n; i ++) {
		cout << i << " " << good[i].size() << endl;
		for (pll X : good[i]) {
			cout << X.first << " " << X.second << endl;
		}
		cout << endl;
	}
	*/
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:29:40: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |    while ( good[i].size() < 350 && (i1 < good[i].size() || I1 < good[I].size())) {
      |                                     ~~~^~~~~~~~~~~~~~~~
bitaro.cpp:29:63: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |    while ( good[i].size() < 350 && (i1 < good[i].size() || I1 < good[I].size())) {
      |                                                            ~~~^~~~~~~~~~~~~~~~
bitaro.cpp:30:12: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     if (i1 == good[i].size() || (I1 != good[I].size() && good[I][I1].first + 1 >= good[i][i1].first )) {
      |         ~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:30:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     if (i1 == good[i].size() || (I1 != good[I].size() && good[I][I1].first + 1 >= good[i][i1].first )) {
      |                                  ~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:42:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     while (i1 < good[i].size() && used[good[i][i1].second]) i1 ++;
      |            ~~~^~~~~~~~~~~~~~~~
bitaro.cpp:43:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     while (I1 < good[I].size() && used[good[I][I1].second]) I1 ++;
      |            ~~~^~~~~~~~~~~~~~~~
bitaro.cpp:14:28: warning: unused variable 'I' [-Wunused-variable]
   14 |  ll n, m, q, i, ans, x, y, I, I1, i1, t;
      |                            ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8884 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8808 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 3 ms 8796 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8884 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8808 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 3 ms 8796 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 114 ms 15568 KB Output is correct
21 Correct 73 ms 12572 KB Output is correct
22 Correct 988 ms 61868 KB Output is correct
23 Correct 125 ms 15184 KB Output is correct
24 Correct 74 ms 17512 KB Output is correct
25 Correct 89 ms 17748 KB Output is correct
26 Correct 72 ms 17448 KB Output is correct
27 Correct 70 ms 18772 KB Output is correct
28 Correct 68 ms 18908 KB Output is correct
29 Correct 102 ms 18768 KB Output is correct
30 Correct 90 ms 18436 KB Output is correct
31 Correct 99 ms 18580 KB Output is correct
32 Correct 64 ms 18352 KB Output is correct
33 Correct 80 ms 20560 KB Output is correct
34 Correct 82 ms 20052 KB Output is correct
35 Correct 87 ms 20376 KB Output is correct
36 Correct 80 ms 18532 KB Output is correct
37 Correct 108 ms 18840 KB Output is correct
38 Correct 80 ms 18516 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 1 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8796 KB Output is correct
6 Correct 2 ms 8884 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2 ms 8792 KB Output is correct
12 Correct 2 ms 8796 KB Output is correct
13 Correct 2 ms 8796 KB Output is correct
14 Correct 2 ms 8808 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 2 ms 8796 KB Output is correct
17 Correct 3 ms 8796 KB Output is correct
18 Correct 2 ms 8792 KB Output is correct
19 Correct 2 ms 8796 KB Output is correct
20 Correct 114 ms 15568 KB Output is correct
21 Correct 73 ms 12572 KB Output is correct
22 Correct 988 ms 61868 KB Output is correct
23 Correct 125 ms 15184 KB Output is correct
24 Correct 74 ms 17512 KB Output is correct
25 Correct 89 ms 17748 KB Output is correct
26 Correct 72 ms 17448 KB Output is correct
27 Correct 70 ms 18772 KB Output is correct
28 Correct 68 ms 18908 KB Output is correct
29 Correct 102 ms 18768 KB Output is correct
30 Correct 90 ms 18436 KB Output is correct
31 Correct 99 ms 18580 KB Output is correct
32 Correct 64 ms 18352 KB Output is correct
33 Correct 80 ms 20560 KB Output is correct
34 Correct 82 ms 20052 KB Output is correct
35 Correct 87 ms 20376 KB Output is correct
36 Correct 80 ms 18532 KB Output is correct
37 Correct 108 ms 18840 KB Output is correct
38 Correct 80 ms 18516 KB Output is correct
39 Incorrect 205 ms 18000 KB Output isn't correct
40 Halted 0 ms 0 KB -