DataStructure/Predecessor_problem.test.cpp

• View this file on GitHub
• Last update: 2025-05-07 22:18:34+07:00
• Problem: https://judge.yosupo.jp/problem/predecessor_problem

Depends on

• template.h

Code

#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"

#include "../template.h"

template <typename T>
class custom_set {
public:
    set<T> s;

    void insert(T k) {
        s.insert(k);
    }

    void erase(T k) {
        s.erase(k);
    }

    bool contain(T k) {
        return s.count(k);
    }

    T find_next(T k) {
        auto it = s.lower_bound(k);
        if (it == s.end())
            return -1;
        return *it;
    }

    T find_prev(T k) {
        auto it = s.upper_bound(k);
        if (it == s.begin())
            return -1;
        return *prev(it);
    }
};

void solve(){
    int n, q; cin >> n >> q;
    string str; cin >> str;
    custom_set<int> s;
    for (size_t i = 0; i < str.size(); i++) {
        if (str[i] == '1')
            s.insert(i);
    }
    while (q--) {
        int tv, k; cin >> tv >> k;
        if (tv == 0) {
            s.insert(k);
        } else if (tv == 1) {
            s.erase(k);
        } else if (tv == 2) {
            cout << (s.contain(k) ? 1 : 0) << '\n';
        } else if (tv == 3) {
            cout << s.find_next(k) << '\n'; 
        } else if (tv == 4) {
            cout << s.find_prev(k) << '\n';
        }
    }
}

#line 1 "DataStructure/Predecessor_problem.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/predecessor_problem"

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 4 "DataStructure/Predecessor_problem.test.cpp"

template <typename T>
class custom_set {
public:
    set<T> s;

    void insert(T k) {
        s.insert(k);
    }

    void erase(T k) {
        s.erase(k);
    }

    bool contain(T k) {
        return s.count(k);
    }

    T find_next(T k) {
        auto it = s.lower_bound(k);
        if (it == s.end())
            return -1;
        return *it;
    }

    T find_prev(T k) {
        auto it = s.upper_bound(k);
        if (it == s.begin())
            return -1;
        return *prev(it);
    }
};

void solve(){
    int n, q; cin >> n >> q;
    string str; cin >> str;
    custom_set<int> s;
    for (size_t i = 0; i < str.size(); i++) {
        if (str[i] == '1')
            s.insert(i);
    }
    while (q--) {
        int tv, k; cin >> tv >> k;
        if (tv == 0) {
            s.insert(k);
        } else if (tv == 1) {
            s.erase(k);
        } else if (tv == 2) {
            cout << (s.contain(k) ? 1 : 0) << '\n';
        } else if (tv == 3) {
            cout << s.find_next(k) << '\n'; 
        } else if (tv == 4) {
            cout << s.find_prev(k) << '\n';
        }
    }
}

Back to top page