oj.uz

Submission #500409

# Submission time Handle Problem Language Result Execution time Memory
500409 2021-12-30T20:53:06 Z MohamedAhmed04 Rigged Roads (NOI19_riggedroads) C++14
100 / 100
 291 ms 44644 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 3e5 + 10 ;

int arr[MAX] ;
int n , m ;

int u[MAX] , v[MAX] ;

vector< vector< pair<int , int> > >adj(MAX) ;

int par[MAX] ;

void init()
{
	for(int i = 1 ; i <= n ; ++i)
		par[i] = i ;
}

int root(int node)
{
	if(par[node] == node)
		return node ;
	return (par[node] = root(par[node])) ;
}

void Union(int x , int y)
{
	int a = root(x) ;
	int b = root(y) ;
	par[a] = b ;
}

int P[MAX] , dep[MAX] , id[MAX] ;

void dfs(int node , int par)
{
	P[node] = par ;
	for(auto &child : adj[node])
	{
		if(child.first == par)
			continue ;
		dep[child.first] = dep[node] + 1 , id[child.first] = child.second ;
		dfs(child.first , node) ;
	}
}

int ans[MAX] ;

vector<int>edges ;
int now = 1 ;

void solve(int x , int y)
{
	edges.clear() ;
	x = root(x) , y = root(y) ;
	while(x != y)
	{
		if(dep[x] < dep[y])
			swap(x , y) ;
		edges.push_back(id[x]) ;
		Union(x , P[x]) ;
		x = root(x) ;
	}
	sort(edges.begin() , edges.end()) ;
	for(auto &i : edges)
		ans[i] = now , ++now ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	for(int i = 1 ; i <= m ; ++i)
		cin>>u[i]>>v[i] ;
	for(int i = 0 ; i < n-1 ; ++i)
	{
		cin>>arr[i] ;
		adj[u[arr[i]]].emplace_back(v[arr[i]] , arr[i]) ;
		adj[v[arr[i]]].emplace_back(u[arr[i]] , arr[i]) ;
	}
	dfs(1 , -1) ;
	init() ;
	for(int i = 1 ; i <= m ; ++i)
	{
		if(ans[i])
			continue ;
		solve(u[i] , v[i]) ;
		if(!ans[i])
			ans[i] = now , now++ ;
	}
	for(int i = 1 ; i <= m ; ++i)
		cout<<ans[i]<<" " ;
	cout<<"\n" ;
	return 0 ;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 4 ms 7500 KB Output is correct
5 Correct 4 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 16292 KB Output is correct
2 Correct 71 ms 20884 KB Output is correct
3 Correct 79 ms 16504 KB Output is correct
4 Correct 126 ms 32372 KB Output is correct
5 Correct 126 ms 33708 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 24560 KB Output is correct
2 Correct 45 ms 15364 KB Output is correct
3 Correct 24 ms 11376 KB Output is correct
4 Correct 53 ms 20032 KB Output is correct
5 Correct 22 ms 12340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 38260 KB Output is correct
2 Correct 215 ms 43964 KB Output is correct
3 Correct 54 ms 17628 KB Output is correct
4 Correct 71 ms 22468 KB Output is correct
5 Correct 269 ms 44644 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 29360 KB Output is correct
2 Correct 114 ms 22548 KB Output is correct
3 Correct 290 ms 40028 KB Output is correct
4 Correct 275 ms 37496 KB Output is correct
5 Correct 18 ms 9824 KB Output is correct

Subtask #7
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 4 ms 7500 KB Output is correct
5 Correct 4 ms 7500 KB Output is correct
6 Correct 4 ms 7500 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 6 ms 7424 KB Output is correct
9 Correct 54 ms 16292 KB Output is correct
10 Correct 71 ms 20884 KB Output is correct
11 Correct 79 ms 16504 KB Output is correct
12 Correct 126 ms 32372 KB Output is correct
13 Correct 126 ms 33708 KB Output is correct
14 Correct 76 ms 24560 KB Output is correct
15 Correct 45 ms 15364 KB Output is correct
16 Correct 24 ms 11376 KB Output is correct
17 Correct 53 ms 20032 KB Output is correct
18 Correct 22 ms 12340 KB Output is correct
19 Correct 216 ms 38260 KB Output is correct
20 Correct 215 ms 43964 KB Output is correct
21 Correct 54 ms 17628 KB Output is correct
22 Correct 71 ms 22468 KB Output is correct
23 Correct 269 ms 44644 KB Output is correct
24 Correct 150 ms 29360 KB Output is correct
25 Correct 114 ms 22548 KB Output is correct
26 Correct 290 ms 40028 KB Output is correct
27 Correct 275 ms 37496 KB Output is correct
28 Correct 18 ms 9824 KB Output is correct
29 Correct 247 ms 37792 KB Output is correct
30 Correct 291 ms 37636 KB Output is correct
31 Correct 289 ms 35068 KB Output is correct
32 Correct 76 ms 16712 KB Output is correct
33 Correct 271 ms 35644 KB Output is correct