oj.uz

Submission #100153

# Submission time Handle Problem Language Result Execution time Memory
100153 2019-03-09T15:55:44 Z aleksam Evacuation plan (IZhO18_plan) C++14
100 / 100
 950 ms 30164 KB 
//IZHO 2018 P2
#include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 100000007
#define MAX_N 100000
#define MAX_M 100000
#define MAX_Q 100000

using namespace std;

struct edge{
	int d;
	int w;
};

struct dj{
	int v;
	int p;
	public:
		bool operator<(const dj& rhs) const{
    		return p>rhs.p;//Jer priroty queue vraca obrnuto
    	}
};

int N, M;
vector<edge> adj[MAX_N];
int height[MAX_N];
int query[MAX_Q][2];
int K, Q;
bool npp[MAX_N];

void input(){
	cin>>N>>M;
	for(int i=0; i<M; ++i){
		int a, b, w;
		cin>>a>>b>>w;
		a--;
		b--;
		edge ea, eb;
		ea.d=b;
		eb.d=a;
		ea.w=eb.w=w;
		adj[a].push_back(ea);
		adj[b].push_back(eb);
	}
	cin>>K;
	memset(npp, 0, sizeof(npp));
	for(int i=0; i<K; ++i){
		int g;
		cin>>g;
		g--;
		npp[g]=1;
	}
}

priority_queue<dj> pq;

void relax(int v){
	int d=adj[v].size();
	for(int i=0; i<d; ++i){
		int u=adj[v][i].d;
		int l=adj[v][i].w;
		if(height[u]>height[v]+l){
			height[u]=height[v]+l;
			dj un;
			un.p=height[u];
			un.v=u;
			pq.push(un);
		}
	}
}

void find_height(){
	memset(height, INF, sizeof(height));
	for(int i=0; i<N; ++i){
		if(npp[i]){
			height[i]=0;
		}
		else height[i]=INF;
	}
	for(int i=0; i<N; ++i){
		if(npp[i])relax(i);
	}
	while(!pq.empty()){
		int v=pq.top().v;
		pq.pop();
		if(npp[v])continue;
		relax(v);
		npp[v]=1;
	}
}

int p[MAX_N], rk[MAX_N];

dj vert[MAX_N];
int pt[MAX_N], inv[MAX_N];
int anc[MAX_N][20];
int depth[MAX_N];

void unionfindinit(){
	for(int i=0; i<N; ++i){
		p[i]=i;	
	}
}
int find(int a){
	if(a!=p[a])p[a]=find(p[a]);
	return p[a];
}


bool cmp(dj a, dj b){
	return a.p>b.p;
}

void maketree(){
	for(int i=0; i<N; ++i){
		vert[i].v=i;
		vert[i].p=height[i];
	}
	sort(vert, vert+N, cmp);
	memset(pt, -1, sizeof(pt));
	for(int i=0; i<N; ++i){
		inv[vert[i].v]=i;
	}
	for(int i=0; i<N; ++i){
		int v=vert[i].v;
		int d=adj[v].size();
		for(int j=0; j<d; ++j){
			int u=adj[v][j].d;
			int fu=find(u);
			if(inv[u]<inv[v] && fu!=v && pt[fu]==-1){
				u=fu;
				pt[u]=v;
				p[u]=v;
			}
		}
	}
	/*for(int i=0; i<N; ++i){
		printf("inv[%d]=%d\n", i, inv[i]);
	}
	for(int i=0; i<N; ++i){
		printf("pt[%d]=%d\n", i, pt[i]);
	}*/
}

void find_depth(int v){
	if(pt[v]==-1){
		depth[v]=0;
		return;
	}
	if(depth[pt[v]]==-1)
	find_depth(pt[v]);
	depth[v]=1+depth[pt[v]];
}
void lcainit(){
	memset(anc, -1, sizeof(anc));
	for(int i=0; i<N; ++i)
		anc[i][0]=pt[i];
	for(int l=1; l<17; ++l){
		for(int i=0; i<N; ++i){
			if(anc[i][l-1]!=-1)
			anc[i][l]=anc[anc[i][l-1]][l-1];
		}
	}
	memset(depth, -1, sizeof(depth));
	for(int i=0; i<N; ++i){
		if(depth[i]==-1)find_depth(i);
	}
}

int lca(int u, int v){
	if(depth[v]>depth[u])return lca(v, u);
	for(int l=16; l>=0; --l){
		if(depth[u]-depth[v]>=(1<<l))
			u=anc[u][l];
	}
	assert(depth[u]==depth[v]);
	if(u==v)return u;
	for(int l=16; l>=0; --l){
		if(anc[u][l]==anc[v][l])
			continue;
		u=anc[u][l];
		v=anc[v][l];
	}
	return pt[u];
}

int main(){
	ios::sync_with_stdio(false);
	input();
	find_height();

	unionfindinit();
	maketree();
	lcainit();
	cin>>Q;
	for(int i=0; i<Q; ++i){
		int s, t;
		cin>>s>>t;
		cout<<height[lca(s-1, t-1)]<<endl;
	}
	
	return 0;
}
/*
9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5

5 5
1 2 2
5 1 1
4 5 1
3 2 3
3 4 4
1
5
5
5 1
1 2
2 3
4 3
5 4
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11768 KB Output is correct
2 Correct 16 ms 11896 KB Output is correct
3 Correct 15 ms 11896 KB Output is correct
4 Correct 11 ms 11768 KB Output is correct
5 Correct 15 ms 11896 KB Output is correct
6 Correct 15 ms 11896 KB Output is correct
7 Correct 11 ms 11768 KB Output is correct
8 Correct 12 ms 11788 KB Output is correct
9 Correct 15 ms 11896 KB Output is correct
10 Correct 15 ms 11896 KB Output is correct
11 Correct 15 ms 11896 KB Output is correct
12 Correct 15 ms 11896 KB Output is correct
13 Correct 15 ms 11896 KB Output is correct
14 Correct 15 ms 11896 KB Output is correct
15 Correct 15 ms 11896 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11768 KB Output is correct
2 Correct 16 ms 11896 KB Output is correct
3 Correct 15 ms 11896 KB Output is correct
4 Correct 11 ms 11768 KB Output is correct
5 Correct 15 ms 11896 KB Output is correct
6 Correct 15 ms 11896 KB Output is correct
7 Correct 11 ms 11768 KB Output is correct
8 Correct 12 ms 11788 KB Output is correct
9 Correct 15 ms 11896 KB Output is correct
10 Correct 15 ms 11896 KB Output is correct
11 Correct 15 ms 11896 KB Output is correct
12 Correct 15 ms 11896 KB Output is correct
13 Correct 15 ms 11896 KB Output is correct
14 Correct 15 ms 11896 KB Output is correct
15 Correct 15 ms 11896 KB Output is correct
16 Correct 465 ms 17516 KB Output is correct
17 Correct 900 ms 30108 KB Output is correct
18 Correct 73 ms 13560 KB Output is correct
19 Correct 417 ms 18616 KB Output is correct
20 Correct 898 ms 29944 KB Output is correct
21 Correct 590 ms 21200 KB Output is correct
22 Correct 439 ms 18932 KB Output is correct
23 Correct 943 ms 29424 KB Output is correct
24 Correct 906 ms 29624 KB Output is correct
25 Correct 889 ms 29448 KB Output is correct
26 Correct 413 ms 18540 KB Output is correct
27 Correct 414 ms 18500 KB Output is correct
28 Correct 419 ms 18536 KB Output is correct
29 Correct 419 ms 18676 KB Output is correct
30 Correct 422 ms 18748 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11740 KB Output is correct
2 Correct 12 ms 11768 KB Output is correct
3 Correct 12 ms 11768 KB Output is correct
4 Correct 15 ms 11768 KB Output is correct
5 Correct 12 ms 11768 KB Output is correct
6 Correct 12 ms 11768 KB Output is correct
7 Correct 12 ms 11768 KB Output is correct
8 Correct 12 ms 11768 KB Output is correct
9 Correct 12 ms 11768 KB Output is correct
10 Correct 12 ms 11784 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 20696 KB Output is correct
2 Correct 538 ms 28908 KB Output is correct
3 Correct 526 ms 28960 KB Output is correct
4 Correct 115 ms 16888 KB Output is correct
5 Correct 532 ms 29328 KB Output is correct
6 Correct 531 ms 29304 KB Output is correct
7 Correct 511 ms 28988 KB Output is correct
8 Correct 513 ms 28896 KB Output is correct
9 Correct 493 ms 29292 KB Output is correct
10 Correct 509 ms 28840 KB Output is correct
11 Correct 489 ms 29148 KB Output is correct
12 Correct 489 ms 28784 KB Output is correct
13 Correct 506 ms 28888 KB Output is correct
14 Correct 498 ms 29000 KB Output is correct
15 Correct 497 ms 29464 KB Output is correct
16 Correct 495 ms 29252 KB Output is correct
17 Correct 494 ms 29376 KB Output is correct
18 Correct 517 ms 29160 KB Output is correct
19 Correct 119 ms 17300 KB Output is correct
20 Correct 592 ms 29264 KB Output is correct
21 Correct 447 ms 29324 KB Output is correct
22 Correct 112 ms 18188 KB Output is correct
23 Correct 116 ms 17364 KB Output is correct
24 Correct 110 ms 18236 KB Output is correct
25 Correct 117 ms 18232 KB Output is correct
26 Correct 125 ms 17228 KB Output is correct
27 Correct 110 ms 17144 KB Output is correct
28 Correct 110 ms 18280 KB Output is correct
29 Correct 107 ms 16888 KB Output is correct
30 Correct 113 ms 18184 KB Output is correct
31 Correct 109 ms 16968 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11768 KB Output is correct
2 Correct 16 ms 11896 KB Output is correct
3 Correct 15 ms 11896 KB Output is correct
4 Correct 11 ms 11768 KB Output is correct
5 Correct 15 ms 11896 KB Output is correct
6 Correct 15 ms 11896 KB Output is correct
7 Correct 11 ms 11768 KB Output is correct
8 Correct 12 ms 11788 KB Output is correct
9 Correct 15 ms 11896 KB Output is correct
10 Correct 15 ms 11896 KB Output is correct
11 Correct 15 ms 11896 KB Output is correct
12 Correct 15 ms 11896 KB Output is correct
13 Correct 15 ms 11896 KB Output is correct
14 Correct 15 ms 11896 KB Output is correct
15 Correct 15 ms 11896 KB Output is correct
16 Correct 465 ms 17516 KB Output is correct
17 Correct 900 ms 30108 KB Output is correct
18 Correct 73 ms 13560 KB Output is correct
19 Correct 417 ms 18616 KB Output is correct
20 Correct 898 ms 29944 KB Output is correct
21 Correct 590 ms 21200 KB Output is correct
22 Correct 439 ms 18932 KB Output is correct
23 Correct 943 ms 29424 KB Output is correct
24 Correct 906 ms 29624 KB Output is correct
25 Correct 889 ms 29448 KB Output is correct
26 Correct 413 ms 18540 KB Output is correct
27 Correct 414 ms 18500 KB Output is correct
28 Correct 419 ms 18536 KB Output is correct
29 Correct 419 ms 18676 KB Output is correct
30 Correct 422 ms 18748 KB Output is correct
31 Correct 12 ms 11740 KB Output is correct
32 Correct 12 ms 11768 KB Output is correct
33 Correct 12 ms 11768 KB Output is correct
34 Correct 15 ms 11768 KB Output is correct
35 Correct 12 ms 11768 KB Output is correct
36 Correct 12 ms 11768 KB Output is correct
37 Correct 12 ms 11768 KB Output is correct
38 Correct 12 ms 11768 KB Output is correct
39 Correct 12 ms 11768 KB Output is correct
40 Correct 12 ms 11784 KB Output is correct
41 Correct 235 ms 20696 KB Output is correct
42 Correct 538 ms 28908 KB Output is correct
43 Correct 526 ms 28960 KB Output is correct
44 Correct 115 ms 16888 KB Output is correct
45 Correct 532 ms 29328 KB Output is correct
46 Correct 531 ms 29304 KB Output is correct
47 Correct 511 ms 28988 KB Output is correct
48 Correct 513 ms 28896 KB Output is correct
49 Correct 493 ms 29292 KB Output is correct
50 Correct 509 ms 28840 KB Output is correct
51 Correct 489 ms 29148 KB Output is correct
52 Correct 489 ms 28784 KB Output is correct
53 Correct 506 ms 28888 KB Output is correct
54 Correct 498 ms 29000 KB Output is correct
55 Correct 497 ms 29464 KB Output is correct
56 Correct 495 ms 29252 KB Output is correct
57 Correct 494 ms 29376 KB Output is correct
58 Correct 517 ms 29160 KB Output is correct
59 Correct 119 ms 17300 KB Output is correct
60 Correct 592 ms 29264 KB Output is correct
61 Correct 447 ms 29324 KB Output is correct
62 Correct 112 ms 18188 KB Output is correct
63 Correct 116 ms 17364 KB Output is correct
64 Correct 110 ms 18236 KB Output is correct
65 Correct 117 ms 18232 KB Output is correct
66 Correct 125 ms 17228 KB Output is correct
67 Correct 110 ms 17144 KB Output is correct
68 Correct 110 ms 18280 KB Output is correct
69 Correct 107 ms 16888 KB Output is correct
70 Correct 113 ms 18184 KB Output is correct
71 Correct 109 ms 16968 KB Output is correct
72 Correct 638 ms 21508 KB Output is correct
73 Correct 917 ms 29916 KB Output is correct
74 Correct 915 ms 29888 KB Output is correct
75 Correct 908 ms 29544 KB Output is correct
76 Correct 890 ms 29572 KB Output is correct
77 Correct 887 ms 29684 KB Output is correct
78 Correct 914 ms 30164 KB Output is correct
79 Correct 904 ms 29632 KB Output is correct
80 Correct 897 ms 29972 KB Output is correct
81 Correct 901 ms 29440 KB Output is correct
82 Correct 911 ms 29296 KB Output is correct
83 Correct 894 ms 29452 KB Output is correct
84 Correct 891 ms 29600 KB Output is correct
85 Correct 892 ms 29224 KB Output is correct
86 Correct 894 ms 29600 KB Output is correct
87 Correct 900 ms 29652 KB Output is correct
88 Correct 913 ms 29664 KB Output is correct
89 Correct 516 ms 18732 KB Output is correct
90 Correct 950 ms 29844 KB Output is correct
91 Correct 850 ms 29112 KB Output is correct
92 Correct 432 ms 18544 KB Output is correct
93 Correct 463 ms 17964 KB Output is correct
94 Correct 443 ms 18436 KB Output is correct
95 Correct 434 ms 18608 KB Output is correct
96 Correct 456 ms 17592 KB Output is correct
97 Correct 521 ms 17548 KB Output is correct
98 Correct 435 ms 18472 KB Output is correct
99 Correct 513 ms 17816 KB Output is correct
100 Correct 436 ms 18576 KB Output is correct