結果

問題 No.2182 KODOKU Stone
ユーザー hitonanodehitonanode
提出日時 2023-01-06 23:34:43
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,964 bytes
コンパイル時間 2,605 ms
コンパイル使用メモリ 192,376 KB
実行使用メモリ 10,968 KB
最終ジャッジ日時 2024-05-07 23:33:05
合計ジャッジ時間 5,686 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 84 ms
10,836 KB
testcase_12 AC 139 ms
10,968 KB
testcase_13 AC 21 ms
6,944 KB
testcase_14 AC 22 ms
6,940 KB
testcase_15 AC 144 ms
10,964 KB
testcase_16 AC 92 ms
10,832 KB
testcase_17 AC 20 ms
6,944 KB
testcase_18 AC 75 ms
9,420 KB
testcase_19 AC 47 ms
6,944 KB
testcase_20 AC 61 ms
8,468 KB
testcase_21 AC 25 ms
6,944 KB
testcase_22 AC 22 ms
6,940 KB
testcase_23 WA -
testcase_24 AC 32 ms
6,940 KB
testcase_25 AC 18 ms
6,944 KB
testcase_26 AC 18 ms
6,944 KB
testcase_27 AC 18 ms
6,944 KB
testcase_28 AC 54 ms
7,844 KB
testcase_29 AC 76 ms
8,952 KB
testcase_30 AC 83 ms
9,692 KB
testcase_31 AC 57 ms
7,616 KB
testcase_32 AC 53 ms
7,380 KB
testcase_33 AC 70 ms
8,404 KB
testcase_34 AC 29 ms
6,940 KB
testcase_35 AC 72 ms
8,568 KB
testcase_36 AC 15 ms
6,940 KB
testcase_37 AC 83 ms
9,788 KB
testcase_38 WA -
testcase_39 AC 2 ms
6,944 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; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class 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 <class 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 <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::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) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

#include <atcoder/segtree>

int op(int l, int r) { return l + r; }
int e() { return 0; }

int main() {
    int N;
    cin >> N;
    vector<int> K(N);
    cin >> K;
    vector<vector<int>> A(N);

    vector<int> z;
    for (auto &a : A) {
        int t;
        cin >> t;
        a.resize(t);
        cin >> a;
        sort(ALL(a));
        z.insert(z.end(), ALL(a));
    }
    z = sort_unique(z);
    dbg(A);
    dbg(K);
    dbg(z);

    int ok = 0, ng = z.size();
    while (ng - ok > 1) {
        const int c = (ok + ng) / 2;
        const int tgt = z.at(c);

        vector<int> sups;

        vector<int> alls;
        for (const auto &v : A) {
            int supply = v.size() - arglb(v, tgt);
            sups.push_back(supply);
            if (supply == int(v.size())) alls.push_back(supply);
        }
        dbg(make_tuple(tgt, sups));

        sort(ALL(alls));
        reverse(ALL(alls));

        const auto supv = sort_unique(sups);

        vector<int> init(supv.size());
        for (int s : sups) init.at(arglb(supv, s))++;

        atcoder::segtree<int, op, e> tree(init);

        bool feasible = false;

        // if (alls.size() == N) feasible = true;
        IREP(i, N) {
            if (i == 0 and alls.size()) feasible = true;
            int l = arglb(supv, K.at(i));
            if (tree.prod(l, supv.size())) {
                feasible = true;
                break;
            }
            l = arglb(supv, K.at(i) - 1);
            if (tree.prod(l, supv.size()) == 0) {
                if (alls.empty()) break;
                int u = alls.back();
                alls.pop_back();

                int l2 = tree.max_right(arglb(supv, u), [&](int x) { return x == 0; });
                if (l2 == int(supv.size())) break;
                tree.set(l2, tree.get(l2) - 1);

            } else {

                int l2 = tree.max_right(l, [&](int x) { return x == 0; });
                // assert(l == l2);
                tree.set(l2, tree.get(l2) - 1);
            }
        }
        (feasible ? ok : ng) = c;
    }
    cout << z.at(ok) << endl;
}
0