oj.uz

Submission #1031653

# Submission time Handle Problem Language Result Execution time Memory
1031653 2024-07-23T03:15:21 Z SamuellH12 Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 2000 ms 209836 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 = 25;
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][10*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 >= 9*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

# 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 3 ms 4884 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 3 ms 4792 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4764 KB Output is correct
14 Correct 3 ms 4696 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 3 ms 4696 KB Output is correct
17 Correct 3 ms 4700 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 3 ms 4700 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 3 ms 4884 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 3 ms 4792 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4764 KB Output is correct
14 Correct 3 ms 4696 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 3 ms 4696 KB Output is correct
17 Correct 3 ms 4700 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 146 ms 7060 KB Output is correct
21 Correct 125 ms 6996 KB Output is correct
22 Correct 139 ms 6912 KB Output is correct
23 Correct 137 ms 7000 KB Output is correct
24 Correct 228 ms 207952 KB Output is correct
25 Correct 220 ms 207956 KB Output is correct
26 Correct 208 ms 207716 KB Output is correct
27 Correct 173 ms 208208 KB Output is correct
28 Correct 163 ms 208212 KB Output is correct
29 Correct 167 ms 207952 KB Output is correct
30 Correct 190 ms 208312 KB Output is correct
31 Correct 208 ms 208356 KB Output is correct
32 Correct 176 ms 208204 KB Output is correct
33 Correct 182 ms 207696 KB Output is correct
34 Correct 192 ms 207696 KB Output is correct
35 Correct 177 ms 207636 KB Output is correct
36 Correct 173 ms 207860 KB Output is correct
37 Correct 202 ms 207700 KB Output is correct
38 Correct 168 ms 207636 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 3 ms 4884 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 3 ms 4792 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 3 ms 4764 KB Output is correct
14 Correct 3 ms 4696 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 3 ms 4696 KB Output is correct
17 Correct 3 ms 4700 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 146 ms 7060 KB Output is correct
21 Correct 125 ms 6996 KB Output is correct
22 Correct 139 ms 6912 KB Output is correct
23 Correct 137 ms 7000 KB Output is correct
24 Correct 228 ms 207952 KB Output is correct
25 Correct 220 ms 207956 KB Output is correct
26 Correct 208 ms 207716 KB Output is correct
27 Correct 173 ms 208208 KB Output is correct
28 Correct 163 ms 208212 KB Output is correct
29 Correct 167 ms 207952 KB Output is correct
30 Correct 190 ms 208312 KB Output is correct
31 Correct 208 ms 208356 KB Output is correct
32 Correct 176 ms 208204 KB Output is correct
33 Correct 182 ms 207696 KB Output is correct
34 Correct 192 ms 207696 KB Output is correct
35 Correct 177 ms 207636 KB Output is correct
36 Correct 173 ms 207860 KB Output is correct
37 Correct 202 ms 207700 KB Output is correct
38 Correct 168 ms 207636 KB Output is correct
39 Correct 253 ms 208720 KB Output is correct
40 Correct 224 ms 208276 KB Output is correct
41 Correct 231 ms 208212 KB Output is correct
42 Correct 226 ms 208212 KB Output is correct
43 Correct 218 ms 208192 KB Output is correct
44 Correct 161 ms 7764 KB Output is correct
45 Correct 150 ms 7224 KB Output is correct
46 Correct 146 ms 7404 KB Output is correct
47 Correct 143 ms 7032 KB Output is correct
48 Correct 142 ms 6996 KB Output is correct
49 Correct 224 ms 208724 KB Output is correct
50 Correct 766 ms 207952 KB Output is correct
51 Correct 167 ms 7536 KB Output is correct
52 Correct 380 ms 7248 KB Output is correct
53 Correct 199 ms 208012 KB Output is correct
54 Correct 222 ms 207956 KB Output is correct
55 Correct 657 ms 207444 KB Output is correct
56 Correct 815 ms 207360 KB Output is correct
57 Correct 175 ms 7984 KB Output is correct
58 Correct 161 ms 7520 KB Output is correct
59 Correct 426 ms 7504 KB Output is correct
60 Correct 404 ms 7140 KB Output is correct
61 Correct 226 ms 207956 KB Output is correct
62 Correct 225 ms 207444 KB Output is correct
63 Correct 257 ms 207444 KB Output is correct
64 Correct 346 ms 207956 KB Output is correct
65 Correct 325 ms 207400 KB Output is correct
66 Correct 362 ms 207424 KB Output is correct
67 Correct 466 ms 207700 KB Output is correct
68 Correct 443 ms 207700 KB Output is correct
69 Correct 525 ms 207428 KB Output is correct
70 Correct 180 ms 207952 KB Output is correct
71 Correct 175 ms 207408 KB Output is correct
72 Correct 204 ms 207548 KB Output is correct
73 Correct 195 ms 207956 KB Output is correct
74 Correct 189 ms 207524 KB Output is correct
75 Correct 233 ms 207444 KB Output is correct
76 Correct 203 ms 209492 KB Output is correct
77 Correct 171 ms 208468 KB Output is correct
78 Correct 171 ms 208468 KB Output is correct
79 Correct 160 ms 7764 KB Output is correct
80 Correct 145 ms 7152 KB Output is correct
81 Correct 137 ms 6924 KB Output is correct
82 Correct 212 ms 209444 KB Output is correct
83 Correct 230 ms 209060 KB Output is correct
84 Correct 187 ms 208468 KB Output is correct
85 Correct 218 ms 208664 KB Output is correct
86 Correct 191 ms 209236 KB Output is correct
87 Correct 205 ms 209408 KB Output is correct
88 Correct 160 ms 8532 KB Output is correct
89 Correct 160 ms 8604 KB Output is correct
90 Correct 144 ms 7760 KB Output is correct
91 Correct 139 ms 7836 KB Output is correct
92 Correct 142 ms 7568 KB Output is correct
93 Correct 138 ms 7496 KB Output is correct
94 Correct 212 ms 209748 KB Output is correct
95 Correct 221 ms 209488 KB Output is correct
96 Correct 179 ms 208720 KB Output is correct
97 Correct 193 ms 208724 KB Output is correct
98 Correct 185 ms 208724 KB Output is correct
99 Correct 187 ms 208720 KB Output is correct
100 Correct 139 ms 8532 KB Output is correct
101 Correct 160 ms 8788 KB Output is correct
102 Correct 141 ms 7764 KB Output is correct
103 Correct 137 ms 7848 KB Output is correct
104 Correct 138 ms 7504 KB Output is correct
105 Correct 141 ms 7604 KB Output is correct
106 Correct 212 ms 209836 KB Output is correct
107 Correct 225 ms 209732 KB Output is correct
108 Correct 187 ms 208720 KB Output is correct
109 Correct 206 ms 208724 KB Output is correct
110 Correct 178 ms 208872 KB Output is correct
111 Correct 205 ms 208976 KB Output is correct
112 Correct 160 ms 8788 KB Output is correct
113 Correct 161 ms 8532 KB Output is correct
114 Correct 137 ms 7764 KB Output is correct
115 Correct 147 ms 7760 KB Output is correct
116 Correct 140 ms 7504 KB Output is correct
117 Correct 140 ms 7508 KB Output is correct
118 Execution timed out 2071 ms 208732 KB Time limit exceeded
119 Halted 0 ms 0 KB -