test/segment_add_get_min.test.cpp

• View this file on GitHub
• Last update: 2025-05-31 14:45:17+09:00
• Link: https://judge.yosupo.jp/problem/segment_add_get_min

Depends on

• Dynamic Li Chao Tree (data_structure/dynamic_li_chao_tree.hpp)

Code

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

#include <data_structure/dynamic_li_chao_tree.hpp>  // for DynamicLiChaoTree
#include <fastio/base.hpp>                          // for FASTIO, cin, cout
#include <fastio/char/write.hpp>                    // for operator<<
#include <fastio/signed/read.hpp>                   // for operator>>
#include <fastio/signed/write.hpp>                  // for operator<<
#include <fastio/string/write.hpp>                  // for operator<<
#include <string>                                   // for basic_string
#include <templates/macro/abbrev/endl.hpp>          // for endl
#include <templates/macro/abbrev/ll.hpp>            // for ll
#include <templates/macro/inf.hpp>                  // for INF
#include <templates/rep.hpp>                        // for rep
#include <templates/template.hpp>

using namespace std;

int main() {
    int n, q;
    cin >> n >> q;
    DynamicLiChaoTree<ll, -1000000001, 1000000001, []() { return Infinite; }> seg;
    rep(_, n) {
        ll l, r, a, b;
        cin >> l >> r >> a >> b;
        seg.add(a, b, l, r);
    }
    rep(_, q) {
        int T;
        cin >> T;
        if (T == 0) {
            ll l, r, a, b;
            cin >> l >> r >> a >> b;
            seg.add(a, b, l, r);
        } else {
            ll p;
            cin >> p;
            auto ans = seg(p);
            if (ans == Infinite) {
                cout << "INFINITY" << endl;
            } else {
                cout << ans << endl;
            }
        }
    }
}

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

#include <data_structure/dynamic_li_chao_tree.hpp>  // for DynamicLiChaoTree
#include <fastio/base.hpp>                          // for FASTIO, cin, cout
#include <fastio/char/write.hpp>                    // for operator<<
#include <fastio/signed/read.hpp>                   // for operator>>
#include <fastio/signed/write.hpp>                  // for operator<<
#include <fastio/string/write.hpp>                  // for operator<<
#include <string>                                   // for basic_string
#include <templates/macro/abbrev/endl.hpp>          // for endl
#include <templates/macro/abbrev/ll.hpp>            // for ll
#include <templates/macro/inf.hpp>                  // for INF
#include <templates/rep.hpp>                        // for rep
#include <templates/template.hpp>

using namespace std;

int main() {
    int n, q;
    cin >> n >> q;
    DynamicLiChaoTree<ll, -1000000001, 1000000001, []() { return Infinite; }> seg;
    rep(_, n) {
        ll l, r, a, b;
        cin >> l >> r >> a >> b;
        seg.add(a, b, l, r);
    }
    rep(_, q) {
        int T;
        cin >> T;
        if (T == 0) {
            ll l, r, a, b;
            cin >> l >> r >> a >> b;
            seg.add(a, b, l, r);
        } else {
            ll p;
            cin >> p;
            auto ans = seg(p);
            if (ans == Infinite) {
                cout << "INFINITY" << endl;
            } else {
                cout << ans << endl;
            }
        }
    }
}

Back to top page