oj.uz

답안 #530411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
530411 2022-02-25T09:51:58 Z leu_naut Exhibition (JOI19_ho_t2) C++14
50 / 100
 1000 ms 4452 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define f first
#define s second
#define ii pair <int,int>
#define pii pair <ll,ll>

const int N = 1e5;
const int MOD = 1e9 + 7;
const ll oo = 1e18;

ii a[N + 5];
int c[N + 5],n,m;

bool ok(int x)
{
    priority_queue <int, vector <int>, greater <int>> pq;
    int j = 1, tmp = 0;
    for (int i = x; i <= m; ++i) {
        while (j <= n && c[i] >= a[j].f) {
            if (a[j].s >= tmp) pq.push(a[j].s);
            ++j;
        }
        if (pq.empty()) return false;
        tmp = pq.top();
        pq.pop();
    }
    return true;
}

int main()
{
    ios_base::sync_with_stdio(0);  cin.tie(0);
    cin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        cin >> a[i].f >> a[i].s;
    }
    for (int i = 1; i <= m; ++i) cin >> c[i];
    sort(a + 1, a + 1 + n);
    sort(c + 1, c + 1 + m);
    for (int i = 1; i <= m; ++i) {
        if (ok(i)) {
            cout << m - i + 1 << '\n';
            return 0;
        }
    }
    cout << 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 8 ms 360 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 10 ms 332 KB Output is correct
37 Correct 9 ms 332 KB Output is correct

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 2 ms 336 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 8 ms 360 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 10 ms 332 KB Output is correct
37 Correct 9 ms 332 KB Output is correct
38 Correct 43 ms 4260 KB Output is correct
39 Correct 56 ms 4276 KB Output is correct
40 Correct 50 ms 4452 KB Output is correct
41 Correct 48 ms 4324 KB Output is correct
42 Correct 43 ms 4272 KB Output is correct
43 Correct 51 ms 4292 KB Output is correct
44 Execution timed out 1036 ms 4400 KB Time limit exceeded
45 Halted 0 ms 0 KB -