oj.uz

답안 #207696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207696 2020-03-08T15:36:59 Z nvmdava Examination (JOI19_examination) C++17
100 / 100
 2273 ms 558160 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ff first
#define ss second
#define N 100005
#define MOD 1000000007
#define INF 0x3f3f3f3f

vector<pair<int, pair<int, int> > > ar;
vector<pair<pair<int, int>, pair<int, int> > > qu;
map<int, int> scmp, tcmp;

int ss, ts;

struct Y {
    int val = 0;
    Y *l = NULL, *r = NULL;

    int query(int L, int R, int y){
        if(R <= y)
            return val;
        if(L > y)
            return 0;
        int m = (L + R) >> 1;
        int w = 0;
        if(l)
            w += l -> query(L, m, y);
        if(r && m < y)
            w += r -> query(m + 1, R, y);
        return w;
    }
    void update(int L, int R, int y){
        ++val;
        if(L == R)
            return;
        int m = (L + R) >> 1;
        if(m >= y){
            if(!l)
                l = new Y();
            l -> update(L, m, y);
        } else {
            if(!r)
                r = new Y();
            r -> update(m + 1, R, y);
        }
    }
};

struct X {
    Y *val = new Y();
    X *l = NULL, *r = NULL;

    int query(int L, int R, int x, int y){
        if(R <= x)
            return val -> query(1, ts, y);
        if(L > x)
            return 0;
        int m = (L + R) >> 1;
        int w = 0;
        if(l)
            w += l -> query(L, m, x, y);
        if(r && m < x)
            w += r -> query(m + 1, R, x, y);
        return w;
    }
    void update(int L, int R, int x, int y){
        val -> update(1, ts, y);
        if(L == R) return;
        int m = (L + R) >> 1;
        if(m >= x){
            if(!l)
                l = new X();
            l -> update(L, m, x, y);
        } else {
            if(!r)
                r = new X();
            r -> update(m + 1, R, x, y);
        }
    }
} *seg = new X();

int ans[N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, q;
    cin>>n>>q;
    int mxs = 0, mxt = 0;
    for(int i = 1; i <= n; ++i){
        int s, t;
        cin>>s>>t;
        mxs = max(mxs, s);
        mxt = max(mxt, t);
        ar.push_back({s + t, {s, t}});
        scmp[s] = 0;
        tcmp[t] = 0;
    }
    int w;

    w = 0;
    for(auto& x : scmp)
        x.ss = ++w;
    w = 0;
    for(auto& x : tcmp)
        x.ss = ++w;
    ss = scmp.size();
    ts = tcmp.size();
    for(auto& x : ar){
        x.ss.ff = ss + 1 - scmp[x.ss.ff];
        x.ss.ss = ts + 1 - tcmp[x.ss.ss];
    }

    sort(ar.rbegin(), ar.rend());

    for(int i = 1; i <= q; ++i){
        int a, b, c;
        cin>>a>>b>>c;
        if(a > mxs || b > mxt)
            continue;
        a = scmp.lower_bound(a) -> ss;
        b = tcmp.lower_bound(b) -> ss;
        a = ss + 1 - a;
        b = ts + 1 - b;
        qu.push_back({{c, i}, {a, b}});
    }
    sort(qu.rbegin(), qu.rend());

    w = 0;

    for(auto& x : qu){
        while(w != n && ar[w].ff >= x.ff.ff){
            seg -> update(1, ss, ar[w].ss.ff, ar[w].ss.ss);
            ++w;
        }
        ans[x.ff.ss] = seg -> query(1, ss, x.ss.ff, x.ss.ss);
    }
    for(int i = 1; i <= q; ++i)
        cout<<ans[i]<<'\n';
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 30 ms 9464 KB Output is correct
8 Correct 27 ms 9464 KB Output is correct
9 Correct 29 ms 9336 KB Output is correct
10 Correct 12 ms 2168 KB Output is correct
11 Correct 12 ms 2040 KB Output is correct
12 Correct 7 ms 500 KB Output is correct
13 Correct 27 ms 9464 KB Output is correct
14 Correct 28 ms 9468 KB Output is correct
15 Correct 28 ms 9464 KB Output is correct
16 Correct 9 ms 760 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 6 ms 504 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1995 ms 466728 KB Output is correct
2 Correct 2043 ms 466672 KB Output is correct
3 Correct 2017 ms 466976 KB Output is correct
4 Correct 314 ms 47812 KB Output is correct
5 Correct 310 ms 43808 KB Output is correct
6 Correct 83 ms 5096 KB Output is correct
7 Correct 1935 ms 466644 KB Output is correct
8 Correct 1901 ms 466848 KB Output is correct
9 Correct 1703 ms 466736 KB Output is correct
10 Correct 158 ms 10288 KB Output is correct
11 Correct 168 ms 15784 KB Output is correct
12 Correct 48 ms 3308 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1995 ms 466728 KB Output is correct
2 Correct 2043 ms 466672 KB Output is correct
3 Correct 2017 ms 466976 KB Output is correct
4 Correct 314 ms 47812 KB Output is correct
5 Correct 310 ms 43808 KB Output is correct
6 Correct 83 ms 5096 KB Output is correct
7 Correct 1935 ms 466644 KB Output is correct
8 Correct 1901 ms 466848 KB Output is correct
9 Correct 1703 ms 466736 KB Output is correct
10 Correct 158 ms 10288 KB Output is correct
11 Correct 168 ms 15784 KB Output is correct
12 Correct 48 ms 3308 KB Output is correct
13 Correct 1878 ms 469636 KB Output is correct
14 Correct 1985 ms 469924 KB Output is correct
15 Correct 1990 ms 469412 KB Output is correct
16 Correct 297 ms 49952 KB Output is correct
17 Correct 300 ms 45956 KB Output is correct
18 Correct 96 ms 6112 KB Output is correct
19 Correct 1831 ms 469760 KB Output is correct
20 Correct 1895 ms 469756 KB Output is correct
21 Correct 1686 ms 469736 KB Output is correct
22 Correct 156 ms 11816 KB Output is correct
23 Correct 166 ms 15660 KB Output is correct
24 Correct 47 ms 3308 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 30 ms 9464 KB Output is correct
8 Correct 27 ms 9464 KB Output is correct
9 Correct 29 ms 9336 KB Output is correct
10 Correct 12 ms 2168 KB Output is correct
11 Correct 12 ms 2040 KB Output is correct
12 Correct 7 ms 500 KB Output is correct
13 Correct 27 ms 9464 KB Output is correct
14 Correct 28 ms 9468 KB Output is correct
15 Correct 28 ms 9464 KB Output is correct
16 Correct 9 ms 760 KB Output is correct
17 Correct 9 ms 888 KB Output is correct
18 Correct 6 ms 504 KB Output is correct
19 Correct 1995 ms 466728 KB Output is correct
20 Correct 2043 ms 466672 KB Output is correct
21 Correct 2017 ms 466976 KB Output is correct
22 Correct 314 ms 47812 KB Output is correct
23 Correct 310 ms 43808 KB Output is correct
24 Correct 83 ms 5096 KB Output is correct
25 Correct 1935 ms 466644 KB Output is correct
26 Correct 1901 ms 466848 KB Output is correct
27 Correct 1703 ms 466736 KB Output is correct
28 Correct 158 ms 10288 KB Output is correct
29 Correct 168 ms 15784 KB Output is correct
30 Correct 48 ms 3308 KB Output is correct
31 Correct 1878 ms 469636 KB Output is correct
32 Correct 1985 ms 469924 KB Output is correct
33 Correct 1990 ms 469412 KB Output is correct
34 Correct 297 ms 49952 KB Output is correct
35 Correct 300 ms 45956 KB Output is correct
36 Correct 96 ms 6112 KB Output is correct
37 Correct 1831 ms 469760 KB Output is correct
38 Correct 1895 ms 469756 KB Output is correct
39 Correct 1686 ms 469736 KB Output is correct
40 Correct 156 ms 11816 KB Output is correct
41 Correct 166 ms 15660 KB Output is correct
42 Correct 47 ms 3308 KB Output is correct
43 Correct 2148 ms 558004 KB Output is correct
44 Correct 2122 ms 558160 KB Output is correct
45 Correct 2273 ms 557992 KB Output is correct
46 Correct 372 ms 66336 KB Output is correct
47 Correct 348 ms 59808 KB Output is correct
48 Correct 90 ms 5984 KB Output is correct
49 Correct 2117 ms 558008 KB Output is correct
50 Correct 1957 ms 558160 KB Output is correct
51 Correct 1856 ms 557784 KB Output is correct
52 Correct 202 ms 17320 KB Output is correct
53 Correct 211 ms 22956 KB Output is correct