| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 207388 | 2020-03-07T13:08:32 Z | Segtree | Collapse (JOI18_collapse) | C++14 | 0 ms | 0 KB |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_set>
#include"collapse.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
namespace solver2{
#define Nmax 100010
#define B 300
typedef struct query{
ll p,id;
}query;
vector<query> qrys[Nmax];
bool vis[Nmax];
vector<ll> graph[Nmax];
ll cmp[Nmax];
void dfs(ll x,ll cmps){
if(vis[x])return;
vis[x]=1;
if(cmps>=0)cmp[x]=cmps;
for(auto y:graph[x])dfs(y,cmps);
}
vi simulateCollapse(int N,vi T,vi X,vi Y,vi W,vi P){
for(int i=0;i<Nmax;i++){
qrys[i].clear();
graph[i].clear();
}
for(int i=0;i<N;i++){
if(X[i]>Y[i])swap(X[i],Y[i]);
if(X[i]<=P[i]&&P[i]+1<=Y[i])X[i]=Y[i]=0;
}
for(int i=0;i<W.size();i++){
qrys[W[i]].push_back((query){P[i],i});
}
vi fans(W.size());
for(int L=0;L<T.size();L+=B){
int R=min(L+B,(int)T.size());
unordered_set<ll> base,s;
for(int i=0;i<L;i++){
ll has=X[i]*Nmax+Y[i];
if(base.count(has))base.erase(has);
else base.insert(has);
}
for(int i=L;i<R;i++){
ll has=X[i]*Nmax+Y[i];
if(base.count(has)){
base.erase(has);
s.insert(has);
}
}
for(int i=0;i<N;i++){vis[i]=0;graph[i].clear();}
for(auto e:base){
ll x=e/Nmax,y=e%Nmax;
graph[x].push_back(y);
graph[y].push_back(x);
}
ll basecmp=0;
for(int i=0;i<N;i++)if(vis[i]==0){
dfs(i,basecmp++);
}
for(int i=0;i<N;i++){vis[i]=0;graph[i].clear();}
for(int i=L;i<R;i++){
ll has=X[i]*Nmax+Y[i];
if(s.count(has))s.erase(has);
else s.insert(has);
unordered_set<ll> conc;
for(auto e:s){
ll x=e/Nmax,y=e%Nmax;
x=cmp[x],y=cmp[y];
graph[x].push_back(y);
graph[y].push_back(x);
conc.insert(x);
conc.insert(y);
}
ll scmp=0;
for(auto i:conc)if(vis[i]==0){
dfs(i,-1);
scmp++;
}
for(auto i:conc){vis[i]=0;graph[i].clear();}
for(query qry:qrys[i]){
fans[qry.id]=basecmp-conc.size()+scmp;
}
}
}
return fans;
}
}