oj.uz

Submission #414900

# Submission time Handle Problem Language Result Execution time Memory
414900 2021-05-31T10:31:37 Z 반딧불(#7587) Event Hopping 2 (JOI21_event2) C++17
100 / 100
 352 ms 29916 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct dat{
    int l, r, idx;
    dat(){}
    dat(int l, int r, int idx): l(l), r(r), idx(idx){}
};

struct Range{
    int l, r, val;
    Range(){}
    Range(int l, int r, int val): l(l), r(r), val(val){}

    bool operator<(const Range &nxt)const{
        if(l != nxt.l) return l<nxt.l;
        return val < nxt.val;
    }
};

struct segmentTree{
    int tree[800002], lazy[800002];

    void init(int i, int l, int r){
        tree[i] = lazy[i] = 0;
        if(l==r) return;
        int m = (l+r)>>1;
        init(i*2, l, m);
        init(i*2+1, m+1, r);
    }

    void propagate(int i, int l, int r){
        if(!lazy[i]) return;
        tree[i] = lazy[i];
        if(l!=r) lazy[i*2] = lazy[i*2+1] = lazy[i];
        lazy[i] = 0;
    }

    int getVal(int i, int l, int r, int idx){
        propagate(i, l, r);
        if(l==r) return tree[i];
        int m = (l+r)>>1;
        if(idx <= m) return getVal(i*2, l, m, idx);
        return getVal(i*2+1, m+1, r, idx);
    }

    void rangeUpdate(int i, int l, int r, int s, int e, int val){
        propagate(i, l, r);
        if(r<s || e<l) return;
        if(s<=l && r<=e){
            lazy[i] = val;
            propagate(i, l, r);
            return;
        }
        int m = (l+r)>>1;
        rangeUpdate(i*2, l, m, s, e, val);
        rangeUpdate(i*2+1, m+1, r, s, e, val);
    }
} tree;

int n, m, k;
dat arr[100002];

int lSparse[100002][20], rSparse[100002][20];
vector<int> ans;
int sum;
set<Range> st;

void renumber(){
    vector<int> vec;
    for(int i=1; i<=n; i++) vec.push_back(arr[i].l), vec.push_back(arr[i].r);
    sort(vec.begin(), vec.end());
    vec.erase(unique(vec.begin(), vec.end()), vec.end());

    m = (int)vec.size();
    for(int i=1; i<=n; i++){
        arr[i].l = lower_bound(vec.begin(), vec.end(), arr[i].l) - vec.begin() + 1;
        arr[i].r = lower_bound(vec.begin(), vec.end(), arr[i].r) - vec.begin() + 1;
    }
}

void makeSparse(){
    vector<dat> vec (arr+1, arr+n+1);

    tree.init(1, 1, m);
    sort(vec.begin(), vec.end(), [&](dat x, dat y){
        return x.l < y.l;
    });
    for(auto p: vec){
        lSparse[p.idx][0] = tree.getVal(1, 1, m, p.l);
        tree.rangeUpdate(1, 1, m, p.r, m, p.idx);
    }

    tree.init(1, 1, m);
    sort(vec.begin(), vec.end(), [&](dat x, dat y){
        return x.r > y.r;
    });
    for(auto p: vec){
        rSparse[p.idx][0] = tree.getVal(1, 1, m, p.r);
        tree.rangeUpdate(1, 1, m, 1, p.l, p.idx);
    }
}

int main(){
    scanf("%d %d", &n, &k);
    for(int i=1; i<=n; i++){
        scanf("%d %d", &arr[i].l, &arr[i].r);
        arr[i].idx = i;
    }

    renumber();
    makeSparse();

    for(int d=1; d<20; d++){
        for(int i=1; i<=n; i++){
            lSparse[i][d] = lSparse[lSparse[i][d-1]][d-1];
            rSparse[i][d] = rSparse[rSparse[i][d-1]][d-1];
        }
    }

    int maxAble = 0;
    for(int i=1; i<=n; i++){
        int dCnt = 1, tmp = i;
        for(int d=19; d>=0; d--){
            if(rSparse[tmp][d]){
                dCnt += (1<<d);
                tmp = rSparse[tmp][d];
            }
        }
        maxAble = max(maxAble, dCnt);
    }

    st.insert(Range(1, m, maxAble));
    sum = maxAble;
    for(int i=1; i<=n; i++){
        auto it = st.lower_bound(Range(arr[i].l, 0, 1e9));
        if(it == st.begin()) continue;
        --it;
        if(!(it->l <= arr[i].l && arr[i].r <= it->r)) continue;

        int lVal = 0, rVal = 0, tmp = i;
        for(int d=19; d>=0; d--){
            if(!lSparse[tmp][d] || arr[lSparse[tmp][d]].l < it->l) continue;
            lVal += (1<<d);
            tmp = lSparse[tmp][d];
        }
        tmp = i;
        for(int d=19; d>=0; d--){
            if(!rSparse[tmp][d] || arr[rSparse[tmp][d]].r > it->r) continue;
            rVal += (1<<d);
            tmp = rSparse[tmp][d];
        }

        if(sum - it->val + (lVal + rVal + 1) < k) continue;
        ans.push_back(i);

        int tL = it->l, tR = it->r;
        sum -= it->val;
        sum += lVal + rVal + 1;
        st.erase(it);

        st.insert(Range(tL, arr[i].l, lVal));
        st.insert(Range(arr[i].r, tR, rVal));
    }

    if((int)ans.size() < k) printf("-1");
    else{
        for(int i=0; i<k; i++) printf("%d\n", ans[i]);
    }
}

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:108:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |     scanf("%d %d", &n, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~
event2.cpp:110:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  110 |         scanf("%d %d", &arr[i].l, &arr[i].r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 228 ms 28012 KB Output is correct
5 Correct 235 ms 27928 KB Output is correct
6 Correct 250 ms 27888 KB Output is correct
7 Correct 228 ms 27900 KB Output is correct
8 Correct 242 ms 27988 KB Output is correct
9 Correct 227 ms 27896 KB Output is correct
10 Correct 248 ms 27896 KB Output is correct
11 Correct 272 ms 27848 KB Output is correct
12 Correct 213 ms 25436 KB Output is correct
13 Correct 213 ms 25464 KB Output is correct
14 Correct 207 ms 25372 KB Output is correct
15 Correct 201 ms 25304 KB Output is correct
16 Correct 172 ms 22588 KB Output is correct
17 Correct 178 ms 22520 KB Output is correct
18 Correct 179 ms 22492 KB Output is correct
19 Correct 157 ms 22552 KB Output is correct
20 Correct 158 ms 22528 KB Output is correct
21 Correct 164 ms 22552 KB Output is correct
22 Correct 162 ms 22572 KB Output is correct
23 Correct 164 ms 22552 KB Output is correct
24 Correct 165 ms 22572 KB Output is correct
25 Correct 210 ms 22552 KB Output is correct
26 Correct 180 ms 22568 KB Output is correct
27 Correct 175 ms 22552 KB Output is correct
28 Correct 160 ms 22552 KB Output is correct
29 Correct 197 ms 22552 KB Output is correct
30 Correct 160 ms 22576 KB Output is correct
31 Correct 169 ms 22556 KB Output is correct
32 Correct 171 ms 22524 KB Output is correct
33 Correct 181 ms 22592 KB Output is correct
34 Correct 205 ms 25184 KB Output is correct
35 Correct 204 ms 25176 KB Output is correct
36 Correct 201 ms 25148 KB Output is correct
37 Correct 208 ms 24800 KB Output is correct
38 Correct 203 ms 24844 KB Output is correct
39 Correct 239 ms 24796 KB Output is correct
40 Correct 218 ms 24792 KB Output is correct
41 Correct 199 ms 24820 KB Output is correct
42 Correct 178 ms 22552 KB Output is correct
43 Correct 212 ms 24664 KB Output is correct
44 Correct 211 ms 24832 KB Output is correct
45 Correct 224 ms 24436 KB Output is correct
46 Correct 211 ms 24236 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 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 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 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 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 6 ms 1076 KB Output is correct
29 Correct 6 ms 972 KB Output is correct
30 Correct 6 ms 972 KB Output is correct
31 Correct 6 ms 1088 KB Output is correct
32 Correct 7 ms 1080 KB Output is correct
33 Correct 6 ms 972 KB Output is correct
34 Correct 6 ms 972 KB Output is correct
35 Correct 8 ms 1148 KB Output is correct
36 Correct 7 ms 1204 KB Output is correct
37 Correct 7 ms 1100 KB Output is correct
38 Correct 7 ms 972 KB Output is correct
39 Correct 7 ms 1136 KB Output is correct
40 Correct 7 ms 1204 KB Output is correct
41 Correct 7 ms 1100 KB Output is correct
42 Correct 6 ms 972 KB Output is correct
43 Correct 6 ms 1012 KB Output is correct
44 Correct 6 ms 972 KB Output is correct
45 Correct 6 ms 972 KB Output is correct
46 Correct 6 ms 1084 KB Output is correct
47 Correct 5 ms 972 KB Output is correct
48 Correct 5 ms 1024 KB Output is correct
49 Correct 5 ms 1008 KB Output is correct
50 Correct 5 ms 1024 KB Output is correct
51 Correct 6 ms 972 KB Output is correct
52 Correct 5 ms 972 KB Output is correct
53 Correct 6 ms 992 KB Output is correct
54 Correct 7 ms 972 KB Output is correct
55 Correct 7 ms 1112 KB Output is correct
56 Correct 6 ms 1076 KB Output is correct
57 Correct 6 ms 1152 KB Output is correct
58 Correct 6 ms 1088 KB Output is correct
59 Correct 6 ms 1148 KB Output is correct
60 Correct 6 ms 1104 KB Output is correct
61 Correct 6 ms 1084 KB Output is correct
62 Correct 6 ms 1076 KB Output is correct
63 Correct 6 ms 1096 KB Output is correct
64 Correct 5 ms 936 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 228 ms 28012 KB Output is correct
5 Correct 235 ms 27928 KB Output is correct
6 Correct 250 ms 27888 KB Output is correct
7 Correct 228 ms 27900 KB Output is correct
8 Correct 242 ms 27988 KB Output is correct
9 Correct 227 ms 27896 KB Output is correct
10 Correct 248 ms 27896 KB Output is correct
11 Correct 272 ms 27848 KB Output is correct
12 Correct 213 ms 25436 KB Output is correct
13 Correct 213 ms 25464 KB Output is correct
14 Correct 207 ms 25372 KB Output is correct
15 Correct 201 ms 25304 KB Output is correct
16 Correct 172 ms 22588 KB Output is correct
17 Correct 178 ms 22520 KB Output is correct
18 Correct 179 ms 22492 KB Output is correct
19 Correct 157 ms 22552 KB Output is correct
20 Correct 158 ms 22528 KB Output is correct
21 Correct 164 ms 22552 KB Output is correct
22 Correct 162 ms 22572 KB Output is correct
23 Correct 164 ms 22552 KB Output is correct
24 Correct 165 ms 22572 KB Output is correct
25 Correct 210 ms 22552 KB Output is correct
26 Correct 180 ms 22568 KB Output is correct
27 Correct 175 ms 22552 KB Output is correct
28 Correct 160 ms 22552 KB Output is correct
29 Correct 197 ms 22552 KB Output is correct
30 Correct 160 ms 22576 KB Output is correct
31 Correct 169 ms 22556 KB Output is correct
32 Correct 171 ms 22524 KB Output is correct
33 Correct 181 ms 22592 KB Output is correct
34 Correct 205 ms 25184 KB Output is correct
35 Correct 204 ms 25176 KB Output is correct
36 Correct 201 ms 25148 KB Output is correct
37 Correct 208 ms 24800 KB Output is correct
38 Correct 203 ms 24844 KB Output is correct
39 Correct 239 ms 24796 KB Output is correct
40 Correct 218 ms 24792 KB Output is correct
41 Correct 199 ms 24820 KB Output is correct
42 Correct 178 ms 22552 KB Output is correct
43 Correct 212 ms 24664 KB Output is correct
44 Correct 211 ms 24832 KB Output is correct
45 Correct 224 ms 24436 KB Output is correct
46 Correct 211 ms 24236 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 2 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 1 ms 332 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 332 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 2 ms 332 KB Output is correct
73 Correct 1 ms 332 KB Output is correct
74 Correct 6 ms 1076 KB Output is correct
75 Correct 6 ms 972 KB Output is correct
76 Correct 6 ms 972 KB Output is correct
77 Correct 6 ms 1088 KB Output is correct
78 Correct 7 ms 1080 KB Output is correct
79 Correct 6 ms 972 KB Output is correct
80 Correct 6 ms 972 KB Output is correct
81 Correct 8 ms 1148 KB Output is correct
82 Correct 7 ms 1204 KB Output is correct
83 Correct 7 ms 1100 KB Output is correct
84 Correct 7 ms 972 KB Output is correct
85 Correct 7 ms 1136 KB Output is correct
86 Correct 7 ms 1204 KB Output is correct
87 Correct 7 ms 1100 KB Output is correct
88 Correct 6 ms 972 KB Output is correct
89 Correct 6 ms 1012 KB Output is correct
90 Correct 6 ms 972 KB Output is correct
91 Correct 6 ms 972 KB Output is correct
92 Correct 6 ms 1084 KB Output is correct
93 Correct 5 ms 972 KB Output is correct
94 Correct 5 ms 1024 KB Output is correct
95 Correct 5 ms 1008 KB Output is correct
96 Correct 5 ms 1024 KB Output is correct
97 Correct 6 ms 972 KB Output is correct
98 Correct 5 ms 972 KB Output is correct
99 Correct 6 ms 992 KB Output is correct
100 Correct 7 ms 972 KB Output is correct
101 Correct 7 ms 1112 KB Output is correct
102 Correct 6 ms 1076 KB Output is correct
103 Correct 6 ms 1152 KB Output is correct
104 Correct 6 ms 1088 KB Output is correct
105 Correct 6 ms 1148 KB Output is correct
106 Correct 6 ms 1104 KB Output is correct
107 Correct 6 ms 1084 KB Output is correct
108 Correct 6 ms 1076 KB Output is correct
109 Correct 6 ms 1096 KB Output is correct
110 Correct 5 ms 936 KB Output is correct
111 Correct 239 ms 24444 KB Output is correct
112 Correct 233 ms 24452 KB Output is correct
113 Correct 272 ms 24444 KB Output is correct
114 Correct 233 ms 24420 KB Output is correct
115 Correct 230 ms 24448 KB Output is correct
116 Correct 243 ms 24388 KB Output is correct
117 Correct 247 ms 24352 KB Output is correct
118 Correct 352 ms 29916 KB Output is correct
119 Correct 342 ms 29756 KB Output is correct
120 Correct 308 ms 27116 KB Output is correct
121 Correct 279 ms 24416 KB Output is correct
122 Correct 292 ms 27240 KB Output is correct
123 Correct 305 ms 27000 KB Output is correct
124 Correct 292 ms 26984 KB Output is correct
125 Correct 278 ms 24344 KB Output is correct
126 Correct 231 ms 24384 KB Output is correct
127 Correct 243 ms 24344 KB Output is correct
128 Correct 228 ms 24340 KB Output is correct
129 Correct 241 ms 24344 KB Output is correct
130 Correct 220 ms 24384 KB Output is correct
131 Correct 223 ms 24400 KB Output is correct
132 Correct 213 ms 24400 KB Output is correct
133 Correct 227 ms 24344 KB Output is correct
134 Correct 214 ms 24384 KB Output is correct
135 Correct 208 ms 24348 KB Output is correct
136 Correct 225 ms 24344 KB Output is correct
137 Correct 223 ms 24376 KB Output is correct
138 Correct 213 ms 24404 KB Output is correct
139 Correct 215 ms 24344 KB Output is correct
140 Correct 222 ms 24480 KB Output is correct
141 Correct 219 ms 24344 KB Output is correct
142 Correct 225 ms 28268 KB Output is correct
143 Correct 228 ms 28404 KB Output is correct
144 Correct 221 ms 28320 KB Output is correct
145 Correct 252 ms 28248 KB Output is correct
146 Correct 228 ms 28152 KB Output is correct
147 Correct 219 ms 28220 KB Output is correct
148 Correct 229 ms 28148 KB Output is correct
149 Correct 223 ms 28132 KB Output is correct
150 Correct 235 ms 28116 KB Output is correct
151 Correct 239 ms 28060 KB Output is correct
152 Correct 151 ms 22292 KB Output is correct
153 Correct 249 ms 28296 KB Output is correct
154 Correct 239 ms 28276 KB Output is correct
155 Correct 244 ms 28208 KB Output is correct
156 Correct 246 ms 28192 KB Output is correct
157 Correct 234 ms 28252 KB Output is correct
158 Correct 249 ms 28180 KB Output is correct
159 Correct 224 ms 28152 KB Output is correct
160 Correct 153 ms 22404 KB Output is correct
161 Correct 305 ms 26704 KB Output is correct
162 Correct 302 ms 26656 KB Output is correct
163 Correct 300 ms 26700 KB Output is correct
164 Correct 308 ms 26668 KB Output is correct
165 Correct 315 ms 26604 KB Output is correct
166 Correct 177 ms 24344 KB Output is correct
167 Correct 224 ms 26540 KB Output is correct
168 Correct 212 ms 26484 KB Output is correct
169 Correct 216 ms 26272 KB Output is correct
170 Correct 211 ms 26140 KB Output is correct
171 Correct 221 ms 26076 KB Output is correct
172 Correct 215 ms 26776 KB Output is correct
173 Correct 309 ms 24620 KB Output is correct
174 Correct 311 ms 24712 KB Output is correct
175 Correct 321 ms 24616 KB Output is correct
176 Correct 301 ms 24180 KB Output is correct