結果

問題 No.1265 Balloon Survival
ユーザー fgwiebfaoish
提出日時 2020-10-23 23:31:31
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 816 ms / 2,000 ms
コード長 4,268 bytes
コンパイル時間 1,055 ms
コンパイル使用メモリ 115,452 KB
実行使用メモリ 53,464 KB
最終ジャッジ日時 2024-07-21 13:27:51
合計ジャッジ時間 11,319 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
//using nint=System.Int32;
static class Program{
    const int mod=(int)1e9+7;
    //const double eps=1e-11;
    static void Main(){
        Sc sc=new Sc();
        var n=sc.I;
        var h=new long[n][];
        var pq=new Pq<Dt<(int,int)>>(32,true);
        var b=new bool[n+1];
        for(int i = 0;i<n;i++) {
            h[i]=sc.La;
            for(int j = i-1;j>=0;j--) {
                pq.Push(((h[i][0]-h[j][0])*(h[i][0]-h[j][0])+(h[i][1]-h[j][1])*(h[i][1]-h[j][1]),(j,i)));
            }
            b[i]=true;
        }
        int ans=0;
        while(pq.cnt>0){
            var e=pq.Top;
            pq.Pop();
            if(b[e.d.Item1]&&b[e.d.Item2]){
                if(e.d.Item1==0){
                    ans++;
                }
                else{
                    b[e.d.Item1]=false;
                }
                b[e.d.Item2]=false;
            }
        }
        Console.WriteLine("{0}",ans);
    }
}
public class Dt<T>:IComparable{
    public long n;
    public T d;
    public static implicit operator Dt<T>((long,T) e){return new Dt<T>(e.Item1,e.Item2);}
    public Dt(long n,T d){this.n=n;this.d=d;}
    public int CompareTo(object obj){
        Dt<T> mymo=(Dt<T>)obj;
        if(mymo.n>n){return -1;}
        else if(mymo.n<n){return 1;}
        else{return 0;}
    }
    public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString();
}
public class Pq<T> where T:IComparable{
    private T[] he;
    public int cnt=0,max=0;
    private Func<T,T,int> compare;
    public Pq(int max,bool mm){
        this.max=max;
        he=new T[max];
        if(mm){compare=Ao;}
        else{compare=Do;}
    }
    public void Push(T x){
        if(cnt==max){Extend();}
        int j=cnt;
        while(j!=0&&compare(x,he[(j-1)>>1])>0){he[j]=he[(j-1)>>1];j=(j-1)>>1;}
        he[j]=x;
        cnt++;
    }
    public void Pop(){
        cnt--;
        T r=he[cnt];
        int j=0;
        while(true){
            if(j*2+1<cnt){
                if(compare(he[j*2+1],he[j*2+2])>0){j=j*2+1;}
                else{j=j*2+2;}
            }
            else if(j*2<cnt){j=j*2+1;}
            else{break;}
            if(compare(he[j],r)<=0){j=(j-1)>>1;break;}
            he[(j-1)>>1]=he[j];
        }
        he[j]=r;
    }
    private int Ao(T x,T y){return y.CompareTo(x);}
    private int Do(T x,T y){return x.CompareTo(y);}
    public T Top{get{return he[0];}}
    private void Extend(){
        T[] nhe=new T[max<<1];
        Array.Copy(he,nhe,max);
        he=nhe;
        max<<=1;
    }
}
public class Sc{
    public int I{get{return int.Parse(Console.ReadLine());}}
    public long L{get{return long.Parse(Console.ReadLine());}}
    public double D{get{return double.Parse(Console.ReadLine());}}
    public string S{get{return Console.ReadLine();}}
    public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
    public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
    public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
    public string[] Sa{get{return Console.ReadLine().Split();}}
    public object[] Oa{get{return Console.ReadLine().Split();}}
    public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
    public int[] Ia3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),int.Parse);}
    public int[] Ia3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),int.Parse);}
    public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
    public long[] La3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),long.Parse);}
    public long[] La3(int a){return Array.ConvertAll((Console.ReadLine()+" "+a.ToString()).Split(),long.Parse);}
    public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
    public double[] Da3(string a,string b){return Array.ConvertAll((a+Console.ReadLine()+b).Split(),double.Parse);}
    public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
    public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
    public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
    public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0