oj.uz

Submission #23604

# Submission time Handle Problem Language Result Execution time Memory
23604 2017-05-15T13:30:26 Z Hiasat Tropical Garden (IOI11_garden) C++14
69 / 100
 5000 ms 83744 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 38 ms 40440 KB Output is correct
2 Correct 37 ms 40568 KB Output is correct
3 Correct 37 ms 40572 KB Output is correct
4 Correct 37 ms 40316 KB Output is correct
5 Correct 36 ms 40260 KB Output is correct
6 Correct 38 ms 40568 KB Output is correct
7 Correct 37 ms 40312 KB Output is correct
8 Correct 38 ms 40536 KB Output is correct
9 Correct 28 ms 40924 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 40440 KB Output is correct
2 Correct 37 ms 40568 KB Output is correct
3 Correct 37 ms 40572 KB Output is correct
4 Correct 37 ms 40316 KB Output is correct
5 Correct 36 ms 40260 KB Output is correct
6 Correct 38 ms 40568 KB Output is correct
7 Correct 37 ms 40312 KB Output is correct
8 Correct 38 ms 40536 KB Output is correct
9 Correct 28 ms 40924 KB Output is correct
10 Correct 36 ms 40312 KB Output is correct
11 Correct 102 ms 46996 KB Output is correct
12 Correct 178 ms 52264 KB Output is correct
13 Correct 550 ms 65176 KB Output is correct
14 Correct 546 ms 80912 KB Output is correct
15 Correct 533 ms 81472 KB Output is correct
16 Correct 495 ms 68560 KB Output is correct
17 Correct 323 ms 64752 KB Output is correct
18 Correct 143 ms 51868 KB Output is correct
19 Correct 524 ms 79700 KB Output is correct
20 Correct 549 ms 80292 KB Output is correct
21 Correct 462 ms 68360 KB Output is correct
22 Correct 344 ms 64476 KB Output is correct
23 Correct 808 ms 83744 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 40440 KB Output is correct
2 Correct 37 ms 40568 KB Output is correct
3 Correct 37 ms 40572 KB Output is correct
4 Correct 37 ms 40316 KB Output is correct
5 Correct 36 ms 40260 KB Output is correct
6 Correct 38 ms 40568 KB Output is correct
7 Correct 37 ms 40312 KB Output is correct
8 Correct 38 ms 40536 KB Output is correct
9 Correct 28 ms 40924 KB Output is correct
10 Correct 36 ms 40312 KB Output is correct
11 Correct 102 ms 46996 KB Output is correct
12 Correct 178 ms 52264 KB Output is correct
13 Correct 550 ms 65176 KB Output is correct
14 Correct 546 ms 80912 KB Output is correct
15 Correct 533 ms 81472 KB Output is correct
16 Correct 495 ms 68560 KB Output is correct
17 Correct 323 ms 64752 KB Output is correct
18 Correct 143 ms 51868 KB Output is correct
19 Correct 524 ms 79700 KB Output is correct
20 Correct 549 ms 80292 KB Output is correct
21 Correct 462 ms 68360 KB Output is correct
22 Correct 344 ms 64476 KB Output is correct
23 Correct 808 ms 83744 KB Output is correct
24 Correct 51 ms 40352 KB Output is correct
25 Execution timed out 5068 ms 47000 KB Time limit exceeded
26 Halted 0 ms 0 KB -