Submission #707199

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
707199	2023-03-08T15:13:56 Z	Alihan_8	Exhibition (JOI19_ho_t2)	C++17	100 / 100	69 ms	5580 KB

joi2019_ho_t2

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    vector <pair<int,int>> p(n);
    for ( auto &[r, l]: p ) cin >> l >> r;
    vector <int> C(m);
    for ( auto &i: C ) cin >> i;
    sort(all(C)); sort(all(p));
    for ( auto &[l, r]: p ) swap(l, r);
    auto ok = [&](int X){
        int it = 0;
        for ( int i = m-X; i < m; i++ ){
            while ( it < n and p[it].first > C[i] ) it++;
            if ( it == n ) return false;
            it++;
        }
        return true;
    };
    int l = 0, r = min(m+1, n+1);
    while ( l+1 < r ){
        int md = (l+r) >> 1;
        if ( ok(md) ) l = md;
        else r = md;
    }
    cout << l;

    cout << '\n';
}

Compilation message

joi2019_ho_t2.cpp: In function 'void IO(std::string)':
joi2019_ho_t2.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 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	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 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	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	2 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	2 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	340 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	368 KB	Output is correct
29	Correct	1 ms	328 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	372 KB	Output is correct
32	Correct	1 ms	356 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	332 KB	Output is correct
36	Correct	2 ms	340 KB	Output is correct
37	Correct	2 ms	308 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	320 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	316 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	324 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	316 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	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	320 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	2 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	2 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	340 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	368 KB	Output is correct
29	Correct	1 ms	328 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	372 KB	Output is correct
32	Correct	1 ms	356 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	332 KB	Output is correct
36	Correct	2 ms	340 KB	Output is correct
37	Correct	2 ms	308 KB	Output is correct
38	Correct	45 ms	2792 KB	Output is correct
39	Correct	45 ms	2796 KB	Output is correct
40	Correct	41 ms	2788 KB	Output is correct
41	Correct	53 ms	2792 KB	Output is correct
42	Correct	47 ms	2796 KB	Output is correct
43	Correct	60 ms	2792 KB	Output is correct
44	Correct	46 ms	2788 KB	Output is correct
45	Correct	51 ms	2792 KB	Output is correct
46	Correct	41 ms	2784 KB	Output is correct
47	Correct	46 ms	2516 KB	Output is correct
48	Correct	52 ms	4972 KB	Output is correct
49	Correct	38 ms	4464 KB	Output is correct
50	Correct	36 ms	4488 KB	Output is correct
51	Correct	56 ms	5568 KB	Output is correct
52	Correct	50 ms	5572 KB	Output is correct
53	Correct	45 ms	5452 KB	Output is correct
54	Correct	38 ms	5568 KB	Output is correct
55	Correct	50 ms	5580 KB	Output is correct
56	Correct	28 ms	3800 KB	Output is correct
57	Correct	18 ms	1984 KB	Output is correct
58	Correct	30 ms	3784 KB	Output is correct
59	Correct	30 ms	3824 KB	Output is correct
60	Correct	17 ms	2004 KB	Output is correct
61	Correct	34 ms	3284 KB	Output is correct
62	Correct	49 ms	5568 KB	Output is correct
63	Correct	52 ms	5460 KB	Output is correct
64	Correct	50 ms	5444 KB	Output is correct
65	Correct	51 ms	5460 KB	Output is correct
66	Correct	60 ms	5448 KB	Output is correct
67	Correct	57 ms	5568 KB	Output is correct
68	Correct	51 ms	5564 KB	Output is correct
69	Correct	58 ms	5572 KB	Output is correct
70	Correct	69 ms	5568 KB	Output is correct
71	Correct	55 ms	5464 KB	Output is correct
72	Correct	47 ms	5460 KB	Output is correct
73	Correct	65 ms	5576 KB	Output is correct

Submission #707199

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