Submission #884803

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
884803	2023-12-08T12:53:33 Z	vantien	Exhibition (JOI19_ho_t2)	C++14	100 / 100	49 ms	3420 KB

joi2019_ho_t2

// cre : Nguyen Van Tien

#include <bits/stdc++.h>
#define REP(i,a,b) for (int i = a;i<b;++i)
#define FOR(i,a,b) for (int i = a;i>b;--i)
#define STEP(i,a,b,c) for (int i = a;i<b;i+=c)
#define STEPD(i,a,b,c) for (int i = a;i>b;i-=c)
#define ll long long
#define name "TEST"
using namespace std;

/*
---------------------------------
   Nguyen Van Tien - vantien1526
   Mê cách ngài define
---------------------------------
*/

const int N = 1e5 + 6;
int n,m,C[N],check[N],check1[N];
struct Arr{
    int s,v;
} arr[N];

bool cmp(Arr a,Arr b){
    if (a.v != b.v) return a.v > b.v;
    return a.s > b.s;
}

void sub1(){
    sort(arr + 1,arr + n + 1,cmp);
    sort(C + 1,C + m + 1);
    int cnt = 0;
    FOR (i,m,0){
        REP (j,1,n+1){
            if (arr[j].s <= C[i] && !check1[j] && !check[i]){
                cnt++;
                check[i] = check1[j] = 1;
                break;
            }
        }
    }
    cout << cnt;
}

void sub2(){
    sort(arr + 1,arr + n + 1,cmp);
    sort(C + 1,C + m + 1);
    int cnt = 0,ans = m;
    REP (i,1,n+1){
        int l = 1,r = ans,check = 0;
        while (l <= r){
            int mid = l + r >> 1;
            if (C[mid] >= arr[i].s){
                ans = mid-1;
                l = mid + 1;
                check = 1;
            }
            else{
                l = mid + 1;
            }
        }
        if (check) cnt++;
    }
    cout << cnt;
}

void solve(){ 
    cin >> n >> m; 
    REP (i,1,n+1) cin >> arr[i].s >> arr[i].v;
    REP (i,1,m+1) cin >> C[i];
    if (n <= 1000 && m <= 1000) sub1();
    else sub2();
}

int main()
{    
    ios_base :: sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    
    //freopen(name".INP","r",stdin);
    //freopen(name".OUT","w",stdout);
    
    int t ; t = 1 ; REP (i,0,t) solve();
    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'void sub2()':
joi2019_ho_t2.cpp:53:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |             int mid = l + r >> 1;
      |                       ~~^~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 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	348 KB	Output is correct
8	Correct	0 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 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	0 ms	468 KB	Output is correct
17	Correct	1 ms	756 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	468 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 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	348 KB	Output is correct
8	Correct	0 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 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	0 ms	468 KB	Output is correct
17	Correct	1 ms	756 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	468 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	1 ms	348 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	600 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	476 KB	Output is correct
30	Correct	1 ms	508 KB	Output is correct
31	Correct	2 ms	484 KB	Output is correct
32	Correct	1 ms	356 KB	Output is correct
33	Correct	0 ms	492 KB	Output is correct
34	Correct	1 ms	352 KB	Output is correct
35	Correct	1 ms	360 KB	Output is correct
36	Correct	1 ms	352 KB	Output is correct
37	Correct	2 ms	360 KB	Output is correct

Subtask #3
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 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	348 KB	Output is correct
8	Correct	0 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	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 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	0 ms	468 KB	Output is correct
17	Correct	1 ms	756 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	468 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	2 ms	348 KB	Output is correct
23	Correct	1 ms	348 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	600 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	476 KB	Output is correct
30	Correct	1 ms	508 KB	Output is correct
31	Correct	2 ms	484 KB	Output is correct
32	Correct	1 ms	356 KB	Output is correct
33	Correct	0 ms	492 KB	Output is correct
34	Correct	1 ms	352 KB	Output is correct
35	Correct	1 ms	360 KB	Output is correct
36	Correct	1 ms	352 KB	Output is correct
37	Correct	2 ms	360 KB	Output is correct
38	Correct	40 ms	3376 KB	Output is correct
39	Correct	38 ms	3160 KB	Output is correct
40	Correct	37 ms	3404 KB	Output is correct
41	Correct	40 ms	3240 KB	Output is correct
42	Correct	49 ms	3168 KB	Output is correct
43	Correct	40 ms	3416 KB	Output is correct
44	Correct	39 ms	3400 KB	Output is correct
45	Correct	42 ms	3400 KB	Output is correct
46	Correct	38 ms	3204 KB	Output is correct
47	Correct	37 ms	2888 KB	Output is correct
48	Correct	36 ms	2820 KB	Output is correct
49	Correct	32 ms	2644 KB	Output is correct
50	Correct	34 ms	2460 KB	Output is correct
51	Correct	39 ms	3184 KB	Output is correct
52	Correct	41 ms	3156 KB	Output is correct
53	Correct	39 ms	3320 KB	Output is correct
54	Correct	36 ms	3416 KB	Output is correct
55	Correct	40 ms	3292 KB	Output is correct
56	Correct	25 ms	2784 KB	Output is correct
57	Correct	14 ms	1372 KB	Output is correct
58	Correct	23 ms	2384 KB	Output is correct
59	Correct	25 ms	2396 KB	Output is correct
60	Correct	14 ms	1372 KB	Output is correct
61	Correct	27 ms	2140 KB	Output is correct
62	Correct	41 ms	3220 KB	Output is correct
63	Correct	43 ms	3164 KB	Output is correct
64	Correct	40 ms	3328 KB	Output is correct
65	Correct	40 ms	3404 KB	Output is correct
66	Correct	40 ms	3404 KB	Output is correct
67	Correct	46 ms	3400 KB	Output is correct
68	Correct	42 ms	3400 KB	Output is correct
69	Correct	42 ms	3196 KB	Output is correct
70	Correct	41 ms	3420 KB	Output is correct
71	Correct	40 ms	3408 KB	Output is correct
72	Correct	40 ms	3408 KB	Output is correct
73	Correct	39 ms	3156 KB	Output is correct

Submission #884803

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