結果
問題 | No.2182 KODOKU Stone |
ユーザー |
|
提出日時 | 2023-01-08 16:10:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 65 ms / 2,000 ms |
コード長 | 4,406 bytes |
コンパイル時間 | 2,203 ms |
コンパイル使用メモリ | 199,488 KB |
最終ジャッジ日時 | 2025-02-10 01:10:09 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;const int inf = (1 << 30) - 1;const ll INF = (1LL << 60) - 1;// const int MOD = 1000000007;const int MOD = 998244353;int main() {int N;cin >> N;vector<int> a(N);rep(i, N) cin >> a[i];vector<vector<int>> c(N);rep(i, N) {int K;cin >> K;c[i].resize(K);rep(j, K) cin >> c[i][j];}int MAX = 300000;vector<int> cnt2(MAX + 1, 0);int l = 0, r = inf; // [l,r)while (r - l > 1) {fill(all(cnt2), 0);int m = (l + r) / 2;int cnt1 = 0, ma1 = -inf;int ma2 = -inf;rep(i, N) {int K = sz(c[i]);int C = 0;each(e, c[i]) {if (e >= m) C++;}if (C == K) {cnt1++;chmax(ma1, C);} else {cnt2[C]++;chmax(ma2, C);}}bool flag = false;int ma3 = ma2;per(i, N) {if (ma1 >= a[i]) {flag = true;} else if (ma3 >= a[i]) {flag = true;} else if (ma2 >= a[i] && cnt1 > 0) {flag = true;} else if (i == 0 && cnt1 > 0) {flag = true;}if (cnt2[a[i] - 1] > 0) {cnt2[a[i] - 1]--;while (ma3 >= 0 && cnt2[ma3] == 0) ma3--;} else {if (cnt1 == 0) break;cnt1--;if (cnt1 == 0) ma1 = -inf;}}(flag ? l : r) = m;}cout << l << '\n';}