oj.uz

Submission #727917

# Submission time Handle Problem Language Result Execution time Memory
727917 2023-04-21T14:52:16 Z sysia Event Hopping 2 (JOI21_event2) C++17
100 / 100
 291 ms 42092 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef pair<int, int> T;
const int K = 20;

struct seg{
    int l, r, i;

    bool operator < (const seg&y) const {
        return l == y.l ? r < y.r : l < y.l;
    }
};

void solve(){
    int n, k; cin >> n >> k;
    vector<seg>tab(n);
    vector<int>s;
    int ck = 0;
    for (auto &[l, r, i]: tab) {
        cin >> l >> r;
        i = ck++;
        s.emplace_back(l);
        s.emplace_back(r);
    }
    sort(s.begin(), s.end());
    s.erase(unique(s.begin(), s.end()), s.end());
    auto scale = [&](int x)->int {
        return lower_bound(s.begin(), s.end(), x) - s.begin();
    };
    for (auto &[l, r, i]: tab){
        l = scale(l);
        r = scale(r);
    }
    int M = (int)s.size();
    sort(tab.begin(), tab.end());
    vector up(M+1, vector<int>(K));
    vector<int>dp(M+1);
    ck = n-1;
    set<int>what;
    for (int rep = M-1; rep>=0; rep--){
        while (ck >= 0 && tab[ck].l >= rep) {
            what.insert(tab[ck].r);
            ck--;
        }
        //z minimalnym prawym koncem
        if (what.empty()){
            up[rep][0] = M;
            continue;
        }
        up[rep][0] = *what.begin();
        dp[rep] = dp[up[rep][0]]+1;
        debug(rep, up[rep][0], dp[rep]);
    }
    int curr = *max_element(dp.begin(), dp.end());
    if (curr < k){
        cout << "-1\n";
        return;
    }
    for (int j = 1; j<K; j++){
        for (int i = 0; i <= M; i++){
            up[i][j] = up[up[i][j-1]][j-1];
        }
    }
    sort(tab.begin(), tab.end(), [](auto x, auto y){return x.i < y.i;});
    set<int>alive;

    auto ask = [&](int l, int r)->int {
        int ile = dp[l] - dp[r];
        int now = l;
        for (int i = K-1; i>=0; i--){
            if (ile&(1<<i)){
                now = up[now][i];
            }
        }
        if (now <= r) return ile;
        return ile-1;
    };
    vector<int>ret;
    for (auto [l, r, i]: tab){
        auto it = alive.lower_bound(l);
        if (it != alive.end() && *it < r) continue;
        debug(l, r, i);
        auto Lit = alive.upper_bound(l);
        auto Rit = alive.lower_bound(r);
        int L = (Lit == alive.begin() ? 0 : *(--Lit)+1);
        int R = (Rit == alive.end() ? M : *Rit);
        debug(L, l, r, R);
        debug(ask(L, l), ask(r, R), ask(L, R));
        int change = ask(L, l) + ask(r, R) + 1 - ask(L, R);
        if (curr + change >= k){
            debug(i);
            for (int rep = l; rep < r; rep++){
                alive.insert(rep);
            }
            curr += change;
            ret.emplace_back(i);
            if ((int)ret.size() == k) break;
        }
    }   
    for (auto x: ret) cout << x+1 << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 184 ms 37788 KB Output is correct
5 Correct 180 ms 38120 KB Output is correct
6 Correct 176 ms 37864 KB Output is correct
7 Correct 168 ms 37248 KB Output is correct
8 Correct 185 ms 38384 KB Output is correct
9 Correct 192 ms 38136 KB Output is correct
10 Correct 178 ms 37880 KB Output is correct
11 Correct 182 ms 37280 KB Output is correct
12 Correct 194 ms 38892 KB Output is correct
13 Correct 183 ms 38528 KB Output is correct
14 Correct 173 ms 38216 KB Output is correct
15 Correct 169 ms 37700 KB Output is correct
16 Correct 182 ms 41160 KB Output is correct
17 Correct 175 ms 40988 KB Output is correct
18 Correct 172 ms 40128 KB Output is correct
19 Correct 169 ms 41796 KB Output is correct
20 Correct 172 ms 41836 KB Output is correct
21 Correct 174 ms 41996 KB Output is correct
22 Correct 174 ms 41960 KB Output is correct
23 Correct 175 ms 42020 KB Output is correct
24 Correct 177 ms 42092 KB Output is correct
25 Correct 187 ms 41968 KB Output is correct
26 Correct 180 ms 42064 KB Output is correct
27 Correct 178 ms 41952 KB Output is correct
28 Correct 76 ms 32652 KB Output is correct
29 Correct 74 ms 32812 KB Output is correct
30 Correct 77 ms 32712 KB Output is correct
31 Correct 79 ms 32772 KB Output is correct
32 Correct 82 ms 32748 KB Output is correct
33 Correct 92 ms 32684 KB Output is correct
34 Correct 155 ms 36332 KB Output is correct
35 Correct 138 ms 35088 KB Output is correct
36 Correct 131 ms 33984 KB Output is correct
37 Correct 176 ms 40276 KB Output is correct
38 Correct 174 ms 39992 KB Output is correct
39 Correct 175 ms 39612 KB Output is correct
40 Correct 171 ms 39304 KB Output is correct
41 Correct 169 ms 39152 KB Output is correct
42 Correct 83 ms 32684 KB Output is correct
43 Correct 181 ms 40360 KB Output is correct
44 Correct 191 ms 40356 KB Output is correct
45 Correct 189 ms 40532 KB Output is correct
46 Correct 182 ms 40588 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 324 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 1364 KB Output is correct
29 Correct 5 ms 1480 KB Output is correct
30 Correct 4 ms 1492 KB Output is correct
31 Correct 5 ms 1492 KB Output is correct
32 Correct 4 ms 1492 KB Output is correct
33 Correct 3 ms 1236 KB Output is correct
34 Correct 3 ms 1236 KB Output is correct
35 Correct 5 ms 1444 KB Output is correct
36 Correct 5 ms 1352 KB Output is correct
37 Correct 5 ms 1356 KB Output is correct
38 Correct 3 ms 1320 KB Output is correct
39 Correct 5 ms 1484 KB Output is correct
40 Correct 5 ms 1356 KB Output is correct
41 Correct 5 ms 1364 KB Output is correct
42 Correct 3 ms 1236 KB Output is correct
43 Correct 4 ms 1492 KB Output is correct
44 Correct 4 ms 1484 KB Output is correct
45 Correct 5 ms 1484 KB Output is correct
46 Correct 3 ms 1236 KB Output is correct
47 Correct 5 ms 1492 KB Output is correct
48 Correct 5 ms 1492 KB Output is correct
49 Correct 5 ms 1484 KB Output is correct
50 Correct 3 ms 1236 KB Output is correct
51 Correct 4 ms 1484 KB Output is correct
52 Correct 5 ms 1492 KB Output is correct
53 Correct 5 ms 1492 KB Output is correct
54 Correct 3 ms 1224 KB Output is correct
55 Correct 4 ms 1108 KB Output is correct
56 Correct 4 ms 1104 KB Output is correct
57 Correct 4 ms 1100 KB Output is correct
58 Correct 4 ms 1104 KB Output is correct
59 Correct 4 ms 1108 KB Output is correct
60 Correct 4 ms 1108 KB Output is correct
61 Correct 4 ms 1108 KB Output is correct
62 Correct 3 ms 1108 KB Output is correct
63 Correct 4 ms 972 KB Output is correct
64 Correct 2 ms 940 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 184 ms 37788 KB Output is correct
5 Correct 180 ms 38120 KB Output is correct
6 Correct 176 ms 37864 KB Output is correct
7 Correct 168 ms 37248 KB Output is correct
8 Correct 185 ms 38384 KB Output is correct
9 Correct 192 ms 38136 KB Output is correct
10 Correct 178 ms 37880 KB Output is correct
11 Correct 182 ms 37280 KB Output is correct
12 Correct 194 ms 38892 KB Output is correct
13 Correct 183 ms 38528 KB Output is correct
14 Correct 173 ms 38216 KB Output is correct
15 Correct 169 ms 37700 KB Output is correct
16 Correct 182 ms 41160 KB Output is correct
17 Correct 175 ms 40988 KB Output is correct
18 Correct 172 ms 40128 KB Output is correct
19 Correct 169 ms 41796 KB Output is correct
20 Correct 172 ms 41836 KB Output is correct
21 Correct 174 ms 41996 KB Output is correct
22 Correct 174 ms 41960 KB Output is correct
23 Correct 175 ms 42020 KB Output is correct
24 Correct 177 ms 42092 KB Output is correct
25 Correct 187 ms 41968 KB Output is correct
26 Correct 180 ms 42064 KB Output is correct
27 Correct 178 ms 41952 KB Output is correct
28 Correct 76 ms 32652 KB Output is correct
29 Correct 74 ms 32812 KB Output is correct
30 Correct 77 ms 32712 KB Output is correct
31 Correct 79 ms 32772 KB Output is correct
32 Correct 82 ms 32748 KB Output is correct
33 Correct 92 ms 32684 KB Output is correct
34 Correct 155 ms 36332 KB Output is correct
35 Correct 138 ms 35088 KB Output is correct
36 Correct 131 ms 33984 KB Output is correct
37 Correct 176 ms 40276 KB Output is correct
38 Correct 174 ms 39992 KB Output is correct
39 Correct 175 ms 39612 KB Output is correct
40 Correct 171 ms 39304 KB Output is correct
41 Correct 169 ms 39152 KB Output is correct
42 Correct 83 ms 32684 KB Output is correct
43 Correct 181 ms 40360 KB Output is correct
44 Correct 191 ms 40356 KB Output is correct
45 Correct 189 ms 40532 KB Output is correct
46 Correct 182 ms 40588 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 320 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 320 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 316 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 324 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 1 ms 320 KB Output is correct
69 Correct 0 ms 324 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 320 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 4 ms 1364 KB Output is correct
75 Correct 5 ms 1480 KB Output is correct
76 Correct 4 ms 1492 KB Output is correct
77 Correct 5 ms 1492 KB Output is correct
78 Correct 4 ms 1492 KB Output is correct
79 Correct 3 ms 1236 KB Output is correct
80 Correct 3 ms 1236 KB Output is correct
81 Correct 5 ms 1444 KB Output is correct
82 Correct 5 ms 1352 KB Output is correct
83 Correct 5 ms 1356 KB Output is correct
84 Correct 3 ms 1320 KB Output is correct
85 Correct 5 ms 1484 KB Output is correct
86 Correct 5 ms 1356 KB Output is correct
87 Correct 5 ms 1364 KB Output is correct
88 Correct 3 ms 1236 KB Output is correct
89 Correct 4 ms 1492 KB Output is correct
90 Correct 4 ms 1484 KB Output is correct
91 Correct 5 ms 1484 KB Output is correct
92 Correct 3 ms 1236 KB Output is correct
93 Correct 5 ms 1492 KB Output is correct
94 Correct 5 ms 1492 KB Output is correct
95 Correct 5 ms 1484 KB Output is correct
96 Correct 3 ms 1236 KB Output is correct
97 Correct 4 ms 1484 KB Output is correct
98 Correct 5 ms 1492 KB Output is correct
99 Correct 5 ms 1492 KB Output is correct
100 Correct 3 ms 1224 KB Output is correct
101 Correct 4 ms 1108 KB Output is correct
102 Correct 4 ms 1104 KB Output is correct
103 Correct 4 ms 1100 KB Output is correct
104 Correct 4 ms 1104 KB Output is correct
105 Correct 4 ms 1108 KB Output is correct
106 Correct 4 ms 1108 KB Output is correct
107 Correct 4 ms 1108 KB Output is correct
108 Correct 3 ms 1108 KB Output is correct
109 Correct 4 ms 972 KB Output is correct
110 Correct 2 ms 940 KB Output is correct
111 Correct 194 ms 38284 KB Output is correct
112 Correct 197 ms 38764 KB Output is correct
113 Correct 194 ms 39248 KB Output is correct
114 Correct 213 ms 40648 KB Output is correct
115 Correct 231 ms 41384 KB Output is correct
116 Correct 116 ms 32840 KB Output is correct
117 Correct 118 ms 32744 KB Output is correct
118 Correct 251 ms 38292 KB Output is correct
119 Correct 250 ms 37840 KB Output is correct
120 Correct 206 ms 37700 KB Output is correct
121 Correct 104 ms 32740 KB Output is correct
122 Correct 291 ms 38652 KB Output is correct
123 Correct 271 ms 38064 KB Output is correct
124 Correct 269 ms 37672 KB Output is correct
125 Correct 98 ms 32712 KB Output is correct
126 Correct 209 ms 40552 KB Output is correct
127 Correct 221 ms 40040 KB Output is correct
128 Correct 208 ms 39608 KB Output is correct
129 Correct 104 ms 32748 KB Output is correct
130 Correct 222 ms 41612 KB Output is correct
131 Correct 205 ms 41192 KB Output is correct
132 Correct 203 ms 40816 KB Output is correct
133 Correct 101 ms 32676 KB Output is correct
134 Correct 205 ms 41860 KB Output is correct
135 Correct 199 ms 41676 KB Output is correct
136 Correct 196 ms 41296 KB Output is correct
137 Correct 105 ms 32764 KB Output is correct
138 Correct 208 ms 41916 KB Output is correct
139 Correct 210 ms 41904 KB Output is correct
140 Correct 186 ms 41368 KB Output is correct
141 Correct 107 ms 32656 KB Output is correct
142 Correct 155 ms 26224 KB Output is correct
143 Correct 152 ms 26196 KB Output is correct
144 Correct 162 ms 26204 KB Output is correct
145 Correct 147 ms 26308 KB Output is correct
146 Correct 148 ms 26184 KB Output is correct
147 Correct 155 ms 26176 KB Output is correct
148 Correct 142 ms 25892 KB Output is correct
149 Correct 140 ms 25744 KB Output is correct
150 Correct 137 ms 25736 KB Output is correct
151 Correct 132 ms 25132 KB Output is correct
152 Correct 71 ms 20564 KB Output is correct
153 Correct 155 ms 26304 KB Output is correct
154 Correct 149 ms 26140 KB Output is correct
155 Correct 145 ms 25928 KB Output is correct
156 Correct 144 ms 25836 KB Output is correct
157 Correct 148 ms 25772 KB Output is correct
158 Correct 143 ms 25464 KB Output is correct
159 Correct 142 ms 24924 KB Output is correct
160 Correct 66 ms 20444 KB Output is correct
161 Correct 197 ms 31576 KB Output is correct
162 Correct 190 ms 31308 KB Output is correct
163 Correct 181 ms 31168 KB Output is correct
164 Correct 195 ms 30920 KB Output is correct
165 Correct 176 ms 30560 KB Output is correct
166 Correct 75 ms 32388 KB Output is correct
167 Correct 190 ms 39760 KB Output is correct
168 Correct 180 ms 39872 KB Output is correct
169 Correct 181 ms 39876 KB Output is correct
170 Correct 181 ms 39872 KB Output is correct
171 Correct 161 ms 37252 KB Output is correct
172 Correct 157 ms 37204 KB Output is correct
173 Correct 199 ms 25092 KB Output is correct
174 Correct 181 ms 25344 KB Output is correct
175 Correct 209 ms 25032 KB Output is correct
176 Correct 163 ms 24120 KB Output is correct