Submission #715021

#	Time	Username	Problem	Language	Result	Execution time	Memory
715021		Huseyn123	Plahte (COCI17_plahte)	C++17	0 / 160	1580 ms	524288 KiB

plahte

#include <bits/stdc++.h>
#define MAX 20001
#define INF LLONG_MAX
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ins insert
#define ff first
#define ss second
#define gett(x,m) get<m>(x)
#define all(a) a.begin(),a.end()
#define lb(a,b) lower_bound(all(a),b)
#define ub(a,b) upper_bound(all(a),b)
#define sortv(a) sort(all(a))
#define sorta(a,sz) sort(a,a+sz)
#define inputar(a,b){\
    for(int i=0;i<b;i++){\
        cin >> a[i];\
    }\
}
#define inputvec(a,b){\
    for(int i=0;i<b;i++){\
        ll num;\
        cin >> num;\
        a.pb(num);\
    }\
}
#define outputar(a,b){\
    for(int i=0;i<b;i++){\
        cout << a[i] << " ";\
    }\
    cout << "\n";\
}
#define outputvec(a){\
    for(auto x:a){\
        cout << x << " ";\
    }\
    cout << "\n";\
}
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll,ll,ll> tll;
typedef pair<ll,ll> pll;
typedef double db;
typedef long double ldb;
inline void USACO(string filename){
  freopen((filename+".in").c_str(),"r",stdin);
  freopen((filename+".out").c_str(),"w",stdout);
}
ll n,q,t=1,m,n2,m2,k,cnt=0,a[MAX],b[MAX],d2[MAX],x,y,z,x2,y2,z2,res1=0,cnt1,cnt2,cnt3;
ll c[501][501];
ll fact[MAX];
ll inv_fact[MAX];
//char c;
string str[MAX];
string s1,s2;
vector<tuple<ll,ll,ll>> v;
vector<pll> v1,v2,v3,v4;
const int mod = 998244353;
ll modmul(ll x,ll y,ll md){
    if(y==1){
        return x;
    }
    if(y%2){
        return (x+modmul(x,y-1,md))%md;
    }
    else{
        return (modmul((x+x)%md,y/2,md))%md;
    }
}
ll powmod(ll x,ll y,ll md){
    x%=md;
    if(x==0){
        return 0;
    }
    ll res=1;
    while(y){
        if(y%2==1){
            res*=x;
            res%=md;
        }
        x*=x;
        x%=md;
        y/=2;
    }
    return res;
}
ll pow2(ll x,ll y){
    if(x==0){
        return 0;
    }
    ll res=1;
    while(y>0){
        if(y%2==1){
            if(res>=1e18/x){
                res=1e18;
            }
            else{
                res*=x;
            }
        }
        if(x>=1e18/x){
            x=1e18;
        }
        else{
            x*=x;
        }
        y/=2;
    }
    return res;
}
ll inv(ll n,ll md){
    return powmod(n,md-2,md);
}
ll nCkm(ll n,ll k,ll md){
    if(n-k<0){
        return 0;
    }
    return fact[n]*inv_fact[k]%md*inv_fact[n-k]%md;
}
ll nCk(ll x,ll y){
    if(x<y){
        return 0;
    }
    ll res=1;
    if(y>x-y){
        for(int i=y+1;i<=x;i++){
            res*=i;
        }
        for(int i=2;i<=x-y;i++){
            res/=i;
        }
    }
    else{
        for(int i=x-y+1;i<=x;i++){
            res*=i;
        }
        for(int i=2;i<=y;i++){
            res/=i;
        }
    }
    return res;
}
ll countbits(ll x){
    ll cnt=0;
    while(x){
        cnt+=x&1;
        x>>=1;
    }
    return cnt;
}
ll gcd(ll x,ll y){
    if(y==0){
        return x;
    }
    return gcd(y,x%y);
}
ll lcm(ll x,ll y){
    return x*y/gcd(x,y);
}
bool alpha(char c1,char c2){
    ll h1,h2;
    if(c1>='a'){
        h1=c1-'a';
    }
    else{
        h1=c1-'A';
    }
    if(c2>='a'){
        h2=c2-'a';
    }
    else{
        h2=c2-'A';
    }
    if(h1==h2){
        return c1<c2;
    }
    else{
        return h1<h2;
    }
}
ll dx[4]={1,0,0,-1};
ll dy[4]={0,1,-1,0};
struct custom_hash {
   static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
pll f(pll x,pll y){
    if(x.ff>y.ff || (x.ff==y.ff && x.ss<y.ss)){
        return mp(x.ff,x.ss);
    }
    else{
        return mp(y.ff,y.ss);
    }
}
struct segtree{
    int size;
    vector<pll> maximum;
    /*
    void build(vector<int> &a,int x,int lx,int rx){
        if(rx-lx==1){
            if(lx<(int)a.size()){
                maximum[x]=a[lx];
            }
            return;
        }
        int m=(lx+rx)/2;
        build(a,2*x+1,lx,m);
        build(a,2*x+2,m,rx);
        maximum[x]=max(maximum[2*x+1],maximum[2*x+2]);
    }
    void build(vector<int> &a){
        build(a,0,0,size);
    }
    */
    void init(int n){
        size=1;
        while(size<n){
            size*=2;
        }
        pll p={-INF,-1};
        maximum.assign(2*size,p);
    }
    pll get_max(int l,int r,int x,int lx,int rx){
        if(lx>=r || rx<=l){
            return mp(-INF,(ll)-1);
        }
        if(lx>=l && rx<=r){
            return maximum[x];
        }
        pll s1,s2;
        int m=(lx+rx)/2;
        s1=get_max(l,r,2*x+1,lx,m);
        s2=get_max(l,r,2*x+2,m,rx);
        return f(s1,s2);
    }
    pll get_max(int l,int r){
        return get_max(l,r,0,0,size);
    }
    void set(int i,int v,int num,int x,int lx,int rx){
        if(rx-lx==1){
            maximum[x]=pll(v,num);
            return;
        }
        int m=(lx+rx)/2;
        if(i<m){
            set(i,v,num,2*x+1,lx,m);
        }
        else{
            set(i,v,num,2*x+2,m,rx);
        }
        maximum[x]=f(maximum[2*x+1],maximum[2*x+2]);
    }
    void set(int i,int v,int num){
        set(i,v,num,0,0,size);
    }
};
struct segtree2{
    int size;
    vector<pll> tree;
    void init(int n){
        size=1;
        while(size<n){
            size*=2;
        }
        tree.assign(2*size,{-1,-1});
    }
    void upd(int cnt,int l,int r,int v,int x,int lx,int rx){
        if(lx>=r || rx<=l){
            return;
        }
        if(lx>=l && rx<=r){
            tree[x]=mp(v,cnt);
            return;
        }
        int m=(lx+rx)/2;
        upd(cnt,l,r,v,2*x+1,lx,m);
        upd(cnt,l,r,v,2*x+2,m,rx);
    }
    void upd(int cnt,int l,int r,int v){
        upd(cnt,l,r,v,0,0,size);
    }
    pll get(int i,int x,int lx,int rx){
        if(rx-lx==1){
            return tree[x];
        }
        int m=(lx+rx)/2;
        pll res;
        if(i<m){
            res=get(i,2*x+1,lx,m);
        }
        else{
            res=get(i,2*x+2,m,rx);
        }
        if(tree[x].ss>res.ss){
            res=tree[x];
        }
        return res;
    }
    ll get(int i){
        return get(i,0,0,size).ff;
    }
};
struct sheet{
    ll x,y,x1,y1;
};
struct ball{
    ll x,y,z;
};
vector<vector<ll>> g;
sheet sheets[MAX];
ball balls[MAX];
set<ll> e[MAX];
void dfs(ll v){
    b[v]=1;
    ll h=-1;
    ll ind=-1;
    for(auto x:g[v]){
        if(!b[x]){
            dfs(x);
        }
        if(e[x].size()>h){
            ind=x;
            h=e[x].size();
        }
    }
    if(ind!=-1){
        swap(e[v],e[ind]);
    }
    for(auto x:g[v]){
        if(x==ind){
            continue;
        }
        for(auto y:e[x]){
            e[v].ins(y);
        }
    }
    d2[v]=max(d2[v],(ll)e[v].size());
}
void solve(){
    cin >> n >> m;
    g.resize(n+1);
    for(int i=0;i<n;i++){
        cin >> sheets[i].x >> sheets[i].y >> sheets[i].x1 >> sheets[i].y1;
        a[i]=-1;
    }
    for(int i=0;i<m;i++){
        cin >> balls[i].x >> balls[i].y >> balls[i].z;
    }
    set<ll> c;
    map<ll,ll> d;
    for(int i=0;i<n;i++){
        c.ins(sheets[i].x);
        c.ins(sheets[i].x1);
    }
    for(int i=0;i<m;i++){
        c.ins(balls[i].x);
    }
    ll cnt1=0;
    for(auto x:c){
        d[x]=cnt1;
        cnt1++;
    }
    for(int i=0;i<n;i++){
        sheets[i].x=d[sheets[i].x];
        sheets[i].x1=d[sheets[i].x1];
    }
    for(int i=0;i<m;i++){
        balls[i].x=d[balls[i].x];
    }
    c.clear();
    d.clear();
    for(int i=0;i<n;i++){
        c.ins(sheets[i].y);
        c.ins(sheets[i].y1);
    }
    for(int i=0;i<m;i++){
        c.ins(balls[i].y);
    }
    ll cnt2=0;
    for(auto x:c){
        d[x]=cnt2;
        cnt2++;
    }
    for(int i=0;i<n;i++){
        sheets[i].y=d[sheets[i].y];
        sheets[i].y1=d[sheets[i].y1];
    }
    for(int i=0;i<m;i++){
        balls[i].y=d[balls[i].y];
    }
    c.clear();
    d.clear();
    vector<vector<pll>> start(cnt1);
    vector<vector<pll>> ended(cnt1);
    for(int i=0;i<n;i++){
        start[sheets[i].x].pb(mp(0,i));
        ended[sheets[i].x1].pb(mp(0,i));
    }
    for(int i=0;i<m;i++){
        start[balls[i].x].pb(mp(1,i));
    }
    segtree2 st;
    st.init(cnt2);
    ll cnt=0;
    for(int i=0;i<cnt1;i++){
        for(auto it:start[i]){
            if(it.ff==0){
                ll h=st.get(sheets[it.ss].y);
                if(h!=-1){
                    g[h].pb(it.ss);
                    cout << h << " " << it.ss << "\n";
                    a[it.ss]=h;
                }
                st.upd(cnt,sheets[it.ss].y,sheets[it.ss].y1,it.ss);
                cnt++;
            }
            else{
                ll h=st.get(it.ss);
                if(h!=-1){
                    e[h].ins(balls[it.ss].z);
                }
            }
        }
        for(auto it:ended[i]){
            ll h=-1;
            st.upd(cnt,sheets[it.ss].y,sheets[it.ss].y1,a[it.ss]);
            cnt++;
        }
    }
    for(int i=0;i<n;i++){
        if(b[i]==0){
            dfs(i);
        }
    }
    for(int i=0;i<n;i++){
        cout << d2[i] << "\n";
    }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //USACO("poetry");
    //freopen("input.txt","r",stdin);
    //cin >> t;
    ll cnt1=1;
    while(t--){
        solve();
        cnt1++;
    }
}
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
ifstream fin("template.in");
ofstream fout("template.out");
*/
/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
ifstream fin("template.in");
ofstream fout("template.out");
*/
/*
ll b[51][51];
b[0][0] = 1;
    for (int n = 1; n <= 50; ++n){
        b[n][0] = b[n][n] = 1;
        for (int k = 1; k < n; ++k)
            b[n][k] = b[n - 1][k - 1] + b[n - 1][k];
    }
*/

Compilation message (stderr)

plahte.cpp: In function 'void dfs(ll)':
plahte.cpp:333:23: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  333 |         if(e[x].size()>h){
      |            ~~~~~~~~~~~^~
plahte.cpp: In function 'void solve()':
plahte.cpp:437:16: warning: unused variable 'h' [-Wunused-variable]
  437 |             ll h=-1;
      |                ^

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