Submission #250431

#	Time	Username	Problem	Language	Result	Execution time	Memory
250431		leaked	Plahte (COCI17_plahte)	C++14	0 / 160	2101 ms	57380 KiB

plahte

#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
////
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const int N=160000+1;
const int M=1e9+7;
const int CLOSE=2;
const int POINT=1;
const int OPEN=0;
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
vector<int>tree[4*N];int le[N];
int n,m;
void ass(int val,int l,int r,int v,int tl,int tr,int tp){
    if(tl>=l && tr<=r){
        if(!tp)tree[v].p_b(val);
        else tree[v].pop_back();
        return;
    }
    if(tl>r || tr<l) return;
    int tm=(tl+tr)>>1;
    ass(val,l,r,2*v,tl,tm,tp);
    ass(val,l,r,2*v+1,tm+1,tr,tp);
}
int get(int indx,int v,int tl,int tr){
    if(tl==tr && tr==indx){
        return (sz(tree[v]) ? tree[v].back() : -1);
    }
    int tm=(tl+tr)>>1;
    int res=-1;
    if(sz(tree[v])){
        if(res==-1 || le[res]>le[tree[v].back()]){
            res=tree[v].back();
        }
    }
    int f=-1;
    if(indx>tm){
        f=get(indx,2*v+1,tm+1,tr);
    }
    else f=get(indx,2*v,tl,tm);
    if(f!=-1){
        if(res==-1 || le[res]>le[f]){
            res=f;
        }
    }
    return res;
}
struct event{
    int x,ly,ry,i,tp;
};
bool operator < (event a,event b){
    return m_p(a.x,m_p(a.ry,a.tp))< m_p(b.x,m_p(b.ry,b.tp));
}
vector<int>g[N];
int p[N];
set<int> st[N];
int ans[N];
void dfs(int v,int pp){
    for(auto &z : g[v]){
        if(z==pp) continue;
        dfs(z,v);
        if(sz(st[v])>sz(st[z])) swap(st[v],st[z]);
        st[v].insert(all(st[z]));
		st[z].clear();
    }
    ans[v]=sz(st[v]);
}
signed main()
{
    fast_io;
    cin>>n>>m;
    int a1,a2,a3,a4;
    vector<event>e;vector<int>szh;
    for(int i=0;i<n;i++){
        cin>>a1>>a2>>a3>>a4;
        e.p_b({a1,a2,a4,i,OPEN});
        e.p_b({a3,a2,a4,i,CLOSE});
        szh.p_b(a2);
        szh.p_b(a4);
    }
    for(int i=0;i<m;i++){
        cin>>a1>>a2>>a3;
        e.p_b({a1,a2,a2,a3,POINT});
    }
    sort(all(e));
    sort(all(szh));szh.erase(unique(all(szh)),szh.end());
    for(auto &z : e){
        int pl=lower_bound(all(szh),z.ly)-szh.begin(),pr=upper_bound(all(szh),z.ry)-szh.begin();
        if(z.tp==OPEN){
            le[z.i]=pr-pl;
        }
        int dad=get(pl,1,0,sz(szh)-1);
        if(z.tp==OPEN)p[z.i]=dad;
        if(z.tp!=POINT){
            ass(z.i,pl,pr-1,1,0,sz(szh)-1,z.tp);
        }
//        debug()<<imie(dad)<<imie(z.tp)<<imie(z.i);
        if(dad!=-1){
            if(z.tp==POINT){
                st[dad].insert(z.i);
            }
            else if(z.tp==OPEN){
                g[dad].p_b(z.i);
            }
        }
    }
    for(int i=0;i<n;i++){
        if(p[i]==-1){
            dfs(i,i);
        }
    }
    for(int i=0;i<n;i++) cout<<ans[i]<<endl;
    return 0;
}
/*


*/

• Subtask 1: 0 / 32
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32
• Subtask 5: 0 / 32