제출 #1157293

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1157293		Shadow1	Examination (JOI19_examination)	C++20	100 / 100	873 ms	604028 KiB

examination

// Programmer: Shadow1

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using str = string; // yay python!

#define i64 int64_t
#define show(x) cerr << (#x) << " = " << (x) << '\n';
#define output_vector(v) for(auto &x : v){cout << x << ' ';}cout << '\n';
#define output_pairvector(v) for(auto &x : v){cout << x.first << " " << x.second << '\n';}
#define read_vector(v) for(auto &x : v){cin >> x;}
#define vt vector
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define fir first
#define sec second
#define sz(x) ll(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
// 
// 
const int MAX = 3e5; //adjust accordingly
struct node{
    node *left, *right;
    int S, E, M, val;
    node(int s, int e) : S(s), E(e){
        M = (S+E)/2;
        left = right = nullptr;
        val = 0;
    }

    void create() {  // lazy creation
        if(S == E) return;
        if(left == nullptr){ // no children
            left = new node(S, M);
            right = new node(M + 1, E);
        }
    }
 
    int qry(int l, int r){
        if (l > E || r < S) return 0;
        if(l <= S && E <= r) return val;
        
        create();
        return left->qry(l, r) + right->qry(l, r); //change operation if necessary
    }
    void upd(int p){
        if(S == E){
            val++; //change operation if necessary
            return;
        }
        create();
        if(p <= M) left->upd(p);
        else right->upd(p);
        val = left->val + right->val; //change operation if necessary
    }
} *math, *info;



struct req {
    int x, y, z, i;
};

bool cmp(pii &a, pii &b) {
    return a.fir + a.sec > b.fir + b.sec;
}
bool cmp2(req &a, req &b) {
    return a.z > b.z;
}
void solve() {
    int n, q;
    cin >> n >> q;
    math = new node(0, 1e9);
    info = new node(0, 1e9);
    vector<pii> a(n);
    vector<req> queries(q);
    for(int i=0; i<n; ++i) 
        cin >> a[i].fir >> a[i].sec;
    sort(all(a), cmp);
    for(int i=0; i<q; ++i) {
        cin >> queries[i].x >> queries[i].y >> queries[i].z;
        queries[i].z = max(queries[i].z, queries[i].x + queries[i].y);
        queries[i].i = i;
    }
    sort(all(queries), cmp2);
    vector<int> ans(q);
    int ptr = 0;
    for(int i=0; i<q; ++i) {    
        while(ptr < n && a[ptr].fir + a[ptr].sec >= queries[i].z) {
            math->upd(a[ptr].fir);
            info->upd(a[ptr].sec);
            ++ptr;
        }
        ans[queries[i].i] = ptr - math->qry(0, queries[i].x-1) - info->qry(0, queries[i].y-1);
    }
    for(int i=0; i<q; ++i)
        cout << ans[i] << '\n';
}






// CHECK YOUR OVERFLOWS!!!! 
signed main() {
    // freopen("output.txt", "w", stdout);
    // freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(NULL); 
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; ++tc) {
        // cout << "Case #" << tc << ": ";
        solve();
    }

    return 0;
}

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