Submission #744357

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
744357	2023-05-18T13:37:35 Z	tolbi	Swapping Cities (APIO20_swap)	C++17	44 / 100	2000 ms	30080 KB

swap

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename X, typename Y> istream& operator>>(istream& in, pair<X,Y> &pr) {return in>>pr.first>>pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr) {return os<<pr.first<<" "<<pr.second;}
template<typename X, typename Y> pair<X,Y> operator+(pair<X,Y> a, pair<X,Y> b) {pair<X,Y> c; c.first=a.first+b.first,c.second=a.second+b.second;return c;}
template<typename X, typename Y> pair<X,Y> operator-(pair<X,Y> a, pair<X,Y> b) {pair<X,Y> c; c.first=a.first-b.first,c.second=a.second-b.second;return c;}
template<typename X, typename Y> void operator+=(pair<X,Y> &a, pair<X,Y> b){a.first+=b.first,a.second+=b.second;}
template<typename X, typename Y> void operator-=(pair<X,Y> &a, pair<X,Y> b){a.first-=b.first,a.second-=b.second;}
template<typename X> istream& operator>>(istream& in, vector<X> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X> ostream& operator<<(ostream& os, vector<X> arr) {for(auto &it : arr) os<<it<<" "; return os;}
template<typename X, size_t Y> istream& operator>>(istream& in, array<X,Y> &arr) {for(auto &it : arr) in>>it; return in;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> arr) {for(auto &it : arr) os<<it<<" "; return os;}
#define int long long
#define endl '\n'
#define vint(x) vector<int> x
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(),x.end())
#define sortrarr(x) sort(x.rbegin(),x.rend())
#define det(x) cout<<"NO\0YES"+x*3<<endl;
#define INF LONG_LONG_MAX
#define rev(x) reverse(x.begin(),x.end());
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define tol(bi) (1LL<<((int)(bi)))
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "swap.h"
struct DSU{
	vector<int> par;
	DSU(int n){
		par.resize(n);
		iota(par.begin(), par.end(), 0);
	}
	int find(int node){
		if (par[node]==node) return node;
		return par[node]=find(par[node]);
	}
	void merge(int a, int b){
		a=find(a);
		b=find(b);
		if (ayahya()%2) swap(a,b);
		par[a]=b;
	}
	bool same(int a, int b){
		a=find(a);
		b=find(b);
		return (a==b);
	}
};
vector<int> c2;
vector<int> c3;
vector<int> up;
vector<int> par;
vector<int> dep;
vector<vector<pair<int,int>>> arr;
vector<int> c2dp;
vector<int> val;
void init(int32_t N, int32_t M, vector<int32_t> U, vector<int32_t> V, vector<int32_t> W) {
	arr.resize(N);
	c2.resize(N,INF);
	c3.resize(N,INF);
	up.resize(N,INF);
	c2dp.resize(N,-1);
	par.resize(N,-1);
	dep.resize(N,0);
	val.resize(N,INF);
	DSU dsu(N);
	vector<pair<int,pair<int,int>>> ed(M);
	for (int i = 0; i < M; i++){
		ed[i]={W[i],{U[i],V[i]}};
	}
	sortarr(ed);
	for (int i = 0; i < M; i++){
		int w = ed[i].first;
		int u = ed[i].second.first;
		int v = ed[i].second.second;
		if (dsu.same(u,v)){
			val[u]=min(val[u],w);
			val[v]=min(val[v],w);
			continue;
		}
		arr[u].push_back({v,w});
		arr[v].push_back({u,w});
		dsu.merge(u,v);
	}
	for (int i = 0; i < N; i++){
		sort(arr[i].begin(), arr[i].end(), [&](pair<int,int> a, pair<int,int> b){
			return a.second<b.second;
		});
	}
	auto dfs = [&](int node, int lnode, auto dfs)->void{
		int indi = 0;
		for (int i = 0; i < arr[node].size(); i++){
			if (arr[node][i].first==lnode) continue;
			par[arr[node][i].first]=node;
			dep[arr[node][i].first]=dep[node]+1;
			up[arr[node][i].first]=arr[node][i].second;
			indi++;
			if (indi==2){
				c2[node]=arr[node][i].second;
			}
			else if (indi==3){
				c3[node]=arr[node][i].second;
			}
			dfs(arr[node][i].first,node,dfs);
			val[node]=min(val[node],max(arr[node][i].second,val[arr[node][i].first]));
		}
	};
	dfs(0,-1,dfs);
	auto dfs2 = [&](int node, int lnode, auto dfs2)->void{
		for (int i = 0; i < arr[node].size(); i++){
			if (arr[node][i].first==lnode) continue;
			val[arr[node][i].first]=min(val[arr[node][i].first],max(val[node],arr[node][i].second));
			dfs2(arr[node][i].first,node,dfs2);
		}
	};
	dfs2(0,-1,dfs2);
}
bool isancestor(int X, int Y){
	while (X!=-1){
		if (X==Y) return true;
		X=par[X];
	}
	return false;
}
int getc2(int node){
	if (c2dp[node]!=-1) return c2dp[node];
	int ans = c2[node];
	for (int i = 0; i < arr[node].size(); i++){
		if (arr[node][i].first==par[node]) continue;
		ans=min(ans,max(getc2(arr[node][i].first),arr[node][i].second));
	}
	return c2dp[node]=ans;
}
int32_t getMinimumFuelCapacity(int32_t X, int32_t Y){
	if (dep[X]<dep[Y]) swap(X,Y);
	if (isancestor(X,Y)){
		int ans = 0;
		int ans2 = val[X];
		while (X!=Y){
			ans2=min(ans2,getc2(X));
			ans=max(ans,up[X]);
			if (par[X]==Y) break;
			X=par[X];
		}
		int crr = 0;
		while (Y!=-1){
			if (crr>=ans2) break;
			ans2=min(ans2,max(crr,max(c2[Y],up[Y])));
			ans2=min(ans2,max(crr,c3[Y]));
			for (int i = 0; i < arr[Y].size(); i++){
				if (arr[Y][i].first==X) continue;
				if (arr[Y][i].first==par[Y]) continue;
				ans2=min(ans2,max(crr,max(getc2(arr[Y][i].first),arr[Y][i].second)));
			}
			X=Y;
			crr=max(crr,up[Y]);
			Y=par[Y];
		}
		ans=max(ans,ans2);
		if (ans==INF) ans = -1;
		return ans;
	}
	else {
		int ans = 0;
		int ans2 = INF;
		while (X!=Y){
			if (dep[X]<dep[Y]) swap(X,Y);
			ans2=min(ans2,getc2(X));
			ans=max(ans,up[X]);
			X=par[X];
		}
		ans2=min(ans2,min(up[X],c3[X]));
		ans2=min(ans2,val[X]);
		ans=max(ans,ans2);
		if (ans==INF) ans=-1;
		return ans;
	}
}

#ifdef tolbi
int32_t main() {
	int32_t N, M;
	assert(2 == scanf("%d %d", &N, &M));

	vector<int32_t> U(M), V(M), W(M);
	for (int32_t i = 0; i < M; ++i) {
		assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
	}

	int32_t Q;
	assert(1 == scanf("%d", &Q));

	vector<int32_t> X(Q), Y(Q);
	for (int32_t i = 0; i < Q; ++i) {
		assert(2 == scanf("%d %d", &X[i], &Y[i]));
	}

	init(N, M, U, V, W);

	vector<int32_t> minimum_fuel_capacities(Q);
	for (int32_t i = 0; i < Q; ++i) {
		minimum_fuel_capacities[i] = getMinimumFuelCapacity(X[i], Y[i]);
		cout<<minimum_fuel_capacities[i]<<endl;
	}

	return 0;
}
#endif

Compilation message

swap.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
swap.cpp: In lambda function:
swap.cpp:106:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   for (int i = 0; i < arr[node].size(); i++){
      |                   ~~^~~~~~~~~~~~~~~~~~
swap.cpp: In lambda function:
swap.cpp:124:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |   for (int i = 0; i < arr[node].size(); i++){
      |                   ~~^~~~~~~~~~~~~~~~~~
swap.cpp: In function 'long long int getc2(long long int)':
swap.cpp:142:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |  for (int i = 0; i < arr[node].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~~~~
swap.cpp: In function 'int32_t getMinimumFuelCapacity(int32_t, int32_t)':
swap.cpp:164:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |    for (int i = 0; i < arr[Y].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~
swap.cpp: In instantiation of 'init(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)::<lambda(long long int, long long int, auto:23)> [with auto:23 = init(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)::<lambda(long long int, long long int, auto:23)>]':
swap.cpp:122:14:   required from here
swap.cpp:106:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   for (int i = 0; i < arr[node].size(); i++){
      |                   ~~^~~~~~~~~~~~~~~~~~
swap.cpp: In instantiation of 'init(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)::<lambda(long long int, long long int, auto:24)> [with auto:24 = init(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)::<lambda(long long int, long long int, auto:24)>]':
swap.cpp:130:16:   required from here
swap.cpp:124:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |   for (int i = 0; i < arr[node].size(); i++){
      |                   ~~^~~~~~~~~~~~~~~~~~

Subtask #1

0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	440 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	2 ms	468 KB	Output is correct
9	Correct	106 ms	19328 KB	Output is correct
10	Correct	135 ms	24512 KB	Output is correct
11	Correct	131 ms	23668 KB	Output is correct
12	Correct	140 ms	25272 KB	Output is correct
13	Correct	108 ms	25968 KB	Output is correct
14	Execution timed out	2078 ms	19064 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-

Subtask #2

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	163 ms	22580 KB	Output is correct
4	Correct	128 ms	23584 KB	Output is correct
5	Correct	150 ms	23056 KB	Output is correct
6	Correct	132 ms	23460 KB	Output is correct
7	Correct	137 ms	23300 KB	Output is correct
8	Correct	139 ms	22604 KB	Output is correct
9	Correct	139 ms	23188 KB	Output is correct
10	Correct	135 ms	22336 KB	Output is correct

Subtask #3

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	440 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	2 ms	468 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	436 KB	Output is correct
13	Correct	1 ms	436 KB	Output is correct
14	Correct	1 ms	448 KB	Output is correct
15	Correct	1 ms	456 KB	Output is correct
16	Correct	2 ms	528 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	2 ms	468 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	2 ms	568 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	2 ms	568 KB	Output is correct
27	Correct	1 ms	468 KB	Output is correct
28	Correct	2 ms	468 KB	Output is correct

Subtask #4

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	440 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	2 ms	468 KB	Output is correct
10	Correct	106 ms	19328 KB	Output is correct
11	Correct	135 ms	24512 KB	Output is correct
12	Correct	131 ms	23668 KB	Output is correct
13	Correct	140 ms	25272 KB	Output is correct
14	Correct	108 ms	25968 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	436 KB	Output is correct
18	Correct	1 ms	436 KB	Output is correct
19	Correct	1 ms	448 KB	Output is correct
20	Correct	1 ms	456 KB	Output is correct
21	Correct	2 ms	528 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	2 ms	468 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	468 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	2 ms	568 KB	Output is correct
30	Correct	2 ms	468 KB	Output is correct
31	Correct	2 ms	568 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	2 ms	468 KB	Output is correct
34	Correct	11 ms	3028 KB	Output is correct
35	Correct	131 ms	24764 KB	Output is correct
36	Correct	125 ms	22760 KB	Output is correct
37	Correct	108 ms	21308 KB	Output is correct
38	Correct	113 ms	20748 KB	Output is correct
39	Correct	106 ms	20392 KB	Output is correct
40	Correct	95 ms	18764 KB	Output is correct
41	Correct	126 ms	23484 KB	Output is correct
42	Correct	123 ms	24120 KB	Output is correct
43	Correct	85 ms	24504 KB	Output is correct
44	Correct	107 ms	21048 KB	Output is correct
45	Correct	106 ms	21080 KB	Output is correct
46	Correct	124 ms	21940 KB	Output is correct
47	Correct	121 ms	20616 KB	Output is correct
48	Correct	115 ms	21040 KB	Output is correct
49	Correct	63 ms	10572 KB	Output is correct
50	Correct	51 ms	9260 KB	Output is correct
51	Correct	91 ms	17660 KB	Output is correct
52	Correct	148 ms	26320 KB	Output is correct
53	Correct	159 ms	27004 KB	Output is correct
54	Correct	183 ms	30080 KB	Output is correct
55	Correct	94 ms	25444 KB	Output is correct
56	Correct	149 ms	25720 KB	Output is correct

Subtask #5

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	304 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	440 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	440 KB	Output is correct
8	Correct	2 ms	468 KB	Output is correct
9	Correct	106 ms	19328 KB	Output is correct
10	Correct	135 ms	24512 KB	Output is correct
11	Correct	131 ms	23668 KB	Output is correct
12	Correct	140 ms	25272 KB	Output is correct
13	Correct	108 ms	25968 KB	Output is correct
14	Execution timed out	2078 ms	19064 KB	Time limit exceeded
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	2 ms	440 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	2 ms	468 KB	Output is correct
10	Correct	106 ms	19328 KB	Output is correct
11	Correct	135 ms	24512 KB	Output is correct
12	Correct	131 ms	23668 KB	Output is correct
13	Correct	140 ms	25272 KB	Output is correct
14	Correct	108 ms	25968 KB	Output is correct
15	Execution timed out	2078 ms	19064 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-