oj.uz

답안 #984049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984049 2024-05-16T09:36:06 Z Amaarsaa Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 457 ms 37484 KB 
#include<bits/stdc++.h>
 
using namespace std;
using ll = int ;
using pll = pair < ll, ll >;
ll used[100004], cant[100004], c[100004];
vector < ll > adj[100004], radj[100004];
vector < pll > good[100003];
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() < 100 && (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 <= 100) {
			for ( pll &A : good[t]) {
				if (!cant[A.second]) {
					ans = A.first;
					break;
				}
			}
			if (!cant[t]) ans = max(ans, int(0));
		}
		else {
			ll dp[n + 2];
			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() < 100 && (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() < 100 && (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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7256 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 2 ms 7512 KB Output is correct
16 Correct 3 ms 7768 KB Output is correct
17 Correct 2 ms 7516 KB Output is correct
18 Correct 2 ms 7516 KB Output is correct
19 Correct 2 ms 7512 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7256 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 2 ms 7512 KB Output is correct
16 Correct 3 ms 7768 KB Output is correct
17 Correct 2 ms 7516 KB Output is correct
18 Correct 2 ms 7516 KB Output is correct
19 Correct 2 ms 7512 KB Output is correct
20 Correct 73 ms 12880 KB Output is correct
21 Correct 51 ms 11036 KB Output is correct
22 Correct 457 ms 37484 KB Output is correct
23 Correct 145 ms 16092 KB Output is correct
24 Correct 76 ms 17236 KB Output is correct
25 Correct 80 ms 17488 KB Output is correct
26 Correct 75 ms 17256 KB Output is correct
27 Correct 73 ms 18624 KB Output is correct
28 Correct 81 ms 18512 KB Output is correct
29 Correct 78 ms 18512 KB Output is correct
30 Correct 83 ms 18256 KB Output is correct
31 Correct 80 ms 18256 KB Output is correct
32 Correct 72 ms 18004 KB Output is correct
33 Correct 107 ms 20120 KB Output is correct
34 Correct 98 ms 19492 KB Output is correct
35 Correct 77 ms 19792 KB Output is correct
36 Correct 77 ms 18252 KB Output is correct
37 Correct 87 ms 18612 KB Output is correct
38 Correct 72 ms 18004 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 2 ms 7256 KB Output is correct
5 Correct 2 ms 7516 KB Output is correct
6 Correct 4 ms 7516 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 2 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 2 ms 7516 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 2 ms 7512 KB Output is correct
15 Correct 2 ms 7512 KB Output is correct
16 Correct 3 ms 7768 KB Output is correct
17 Correct 2 ms 7516 KB Output is correct
18 Correct 2 ms 7516 KB Output is correct
19 Correct 2 ms 7512 KB Output is correct
20 Correct 73 ms 12880 KB Output is correct
21 Correct 51 ms 11036 KB Output is correct
22 Correct 457 ms 37484 KB Output is correct
23 Correct 145 ms 16092 KB Output is correct
24 Correct 76 ms 17236 KB Output is correct
25 Correct 80 ms 17488 KB Output is correct
26 Correct 75 ms 17256 KB Output is correct
27 Correct 73 ms 18624 KB Output is correct
28 Correct 81 ms 18512 KB Output is correct
29 Correct 78 ms 18512 KB Output is correct
30 Correct 83 ms 18256 KB Output is correct
31 Correct 80 ms 18256 KB Output is correct
32 Correct 72 ms 18004 KB Output is correct
33 Correct 107 ms 20120 KB Output is correct
34 Correct 98 ms 19492 KB Output is correct
35 Correct 77 ms 19792 KB Output is correct
36 Correct 77 ms 18252 KB Output is correct
37 Correct 87 ms 18612 KB Output is correct
38 Correct 72 ms 18004 KB Output is correct
39 Incorrect 212 ms 17288 KB Output isn't correct
40 Halted 0 ms 0 KB -