oj.uz

Submission #425260

# Submission time Handle Problem Language Result Execution time Memory
425260 2021-06-12T17:41:52 Z Osama_Alkhodairy Event Hopping 2 (JOI21_event2) C++17
100 / 100
 400 ms 29064 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;
const int K = 20;
const int INF = (int)1e9;

int n, k, nxt[N][K];
pair <int, int> tree[4 * N];
vector <pair <int, int> > a;

void update(int idx){
    int p = a[idx].first + 2 * n;
    tree[p] = min(tree[p], make_pair(a[idx].second, idx));
    for(; p > 1 ; p >>= 1){
        tree[p >> 1] = min(tree[p], tree[p ^ 1]);
    }
}
pair <int, int> query(int l, int r){
    r++;
    auto ret = make_pair(INF, INF);
    for(l += 2 * n, r += 2 * n ; l < r ; l >>= 1, r >>= 1){
        if(l & 1) ret = min(ret, tree[l++]);
        if(r & 1) ret = min(ret, tree[--r]);
    }
    return ret;
}
int calc(int l, int r){
    if(r < l) return 0;
    int idx = query(l, r).second;
    if(idx == INF) return 0;
    if(a[idx].second > r) return 0;
    int ret = 1;
    for(int i = K - 1 ; i >= 0 ; i--){
        if(nxt[idx][i] == INF) continue;
        if(a[nxt[idx][i]].second > r) continue;
        ret += (1 << i);
        idx = nxt[idx][i];
    }
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for(int i = 0 ; i < 4 * N ; i++){
        tree[i] = make_pair(INF, INF);
    }
    cin >> n >> k;
    a.resize(n);
    for(auto &i : a) cin >> i.first >> i.second;
    map <int, int> mp;
    for(auto &i : a) mp[i.first], mp[i.second];
    int x = 0;
    for(auto &i : mp) i.second = x++;
    for(auto &i : a){
        i.first = mp[i.first];
        i.second = mp[i.second];
    }
    for(int i = 0 ; i < n ; i++){
        update(i);
    }
    for(int i = 0 ; i < n ; i++){
        nxt[i][0] = query(a[i].second, 2 * n - 1).second;
    }
    vector <int> all;
    for(int i = 0 ; i < n ; i++){
        all.push_back(i);
    }
    sort(all.begin(), all.end(), [&](int l, int r){
        return a[l].first > a[r].first;
    });
    for(auto &i : all){
        for(int k = 1 ; k < K ; k++){
            if(nxt[i][k - 1] == INF) nxt[i][k] = INF;
            else nxt[i][k] = nxt[nxt[i][k - 1]][k - 1];
        }
    }
    set <pair <int, int> > cur;
    cur.insert(make_pair(0, 2 * n - 1));
    int cnt = calc(0, 2 * n - 1);
    if(cnt < k) finish(-1);
    vector <int> res;
    for(int i = 0 ; i < n ; i++){
        auto it = cur.upper_bound(make_pair(a[i].first, INF));
        it--;
        if(!(it->first <= a[i].first && a[i].second <= it->second)) continue;
        cnt -= calc(it->first, it->second);
        if(cnt + (int)res.size() + 1 + calc(it->first, a[i].first) + calc(a[i].second, it->second) < k){
            cnt += calc(it->first, it->second);
            continue;
        }
        res.push_back(i);
        cur.insert(make_pair(it->first, a[i].first));
        cnt += calc(it->first, a[i].first);
        cur.insert(make_pair(a[i].second, it->second));
        cnt += calc(a[i].second, it->second);
        cur.erase(it);
    }
    while((int)res.size() > k) res.pop_back();
    assert((int)res.size() == k);
    for(auto &i : res) cout << i + 1 << "\n";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 3 ms 3532 KB Output is correct
4 Correct 228 ms 27080 KB Output is correct
5 Correct 215 ms 28980 KB Output is correct
6 Correct 215 ms 28924 KB Output is correct
7 Correct 214 ms 28920 KB Output is correct
8 Correct 218 ms 28964 KB Output is correct
9 Correct 220 ms 29016 KB Output is correct
10 Correct 211 ms 28936 KB Output is correct
11 Correct 236 ms 28920 KB Output is correct
12 Correct 177 ms 26944 KB Output is correct
13 Correct 176 ms 27008 KB Output is correct
14 Correct 178 ms 27020 KB Output is correct
15 Correct 175 ms 26884 KB Output is correct
16 Correct 131 ms 24512 KB Output is correct
17 Correct 134 ms 24452 KB Output is correct
18 Correct 129 ms 24320 KB Output is correct
19 Correct 120 ms 24004 KB Output is correct
20 Correct 121 ms 23980 KB Output is correct
21 Correct 121 ms 24052 KB Output is correct
22 Correct 128 ms 24012 KB Output is correct
23 Correct 137 ms 24016 KB Output is correct
24 Correct 126 ms 23948 KB Output is correct
25 Correct 144 ms 23936 KB Output is correct
26 Correct 148 ms 24020 KB Output is correct
27 Correct 160 ms 24200 KB Output is correct
28 Correct 113 ms 24128 KB Output is correct
29 Correct 110 ms 24008 KB Output is correct
30 Correct 108 ms 23944 KB Output is correct
31 Correct 118 ms 23952 KB Output is correct
32 Correct 131 ms 24004 KB Output is correct
33 Correct 173 ms 23940 KB Output is correct
34 Correct 175 ms 26816 KB Output is correct
35 Correct 174 ms 26752 KB Output is correct
36 Correct 173 ms 26688 KB Output is correct
37 Correct 182 ms 26496 KB Output is correct
38 Correct 189 ms 26496 KB Output is correct
39 Correct 186 ms 26500 KB Output is correct
40 Correct 214 ms 26504 KB Output is correct
41 Correct 191 ms 26568 KB Output is correct
42 Correct 110 ms 23932 KB Output is correct
43 Correct 165 ms 26500 KB Output is correct
44 Correct 177 ms 26408 KB Output is correct
45 Correct 198 ms 26240 KB Output is correct
46 Correct 158 ms 26104 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 3 ms 3404 KB Output is correct
7 Correct 3 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 2 ms 3452 KB Output is correct
10 Correct 3 ms 3404 KB Output is correct
11 Correct 2 ms 3404 KB Output is correct
12 Correct 2 ms 3404 KB Output is correct
13 Correct 2 ms 3452 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 2 ms 3404 KB Output is correct
18 Correct 2 ms 3404 KB Output is correct
19 Correct 2 ms 3404 KB Output is correct
20 Correct 2 ms 3544 KB Output is correct
21 Correct 2 ms 3404 KB Output is correct
22 Correct 2 ms 3404 KB Output is correct
23 Correct 2 ms 3404 KB Output is correct
24 Correct 2 ms 3404 KB Output is correct
25 Correct 2 ms 3460 KB Output is correct
26 Correct 2 ms 3404 KB Output is correct
27 Correct 2 ms 3404 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 2 ms 3404 KB Output is correct
4 Correct 3 ms 3404 KB Output is correct
5 Correct 3 ms 3404 KB Output is correct
6 Correct 3 ms 3404 KB Output is correct
7 Correct 3 ms 3404 KB Output is correct
8 Correct 3 ms 3404 KB Output is correct
9 Correct 2 ms 3452 KB Output is correct
10 Correct 3 ms 3404 KB Output is correct
11 Correct 2 ms 3404 KB Output is correct
12 Correct 2 ms 3404 KB Output is correct
13 Correct 2 ms 3452 KB Output is correct
14 Correct 2 ms 3456 KB Output is correct
15 Correct 2 ms 3456 KB Output is correct
16 Correct 2 ms 3456 KB Output is correct
17 Correct 2 ms 3404 KB Output is correct
18 Correct 2 ms 3404 KB Output is correct
19 Correct 2 ms 3404 KB Output is correct
20 Correct 2 ms 3544 KB Output is correct
21 Correct 2 ms 3404 KB Output is correct
22 Correct 2 ms 3404 KB Output is correct
23 Correct 2 ms 3404 KB Output is correct
24 Correct 2 ms 3404 KB Output is correct
25 Correct 2 ms 3460 KB Output is correct
26 Correct 2 ms 3404 KB Output is correct
27 Correct 2 ms 3404 KB Output is correct
28 Correct 7 ms 3976 KB Output is correct
29 Correct 6 ms 3976 KB Output is correct
30 Correct 6 ms 4044 KB Output is correct
31 Correct 6 ms 4044 KB Output is correct
32 Correct 7 ms 4044 KB Output is correct
33 Correct 7 ms 4044 KB Output is correct
34 Correct 6 ms 4044 KB Output is correct
35 Correct 11 ms 4172 KB Output is correct
36 Correct 9 ms 4172 KB Output is correct
37 Correct 9 ms 4172 KB Output is correct
38 Correct 6 ms 4044 KB Output is correct
39 Correct 8 ms 4112 KB Output is correct
40 Correct 8 ms 4168 KB Output is correct
41 Correct 9 ms 4172 KB Output is correct
42 Correct 8 ms 4172 KB Output is correct
43 Correct 10 ms 4044 KB Output is correct
44 Correct 9 ms 4044 KB Output is correct
45 Correct 7 ms 4044 KB Output is correct
46 Correct 6 ms 4044 KB Output is correct
47 Correct 7 ms 4044 KB Output is correct
48 Correct 7 ms 3972 KB Output is correct
49 Correct 6 ms 4044 KB Output is correct
50 Correct 6 ms 3976 KB Output is correct
51 Correct 7 ms 4044 KB Output is correct
52 Correct 6 ms 4044 KB Output is correct
53 Correct 7 ms 4048 KB Output is correct
54 Correct 6 ms 4044 KB Output is correct
55 Correct 7 ms 4088 KB Output is correct
56 Correct 7 ms 4108 KB Output is correct
57 Correct 7 ms 4044 KB Output is correct
58 Correct 8 ms 4108 KB Output is correct
59 Correct 7 ms 4044 KB Output is correct
60 Correct 7 ms 4044 KB Output is correct
61 Correct 9 ms 4044 KB Output is correct
62 Correct 8 ms 4044 KB Output is correct
63 Correct 8 ms 4044 KB Output is correct
64 Correct 5 ms 3848 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 2 ms 3404 KB Output is correct
3 Correct 3 ms 3532 KB Output is correct
4 Correct 228 ms 27080 KB Output is correct
5 Correct 215 ms 28980 KB Output is correct
6 Correct 215 ms 28924 KB Output is correct
7 Correct 214 ms 28920 KB Output is correct
8 Correct 218 ms 28964 KB Output is correct
9 Correct 220 ms 29016 KB Output is correct
10 Correct 211 ms 28936 KB Output is correct
11 Correct 236 ms 28920 KB Output is correct
12 Correct 177 ms 26944 KB Output is correct
13 Correct 176 ms 27008 KB Output is correct
14 Correct 178 ms 27020 KB Output is correct
15 Correct 175 ms 26884 KB Output is correct
16 Correct 131 ms 24512 KB Output is correct
17 Correct 134 ms 24452 KB Output is correct
18 Correct 129 ms 24320 KB Output is correct
19 Correct 120 ms 24004 KB Output is correct
20 Correct 121 ms 23980 KB Output is correct
21 Correct 121 ms 24052 KB Output is correct
22 Correct 128 ms 24012 KB Output is correct
23 Correct 137 ms 24016 KB Output is correct
24 Correct 126 ms 23948 KB Output is correct
25 Correct 144 ms 23936 KB Output is correct
26 Correct 148 ms 24020 KB Output is correct
27 Correct 160 ms 24200 KB Output is correct
28 Correct 113 ms 24128 KB Output is correct
29 Correct 110 ms 24008 KB Output is correct
30 Correct 108 ms 23944 KB Output is correct
31 Correct 118 ms 23952 KB Output is correct
32 Correct 131 ms 24004 KB Output is correct
33 Correct 173 ms 23940 KB Output is correct
34 Correct 175 ms 26816 KB Output is correct
35 Correct 174 ms 26752 KB Output is correct
36 Correct 173 ms 26688 KB Output is correct
37 Correct 182 ms 26496 KB Output is correct
38 Correct 189 ms 26496 KB Output is correct
39 Correct 186 ms 26500 KB Output is correct
40 Correct 214 ms 26504 KB Output is correct
41 Correct 191 ms 26568 KB Output is correct
42 Correct 110 ms 23932 KB Output is correct
43 Correct 165 ms 26500 KB Output is correct
44 Correct 177 ms 26408 KB Output is correct
45 Correct 198 ms 26240 KB Output is correct
46 Correct 158 ms 26104 KB Output is correct
47 Correct 2 ms 3404 KB Output is correct
48 Correct 2 ms 3404 KB Output is correct
49 Correct 2 ms 3404 KB Output is correct
50 Correct 3 ms 3404 KB Output is correct
51 Correct 3 ms 3404 KB Output is correct
52 Correct 3 ms 3404 KB Output is correct
53 Correct 3 ms 3404 KB Output is correct
54 Correct 3 ms 3404 KB Output is correct
55 Correct 2 ms 3452 KB Output is correct
56 Correct 3 ms 3404 KB Output is correct
57 Correct 2 ms 3404 KB Output is correct
58 Correct 2 ms 3404 KB Output is correct
59 Correct 2 ms 3452 KB Output is correct
60 Correct 2 ms 3456 KB Output is correct
61 Correct 2 ms 3456 KB Output is correct
62 Correct 2 ms 3456 KB Output is correct
63 Correct 2 ms 3404 KB Output is correct
64 Correct 2 ms 3404 KB Output is correct
65 Correct 2 ms 3404 KB Output is correct
66 Correct 2 ms 3544 KB Output is correct
67 Correct 2 ms 3404 KB Output is correct
68 Correct 2 ms 3404 KB Output is correct
69 Correct 2 ms 3404 KB Output is correct
70 Correct 2 ms 3404 KB Output is correct
71 Correct 2 ms 3460 KB Output is correct
72 Correct 2 ms 3404 KB Output is correct
73 Correct 2 ms 3404 KB Output is correct
74 Correct 7 ms 3976 KB Output is correct
75 Correct 6 ms 3976 KB Output is correct
76 Correct 6 ms 4044 KB Output is correct
77 Correct 6 ms 4044 KB Output is correct
78 Correct 7 ms 4044 KB Output is correct
79 Correct 7 ms 4044 KB Output is correct
80 Correct 6 ms 4044 KB Output is correct
81 Correct 11 ms 4172 KB Output is correct
82 Correct 9 ms 4172 KB Output is correct
83 Correct 9 ms 4172 KB Output is correct
84 Correct 6 ms 4044 KB Output is correct
85 Correct 8 ms 4112 KB Output is correct
86 Correct 8 ms 4168 KB Output is correct
87 Correct 9 ms 4172 KB Output is correct
88 Correct 8 ms 4172 KB Output is correct
89 Correct 10 ms 4044 KB Output is correct
90 Correct 9 ms 4044 KB Output is correct
91 Correct 7 ms 4044 KB Output is correct
92 Correct 6 ms 4044 KB Output is correct
93 Correct 7 ms 4044 KB Output is correct
94 Correct 7 ms 3972 KB Output is correct
95 Correct 6 ms 4044 KB Output is correct
96 Correct 6 ms 3976 KB Output is correct
97 Correct 7 ms 4044 KB Output is correct
98 Correct 6 ms 4044 KB Output is correct
99 Correct 7 ms 4048 KB Output is correct
100 Correct 6 ms 4044 KB Output is correct
101 Correct 7 ms 4088 KB Output is correct
102 Correct 7 ms 4108 KB Output is correct
103 Correct 7 ms 4044 KB Output is correct
104 Correct 8 ms 4108 KB Output is correct
105 Correct 7 ms 4044 KB Output is correct
106 Correct 7 ms 4044 KB Output is correct
107 Correct 9 ms 4044 KB Output is correct
108 Correct 8 ms 4044 KB Output is correct
109 Correct 8 ms 4044 KB Output is correct
110 Correct 5 ms 3848 KB Output is correct
111 Correct 271 ms 23944 KB Output is correct
112 Correct 307 ms 24008 KB Output is correct
113 Correct 271 ms 24016 KB Output is correct
114 Correct 275 ms 24132 KB Output is correct
115 Correct 259 ms 23944 KB Output is correct
116 Correct 323 ms 24004 KB Output is correct
117 Correct 273 ms 23920 KB Output is correct
118 Correct 400 ms 29064 KB Output is correct
119 Correct 374 ms 28992 KB Output is correct
120 Correct 333 ms 26808 KB Output is correct
121 Correct 256 ms 23944 KB Output is correct
122 Correct 333 ms 27012 KB Output is correct
123 Correct 343 ms 26848 KB Output is correct
124 Correct 378 ms 26848 KB Output is correct
125 Correct 253 ms 24076 KB Output is correct
126 Correct 306 ms 24452 KB Output is correct
127 Correct 263 ms 24420 KB Output is correct
128 Correct 268 ms 24268 KB Output is correct
129 Correct 277 ms 23964 KB Output is correct
130 Correct 301 ms 24052 KB Output is correct
131 Correct 266 ms 24076 KB Output is correct
132 Correct 263 ms 23904 KB Output is correct
133 Correct 276 ms 24068 KB Output is correct
134 Correct 260 ms 24008 KB Output is correct
135 Correct 307 ms 23940 KB Output is correct
136 Correct 289 ms 24004 KB Output is correct
137 Correct 275 ms 23960 KB Output is correct
138 Correct 271 ms 24032 KB Output is correct
139 Correct 259 ms 24016 KB Output is correct
140 Correct 293 ms 24020 KB Output is correct
141 Correct 321 ms 23932 KB Output is correct
142 Correct 242 ms 24776 KB Output is correct
143 Correct 225 ms 24708 KB Output is correct
144 Correct 219 ms 24700 KB Output is correct
145 Correct 192 ms 24716 KB Output is correct
146 Correct 196 ms 24840 KB Output is correct
147 Correct 193 ms 24704 KB Output is correct
148 Correct 194 ms 24632 KB Output is correct
149 Correct 199 ms 24696 KB Output is correct
150 Correct 187 ms 24688 KB Output is correct
151 Correct 213 ms 24712 KB Output is correct
152 Correct 101 ms 19268 KB Output is correct
153 Correct 199 ms 24744 KB Output is correct
154 Correct 198 ms 24856 KB Output is correct
155 Correct 199 ms 24692 KB Output is correct
156 Correct 199 ms 24636 KB Output is correct
157 Correct 200 ms 24764 KB Output is correct
158 Correct 200 ms 24684 KB Output is correct
159 Correct 211 ms 24572 KB Output is correct
160 Correct 109 ms 19336 KB Output is correct
161 Correct 340 ms 24224 KB Output is correct
162 Correct 278 ms 24252 KB Output is correct
163 Correct 304 ms 24264 KB Output is correct
164 Correct 339 ms 24196 KB Output is correct
165 Correct 293 ms 24216 KB Output is correct
166 Correct 121 ms 24004 KB Output is correct
167 Correct 182 ms 26496 KB Output is correct
168 Correct 186 ms 26296 KB Output is correct
169 Correct 200 ms 26332 KB Output is correct
170 Correct 169 ms 26048 KB Output is correct
171 Correct 184 ms 25848 KB Output is correct
172 Correct 182 ms 26672 KB Output is correct
173 Correct 314 ms 21892 KB Output is correct
174 Correct 300 ms 21820 KB Output is correct
175 Correct 348 ms 21792 KB Output is correct
176 Correct 306 ms 21436 KB Output is correct