oj.uz

답안 #236856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236856 2020-06-03T15:12:25 Z kostia244 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
69 / 100
 5000 ms 38392 KB 
#include "garden.h"
#include "gardenlib.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 300500, mlg = 30;
int up[mlg][maxn], cnt[maxn];
void count_routes(int n, int m, int P, int R[][2], int Q, int G[]) {
	memset(cnt, 0, sizeof cnt);
	memset(up, -1, sizeof up);
	for(int i = 0; i < m; i++) {
		int f = R[i][0], t = R[i][1];
		//cout << f << " " << t << " " << i << '\n';
		if(cnt[f] < 2) up[0][2*f + cnt[f]] = 2*t + (cnt[t]==0);//, cout << 2*f + cnt[f] << " -- " << 2*t + (cnt[t]==0) << '\n';
		if(cnt[t] < 2) up[0][2*t + cnt[t]]= 2*f + (cnt[f]==0);//, cout << 2*t + cnt[t] << " -- " << 2*f + (cnt[f]==0) << '\n';
		cnt[f]++, cnt[t]++;
	}
	for(int i = 0; i < 2*n; i++) if(up[0][i] < 0) up[0][i] = up[0][i^1];
	for(int i = 1; i < mlg; i++)
		for(int j = 0; j < 2*n; j++)
			up[i][j] = up[i-1][up[i-1][j]];
	//for(int i = 0; i < 2*n; i++) cout << i << " = " << up[i][0] << "\n";
	for(int I = 0; I < Q; I++) {
		//cout << P << " " << G[I] << '\n';
		int ans = 0;
		for(int i = 0; i < 2*n; i+=2) cnt[i] = i;
		for(int i = 0; i < mlg; i++) {
			if(!((G[I]>>i)&1)) continue;
			for(int j = 0; j < 2*n; j+=2) {
				cnt[j] = up[i][cnt[j]];
			}
		}
		for(int i = 0; i < 2*n; i+=2) ans += cnt[i] == 2*P || cnt[i] == 2*P+1;
		answer(ans);
	}
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 36864 KB Output is correct
2 Correct 24 ms 36856 KB Output is correct
3 Correct 23 ms 36864 KB Output is correct
4 Correct 23 ms 36864 KB Output is correct
5 Correct 24 ms 36736 KB Output is correct
6 Correct 24 ms 36856 KB Output is correct
7 Correct 23 ms 36864 KB Output is correct
8 Correct 23 ms 36864 KB Output is correct
9 Correct 25 ms 36864 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 36864 KB Output is correct
2 Correct 24 ms 36856 KB Output is correct
3 Correct 23 ms 36864 KB Output is correct
4 Correct 23 ms 36864 KB Output is correct
5 Correct 24 ms 36736 KB Output is correct
6 Correct 24 ms 36856 KB Output is correct
7 Correct 23 ms 36864 KB Output is correct
8 Correct 23 ms 36864 KB Output is correct
9 Correct 25 ms 36864 KB Output is correct
10 Correct 23 ms 36864 KB Output is correct
11 Correct 30 ms 37260 KB Output is correct
12 Correct 40 ms 37496 KB Output is correct
13 Correct 49 ms 37752 KB Output is correct
14 Correct 71 ms 38368 KB Output is correct
15 Correct 75 ms 38264 KB Output is correct
16 Correct 66 ms 38264 KB Output is correct
17 Correct 64 ms 38264 KB Output is correct
18 Correct 40 ms 37496 KB Output is correct
19 Correct 71 ms 38264 KB Output is correct
20 Correct 72 ms 38264 KB Output is correct
21 Correct 65 ms 38264 KB Output is correct
22 Correct 65 ms 38264 KB Output is correct
23 Correct 74 ms 38264 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 36864 KB Output is correct
2 Correct 24 ms 36856 KB Output is correct
3 Correct 23 ms 36864 KB Output is correct
4 Correct 23 ms 36864 KB Output is correct
5 Correct 24 ms 36736 KB Output is correct
6 Correct 24 ms 36856 KB Output is correct
7 Correct 23 ms 36864 KB Output is correct
8 Correct 23 ms 36864 KB Output is correct
9 Correct 25 ms 36864 KB Output is correct
10 Correct 23 ms 36864 KB Output is correct
11 Correct 30 ms 37260 KB Output is correct
12 Correct 40 ms 37496 KB Output is correct
13 Correct 49 ms 37752 KB Output is correct
14 Correct 71 ms 38368 KB Output is correct
15 Correct 75 ms 38264 KB Output is correct
16 Correct 66 ms 38264 KB Output is correct
17 Correct 64 ms 38264 KB Output is correct
18 Correct 40 ms 37496 KB Output is correct
19 Correct 71 ms 38264 KB Output is correct
20 Correct 72 ms 38264 KB Output is correct
21 Correct 65 ms 38264 KB Output is correct
22 Correct 65 ms 38264 KB Output is correct
23 Correct 74 ms 38264 KB Output is correct
24 Correct 25 ms 36864 KB Output is correct
25 Correct 447 ms 37368 KB Output is correct
26 Correct 798 ms 37624 KB Output is correct
27 Correct 2676 ms 37880 KB Output is correct
28 Correct 4010 ms 38228 KB Output is correct
29 Correct 4075 ms 38368 KB Output is correct
30 Correct 2704 ms 38264 KB Output is correct
31 Correct 2191 ms 38184 KB Output is correct
32 Correct 790 ms 37520 KB Output is correct
33 Correct 3990 ms 38240 KB Output is correct
34 Correct 4117 ms 38272 KB Output is correct
35 Correct 2863 ms 38180 KB Output is correct
36 Correct 2393 ms 38176 KB Output is correct
37 Correct 4779 ms 38392 KB Output is correct
38 Execution timed out 5056 ms 38264 KB Time limit exceeded