oj.uz

Submission #1031613

# Submission time Handle Problem Language Result Execution time Memory
1031613 2024-07-23T02:40:39 Z SamuellH12 Bitaro’s Party (JOI18_bitaro) C++17
7 / 100
 2000 ms 15136 KB 
#include <bits/stdc++.h>
#define ALL(x) x.begin(), x.end()
#define pii pair<int,int>
const int MAXN = 1e5 + 1;
const int SQRT = 316;
using namespace std;

int block[MAXN], dp[MAXN], order[MAXN], tempo;
vector<int> trafo[MAXN];
vector<pii> best[MAXN];
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].push_back(pii(0, u));
		for(auto v : trafo[u]){
			for(auto [x, w] : best[v])
				best[u].push_back(pii(x-1, w));
			
			if(best[u].size() >= 700)
			{
				sort(ALL(best[u]));
				best[u].resize(min(SQRT, (int)(unique(ALL(best[u])) - best[u].begin())));
			}
		}
 
		sort(ALL(best[u]));
		best[u].resize(min(SQRT, (int)(unique(ALL(best[u])) - best[u].begin())));
	}
 
	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(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:16:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |  scanf("%d %d %d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:63:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |   scanf("%d %d", &t, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:67:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |    scanf("%d", &x);
      |    ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 9 ms 6968 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 7 ms 6476 KB Output is correct
8 Correct 21 ms 11356 KB Output is correct
9 Correct 21 ms 11420 KB Output is correct
10 Correct 21 ms 11356 KB Output is correct
11 Correct 29 ms 10812 KB Output is correct
12 Correct 15 ms 8028 KB Output is correct
13 Correct 23 ms 10844 KB Output is correct
14 Correct 16 ms 8024 KB Output is correct
15 Correct 9 ms 6492 KB Output is correct
16 Correct 16 ms 8280 KB Output is correct
17 Correct 18 ms 9304 KB Output is correct
18 Correct 11 ms 7280 KB Output is correct
19 Correct 19 ms 9544 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 9 ms 6968 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 7 ms 6476 KB Output is correct
8 Correct 21 ms 11356 KB Output is correct
9 Correct 21 ms 11420 KB Output is correct
10 Correct 21 ms 11356 KB Output is correct
11 Correct 29 ms 10812 KB Output is correct
12 Correct 15 ms 8028 KB Output is correct
13 Correct 23 ms 10844 KB Output is correct
14 Correct 16 ms 8024 KB Output is correct
15 Correct 9 ms 6492 KB Output is correct
16 Correct 16 ms 8280 KB Output is correct
17 Correct 18 ms 9304 KB Output is correct
18 Correct 11 ms 7280 KB Output is correct
19 Correct 19 ms 9544 KB Output is correct
20 Execution timed out 2052 ms 15136 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 9 ms 6968 KB Output is correct
6 Correct 7 ms 6492 KB Output is correct
7 Correct 7 ms 6476 KB Output is correct
8 Correct 21 ms 11356 KB Output is correct
9 Correct 21 ms 11420 KB Output is correct
10 Correct 21 ms 11356 KB Output is correct
11 Correct 29 ms 10812 KB Output is correct
12 Correct 15 ms 8028 KB Output is correct
13 Correct 23 ms 10844 KB Output is correct
14 Correct 16 ms 8024 KB Output is correct
15 Correct 9 ms 6492 KB Output is correct
16 Correct 16 ms 8280 KB Output is correct
17 Correct 18 ms 9304 KB Output is correct
18 Correct 11 ms 7280 KB Output is correct
19 Correct 19 ms 9544 KB Output is correct
20 Execution timed out 2052 ms 15136 KB Time limit exceeded
21 Halted 0 ms 0 KB -