結果

問題 No.2873 Kendall's Tau
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-09-06 21:45:42
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 425 ms / 4,500 ms
コード長 12,596 bytes
コンパイル時間 10,515 ms
コンパイル使用メモリ 167,736 KB
実行使用メモリ 206,496 KB
最終ジャッジ日時 2024-09-06 21:46:15
合計ジャッジ時間 17,084 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
30,592 KB
testcase_01 AC 61 ms
30,848 KB
testcase_02 AC 62 ms
30,592 KB
testcase_03 AC 61 ms
30,592 KB
testcase_04 AC 61 ms
31,232 KB
testcase_05 AC 60 ms
30,336 KB
testcase_06 AC 62 ms
30,848 KB
testcase_07 AC 401 ms
50,304 KB
testcase_08 AC 420 ms
62,852 KB
testcase_09 AC 396 ms
50,304 KB
testcase_10 AC 420 ms
62,956 KB
testcase_11 AC 401 ms
50,432 KB
testcase_12 AC 425 ms
66,896 KB
testcase_13 AC 170 ms
38,192 KB
testcase_14 AC 331 ms
51,352 KB
testcase_15 AC 123 ms
37,360 KB
testcase_16 AC 125 ms
37,120 KB
testcase_17 AC 307 ms
48,896 KB
testcase_18 AC 249 ms
45,588 KB
testcase_19 AC 295 ms
45,056 KB
testcase_20 AC 126 ms
37,376 KB
testcase_21 AC 266 ms
44,056 KB
testcase_22 AC 153 ms
39,680 KB
testcase_23 AC 273 ms
44,444 KB
testcase_24 AC 97 ms
35,328 KB
testcase_25 AC 120 ms
37,248 KB
testcase_26 AC 315 ms
45,440 KB
testcase_27 AC 219 ms
43,828 KB
testcase_28 AC 343 ms
47,764 KB
testcase_29 AC 386 ms
65,072 KB
testcase_30 AC 111 ms
37,112 KB
testcase_31 AC 150 ms
38,144 KB
testcase_32 AC 258 ms
206,496 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (96 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
/home/judge/data/code/Main.cs(101,3674): warning CS8632: '#nullable' 注釈コンテキスト内のコードでのみ、Null 許容参照型の注釈を使用する必要があります。 [/home/judge/data/code/main.csproj]
  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 System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        int n = ri;
        var xy = new (int x, int y)[n];
        for (int i = 0; i < n; i++) xy[i] = (ri, ri);

        double ans_p = 0, ans_q = 0;

        var xs = xy.Select(p => p.x).OrderBy(x => x).Distinct().ToArray();
        var ys = xy.Select(p => p.y).OrderBy(x => x).Distinct().ToArray();

        var xdic = new Dictionary<int, int>();
        for (int i = 0; i < xs.Length; i++) xdic.Add(xs[i], i);
        var ydic = new Dictionary<int, int>();
        for (int i = 0; i < ys.Length; i++) ydic.Add(ys[i], i);

        var xcnt = new long[n];
        var ycnt = new long[n];
        Array.Sort(xy);
        var bit = new BinaryIndexedTree<long, LongAddBITOperator>(ys.Length);
        for (int xi = 0, i = 0; xi < xs.Length; xi++)
        {
            int x = xs[xi];
            int i0 = i;
            for (; i < n && xy[i].x == x; i++)
            {
                int yi = ydic[xy[i].y];
                ans_p += bit.Sum(yi);
                ans_p -= bit.Sum(yi + 1, ys.Length);
            }
            for (i = i0; i < n && xy[i].x == x; i++)
            {
                int yi = ydic[xy[i].y];
                bit.Add(yi, 1);
                xcnt[xi]++;
                ycnt[yi]++;
            }
        }
        {
            long sx = (long)n * n, sy = (long)n * n;
            for (int i = 0; i < n; i++)
            {
                sx -= xcnt[i] * xcnt[i];
                sy -= ycnt[i] * ycnt[i];
            }
            ans_q = 1;
            ans_q *= sx / 2;
            ans_q *= sy / 2;
        }

        double ans = ans_p / Math.Sqrt(ans_q);
        Write(ans.ToString("F12"));
    }

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

    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 struct ModIntAddBITOperator<TMod>:IBinaryIndexedTreeOperator<StaticModInt<TMod>>where TMod:struct,IStaticMod{public StaticModInt<TMod>Identity=>0;public StaticModInt<TMod>Addition(StaticModInt<TMod>x,StaticModInt<TMod>y)=>x+y;public StaticModInt<TMod>Subtract(StaticModInt<TMod>x,StaticModInt<TMod>y)=>x-y;}public struct IntAddBITOperator:IBinaryIndexedTreeOperator<int>{public int Identity=>0;public int Addition(int x,int y)=>x+y;public int Subtract(int x,int y)=>x-y;}public struct LongAddBITOperator:IBinaryIndexedTreeOperator<long>{public long Identity=>0;public long Addition(long x,long y)=>x+y;public long Subtract(long x,long y)=>x-y;}public interface IBinaryIndexedTreeOperator<T>{T Identity{get;}T Addition(T x,T y);T Subtract(T x,T y);}public class BinaryIndexedTree<T,Op>where Op:struct,IBinaryIndexedTreeOperator<T>{private static readonly Op op=default;public int Length{get;}public readonly T[]data;public BinaryIndexedTree(int n){Length=n;data=new T[Length+1];Array.Fill(data,op.Identity);}[MethodImpl(256)]public void Add(int p,T x){for(p++;p<data.Length;p+=p&-p)data[p]=op.Addition(data[p],x);}[MethodImpl(256)]public T Sum(int l,int r)=>op.Subtract(Sum(r),Sum(l));[MethodImpl(256)]public T Sum(int x){T s=op.Identity;for(;x>0;x-=x&-x)s=op.Addition(s,data[x]);return s;}[MethodImpl(256)]public int LowerBound(Func<T,bool>cond){if(cond(op.Identity))return 0;int x=0,r=1;while(r<Length)r=r<<1;T s=op.Identity;for(int len=r;len>0;len>>=1){if(x+len<Length&&!cond(op.Addition(s,data[x+len]))){s=op.Addition(s,data[x+len]);x+=len;}}return x+1;}}}
namespace Lib{public partial class StreamScanner{public int[][]ReadUnweightedTree(int n,int origin=1){var gr=new List<int>[n];for(int i=0;i<n;i++)gr[i]=new List<int>();for(int i=0;i<n-1;i++){int u=(int)(Integer()-origin);int v=(int)(Integer()-origin);gr[u].Add(v);gr[v].Add(u);}var g=new int[n][];for(int i=0;i<n;i++)g[i]=gr[i].ToArray();return g;}}}
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=0;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;byte b=0;var ng=false;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;true;b=Read()){if(b<'0'||'9'<b)return ng?-ret:ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b=0;do b=Read();while(b<'0'||'9'<b);for(;true;b=Read()){if(b<'0'||'9'<b)return ret;else ret=ret*10+b-'0';}}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public interface IStaticMod{uint Mod{get;}bool IsPrime{get;}}public readonly struct Mod1000000007:IStaticMod{public uint Mod=>1000000007;public bool IsPrime=>true;}public readonly struct Mod998244353:IStaticMod{public uint Mod=>998244353;public bool IsPrime=>true;}public readonly struct StaticModInt<T>:IEquatable<StaticModInt<T>>where T:struct,IStaticMod{internal readonly uint _v;private static readonly T op=default;public int Value=>(int)_v;public static int Mod=>(int)op.Mod;public static StaticModInt<T>Zero=>default;public static StaticModInt<T>One=>new StaticModInt<T>(1u);[MethodImpl(256)]public static StaticModInt<T>Raw(int v){var u=unchecked((uint)v);return new StaticModInt<T>(u);}[MethodImpl(256)]public StaticModInt(long v):this(Round(v)){}[MethodImpl(256)]public StaticModInt(ulong v):this((uint)(v%op.Mod)){}[MethodImpl(256)]private StaticModInt(uint v)=>_v=v;[MethodImpl(256)]private static uint Round(long v){var x=v%op.Mod;if(x<0)x+=op.Mod;return(uint)x;}[MethodImpl(256)]public static StaticModInt<T>operator ++(StaticModInt<T>v){var x=v._v+1;if(x==op.Mod)x=0;return new StaticModInt<T>(x);}[MethodImpl(256)]public static StaticModInt<T>operator --(StaticModInt<T>v){var x=v._v;if(x==0)x=op.Mod;return new StaticModInt<T>(x-1);}[MethodImpl(256)]public static StaticModInt<T>operator+(StaticModInt<T>lhs,StaticModInt<T>rhs){var v=lhs._v+rhs._v;if(v>=op.Mod)v-=op.Mod;return new StaticModInt<T>(v);}[MethodImpl(256)]public static StaticModInt<T>operator-(StaticModInt<T>lhs,StaticModInt<T>rhs){unchecked{var v=lhs._v-rhs._v;if(v>=op.Mod)v+=op.Mod;return new StaticModInt<T>(v);}}[MethodImpl(256)]public static StaticModInt<T>operator*(StaticModInt<T>lhs,StaticModInt<T>rhs)=>new StaticModInt<T>((uint)((ulong)lhs._v*rhs._v%op.Mod));[MethodImpl(256)]public static StaticModInt<T>operator/(StaticModInt<T>lhs,StaticModInt<T>rhs)=>new StaticModInt<T>((uint)((ulong)lhs._v*Inv(rhs._v)%op.Mod));[MethodImpl(256)]public static StaticModInt<T>operator+(StaticModInt<T>v)=>v;[MethodImpl(256)]public static StaticModInt<T>operator-(StaticModInt<T>v)=>new StaticModInt<T>(v._v==0?0:op.Mod-v._v);[MethodImpl(256)]public static bool operator==(StaticModInt<T>lhs,StaticModInt<T>rhs)=>lhs._v==rhs._v;[MethodImpl(256)]public static bool operator!=(StaticModInt<T>lhs,StaticModInt<T>rhs)=>lhs._v!=rhs._v;[MethodImpl(256)]public static implicit operator StaticModInt<T>(int v)=>new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(uint v)=>new StaticModInt<T>((long)v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(long v)=>new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator StaticModInt<T>(ulong v)=>new StaticModInt<T>(v);[MethodImpl(256)]public static implicit operator long(StaticModInt<T>v)=>v._v;[MethodImpl(256)]public static implicit operator ulong(StaticModInt<T>v)=>v._v;[MethodImpl(256)]public StaticModInt<T>Pow(long n){var x=this;var r=new StaticModInt<T>(1U);if(n<0)(x,n)=(x.Inv(),-n);while(n>0){if((n&1)>0)r*=x;x*=x;n>>=1;}return r;}[MethodImpl(256)]public StaticModInt<T>Inv()=>new StaticModInt<T>(Inv(_v));[MethodImpl(256)]static ulong Inv(ulong x){long u=op.Mod,xu=1,yu=0,v=(long)x,xv=0,yv=1;while(v!=0){long w=SafeMod(u,v);long q=(u-w)/v;long xw=xu-xv*q;long yw=yu-yv*q;u=v;xu=xv;yu=yv;v=w;xv=xw;yv=yw;}return(ulong)(yu<0?yu+op.Mod:yu);}[MethodImpl(256)]static long SafeMod(long x,long m){long r=x%m;if(r<0)r+=m;return r;}[MethodImpl(256)]public override string ToString()=>_v.ToString();[MethodImpl(256)]public string ToString(string format,IFormatProvider formatProvider)=>_v.ToString(format,formatProvider);[MethodImpl(256)]public override bool Equals(object?obj)=>obj is StaticModInt<T>m&&Equals(m);[MethodImpl(256)]public bool Equals(StaticModInt<T>other)=>_v==other._v;[MethodImpl(256)]public override int GetHashCode()=>_v.GetHashCode();}}
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=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i]);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){for(int i=0;i<a.Length;i++)WriteJoin(sep,a[i].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