結果

問題 No.2885 Range Triangle Collision Decision Queries
ユーザー noya2noya2
提出日時 2024-09-12 16:45:39
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,501 ms / 3,000 ms
コード長 10,111 bytes
コンパイル時間 4,488 ms
コンパイル使用メモリ 278,240 KB
実行使用メモリ 40,076 KB
最終ジャッジ日時 2024-09-12 16:46:42
合計ジャッジ時間 61,459 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
6,812 KB
testcase_01 AC 111 ms
6,940 KB
testcase_02 AC 70 ms
6,944 KB
testcase_03 AC 62 ms
6,940 KB
testcase_04 AC 60 ms
6,940 KB
testcase_05 AC 344 ms
26,844 KB
testcase_06 AC 397 ms
26,796 KB
testcase_07 AC 369 ms
26,788 KB
testcase_08 AC 406 ms
26,664 KB
testcase_09 AC 336 ms
26,792 KB
testcase_10 AC 1,501 ms
39,336 KB
testcase_11 AC 1,497 ms
39,204 KB
testcase_12 AC 1,457 ms
39,336 KB
testcase_13 AC 1,428 ms
39,332 KB
testcase_14 AC 1,417 ms
39,208 KB
testcase_15 AC 978 ms
39,336 KB
testcase_16 AC 938 ms
39,340 KB
testcase_17 AC 840 ms
40,076 KB
testcase_18 AC 912 ms
39,336 KB
testcase_19 AC 904 ms
39,336 KB
testcase_20 AC 891 ms
39,464 KB
testcase_21 AC 956 ms
39,332 KB
testcase_22 AC 855 ms
38,408 KB
testcase_23 AC 1,465 ms
39,324 KB
testcase_24 AC 1,485 ms
39,460 KB
testcase_25 AC 1,423 ms
38,628 KB
testcase_26 AC 1,001 ms
39,332 KB
testcase_27 AC 1,035 ms
39,220 KB
testcase_28 AC 993 ms
39,340 KB
testcase_29 AC 989 ms
39,336 KB
testcase_30 AC 964 ms
39,340 KB
testcase_31 AC 945 ms
39,336 KB
testcase_32 AC 1,033 ms
39,336 KB
testcase_33 AC 1,034 ms
39,332 KB
testcase_34 AC 971 ms
39,332 KB
testcase_35 AC 1,097 ms
39,344 KB
testcase_36 AC 996 ms
39,340 KB
testcase_37 AC 1,096 ms
39,348 KB
testcase_38 AC 964 ms
39,208 KB
testcase_39 AC 1,090 ms
39,328 KB
testcase_40 AC 444 ms
39,224 KB
testcase_41 AC 448 ms
39,332 KB
testcase_42 AC 464 ms
39,336 KB
testcase_43 AC 538 ms
26,660 KB
testcase_44 AC 527 ms
26,660 KB
testcase_45 AC 558 ms
26,668 KB
testcase_46 AC 486 ms
26,632 KB
testcase_47 AC 907 ms
39,340 KB
testcase_48 AC 984 ms
39,336 KB
testcase_49 AC 49 ms
6,944 KB
testcase_50 AC 50 ms
6,940 KB
testcase_51 AC 52 ms
6,944 KB
testcase_52 AC 59 ms
6,944 KB
testcase_53 AC 2 ms
6,944 KB
testcase_54 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp"

#line 5 "/Users/noya2/Desktop/Noya2_library/data_structure/compress.hpp"

namespace noya2{

template<typename T>
struct compress {
    std::vector<T> raws;
    compress () {}
    compress (const vector<T> &_raws) : raws(_raws){ build(); }
    void build(){
        std::sort(raws.begin(), raws.end());
        raws.erase(std::unique(raws.begin(), raws.end()), raws.end());
    }
    int id(const T &raw){ return lb(raw); }
    T raw(const int &id){ return raws[id]; }
    void add(const T &raw){ raws.emplace_back(raw); }
    void reserve(size_t sz){ raws.reserve(sz); }
    size_t size(){ return raws.size(); }
    int lb(const T &raw){ return lower_bound(all(raws),raw) - raws.begin(); }
    int ub(const T &raw){ return upper_bound(all(raws),raw) - raws.begin(); }
    bool contains(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size()) return raws[jd] == raw;
        return false;
    }
    int contains_id(const T &raw){
        int jd = lb(raw);
        if (jd < (int)size() && raws[jd] == raw) return jd;
        return -1;
    }
};

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp"

namespace noya2{

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = 0;
        size = 1;
        while (size < _n) size <<= 1, log++;

        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

} // namespace noya2
#line 5 "c.cpp"

int op(int a, int b){
    return max(a,b);
}
int e(){
    return -1;
}

void solve(){
    int n; in(n);
    vector<ll> a(n), b(n), d(n);
    rep(i,n){
        in(a[i],b[i],d[i]);
    }
    int q; in(q);
    vector<vector<tuple<int,int,int>>> ls(n+1);
    rep(i,q){
        int s, l, r; in(s,l,r); l--; s--;
        ls[r].push_back({l,i,s});
    }
    compress<ll> cpyu, cpyd, cppu, cppd, cpmu, cpmd;
    rep(i,n){
        cpyu.add(b[i]);
        cpyd.add(b[i]-d[i]);
        cppu.add(a[i]+b[i]);
        cppd.add(a[i]+b[i]-2*d[i]);
        cpmu.add(a[i]-b[i]);
        cpmd.add(a[i]-b[i]+2*d[i]);
    }
    cpyu.build();
    cpyd.build();
    cppu.build();
    cppd.build();
    cpmu.build();
    cpmd.build();
    segtree<int,op,e> segyu(cpyu.size()), segyd(cpyd.size()), segpu(cppu.size()), segpd(cppd.size()), segmu(cpmu.size()), segmd(cpmd.size());
    vector<bool> ans(q);
    rep(i,n){
        segyu.set(cpyu.id(b[i]),i);
        segyd.set(cpyd.id(b[i]-d[i]),i);
        segpu.set(cppu.id(a[i]+b[i]),i);
        segpd.set(cppd.id(a[i]+b[i]-2*d[i]),i);
        segmu.set(cpmu.id(a[i]-b[i]),i);
        segmd.set(cpmd.id(a[i]-b[i]+2*d[i]),i);
        for (auto [l, qid, s] : ls[i+1]){
            int ma = e();
            chmax(ma,segyu.prod(0,cpyu.ub(b[s]-d[s])));
            chmax(ma,segyd.prod(cpyd.lb(b[s]),cpyd.size()));
            chmax(ma,segpu.prod(0,cppu.ub(a[s]+b[s]-2*d[s])));
            chmax(ma,segpd.prod(cppd.lb(a[s]+b[s]),cppd.size()));
            chmax(ma,segmu.prod(cpmu.lb(a[s]-b[s]+2*d[s]),cpmu.size()));
            chmax(ma,segmd.prod(0,cpmd.ub(a[s]-b[s])));
            ans[qid] = (ma < l);
        }
    }
    rep(i,q){
        yn(ans[i]);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0