oj.uz

Submission #1031665

# Submission time Handle Problem Language Result Execution time Memory
1031665 2024-07-23T03:28:20 Z SamuellH12 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 132688 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 = 30;
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 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 4 ms 3856 KB Output is correct
6 Correct 3 ms 3856 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 3 ms 3932 KB Output is correct
12 Correct 3 ms 3932 KB Output is correct
13 Correct 3 ms 3932 KB Output is correct
14 Correct 3 ms 3932 KB Output is correct
15 Correct 3 ms 3932 KB Output is correct
16 Correct 3 ms 3980 KB Output is correct
17 Correct 3 ms 3932 KB Output is correct
18 Correct 3 ms 4044 KB Output is correct
19 Correct 3 ms 3928 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 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 4 ms 3856 KB Output is correct
6 Correct 3 ms 3856 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 3 ms 3932 KB Output is correct
12 Correct 3 ms 3932 KB Output is correct
13 Correct 3 ms 3932 KB Output is correct
14 Correct 3 ms 3932 KB Output is correct
15 Correct 3 ms 3932 KB Output is correct
16 Correct 3 ms 3980 KB Output is correct
17 Correct 3 ms 3932 KB Output is correct
18 Correct 3 ms 4044 KB Output is correct
19 Correct 3 ms 3928 KB Output is correct
20 Correct 94 ms 6580 KB Output is correct
21 Correct 100 ms 6652 KB Output is correct
22 Correct 94 ms 6732 KB Output is correct
23 Correct 94 ms 6760 KB Output is correct
24 Correct 214 ms 130640 KB Output is correct
25 Correct 230 ms 130644 KB Output is correct
26 Correct 221 ms 130340 KB Output is correct
27 Correct 135 ms 130900 KB Output is correct
28 Correct 152 ms 130896 KB Output is correct
29 Correct 140 ms 130872 KB Output is correct
30 Correct 153 ms 130900 KB Output is correct
31 Correct 183 ms 130896 KB Output is correct
32 Correct 152 ms 130900 KB Output is correct
33 Correct 144 ms 130412 KB Output is correct
34 Correct 174 ms 130384 KB Output is correct
35 Correct 153 ms 130388 KB Output is correct
36 Correct 150 ms 130640 KB Output is correct
37 Correct 180 ms 130644 KB Output is correct
38 Correct 154 ms 130388 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 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 4 ms 3856 KB Output is correct
6 Correct 3 ms 3856 KB Output is correct
7 Correct 3 ms 3932 KB Output is correct
8 Correct 2 ms 3896 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 3 ms 3932 KB Output is correct
12 Correct 3 ms 3932 KB Output is correct
13 Correct 3 ms 3932 KB Output is correct
14 Correct 3 ms 3932 KB Output is correct
15 Correct 3 ms 3932 KB Output is correct
16 Correct 3 ms 3980 KB Output is correct
17 Correct 3 ms 3932 KB Output is correct
18 Correct 3 ms 4044 KB Output is correct
19 Correct 3 ms 3928 KB Output is correct
20 Correct 94 ms 6580 KB Output is correct
21 Correct 100 ms 6652 KB Output is correct
22 Correct 94 ms 6732 KB Output is correct
23 Correct 94 ms 6760 KB Output is correct
24 Correct 214 ms 130640 KB Output is correct
25 Correct 230 ms 130644 KB Output is correct
26 Correct 221 ms 130340 KB Output is correct
27 Correct 135 ms 130900 KB Output is correct
28 Correct 152 ms 130896 KB Output is correct
29 Correct 140 ms 130872 KB Output is correct
30 Correct 153 ms 130900 KB Output is correct
31 Correct 183 ms 130896 KB Output is correct
32 Correct 152 ms 130900 KB Output is correct
33 Correct 144 ms 130412 KB Output is correct
34 Correct 174 ms 130384 KB Output is correct
35 Correct 153 ms 130388 KB Output is correct
36 Correct 150 ms 130640 KB Output is correct
37 Correct 180 ms 130644 KB Output is correct
38 Correct 154 ms 130388 KB Output is correct
39 Correct 238 ms 132048 KB Output is correct
40 Correct 214 ms 131000 KB Output is correct
41 Correct 222 ms 130820 KB Output is correct
42 Correct 219 ms 130824 KB Output is correct
43 Correct 211 ms 130896 KB Output is correct
44 Correct 116 ms 8104 KB Output is correct
45 Correct 106 ms 7252 KB Output is correct
46 Correct 99 ms 7152 KB Output is correct
47 Correct 95 ms 6736 KB Output is correct
48 Correct 96 ms 6564 KB Output is correct
49 Correct 175 ms 131924 KB Output is correct
50 Correct 730 ms 130604 KB Output is correct
51 Correct 118 ms 7860 KB Output is correct
52 Correct 335 ms 6992 KB Output is correct
53 Correct 180 ms 131384 KB Output is correct
54 Correct 200 ms 131152 KB Output is correct
55 Correct 662 ms 130464 KB Output is correct
56 Correct 793 ms 130132 KB Output is correct
57 Correct 114 ms 7980 KB Output is correct
58 Correct 114 ms 7760 KB Output is correct
59 Correct 368 ms 6996 KB Output is correct
60 Correct 332 ms 7048 KB Output is correct
61 Correct 211 ms 130896 KB Output is correct
62 Correct 209 ms 130228 KB Output is correct
63 Correct 243 ms 130132 KB Output is correct
64 Correct 333 ms 130644 KB Output is correct
65 Correct 320 ms 130352 KB Output is correct
66 Correct 373 ms 130180 KB Output is correct
67 Correct 432 ms 130644 KB Output is correct
68 Correct 431 ms 130244 KB Output is correct
69 Correct 481 ms 130248 KB Output is correct
70 Correct 144 ms 130896 KB Output is correct
71 Correct 154 ms 130388 KB Output is correct
72 Correct 187 ms 130384 KB Output is correct
73 Correct 171 ms 130896 KB Output is correct
74 Correct 169 ms 130280 KB Output is correct
75 Correct 207 ms 130388 KB Output is correct
76 Correct 163 ms 132688 KB Output is correct
77 Correct 143 ms 131156 KB Output is correct
78 Correct 138 ms 131152 KB Output is correct
79 Correct 111 ms 8016 KB Output is correct
80 Correct 98 ms 6996 KB Output is correct
81 Correct 89 ms 6736 KB Output is correct
82 Correct 182 ms 132648 KB Output is correct
83 Correct 213 ms 132528 KB Output is correct
84 Correct 151 ms 131408 KB Output is correct
85 Correct 182 ms 131408 KB Output is correct
86 Correct 154 ms 131380 KB Output is correct
87 Correct 184 ms 131284 KB Output is correct
88 Correct 111 ms 8020 KB Output is correct
89 Correct 116 ms 8020 KB Output is correct
90 Correct 98 ms 6996 KB Output is correct
91 Correct 125 ms 7184 KB Output is correct
92 Correct 109 ms 6736 KB Output is correct
93 Correct 91 ms 6736 KB Output is correct
94 Correct 170 ms 131928 KB Output is correct
95 Correct 210 ms 131924 KB Output is correct
96 Correct 148 ms 130832 KB Output is correct
97 Correct 179 ms 130896 KB Output is correct
98 Correct 174 ms 130720 KB Output is correct
99 Correct 167 ms 130796 KB Output is correct
100 Correct 110 ms 8044 KB Output is correct
101 Correct 115 ms 8020 KB Output is correct
102 Correct 97 ms 6992 KB Output is correct
103 Correct 97 ms 7036 KB Output is correct
104 Correct 95 ms 6740 KB Output is correct
105 Correct 93 ms 6740 KB Output is correct
106 Correct 187 ms 132120 KB Output is correct
107 Correct 218 ms 131896 KB Output is correct
108 Correct 165 ms 130848 KB Output is correct
109 Correct 214 ms 130764 KB Output is correct
110 Correct 172 ms 130900 KB Output is correct
111 Correct 182 ms 130900 KB Output is correct
112 Correct 114 ms 8092 KB Output is correct
113 Correct 135 ms 8020 KB Output is correct
114 Correct 101 ms 7208 KB Output is correct
115 Correct 132 ms 7088 KB Output is correct
116 Correct 103 ms 6736 KB Output is correct
117 Correct 94 ms 6740 KB Output is correct
118 Execution timed out 2013 ms 130628 KB Time limit exceeded
119 Halted 0 ms 0 KB -