oj.uz

Submission #1015399

# Submission time Handle Problem Language Result Execution time Memory
1015399 2024-07-06T10:12:27 Z Cookie None (JOI16_matryoshka) C++14
100 / 100
 176 ms 17872 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
#define sz(a) (int)a.size()
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mpp make_pair
const int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const int mxn = 2e5 + 5;
const ll inf = 2e9 + 1;

struct Q{
    int a, b, id;
    bool operator <(const Q &other){
        return(a > other.a);
    }
};
int n, q;
pll doll[mxn + 1];
int bit[mxn + 1], l[mxn + 1], ans[mxn + 1];
vt<int>comp;
void upd(int p, int v){
    while(p <= sz(comp)){
        bit[p] = max(bit[p], v); p += p & (-p);
    }
}
int get(int p){
    int ans = 0;
    while(p){
        ans = max(ans, bit[p]); p -= p & (-p);
    }
    return(ans);
}

bool cmp(pll a, pll b){
    if(a.fi != b.fi)return(a.fi > b.fi);
    return(a.se < b.se);
}
int find(int x){
    return(lower_bound(ALL(comp), x) - comp.begin() + 1);
}
Q queries[mxn + 1];
void solve(){
    cin >> n >> q;
    for(int i = 1; i <= n; i++)l[i] = inf;
    for(int i = 1; i <= n; i++){
        cin >> doll[i].fi >> doll[i].se;
    }

    sort(doll + 1, doll + n + 1, cmp);
    for(int i = 0; i < q; i++){
        cin >> queries[i].a >> queries[i].b; queries[i].id = i; comp.pb(queries[i].b);
    }
    sort(ALL(comp));
    sort(queries, queries + q);
    int r = 1;
    for(int i = 0; i < q; i++){
        while(r <= n && doll[r].fi >= queries[i].a){
            int id = upper_bound(l + 1, l + n + 1, doll[r].se) - l;
            upd(find(doll[r].se), id);
            l[id] = doll[r].se;
            r++;
        }
        ans[queries[i].id]= get(find(queries[i].b));
    }
    for(int i =0 ; i < q; i++)cout << ans[i] << "\n";
}
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tt; tt = 1;
    while(tt--)solve();
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
25.0 / 25.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 2 ms 4648 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 2 ms 4440 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 2 ms 4508 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 2 ms 4444 KB Output is correct
36 Correct 156 ms 14884 KB Output is correct
37 Correct 130 ms 14284 KB Output is correct
38 Correct 46 ms 9552 KB Output is correct
39 Correct 112 ms 12744 KB Output is correct
40 Correct 113 ms 13256 KB Output is correct
41 Correct 146 ms 14284 KB Output is correct
42 Correct 75 ms 11868 KB Output is correct
43 Correct 63 ms 11984 KB Output is correct
44 Correct 176 ms 17612 KB Output is correct
45 Correct 169 ms 17608 KB Output is correct
46 Correct 166 ms 17608 KB Output is correct
47 Correct 159 ms 17348 KB Output is correct
48 Correct 158 ms 17872 KB Output is correct
49 Correct 154 ms 17208 KB Output is correct
50 Correct 158 ms 17792 KB Output is correct