Submission #1010229

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1010229	2024-06-28T13:49:28 Z	ivan_alexeev	Exhibition (JOI19_ho_t2)	C++17	100 / 100	44 ms	4528 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>

/*
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,bmi2,fma,popcnt")
*/

#ifdef lisie_bimbi
#define debug(x) cout << #x << " : " << x << endl;
#else
#define debug(x) ;
#define endl '\n'
#endif

//#define int long long
#define inf 1000000000
#define double long double
typedef long long ll;



signed main(){
#ifdef lisie_bimbi
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int n, m;
    cin >> n >> m;
    vector<int> c(m);
    vector<pair<int, int>> a(n);
    for(int i = 0 ; i < n; i++){
        cin >> a[i].second >> a[i].first;
    }
    for(int i = 0; i < m; i++){
        cin >> c[i];
    }
    std::sort(a.begin(), a.end());
    std::sort(c.begin(), c.end());
    std::reverse(a.begin(), a.end());
    std::reverse(c.begin(), c.end());
    int a1 = 0;
    int c1 = 0;
    int ans = 0;
    while((a1 != n) && (c1 != m)){
        if(a[a1].second <= c[c1]){
            ans++;
            a1++;
            c1++;
        }else{
            a1++;
        }
    }
    cout << ans;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	456 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	460 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	0 ms	460 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	37 ms	4444 KB	Output is correct
39	Correct	31 ms	4444 KB	Output is correct
40	Correct	28 ms	4444 KB	Output is correct
41	Correct	36 ms	4432 KB	Output is correct
42	Correct	35 ms	4528 KB	Output is correct
43	Correct	43 ms	4432 KB	Output is correct
44	Correct	36 ms	4308 KB	Output is correct
45	Correct	33 ms	4432 KB	Output is correct
46	Correct	32 ms	4436 KB	Output is correct
47	Correct	33 ms	3928 KB	Output is correct
48	Correct	29 ms	3932 KB	Output is correct
49	Correct	36 ms	3572 KB	Output is correct
50	Correct	27 ms	3564 KB	Output is correct
51	Correct	32 ms	4444 KB	Output is correct
52	Correct	30 ms	4440 KB	Output is correct
53	Correct	33 ms	4444 KB	Output is correct
54	Correct	30 ms	4432 KB	Output is correct
55	Correct	44 ms	4444 KB	Output is correct
56	Correct	21 ms	3160 KB	Output is correct
57	Correct	13 ms	1628 KB	Output is correct
58	Correct	20 ms	3032 KB	Output is correct
59	Correct	21 ms	3160 KB	Output is correct
60	Correct	13 ms	1624 KB	Output is correct
61	Correct	21 ms	2652 KB	Output is correct
62	Correct	35 ms	4324 KB	Output is correct
63	Correct	43 ms	4436 KB	Output is correct
64	Correct	34 ms	4452 KB	Output is correct
65	Correct	37 ms	4432 KB	Output is correct
66	Correct	33 ms	4328 KB	Output is correct
67	Correct	33 ms	4432 KB	Output is correct
68	Correct	35 ms	4440 KB	Output is correct
69	Correct	33 ms	4316 KB	Output is correct
70	Correct	35 ms	4436 KB	Output is correct
71	Correct	32 ms	4432 KB	Output is correct
72	Correct	34 ms	4444 KB	Output is correct
73	Correct	32 ms	4444 KB	Output is correct

Submission #1010229

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