oj.uz

Submission #150314

# Submission time Handle Problem Language Result Execution time Memory
150314 2019-09-01T08:07:12 Z ummm(#3574, cerberus, aayush9, knandy) Trip to the Galapagos Islands (FXCUP4_island) C++17
0 / 100
 5000 ms 371936 KB 
#include "island.h"

#include <bits/stdc++.h>
using namespace std;

const int MAX_M = 300005;
const int GAP = 1000;

struct UnionFind {
	int n;
	vector<int> uf,si,c;
	UnionFind(int n):n(n),uf(n),si(n,1){
		for(int i=0;i<n;++i) uf[i]=i;
	}
	int find(int x){return x==uf[x]?x:find(uf[x]);}
	bool join(int x, int y, bool keep_track = 1){
		if((x=find(x))==(y=find(y))) return false;
		if(si[x]<si[y]) swap(x,y);
		si[x]+=si[y];uf[y]=x;
		if(keep_track) c.push_back(y);
		return true;
	}
	void rollback(){
		while(c.size()){
			int x=c.back(); c.pop_back();
			si[uf[x]]-=si[x];uf[x]=x;;
		}
	}
};

vector<UnionFind> UF;
struct UnionFindPathCompression {
	int n;
	vector<int> uf;
	UnionFindPathCompression(int n):n(n),uf(n){
		for(int i=0;i<n;++i) uf[i]=i;
	}
	int find(int x){return uf[x] = x==uf[x]?x:find(uf[x]);}
	bool join(int x, int y){
		if((x=find(x))==(y=find(y))) return false;
		if(rand()%2) uf[y]=x;
		return true;
	}
};
vector<UnionFindPathCompression> UFPC;
vector<pair<int,int>> edges(MAX_M);
vector<int> pos[100005];

int M, N;

map<int,int> memo[100005];

void Init(int K, vector<int> F, vector<int> S, vector<int> E){
	N = F.size();
	M = S.size();

	edges.resize(M);

	for(int i=0;i<M;++i) edges[M-i-1] = {S[i], E[i]};

	for(int i=0;i<(int)F.size();++i)
		pos[F[i]].push_back(i);

	UnionFind cur(N);
	UnionFindPathCompression cur2(K);

	for(int i=0;i<M;++i){
		if(i%GAP==0) 
			UF.push_back(cur), UFPC.push_back(cur2);
		cur.join(edges[i].first, edges[i].second, 0);
		cur2.join(F[edges[i].first], F[edges[i].second]);
	}
}

int Separate(int A, int B){
	if(A>B) swap(A,B);
	if(memo[A].count(B)) return memo[A][B];

	int bucket = 0, start = 0, ans = -1;
	for(int i=0;i<M;i+=GAP){
		if(UF[i/GAP].find(pos[A][0]) == UF[i/GAP].find(pos[B][0]))
			break;
		start = i, bucket = i/GAP;
	}

	for(auto i:pos[A]) UF[bucket].join(pos[A][0], i, 1);
	for(auto i:pos[B]) UF[bucket].join(pos[B][0], i, 1);

	for(int i=start;i<start+GAP && i<M; ++i){
		UF[bucket].join(edges[i].first, edges[i].second, 1);
		if(UF[bucket].find(pos[A][0]) == UF[bucket].find(pos[B][0])){
			ans = M - i;
			break;
		}
	}
	assert(ans != -1);
	UF[bucket].rollback();
	return memo[A][B] = ans;
}

Subtask #1
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4771 ms 371812 KB Output is correct
2 Correct 4977 ms 371936 KB Output is correct
3 Correct 4897 ms 371680 KB Output is correct
4 Execution timed out 5111 ms 371812 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9728 KB Output is correct
2 Correct 12 ms 9728 KB Output is correct
3 Incorrect 318 ms 251492 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 9728 KB Output is correct
2 Correct 12 ms 9728 KB Output is correct
3 Correct 4771 ms 371812 KB Output is correct
4 Correct 4977 ms 371936 KB Output is correct
5 Correct 4897 ms 371680 KB Output is correct
6 Execution timed out 5111 ms 371812 KB Time limit exceeded
7 Halted 0 ms 0 KB -