제출 #1305721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305721		Zbyszek99	Examination (JOI19_examination)	C++20	100 / 100	673 ms	40732 KiB

examination

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

struct query
{
    ll x,y1,y2,ind;
    bool operator<(const query& other) const
    {
        return x < other.x;
    }
};

const int tree_siz = 1024*512-1;
int sum[tree_siz+1];

int get_sum(int akt, int p1, int p2, int s1, int s2)
{
    if(p2 < s1 || p1 > s2) return 0;
    if(p1 >= s1 && p2 <= s2) return sum[akt];
    return get_sum(akt*2,p1,(p1+p2)/2,s1,s2)+get_sum(akt*2+1,(p1+p2)/2+1,p2,s1,s2);
}

void upd(int v)
{
    sum[v] = sum[v*2]+sum[v*2+1];
    if(v != 1) upd(v/2);
}

void change(int ind, int p)
{
    sum[tree_siz/2+1+ind] += p;
    upd((tree_siz/2+1+ind)/2);
}

ll query_ans[100001];

void solve(vector<pll>& points, vector<query> q, int p)
{
    map<ll,int> mp;
    forall(it,points) mp[it.ss] = 1;
    forall(it,q)
    {
        mp[it.y1] = 1;
        mp[it.y2] = 1;
    }
    int cur = 0;
    forall(it,mp) mp[it.ff] = cur++;
    forall(it,points) it.ss = mp[it.ss];
    forall(it,q)
    {
        it.y1 = mp[it.y1];
        it.y2 = mp[it.y2];
    }
    sort(all(points));
    sort(all(q));
    int cur_p = 0;
    forall(it,q)
    {
        while(cur_p < siz(points) && points[cur_p].ff <= it.x) change(points[cur_p++].ss,p);
        query_ans[it.ind] += get_sum(1,0,tree_siz/2,it.y1,it.y2);
    }
    rep(i,cur_p) change(points[i].ss,-p);
}

vector<pll> elms[5];
vector<query> queries[5];
vi P;

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int n,q;
    cin >> n >> q;
    P = {1,-1,1,1,-1};
    rep(i,n)
    {
        ll x,y;
        cin >> x >> y;
        elms[0].pb({-x,y});
        elms[1].pb({x+y,0});
        elms[2].pb({x+y,x});
        elms[3].pb({x+y,y});
        elms[4].pb({x,y});
    }
    rep(i,q)
    {
        ll a,b,c;
        cin >> a >> b >> c;
        if(c <= a+b)
        {
            queries[0].pb({-a,b,(ll)4e9,i});
        }
        else
        {
            queries[0].pb({-a,b,(ll)4e9,i});
            queries[1].pb({c-1,0,0,i});
            queries[2].pb({c-1,-(int)1e9,a-1,i});
            queries[3].pb({c-1,-(int)1e9,b-1,i});
            queries[4].pb({a-1,-(int)1e9,b-1,i});
        }
    }
    rep(i,5) solve(elms[i],queries[i],P[i]);
    rep(i,q) cout << query_ans[i] << "\n"; 
}

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