oj.uz

Submission #982422

# Submission time Handle Problem Language Result Execution time Memory
982422 2024-05-14T08:34:16 Z Lib Swapping Cities (APIO20_swap) C++14
100 / 100
 365 ms 71324 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();
		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];
	}
}
/*
Post-AC comments:
- In a classic me fashion, did pretty much everything right, built the KRT which is relatively complicated bullshit (not really but well) and all, but then
......fucks up BINARY LIFTING. Yep, classic me.
- Use a Full-KRT instead of a Binary-KRT (i.e: when the DSU adds an edge that connects between 2 vertex that is currently in the same connected components,
instead of discarding that edge completely, still add it into the KRT instead). Less casework and headache - inducing bugs that way.
- This is literally the first time I've touched DSU since...May last year (that's why the first few submissions are utter fucking dogshit with some shitass bruteforce
union merging that doesn't even work), also the first time I implemented the KRT as well. Fun stuffs,
*/

//IO for later uses
/*
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;
}
*/

Compilation message

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14952 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14808 KB Output is correct
9 Correct 125 ms 43468 KB Output is correct
10 Correct 152 ms 49736 KB Output is correct
11 Correct 144 ms 47804 KB Output is correct
12 Correct 152 ms 50868 KB Output is correct
13 Correct 188 ms 51820 KB Output is correct
14 Correct 126 ms 44476 KB Output is correct
15 Correct 187 ms 51600 KB Output is correct
16 Correct 195 ms 49220 KB Output is correct
17 Correct 208 ms 53052 KB Output is correct
18 Correct 195 ms 52260 KB Output is correct
19 Correct 80 ms 24640 KB Output is correct
20 Correct 233 ms 53052 KB Output is correct
21 Correct 242 ms 51676 KB Output is correct
22 Correct 249 ms 54012 KB Output is correct
23 Correct 295 ms 54332 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 282 ms 51544 KB Output is correct
4 Correct 264 ms 53784 KB Output is correct
5 Correct 301 ms 52576 KB Output is correct
6 Correct 258 ms 52504 KB Output is correct
7 Correct 262 ms 52636 KB Output is correct
8 Correct 254 ms 51760 KB Output is correct
9 Correct 335 ms 53076 KB Output is correct
10 Correct 271 ms 50504 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14952 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14808 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 3 ms 14940 KB Output is correct
11 Correct 4 ms 14776 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 3 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 3 ms 14940 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 4 ms 16988 KB Output is correct
25 Correct 4 ms 16988 KB Output is correct
26 Correct 5 ms 16988 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 5 ms 16988 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14952 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14808 KB Output is correct
10 Correct 125 ms 43468 KB Output is correct
11 Correct 152 ms 49736 KB Output is correct
12 Correct 144 ms 47804 KB Output is correct
13 Correct 152 ms 50868 KB Output is correct
14 Correct 188 ms 51820 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 4 ms 14776 KB Output is correct
17 Correct 3 ms 14940 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14940 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 3 ms 14940 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 4 ms 14940 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14680 KB Output is correct
29 Correct 4 ms 16988 KB Output is correct
30 Correct 4 ms 16988 KB Output is correct
31 Correct 5 ms 16988 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 5 ms 16988 KB Output is correct
34 Correct 21 ms 20688 KB Output is correct
35 Correct 158 ms 51388 KB Output is correct
36 Correct 167 ms 50872 KB Output is correct
37 Correct 159 ms 50368 KB Output is correct
38 Correct 155 ms 49600 KB Output is correct
39 Correct 155 ms 49748 KB Output is correct
40 Correct 160 ms 47596 KB Output is correct
41 Correct 152 ms 51116 KB Output is correct
42 Correct 150 ms 50084 KB Output is correct
43 Correct 217 ms 50304 KB Output is correct
44 Correct 158 ms 50880 KB Output is correct
45 Correct 196 ms 54452 KB Output is correct
46 Correct 155 ms 50068 KB Output is correct
47 Correct 159 ms 50624 KB Output is correct
48 Correct 185 ms 50760 KB Output is correct
49 Correct 134 ms 45040 KB Output is correct
50 Correct 125 ms 39444 KB Output is correct
51 Correct 159 ms 50104 KB Output is correct
52 Correct 224 ms 61244 KB Output is correct
53 Correct 258 ms 67512 KB Output is correct
54 Correct 253 ms 69452 KB Output is correct
55 Correct 169 ms 50372 KB Output is correct
56 Correct 249 ms 65024 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14952 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14808 KB Output is correct
9 Correct 125 ms 43468 KB Output is correct
10 Correct 152 ms 49736 KB Output is correct
11 Correct 144 ms 47804 KB Output is correct
12 Correct 152 ms 50868 KB Output is correct
13 Correct 188 ms 51820 KB Output is correct
14 Correct 126 ms 44476 KB Output is correct
15 Correct 187 ms 51600 KB Output is correct
16 Correct 195 ms 49220 KB Output is correct
17 Correct 208 ms 53052 KB Output is correct
18 Correct 195 ms 52260 KB Output is correct
19 Correct 282 ms 51544 KB Output is correct
20 Correct 264 ms 53784 KB Output is correct
21 Correct 301 ms 52576 KB Output is correct
22 Correct 258 ms 52504 KB Output is correct
23 Correct 262 ms 52636 KB Output is correct
24 Correct 254 ms 51760 KB Output is correct
25 Correct 335 ms 53076 KB Output is correct
26 Correct 271 ms 50504 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 4 ms 14776 KB Output is correct
29 Correct 3 ms 14940 KB Output is correct
30 Correct 3 ms 14684 KB Output is correct
31 Correct 3 ms 14940 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 4 ms 14940 KB Output is correct
34 Correct 3 ms 14940 KB Output is correct
35 Correct 4 ms 14940 KB Output is correct
36 Correct 21 ms 20688 KB Output is correct
37 Correct 158 ms 51388 KB Output is correct
38 Correct 167 ms 50872 KB Output is correct
39 Correct 159 ms 50368 KB Output is correct
40 Correct 155 ms 49600 KB Output is correct
41 Correct 155 ms 49748 KB Output is correct
42 Correct 160 ms 47596 KB Output is correct
43 Correct 152 ms 51116 KB Output is correct
44 Correct 150 ms 50084 KB Output is correct
45 Correct 217 ms 50304 KB Output is correct
46 Correct 158 ms 50880 KB Output is correct
47 Correct 25 ms 20868 KB Output is correct
48 Correct 234 ms 53784 KB Output is correct
49 Correct 246 ms 52552 KB Output is correct
50 Correct 236 ms 52552 KB Output is correct
51 Correct 241 ms 54060 KB Output is correct
52 Correct 222 ms 50844 KB Output is correct
53 Correct 178 ms 43696 KB Output is correct
54 Correct 277 ms 53508 KB Output is correct
55 Correct 241 ms 53784 KB Output is correct
56 Correct 310 ms 52456 KB Output is correct
57 Correct 245 ms 54296 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14952 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 3 ms 14940 KB Output is correct
9 Correct 3 ms 14808 KB Output is correct
10 Correct 125 ms 43468 KB Output is correct
11 Correct 152 ms 49736 KB Output is correct
12 Correct 144 ms 47804 KB Output is correct
13 Correct 152 ms 50868 KB Output is correct
14 Correct 188 ms 51820 KB Output is correct
15 Correct 126 ms 44476 KB Output is correct
16 Correct 187 ms 51600 KB Output is correct
17 Correct 195 ms 49220 KB Output is correct
18 Correct 208 ms 53052 KB Output is correct
19 Correct 195 ms 52260 KB Output is correct
20 Correct 282 ms 51544 KB Output is correct
21 Correct 264 ms 53784 KB Output is correct
22 Correct 301 ms 52576 KB Output is correct
23 Correct 258 ms 52504 KB Output is correct
24 Correct 262 ms 52636 KB Output is correct
25 Correct 254 ms 51760 KB Output is correct
26 Correct 335 ms 53076 KB Output is correct
27 Correct 271 ms 50504 KB Output is correct
28 Correct 3 ms 14940 KB Output is correct
29 Correct 4 ms 14776 KB Output is correct
30 Correct 3 ms 14940 KB Output is correct
31 Correct 3 ms 14684 KB Output is correct
32 Correct 3 ms 14940 KB Output is correct
33 Correct 3 ms 14940 KB Output is correct
34 Correct 4 ms 14940 KB Output is correct
35 Correct 3 ms 14940 KB Output is correct
36 Correct 4 ms 14940 KB Output is correct
37 Correct 21 ms 20688 KB Output is correct
38 Correct 158 ms 51388 KB Output is correct
39 Correct 167 ms 50872 KB Output is correct
40 Correct 159 ms 50368 KB Output is correct
41 Correct 155 ms 49600 KB Output is correct
42 Correct 155 ms 49748 KB Output is correct
43 Correct 160 ms 47596 KB Output is correct
44 Correct 152 ms 51116 KB Output is correct
45 Correct 150 ms 50084 KB Output is correct
46 Correct 217 ms 50304 KB Output is correct
47 Correct 158 ms 50880 KB Output is correct
48 Correct 25 ms 20868 KB Output is correct
49 Correct 234 ms 53784 KB Output is correct
50 Correct 246 ms 52552 KB Output is correct
51 Correct 236 ms 52552 KB Output is correct
52 Correct 241 ms 54060 KB Output is correct
53 Correct 222 ms 50844 KB Output is correct
54 Correct 178 ms 43696 KB Output is correct
55 Correct 277 ms 53508 KB Output is correct
56 Correct 241 ms 53784 KB Output is correct
57 Correct 310 ms 52456 KB Output is correct
58 Correct 245 ms 54296 KB Output is correct
59 Correct 80 ms 24640 KB Output is correct
60 Correct 233 ms 53052 KB Output is correct
61 Correct 242 ms 51676 KB Output is correct
62 Correct 249 ms 54012 KB Output is correct
63 Correct 295 ms 54332 KB Output is correct
64 Correct 3 ms 14940 KB Output is correct
65 Correct 3 ms 14940 KB Output is correct
66 Correct 4 ms 14940 KB Output is correct
67 Correct 3 ms 14940 KB Output is correct
68 Correct 3 ms 14680 KB Output is correct
69 Correct 4 ms 16988 KB Output is correct
70 Correct 4 ms 16988 KB Output is correct
71 Correct 5 ms 16988 KB Output is correct
72 Correct 3 ms 14940 KB Output is correct
73 Correct 5 ms 16988 KB Output is correct
74 Correct 196 ms 54452 KB Output is correct
75 Correct 155 ms 50068 KB Output is correct
76 Correct 159 ms 50624 KB Output is correct
77 Correct 185 ms 50760 KB Output is correct
78 Correct 134 ms 45040 KB Output is correct
79 Correct 125 ms 39444 KB Output is correct
80 Correct 159 ms 50104 KB Output is correct
81 Correct 224 ms 61244 KB Output is correct
82 Correct 258 ms 67512 KB Output is correct
83 Correct 253 ms 69452 KB Output is correct
84 Correct 169 ms 50372 KB Output is correct
85 Correct 249 ms 65024 KB Output is correct
86 Correct 82 ms 29556 KB Output is correct
87 Correct 233 ms 52508 KB Output is correct
88 Correct 253 ms 52508 KB Output is correct
89 Correct 283 ms 53904 KB Output is correct
90 Correct 208 ms 49600 KB Output is correct
91 Correct 216 ms 47836 KB Output is correct
92 Correct 268 ms 52000 KB Output is correct
93 Correct 357 ms 63452 KB Output is correct
94 Correct 362 ms 69408 KB Output is correct
95 Correct 365 ms 71324 KB Output is correct
96 Correct 357 ms 52768 KB Output is correct
97 Correct 318 ms 59944 KB Output is correct