oj.uz

Submission #1031659

# Submission time Handle Problem Language Result Execution time Memory
1031659 2024-07-23T03:21:01 Z SamuellH12 Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 1078 ms 524288 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 = 200;
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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 7 ms 7772 KB Output is correct
6 Correct 6 ms 7700 KB Output is correct
7 Correct 7 ms 7772 KB Output is correct
8 Correct 8 ms 8640 KB Output is correct
9 Correct 8 ms 8796 KB Output is correct
10 Correct 9 ms 8796 KB Output is correct
11 Correct 9 ms 8568 KB Output is correct
12 Correct 8 ms 8048 KB Output is correct
13 Correct 9 ms 8540 KB Output is correct
14 Correct 9 ms 7772 KB Output is correct
15 Correct 6 ms 7436 KB Output is correct
16 Correct 9 ms 7772 KB Output is correct
17 Correct 10 ms 8076 KB Output is correct
18 Correct 7 ms 7512 KB Output is correct
19 Correct 10 ms 8264 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 7 ms 7772 KB Output is correct
6 Correct 6 ms 7700 KB Output is correct
7 Correct 7 ms 7772 KB Output is correct
8 Correct 8 ms 8640 KB Output is correct
9 Correct 8 ms 8796 KB Output is correct
10 Correct 9 ms 8796 KB Output is correct
11 Correct 9 ms 8568 KB Output is correct
12 Correct 8 ms 8048 KB Output is correct
13 Correct 9 ms 8540 KB Output is correct
14 Correct 9 ms 7772 KB Output is correct
15 Correct 6 ms 7436 KB Output is correct
16 Correct 9 ms 7772 KB Output is correct
17 Correct 10 ms 8076 KB Output is correct
18 Correct 7 ms 7512 KB Output is correct
19 Correct 10 ms 8264 KB Output is correct
20 Correct 982 ms 11348 KB Output is correct
21 Correct 801 ms 11236 KB Output is correct
22 Correct 949 ms 11216 KB Output is correct
23 Correct 875 ms 10324 KB Output is correct
24 Runtime error 1078 ms 524288 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 7 ms 7772 KB Output is correct
6 Correct 6 ms 7700 KB Output is correct
7 Correct 7 ms 7772 KB Output is correct
8 Correct 8 ms 8640 KB Output is correct
9 Correct 8 ms 8796 KB Output is correct
10 Correct 9 ms 8796 KB Output is correct
11 Correct 9 ms 8568 KB Output is correct
12 Correct 8 ms 8048 KB Output is correct
13 Correct 9 ms 8540 KB Output is correct
14 Correct 9 ms 7772 KB Output is correct
15 Correct 6 ms 7436 KB Output is correct
16 Correct 9 ms 7772 KB Output is correct
17 Correct 10 ms 8076 KB Output is correct
18 Correct 7 ms 7512 KB Output is correct
19 Correct 10 ms 8264 KB Output is correct
20 Correct 982 ms 11348 KB Output is correct
21 Correct 801 ms 11236 KB Output is correct
22 Correct 949 ms 11216 KB Output is correct
23 Correct 875 ms 10324 KB Output is correct
24 Runtime error 1078 ms 524288 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -