結果

問題 No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩
ユーザー りあんりあん
提出日時 2021-01-22 22:03:11
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,176 ms / 2,000 ms
コード長 11,501 bytes
コンパイル時間 4,288 ms
コンパイル使用メモリ 116,224 KB
実行使用メモリ 85,920 KB
最終ジャッジ日時 2024-12-28 00:55:06
合計ジャッジ時間 38,522 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 74
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
class Program {
static void Main(string[] args) {
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var solver = new Solver(sw);
// var t = new Thread(solver.solve, 1 << 28); // 256 MB
// t.Start();
// t.Join();
solver.solve();
sw.Flush();
}
}
class Solver {
StreamWriter sw;
Scan sc;
void Prt(string a) => sw.WriteLine(a);
void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
void Prt(params object[] a) => Prt(string.Join(" ", a));
public Solver(StreamWriter sw) {
this.sw = sw;
this.sc = new Scan();
}
public void solve() {
int k, l, m, n;
long s;
sc.Multi(out k, out l, out m, out n, out s);
var a = sc.LongArr;
var b = sc.LongArr;
var c = sc.LongArr;
var d = sc.LongArr;
var ab = new long[k * l];
var cd = new long[m * n];
for (int i = 0; i < a.Length; i++)
{
for (int j = 0; j < b.Length; j++)
{
ab[i * l + j] = a[i] * b[j];
}
}
for (int i = 0; i < c.Length; i++)
{
for (int j = 0; j < d.Length; j++)
{
cd[i * n + j] = c[i] * d[j];
}
}
long x = solve(ab, cd, s);
var ans = solve(a, b, c, d, x);
Prt(x);
Prt(ans);
}
long[] solve(long[] a, long[] b, long[] c, long[] d, long s) {
var dic1 = new Dictionary<long, pair<long, long>>();
foreach (var i in a)
{
foreach (var j in b)
{
dic1[i * j] = new pair<long, long>(i, j);
}
}
var dic2 = new Dictionary<long, pair<long, long>>();
foreach (var i in c)
{
foreach (var j in d)
{
dic2[i * j] = new pair<long, long>(i, j);
}
}
foreach (var item in dic1)
{
if (item.Key == 0) {
if (s == 0) {
return new long[]{ item.Value.v1, item.Value.v2, c[0], d[0] };
}
}
else if (s % item.Key == 0 && dic2.ContainsKey(s / item.Key)) {
return new long[]{ item.Value.v1, item.Value.v2, dic2[s / item.Key].v1, dic2[s / item.Key].v2 };
}
}
return new long[4];
}
int sign(long a) {
if (a > 0) return 1;
else if (a == 0) return 0;
else return -1;
}
long solve(long[] a, long[] b, long k) {
Array.Sort(a);
Array.Sort(b);
long ng = -LM, ok = LM;
while (ng < ok - 1) {
long m = (ok + ng) / 2;
long c = 0;
int ps = -2;
int j = -1;
foreach (var item in a)
{
if (item == 0) {
if (m >= 0) c += b.Length;
}
else if (item > 0) {
if (ps == sign(item)) {
while (j > 0 && b[j - 1] * item > m) {
--j;
}
while (j < b.Length && b[j] * item <= m) {
++j;
}
}
else {
j = b.MyBinarySearch(x => x * item <= m);
}
c += j;
}
else {
if (ps == sign(item)) {
while (j > 0 && b[j - 1] * item <= m) {
--j;
}
while (j < b.Length && b[j] * item > m) {
++j;
}
}
else {
j = b.MyBinarySearch(x => x * item > m);
}
c += b.Length - j;
}
ps = sign(item);
}
if (c >= k) {
ok = m;
}
else {
ng = m;
}
}
return ok;
}
}
class pair<T, U> : IComparable<pair<T, U>> {
public T v1;
public U v2;
public pair() : this(default(T), default(U)) {}
public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
public int CompareTo(pair<T, U> a) {
int c = Comparer<T>.Default.Compare(v1, a.v1);
return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
}
public override string ToString() => v1 + " " + v2;
public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
public static readonly int M = 1000000007;
// public static readonly int M = 998244353;
public static readonly long LM = 1L << 60;
public static readonly double eps = 1e-11;
public static void DBG(string a) => Console.Error.WriteLine(a);
public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
public static void DBG(params object[] a) => DBG(string.Join(" ", a));
public static void Assert(params bool[] conds) {
if (conds.Any(x => !x)) throw new Exception();
}
public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
for (int i = 0; i < a.Count && i < b.Count; i++)
if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
return a.Count.CompareTo(b.Count);
}
public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
public static readonly int[] dd = { 0, 1, 0, -1 };
// static readonly string dstring = "RDLU";
public static IEnumerable<P> adjacents(int i, int j) {
for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]);
}
public static IEnumerable<P> adjacents(int i, int j, int h, int w)
=> adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
public static IEnumerable<int> all_subset(this int p) {
for (int i = 0; ; i = i - p & p) {
yield return i;
if (i == p) break;
}
}
public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
=> a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
public static T[] inv<T>(this Dictionary<T, int> dic) {
var res = new T[dic.Count];
foreach (var item in dic) res[item.Value] = item.Key;
return res;
}
public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
public static T[] copy<T>(this IList<T> a) {
var ret = new T[a.Count];
for (int i = 0; i < a.Count; i++) ret[i] = a[i];
return ret;
}
}
class Scan {
StreamReader sr;
public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
public Scan(string path) { sr = new StreamReader(path); }
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public string Str => ReadLine.Trim();
public string ReadLine => sr.ReadLine();
public pair<T, U> Pair<T, U>() {
T a; U b;
Multi(out a, out b);
return new pair<T, U>(a, b);
}
public P P => Pair<int, int>();
public int[] IntArr => StrArr.Select(int.Parse).ToArray();
public long[] LongArr => StrArr.Select(long.Parse).ToArray();
public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
bool eq<T, U>() => typeof(T).Equals(typeof(U));
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
public void Multi<T>(out T a) => a = cv<T>(Str);
public void Multi<T, U>(out T a, out U b) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
}
public void Multi<T, U, V>(out T a, out U b, out V c) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
}
public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
}
public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
}
public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]);
}
}
static class Search {
public static int MyBinarySearch<T>(this IList<T> a, Func<T, bool> is_ok) {
int ok = -1, ng = a.Count;
while (ok < ng - 1) {
int m = (ok + ng) >> 1;
if (is_ok(a[m])) ok = m;
else ng = m;
}
return ok + 1;
}
// x index
// x index + 1
//
public static int UpperBound<T>(this IList<T> a, T x) where T : IComparable<T> {
int le = -1, u = a.Count;
while (le < u - 1) {
int m = (le + u) >> 1;
if (a[m].CompareTo(x) > 0) u = m;
else le = m;
}
return le + 1;
}
public static int UpperBound<T>(this IList<T> a, T x, Func<T, T, int> compare) {
int le = -1, u = a.Count;
while (le < u - 1) {
int m = (le + u) >> 1;
if (compare(a[m], x) > 0) u = m;
else le = m;
}
return le + 1;
}
// n index + 1
// n index
//
public static int LowerBound<T>(this IList<T> a, T x) where T : IComparable<T> {
int l = -1, ue = a.Count;
while (l < ue - 1) {
int m = (l + ue) >> 1;
if (a[m].CompareTo(x) < 0) l = m;
else ue = m;
}
return ue;
}
public static int LowerBound<T>(this IList<T> a, T x, Func<T, T, int> compare) {
int l = -1, ue = a.Count;
while (l < ue - 1) {
int m = (l + ue) >> 1;
if (compare(a[m], x) < 0) l = m;
else ue = m;
}
return ue;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0