oj.uz

답안 #982421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982421 2024-05-14T08:28:26 Z Lib 자매 도시 (APIO20_swap) C++14
100 / 100
 376 ms 77488 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m,a,b,c;
vector <vector <int> > InComponents;
vector <vector <int> > adj; //the edge list of the KRT
vector <int> TVector;
int RootID; //ID of the root node of the KRT;
struct Edge{
	long long Weight;
	int Start;
	int End;
};
bool operator< (const Edge &x, const Edge &y){
	return x.Weight<y.Weight;
}
Edge Elist[500003];
int Depth[500003];
int Deg[500003];
int CurRep[500003]; //id of the respresentative node on the KRT
int Par[500003]; //Parent of node with id i on the KRT;
int Toggle[500003]; //is the i-th node on the KRT toggled?
int Check[500003];
int Ancestor[500003][25];
int Val[500003];//the value of the i-th node of the KRT
vector <int> KRTID;
int GetRep(int u){
	if(CurRep[u]==-1){
		return u;
	}else{
		return CurRep[u]=GetRep(CurRep[u]);
	}
}
void DSU(int id, int u, int v, int w){
	int CurID=n-1+id;
	Deg[u]++;
	Deg[v]++;
	//u and v belongs to the same component. The component now has a cycle. Immediately toggle the root node of the current 
	//subtree that includes both u and v on the KRT
	//Screw partial, binary tree KRT, opt into full-KRT instead
	int RepU=GetRep(u), RepV=GetRep(v);
	if(RepU==RepV){
		Par[RepU]=CurID;
		Val[CurID]=w;
		adj[RepU].push_back(CurID);
		adj[CurID].push_back(RepU);
		CurRep[RepU]=CurID;
		//The node isn't toggled just yet. Toggle it immediately as there is a cycle
		Toggle[CurID]=1;
	}else{
		//u and v doesn't belong to the same component. Merge them
		int OldComp1=RepU, OldComp2=RepV;
		adj[RepU].push_back(CurID);
		adj[RepV].push_back(CurID);
		adj[CurID].push_back(RepU);
		adj[CurID].push_back(RepV);
		Par[RepU]=CurID;
		Par[RepV]=CurID;
		CurRep[RepU]=CurID;
		CurRep[RepV]=CurID;
		Val[CurID]=w; //if I got WA because I forgot to set the fucking node weight to the nodes on the KRT, I'll shove 3 fingers up my ass.
		//if either of the components are toggled already (having a cycle OR a vertex with degree >=3)
		//OR the merged component has a vertex with degree >3 (either u or v), toggle immediately
		if(Toggle[OldComp1]||Toggle[OldComp2]||Deg[u]>2||Deg[v]>2){
			Toggle[CurID]=1;
		}
	}
	//cout<<CurID<<" ";
}
void init(int N, int M, vector <int> U, vector <int> V, vector <int> W){
	n=N;
	m=M;
	for(int i=0;i<n+m+5;i++){
		adj.push_back(TVector);
	}
	for(int i=1;i<=m;i++){
		Elist[i].Weight=W[i-1];
		Elist[i].Start=U[i-1];
		Elist[i].End=V[i-1];
	}
	sort(Elist+1,Elist+m+1);
	for(int i=0;i<=m+n+1;i++){
		CurRep[i]=-1;
		Par[i]=-1;
		Toggle[i]=0;
	}		
	for(int i=1;i<=m;i++){
		DSU(i,Elist[i].Start,Elist[i].End,Elist[i].Weight);
	}
	//The KRT is now built. BFS from the root node and initialize LCA or something
	deque <int> dq;
	RootID=n+m-1;
	dq.push_back(RootID);
	Check[RootID]=1;
	int Cur;
	while(!dq.empty()){
		Cur=dq.front();
		//cout<<Cur<<" ";
		for(int i=0;i<adj[Cur].size();i++){
			if(!Check[adj[Cur][i]]){
				dq.push_back(adj[Cur][i]);
				Check[adj[Cur][i]]=1;
				Depth[adj[Cur][i]]=Depth[Cur]+1;
			}
		}
		dq.pop_front();
	}
	for(int i=0;i<=20;i++){
		for(int k=0;k<n+m;k++){
			if(i==0){
				Ancestor[k][0]=Par[k];
			}else{
				if(Depth[k]<pow(2,i)){
					Ancestor[k][i]=-1;
				}else{
				Ancestor[k][i]=Ancestor[Ancestor[k][i-1]][i-1];
				}
			}
		}
	}
}
int getMinimumFuelCapacity(int x, int y){
	//I thought that we actually need to use binary lifting to find LCA and then jump from the LCA to find the nearest
	//toggled node on the KRT
	//But apparently small-to-large merging ensures that the depth of the tree is always logN or something, so bruteforcing
	//it is
	//ok nvm this guy is a fucking moron lmao LogN depth my ass. Wrong analysis, wasted 5 minutes. Fuck me
	if(!Toggle[RootID]){
		return -1;
	}
	if(Depth[x]<Depth[y]){
		swap(x,y);
	}

	int JumpLevel=Depth[x]-Depth[y];
	for(int i=19;i>=0;i--){
		if(JumpLevel >> i & 1){
			x=Ancestor[x][i];
		}
	}
	for(int i=20;i>=0;i--){
		if(Ancestor[x][i]!=Ancestor[y][i]){
			x=Ancestor[x][i];
			y=Ancestor[y][i];
		}
	}
	x=Par[x];
	y=Par[y];
	if(Toggle[x]){
		return Val[x];
	}
	for(int i=20;i>=0;i--){
		if(Ancestor[x][i]!=-1&&!Toggle[Ancestor[x][i]]){
			x=Ancestor[x][i];
		}
	}
	x=Par[x];
	if(Toggle[x]&&x!=-1){
		return Val[x];
	}
	return -1;
	
	/*
	while(Depth[x]>Depth[y]){
		x=Par[x];
	}
	if(x==y){
		goto SkipPoint;
	}
	while(x!=y){
		x=Par[x];
		y=Par[y];
	}
	SkipPoint:
	while(!Toggle[x]&&x!=-1){
		x=Par[x];
	}
	if(x!=-1){
		return Val[x];
	}else{
		return -1;
	}
	*/
}
/*
int q;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	freopen("swap_12_2.in","r",stdin);
	cin>>n>>m;
	vector <int> U,V,W;
	for(int i=1;i<=m;i++){
		cin>>a>>b>>c;
		U.push_back(a);
		V.push_back(b);
		W.push_back(c);
	}
	init(n,m,U,V,W);
	deque <int> dq;
	cin>>q;
	for(int i=1;i<=q;i++){
		cin>>a>>b;
		dq.push_back(getMinimumFuelCapacity(a,b));
		cout<<dq.back()<<"\n";
	}
	freopen("swap_12_2.out","r",stdin);
	int cur, score=0;
	for(int i=1;i<=q;i++){
		cin>>cur;
		if(cur==dq.front()){
			score++;
		}else{
			cout<<dq.front()<<" "<<cur<<" "<<Val[RootID]<<"\n";
		}
		dq.pop_front();
	}
	cout<<score<<" "<<q<<" ";
	int maxdepth=0;
	for(int i=0;i<=n+m+5;i++){
		maxdepth=max(maxdepth,Depth[i]);
	}
	//cout<<maxdepth;
}
*/
/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
1 4 10
2 3 3
*/

Compilation message

swap.cpp: In function 'void init(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
swap.cpp:98:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   for(int i=0;i<adj[Cur].size();i++){
      |               ~^~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 4 ms 14960 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 118 ms 44976 KB Output is correct
10 Correct 147 ms 50612 KB Output is correct
11 Correct 142 ms 47884 KB Output is correct
12 Correct 161 ms 51636 KB Output is correct
13 Correct 163 ms 51836 KB Output is correct
14 Correct 119 ms 43200 KB Output is correct
15 Correct 195 ms 51772 KB Output is correct
16 Correct 187 ms 49000 KB Output is correct
17 Correct 195 ms 53116 KB Output is correct
18 Correct 228 ms 52512 KB Output is correct
19 Correct 78 ms 24644 KB Output is correct
20 Correct 231 ms 53300 KB Output is correct
21 Correct 239 ms 52040 KB Output is correct
22 Correct 249 ms 54328 KB Output is correct
23 Correct 344 ms 54120 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 286 ms 50844 KB Output is correct
4 Correct 301 ms 53544 KB Output is correct
5 Correct 256 ms 53840 KB Output is correct
6 Correct 304 ms 54196 KB Output is correct
7 Correct 259 ms 52776 KB Output is correct
8 Correct 243 ms 51200 KB Output is correct
9 Correct 246 ms 52536 KB Output is correct
10 Correct 242 ms 50912 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 4 ms 14960 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 2 ms 14936 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 3 ms 14924 KB Output is correct
12 Correct 3 ms 14936 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14936 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14684 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 5 ms 16988 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 4 ms 16988 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 3 ms 14680 KB Output is correct
6 Correct 4 ms 14960 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 118 ms 44976 KB Output is correct
11 Correct 147 ms 50612 KB Output is correct
12 Correct 142 ms 47884 KB Output is correct
13 Correct 161 ms 51636 KB Output is correct
14 Correct 163 ms 51836 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14924 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 3 ms 14936 KB Output is correct
24 Correct 3 ms 14936 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14684 KB Output is correct
29 Correct 4 ms 16988 KB Output is correct
30 Correct 5 ms 16988 KB Output is correct
31 Correct 4 ms 16988 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 4 ms 16988 KB Output is correct
34 Correct 21 ms 20692 KB Output is correct
35 Correct 155 ms 50320 KB Output is correct
36 Correct 153 ms 50612 KB Output is correct
37 Correct 155 ms 51388 KB Output is correct
38 Correct 150 ms 51132 KB Output is correct
39 Correct 157 ms 49848 KB Output is correct
40 Correct 155 ms 47344 KB Output is correct
41 Correct 153 ms 50672 KB Output is correct
42 Correct 150 ms 51048 KB Output is correct
43 Correct 157 ms 50256 KB Output is correct
44 Correct 161 ms 50240 KB Output is correct
45 Correct 188 ms 54968 KB Output is correct
46 Correct 153 ms 50636 KB Output is correct
47 Correct 163 ms 50004 KB Output is correct
48 Correct 170 ms 50620 KB Output is correct
49 Correct 129 ms 46900 KB Output is correct
50 Correct 105 ms 39616 KB Output is correct
51 Correct 161 ms 50132 KB Output is correct
52 Correct 210 ms 61116 KB Output is correct
53 Correct 267 ms 66004 KB Output is correct
54 Correct 257 ms 69296 KB Output is correct
55 Correct 158 ms 50872 KB Output is correct
56 Correct 246 ms 64172 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14680 KB Output is correct
5 Correct 4 ms 14960 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 4 ms 14936 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 118 ms 44976 KB Output is correct
10 Correct 147 ms 50612 KB Output is correct
11 Correct 142 ms 47884 KB Output is correct
12 Correct 161 ms 51636 KB Output is correct
13 Correct 163 ms 51836 KB Output is correct
14 Correct 119 ms 43200 KB Output is correct
15 Correct 195 ms 51772 KB Output is correct
16 Correct 187 ms 49000 KB Output is correct
17 Correct 195 ms 53116 KB Output is correct
18 Correct 228 ms 52512 KB Output is correct
19 Correct 286 ms 50844 KB Output is correct
20 Correct 301 ms 53544 KB Output is correct
21 Correct 256 ms 53840 KB Output is correct
22 Correct 304 ms 54196 KB Output is correct
23 Correct 259 ms 52776 KB Output is correct
24 Correct 243 ms 51200 KB Output is correct
25 Correct 246 ms 52536 KB Output is correct
26 Correct 242 ms 50912 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14924 KB Output is correct
29 Correct 3 ms 14936 KB Output is correct
30 Correct 3 ms 14940 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 3 ms 14936 KB Output is correct
35 Correct 3 ms 14936 KB Output is correct
36 Correct 21 ms 20692 KB Output is correct
37 Correct 155 ms 50320 KB Output is correct
38 Correct 153 ms 50612 KB Output is correct
39 Correct 155 ms 51388 KB Output is correct
40 Correct 150 ms 51132 KB Output is correct
41 Correct 157 ms 49848 KB Output is correct
42 Correct 155 ms 47344 KB Output is correct
43 Correct 153 ms 50672 KB Output is correct
44 Correct 150 ms 51048 KB Output is correct
45 Correct 157 ms 50256 KB Output is correct
46 Correct 161 ms 50240 KB Output is correct
47 Correct 25 ms 21448 KB Output is correct
48 Correct 243 ms 56648 KB Output is correct
49 Correct 243 ms 56852 KB Output is correct
50 Correct 242 ms 57888 KB Output is correct
51 Correct 231 ms 56372 KB Output is correct
52 Correct 246 ms 53492 KB Output is correct
53 Correct 185 ms 45864 KB Output is correct
54 Correct 252 ms 58984 KB Output is correct
55 Correct 231 ms 56620 KB Output is correct
56 Correct 324 ms 56852 KB Output is correct
57 Correct 234 ms 57904 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 3 ms 14680 KB Output is correct
6 Correct 4 ms 14960 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 4 ms 14936 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 118 ms 44976 KB Output is correct
11 Correct 147 ms 50612 KB Output is correct
12 Correct 142 ms 47884 KB Output is correct
13 Correct 161 ms 51636 KB Output is correct
14 Correct 163 ms 51836 KB Output is correct
15 Correct 119 ms 43200 KB Output is correct
16 Correct 195 ms 51772 KB Output is correct
17 Correct 187 ms 49000 KB Output is correct
18 Correct 195 ms 53116 KB Output is correct
19 Correct 228 ms 52512 KB Output is correct
20 Correct 286 ms 50844 KB Output is correct
21 Correct 301 ms 53544 KB Output is correct
22 Correct 256 ms 53840 KB Output is correct
23 Correct 304 ms 54196 KB Output is correct
24 Correct 259 ms 52776 KB Output is correct
25 Correct 243 ms 51200 KB Output is correct
26 Correct 246 ms 52536 KB Output is correct
27 Correct 242 ms 50912 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 3 ms 14924 KB Output is correct
30 Correct 3 ms 14936 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct
32 Correct 4 ms 14940 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 3 ms 14936 KB Output is correct
36 Correct 3 ms 14936 KB Output is correct
37 Correct 21 ms 20692 KB Output is correct
38 Correct 155 ms 50320 KB Output is correct
39 Correct 153 ms 50612 KB Output is correct
40 Correct 155 ms 51388 KB Output is correct
41 Correct 150 ms 51132 KB Output is correct
42 Correct 157 ms 49848 KB Output is correct
43 Correct 155 ms 47344 KB Output is correct
44 Correct 153 ms 50672 KB Output is correct
45 Correct 150 ms 51048 KB Output is correct
46 Correct 157 ms 50256 KB Output is correct
47 Correct 161 ms 50240 KB Output is correct
48 Correct 25 ms 21448 KB Output is correct
49 Correct 243 ms 56648 KB Output is correct
50 Correct 243 ms 56852 KB Output is correct
51 Correct 242 ms 57888 KB Output is correct
52 Correct 231 ms 56372 KB Output is correct
53 Correct 246 ms 53492 KB Output is correct
54 Correct 185 ms 45864 KB Output is correct
55 Correct 252 ms 58984 KB Output is correct
56 Correct 231 ms 56620 KB Output is correct
57 Correct 324 ms 56852 KB Output is correct
58 Correct 234 ms 57904 KB Output is correct
59 Correct 78 ms 24644 KB Output is correct
60 Correct 231 ms 53300 KB Output is correct
61 Correct 239 ms 52040 KB Output is correct
62 Correct 249 ms 54328 KB Output is correct
63 Correct 344 ms 54120 KB Output is correct
64 Correct 3 ms 14936 KB Output is correct
65 Correct 3 ms 14940 KB Output is correct
66 Correct 3 ms 14940 KB Output is correct
67 Correct 3 ms 14940 KB Output is correct
68 Correct 3 ms 14684 KB Output is correct
69 Correct 4 ms 16988 KB Output is correct
70 Correct 5 ms 16988 KB Output is correct
71 Correct 4 ms 16988 KB Output is correct
72 Correct 3 ms 14940 KB Output is correct
73 Correct 4 ms 16988 KB Output is correct
74 Correct 188 ms 54968 KB Output is correct
75 Correct 153 ms 50636 KB Output is correct
76 Correct 163 ms 50004 KB Output is correct
77 Correct 170 ms 50620 KB Output is correct
78 Correct 129 ms 46900 KB Output is correct
79 Correct 105 ms 39616 KB Output is correct
80 Correct 161 ms 50132 KB Output is correct
81 Correct 210 ms 61116 KB Output is correct
82 Correct 267 ms 66004 KB Output is correct
83 Correct 257 ms 69296 KB Output is correct
84 Correct 158 ms 50872 KB Output is correct
85 Correct 246 ms 64172 KB Output is correct
86 Correct 85 ms 31088 KB Output is correct
87 Correct 241 ms 57996 KB Output is correct
88 Correct 265 ms 56816 KB Output is correct
89 Correct 287 ms 57188 KB Output is correct
90 Correct 202 ms 53264 KB Output is correct
91 Correct 215 ms 53724 KB Output is correct
92 Correct 250 ms 56856 KB Output is correct
93 Correct 321 ms 69128 KB Output is correct
94 Correct 371 ms 74752 KB Output is correct
95 Correct 376 ms 77488 KB Output is correct
96 Correct 282 ms 56604 KB Output is correct
97 Correct 344 ms 64792 KB Output is correct