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

提出ソース

結果

問題	No.2421 entersys?
ユーザー	mikam
提出日時	2023-08-12 15:14:46
言語	C++17(clang) (17.0.6 + boost 1.83.0)
結果	MLE
実行時間	-
コード長	10,345 bytes
コンパイル時間	7,739 ms
コンパイル使用メモリ	243,780 KB
実行使用メモリ	556,184 KB
最終ジャッジ日時	2024-04-30 08:38:56
合計ジャッジ時間	36,889 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	4 ms 6,940 KB
testcase_02	AC	10 ms 8,576 KB
testcase_03	AC	3 ms 6,940 KB
testcase_04	AC	5 ms 6,940 KB
testcase_05	AC	7 ms 6,944 KB
testcase_06	AC	8 ms 6,944 KB
testcase_07	AC	8 ms 6,944 KB
testcase_08	AC	9 ms 7,680 KB
testcase_09	AC	14 ms 10,112 KB
testcase_10	AC	6 ms 6,944 KB
testcase_11	AC	1,588 ms 430,216 KB
testcase_12	AC	1,601 ms 430,580 KB
testcase_13	AC	1,603 ms 430,944 KB
testcase_14	AC	1,591 ms 430,132 KB
testcase_15	AC	1,650 ms 430,352 KB
testcase_16	AC	1,644 ms 436,616 KB
testcase_17	AC	1,576 ms 436,680 KB
testcase_18	AC	1,540 ms 436,176 KB
testcase_19	AC	1,524 ms 435,544 KB
testcase_20	AC	1,543 ms 436,328 KB
testcase_21	AC	1,326 ms 306,352 KB
testcase_22	AC	1,209 ms 439,468 KB
testcase_23	MLE	-
testcase_24	MLE	-
testcase_25	MLE	-
testcase_26	AC	924 ms 285,440 KB
testcase_27	AC	951 ms 285,568 KB
testcase_28	AC	944 ms 285,824 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:299:13: note: in instantiation of function template specialization 'print<long long>' requested here
  299 |             print(seg.get(t));
      |             ^
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 F,S (*mapping)(F, S, ll, ll),F (*composition)(F, F),F (*id)()>
struct dynamic_lazy_segtree{
private:
    ll n;
    struct node{
        ll lx, rx;
        node *l, *r;
        S d;
        F lz;
        node(ll lx, ll rx, S val): lx(lx), rx(rx),
        l(nullptr), r(nullptr), d(val), lz(id()){}
    };
    node *root;
    node *make_node(ll lx, ll rx, S val = e()){
        return new node(lx, rx, val);
    }
    void all_apply(node *v, F x){
        v->d = mapping(x, v->d, v->lx, v->rx);
        v->lz = composition(x, v->lz);
    }
    void push(node *v){
        if(v->lz == id()) return;
        ll mid = (v->lx + v->rx) >> 1;
        if(!v->l) v->l = make_node(v->lx, mid);
        if(!v->r) v->r = make_node(mid, v->rx);
        all_apply(v->l, v->lz);
        all_apply(v->r, v->lz);
        v->lz = id();
    }
    S set(node *v, ll k, S x){
        if(v->rx - v->lx == 1) return v->d = x;
        push(v);
        ll mid = (v->lx + v->rx) >> 1;
        if(mid <= k){
            if(!v->r) v->r = make_node(mid, v->rx);
            if(!v->l) return v->d = set(v->r, k, x);
            else return v->d = op(v->l->d, set(v->r, k, x));
        }else{
            if(!v->l) v->l = make_node(v->lx, mid);
            if(!v->r) return v->d = set(v->l, k, x);
            else return v->d = op(set(v->l, k, x), v->r->d);
        }
    }
    S get(node *v, ll k){
        if(!v) return e();
        if(v->rx - v->lx == 1) return v->d;
        push(v);
        ll mid = (v->lx + v->rx) >> 1;
        if(mid <= k) return get(v->r, k);
        else return get(v->l, k);
    }
    S update(node *v, ll l, ll r, F x){
        if(r <= v->lx || v->rx <= l) return v->d;
        if(l <= v->lx && v->rx <= r){
            all_apply(v, x);
            return v->d;
        }
        push(v);
        ll mid = (v->lx + v->rx) >> 1;
        if(!v->l) v->l = make_node(v->lx, mid);
        if(!v->r) v->r = make_node(mid, v->rx);
        return v->d = op(update(v->l, l, r, x), update(v->r, l, r, x));
    }
    S prod(node *v, ll l, ll r){
        if(!v || r <= v->lx || v->rx <= l) return e();
        if(l <= v->lx && v->rx <= r) return v->d;
        push(v);
        return op(prod(v->l, l, r), prod(v->r, l, r));
    }
    template<typename G> ll max_right(node *v, const ll l, const G &g, S &p){
        if(v->rx <= l) return n;
        push(v);
        if(l <= v->lx){
            S m = op(p, v->d);
            if(g(m)) {
                p = op(p, v->d);
                return n;
            }
            if(v->rx - v->lx == 1) return v->rx;
        }
        ll res = n;
        if(v->l) res = max_right(v->l, l, g, p);
        if(res != n) return res;
        if(v->r) res = max_right(v->r, l, g, p);
        return res;
    }
    template<typename G> ll min_left(node *v, const ll r, const G &g, S &p){
        if(r < v->lx) return 0;
        push(v);
        if(v->rx <= r + 1){
            S m = op(v->d, p);
            if(g(m)) {
                p = op(v->d,p);
                return 0;
            }
            if(v->rx - v->lx == 1) return v->rx;
        }
        ll res = 0;
        if(v->r) res = min_left(v->r, r, g, p);
        if(res != 0) return res;
        if(v->l) res = min_left(v->l, r, g, p);
        return res;
    }
public:
    dynamic_lazy_segtree(): root(nullptr),n(0){}
    dynamic_lazy_segtree(ll n):n(n){
        root = make_node(0, n);
    }
    void set(ll k, S x){
        assert(root);
        set(root, k, x);
    }
    S get(ll k){
        assert(root);
        return get(root, k);
    }
    void apply(ll l, ll r, F x){
        assert(root);
        assert(0<=l && l<=r &&r<=n);
        update(root, l, r, x);
    }
    S prod(ll l, ll r){
        assert(root);
        assert(0<=l && l<=r &&r<=n);
        return prod(root, l, r);
    }
    S all_prod(){
        assert(root);
        return root->d;
    }
    template<typename G>
    ll max_right(ll l, const G &g){
        assert(root && 0 <= l && l < n);
        auto p = e();
        assert(g(p));
        return max_right(root, l, g, p);
    }
    template<typename G>
    ll min_left(ll r, const G &g){
        --r;
        assert(root && 0 <= r && r < n);
        auto p = e();
        assert(g(p));
        return min_left(root, r, g, p);
    }
};
using S = long long;
using F = long long;
S op(S a, S b){return a + b;}
S e(){return S(0);}
F id(){return F(0);}
S mapping(F x, S s, ll l, ll r){return s + x * (r - l);}
F composition(F a, F b){return a + b;}

template<typename T>
struct RangeSet{
    set<pair<T,T>> st;
    T TINF;
 
    RangeSet(){
        TINF=numeric_limits<T>::max()/2;
        st.emplace(TINF,TINF);
        st.emplace(-TINF,-TINF);
    }
    // [l,r] covered?
    bool covered(T l,T r){
        assert(l<=r);
        auto ite=prev(st.lower_bound({l+1,l+1}));
        return ite->first<=l and r<=ite->second;
    }
    bool covered(T x){
        return covered(x,x);
    }

    T insert(T l,T r){
        assert(l<=r);
        auto ite=prev(st.lower_bound({l+1,l+1}));
        if(ite->first<=l and r<=ite->second) return T(0);
        T sum_erased=T(0);
        if(ite->first<=l and l<=ite->second+1){
            l=ite->first;
            sum_erased+=ite->second-ite->first+1;
            ite=st.erase(ite);
        }else ite=next(ite);
        while(r>ite->second){
            sum_erased+=ite->second-ite->first+1;
            ite=st.erase(ite);
        }
        if(ite->first-1<=r and r<=ite->second){
            sum_erased+=ite->second-ite->first+1;
            r=ite->second;
            st.erase(ite);
        }
        st.emplace(l,r);
        return r-l+1-sum_erased;
    }
    T insert(T x){
        return insert(x,x);
    }
};
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();
    };
    dynamic_lazy_segtree<S,op,e,F,mapping,composition,id> seg(1e9+1);
    vector<RangeSet<int>> st;

    auto add = [&](string x,int l,int r){
        auto id = f(x);
        while(st.size()<=id)st.push_back(RangeSet<int>{});
        st[id].insert(l,r);
        seg.apply(l,r+1,1);
    };
    rep(i,n){
        STR(x);
        INT(l,r);
        add(x,l,r);
    }
    INT(q);
    while(q--){
        INT(c);
        if(c==1){
            STR(x);
            INT(t);
            yesno(mp.count(x) && f(x)<st.size() && st[f(x)].covered(t));
        }
        else if(c==2){
            INT(t);
            print(seg.get(t));
        }
        else{
            STR(x);
            INT(l,r);
            add(x,l,r);
        }
    }
    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード