oj.uz

답안 #149795

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149795 2019-09-01T07:10:36 Z Seishun Buta Yarou wa Yumemiru Shoujo no Yume wo Minai(#3781, zscoder, tmwilliamlin168) 갈라파고스 여행 (FXCUP4_island) C++17
0 / 100
 5000 ms 444244 KB 
#include "island.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned long long ull;
typedef long double ld; 
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int n,m;
vector<ii> edges;
int ini[111111];

struct DSU
{
	int S;
	
	struct node
	{
		int p; int las;
	};
	vector<node> dsu;
	
	DSU(int n=0)
	{
		S = n;
		for(int i = 0; i < n; i++)
		{
			node tmp;
			tmp.p = i; tmp.las = -1;
			dsu.pb(tmp);
		}
	}
	
	void reset(int n)
	{
		dsu.clear();
		S = n;
		for(int i = 0; i < n; i++)
		{
			node tmp;
			tmp.p = i; tmp.las = -1;
			dsu.pb(tmp);
		}
	}
	
	int rt(int u)
	{
		if(dsu[u].p == u) return u;
		dsu[u].p = rt(dsu[u].p);
		return dsu[u].p;
	}
	
	void merge(int u, int v)
	{
		u = rt(u); v = rt(v);
		if(u == v) return ;
		if(rand()&1) swap(u,v);
		dsu[v].p = u; dsu[u].las = v;
	}
	
	bool sameset(int u, int v)
	{
		if(rt(u) == rt(v)) return true;
		return false;
	}
};

struct DSUSimple
{
	int S;
	
	struct node
	{
		int p; int s;
	};
	vector<node> dsu;
	
	DSUSimple(int n=0)
	{
		S = n;
		for(int i = 0; i < n; i++)
		{
			node tmp;
			tmp.p = i; tmp.s=0;
			dsu.pb(tmp);
		}
	}
	
	void reset(int n)
	{
		dsu.clear();
		S = n;
		for(int i = 0; i < n; i++)
		{
			node tmp;
			tmp.p = i; tmp.s=0;
			dsu.pb(tmp);
		}
	}
	
	int rt(int u)
	{
		if(dsu[u].p == u) return u;
		dsu[u].p = rt(dsu[u].p);
		return dsu[u].p;
	}
	
	void merge(int u, int v)
	{
		u = rt(u); v = rt(v);
		if(u == v) return ;
		if(rand()&1) swap(u,v);
		dsu[v].p = u; dsu[u].s|=dsu[v].s;
	}
	
	bool sameset(int u, int v)
	{
		if(rt(u) == rt(v)) return true;
		return false;
	}
};

const int C = 555;
const int M = 300111;
DSU ds[M/C+10];

int st[333333];
int ma[333333];
int inve[333333];

void Init(int K, std::vector<int> F, std::vector<int> S, std::vector<int> E)
{
	n = F.size();
	m = S.size();
	for(int i=0;i<n;i++)
	{
		inve[F[i]]=i;
	}
	for(int i=0;i<n;i++) ini[i]=F[i];
	for(int i=0;i<m;i++)
	{
		edges.pb({S[i],E[i]});
	}
	reverse(edges.begin(),edges.end());
	for(int i=0;i<M/C+10;i++) 
	{
		ds[i].reset(n);
	}
	for(int i=0;i<m;i++)
	{
		if(i%C==0)
		{
			ds[i/C+1]=ds[i/C];
		}
		int u=edges[i].fi; int v=edges[i].se;
		ds[i/C+1].merge(u,v);
	}
	memset(ma,-1,sizeof(ma));
}


int Separate(int A, int B)
{
	int id=0;
	A=inve[A]; B=inve[B];
	for(int i=0;i<M/C+10;i++)
	{
		if(ds[i].sameset(A,B))
		{
			id=i-1; break;
		}
	}
	//start from ds[id]
	//until curm-1 A and B arent connected
	int curm = C*id;
	int cur=-1;
	A=ds[id].rt(A); B=ds[id].rt(B);
	vi vv;
	for(int i=curm;i<min(C*(id+1),m);i++)
	{
		int u=edges[i].fi; int v=edges[i].se;
		u=ds[id].rt(u); v=ds[id].rt(v);
		if(u==v) continue;
		if(ma[u]==-1) 
		{
			vv.pb(u); ma[u]=++cur;
		}
		if(ma[v]==-1) 
		{
			vv.pb(v); ma[v]=++cur;
		}
	}
	DSUSimple simple(cur+1);
	for(int u:vv)
	{
		if(u==A) st[u]|=1; 
		if(u==B) st[u]|=2;
		simple.dsu[ma[u]].s=st[u];
		//cerr<<x.se<<' '<<st[u]<<endl;
	}
	int ans = 0;
	for(int i=curm;i<min(C*(id+1),m);i++)
	{
		int u=edges[i].fi; int v=edges[i].se;
		u=ds[id].rt(u); v=ds[id].rt(v);
		if(u==v) continue;
		int U = ma[u];
		int V = ma[v];
		//cerr<<"MERGE: "<<U<<' '<<V<<'\n';
		simple.merge(U,V);
		U=simple.rt(U);
		if(simple.dsu[U].s==3)
		{
			ans=i; break;
		}
	}
	for(int x:vv)
	{
		st[x]=0; ma[x]=-1;
	}
	return m-ans;
}

Subtask #1
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5116 ms 444244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1664 KB Output isn't correct
2 Halted 0 ms 0 KB -