結果

問題 No.1460 Max of Min
ユーザー leaf_1415leaf_1415
提出日時 2021-03-31 22:57:31
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 5,173 bytes
コンパイル時間 924 ms
コンパイル使用メモリ 90,268 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-05-09 09:48:26
合計ジャッジ時間 64,718 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 140 ms
5,248 KB
testcase_01 AC 78 ms
5,376 KB
testcase_02 AC 194 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 79 ms
5,376 KB
testcase_06 AC 731 ms
5,376 KB
testcase_07 AC 726 ms
5,376 KB
testcase_08 AC 76 ms
5,376 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 789 ms
5,376 KB
testcase_12 AC 661 ms
5,376 KB
testcase_13 AC 747 ms
5,376 KB
testcase_14 AC 674 ms
5,376 KB
testcase_15 AC 661 ms
5,376 KB
testcase_16 AC 743 ms
5,376 KB
testcase_17 AC 734 ms
5,376 KB
testcase_18 WA -
testcase_19 AC 680 ms
5,376 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 689 ms
5,376 KB
testcase_23 AC 491 ms
5,376 KB
testcase_24 WA -
testcase_25 AC 547 ms
5,376 KB
testcase_26 AC 708 ms
5,376 KB
testcase_27 AC 651 ms
5,376 KB
testcase_28 AC 590 ms
5,376 KB
testcase_29 AC 722 ms
5,376 KB
testcase_30 AC 743 ms
5,376 KB
testcase_31 AC 770 ms
5,376 KB
testcase_32 AC 668 ms
5,376 KB
testcase_33 AC 650 ms
5,376 KB
testcase_34 AC 685 ms
5,376 KB
testcase_35 AC 711 ms
5,376 KB
testcase_36 AC 582 ms
5,376 KB
testcase_37 AC 754 ms
5,376 KB
testcase_38 AC 721 ms
5,376 KB
testcase_39 AC 740 ms
5,376 KB
testcase_40 AC 674 ms
5,376 KB
testcase_41 AC 694 ms
5,376 KB
testcase_42 AC 613 ms
5,376 KB
testcase_43 AC 741 ms
5,376 KB
testcase_44 AC 677 ms
5,376 KB
testcase_45 AC 549 ms
5,376 KB
testcase_46 AC 689 ms
5,376 KB
testcase_47 AC 749 ms
5,376 KB
testcase_48 AC 778 ms
5,376 KB
testcase_49 AC 761 ms
5,376 KB
testcase_50 AC 593 ms
5,376 KB
testcase_51 AC 664 ms
5,376 KB
testcase_52 AC 606 ms
5,376 KB
testcase_53 AC 725 ms
5,376 KB
testcase_54 AC 724 ms
5,376 KB
testcase_55 AC 711 ms
5,376 KB
testcase_56 AC 694 ms
5,376 KB
testcase_57 AC 750 ms
5,376 KB
testcase_58 WA -
testcase_59 AC 739 ms
5,376 KB
testcase_60 AC 740 ms
5,376 KB
testcase_61 AC 702 ms
5,376 KB
testcase_62 AC 712 ms
5,376 KB
testcase_63 AC 718 ms
5,376 KB
testcase_64 AC 727 ms
5,376 KB
testcase_65 AC 735 ms
5,376 KB
testcase_66 AC 701 ms
5,376 KB
testcase_67 AC 700 ms
5,376 KB
testcase_68 AC 719 ms
5,376 KB
testcase_69 AC 724 ms
5,376 KB
testcase_70 AC 702 ms
5,376 KB
testcase_71 AC 733 ms
5,376 KB
testcase_72 AC 721 ms
5,376 KB
testcase_73 AC 721 ms
5,376 KB
testcase_74 AC 741 ms
5,376 KB
testcase_75 AC 714 ms
5,376 KB
testcase_76 AC 713 ms
5,376 KB
testcase_77 AC 730 ms
5,376 KB
testcase_78 AC 710 ms
5,376 KB
testcase_79 AC 725 ms
5,376 KB
testcase_80 AC 727 ms
5,376 KB
testcase_81 AC 733 ms
5,376 KB
testcase_82 AC 752 ms
5,376 KB
testcase_83 AC 715 ms
5,376 KB
testcase_84 WA -
testcase_85 WA -
testcase_86 WA -
testcase_87 WA -
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
testcase_92 WA -
testcase_93 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) {
		os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) {
		os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	}
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++;
		if(itr != map_var.end()) os << ",";
		itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr;
		++itr;
		if(itr != set_var.end()) os << " ";
		itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

ll k, n;
ll a[1005], b[1005];
vector<ll> vec;

bitset<2400005> bs;
bitset<1005> Abs, Bbs;

bool check(ll x)
{
	rep(i, 0, k-1) bs[i] = Abs[i] = (a[i] >= vec[x]), Bbs[i] = (b[i] >= vec[x]);
	rep(i, k, 2400000){
		bs[i] = (Abs & Bbs).any();
		Abs >>= 1, Abs[k-1] = bs[i];
	}
	ll p = 0;
	rep(j, 0, k-1){
		if(Bbs[j]){
			p = k-j;
			break;
		}
	}
	if(p == 0) return false;
	//cout << vec[x] << endl;
	//rep(j, 0, 50) cout << bs[j] << " "; cout << endl;
	return bs[min(n, 2*k*k + p - 2*k*k%p)];
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> k >> n;
	rep(i, 0, k-1) cin >> a[i], vec.push_back(a[i]);
	rep(i, 0, k-1) cin >> b[i], vec.push_back(b[i]);
	
	sort(all(vec));
	vec.erase(unique(all(vec)), vec.end());
	
	ll ub = sz(vec), lb = 0, mid;
	while(ub-lb>1){
		mid = (ub+lb)/2;
		if(check(mid)) lb = mid;
		else ub = mid;
	}
	outl(vec[lb]);
	
	return 0;
}
0