제출 #1287056

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1287056		Faisal_Saqib	Examination (JOI19_examination)	C++20	43 / 100	2388 ms	1114112 KiB

examination

/* 
    VENI VIDI VICI
*/

// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-fuck")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
// #define sum accumulate

//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;

template<class T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto &i:v) is>>i;
    return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
    is>>p.fi>>p.se;
    return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for(const auto &i:v) os<<i<<' ';
    return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
    os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}
bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
void readIO() {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
}

void solve();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    // readIO();

    int uwu=1;

    // cin>>uwu;

    for(int tc=1;tc<=uwu;tc++) {
        // cout<<"Case #"<<tc<<": ";
        solve();
    }
    return 0;
}
const int N=1e5+10;
int s[N],t[N],x[N],y[N],z[N],szy,ans[N];
struct SegmentTree
{
    int cnt=0;
    int l,r;
    SegmentTree *nxt[2]={NULL,NULL};
    SegmentTree(int s,int e)
    {
        l=s,r=e;
        nxt[0]=nxt[1]=NULL;
    }
    void Add(int&y)
    {
        if(r<l or r<y)return;
        cnt++;
        if(l==r)return;
        int m=(l+r)/2;
        bool cl=(y>m);
        if(nxt[cl]==NULL)
        {
            if(cl)
                nxt[cl]=new SegmentTree(m+1,r);
            else
                nxt[cl]=new SegmentTree(l,m);
        }
        nxt[cl]->Add(y);
    }
    int query(int&y) // >=y
    {
        // cout<<"Solving 1D "<<y<<' '<<l<<' '<<r<<endl;
        if(r<y)return 0;
        if(y<=l)return cnt;
        int ans=0;
        for(int i=0;i<2;i++)
        {
            if(nxt[i]!=NULL)
            {
                ans+=nxt[i]->query(y);
            }
        }
        return ans;
    }
};
struct SegmentTree2D // dynamic sparse
{
    SegmentTree *cnt=NULL;
    int l,r;
    SegmentTree2D *nxt[2]={NULL,NULL};
    SegmentTree2D(int s,int e)
    {
        l=s,r=e;
        cnt=new SegmentTree(0,szy);
        nxt[0]=nxt[1]=NULL;
    }
    void Add(int& x,int& y)
    {
        if(x<l or r<x)return;
        cnt->Add(y);
        if(l==r)return;
        int m=(l+r)/2;
        bool cl=(x>m);
        if(nxt[cl]==NULL)
        {
            if(cl)
                nxt[cl]=new SegmentTree2D(m+1,r);
            else
                nxt[cl]=new SegmentTree2D(l,m);
        }
        nxt[cl]->Add(x,y);
    }
    int query(int& y,int& x) // >=y
    {
        // cout<<"Solving 2D "<<l<<' '<<r<<' '<<y<<' '<<x<<endl;
        if(r<y)return 0;
        if(y<=l)
        {
            // cout<<"SUOE"<<endl;
            return cnt->query(x);
        }
        int ans=0;
        for(int i=0;i<2;i++)
        {
            if(nxt[i]!=NULL)
            {
                ans+=nxt[i]->query(y,x);
            }
        }
        return ans;
    }
};

void solve()
{
    ll n,q;
    cin>>n>>q;
    vector<vl> event;
    set<ll> cur;
    for(int i=1;i<=n;i++)
    {
        cin>>s[i]>>t[i];
        cur.insert(s[i]);
        cur.insert(t[i]);
        event.push_back({-s[i]-t[i],-1,i});
    }
    for(int i=1;i<=q;i++)
    {
        cin>>x[i]>>y[i]>>z[i];
        cur.insert(x[i]);
        cur.insert(y[i]);
        cur.insert(z[i]);
        z[i]=max(z[i],x[i]+y[i]);
        event.push_back({-z[i],1,i});
    }
    vl press(all(cur));
    sort(all(event));
    for(int i=1;i<=n;i++)
    {
        s[i]=lower_bound(all(press),s[i])-begin(press);
        t[i]=lower_bound(all(press),t[i])-begin(press);
    }
    for(int i=1;i<=q;i++)
    {
        x[i]=lower_bound(all(press),x[i])-begin(press);
        y[i]=lower_bound(all(press),y[i])-begin(press);
        z[i]=lower_bound(all(press),z[i])-begin(press);
    }
    ll sz=press.size();
    szy=sz;
    SegmentTree2D *st=new SegmentTree2D(0,sz);
    // ds
    for(auto c:event)
    {
        if(c[1]==-1)
        {
            st->Add(s[c[2]],t[c[2]]);
        }
        else
        {
            ans[c[2]]=st->query(x[c[2]],y[c[2]]);
        }
    }
    for(int i=1;i<=q;i++)
    {
        cout<<ans[i]<<endl;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

examination.cpp: In function 'void readIO()':
examination.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 20 / 20
• Subtask 3: 21 / 21
• Subtask 4: 0 / 57