#953700 (C++17) No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩

提出ソース

結果

問題	No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー	ゆにぽけ
提出日時	2024-02-23 07:01:07
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	4,677 bytes
コンパイル時間	1,702 ms
コンパイル使用メモリ	146,472 KB
実行使用メモリ	28,532 KB
最終ジャッジ日時	2024-09-29 04:51:01
合計ジャッジ時間	32,724 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	1 ms 6,820 KB
testcase_02	AC	1 ms 6,816 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	1 ms 6,820 KB
testcase_05	AC	2 ms 6,820 KB
testcase_06	AC	2 ms 6,820 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	3 ms 6,816 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	5 ms 6,820 KB
testcase_11	AC	4 ms 6,820 KB
testcase_12	AC	2 ms 6,816 KB
testcase_13	AC	5 ms 6,816 KB
testcase_14	AC	2 ms 6,820 KB
testcase_15	AC	7 ms 6,816 KB
testcase_16	AC	3 ms 6,820 KB
testcase_17	AC	5 ms 6,820 KB
testcase_18	AC	61 ms 6,816 KB
testcase_19	AC	23 ms 6,820 KB
testcase_20	AC	65 ms 6,816 KB
testcase_21	AC	19 ms 6,816 KB
testcase_22	AC	32 ms 6,820 KB
testcase_23	AC	49 ms 6,820 KB
testcase_24	AC	44 ms 6,820 KB
testcase_25	AC	44 ms 6,816 KB
testcase_26	AC	56 ms 6,820 KB
testcase_27	AC	36 ms 6,820 KB
testcase_28	RE	-
testcase_29	AC	385 ms 11,452 KB
testcase_30	AC	359 ms 9,272 KB
testcase_31	AC	500 ms 12,592 KB
testcase_32	AC	446 ms 25,032 KB
testcase_33	AC	321 ms 9,764 KB
testcase_34	AC	504 ms 19,172 KB
testcase_35	AC	618 ms 13,320 KB
testcase_36	AC	884 ms 24,300 KB
testcase_37	AC	187 ms 11,704 KB
testcase_38	AC	474 ms 10,092 KB
testcase_39	AC	282 ms 8,424 KB
testcase_40	AC	348 ms 11,328 KB
testcase_41	AC	493 ms 16,740 KB
testcase_42	AC	890 ms 16,112 KB
testcase_43	AC	485 ms 14,212 KB
testcase_44	AC	667 ms 13,664 KB
testcase_45	AC	536 ms 11,248 KB
testcase_46	AC	495 ms 20,164 KB
testcase_47	AC	271 ms 11,648 KB
testcase_48	AC	1,054 ms 28,532 KB
testcase_49	AC	891 ms 28,524 KB
testcase_50	AC	1,078 ms 28,528 KB
testcase_51	AC	998 ms 28,524 KB
testcase_52	AC	987 ms 28,528 KB
testcase_53	AC	1,257 ms 28,396 KB
testcase_54	AC	1,244 ms 28,396 KB
testcase_55	AC	1,383 ms 28,396 KB
testcase_56	AC	1,269 ms 28,396 KB
testcase_57	AC	972 ms 28,400 KB
testcase_58	AC	645 ms 7,792 KB
testcase_59	AC	641 ms 7,788 KB
testcase_60	AC	693 ms 7,792 KB
testcase_61	AC	676 ms 7,792 KB
testcase_62	AC	692 ms 7,664 KB
testcase_63	RE	-
testcase_64	RE	-
testcase_65	RE	-
testcase_66	RE	-
testcase_67	RE	-
testcase_68	RE	-
testcase_69	RE	-
testcase_70	AC	2 ms 6,820 KB
testcase_71	AC	2 ms 6,820 KB
testcase_72	AC	1 ms 6,820 KB
testcase_73	RE	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	static constexpr int get_mod() noexcept {return m;}
	static constexpr int primitive_root() noexcept
	{
		assert(m == 998244353);
		return 3;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
/* using mint = modint<998244353>; */
using mint = modint<1000000007>;
void Main()
{
	int K,L,M,N;
	long long S;
	cin >> K >> L >> M >> N >> S;
	vector<int> A(K),B(L),C(M),D(N);
	for(int i = 0;i < K;i++)
	{
		cin >> A[i];
	}
	for(int i = 0;i < L;i++)
	{
		cin >> B[i];
	}
	for(int i = 0;i < M;i++)
	{
		cin >> C[i];
	}
	for(int i = 0;i < N;i++)
	{
		cin >> D[i];
	}
	vector<int> P,Q;
	for(int i = 0;i < K;i++)
	{
		for(int j = 0;j < L;j++)
		{
			int prod = A[i] * B[j];
			P.push_back(prod);
		}
	}
	for(int i = 0;i < M;i++)
	{
		for(int j = 0;j < N;j++)
		{
			int prod = C[i] * D[j];
			Q.push_back(prod);
		}
	}
	sort(P.begin(),P.end());
	sort(Q.begin(),Q.end());
	long long ng = -(long long)1e18,ok = (long long)1e18;
	while(ok - ng > 1)
	{
		long long mid = (ok + ng) / 2;
		long long cnt = 0;
		for(int i = 0;i < (int)P.size();i++)
		{
			int x = P[i];
			if(x < 0)
			{
				//Q * x <= mid
				//Q * (-y) <= mid
				//Q >= - mid / y;
				int y = -x;
				long long cil = mid < 0 ? (-mid + y - 1) / y : -(mid / y);
				auto it = lower_bound(Q.begin(),Q.end(),cil);
				cnt += Q.end() - it;
			}
			else if(x == 0)
			{
				if(mid >= 0)
				{
					cnt += (int)Q.size();
				}
			}
			else
			{
				long long flr = mid >= 0 ? mid / x : -((-mid + x - 1) / x);
				auto it = upper_bound(Q.begin(),Q.end(),flr);
				cnt += it - Q.begin();
			}
		}
		if(cnt >= S)
		{
			ok = mid;
		}
		else
		{
			ng = mid;
		}
	}
	long long ans = ok;
	cout << ans << "\n";
	map<long long,pair<int,int>> mp;
	for(int i = 0;i < M;i++)
	{
		for(int j = 0;j < N;j++)
		{
			mp[C[i] * D[j]] = make_pair(C[i],D[j]);
		}
	}
	for(int i = 0;i < K;i++)
	{
		for(int j = 0;j < L;j++)
		{
			int prod = A[i] * B[j];
			if(ans % prod)
			{
				continue;
			}
			long long q = ans / prod;
			if(mp.find(q) != mp.end())
			{
				cout << A[i] << " " << B[j] << " " << mp[q].first << " " << mp[q].second << "\n";
				return;
			}
		}
	}
	assert(0);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}

yukicoder

結果

テストケース

ソースコード