oj.uz

답안 #385796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385796 2021-04-05T00:53:18 Z antimirage 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
100 / 100
 2674 ms 23020 KB 
#include "gardenlib.h"
#include "garden.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
 
#define fr first
#define sc second
#define mk make_pair
#define pb emplace_back
#define all(s) s.begin(), s.end()
 
using namespace std;
 
const int SZ = 200005;
 
long long n, m, p, q, k[SZ], edges[SZ][2], used[SZ][2], mn[SZ][2], last, go[2], lst, dp[SZ][2][2];
 
void dfs (int v, int type)
{
	used[v][type] = 1;
	
	int to_type;
	
	if (type == 0 || mn[v][1] == -1)
	{
		to_type = (mn[ mn[v][0] ][0] == v ? 1 : 0);
		
		if (mn[v][0] == p)
		{
			if ( to_type == 1 )
				dp[v][type][1] = 1,
				dp[v][type][0] = dp[p][1][0] + 1;
			else
				dp[v][type][0] = 1,
				dp[v][type][1] = dp[p][0][1] + 1;
			
			return;
		}
		if ( to_type == 1 && used[ mn[v][0] ][1] == 0 )
			dfs( mn[v][0], 1);
			
		else if ( used[ mn[v][0] ][0] == 0 )
			dfs( mn[v][0], 0);
			
		dp[v][type][0] = dp[ mn[v][0] ][to_type][0] + 1,
		dp[v][type][1] = dp[ mn[v][0] ][to_type][1] + 1;
	}
	else
	{
		to_type = (mn[ mn[v][1] ][0] == v ? 1 : 0);
		
		if (mn[v][1] == p)
		{
			if ( to_type == 1 )
				dp[v][type][1] = 1,
				dp[v][type][0] = dp[p][1][0] + 1;
			else
				dp[v][type][0] = 1,
				dp[v][type][1] = dp[p][0][1] + 1;
				
			return;
		}
		
		if ( to_type == 1 && used[ mn[v][1] ][1] == 0 )
			dfs( mn[v][1], 1);
		
		else if ( used[ mn[v][1] ][0] == 0 ) 
			dfs( mn[v][1], 0);
		
		dp[v][type][0] = dp[ mn[v][1] ][to_type][0] + 1,
		dp[v][type][1] = dp[ mn[v][1] ][to_type][1] + 1;
	}
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
	memset(mn, -1, sizeof(mn) );
	n = N, m = M, p = P;
	
	for (int i = 0; i < n; i++) 
		for (int j = 0; j < 2; j++)
			for (int k = 0; k < 2; k++)
				dp[i][j][k] = 1e12;
	
	for (int i = 0; i < m; i++)
	{
		edges[i][0] = R[i][0], edges[i][1] = R[i][1]; 
		
		if ( mn[ edges[i][0] ][0] == -1 ) mn[ edges[i][0] ][0] = edges[i][1];
		else if ( mn[ edges[i][0] ][1] == -1 ) mn[ edges[i][0] ][1] = edges[i][1];
		
		if ( mn[ edges[i][1] ][0] == -1 ) mn[ edges[i][1] ][0] = edges[i][0];
		else if ( mn[ edges[i][1] ][1] == -1 ) mn[ edges[i][1] ][1] = edges[i][0];
	}
	q = Q;
	for (int i = 0; i < q; i++)
		k[i] = G[i];
	
	dfs(p, 0);
	dfs(p, 1);
 
	for (int i = 0; i < n; i++)
		if (!used[i][0]) dfs(i, 0);
		
	if ( dp[p][0][0] < dp[p][0][1] ) go[0] = 0;
	else go[0] = 1;
	
	if ( dp[p][1][0] < dp[p][1][1] ) go[1] = 0;
	else go[1] = 1;
	
	for (int i = 0; i < q; i++)
	{
		long long ans = 0, sup;
		
		for (int j = 0; j < n; j++)
		{
			if ( min( dp[j][0][0], dp[j][0][1] ) > k[i] ) continue;
			
			if ( dp[j][0][0] < dp[j][0][1] )
			{
				sup = k[i] - dp[j][0][0];
				
				if (sup == 0) {
					ans++;
					continue;
				}
				if (go[0] == 0 && sup % dp[p][0][0] == 0)
					ans++;
				else if (go[0] == 1)
				{
					 if ( go[1] == 0 && (sup % (dp[p][1][0] + dp[p][0][1]) == 0 || sup % (dp[p][1][0] + dp[p][0][1]) == dp[p][0][1] ) )
						ans++;
					 else if ( (sup - dp[p][0][1]) % dp[p][1][1] == 0 )
						ans++;
				}
			}
			else
			{
				sup = k[i] - dp[j][0][1];
				
				if (sup == 0){
					ans++;
					continue;
				}	
				if (go[1] == 1 && sup % dp[p][1][1] == 0)
					ans++;
				else if (go[1] == 0 )
				{
					if (go[0] == 1 && (sup % (dp[p][1][0] + dp[p][0][1]) == 0 || sup % (dp[p][1][0] + dp[p][0][1]) == dp[p][1][0]  ) )
						ans++;
					else if ( (sup - dp[p][1][0]) % dp[p][0][0] == 0 )
						ans++;
				}
			}
		}
		answer(ans);
	}
}
/**
6 6 0
1 2
0 1
0 3
3 4
4 5
1 5
1
3
**/

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3564 KB Output is correct
6 Correct 3 ms 3564 KB Output is correct
7 Correct 3 ms 3564 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 4 ms 3820 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3564 KB Output is correct
6 Correct 3 ms 3564 KB Output is correct
7 Correct 3 ms 3564 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 4 ms 3820 KB Output is correct
10 Correct 3 ms 3564 KB Output is correct
11 Correct 9 ms 5612 KB Output is correct
12 Correct 17 ms 7276 KB Output is correct
13 Correct 33 ms 18428 KB Output is correct
14 Correct 47 ms 14832 KB Output is correct
15 Correct 47 ms 15084 KB Output is correct
16 Correct 40 ms 12652 KB Output is correct
17 Correct 39 ms 11884 KB Output is correct
18 Correct 17 ms 7148 KB Output is correct
19 Correct 44 ms 14848 KB Output is correct
20 Correct 48 ms 15212 KB Output is correct
21 Correct 41 ms 12652 KB Output is correct
22 Correct 41 ms 11884 KB Output is correct
23 Correct 50 ms 16108 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3564 KB Output is correct
2 Correct 3 ms 3564 KB Output is correct
3 Correct 3 ms 3564 KB Output is correct
4 Correct 3 ms 3564 KB Output is correct
5 Correct 3 ms 3564 KB Output is correct
6 Correct 3 ms 3564 KB Output is correct
7 Correct 3 ms 3564 KB Output is correct
8 Correct 3 ms 3564 KB Output is correct
9 Correct 4 ms 3820 KB Output is correct
10 Correct 3 ms 3564 KB Output is correct
11 Correct 9 ms 5612 KB Output is correct
12 Correct 17 ms 7276 KB Output is correct
13 Correct 33 ms 18428 KB Output is correct
14 Correct 47 ms 14832 KB Output is correct
15 Correct 47 ms 15084 KB Output is correct
16 Correct 40 ms 12652 KB Output is correct
17 Correct 39 ms 11884 KB Output is correct
18 Correct 17 ms 7148 KB Output is correct
19 Correct 44 ms 14848 KB Output is correct
20 Correct 48 ms 15212 KB Output is correct
21 Correct 41 ms 12652 KB Output is correct
22 Correct 41 ms 11884 KB Output is correct
23 Correct 50 ms 16108 KB Output is correct
24 Correct 3 ms 3564 KB Output is correct
25 Correct 90 ms 5740 KB Output is correct
26 Correct 116 ms 7404 KB Output is correct
27 Correct 2506 ms 18668 KB Output is correct
28 Correct 921 ms 15212 KB Output is correct
29 Correct 2673 ms 15376 KB Output is correct
30 Correct 1578 ms 12908 KB Output is correct
31 Correct 1534 ms 12012 KB Output is correct
32 Correct 137 ms 7148 KB Output is correct
33 Correct 903 ms 15084 KB Output is correct
34 Correct 2674 ms 15340 KB Output is correct
35 Correct 1666 ms 12812 KB Output is correct
36 Correct 1518 ms 12016 KB Output is correct
37 Correct 692 ms 16236 KB Output is correct
38 Correct 2187 ms 23020 KB Output is correct