Submission #291166

#	Time	Username	Problem	Language	Result	Execution time	Memory
291166		thebes	Rectangles (IOI19_rect)	C++14	72 / 100	5099 ms	604452 KiB

rect

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

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define F first
#define S second

const int MN = 2505, MM = 13e6;
int N, M, C, i, j, x, y, h[MM], hp[MM], cnt, pre[MN], ds[MN], nxt[MN], sz[MN], tp[MN], *vec[MN], temp[MM]; ll ans;
pii bnd[MM]; vi adj[MM], hid[MN];
map<pii,int> id; queue<pii> q[MN];
vector<pii> evt[MN]; map<pii,int> hist, tmp;

inline void add(int l,int r,int pid,int x,bool col){
    if(l!=-1&&r!=-1&&!id.count({l,r})){
        if(col){
            id[{l,r}]=1;
            evt[r-1].push_back({x,l+1});
        }
        else{
            id[{l,r}]=++cnt;
            bnd[cnt] = {l+1,r-1};
            h[cnt] = x;
            if(pid!=-1){
                adj[cnt].push_back(pid);
                hp[pid] = 1;
            }
        }
        q[r-l].push({l,r});
    }
    else if(l!=-1&&r!=-1&&!col){
        if(pid!=-1){
            adj[id[{l,r}]].push_back(pid);
            hp[pid] = 1;
        }
    }
}

inline void process(vi vec,int x,bool col){
    C = (int)vec.size();
    map<int,int> mp;
    for(int i=C-1;i>=0;i--){
        auto it=mp.upper_bound(vec[i]);
        if(it==mp.end()) nxt[i]=-1;
        else nxt[i]=it->S;
        while(mp.size()&&mp.begin()->F<=vec[i]) mp.erase(mp.begin());
        mp[vec[i]]=i;
    }
    mp.clear();
    for(int i=0;i<C;i++){
        auto it=mp.upper_bound(vec[i]);
        if(it==mp.end()) pre[i]=-1;
        else pre[i]=it->S;
        while(mp.size()&&mp.begin()->F<=vec[i]) mp.erase(mp.begin());
        mp[vec[i]]=i;
    }
    id.clear();
    queue<pii> hm; vector<pii> tmp;
    for(int i=1;i<C-1;i++){
        int l = pre[i], r = nxt[i];
        if(l!=-1&&r!=-1) tmp.push_back({l,r});
    }
    sort(tmp.begin(),tmp.end(),[](pii i,pii j){return i.S-i.F<j.S-j.F;});
    for(auto v : tmp) hm.push(v);
    tmp.clear();
    for(int i=0;i<=C;i++){
        while(hm.size()&&hm.front().S-hm.front().F==i){
            add(hm.front().F,hm.front().S,-1,x,col);
            hm.pop();
        }
        while(q[i].size()){
            pii cur = q[i].front(); q[i].pop();
            int l, r;
            if(vec[cur.F]==vec[cur.S]) l = pre[cur.F], r = nxt[cur.S];
            else if(vec[cur.F]<vec[cur.S]) l = pre[cur.F], r = cur.S;
            else l = cur.F, r = nxt[cur.S];
            add(l,r,id[cur],x,col);
        }
    }
}

inline void mrg(int x,int y){
    if(x^y){
        int tt = 0;
        for(int i=0,j=0;i<sz[x];i++){
            while(j+1<sz[y]&&vec[y][j]<vec[x][i]) j++;
            if(j<sz[y]&&vec[x][i]==vec[y][j]) temp[tt++]=vec[x][i];
        }
        sz[x] = 0;
        sz[y] = tt;
        for(int i=0;i<tt;i++) vec[y][i] = temp[i];
    }
}

int fnd(int x){return ds[x]=ds[x]==x?x:fnd(ds[x]);}

void dfs(int n){
    for(auto v : adj[n]) dfs(v);
    for(auto v : adj[n]) mrg(bnd[v].S, bnd[n].S);
    int it = fnd(bnd[n].F);
    while(it<M&&it<=bnd[n].S){
        mrg(it,bnd[n].S);
        ds[fnd(it)]=fnd(it+1);
        it = fnd(it);
    }
    int p = upper_bound(vec[bnd[n].S],vec[bnd[n].S]+sz[bnd[n].S],h[n])-vec[bnd[n].S];
    ans += sz[bnd[n].S]-p;
}

long long count_rectangles(vector<vector<int>> a){
	vi col;
	N = a.size(), M = a[0].size();
	for(i=0;i<M;i++){
        col.clear();
        for(j=0;j<N;j++) col.push_back(a[j][i]);
        process(col,i,1);
	}
	for(i=0;i<N;i++)
        process(a[i],i,0);
	for(i=1;i<=cnt;i++){
        hid[h[i]].push_back(i);
	}
	for(i=0;i<N;i++){
        for(j=0;j<M;j++) sz[j]=0, tp[j]=0, ds[j]=j;
        for(auto v : evt[i]) sz[v.F]++;
        for(j=0;j<M;j++) vec[j]=(int*)malloc(sz[j]*sizeof(int));
        for(auto v : evt[i]) vec[v.F][tp[v.F]++]=v.S;
        for(j=0;j<M;j++) sort(vec[j],vec[j]+sz[j]);
        tmp.clear();
        for(auto v : hid[i]){
            h[v] = hist[bnd[v]]+1;
            tmp[bnd[v]] = h[v];
            h[v] = i-h[v];
        }
        for(auto v : hid[i]){
            if(hp[v]) continue;
            dfs(v);
        }
        hist.clear();
        swap(hist, tmp);
	}
	return ans;
}

• Subtask 1: 8 / 8
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 22 / 22
• Subtask 5: 10 / 10
• Subtask 6: 13 / 13
• Subtask 7: 0 / 28