Submission #788261

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
788261	2023-07-20T03:57:31 Z	christinelynn	Exhibition (JOI19_ho_t2)	C++17	100 / 100	47 ms	5604 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
 
#define v          vector
#define int        long long
#define all(a)     (a).begin(), (a).end()
#define pb         push_back
#define mk         make_pair
#define pii        pair<int, int>
#define ff         first
#define ss         second
#define inp_v(vec) for (auto &i : vec) cin >> i;
#define prt_v(vec) for (auto i : vec) cout << i << endl;
#define MS(x)     memset(x, 0, sizeof(x))
#define gcd(a,b)   __gcd(a, b);
#define lcm(a,b)   (a*(b/gcd(a,b)))
#define lb         lower_bound
#define ub         upper_bound
bool chmin(int &a, int b){return b<a?a=b, true:false;}
bool chmax(int &a, int b){return b>a?a=b, true:false;}
 const int mod=1e9+7;
 const int h=1000000000;
bool comp(const pair<int, int>&a, const pair<int, int>&b){
    if(a.second==b.second)return a.first>b.first;
    return a.second>b.second;
}
signed main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int N, M;cin>>N>>M;
    vector<pair<int, int>>A(N);
    vector<int>B(M);
    for(int i=0;i<N;i++){
        cin>>A[i].first>>A[i].second;
    }
    for(auto &i:B)cin>>i;
    sort(B.begin(), B.end(), greater<int>());
    sort(A.begin(), A.end(), comp);
    int idx=0, ans=0;
    for(auto i:A){
        if(idx<M&&i.first<=B[idx]){
            idx++;
            // cout<<i.first<<" "<<B[idx]<<endl;
        }
    }
    cout<<idx<<endl;

    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:38:16: warning: unused variable 'ans' [-Wunused-variable]
   38 |     int idx=0, ans=0;
      |                ^~~

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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 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	316 KB	Output is correct
17	Correct	0 ms	320 KB	Output is correct
18	Correct	0 ms	320 KB	Output is correct
19	Correct	1 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 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	316 KB	Output is correct
17	Correct	0 ms	320 KB	Output is correct
18	Correct	0 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 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	336 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	336 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	336 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	212 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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 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	316 KB	Output is correct
17	Correct	0 ms	320 KB	Output is correct
18	Correct	0 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 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	336 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	336 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	336 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	212 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	39 ms	5564 KB	Output is correct
39	Correct	37 ms	5552 KB	Output is correct
40	Correct	37 ms	5604 KB	Output is correct
41	Correct	40 ms	5568 KB	Output is correct
42	Correct	40 ms	5568 KB	Output is correct
43	Correct	40 ms	5568 KB	Output is correct
44	Correct	42 ms	5580 KB	Output is correct
45	Correct	39 ms	5484 KB	Output is correct
46	Correct	41 ms	5460 KB	Output is correct
47	Correct	35 ms	5020 KB	Output is correct
48	Correct	36 ms	5016 KB	Output is correct
49	Correct	33 ms	4488 KB	Output is correct
50	Correct	31 ms	4428 KB	Output is correct
51	Correct	39 ms	5476 KB	Output is correct
52	Correct	40 ms	5476 KB	Output is correct
53	Correct	39 ms	5476 KB	Output is correct
54	Correct	35 ms	5476 KB	Output is correct
55	Correct	40 ms	5580 KB	Output is correct
56	Correct	25 ms	3796 KB	Output is correct
57	Correct	15 ms	1996 KB	Output is correct
58	Correct	24 ms	3808 KB	Output is correct
59	Correct	25 ms	3788 KB	Output is correct
60	Correct	15 ms	2096 KB	Output is correct
61	Correct	23 ms	3176 KB	Output is correct
62	Correct	46 ms	5480 KB	Output is correct
63	Correct	47 ms	5560 KB	Output is correct
64	Correct	39 ms	5560 KB	Output is correct
65	Correct	44 ms	5588 KB	Output is correct
66	Correct	39 ms	5580 KB	Output is correct
67	Correct	39 ms	5476 KB	Output is correct
68	Correct	39 ms	5584 KB	Output is correct
69	Correct	40 ms	5576 KB	Output is correct
70	Correct	47 ms	5452 KB	Output is correct
71	Correct	45 ms	5480 KB	Output is correct
72	Correct	41 ms	5472 KB	Output is correct
73	Correct	38 ms	5484 KB	Output is correct

Submission #788261

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