Submission #535793

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
535793	2022-03-11T08:39:56 Z	browntoad	Exhibition (JOI19_ho_t2)	C++14	100 / 100	62 ms	6476 KB

joi2019_ho_t2

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=1e5+5;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================

bool cmp(pii a, pii b){
    if (b.s==a.s) return a.f>b.f;
    return a.s>b.s;
}
signed main (){
    IOS();
    int n,m; cin>>n>>m;
    vector<pii> vc(n);
    REP(i,n){
        cin>>vc[i].f>>vc[i].s;
    }
    vector<int> val(m);
    REP(i, m){
        cin>>val[i];
    }
    sort(ALL(val), greater<int> ());
    sort(ALL(vc), cmp);
    vector<int> dp(n);
    int cur=0;
    REP(i,n){
        if (cur<m&&val[cur]>=vc[i].f){
            cur++;
        }
    }
    cout<<cur<<endl;
}

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	0 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 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	0 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	2 ms	456 KB	Output is correct
21	Correct	1 ms	332 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	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 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	340 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	0 ms	212 KB	Output is correct
9	Correct	1 ms	320 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	320 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	2 ms	456 KB	Output is correct
21	Correct	1 ms	332 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	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 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	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	47 ms	6476 KB	Output is correct
39	Correct	45 ms	6348 KB	Output is correct
40	Correct	41 ms	6360 KB	Output is correct
41	Correct	54 ms	6360 KB	Output is correct
42	Correct	55 ms	6344 KB	Output is correct
43	Correct	50 ms	6232 KB	Output is correct
44	Correct	47 ms	6240 KB	Output is correct
45	Correct	48 ms	6316 KB	Output is correct
46	Correct	58 ms	6224 KB	Output is correct
47	Correct	47 ms	5800 KB	Output is correct
48	Correct	46 ms	5752 KB	Output is correct
49	Correct	41 ms	4940 KB	Output is correct
50	Correct	45 ms	4976 KB	Output is correct
51	Correct	52 ms	6332 KB	Output is correct
52	Correct	51 ms	6356 KB	Output is correct
53	Correct	50 ms	6352 KB	Output is correct
54	Correct	42 ms	6372 KB	Output is correct
55	Correct	62 ms	6352 KB	Output is correct
56	Correct	32 ms	4568 KB	Output is correct
57	Correct	18 ms	1992 KB	Output is correct
58	Correct	35 ms	4568 KB	Output is correct
59	Correct	32 ms	4600 KB	Output is correct
60	Correct	19 ms	2000 KB	Output is correct
61	Correct	32 ms	3548 KB	Output is correct
62	Correct	55 ms	6348 KB	Output is correct
63	Correct	48 ms	6352 KB	Output is correct
64	Correct	50 ms	6344 KB	Output is correct
65	Correct	55 ms	6336 KB	Output is correct
66	Correct	58 ms	6356 KB	Output is correct
67	Correct	58 ms	6348 KB	Output is correct
68	Correct	49 ms	6364 KB	Output is correct
69	Correct	54 ms	6348 KB	Output is correct
70	Correct	53 ms	6340 KB	Output is correct
71	Correct	53 ms	6344 KB	Output is correct
72	Correct	50 ms	6352 KB	Output is correct
73	Correct	48 ms	6352 KB	Output is correct

Submission #535793

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