#829577 (C++17) No.2182 KODOKU Stone

• 問題: No.2182 KODOKU Stone
• ユーザー: MasKoaTS
• 提出日時: 2022-12-31 18:52:48
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 157 ms / 2,000 ms
• コード長: 3,615 bytes
• コンパイル時間: 4,157 ms
• コンパイル使用メモリ: 267,908 KB
• 実行使用メモリ: 10,820 KB
• 最終ジャッジ日時: 2024-11-26 17:21:27
• 合計ジャッジ時間: 8,208 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	121 ms; 10,028 KB
testcase_12	AC	147 ms; 10,664 KB
testcase_13	AC	34 ms; 5,248 KB
testcase_14	AC	31 ms; 5,248 KB
testcase_15	AC	157 ms; 10,820 KB
testcase_16	AC	130 ms; 10,292 KB
testcase_17	AC	43 ms; 5,248 KB
testcase_18	AC	105 ms; 8,884 KB
testcase_19	AC	69 ms; 5,844 KB
testcase_20	AC	94 ms; 7,924 KB
testcase_21	AC	38 ms; 5,248 KB
testcase_22	AC	35 ms; 5,248 KB
testcase_23	AC	60 ms; 5,248 KB
testcase_24	AC	44 ms; 5,248 KB
testcase_25	AC	27 ms; 5,248 KB
testcase_26	AC	26 ms; 5,248 KB
testcase_27	AC	26 ms; 5,248 KB
testcase_28	AC	84 ms; 7,272 KB
testcase_29	AC	109 ms; 8,444 KB
testcase_30	AC	118 ms; 9,036 KB
testcase_31	AC	84 ms; 7,080 KB
testcase_32	AC	85 ms; 7,044 KB
testcase_33	AC	100 ms; 8,184 KB
testcase_34	AC	47 ms; 5,248 KB
testcase_35	AC	104 ms; 8,176 KB
testcase_36	AC	23 ms; 5,248 KB
testcase_37	AC	117 ms; 9,000 KB
testcase_38	AC	2 ms; 5,248 KB
testcase_39	AC	2 ms; 5,248 KB

ソースコード

#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
#pragma warning(disable: 4996)
using namespace std;
using namespace atcoder;
#define print(n) cout << (n) << endl
#define fprint(n) cout << setprecision(16) << (n) << endl
#define ceil_div(a, b) (((a) - 1) / (b) + 1)
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define itrep(itr, st) for (auto itr = st.begin(); itr != st.end(); itr++)
#define ite(i, a) for (auto& i : a)
#define last(v) v[v.size() - 1]
#define all(x) x.begin(), x.end()
#define lb(A, x) (lower_bound(all(A), x) - A.begin())
#define ub(A, x) (upper_bound(all(A), x) - A.begin())
#define INF 4611686018427387903ll
#define inf 2147483647
#define mod 1000000007ll
#define MOD 998244353ll
using str = string;
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using Pair = pair<int, int>;
using mint = modint1000000007;
using Mint = modint998244353;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
template <class T>	using PQ = priority_queue<T, V<T>, greater<T> >;
template <class T>	using PQR = priority_queue<T>;
template <class T>	using BIT = fenwick_tree<T>;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
template <class T> inline void prints(V<T>& vec) { if (vec.size() == 0)return; cout << vec[0];	rep(i, 1, vec.size()) { cout << ' ' << vec[i]; } cout << '\n'; }
template<class T> inline vector<tuple<size_t, T> > enumerate(const vector<T>& values) { auto length = values.size(); auto values_with_indices = vector<tuple<size_t, T>>(length); for (size_t i = 0; i < length; ++i) { values_with_indices[i] = make_tuple(i, values[i]); } return values_with_indices; }
inline V<int> dtois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - '0'); } return vec; }
inline V<int> atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'a'); } return vec; }
inline V<int> Atois(string& s) { V<int> vec = {}; ite(e, s) { vec.push_back(e - 'A'); } return vec; }

int N;
V<int> K;
V<V<int> > T;

bool check(int mid) {
	V<int> P = {}, Q = {};
	rep(i, 0, N) {
		int x = lb(T[i], mid);
		if (x == 0) {
			Q.push_back(T[i].size());
		}
		else {
			P.push_back(T[i].size() - x);
		}
	}
	sort(all(P));	sort(all(Q));
	if (P.empty()) {
		return true;
	}

	int q_max = -inf;
	if (Q.empty() == false) {
		q_max = last(Q);
	}
	PQ<int> que = {};
	for (int i = N - 1; i >= N - Q.size(); --i) {
		// cout << P.size() << ' ' << Q.size() << ' ' << i << endl;
		if (K[i] > q_max) {
			que.push(K[i]);
			continue;
		}
		return true;
	}
	for (int i = N - Q.size() - 1; i >= 0; --i) {
		// cout << P.size() << ' ' << Q.size() << ' ' << i << endl;
		int k = K[i];
		if (que.empty() == false && k > que.top()) {
			k = que.top();
		}
		if (P[i] >= k) {
			return true;
		}
		else if (P[i] < k - 1) {
			return false;
		}
		else if (q_max >= K[i] && que.empty() == false && P[i] == que.top() - 1) {
			return true;
		}
		else if (i == 0) {
			return false;
		}
		else if (que.empty() || P[i] == K[i] - 1) {
			continue;
		}
		que.pop();	que.push(K[i]);
	}
	return true;
}


int main(void) {
	cin >> N;
	K = getList<int>(N);
	T = V<V<int> >(N, V<int>({}));
	rep(i, 0, N) {
		int x;	cin >> x;
		T[i] = V<int>(x);
		T[i] = getList<int>(x);
		sort(all(T[i]));
	}

	int ok = 0;
	int ng = inf;
	while (ng - ok > 1) {
		int mid = (ok + ng) >> 1;
		if (check(mid)) {
			ok = mid;
		}
		else {
			ng = mid;
		}
	}
	print(ok);

	return 0;
}