#880167 (C++17) No.961 Vibrant Fillumination

提出ソース

結果

問題	No.961 Vibrant Fillumination
ユーザー	heno239
提出日時	2023-06-12 23:06:15
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	394 ms / 5,000 ms
コード長	9,444 bytes
コンパイル時間	3,094 ms
コンパイル使用メモリ	186,040 KB
実行使用メモリ	31,048 KB
最終ジャッジ日時	2024-06-11 22:44:25
合計ジャッジ時間	16,882 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 11,776 KB
testcase_01	AC	8 ms 11,776 KB
testcase_02	AC	172 ms 28,544 KB
testcase_03	AC	198 ms 28,616 KB
testcase_04	AC	171 ms 28,612 KB
testcase_05	AC	170 ms 28,492 KB
testcase_06	AC	179 ms 28,488 KB
testcase_07	AC	167 ms 28,484 KB
testcase_08	AC	167 ms 28,612 KB
testcase_09	AC	167 ms 28,616 KB
testcase_10	AC	105 ms 30,024 KB
testcase_11	AC	111 ms 29,840 KB
testcase_12	AC	104 ms 29,892 KB
testcase_13	AC	101 ms 29,824 KB
testcase_14	AC	134 ms 29,772 KB
testcase_15	AC	99 ms 29,868 KB
testcase_16	AC	105 ms 29,784 KB
testcase_17	AC	100 ms 29,900 KB
testcase_18	AC	102 ms 29,732 KB
testcase_19	AC	99 ms 29,792 KB
testcase_20	AC	97 ms 29,788 KB
testcase_21	AC	101 ms 29,736 KB
testcase_22	AC	94 ms 29,848 KB
testcase_23	AC	99 ms 29,768 KB
testcase_24	AC	98 ms 29,932 KB
testcase_25	AC	98 ms 29,896 KB
testcase_26	AC	78 ms 28,248 KB
testcase_27	AC	79 ms 29,388 KB
testcase_28	AC	86 ms 28,496 KB
testcase_29	AC	84 ms 29,600 KB
testcase_30	AC	78 ms 29,128 KB
testcase_31	AC	64 ms 27,080 KB
testcase_32	AC	87 ms 31,048 KB
testcase_33	AC	7 ms 11,720 KB
testcase_34	AC	132 ms 28,832 KB
testcase_35	AC	149 ms 28,576 KB
testcase_36	AC	186 ms 29,036 KB
testcase_37	AC	341 ms 28,736 KB
testcase_38	AC	301 ms 28,472 KB
testcase_39	AC	394 ms 28,616 KB
testcase_40	AC	345 ms 28,756 KB
testcase_41	AC	319 ms 28,872 KB
testcase_42	AC	267 ms 28,704 KB
testcase_43	AC	262 ms 28,488 KB
testcase_44	AC	246 ms 28,616 KB
testcase_45	AC	230 ms 28,616 KB
testcase_46	AC	220 ms 28,748 KB
testcase_47	AC	214 ms 28,620 KB
testcase_48	AC	204 ms 28,652 KB
testcase_49	AC	197 ms 28,872 KB

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

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

template<typename T>
struct BIT {
private:
    vector<T> node; int n;
public:
    BIT(int n_) {
        n = n_; node.resize(n, 0);
    }
    //0-indexed
    void add(int a, T w) {
        for (int i = a; i < n; i |= i + 1)node[i] += w;
    }
    //[0,a)
    T sum(int a) {
        T ret = 0;
        for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
        return ret;
    }
    //[a,b)
    T sum(int a, int b) {
        return sum(b) - sum(a);
    }
};

struct BITx {
private:
    vector<ll> node; int n;
public:
    BITx(int n_) {
        n = n_; node.resize(n, 0);
    }
    //0-indexed
    void add(int a, ll w) {
        for (int i = a; i < n; i |= i + 1)node[i] ^= w;
    }
    //[0,a)
    ll sum(int a) {
        ll ret = 0;
        for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret ^= node[i];
        return ret;
    }
    //[a,b)
    ll sum(int a, int b) {
        return sum(b) ^ sum(a);
    }
};

const int bl = 300;
struct Data {
    int lx, rx, ly, ry;
};
bool operator<(Data a, Data b) {
    if (a.ly != b.ly)return a.ly < b.ly;
    return a.ry < b.ry;
}
void solve() {
	int n; cin >> n;
	vector<ll> h(n);
    rep(i, n)cin >> h[i];
    vector<vector<Data>> vd(n);
    rep(i, n) {
        int a, b, c, d, e; cin >> a >> b >> c >> d >> e;
        e--;
        vd[e].push_back({ a,c,b,d });
    }
    rep(i, n)sort(all(vd[i]));
    int q; cin >> q;
    vector<int> x(q), y(q);
    rep(i, q)cin >> x[i] >> y[i];
    vector<vector<int>> qs(2 * n);
    rep(i, q) {
        qs[x[i]].push_back(i);
    }
    using ar = array<int, 3>;
    vector<vector<ar>> ads(2 * n);
    vector<ll> ans(q);
    BIT<int> btcnt(2 * n);
    rep(i, n)if (vd[i].size() >= bl) {
        rep(i, 2 * n)ads[i].clear();
        for (Data d : vd[i]) {
            ads[d.lx].push_back({d.ly,d.ry,1});
            ads[d.rx].push_back({ d.ly,d.ry,-1 });
        }
        rep(j, 2 * n) {
            for (auto a : ads[j]) {
                btcnt.add(a[0], a[2]);
                btcnt.add(a[1], -a[2]);
            }
            for (int qid : qs[j]) {
                int c = btcnt.sum(y[qid] + 1);
                if (c>0)ans[qid] ^= h[i];
            }
        }
    }
    vector<vector<P>> segs(n);
    BITx bt(2 * n);
    auto upd = [&](int id, int x) {
        for (auto p : segs[id]) {
            bt.add(p.first, h[id]);
            bt.add(p.second, h[id]);
        }
        segs[id].clear();
        for (auto d : vd[id]) {
            if (d.lx <= x && x < d.rx) {
                if (segs[id].size() && segs[id].back().second >= d.ly) {
                    chmax(segs[id].back().second, d.ry);
                }
                else {
                    segs[id].push_back({ d.ly,d.ry });
                }
            }
        }
        for (auto p : segs[id]) {
            bt.add(p.first, h[id]);
            bt.add(p.second, h[id]);
        }
    };

    vector<vector<int>> upds(2 * n);
    rep(i, n)if (vd[i].size() < bl) {
        for (auto d : vd[i]) {
            upds[d.lx].push_back(i);
            upds[d.rx].push_back(i);
        }
    }
    rep(i, 2 * n) {
        sort(all(upds[i]));
        upds[i].erase(unique(all(upds[i])), upds[i].end());
        for (int id : upds[i]) {
            upd(id,i);
        }
        for (int qid : qs[i]) {
            ll val = bt.sum(y[qid] + 1);
            ans[qid] ^= val;
        }
    }

    rep(i, q)cout << ans[i] << "\n";
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(10);
    //init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード