Submission #767102

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
767102	2023-06-26T11:41:33 Z	Nelt	Exhibition (JOI19_ho_t2)	C++17	100 / 100	50 ms	5588 KB

joi2019_ho_t2

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
void solve()
{
    ll n, m;
    cin >> n >> m;
    pp(ll, ll) a[n];
    ll c[m];
    for (ll i = 0; i < n; i++)
        cin >> a[i].S >> a[i].F;
    for (ll i = 0; i < m; i++) 
        cin >> c[i];
    sort(all(a));
    sort(all(c));
    ll ans = 0, pos;
    for (ll i = n - 1; i >= 0; i--)
    {
        pos = lower_bound(all(c), a[i].S) - c;
        ans += m - pos - 1 >= ans;
    }
    cout << ans << endl;
}
/*
 
*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	0 ms	320 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	324 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	336 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	42 ms	5460 KB	Output is correct
39	Correct	37 ms	5448 KB	Output is correct
40	Correct	33 ms	5588 KB	Output is correct
41	Correct	41 ms	5460 KB	Output is correct
42	Correct	38 ms	5464 KB	Output is correct
43	Correct	39 ms	5544 KB	Output is correct
44	Correct	42 ms	5460 KB	Output is correct
45	Correct	45 ms	5444 KB	Output is correct
46	Correct	39 ms	5520 KB	Output is correct
47	Correct	42 ms	4968 KB	Output is correct
48	Correct	35 ms	4964 KB	Output is correct
49	Correct	36 ms	4480 KB	Output is correct
50	Correct	33 ms	4436 KB	Output is correct
51	Correct	40 ms	5560 KB	Output is correct
52	Correct	38 ms	5444 KB	Output is correct
53	Correct	38 ms	5448 KB	Output is correct
54	Correct	32 ms	5460 KB	Output is correct
55	Correct	41 ms	5452 KB	Output is correct
56	Correct	24 ms	3780 KB	Output is correct
57	Correct	17 ms	2072 KB	Output is correct
58	Correct	23 ms	3772 KB	Output is correct
59	Correct	31 ms	3832 KB	Output is correct
60	Correct	15 ms	1972 KB	Output is correct
61	Correct	26 ms	3160 KB	Output is correct
62	Correct	47 ms	5552 KB	Output is correct
63	Correct	47 ms	5456 KB	Output is correct
64	Correct	47 ms	5460 KB	Output is correct
65	Correct	47 ms	5456 KB	Output is correct
66	Correct	47 ms	5464 KB	Output is correct
67	Correct	50 ms	5460 KB	Output is correct
68	Correct	47 ms	5452 KB	Output is correct
69	Correct	47 ms	5448 KB	Output is correct
70	Correct	48 ms	5444 KB	Output is correct
71	Correct	46 ms	5548 KB	Output is correct
72	Correct	46 ms	5460 KB	Output is correct
73	Correct	42 ms	5552 KB	Output is correct

Submission #767102

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