oj.uz

Submission #934763

# Submission time Handle Problem Language Result Execution time Memory
934763 2024-02-27T23:45:16 Z Whisper Exhibition (JOI19_ho_t2) C++17
100 / 100
 44 ms 7852 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numPic, nFrame;
pair<int, int> a[MAX];
int b[MAX];
void Whisper(){
    cin >> numPic >> nFrame;
    for (int i = 1; i <= numPic; ++i) cin >> a[i].first >> a[i].second;
    for (int i = 1; i <= nFrame; ++i) cin >> b[i];

    sort(a + 1, a + numPic + 1, [&](const pair<int, int>&a, const pair<int, int>& b){
        if (a.second == b.second) return a.first < b.first;
        return a.second < b.second;
    });
    sort(b + 1, b + nFrame + 1);

    int ans = 0;
    int j = numPic;
    for (int i = nFrame; i >= 1; --i){
        while (j > 0 && a[j].first > b[i]) --j;
        if (a[j].first <= b[i] && j > 0){
            ++ans; --j;
        }
    }
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2516 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2520 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2532 KB Output is correct
27 Correct 1 ms 2644 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2520 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 36 ms 7632 KB Output is correct
39 Correct 35 ms 7388 KB Output is correct
40 Correct 30 ms 7852 KB Output is correct
41 Correct 36 ms 7508 KB Output is correct
42 Correct 44 ms 7404 KB Output is correct
43 Correct 36 ms 7504 KB Output is correct
44 Correct 40 ms 7744 KB Output is correct
45 Correct 35 ms 7508 KB Output is correct
46 Correct 35 ms 7356 KB Output is correct
47 Correct 32 ms 7320 KB Output is correct
48 Correct 31 ms 7248 KB Output is correct
49 Correct 29 ms 7000 KB Output is correct
50 Correct 28 ms 6992 KB Output is correct
51 Correct 35 ms 7504 KB Output is correct
52 Correct 35 ms 7492 KB Output is correct
53 Correct 36 ms 7420 KB Output is correct
54 Correct 31 ms 7516 KB Output is correct
55 Correct 36 ms 7504 KB Output is correct
56 Correct 22 ms 6484 KB Output is correct
57 Correct 14 ms 3416 KB Output is correct
58 Correct 22 ms 6492 KB Output is correct
59 Correct 22 ms 6480 KB Output is correct
60 Correct 14 ms 3420 KB Output is correct
61 Correct 22 ms 4188 KB Output is correct
62 Correct 36 ms 7504 KB Output is correct
63 Correct 35 ms 7512 KB Output is correct
64 Correct 35 ms 7512 KB Output is correct
65 Correct 36 ms 7516 KB Output is correct
66 Correct 39 ms 7632 KB Output is correct
67 Correct 35 ms 7520 KB Output is correct
68 Correct 35 ms 7416 KB Output is correct
69 Correct 41 ms 7516 KB Output is correct
70 Correct 37 ms 7508 KB Output is correct
71 Correct 35 ms 7504 KB Output is correct
72 Correct 43 ms 7640 KB Output is correct
73 Correct 33 ms 7516 KB Output is correct