結果

問題 No.3073 Fraction Median
ユーザー KumaTachiRen
提出日時 2025-03-21 22:01:43
言語 C#
(.NET 8.0.404)
結果
AC  
実行時間 887 ms / 2,500 ms
コード長 8,944 bytes
コンパイル時間 8,767 ms
コンパイル使用メモリ 174,416 KB
実行使用メモリ 197,612 KB
最終ジャッジ日時 2025-03-21 22:02:08
合計ジャッジ時間 22,205 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 18
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (121 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using Lib;
using Lib.MathLib;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        int n = ri;
        ReadArray(out long[] a, n);
        Array.Sort(a);

        var res = SternBrocotTree.Search(1000000000, (x, y) =>
        {
            long c = 0;
            for (int i = 0, j = 0; i < n; i++)
            {
                while (j < n && a[j] * y <= a[i] * x) j++;
                c += j;
                if (i < j) c--;
            }
            return c * 2 < (long)n * (n - 1);
        });
        long ans_a = res.ra, ans_b = res.rb;
        Write(ans_a, ans_b);
    }

#pragma warning disable CS0162, CS8618
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162, CS8618

    const int IINF = 1 << 30;
    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
    void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
    void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
    void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
    void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}

static class Program
{
    static public void Main(string[] args)
    {
        SourceExpander.Expander.Expand();
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(b^'0');return ng?-ret:ret;}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b;do b=Read();while(b<'0'||'9'<b);for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(ulong)(b^'0');return ret;}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib.MathLib{public static class SternBrocotTree{public static List<(int dir,long len)>EncodePath(long a,long b){var ret=new List<(int dir,long len)>();int dir=1;while(b!=0){long d=a/b;(a,b)=(b,a-b*d);if(b==0)d--;if(d!=0)ret.Add((dir,d));dir^=1;}return ret;}public static(long p,long q,long r,long s)DecodePath(List<(int dir,long len)>path){long p=0,q=1,r=1,s=0;for(int i=0;i<path.Count;i++){var(dir,len)=path[i];if(dir==0)(r,s)=(len*p+r,len*q+s);else(p,q)=(p+r*len,q+s*len);}return(p,q,r,s);}public static(long p,long q,long r,long s)LCA(long a,long b,long c,long d){int dir=1;long p=0,q=1,r=1,s=0;while(b!=0&&d!=0){long l1=a/b,l2=c/d;(a,b)=(b,a-b*l1);(c,d)=(d,c-d*l2);if(b==0)l1--;if(d==0)l2--;long m=Math.Min(l1,l2);if(dir==0)(r,s)=(m*p+r,m*q+s);else(p,q)=(p+r*m,q+s*m);if(l1!=l2)break;dir^=1;}return(p,q,r,s);}public static(long p,long q,long r,long s)Ancestor(int k,long a,long b){int dir=1;long p=0,q=1,r=1,s=0;while(b!=0&&k>0){long l1=a/b;(a,b)=(b,a-b*l1);if(b==0)l1--;long m=Math.Min(l1,k);if(dir==0)(r,s)=(m*p+r,m*q+s);else(p,q)=(p+r*m,q+s*m);k-=(int)m;dir^=1;}return k>0?(-1,-1,-1,-1):(p,q,r,s);}public static long Depth(long a,long b){long dep=0;while(b!=0){long d=a/b;(a,b)=(b,a-b*d);if(b==0)d--;dep+=d;}return dep;}public static(long p,long q,long r,long s)Range(long a,long b){long p=0,q=1,r=1,s=0;int dir=1;while(b!=0){long len=a/b;(a,b)=(b,a-b*len);if(b==0)len--;if(dir==0)(r,s)=(len*p+r,len*q+s);else(p,q)=(p+r*len,q+s*len);dir^=1;}return(p,q,r,s);}public class Result{public long la,lb,ra,rb;public List<(bool isright,long count)>moves;public override string ToString()=>$"[{la}/{lb},{ra}/{rb})";}public static Result Search(int n,Func<long,long,bool>f){var moves=new List<(bool isright,long count)>();long la=0,lb=1;long ra=1,rb=0;while(true){if(!f(la+ra,lb+rb)){long ok=0,ng=Math.Min(la>0?(n-ra)/la:n,lb>0?(n-rb)/lb:n)+1;while(ng-ok>1){long mid=(ok+ng)/2;if(!f(mid*la+ra,mid*lb+rb))ok=mid;else ng=mid;}if(ok==0)return new Result{la=la,lb=lb,ra=ra,rb=rb,moves=moves};moves.Add((false,ok));ra=ok*la+ra;rb=ok*lb+rb;}else{long ok=0,ng=Math.Min(ra>0?(n-la)/ra:n,rb>0?(n-lb)/rb:n)+1;while(ng-ok>1){long mid=(ok+ng)/2;if(f(la+mid*ra,lb+mid*rb))ok=mid;else ng=mid;}if(ok==0)return new Result{la=la,lb=lb,ra=ra,rb=rb,moves=moves};moves.Add((true,ok));la=la+ok*ra;lb=lb+ok*rb;}}}public class ResultBig{public BigInteger la,lb,ra,rb;public List<(bool isright,BigInteger count)>moves;public override string ToString()=>$"[{la}/{lb},{ra}/{rb})";}public static ResultBig Search(BigInteger n,Func<BigInteger,BigInteger,bool>f){var moves=new List<(bool isright,BigInteger count)>();BigInteger la=0,lb=1;BigInteger ra=1,rb=0;while(true){if(!f(la+ra,lb+rb)){var ng1=la>0?(n-ra)/la:n;var ng2=lb>0?(n-rb)/lb:n;BigInteger ok=0,ng=(ng1<ng2?ng1:ng2)+1;while(ng-ok>1){var mid=(ok+ng)/2;if(!f(mid*la+ra,mid*lb+rb))ok=mid;else ng=mid;}if(ok==0)return new ResultBig{la=la,lb=lb,ra=ra,rb=rb,moves=moves};moves.Add((false,ok));ra=ok*la+ra;rb=ok*lb+rb;}else{var ng1=ra>0?(n-la)/ra:n;var ng2=rb>0?(n-lb)/rb:n;BigInteger ok=0,ng=(ng1<ng2?ng1:ng2)+1;while(ng-ok>1){var mid=(ok+ng)/2;if(f(la+mid*ra,lb+mid*rb))ok=mid;else ng=mid;}if(ok==0)return new ResultBig{la=la,lb=lb,ra=ra,rb=rb,moves=moves};moves.Add((true,ok));la=la+ok*ra;lb=lb+ok*rb;}}}}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander
0