oj.uz

답안 #554021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554021 2022-04-27T14:50:18 Z AA_Surely Examination (JOI19_examination) C++14
2 / 100
 3000 ms 7184 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;

typedef pair<int, int> 	PII;
typedef vector<int> 	VI;
typedef vector<PII> 	VPII;

const int N = 1e5 + 7;
const int SQ = 320;
const int TOF = 500;

struct Tutee {
    int a, b, c;

    inline bool operator < (const Tutee other) {
        return c > other.c;
    }

} ns[N], gooni[N];

struct Query {
    int ma, mb, mc, id;

    inline bool operator < (const Query other) {
        return mc > other.mc;
    }
} qs[N];

int n, q, sz;
VPII keep[SQ];
VI kp[SQ];
int ans[N];

void init() {
    cin >> n >> q;
    VI comp;

    F0R(i, n) {
        cin >> ns[i].a >> ns[i].b;
        ns[i].c = ns[i].a + ns[i].b;
    }

    F0R(i, q) {
        cin >> qs[i].ma >> qs[i].mb >> qs[i].mc;
        qs[i].id = i;
    }

    comp.resize(n);
    F0R(i, n) comp[i] = ns[i].a;
    sort(ALL(comp));
    comp.resize(unique(ALL(comp)) - comp.begin());
    F0R(i, n) ns[i].a = lower_bound(ALL(comp), ns[i].a) - comp.begin();
    F0R(i, q) qs[i].ma = lower_bound(ALL(comp), qs[i].ma) - comp.begin();

    comp.resize(n);
    F0R(i, n) comp[i] = ns[i].b;
    sort(ALL(comp));
    comp.resize(unique(ALL(comp)) - comp.begin());
    F0R(i, n) ns[i].b = lower_bound(ALL(comp), ns[i].b) - comp.begin();
    F0R(i, q) qs[i].mb = lower_bound(ALL(comp), qs[i].mb) - comp.begin();

    comp.resize(n);
    F0R(i, n) comp[i] = ns[i].c;
    sort(ALL(comp));
    comp.resize(unique(ALL(comp)) - comp.begin());
    F0R(i, n) ns[i].c = lower_bound(ALL(comp), ns[i].c) - comp.begin();
    F0R(i, q) qs[i].mc = lower_bound(ALL(comp), qs[i].mc) - comp.begin();

    return;
}

inline void rebuild() {
    F0R(i, sz) {
        keep[gooni[i].a / SQ].pb({gooni[i].b, gooni[i].a});
        kp[gooni[i].a / SQ].pb(gooni[i].b);
    }
    
    sz = 0;

    F0R(i, SQ) {
        sort(ALL(keep[i]));
        sort(ALL(kp[i]));
    }

    return;
}

inline int getKeep(int p) {
    int dasti = qs[p].ma / SQ;

    int ret = 0;
    for(const PII &on : keep[dasti]) 
        ret += (on.S >= qs[p].ma && on.F >= qs[p].mb);

    FOR(i, dasti + 1, SQ) ret += kp[i].size() - (lower_bound(ALL(kp[i]), qs[p].mb) - kp[i].begin());
    return ret;
}

inline int getGooni(int p) {
    int ret = 0;
    F0R(i, sz)
        ret += (gooni[i].a >= qs[p].ma && gooni[i].b >= qs[p].mb);
    return ret;
}

int main() {
    IOS;
    
    init();
    sort(qs, qs + q);
    sort(ns, ns + n);
    
    int ptr = 0;
    F0R(i, q) {
        while(ptr < n && ns[ptr].c >= qs[i].mc) gooni[sz++] = ns[ptr++];
        if (sz >= TOF) rebuild();

        ans[ qs[i].id ] = getKeep(i) + getGooni(i);
    }

    F0R(i, q) cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 12 ms 584 KB Output is correct
8 Correct 10 ms 596 KB Output is correct
9 Correct 10 ms 512 KB Output is correct
10 Correct 9 ms 468 KB Output is correct
11 Correct 18 ms 468 KB Output is correct
12 Correct 10 ms 520 KB Output is correct
13 Correct 10 ms 552 KB Output is correct
14 Correct 10 ms 456 KB Output is correct
15 Correct 10 ms 552 KB Output is correct
16 Correct 16 ms 540 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 468 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 752 ms 6992 KB Output is correct
2 Correct 769 ms 7184 KB Output is correct
3 Correct 754 ms 7028 KB Output is correct
4 Correct 504 ms 6820 KB Output is correct
5 Execution timed out 3063 ms 6044 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 752 ms 6992 KB Output is correct
2 Correct 769 ms 7184 KB Output is correct
3 Correct 754 ms 7028 KB Output is correct
4 Correct 504 ms 6820 KB Output is correct
5 Execution timed out 3063 ms 6044 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 12 ms 584 KB Output is correct
8 Correct 10 ms 596 KB Output is correct
9 Correct 10 ms 512 KB Output is correct
10 Correct 9 ms 468 KB Output is correct
11 Correct 18 ms 468 KB Output is correct
12 Correct 10 ms 520 KB Output is correct
13 Correct 10 ms 552 KB Output is correct
14 Correct 10 ms 456 KB Output is correct
15 Correct 10 ms 552 KB Output is correct
16 Correct 16 ms 540 KB Output is correct
17 Correct 8 ms 504 KB Output is correct
18 Correct 8 ms 468 KB Output is correct
19 Correct 752 ms 6992 KB Output is correct
20 Correct 769 ms 7184 KB Output is correct
21 Correct 754 ms 7028 KB Output is correct
22 Correct 504 ms 6820 KB Output is correct
23 Execution timed out 3063 ms 6044 KB Time limit exceeded
24 Halted 0 ms 0 KB -