oj.uz

Submission #238579

# Submission time Handle Problem Language Result Execution time Memory
238579 2020-06-12T02:39:38 Z haengsyo Exhibition (JOI19_ho_t2) C++14
100 / 100
 83 ms 4480 KB 
#pragma GCC optimize("O3")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
tree<int,int,greater<int>,rb_tree_tag,tree_order_statistics_node_update> map_t;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for(int i = 0; i < (a); ++i)
#define sz(x) (int)x.size()
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define REV(x) reverse(x.begin(),x.end())
int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};
int n,m;
const int mxN=1e5+5;
pair<int,int> arr[mxN];
int sizes[mxN];

bool comp(pair<int,int> a,pair<int,int> b) {
    if(a.second==b.second)
        return a.first<b.first;
    return a.second<b.second;
}

int main() {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    F0R(i,n)
        cin >> arr[i].first >> arr[i].second;
    F0R(i,m)
        cin >> sizes[i];
    sort(arr,arr+n,comp);
    sort(sizes,sizes+m);
    int cur=n-1;
    int res=0;
    for(int i=m-1; ~i; i--) {
        while(~cur && arr[cur].first>sizes[i])
            cur--;
        if(~cur) {
            res++; cur--;
        }
    }
    cout << res;

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 6 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 63 ms 3872 KB Output is correct
39 Correct 61 ms 3832 KB Output is correct
40 Correct 57 ms 3864 KB Output is correct
41 Correct 78 ms 3832 KB Output is correct
42 Correct 67 ms 3832 KB Output is correct
43 Correct 68 ms 3836 KB Output is correct
44 Correct 64 ms 3832 KB Output is correct
45 Correct 62 ms 3832 KB Output is correct
46 Correct 67 ms 4344 KB Output is correct
47 Correct 57 ms 3960 KB Output is correct
48 Correct 59 ms 3964 KB Output is correct
49 Correct 51 ms 3576 KB Output is correct
50 Correct 53 ms 3576 KB Output is correct
51 Correct 63 ms 4344 KB Output is correct
52 Correct 65 ms 4344 KB Output is correct
53 Correct 64 ms 4344 KB Output is correct
54 Correct 57 ms 4472 KB Output is correct
55 Correct 74 ms 4472 KB Output is correct
56 Correct 44 ms 3064 KB Output is correct
57 Correct 26 ms 1784 KB Output is correct
58 Correct 41 ms 3192 KB Output is correct
59 Correct 44 ms 3064 KB Output is correct
60 Correct 27 ms 1664 KB Output is correct
61 Correct 42 ms 2680 KB Output is correct
62 Correct 64 ms 4472 KB Output is correct
63 Correct 69 ms 4480 KB Output is correct
64 Correct 67 ms 4472 KB Output is correct
65 Correct 64 ms 4344 KB Output is correct
66 Correct 65 ms 4344 KB Output is correct
67 Correct 69 ms 4344 KB Output is correct
68 Correct 83 ms 4344 KB Output is correct
69 Correct 66 ms 4344 KB Output is correct
70 Correct 66 ms 4472 KB Output is correct
71 Correct 65 ms 4344 KB Output is correct
72 Correct 68 ms 4472 KB Output is correct
73 Correct 60 ms 4352 KB Output is correct