oj.uz

Submission #727916

# Submission time Handle Problem Language Result Execution time Memory
727916 2023-04-21T14:50:57 Z sysia Event Hopping 2 (JOI21_event2) C++17
100 / 100
 265 ms 60876 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

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, 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 (auto [l, r, i]: tab){
        debug(l, r, i);
    }
    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]);
    }
    debug(dp);
    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;
}

Compilation message

event2.cpp: In function 'void solve()':
event2.cpp:65:15: warning: structured binding declaration set but not used [-Wunused-but-set-variable]
   65 |     for (auto [l, r, i]: tab){
      |               ^~~~~~~~~

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 207 ms 57724 KB Output is correct
5 Correct 197 ms 57284 KB Output is correct
6 Correct 206 ms 56988 KB Output is correct
7 Correct 209 ms 56412 KB Output is correct
8 Correct 197 ms 57572 KB Output is correct
9 Correct 212 ms 57264 KB Output is correct
10 Correct 196 ms 56924 KB Output is correct
11 Correct 195 ms 56428 KB Output is correct
12 Correct 200 ms 57760 KB Output is correct
13 Correct 203 ms 57520 KB Output is correct
14 Correct 199 ms 57204 KB Output is correct
15 Correct 201 ms 56644 KB Output is correct
16 Correct 204 ms 60008 KB Output is correct
17 Correct 209 ms 59872 KB Output is correct
18 Correct 191 ms 59020 KB Output is correct
19 Correct 200 ms 60612 KB Output is correct
20 Correct 190 ms 60700 KB Output is correct
21 Correct 189 ms 60836 KB Output is correct
22 Correct 193 ms 60736 KB Output is correct
23 Correct 192 ms 60864 KB Output is correct
24 Correct 199 ms 60860 KB Output is correct
25 Correct 205 ms 60876 KB Output is correct
26 Correct 195 ms 60828 KB Output is correct
27 Correct 197 ms 60796 KB Output is correct
28 Correct 87 ms 51504 KB Output is correct
29 Correct 89 ms 51496 KB Output is correct
30 Correct 86 ms 51532 KB Output is correct
31 Correct 90 ms 51492 KB Output is correct
32 Correct 101 ms 51524 KB Output is correct
33 Correct 109 ms 51524 KB Output is correct
34 Correct 168 ms 55396 KB Output is correct
35 Correct 166 ms 54044 KB Output is correct
36 Correct 146 ms 52724 KB Output is correct
37 Correct 198 ms 59384 KB Output is correct
38 Correct 192 ms 58912 KB Output is correct
39 Correct 196 ms 58576 KB Output is correct
40 Correct 197 ms 58284 KB Output is correct
41 Correct 193 ms 58028 KB Output is correct
42 Correct 95 ms 51504 KB Output is correct
43 Correct 217 ms 59220 KB Output is correct
44 Correct 210 ms 59328 KB Output is correct
45 Correct 206 ms 59384 KB Output is correct
46 Correct 211 ms 59416 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 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 316 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 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 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 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 0 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 316 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 0 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 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 6 ms 1996 KB Output is correct
29 Correct 5 ms 2004 KB Output is correct
30 Correct 5 ms 2000 KB Output is correct
31 Correct 5 ms 2004 KB Output is correct
32 Correct 5 ms 2004 KB Output is correct
33 Correct 4 ms 1748 KB Output is correct
34 Correct 4 ms 1872 KB Output is correct
35 Correct 5 ms 2000 KB Output is correct
36 Correct 6 ms 2004 KB Output is correct
37 Correct 6 ms 1972 KB Output is correct
38 Correct 3 ms 1748 KB Output is correct
39 Correct 7 ms 2004 KB Output is correct
40 Correct 6 ms 2004 KB Output is correct
41 Correct 5 ms 2004 KB Output is correct
42 Correct 4 ms 1876 KB Output is correct
43 Correct 5 ms 2004 KB Output is correct
44 Correct 6 ms 2004 KB Output is correct
45 Correct 5 ms 2004 KB Output is correct
46 Correct 4 ms 1876 KB Output is correct
47 Correct 5 ms 2004 KB Output is correct
48 Correct 6 ms 2004 KB Output is correct
49 Correct 5 ms 2004 KB Output is correct
50 Correct 3 ms 1748 KB Output is correct
51 Correct 5 ms 2132 KB Output is correct
52 Correct 6 ms 2132 KB Output is correct
53 Correct 6 ms 2132 KB Output is correct
54 Correct 3 ms 1748 KB Output is correct
55 Correct 4 ms 1352 KB Output is correct
56 Correct 4 ms 1352 KB Output is correct
57 Correct 4 ms 1364 KB Output is correct
58 Correct 4 ms 1356 KB Output is correct
59 Correct 4 ms 1356 KB Output is correct
60 Correct 4 ms 1356 KB Output is correct
61 Correct 4 ms 1364 KB Output is correct
62 Correct 4 ms 1368 KB Output is correct
63 Correct 3 ms 1364 KB Output is correct
64 Correct 2 ms 1236 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 207 ms 57724 KB Output is correct
5 Correct 197 ms 57284 KB Output is correct
6 Correct 206 ms 56988 KB Output is correct
7 Correct 209 ms 56412 KB Output is correct
8 Correct 197 ms 57572 KB Output is correct
9 Correct 212 ms 57264 KB Output is correct
10 Correct 196 ms 56924 KB Output is correct
11 Correct 195 ms 56428 KB Output is correct
12 Correct 200 ms 57760 KB Output is correct
13 Correct 203 ms 57520 KB Output is correct
14 Correct 199 ms 57204 KB Output is correct
15 Correct 201 ms 56644 KB Output is correct
16 Correct 204 ms 60008 KB Output is correct
17 Correct 209 ms 59872 KB Output is correct
18 Correct 191 ms 59020 KB Output is correct
19 Correct 200 ms 60612 KB Output is correct
20 Correct 190 ms 60700 KB Output is correct
21 Correct 189 ms 60836 KB Output is correct
22 Correct 193 ms 60736 KB Output is correct
23 Correct 192 ms 60864 KB Output is correct
24 Correct 199 ms 60860 KB Output is correct
25 Correct 205 ms 60876 KB Output is correct
26 Correct 195 ms 60828 KB Output is correct
27 Correct 197 ms 60796 KB Output is correct
28 Correct 87 ms 51504 KB Output is correct
29 Correct 89 ms 51496 KB Output is correct
30 Correct 86 ms 51532 KB Output is correct
31 Correct 90 ms 51492 KB Output is correct
32 Correct 101 ms 51524 KB Output is correct
33 Correct 109 ms 51524 KB Output is correct
34 Correct 168 ms 55396 KB Output is correct
35 Correct 166 ms 54044 KB Output is correct
36 Correct 146 ms 52724 KB Output is correct
37 Correct 198 ms 59384 KB Output is correct
38 Correct 192 ms 58912 KB Output is correct
39 Correct 196 ms 58576 KB Output is correct
40 Correct 197 ms 58284 KB Output is correct
41 Correct 193 ms 58028 KB Output is correct
42 Correct 95 ms 51504 KB Output is correct
43 Correct 217 ms 59220 KB Output is correct
44 Correct 210 ms 59328 KB Output is correct
45 Correct 206 ms 59384 KB Output is correct
46 Correct 211 ms 59416 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 316 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 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 320 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 316 KB Output is correct
58 Correct 1 ms 320 KB Output is correct
59 Correct 0 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 340 KB Output is correct
63 Correct 1 ms 324 KB Output is correct
64 Correct 1 ms 316 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 6 ms 1996 KB Output is correct
75 Correct 5 ms 2004 KB Output is correct
76 Correct 5 ms 2000 KB Output is correct
77 Correct 5 ms 2004 KB Output is correct
78 Correct 5 ms 2004 KB Output is correct
79 Correct 4 ms 1748 KB Output is correct
80 Correct 4 ms 1872 KB Output is correct
81 Correct 5 ms 2000 KB Output is correct
82 Correct 6 ms 2004 KB Output is correct
83 Correct 6 ms 1972 KB Output is correct
84 Correct 3 ms 1748 KB Output is correct
85 Correct 7 ms 2004 KB Output is correct
86 Correct 6 ms 2004 KB Output is correct
87 Correct 5 ms 2004 KB Output is correct
88 Correct 4 ms 1876 KB Output is correct
89 Correct 5 ms 2004 KB Output is correct
90 Correct 6 ms 2004 KB Output is correct
91 Correct 5 ms 2004 KB Output is correct
92 Correct 4 ms 1876 KB Output is correct
93 Correct 5 ms 2004 KB Output is correct
94 Correct 6 ms 2004 KB Output is correct
95 Correct 5 ms 2004 KB Output is correct
96 Correct 3 ms 1748 KB Output is correct
97 Correct 5 ms 2132 KB Output is correct
98 Correct 6 ms 2132 KB Output is correct
99 Correct 6 ms 2132 KB Output is correct
100 Correct 3 ms 1748 KB Output is correct
101 Correct 4 ms 1352 KB Output is correct
102 Correct 4 ms 1352 KB Output is correct
103 Correct 4 ms 1364 KB Output is correct
104 Correct 4 ms 1356 KB Output is correct
105 Correct 4 ms 1356 KB Output is correct
106 Correct 4 ms 1356 KB Output is correct
107 Correct 4 ms 1364 KB Output is correct
108 Correct 4 ms 1368 KB Output is correct
109 Correct 3 ms 1364 KB Output is correct
110 Correct 2 ms 1236 KB Output is correct
111 Correct 221 ms 57088 KB Output is correct
112 Correct 233 ms 57628 KB Output is correct
113 Correct 219 ms 57884 KB Output is correct
114 Correct 260 ms 59520 KB Output is correct
115 Correct 251 ms 60224 KB Output is correct
116 Correct 137 ms 51468 KB Output is correct
117 Correct 135 ms 51632 KB Output is correct
118 Correct 265 ms 57496 KB Output is correct
119 Correct 259 ms 56984 KB Output is correct
120 Correct 233 ms 56780 KB Output is correct
121 Correct 117 ms 51480 KB Output is correct
122 Correct 247 ms 57540 KB Output is correct
123 Correct 252 ms 57136 KB Output is correct
124 Correct 222 ms 56544 KB Output is correct
125 Correct 111 ms 51480 KB Output is correct
126 Correct 250 ms 59380 KB Output is correct
127 Correct 228 ms 58868 KB Output is correct
128 Correct 240 ms 58424 KB Output is correct
129 Correct 117 ms 51652 KB Output is correct
130 Correct 228 ms 60360 KB Output is correct
131 Correct 223 ms 60032 KB Output is correct
132 Correct 218 ms 59588 KB Output is correct
133 Correct 119 ms 51460 KB Output is correct
134 Correct 226 ms 60700 KB Output is correct
135 Correct 246 ms 60568 KB Output is correct
136 Correct 237 ms 60128 KB Output is correct
137 Correct 122 ms 51564 KB Output is correct
138 Correct 223 ms 60724 KB Output is correct
139 Correct 238 ms 60708 KB Output is correct
140 Correct 214 ms 60196 KB Output is correct
141 Correct 124 ms 51524 KB Output is correct
142 Correct 177 ms 37256 KB Output is correct
143 Correct 185 ms 37268 KB Output is correct
144 Correct 171 ms 37256 KB Output is correct
145 Correct 166 ms 37480 KB Output is correct
146 Correct 160 ms 37264 KB Output is correct
147 Correct 163 ms 37128 KB Output is correct
148 Correct 166 ms 37120 KB Output is correct
149 Correct 150 ms 36892 KB Output is correct
150 Correct 146 ms 36808 KB Output is correct
151 Correct 138 ms 36164 KB Output is correct
152 Correct 73 ms 31300 KB Output is correct
153 Correct 160 ms 37336 KB Output is correct
154 Correct 160 ms 37156 KB Output is correct
155 Correct 163 ms 37332 KB Output is correct
156 Correct 158 ms 37012 KB Output is correct
157 Correct 156 ms 36772 KB Output is correct
158 Correct 153 ms 36780 KB Output is correct
159 Correct 151 ms 36128 KB Output is correct
160 Correct 78 ms 31256 KB Output is correct
161 Correct 212 ms 46660 KB Output is correct
162 Correct 211 ms 46632 KB Output is correct
163 Correct 208 ms 46232 KB Output is correct
164 Correct 198 ms 46148 KB Output is correct
165 Correct 211 ms 45856 KB Output is correct
166 Correct 93 ms 51532 KB Output is correct
167 Correct 225 ms 59300 KB Output is correct
168 Correct 225 ms 59496 KB Output is correct
169 Correct 218 ms 59428 KB Output is correct
170 Correct 210 ms 59432 KB Output is correct
171 Correct 185 ms 56180 KB Output is correct
172 Correct 178 ms 56912 KB Output is correct
173 Correct 211 ms 36568 KB Output is correct
174 Correct 230 ms 36468 KB Output is correct
175 Correct 205 ms 36428 KB Output is correct
176 Correct 187 ms 35440 KB Output is correct