結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー kaikeykaikey
提出日時 2021-01-23 02:30:51
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,636 ms / 2,000 ms
コード長 4,614 bytes
コンパイル時間 2,388 ms
コンパイル使用メモリ 212,852 KB
実行使用メモリ 14,760 KB
最終ジャッジ日時 2023-08-28 12:49:32
合計ジャッジ時間 38,452 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 4 ms
4,376 KB
testcase_09 AC 3 ms
4,380 KB
testcase_10 AC 5 ms
4,376 KB
testcase_11 AC 4 ms
4,376 KB
testcase_12 AC 2 ms
4,380 KB
testcase_13 AC 5 ms
4,376 KB
testcase_14 AC 2 ms
4,376 KB
testcase_15 AC 6 ms
4,380 KB
testcase_16 AC 3 ms
4,376 KB
testcase_17 AC 5 ms
4,376 KB
testcase_18 AC 68 ms
4,376 KB
testcase_19 AC 26 ms
4,376 KB
testcase_20 AC 76 ms
4,380 KB
testcase_21 AC 17 ms
4,376 KB
testcase_22 AC 34 ms
4,380 KB
testcase_23 AC 50 ms
4,376 KB
testcase_24 AC 43 ms
4,376 KB
testcase_25 AC 49 ms
4,376 KB
testcase_26 AC 61 ms
4,380 KB
testcase_27 AC 40 ms
4,376 KB
testcase_28 AC 488 ms
7,336 KB
testcase_29 AC 446 ms
6,024 KB
testcase_30 AC 420 ms
5,476 KB
testcase_31 AC 515 ms
7,596 KB
testcase_32 AC 362 ms
9,084 KB
testcase_33 AC 370 ms
5,444 KB
testcase_34 AC 526 ms
8,004 KB
testcase_35 AC 725 ms
7,876 KB
testcase_36 AC 980 ms
11,172 KB
testcase_37 AC 183 ms
5,508 KB
testcase_38 AC 570 ms
6,124 KB
testcase_39 AC 330 ms
5,360 KB
testcase_40 AC 399 ms
5,924 KB
testcase_41 AC 544 ms
7,284 KB
testcase_42 AC 1,034 ms
9,032 KB
testcase_43 AC 556 ms
7,468 KB
testcase_44 AC 752 ms
7,736 KB
testcase_45 AC 637 ms
6,404 KB
testcase_46 AC 471 ms
8,444 KB
testcase_47 AC 303 ms
5,652 KB
testcase_48 AC 1,063 ms
13,684 KB
testcase_49 AC 895 ms
12,556 KB
testcase_50 AC 1,132 ms
13,360 KB
testcase_51 AC 1,037 ms
13,948 KB
testcase_52 AC 838 ms
12,836 KB
testcase_53 AC 1,519 ms
14,368 KB
testcase_54 AC 1,489 ms
12,224 KB
testcase_55 AC 1,636 ms
13,640 KB
testcase_56 AC 1,494 ms
12,600 KB
testcase_57 AC 997 ms
13,104 KB
testcase_58 AC 767 ms
12,432 KB
testcase_59 AC 766 ms
12,412 KB
testcase_60 AC 702 ms
12,236 KB
testcase_61 AC 702 ms
12,484 KB
testcase_62 AC 701 ms
12,156 KB
testcase_63 AC 43 ms
12,060 KB
testcase_64 AC 44 ms
14,760 KB
testcase_65 AC 43 ms
12,664 KB
testcase_66 AC 44 ms
13,488 KB
testcase_67 AC 43 ms
12,340 KB
testcase_68 AC 2 ms
4,380 KB
testcase_69 AC 2 ms
4,376 KB
testcase_70 AC 2 ms
4,380 KB
testcase_71 AC 2 ms
4,380 KB
testcase_72 AC 2 ms
4,376 KB
testcase_73 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
#define fi first
#define se second
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
	for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
	return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
	for (T& in : v) is >> in;
	return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint ceil(lint a, lint b) { return (a + b - 1) / b; }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.fi - b.fi) * abs(a.fi - b.fi) + abs(a.se - b.se) * abs(a.se - b.se); }
lint m_dist(plint a, plint b) { return abs(a.fi - b.fi) + abs(a.se - b.se); }
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD = 1e9 + 7, INF = 1e18 + 1;
lint dx[8] = { 1, 0, -1, 0, 1, -1, 1, -1 }, dy[8] = { 0, 1, 0, -1, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
	lint from, to;
	lint cost;
	Edge(lint u, lint v, lint c) {
		cost = c;
		from = u;
		to = v;
	}
	bool operator<(const Edge& e) const {
		return cost < e.cost;
	}
};
struct WeightedEdge {
	lint to;
	lint cost;
	WeightedEdge(lint v, lint c = 1) {
		to = v;
		cost = c;
	}
	bool operator<(const WeightedEdge& e) const {
		return cost < e.cost;
	}
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<lint, plint> tlint;
typedef pair<plint, plint> qlint;
typedef pair<string, lint> valstring;

lint N[4], S;
int main() {
	REP(i, 4) cin >> N[i];
	cin >> S;
	VVl arr(4);
	REP(i, 4) {
		Vl _arr(N[i]);
		REP(j, N[i]) cin >> _arr[j];
		sort(ALL(_arr));
		arr[i] = _arr;
	}
	Vl fir, sec;
	REP(i, N[0]) {
		REP(j, N[1]) {
			fir.push_back(arr[0][i] * arr[1][j]);
		}
	}
	REP(i, N[2]) {
		REP(j, N[3]) {
			sec.push_back(arr[2][i] * arr[3][j]);
		}
	}
	sort(ALL(fir));
	sort(ALL(sec));
	Vl revsec = sec;
	reverse(ALL(revsec));
	REP(i, SZ(revsec)) revsec[i] *= -1;
	auto check = [&](lint v) {
		lint sum = 0;
		REP(i, N[0] * N[1]) {
			if (fir[i] == 0) {
				if (v >= 0) sum += SZ(sec);
			}
			else if (fir[i] > 0) {
				lint num = v / fir[i];
				if ((v % (fir[i])) != 0 && v < 0) {
					num--;
				}
				sum += upper_bound(ALL(sec), num) - sec.begin();
			}
			else {
				lint num = -v / fir[i];
				if ((-v % (fir[i])) != 0 && v < 0) {
					num--;
				}
				sum += upper_bound(ALL(revsec), num) - revsec.begin();
			}
		}
		return sum < S;
	};

	lint ng = -INF, ok = INF;
	while (ok - ng > 1) {
		lint mid = (ok + ng) / 2;
		if (!check(mid)) ok = mid;
		else ng = mid;
	}
	cout << ok << endk;
	if (ok == 0) {
		REP(i, 4) {
			if (binary_search(ALL(arr[i]), 0)) cout << 0;
			else cout << arr[i][0];
			if(i != 3) cout << " ";
		}
		cout << endk;
	}
	else {
		REP(i, SZ(fir)) {
			if (fir[i] == 0) continue;
			if (ok % fir[i] != 0) continue;
			if (!binary_search(ALL(sec), ok / fir[i])) continue;
			lint f = fir[i], s = ok / fir[i];
			REP(j, N[0]) {
				if (arr[0][j] == 0) continue;
				if (f % arr[0][j] != 0) continue;
				if (binary_search(ALL(arr[1]), f / arr[0][j])) {
					cout << arr[0][j] << " " << f / arr[0][j] << " ";
					break;
				}
			}
			REP(j, N[2]) {
				if (arr[2][j] == 0) continue;
				if (s % arr[2][j] != 0) continue;
				if (binary_search(ALL(arr[3]), s / arr[2][j])) {
					cout << arr[2][j] << " " << s / arr[2][j] << endk;
					break;
				}
			}
			return 0;
		}
	}
}
0