oj.uz

Submission #1031667

# Submission time Handle Problem Language Result Execution time Memory
1031667 2024-07-23T03:29:45 Z SamuellH12 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 403024 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 = 100;
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][5*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, sz=0;
 
		for(auto [x, w] : best[t]) 
		{
			if(w == -1) break;
			sz++;
			if(block[w] != tempo)
			{
				ans = -x;
				break;
			}
		}
 
		if(ans == -1 && sz >= SQRT) 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2624 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 6 ms 6748 KB Output is correct
6 Correct 5 ms 6748 KB Output is correct
7 Correct 5 ms 6804 KB Output is correct
8 Correct 5 ms 6748 KB Output is correct
9 Correct 6 ms 6748 KB Output is correct
10 Correct 5 ms 6748 KB Output is correct
11 Correct 6 ms 6748 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 6 ms 6748 KB Output is correct
14 Correct 5 ms 6748 KB Output is correct
15 Correct 5 ms 6748 KB Output is correct
16 Correct 6 ms 6776 KB Output is correct
17 Correct 5 ms 6636 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2624 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 6 ms 6748 KB Output is correct
6 Correct 5 ms 6748 KB Output is correct
7 Correct 5 ms 6804 KB Output is correct
8 Correct 5 ms 6748 KB Output is correct
9 Correct 6 ms 6748 KB Output is correct
10 Correct 5 ms 6748 KB Output is correct
11 Correct 6 ms 6748 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 6 ms 6748 KB Output is correct
14 Correct 5 ms 6748 KB Output is correct
15 Correct 5 ms 6748 KB Output is correct
16 Correct 6 ms 6776 KB Output is correct
17 Correct 5 ms 6636 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct
20 Correct 356 ms 7828 KB Output is correct
21 Correct 328 ms 7788 KB Output is correct
22 Correct 361 ms 8020 KB Output is correct
23 Correct 374 ms 8156 KB Output is correct
24 Correct 604 ms 402024 KB Output is correct
25 Correct 618 ms 402000 KB Output is correct
26 Correct 661 ms 401884 KB Output is correct
27 Correct 372 ms 402260 KB Output is correct
28 Correct 352 ms 402324 KB Output is correct
29 Correct 360 ms 402092 KB Output is correct
30 Correct 413 ms 402492 KB Output is correct
31 Correct 488 ms 402516 KB Output is correct
32 Correct 390 ms 402196 KB Output is correct
33 Correct 406 ms 402000 KB Output is correct
34 Correct 452 ms 401744 KB Output is correct
35 Correct 440 ms 402004 KB Output is correct
36 Correct 424 ms 401908 KB Output is correct
37 Correct 555 ms 402056 KB Output is correct
38 Correct 438 ms 401748 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2624 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 6 ms 6748 KB Output is correct
6 Correct 5 ms 6748 KB Output is correct
7 Correct 5 ms 6804 KB Output is correct
8 Correct 5 ms 6748 KB Output is correct
9 Correct 6 ms 6748 KB Output is correct
10 Correct 5 ms 6748 KB Output is correct
11 Correct 6 ms 6748 KB Output is correct
12 Correct 6 ms 6748 KB Output is correct
13 Correct 6 ms 6748 KB Output is correct
14 Correct 5 ms 6748 KB Output is correct
15 Correct 5 ms 6748 KB Output is correct
16 Correct 6 ms 6776 KB Output is correct
17 Correct 5 ms 6636 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 6 ms 6748 KB Output is correct
20 Correct 356 ms 7828 KB Output is correct
21 Correct 328 ms 7788 KB Output is correct
22 Correct 361 ms 8020 KB Output is correct
23 Correct 374 ms 8156 KB Output is correct
24 Correct 604 ms 402024 KB Output is correct
25 Correct 618 ms 402000 KB Output is correct
26 Correct 661 ms 401884 KB Output is correct
27 Correct 372 ms 402260 KB Output is correct
28 Correct 352 ms 402324 KB Output is correct
29 Correct 360 ms 402092 KB Output is correct
30 Correct 413 ms 402492 KB Output is correct
31 Correct 488 ms 402516 KB Output is correct
32 Correct 390 ms 402196 KB Output is correct
33 Correct 406 ms 402000 KB Output is correct
34 Correct 452 ms 401744 KB Output is correct
35 Correct 440 ms 402004 KB Output is correct
36 Correct 424 ms 401908 KB Output is correct
37 Correct 555 ms 402056 KB Output is correct
38 Correct 438 ms 401748 KB Output is correct
39 Correct 648 ms 402256 KB Output is correct
40 Correct 609 ms 402136 KB Output is correct
41 Correct 631 ms 402132 KB Output is correct
42 Correct 705 ms 402000 KB Output is correct
43 Correct 664 ms 402152 KB Output is correct
44 Correct 412 ms 8308 KB Output is correct
45 Correct 389 ms 7988 KB Output is correct
46 Correct 365 ms 8020 KB Output is correct
47 Correct 401 ms 8016 KB Output is correct
48 Correct 395 ms 7980 KB Output is correct
49 Correct 433 ms 402624 KB Output is correct
50 Correct 919 ms 402124 KB Output is correct
51 Correct 363 ms 8276 KB Output is correct
52 Correct 572 ms 8020 KB Output is correct
53 Correct 459 ms 402260 KB Output is correct
54 Correct 521 ms 401744 KB Output is correct
55 Correct 944 ms 401848 KB Output is correct
56 Correct 541 ms 401536 KB Output is correct
57 Correct 410 ms 8436 KB Output is correct
58 Correct 387 ms 8212 KB Output is correct
59 Correct 615 ms 8016 KB Output is correct
60 Correct 628 ms 8008 KB Output is correct
61 Correct 402 ms 402000 KB Output is correct
62 Correct 467 ms 401620 KB Output is correct
63 Correct 576 ms 401692 KB Output is correct
64 Correct 526 ms 402076 KB Output is correct
65 Correct 586 ms 401492 KB Output is correct
66 Correct 718 ms 401532 KB Output is correct
67 Correct 664 ms 402308 KB Output is correct
68 Correct 724 ms 401500 KB Output is correct
69 Correct 803 ms 401484 KB Output is correct
70 Correct 370 ms 402004 KB Output is correct
71 Correct 452 ms 401600 KB Output is correct
72 Correct 540 ms 401488 KB Output is correct
73 Correct 394 ms 401920 KB Output is correct
74 Correct 446 ms 401536 KB Output is correct
75 Correct 537 ms 401492 KB Output is correct
76 Correct 367 ms 403024 KB Output is correct
77 Correct 373 ms 402256 KB Output is correct
78 Correct 354 ms 402360 KB Output is correct
79 Correct 367 ms 8232 KB Output is correct
80 Correct 378 ms 8024 KB Output is correct
81 Correct 356 ms 7912 KB Output is correct
82 Correct 417 ms 402896 KB Output is correct
83 Correct 541 ms 402900 KB Output is correct
84 Correct 402 ms 402428 KB Output is correct
85 Correct 478 ms 402516 KB Output is correct
86 Correct 412 ms 402384 KB Output is correct
87 Correct 517 ms 402516 KB Output is correct
88 Correct 416 ms 8276 KB Output is correct
89 Correct 441 ms 8272 KB Output is correct
90 Correct 377 ms 8020 KB Output is correct
91 Correct 436 ms 7892 KB Output is correct
92 Correct 380 ms 8016 KB Output is correct
93 Correct 380 ms 8020 KB Output is correct
94 Correct 427 ms 402260 KB Output is correct
95 Correct 448 ms 402260 KB Output is correct
96 Correct 425 ms 402016 KB Output is correct
97 Correct 440 ms 401776 KB Output is correct
98 Correct 421 ms 401788 KB Output is correct
99 Correct 438 ms 401748 KB Output is correct
100 Correct 400 ms 8188 KB Output is correct
101 Correct 390 ms 8272 KB Output is correct
102 Correct 380 ms 8044 KB Output is correct
103 Correct 390 ms 8032 KB Output is correct
104 Correct 377 ms 7808 KB Output is correct
105 Correct 397 ms 8084 KB Output is correct
106 Correct 493 ms 402516 KB Output is correct
107 Correct 590 ms 402260 KB Output is correct
108 Correct 476 ms 402000 KB Output is correct
109 Correct 516 ms 401892 KB Output is correct
110 Correct 442 ms 401944 KB Output is correct
111 Correct 521 ms 402000 KB Output is correct
112 Correct 421 ms 8456 KB Output is correct
113 Correct 436 ms 8260 KB Output is correct
114 Correct 412 ms 7896 KB Output is correct
115 Correct 428 ms 8016 KB Output is correct
116 Correct 369 ms 8016 KB Output is correct
117 Correct 402 ms 8016 KB Output is correct
118 Execution timed out 2069 ms 402116 KB Time limit exceeded
119 Halted 0 ms 0 KB -