#903213 (C++17(clang)) No.2421 entersys?

提出ソース

結果

問題	No.2421 entersys?
ユーザー	mikam
提出日時	2023-08-12 15:49:23
言語	C++17(clang) (17.0.6 + boost 1.83.0)
結果	AC
実行時間	937 ms / 3,000 ms
コード長	9,439 bytes
コンパイル時間	6,515 ms
コンパイル使用メモリ	244,652 KB
実行使用メモリ	44,384 KB
最終ジャッジ日時	2024-04-30 10:15:34
合計ジャッジ時間	21,005 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	4 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	3 ms 6,944 KB
testcase_05	AC	3 ms 6,944 KB
testcase_06	AC	3 ms 6,944 KB
testcase_07	AC	4 ms 6,940 KB
testcase_08	AC	4 ms 6,944 KB
testcase_09	AC	5 ms 6,944 KB
testcase_10	AC	3 ms 6,944 KB
testcase_11	AC	711 ms 27,944 KB
testcase_12	AC	706 ms 27,920 KB
testcase_13	AC	694 ms 28,048 KB
testcase_14	AC	720 ms 28,104 KB
testcase_15	AC	713 ms 28,068 KB
testcase_16	AC	714 ms 31,008 KB
testcase_17	AC	728 ms 30,852 KB
testcase_18	AC	714 ms 30,992 KB
testcase_19	AC	725 ms 30,988 KB
testcase_20	AC	730 ms 30,856 KB
testcase_21	AC	737 ms 24,764 KB
testcase_22	AC	480 ms 24,492 KB
testcase_23	AC	924 ms 43,828 KB
testcase_24	AC	924 ms 44,384 KB
testcase_25	AC	937 ms 44,000 KB
testcase_26	AC	463 ms 18,944 KB
testcase_27	AC	469 ms 18,944 KB
testcase_28	AC	467 ms 18,944 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp:42:79: warning: expression result unused [-Wunused-value]
   42 | template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
      |                                                                               ^~~~
main.cpp:270:13: note: in instantiation of function template specialization 'print<long long>' requested here
  270 |             print(seg.prod(0,t+1));
      |             ^
1 warning generated.

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <atcoder/internal_math>
using namespace internal;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

template <class S, S (*op)(S, S), S (*e)()> class dynamic_segtree {
public:
    dynamic_segtree(ll n) : n(n), root(nullptr) {}

    void set(ll p, S x) {
        assert(p < n);
        set(root, 0, n, p, x);
    }

    S get(ll p) const {
        assert(p < n);
        return get(root, 0, n, p);
    }

    S prod(ll l, ll r) const {
        assert(l <= r && r <= n);
        return prod(root, 0, n, l, r);
    }

    S all_prod() const { return root ? root->product : e(); }

    void reset(ll l, ll r) {
        assert(l <= r && r <= n);
        return reset(root, 0, n, l, r);
    }

    template <bool (*f)(S)> ll max_right(ll l) const {
        return max_right(l, [](S x) { return f(x); });
    }

    template <class F> ll max_right(ll l, const F& f) const {
        assert(l <= n);
        S product = e();
        assert(f(product));
        return max_right(root, 0, n, l, f, product);
    }

    template <bool (*f)(S)> ll min_left(ll r) const {
        return min_left(r, [](S x) { return f(x); });
    }

    template <class F> ll min_left(ll r, const F& f) const {
        assert(r <= n);
        S product = e();
        assert(f(product));
        return min_left(root, 0, n, r, f, product);
    }

private:
    struct node;
    using node_ptr = std::unique_ptr<node>;

    struct node {
        ll index;
        S value, product;
        node_ptr left, right;

        node(ll index, S value)
            : index(index),
              value(value),
              product(value),
              left(nullptr),
              right(nullptr) {}

        void update() {
            product = op(op(left ? left->product : e(), value),
                         right ? right->product : e());
        }
    };

    const ll n;
    node_ptr root;

    void set(node_ptr& t, ll a, ll b, ll p, S x) const {
        if (!t) {
            t = std::make_unique<node>(p, x);
            return;
        }
        if (t->index == p) {
            t->value = x;
            t->update();
            return;
        }
        ll c = (a + b) >> 1;
        if (p < c) {
            if (t->index < p) std::swap(t->index, p), std::swap(t->value, x);
            set(t->left, a, c, p, x);
        } else {
            if (p < t->index) std::swap(p, t->index), std::swap(x, t->value);
            set(t->right, c, b, p, x);
        }
        t->update();
    }

    S get(const node_ptr& t, ll a, ll b, ll p) const {
        if (!t) return e();
        if (t->index == p) return t->value;
        ll c = (a + b) >> 1;
        if (p < c) return get(t->left, a, c, p);
        else return get(t->right, c, b, p);
    }

    S prod(const node_ptr& t, ll a, ll b, ll l, ll r) const {
        if (!t || b <= l || r <= a) return e();
        if (l <= a && b <= r) return t->product;
        ll c = (a + b) >> 1;
        S result = prod(t->left, a, c, l, r);
        if (l <= t->index && t->index < r) result = op(result, t->value);
        return op(result, prod(t->right, c, b, l, r));
    }

    void reset(node_ptr& t, ll a, ll b, ll l, ll r) const {
        if (!t || b <= l || r <= a) return;
        if (l <= a && b <= r) {
            t.reset();
            return;
        }
        ll c = (a + b) >> 1;
        reset(t->left, a, c, l, r);
        reset(t->right, c, b, l, r);
        t->update();
    }

    template <class F>
    ll max_right(const node_ptr& t, ll a, ll b,
                     ll l, const F& f, S& product) const {
        if (!t || b <= l) return n;
        if (f(op(product, t->product))) {
            product = op(product, t->product);
            return n;
        }
        ll c = (a + b) >> 1;
        ll result = max_right(t->left, a, c, l, f, product);
        if (result != n) return result;
        if (l <= t->index) {
            product = op(product, t->value);
            if (!f(product)) return t->index;
        }
        return max_right(t->right, c, b, l, f, product);
    }

    template <class F>
    ll min_left(const node_ptr& t, ll a, ll b,
                    ll r, const F& f, S& product) const {
        if (!t || r <= a) return 0;
        if (f(op(t->product, product))) {
            product = op(t->product, product);
            return 0;
        }
        ll c = (a + b) >> 1;
        ll result = min_left(t->right, c, b, r, f, product);
        if (result != 0) return result;
        if (t->index < r) {
            product = op(t->value, product);
            if (!f(product)) return t->index + 1;
        }
        return min_left(t->left, a, c, r, f, product);
    }
};
using S = int;
S op(int a,int b){return a+b;}
S e(){return 0;}
using Seg = dynamic_segtree<S,op,e>;

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n);
    map<string,int> mp;
    auto f = [&](string s){
        if(mp.count(s))return mp[s];
        return mp[s] = mp.size();
    };
    Seg seg(1e9+1);
    vector<set<P>> st;
    auto add = [&](string x,int l,int r){
        auto id = f(x);
        while(st.size()<=id)st.push_back(set<P>{});
        st[id].insert({l,r});
        seg.set(l,seg.get(l)+1);
        seg.set(r+1,seg.get(r+1)-1);
    };
    rep(i,n){
        STR(x);
        INT(l,r);
        add(x,l,r);
    }
    auto covered = [&](string x,int t){
        auto id = f(x);
        auto it = st[id].lower_bound({t+1,-1});
        if(it==st[id].begin())return false;
        return t <= prev(it)->second;
    };
    INT(q);
    while(q--){
        INT(c);
        if(c==1){
            STR(x);
            INT(t);
            yesno(mp.count(x) && f(x)<st.size() && covered(x,t));
        }
        else if(c==2){
            INT(t);
            print(seg.prod(0,t+1));
        }
        else{
            STR(x);
            INT(l,r);
            add(x,l,r);
        }
    }
    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード