oj.uz

Submission #889168

# Submission time Handle Problem Language Result Execution time Memory
889168 2023-12-19T05:03:11 Z thunopro Tourism (JOI23_tourism) C++14
28 / 100
 5000 ms 47196 KB 
#include<bits/stdc++.h>
using namespace std ;
#define maxn 200009 
#define ll long long
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef vector<ll> vl ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 
typedef pair<ll,ll> pll ;  

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin (T &a , T b) { if (a>b) a=b ;} 
template < typename T > void chkmax (T &a , T b) { if (a<b) a=b ;}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int n , m , nq ; 
vi adjList [maxn] ;
 
int seeing [maxn] ; 
pii query [maxn] ; 

int par [maxn][20] , dep [maxn] , tin [maxn] , timeDfs ; 
void dfs ( int u = 1 )
{
	tin [u] = ++ timeDfs ; 
	for ( auto v : adjList [u] ) 
	{
		if ( v == par [u][0] ) continue ; 
		par [v][0] = u , dep [v] = dep [u] + 1 ; 
		for ( int i = 1 ; i <= LOG ; i ++ ) par [v][i] = par[par[v][i-1]][i-1] ; 
		dfs (v) ; 
	}
}

int lca ( int u , int v ) 
{
	if ( dep [u] < dep [v] ) swap (u,v) ; 
	int h = dep [u] - dep [v] ; 
	for ( int i = LOG ; i >= 0 ; i -- ) if ( h >> i & 1 ) u = par [u][i] ;
	if ( u == v ) return u ; 
	for ( int i = LOG ; i >= 0 ; i -- ) if ( par [u][i] != par [v][i] ) u = par [u][i] , v = par [v][i] ; 
	return par [u][0] ; 
} 

int dis ( int u , int v ) 
{
	return dep [u] + dep [v] - 2*dep[lca(u,v)] ; 
}

bool cmp ( int u , int v ) 
{
	return tin [u] < tin [v] ; 
}
void sub1 () 
{
	for ( int run = 1 ; run <= nq ; run ++ )
	{
		int l = query [run].fi , r = query [run].se ; 
		vi v ; 
		for ( int i = l ; i <= r ; i ++ ) v . pb (seeing[i]) ;
		sort (v.begin(),v.end(),cmp) ; 
		int last = 0 ; 
		int res = 0 ; 
		for ( auto x : v ) 
		{
			if ( last ) res += dis (last,x) ;
			last = x ; 
		}
		res += dis (last,v[0]) ; 
		cout << res / 2 + 1 << "\n" ; 
	}
}	


bool check_isline () 
{
	for ( int i = 1 ; i <= n ; i ++ ) if ( (int)adjList[i].size () > 2 ) return false ; 
	if ( adjList [1] . size () != 1 || adjList [n].size () != 1 ) return false ; 
	return true ; 
}

int L [maxn][20][2] ; 
int get_max ( int l , int r ) 
{
	int x = __lg(r-l+1) ; 
	return max (L[l][x][1],L[r-(1<<x)+1][x][1]) ; 
}
int get_min ( int l , int r ) 
{
	int x = __lg(r-l+1) ; 
	return min (L[l][x][0],L[r-(1<<x)+1][x][0]) ; 
}

void sub2 () 
{
	for ( int i = 1 ; i <= m ; i ++ ) L [i][0][0] = L [i][0][1] = seeing [i] ; 
	for ( int j = 1 ; j <= __lg (m) ; j ++ ) 
	{
		for ( int i = 1 ; i <= m-(1<<j)+1 ; i ++ ) 
		{
			L [i][j][0] = min ( L[i][j-1][0],L[i+(1<<(j-1))][j-1][0]) ; 
			L [i][j][1] = max ( L[i][j-1][1],L[i+(1<<(j-1))][j-1][1]) ; 
		}
	}
	for ( int run = 1 ; run <= nq ; run ++ ) 
	{
		int l = query [run].fi , r = query [run].se ; 
		cout << get_max (l,r) - get_min (l,r) + 1 << "\n" ; 
	}
}
int main () 
{
	ios_base::sync_with_stdio(0) ; 
	cin.tie(0) ; cout.tie(0) ; 
//	rf () ; 
	cin >> n >> m >> nq ; 
	
	for ( int i = 1 ; i < n ; i ++ ) 
	{
		int u , v ; cin >> u >> v ; 
		adjList [u] . pb (v) ; 
		adjList [v] . pb (u) ; 
	}
	
	for ( int i = 1 ; i <= m ; i ++ ) cin >> seeing [i] ; 
	
	for ( int i = 1 ; i <= nq ; i ++ ) cin >> query [i].fi >> query [i].se ; 
	dfs () ; 
	
	if ( check_isline () ) sub2 () ; 
	else sub1 () ; 
}

Compilation message

tourism.cpp: In function 'void rf()':
tourism.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8664 KB Output is correct
4 Correct 3 ms 8696 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 3 ms 8716 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 4 ms 8688 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8672 KB Output is correct
12 Correct 9 ms 8536 KB Output is correct
13 Correct 8 ms 8732 KB Output is correct
14 Correct 9 ms 8536 KB Output is correct
15 Correct 4 ms 8672 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8744 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8740 KB Output is correct
20 Correct 4 ms 8536 KB Output is correct
21 Correct 5 ms 8540 KB Output is correct
22 Correct 4 ms 8632 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8540 KB Output is correct
25 Correct 4 ms 8540 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8672 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8664 KB Output is correct
4 Correct 3 ms 8696 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 3 ms 8716 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 4 ms 8688 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8672 KB Output is correct
12 Correct 9 ms 8536 KB Output is correct
13 Correct 8 ms 8732 KB Output is correct
14 Correct 9 ms 8536 KB Output is correct
15 Correct 4 ms 8672 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8744 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8740 KB Output is correct
20 Correct 4 ms 8536 KB Output is correct
21 Correct 5 ms 8540 KB Output is correct
22 Correct 4 ms 8632 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8540 KB Output is correct
25 Correct 4 ms 8540 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8672 KB Output is correct
30 Correct 69 ms 9048 KB Output is correct
31 Correct 96 ms 8796 KB Output is correct
32 Correct 134 ms 10840 KB Output is correct
33 Correct 131 ms 10988 KB Output is correct
34 Correct 137 ms 11232 KB Output is correct
35 Correct 405 ms 10988 KB Output is correct
36 Correct 380 ms 10988 KB Output is correct
37 Correct 387 ms 10840 KB Output is correct
38 Correct 115 ms 10840 KB Output is correct
39 Correct 113 ms 11072 KB Output is correct
40 Correct 113 ms 11072 KB Output is correct
41 Correct 343 ms 11100 KB Output is correct
42 Correct 345 ms 11100 KB Output is correct
43 Correct 343 ms 10844 KB Output is correct
44 Correct 126 ms 10840 KB Output is correct
45 Correct 117 ms 11012 KB Output is correct
46 Correct 120 ms 11044 KB Output is correct
47 Correct 351 ms 11016 KB Output is correct
48 Correct 350 ms 10844 KB Output is correct
49 Correct 349 ms 10844 KB Output is correct
50 Correct 123 ms 10844 KB Output is correct
51 Correct 128 ms 10840 KB Output is correct
52 Correct 128 ms 10992 KB Output is correct
53 Correct 123 ms 11100 KB Output is correct
54 Correct 125 ms 11012 KB Output is correct
55 Correct 130 ms 10992 KB Output is correct
56 Correct 39 ms 8536 KB Output is correct
57 Correct 4 ms 10992 KB Output is correct
58 Correct 3 ms 10844 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8540 KB Output is correct
2 Correct 3 ms 8584 KB Output is correct
3 Correct 46 ms 8720 KB Output is correct
4 Correct 41 ms 37460 KB Output is correct
5 Correct 43 ms 37972 KB Output is correct
6 Correct 49 ms 43192 KB Output is correct
7 Correct 63 ms 47192 KB Output is correct
8 Correct 65 ms 47092 KB Output is correct
9 Correct 61 ms 47184 KB Output is correct
10 Correct 67 ms 47080 KB Output is correct
11 Correct 74 ms 47196 KB Output is correct
12 Correct 59 ms 46932 KB Output is correct
13 Correct 59 ms 46932 KB Output is correct
14 Correct 61 ms 46932 KB Output is correct
15 Correct 49 ms 28756 KB Output is correct
16 Correct 59 ms 46672 KB Output is correct
17 Execution timed out 5030 ms 11168 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 29 ms 18024 KB Output is correct
3 Correct 41 ms 18552 KB Output is correct
4 Correct 40 ms 18648 KB Output is correct
5 Correct 79 ms 23248 KB Output is correct
6 Correct 69 ms 23268 KB Output is correct
7 Correct 60 ms 22852 KB Output is correct
8 Correct 80 ms 22780 KB Output is correct
9 Correct 63 ms 22620 KB Output is correct
10 Correct 58 ms 22752 KB Output is correct
11 Correct 72 ms 22772 KB Output is correct
12 Correct 57 ms 22620 KB Output is correct
13 Correct 69 ms 22864 KB Output is correct
14 Correct 69 ms 23140 KB Output is correct
15 Correct 65 ms 23908 KB Output is correct
16 Correct 84 ms 23124 KB Output is correct
17 Correct 63 ms 23124 KB Output is correct
18 Correct 78 ms 23120 KB Output is correct
19 Correct 55 ms 23244 KB Output is correct
20 Correct 62 ms 23124 KB Output is correct
21 Correct 66 ms 22948 KB Output is correct
22 Correct 55 ms 22796 KB Output is correct
23 Correct 67 ms 22612 KB Output is correct
24 Correct 64 ms 22620 KB Output is correct
25 Correct 58 ms 22612 KB Output is correct
26 Correct 81 ms 22716 KB Output is correct
27 Correct 60 ms 22772 KB Output is correct
28 Correct 81 ms 22656 KB Output is correct
29 Correct 64 ms 22780 KB Output is correct
30 Correct 65 ms 22620 KB Output is correct
31 Correct 66 ms 22868 KB Output is correct
32 Correct 77 ms 22984 KB Output is correct
33 Correct 76 ms 23280 KB Output is correct
34 Correct 72 ms 23928 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8536 KB Output is correct
3 Correct 45 ms 8712 KB Output is correct
4 Execution timed out 5064 ms 20640 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8664 KB Output is correct
4 Correct 3 ms 8696 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 3 ms 8716 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 4 ms 8688 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8672 KB Output is correct
12 Correct 9 ms 8536 KB Output is correct
13 Correct 8 ms 8732 KB Output is correct
14 Correct 9 ms 8536 KB Output is correct
15 Correct 4 ms 8672 KB Output is correct
16 Correct 4 ms 8540 KB Output is correct
17 Correct 4 ms 8744 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8740 KB Output is correct
20 Correct 4 ms 8536 KB Output is correct
21 Correct 5 ms 8540 KB Output is correct
22 Correct 4 ms 8632 KB Output is correct
23 Correct 4 ms 8540 KB Output is correct
24 Correct 4 ms 8540 KB Output is correct
25 Correct 4 ms 8540 KB Output is correct
26 Correct 4 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8672 KB Output is correct
30 Correct 69 ms 9048 KB Output is correct
31 Correct 96 ms 8796 KB Output is correct
32 Correct 134 ms 10840 KB Output is correct
33 Correct 131 ms 10988 KB Output is correct
34 Correct 137 ms 11232 KB Output is correct
35 Correct 405 ms 10988 KB Output is correct
36 Correct 380 ms 10988 KB Output is correct
37 Correct 387 ms 10840 KB Output is correct
38 Correct 115 ms 10840 KB Output is correct
39 Correct 113 ms 11072 KB Output is correct
40 Correct 113 ms 11072 KB Output is correct
41 Correct 343 ms 11100 KB Output is correct
42 Correct 345 ms 11100 KB Output is correct
43 Correct 343 ms 10844 KB Output is correct
44 Correct 126 ms 10840 KB Output is correct
45 Correct 117 ms 11012 KB Output is correct
46 Correct 120 ms 11044 KB Output is correct
47 Correct 351 ms 11016 KB Output is correct
48 Correct 350 ms 10844 KB Output is correct
49 Correct 349 ms 10844 KB Output is correct
50 Correct 123 ms 10844 KB Output is correct
51 Correct 128 ms 10840 KB Output is correct
52 Correct 128 ms 10992 KB Output is correct
53 Correct 123 ms 11100 KB Output is correct
54 Correct 125 ms 11012 KB Output is correct
55 Correct 130 ms 10992 KB Output is correct
56 Correct 39 ms 8536 KB Output is correct
57 Correct 4 ms 10992 KB Output is correct
58 Correct 3 ms 10844 KB Output is correct
59 Correct 2 ms 8540 KB Output is correct
60 Correct 3 ms 8584 KB Output is correct
61 Correct 46 ms 8720 KB Output is correct
62 Correct 41 ms 37460 KB Output is correct
63 Correct 43 ms 37972 KB Output is correct
64 Correct 49 ms 43192 KB Output is correct
65 Correct 63 ms 47192 KB Output is correct
66 Correct 65 ms 47092 KB Output is correct
67 Correct 61 ms 47184 KB Output is correct
68 Correct 67 ms 47080 KB Output is correct
69 Correct 74 ms 47196 KB Output is correct
70 Correct 59 ms 46932 KB Output is correct
71 Correct 59 ms 46932 KB Output is correct
72 Correct 61 ms 46932 KB Output is correct
73 Correct 49 ms 28756 KB Output is correct
74 Correct 59 ms 46672 KB Output is correct
75 Execution timed out 5030 ms 11168 KB Time limit exceeded
76 Halted 0 ms 0 KB -