Submission #761972

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
761972	2023-06-20T13:12:34 Z	sysia	Exhibition (JOI19_ho_t2)	C++17	100 / 100	60 ms	6484 KB

joi2019_ho_t2

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n, m; cin >> n >> m;
    vector<T>a(n);
    for (auto &[a, b]: a) cin >> b >> a;
    //value, size
    sort(a.begin(), a.end());
    vector<int>b(m);
    for (auto &x: b) cin >> x;
    sort(b.begin(), b.end());
    debug(a);
    debug(b);
    vector<int>c(n);
    for (int i = 0; i<n; i++){
        int x = a[i].second;
        int it = lower_bound(b.begin(), b.end(), x) - b.begin();
        if (it < m) c[i] = m - it;
    }
    int mx = 0;
    for (int i = n-1; i>=0; i--){
        int now = min(c[i], mx+1);
        mx = max(mx, now);
    }
    cout << mx << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 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	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 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	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	332 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	372 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 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	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	332 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	332 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	372 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 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	43 ms	6232 KB	Output is correct
39	Correct	37 ms	6336 KB	Output is correct
40	Correct	34 ms	6368 KB	Output is correct
41	Correct	42 ms	6340 KB	Output is correct
42	Correct	41 ms	6484 KB	Output is correct
43	Correct	38 ms	6352 KB	Output is correct
44	Correct	42 ms	6232 KB	Output is correct
45	Correct	46 ms	6220 KB	Output is correct
46	Correct	38 ms	6236 KB	Output is correct
47	Correct	42 ms	5720 KB	Output is correct
48	Correct	35 ms	5716 KB	Output is correct
49	Correct	36 ms	4992 KB	Output is correct
50	Correct	33 ms	4992 KB	Output is correct
51	Correct	44 ms	6360 KB	Output is correct
52	Correct	38 ms	6352 KB	Output is correct
53	Correct	38 ms	6232 KB	Output is correct
54	Correct	33 ms	6352 KB	Output is correct
55	Correct	41 ms	6344 KB	Output is correct
56	Correct	24 ms	4564 KB	Output is correct
57	Correct	14 ms	2008 KB	Output is correct
58	Correct	23 ms	4564 KB	Output is correct
59	Correct	29 ms	4580 KB	Output is correct
60	Correct	14 ms	2004 KB	Output is correct
61	Correct	26 ms	3436 KB	Output is correct
62	Correct	50 ms	6244 KB	Output is correct
63	Correct	47 ms	6336 KB	Output is correct
64	Correct	49 ms	6236 KB	Output is correct
65	Correct	48 ms	6240 KB	Output is correct
66	Correct	47 ms	6248 KB	Output is correct
67	Correct	48 ms	6252 KB	Output is correct
68	Correct	48 ms	6364 KB	Output is correct
69	Correct	60 ms	6352 KB	Output is correct
70	Correct	49 ms	6232 KB	Output is correct
71	Correct	47 ms	6356 KB	Output is correct
72	Correct	45 ms	6348 KB	Output is correct
73	Correct	42 ms	6348 KB	Output is correct

Submission #761972

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