Submission #155667

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
155667	2019-09-29T15:43:55 Z	popovicirobert	Exhibition (JOI19_ho_t2)	C++14	100 / 100	82 ms	5368 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



#if 0
const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;



int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, n, m;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m;

    vector < pair <int, int> > a(n);
    for(i = 0; i < n; i++) {
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(), a.end());

    vector < pair <int, int> > b(n);
    for(i = 0; i < n; i++) {
        b[i] = {a[i].second, i};
    }
    sort(b.begin(), b.end());

    vector <int> c(m);
    for(i = 0; i < m; i++) {
        cin >> c[i];
    }
    sort(c.begin(), c.end());

    auto check = [&](int p) -> bool {
        p = m - p;
        for(int i = 0; i < n; i++) {
            if(p < m && c[p] >= a[i].second) {
                p++;
            }
        }
        return p == m;
    };

    int res = 0;
    for(int step = 1 << 17; step; step >>= 1) {
        if(res + step <= min(n, m) && check(res + step)) {
            res += step;
        }
    }

    cout << res;

    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	348 KB	Output is correct
29	Correct	3 ms	380 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	3 ms	376 KB	Output is correct
33	Correct	1 ms	376 KB	Output is correct
34	Correct	3 ms	376 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	3 ms	376 KB	Output is correct
22	Correct	3 ms	376 KB	Output is correct
23	Correct	3 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	348 KB	Output is correct
29	Correct	3 ms	380 KB	Output is correct
30	Correct	3 ms	376 KB	Output is correct
31	Correct	3 ms	376 KB	Output is correct
32	Correct	3 ms	376 KB	Output is correct
33	Correct	1 ms	376 KB	Output is correct
34	Correct	3 ms	376 KB	Output is correct
35	Correct	3 ms	376 KB	Output is correct
36	Correct	3 ms	376 KB	Output is correct
37	Correct	3 ms	376 KB	Output is correct
38	Correct	69 ms	5240 KB	Output is correct
39	Correct	66 ms	5240 KB	Output is correct
40	Correct	62 ms	5240 KB	Output is correct
41	Correct	69 ms	5256 KB	Output is correct
42	Correct	72 ms	5240 KB	Output is correct
43	Correct	64 ms	5368 KB	Output is correct
44	Correct	72 ms	5368 KB	Output is correct
45	Correct	76 ms	5144 KB	Output is correct
46	Correct	71 ms	5128 KB	Output is correct
47	Correct	69 ms	4728 KB	Output is correct
48	Correct	68 ms	5008 KB	Output is correct
49	Correct	59 ms	4088 KB	Output is correct
50	Correct	57 ms	4088 KB	Output is correct
51	Correct	80 ms	5240 KB	Output is correct
52	Correct	80 ms	5368 KB	Output is correct
53	Correct	80 ms	5116 KB	Output is correct
54	Correct	62 ms	5240 KB	Output is correct
55	Correct	72 ms	5368 KB	Output is correct
56	Correct	50 ms	3848 KB	Output is correct
57	Correct	25 ms	1660 KB	Output is correct
58	Correct	45 ms	3804 KB	Output is correct
59	Correct	51 ms	3848 KB	Output is correct
60	Correct	25 ms	1784 KB	Output is correct
61	Correct	43 ms	2936 KB	Output is correct
62	Correct	80 ms	5128 KB	Output is correct
63	Correct	79 ms	5240 KB	Output is correct
64	Correct	80 ms	5164 KB	Output is correct
65	Correct	79 ms	5240 KB	Output is correct
66	Correct	80 ms	5240 KB	Output is correct
67	Correct	80 ms	5240 KB	Output is correct
68	Correct	79 ms	5168 KB	Output is correct
69	Correct	82 ms	5240 KB	Output is correct
70	Correct	82 ms	5156 KB	Output is correct
71	Correct	80 ms	5240 KB	Output is correct
72	Correct	81 ms	5240 KB	Output is correct
73	Correct	79 ms	5240 KB	Output is correct

Submission #155667

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
50.0 / 50.0