結果

問題 No.1597 Matrix Sort
ユーザー tanimani364tanimani364
提出日時 2021-07-09 22:43:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 301 ms / 1,500 ms
コード長 4,596 bytes
コンパイル時間 2,194 ms
コンパイル使用メモリ 205,812 KB
実行使用メモリ 4,836 KB
最終ジャッジ日時 2023-09-14 10:20:31
合計ジャッジ時間 8,520 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 257 ms
4,620 KB
testcase_04 AC 280 ms
4,660 KB
testcase_05 AC 297 ms
4,544 KB
testcase_06 AC 286 ms
4,540 KB
testcase_07 AC 301 ms
4,672 KB
testcase_08 AC 231 ms
4,572 KB
testcase_09 AC 242 ms
4,608 KB
testcase_10 AC 170 ms
4,660 KB
testcase_11 AC 128 ms
4,612 KB
testcase_12 AC 123 ms
4,680 KB
testcase_13 AC 219 ms
4,568 KB
testcase_14 AC 251 ms
4,656 KB
testcase_15 AC 97 ms
4,564 KB
testcase_16 AC 149 ms
4,812 KB
testcase_17 AC 169 ms
4,832 KB
testcase_18 AC 271 ms
4,552 KB
testcase_19 AC 205 ms
4,576 KB
testcase_20 AC 162 ms
4,836 KB
testcase_21 AC 156 ms
4,676 KB
testcase_22 AC 161 ms
4,576 KB
testcase_23 AC 152 ms
4,580 KB
testcase_24 AC 26 ms
4,652 KB
testcase_25 AC 23 ms
4,764 KB
testcase_26 AC 2 ms
4,376 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 1 ms
4,380 KB
testcase_29 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a; i > b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

// using lll=boost::multiprecision::cpp_int;
// using
// Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}

ll mypow(ll x, ll n, const ll &p = -1)
{ // x^nをmodで割った余り

  if (p != -1)
  {
    x = (x % p + p) % p;
  }
  ll ret = 1;
  while (n > 0)
  {
    if (n & 1)
    {
      if (p != -1)
        ret = (ret * x) % p;
      else
        ret *= x;
    }
    if (p != -1)
      x = (x * x) % p;
    else
      x *= x;
    n >>= 1;
  }
  return ret;
}

struct myrand{
  random_device seed;
  mt19937 mt;
  myrand():mt(seed()){}
  int operator()(int a,int b){//[a,b)
    uniform_int_distribution<int>dist(a,b-1);
    return dist(mt);
  }
};

//using namespace atcoder;

//------------------------
//------------------------
//------------------------
//------------------------
//------------------------

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			return *this;
		}

		Modint &operator/=(const Modint &p){
			*this *= p.inverse();
			return *this;
		}

		Modint operator-() const { return Modint(-x); }
		Modint operator+(const Modint &p) const{
			return Modint(*this) += p;
		}
		Modint operator-(const Modint &p) const{
			return Modint(*this) -= p;
		}
		Modint operator*(const Modint &p) const{
			return Modint(*this) *= p;
		}
		Modint operator/(const Modint &p) const{
			return Modint(*this) /= p;
		}

		bool operator==(const Modint &p) const { return x == p.x; }
		bool operator!=(const Modint &p) const{return x != p.x;}

		Modint inverse() const{//非再帰拡張ユークリッド
			int a = x, b = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;
using modint2= Modint<mod_998244353>;

template<typename T>
struct Combination{
  //Modint用
  //構築O(N),クエリO(1)
	vector<T>fact,rfact;

	Combination(int64_t n):fact(n+1),rfact(n+1){
		fact[0]=1;fact[1]=1;
		rfact[n]=1;
		for(int64_t i=2;i<=n;++i){
			fact[i]=fact[i-1]*i;
		}
		rfact[n]/=fact[n];
		for(int64_t i=n-1;i>=0;--i){
			rfact[i]=rfact[i+1]*(i+1);
		}
	}

	T C(int64_t n,int64_t r) const{
		if(n==-1&&r==0)return 1;//0H0のとき
		if(r<0 || n<r)return 0;
		return fact[n]*rfact[n-r]*rfact[r];
	}
};


void solve()
{
  ll n,k,p;
  cin>>n>>k>>p;
  vector<ll>a(n),b(n);
  rep(i,n)cin>>a[i];
  rep(i,n)cin>>b[i];
  sort(all(a));
  sort(all(b));
  ll l=0,r=p;
  while(r-l>1){
    ll mid=(l+r)/2;
    ll num=0;
    rep(i,n){
      auto itr=lower_bound(all(b),mid-a[i]);
      num+=itr-b.begin();
    }
    
    rep(i,n){
      num+=lower_bound(all(b),mid-a[i]+p)-lower_bound(all(b),p-a[i]);
    }
    //cout<<mid<<" "<<num<<"\n";
    if(num<k)l=mid;
    else r=mid;
  }
  cout<<l<<"\n";
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
0