Submission #349997

#	Time	Username	Problem	Language	Result	Execution time	Memory
349997		Kerim	Swapping Cities (APIO20_swap)	C++17	37 / 100	2088 ms	12516 KiB

swap

#include "swap.h"
#include "bits/stdc++.h"
#define MAXN 200009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<int>u,v,w,ind;
int m,n;
int ata[MAXN],sz[MAXN],bad[MAXN],edge[MAXN];
bool cmp(int x,int y){
	return (w[x]<w[y]);	
}
void init(int N, int M,vector<int>U,vector<int> V,vector<int> W) {
	u=U;v=V;w=W;m=M;n=N;
	for(int i=0;i<m;i++)ind.pb(i);
	sort(all(ind),cmp);
}
int tap(int x){
	if(ata[x]==x)return x;
	return ata[x]=tap(ata[x]);	
}
void merge(int x,int y){
	if((x=tap(x))==(y=tap(y))){
		edge[x]++;
		return;	
	}
	if(sz[x]<sz[y])swap(x,y);
	sz[x]+=sz[y];ata[y]=x;bad[x]|=bad[y];
	edge[x]+=edge[y]+1;
}
int deg[MAXN];
int getMinimumFuelCapacity(int X, int Y){
	for(int i=0;i<n;i++)ata[i]=i,sz[i]=1,bad[i]=deg[i]=edge[i]=0;
	for(int i=0;i<m;i++){
		int s=u[ind[i]],t=v[ind[i]];
		merge(s,t);deg[s]++;deg[t]++;
		if(max(deg[s],deg[t])>=3)bad[tap(s)]=1;
		if(tap(X)==tap(Y) and (bad[tap(X)] or sz[tap(X)]==edge[tap(X)]))
			return w[ind[i]];
	}
  	return -1;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 17 / 17
• Subtask 4: 20 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27