oj.uz

Submission #931479

# Submission time Handle Problem Language Result Execution time Memory
931479 2024-02-21T22:59:18 Z ksujay2 Event Hopping 2 (JOI21_event2) C++17
0 / 100
 210 ms 45152 KB 
#include <bits/stdc++.h>
using namespace std;
const int MXN = 100001;
const int MXLG = 19;
int l[MXN], r[MXN];
int ljmp[MXN][MXLG], rjmp[MXN][MXLG];
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int N, K; cin >> N >> K;
    for(int i = 1; i <= N; i++) {
        cin >> l[i] >> r[i];
    }
    {
        map<int, vector<int>> eve;
        for(int i = 1; i <= N; i++) eve[l[i]].push_back(i), eve[r[i]].push_back(-i);
        multiset<pair<int, int>> rs;
        for(int i = 1; i <= N; i++) rs.insert({r[i], i});
        for(auto [u, v] : eve) {
            for(int i : v) {
                if(i < 0) {
                    rjmp[-i][0] = (rs.size() > 0) ? (*rs.begin()).second : 0;
                }
            }
            for(int i : v) {
                if(i > 0) {
                    rs.erase(rs.find({r[i], i}));
                }
            }
        }
    }
    {
        map<int, vector<int>> eve;
        for(int i = 1; i <= N; i++) eve[-l[i]].push_back(-i), eve[-r[i]].push_back(i);
        multiset<pair<int, int>> ls;
        for(int i = 1; i <= N; i++) ls.insert({l[i], i});
        for(auto [u, v] : eve) {
            for(int i : v) {
                if(i < 0) {
                    ljmp[-i][0] = (ls.size() > 0) ? (*ls.rbegin()).second : 0;
                }
            }
            for(int i : v) {
                if(i > 0) {
                    ls.erase(ls.find({l[i], i}));
                }
            }
        }
    }
    for(int i = 0; i < MXLG - 1; i++) {
        for(int j = 1; j <= N; j++) {
            ljmp[j][i + 1] = ljmp[ljmp[j][i]][i];
            rjmp[j][i + 1] = rjmp[rjmp[j][i]][i];
        }
    }
    vector<int> ans;
    set<pair<int, int>> ls, rs;
    ls.insert({0, N});
    rs.insert({0, N});
    ls.insert({1e9+1, N});
    rs.insert({1e9+1, N});
    int curv = N;
    for(int i = 1; i <= N; i++) {
        auto [lb, pv1] = *prev(rs.upper_bound({r[i], N}));
        auto [rb, pv2] = *ls.lower_bound({l[i], 0});
        if(l[i] < lb || rb < r[i]) {
            continue;
        }
        int lv = 0, rv = 0;
        int li = i, ri = i;
        for(int j = MXLG - 1; j >= 0; j--) {
            if(ljmp[li][j] != 0 && lb <= l[ljmp[li][j]]) {
                li = ljmp[li][j];
                lv += 1 << j;
            }
            if(rjmp[ri][j] != 0 && r[rjmp[ri][j]] < rb) {
                ri = rjmp[ri][j];
                rv += 1 << j;
            }
        }
        if(curv - min(pv1, pv2) + lv + rv + 1 >= K) {
            ans.push_back(i);
            curv = curv - min(pv1, pv2) + lv + rv + 1;
            ls.insert({l[i], lv});
            rs.insert({r[i], rv});
        }
        if(ans.size() == K) break;
    }
    if(ans.size() == 0) cout << "-1\n";
    else {
        for(int i : ans) cout << i << "\n";    
    }
}

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:86:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   86 |         if(ans.size() == K) break;
      |            ~~~~~~~~~~~^~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2520 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 210 ms 45152 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2520 KB Output is correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2520 KB Output is correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2520 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Incorrect 210 ms 45152 KB Output isn't correct
5 Halted 0 ms 0 KB -