oj.uz

Submission #790428

# Submission time Handle Problem Language Result Execution time Memory
790428 2023-07-22T16:12:24 Z kilikuma Tropical Garden (IOI11_garden) C++14
69 / 100
 5000 ms 85168 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef pair<int, int> pii;
 
vector< pii > g[150001];
 
int dp[150001][2][31];
int last[150001][2][31];
 
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
	for (int i = 0; i < M; ++i) {
		g[R[i][0]].push_back(make_pair(R[i][1], i));
		g[R[i][1]].push_back(make_pair(R[i][0], i));
	}
	memset(dp, -1, sizeof dp);
 
	for (int i = 0 ; i < N ; i++) {
		if (g[i].size()) {
			dp[i][0][0] = dp[i][1][0] = g[i][0].first;
			last[i][0][0] = last[i][1][0] = g[i][0].second;
		}
		if (g[i].size() > 1) {
			dp[i][1][0] =  g[i][1].first;
			last[i][1][0] = g[i][1].second;
		}
	}
	for (int k = 1 ; k <= 30; k++)
		for (int i = 0 ; i < N ; i++) {
			for (int it = 0 ; it < 2 ; it++) {
				if (dp[i][it][k - 1] != -1) {
					int vv = dp[i][it][k - 1];
					int uu = last[i][it][k - 1];
					dp[i][it][k] = dp[vv][(g[vv][0].second == uu)][k - 1];
					last[i][it][k] = last[vv][(g[vv][0].second == uu)][k-1];
				}
			}
		}
	for(int i = 0 ; i < Q ; i++){
		int cnt = 0;
		for(int j = 0 ; j < N ; j++){
			int go = j;
			int ll = -1;
			int tmp = G[i];
 
			for(int k = 30 ; k >= 0;k--){
				if((1 << k) <= tmp){
					tmp -= (1 << k);
					int nw =dp[go][ll == g[go][0].second][k];
					ll = last[go][ll == g[go][0].second][k];
					go = nw;
				}
			}
			if(go == P)
				cnt++;
		}
		answer(cnt);
	}
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 40404 KB Output is correct
2 Correct 16 ms 40508 KB Output is correct
3 Correct 15 ms 40544 KB Output is correct
4 Correct 15 ms 40252 KB Output is correct
5 Correct 15 ms 40216 KB Output is correct
6 Correct 15 ms 40532 KB Output is correct
7 Correct 14 ms 40192 KB Output is correct
8 Correct 14 ms 40532 KB Output is correct
9 Correct 16 ms 40776 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 40404 KB Output is correct
2 Correct 16 ms 40508 KB Output is correct
3 Correct 15 ms 40544 KB Output is correct
4 Correct 15 ms 40252 KB Output is correct
5 Correct 15 ms 40216 KB Output is correct
6 Correct 15 ms 40532 KB Output is correct
7 Correct 14 ms 40192 KB Output is correct
8 Correct 14 ms 40532 KB Output is correct
9 Correct 16 ms 40776 KB Output is correct
10 Correct 15 ms 40268 KB Output is correct
11 Correct 39 ms 46900 KB Output is correct
12 Correct 83 ms 52160 KB Output is correct
13 Correct 262 ms 65108 KB Output is correct
14 Correct 237 ms 81024 KB Output is correct
15 Correct 246 ms 81712 KB Output is correct
16 Correct 203 ms 69748 KB Output is correct
17 Correct 152 ms 65860 KB Output is correct
18 Correct 69 ms 52040 KB Output is correct
19 Correct 249 ms 81020 KB Output is correct
20 Correct 266 ms 81692 KB Output is correct
21 Correct 187 ms 69624 KB Output is correct
22 Correct 152 ms 65700 KB Output is correct
23 Correct 392 ms 85168 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 40404 KB Output is correct
2 Correct 16 ms 40508 KB Output is correct
3 Correct 15 ms 40544 KB Output is correct
4 Correct 15 ms 40252 KB Output is correct
5 Correct 15 ms 40216 KB Output is correct
6 Correct 15 ms 40532 KB Output is correct
7 Correct 14 ms 40192 KB Output is correct
8 Correct 14 ms 40532 KB Output is correct
9 Correct 16 ms 40776 KB Output is correct
10 Correct 15 ms 40268 KB Output is correct
11 Correct 39 ms 46900 KB Output is correct
12 Correct 83 ms 52160 KB Output is correct
13 Correct 262 ms 65108 KB Output is correct
14 Correct 237 ms 81024 KB Output is correct
15 Correct 246 ms 81712 KB Output is correct
16 Correct 203 ms 69748 KB Output is correct
17 Correct 152 ms 65860 KB Output is correct
18 Correct 69 ms 52040 KB Output is correct
19 Correct 249 ms 81020 KB Output is correct
20 Correct 266 ms 81692 KB Output is correct
21 Correct 187 ms 69624 KB Output is correct
22 Correct 152 ms 65700 KB Output is correct
23 Correct 392 ms 85168 KB Output is correct
24 Correct 28 ms 40284 KB Output is correct
25 Execution timed out 5032 ms 46932 KB Time limit exceeded
26 Halted 0 ms 0 KB -