제출 #1094550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094550		vladilius	Event Hopping 2 (JOI21_event2)	C++17	32 / 100	3048 ms	26544 KiB

event2

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define arr3 array<int, 3>

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n, k; cin>>n>>k;
    vector<int> l(n + 1), r(n + 1), all1;
    for (int i = 1; i <= n; i++){
        cin>>l[i]>>r[i];
        all1.pb(l[i]);
        all1.pb(r[i]);
    }
    
    sort(all1.begin(), all1.end());
    vector<int> all;
    for (int i: all1){
        if (all.empty() || all.back() != i){
            all.pb(i);
        }
    }
    
    vector<int> :: iterator it;
    for (int i = 1; i <= n; i++){
        it = lower_bound(all.begin(), all.end(), l[i]);
        l[i] = (int) (it - all.begin()) + 1;
        it = lower_bound(all.begin(), all.end(), r[i]);
        r[i] = (int) (it - all.begin()) + 1;
    }
    
    // i -> j: r[i] <= l[j]
    int N = (int) all.size();
    vector<arr3> t;
    vector<int> bg[N + 1];
    for (int i = 1; i <= n; i++){
        t.pb({l[i], r[i], i});
        bg[l[i]].pb(i);
    }
    sort(t.begin(), t.end());
    
    vector<pii> mn(N + 1, {N + 1, 0});
    for (int i = N - 1; i > 0; i--){
        mn[i] = mn[i + 1];
        for (int j: bg[i]){
            mn[i] = min(mn[i + 1], {r[j], j});
        }
    }
    
    vector<int> g(n + 1);
    for (int i = n - 1; i >= 0; i--){
        auto [x, y, ii] = t[i];
        g[ii] = mn[y].ss;
    }
    
    const int lg = log2(n);
    vector<vector<int>> pw(n + 1, vector<int>(lg + 1));
    for (int i = n - 1; i >= 0; i--){
        int ii = t[i][2];
        pw[ii][0] = g[ii];
        for (int j = 1; j <= lg; j++){
            pw[ii][j] = pw[pw[ii][j - 1]][j - 1];
        }
    }
    
    auto get = [&](int x, int y){
        int p = mn[x].ss, cc = 0;
        for (int i = lg; i >= 0; i--){
            int pp = pw[p][i];
            if (!pp) continue;
            if (r[pp] <= y){
                cc += (1 << i);
                p = pp;
            }
        }
        while (p > 0 && r[p] <= y){
            cc++; p = g[p];
        }
        return cc;
    };
    
    vector<int> out;
    set<pii> st;
    for (int i = 1; i <= n; i++){
        if (out.size() == k) break;
        bool ind = 0;
        for (auto [x, y]: st){
            if (max(x, l[i]) < min(y, r[i])){
                ind = 1;
                break;
            }
        }
        if (ind) continue;
        
        st.insert({l[i], r[i]});
        int pre = 1, sum = (int) out.size() + 1;
        for (auto [x, y]: st){
            if (pre <= x){
                sum += get(pre, x);
            }
            pre = y;
        }
        if (pre <= N) sum += get(pre, N);
        
        if (sum >= k){
            out.pb(i);
        }
        else {
            st.erase({l[i], r[i]});
        }
    }
    
    if (out.size() < k){
        cout<<-1<<"\n";
        return 0;
    }
    for (int i: out) cout<<i<<" ";
    cout<<"\n";
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 7
• Subtask 2: 1 / 1
• Subtask 3: 31 / 31
• Subtask 4: 0 / 61