oj.uz

답안 #1031656

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031656 2024-07-23T03:18:03 Z SamuellH12 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 484180 KB 
#include <bits/stdc++.h>
#define ALL(x) x.begin(), x.end()
#define pii pair<int,int>
const int MAXN = 1e5 + 64;
const int SQRT = 150;
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")

int block[MAXN], dp[MAXN], order[MAXN], tempo;
vector<int> trafo[MAXN];
pii best[MAXN][4*SQRT+5];
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int main(){
	ios::sync_with_stdio(false);
	int n, m, q;
	scanf("%d %d %d", &n, &m, &q);
	
	for(int i=0, u, v; i<m; i++)
	{
		scanf("%d %d", &u, &v);
		trafo[v].push_back(u);
		dp[u]++;
	}

	deque<int> fila;
	for(int i=1; i<=n; i++) if(!dp[i]) fila.push_back(i);
	int od = n;
	while(!fila.empty())
	{
		int u = fila.front(); fila.pop_front();
		order[--od] = u;
		// shuffle(ALL(trafo[u]), rng);
 
		for(int v : trafo[u])
			if(--dp[v] == 0)
				fila.push_back(v);
	}
	order[n] = -1;

	for(int u : order)
	{
		if(u == -1) break;
        best[u][0] = pii(0, u);
		int sz = 1;
		for(auto v : trafo[u]){
			for(auto [x, w] : best[v])
			{
				if(w == -1) break;
				best[u][sz++] = pii(x-1, w);
			}
			
			if(sz >= 3*SQRT)
			{
				sort(best[u], best[u]+sz);
				sz = min(SQRT, (int)(unique(best[u], best[u]+sz) - best[u]));
			}
		}
 
		sort(best[u], best[u]+sz);
		sz = min(SQRT, (int)(unique(best[u], best[u]+sz) - best[u]));
		best[u][sz] = pii(999999, -1);
	}
 
	int t, y;
	while(q--)
	{
		tempo++;
		scanf("%d %d", &t, &y);
 
		for(int i=0, x; i<y; i++)
		{
			scanf("%d", &x);
			block[x] = tempo;
		}
 
		int ans = -1;
 
		for(auto [x, w] : best[t]) 
		{
			if(w == -1) break;
			if(block[w] != tempo)
			{
				ans = -x;
				break;
			}
		}
 
		if(ans == -1) for(int u : order)
		{
			dp[u] = (block[u] == tempo ? -1 : 0);
	
			for(auto v : trafo[u])
				if(~dp[v]) 
					dp[u] = max(dp[u], dp[v]+1);
	
			if(u == t){ ans = dp[u]; break; }
		}
		
		printf("%d\n", ans);
	}
 
	return 0;	
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  scanf("%d %d %d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:70:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |   scanf("%d %d", &t, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:74:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |    scanf("%d", &x);
      |    ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 6 ms 7260 KB Output is correct
7 Correct 6 ms 7268 KB Output is correct
8 Correct 7 ms 7516 KB Output is correct
9 Correct 6 ms 7396 KB Output is correct
10 Correct 6 ms 7516 KB Output is correct
11 Correct 7 ms 7516 KB Output is correct
12 Correct 7 ms 7516 KB Output is correct
13 Correct 7 ms 7516 KB Output is correct
14 Correct 7 ms 7256 KB Output is correct
15 Correct 6 ms 7004 KB Output is correct
16 Correct 7 ms 7260 KB Output is correct
17 Correct 8 ms 7300 KB Output is correct
18 Correct 7 ms 7256 KB Output is correct
19 Correct 9 ms 7516 KB Output is correct
20 Correct 679 ms 10252 KB Output is correct
21 Correct 592 ms 10104 KB Output is correct
22 Correct 631 ms 10324 KB Output is correct
23 Correct 622 ms 10320 KB Output is correct
24 Correct 959 ms 467116 KB Output is correct
25 Correct 927 ms 466812 KB Output is correct
26 Correct 957 ms 467044 KB Output is correct
27 Correct 538 ms 483152 KB Output is correct
28 Correct 547 ms 483156 KB Output is correct
29 Correct 555 ms 482644 KB Output is correct
30 Correct 576 ms 483128 KB Output is correct
31 Correct 703 ms 481760 KB Output is correct
32 Correct 607 ms 482900 KB Output is correct
33 Correct 633 ms 455384 KB Output is correct
34 Correct 629 ms 449664 KB Output is correct
35 Correct 581 ms 454740 KB Output is correct
36 Correct 665 ms 469100 KB Output is correct
37 Correct 739 ms 465744 KB Output is correct
38 Correct 643 ms 469344 KB Output is correct

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 7 ms 7380 KB Output is correct
6 Correct 6 ms 7260 KB Output is correct
7 Correct 6 ms 7268 KB Output is correct
8 Correct 7 ms 7516 KB Output is correct
9 Correct 6 ms 7396 KB Output is correct
10 Correct 6 ms 7516 KB Output is correct
11 Correct 7 ms 7516 KB Output is correct
12 Correct 7 ms 7516 KB Output is correct
13 Correct 7 ms 7516 KB Output is correct
14 Correct 7 ms 7256 KB Output is correct
15 Correct 6 ms 7004 KB Output is correct
16 Correct 7 ms 7260 KB Output is correct
17 Correct 8 ms 7300 KB Output is correct
18 Correct 7 ms 7256 KB Output is correct
19 Correct 9 ms 7516 KB Output is correct
20 Correct 679 ms 10252 KB Output is correct
21 Correct 592 ms 10104 KB Output is correct
22 Correct 631 ms 10324 KB Output is correct
23 Correct 622 ms 10320 KB Output is correct
24 Correct 959 ms 467116 KB Output is correct
25 Correct 927 ms 466812 KB Output is correct
26 Correct 957 ms 467044 KB Output is correct
27 Correct 538 ms 483152 KB Output is correct
28 Correct 547 ms 483156 KB Output is correct
29 Correct 555 ms 482644 KB Output is correct
30 Correct 576 ms 483128 KB Output is correct
31 Correct 703 ms 481760 KB Output is correct
32 Correct 607 ms 482900 KB Output is correct
33 Correct 633 ms 455384 KB Output is correct
34 Correct 629 ms 449664 KB Output is correct
35 Correct 581 ms 454740 KB Output is correct
36 Correct 665 ms 469100 KB Output is correct
37 Correct 739 ms 465744 KB Output is correct
38 Correct 643 ms 469344 KB Output is correct
39 Correct 940 ms 467844 KB Output is correct
40 Correct 836 ms 467284 KB Output is correct
41 Correct 876 ms 467372 KB Output is correct
42 Correct 897 ms 467740 KB Output is correct
43 Correct 952 ms 467336 KB Output is correct
44 Correct 673 ms 11408 KB Output is correct
45 Correct 635 ms 10652 KB Output is correct
46 Correct 681 ms 10576 KB Output is correct
47 Correct 633 ms 10324 KB Output is correct
48 Correct 646 ms 10320 KB Output is correct
49 Correct 544 ms 483548 KB Output is correct
50 Correct 1095 ms 482780 KB Output is correct
51 Correct 544 ms 11008 KB Output is correct
52 Correct 852 ms 10460 KB Output is correct
53 Correct 741 ms 469420 KB Output is correct
54 Correct 736 ms 466280 KB Output is correct
55 Correct 1109 ms 468048 KB Output is correct
56 Correct 717 ms 465744 KB Output is correct
57 Correct 589 ms 11088 KB Output is correct
58 Correct 686 ms 11000 KB Output is correct
59 Correct 819 ms 10580 KB Output is correct
60 Correct 881 ms 10580 KB Output is correct
61 Correct 555 ms 482468 KB Output is correct
62 Correct 629 ms 468496 KB Output is correct
63 Correct 759 ms 465320 KB Output is correct
64 Correct 692 ms 482644 KB Output is correct
65 Correct 739 ms 468292 KB Output is correct
66 Correct 911 ms 465572 KB Output is correct
67 Correct 723 ms 482440 KB Output is correct
68 Correct 866 ms 468768 KB Output is correct
69 Correct 869 ms 464724 KB Output is correct
70 Correct 495 ms 482644 KB Output is correct
71 Correct 589 ms 468792 KB Output is correct
72 Correct 735 ms 465488 KB Output is correct
73 Correct 484 ms 482640 KB Output is correct
74 Correct 567 ms 468296 KB Output is correct
75 Correct 711 ms 465236 KB Output is correct
76 Correct 505 ms 484180 KB Output is correct
77 Correct 514 ms 483276 KB Output is correct
78 Correct 465 ms 483180 KB Output is correct
79 Correct 621 ms 11420 KB Output is correct
80 Correct 508 ms 10576 KB Output is correct
81 Correct 511 ms 10320 KB Output is correct
82 Correct 600 ms 484176 KB Output is correct
83 Correct 778 ms 482980 KB Output is correct
84 Correct 581 ms 483260 KB Output is correct
85 Correct 735 ms 481872 KB Output is correct
86 Correct 550 ms 483160 KB Output is correct
87 Correct 665 ms 482128 KB Output is correct
88 Correct 614 ms 11312 KB Output is correct
89 Correct 635 ms 11424 KB Output is correct
90 Correct 648 ms 10576 KB Output is correct
91 Correct 605 ms 10456 KB Output is correct
92 Correct 636 ms 10156 KB Output is correct
93 Correct 671 ms 10328 KB Output is correct
94 Correct 638 ms 456708 KB Output is correct
95 Correct 623 ms 450644 KB Output is correct
96 Correct 645 ms 455376 KB Output is correct
97 Correct 602 ms 450724 KB Output is correct
98 Correct 587 ms 455248 KB Output is correct
99 Correct 619 ms 450416 KB Output is correct
100 Correct 594 ms 11480 KB Output is correct
101 Correct 580 ms 11416 KB Output is correct
102 Correct 621 ms 10576 KB Output is correct
103 Correct 598 ms 10560 KB Output is correct
104 Correct 634 ms 10160 KB Output is correct
105 Correct 647 ms 10320 KB Output is correct
106 Correct 662 ms 470816 KB Output is correct
107 Correct 791 ms 467284 KB Output is correct
108 Correct 633 ms 469636 KB Output is correct
109 Correct 739 ms 465744 KB Output is correct
110 Correct 670 ms 469844 KB Output is correct
111 Correct 763 ms 466512 KB Output is correct
112 Correct 626 ms 11448 KB Output is correct
113 Correct 708 ms 11504 KB Output is correct
114 Correct 610 ms 10576 KB Output is correct
115 Correct 589 ms 10468 KB Output is correct
116 Correct 668 ms 10200 KB Output is correct
117 Correct 618 ms 10236 KB Output is correct
118 Execution timed out 2085 ms 483076 KB Time limit exceeded
119 Halted 0 ms 0 KB -