oj.uz

답안 #481198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
481198 2021-10-19T19:13:48 Z Lobo Exhibition (JOI19_ho_t2) C++17
50 / 100
 1000 ms 1772 KB 
#include <bits/stdc++.h>
 
using namespace std;

const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 100010

ii n, m, bit[maxn];
pair<ii,ii> p[maxn];

void att(ii pos, ii val) {
    for(ii i = pos; i <= m; i+= i&-i) {
        bit[i] = max(bit[i],val);
    }
}

ii query(ii pos) {
    ii ans = 0;
    for(ii i = pos; i > 0; i-= i&-i) {
        ans = max(ans, bit[i]);
    }

    return ans;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);

    //freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    cin >> n >> m;

    for(ii i = 1; i <= n; i++) {
        cin >> p[i].sc >> p[i].fr;
    }

    vector<ii> c;
    for(ii i = 1; i <= m; i++) {
        ii x;cin >> x;
        c.pb(x);
    }
    c.pb(INFii);

    sort(p+1,p+1+n);
    sort(all(c));

    priority_queue<pair<ii,ii>> q;
    for(ii i = 1; i <= n; i++) {
        ii x = lower_bound(all(c),p[i].sc)-c.begin()+1;
        if(x > m) continue;
        ii qrr = query(x-1)+1;
        att(x,qrr);

        vector<pair<ii,ii>> col;
        while(q.size() > 0 && x <= q.top().fr) {
            att(q.top().fr,q.top().sc);
            auto aux = q.top();

            q.pop();
            if(aux.fr+1 <= m) col.pb(mp(aux.fr+1,aux.sc+1));
        }

        for(auto aux : col) {
            q.push(aux);
        }

        if(x+1 <= m) q.push(mp(x+1,qrr+1));


    }

    cout << query(m) << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 21 ms 332 KB Output is correct
21 Correct 4 ms 356 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 27 ms 364 KB Output is correct
25 Correct 26 ms 332 KB Output is correct
26 Correct 26 ms 352 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 41 ms 352 KB Output is correct
30 Correct 7 ms 332 KB Output is correct
31 Correct 20 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 11 ms 352 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 19 ms 332 KB Output is correct
37 Correct 18 ms 340 KB Output is correct
38 Execution timed out 1081 ms 1772 KB Time limit exceeded
39 Halted 0 ms 0 KB -