답안 #1085311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1085311	2024-09-07T23:41:21 Z	ShaShi	Exhibition (JOI19_ho_t2)	C++17	100 / 100	45 ms	5724 KB

joi2019_ho_t2

#include <bits/stdc++.h>
 
#define int long long
 
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
 
#define F first 
#define S second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define kill(x) cout << x << "\n", exit(0);
#define pii pair<int, int>
#define endl "\n"
 
 
 
using namespace std;
typedef long long ll;
// typedef __int128_t lll;
typedef long double ld;
 
const int MAXN = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e18 + 7;


int n, m, k, tmp, t, tmp2, tmp3, tmp4, u, v, w, flag, q, ans, flag2;
pii arr[MAXN];
int arr2[MAXN];


bool check(int k) {
    int j = m-k+1;

    for (int i=1; i<=n; i++) {
        if (arr[i].S <= arr2[j]) j++;

        if (j > m) return 1;
    }

    return 0;
}



int32_t main() {
    #ifdef LOCAL
    freopen("inp.in", "r", stdin);
    freopen("res.out", "w", stdout);
    #else
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif

    cin >> n >> m;

    for (int i=1; i<=n; i++) cin >> arr[i].S >> arr[i].F;
    sort(arr+1, arr+n+1);

    for (int i=1; i<=m; i++) cin >> arr2[i];
    sort(arr2+1, arr2+m+1);

    if (check(m)) kill(m);

    int l, r, mid;

    l = 0; r = m;

    while (r-l > 1) {
        mid = (l+r)/2;

        if (check(mid)) l = mid;
        else r = mid;
    }

    cout << l << endl;


    return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	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	344 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	436 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct

Subtask #2
40.0 / 40.0

#	결과	실행 시간	메모리	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	344 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	436 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	520 KB	Output is correct
21	Correct	1 ms	484 KB	Output is correct
22	Correct	1 ms	344 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	352 KB	Output is correct
27	Correct	1 ms	484 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 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	504 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 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

#	결과	실행 시간	메모리	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	344 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	436 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	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	520 KB	Output is correct
21	Correct	1 ms	484 KB	Output is correct
22	Correct	1 ms	344 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	352 KB	Output is correct
27	Correct	1 ms	484 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 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	504 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	1 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	32 ms	5620 KB	Output is correct
39	Correct	30 ms	5456 KB	Output is correct
40	Correct	27 ms	5720 KB	Output is correct
41	Correct	33 ms	5480 KB	Output is correct
42	Correct	36 ms	5712 KB	Output is correct
43	Correct	35 ms	5712 KB	Output is correct
44	Correct	35 ms	5464 KB	Output is correct
45	Correct	34 ms	5440 KB	Output is correct
46	Correct	31 ms	5464 KB	Output is correct
47	Correct	29 ms	4956 KB	Output is correct
48	Correct	29 ms	4964 KB	Output is correct
49	Correct	29 ms	4436 KB	Output is correct
50	Correct	28 ms	4408 KB	Output is correct
51	Correct	37 ms	5464 KB	Output is correct
52	Correct	35 ms	5716 KB	Output is correct
53	Correct	34 ms	5572 KB	Output is correct
54	Correct	28 ms	5716 KB	Output is correct
55	Correct	34 ms	5716 KB	Output is correct
56	Correct	21 ms	3928 KB	Output is correct
57	Correct	13 ms	2136 KB	Output is correct
58	Correct	20 ms	3940 KB	Output is correct
59	Correct	20 ms	3776 KB	Output is correct
60	Correct	13 ms	2140 KB	Output is correct
61	Correct	25 ms	3420 KB	Output is correct
62	Correct	38 ms	5460 KB	Output is correct
63	Correct	38 ms	5648 KB	Output is correct
64	Correct	40 ms	5548 KB	Output is correct
65	Correct	41 ms	5724 KB	Output is correct
66	Correct	39 ms	5712 KB	Output is correct
67	Correct	39 ms	5724 KB	Output is correct
68	Correct	45 ms	5716 KB	Output is correct
69	Correct	39 ms	5724 KB	Output is correct
70	Correct	37 ms	5712 KB	Output is correct
71	Correct	38 ms	5476 KB	Output is correct
72	Correct	37 ms	5512 KB	Output is correct
73	Correct	37 ms	5712 KB	Output is correct

답안 #1085311

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