結果

問題 No.1788 Same Set
ユーザー 👑 hitonanodehitonanode
提出日時 2021-12-17 01:09:03
言語 C++23(draft)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 659 ms / 4,000 ms
コード長 7,435 bytes
コンパイル時間 2,608 ms
コンパイル使用メモリ 190,032 KB
実行使用メモリ 58,152 KB
最終ジャッジ日時 2023-10-12 01:23:27
合計ジャッジ時間 18,377 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
21,848 KB
testcase_01 AC 13 ms
21,804 KB
testcase_02 AC 14 ms
21,844 KB
testcase_03 AC 13 ms
21,784 KB
testcase_04 AC 14 ms
21,772 KB
testcase_05 AC 14 ms
21,772 KB
testcase_06 AC 13 ms
21,844 KB
testcase_07 AC 14 ms
21,800 KB
testcase_08 AC 14 ms
21,756 KB
testcase_09 AC 15 ms
21,824 KB
testcase_10 AC 14 ms
21,784 KB
testcase_11 AC 89 ms
36,456 KB
testcase_12 AC 237 ms
45,280 KB
testcase_13 AC 299 ms
47,312 KB
testcase_14 AC 420 ms
49,424 KB
testcase_15 AC 515 ms
49,672 KB
testcase_16 AC 539 ms
49,896 KB
testcase_17 AC 603 ms
57,928 KB
testcase_18 AC 595 ms
55,732 KB
testcase_19 AC 547 ms
58,152 KB
testcase_20 AC 109 ms
36,680 KB
testcase_21 AC 536 ms
49,580 KB
testcase_22 AC 566 ms
49,936 KB
testcase_23 AC 405 ms
46,652 KB
testcase_24 AC 450 ms
47,316 KB
testcase_25 AC 607 ms
51,216 KB
testcase_26 AC 611 ms
50,916 KB
testcase_27 AC 140 ms
39,004 KB
testcase_28 AC 633 ms
53,028 KB
testcase_29 AC 641 ms
52,428 KB
testcase_30 AC 145 ms
39,068 KB
testcase_31 AC 632 ms
52,572 KB
testcase_32 AC 634 ms
56,108 KB
testcase_33 AC 632 ms
56,100 KB
testcase_34 AC 659 ms
56,112 KB
testcase_35 AC 645 ms
56,680 KB
testcase_36 AC 650 ms
56,620 KB
testcase_37 AC 634 ms
56,576 KB
testcase_38 AC 640 ms
56,472 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif

#include <atcoder/lazysegtree>
using S = pint;  // min, num of min
S op(S l, S r) {
    if (l.first < r.first) return l;
    if (l.first > r.first) return r;
    return {l.first, l.second + r.second};
}
S e() { return {1 << 20, 0}; }
using F = int;
S mapping(F f, S x) { return {x.first + f, x.second}; }
F composition(F f, F g) { return f + g; }
F id() { return 0; }
using Tree = atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>;

int main() {
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    cin >> A >> B;
    vector<vector<int>> a2i(400001), b2i = a2i;
    vector<vector<tuple<int, int, int>>> updates(N + 1);
    REP(i, N) {
        a2i[A[i]].push_back(i);
        b2i[B[i]].push_back(i);
    }
    REP(a, a2i.size()) {
        auto xa = a2i[a], xb = b2i[a];
        int ia = 0, ib = 0, l = 0;
        if (xa.empty() and xb.empty()) continue;
        while (ia < int(xa.size()) or ib < int(xb.size())) {
            dbg(pint(ia, ib));
            if (ia == xa.size()) {
                updates[l].emplace_back(xb[ib], N, 1);
                updates[xb[ib] + 1].emplace_back(xb[ib], N, -1);
                ib++;
            } else if (ib == xb.size()) {
                updates[l].emplace_back(xa[ia], N, 1);
                updates[xa[ia] + 1].emplace_back(xa[ia], N, -1);
                ia++;
            } else if (xa[ia] == xb[ib]) {
                l = xa[ia] + 1;
                ia++;
                ib++;
            } else if (xa[ia] < xb[ib]) {
                updates[l].emplace_back(xa[ia], xb[ib], 1);
                updates[xa[ia] + 1].emplace_back(xa[ia], xb[ib], -1);
                l = xa[ia] + 1;
                ia++;
            } else {
                updates[l].emplace_back(xb[ib], xa[ia], 1);
                updates[xb[ib] + 1].emplace_back(xb[ib], xa[ia], -1);
                l = xb[ib] + 1;
                ib++;
            }
        }
        dbg(updates);
    }
    dbg(updates);
    lint ret = 0;
    Tree tree(vector<S>(N, pint(0, 1)));
    REP(i, N) {
        for (auto [l, r, v] : updates[i]) {
            tree.apply(l, r, v);
        }
        auto pr = tree.prod(i, N);
        dbg(pr);
        if (pr.first == 0) ret += pr.second;
    }
    cout << ret << '\n';
}
0