結果
問題 | No.555 世界史のレポート |
ユーザー | fgwiebfaoish |
提出日時 | 2020-04-02 19:10:04 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 900 ms / 2,000 ms |
コード長 | 4,535 bytes |
コンパイル時間 | 2,768 ms |
コンパイル使用メモリ | 111,584 KB |
実行使用メモリ | 165,584 KB |
最終ジャッジ日時 | 2023-09-11 00:45:10 |
合計ジャッジ時間 | 10,327 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
20,740 KB |
testcase_01 | AC | 59 ms
18,876 KB |
testcase_02 | AC | 60 ms
20,936 KB |
testcase_03 | AC | 64 ms
22,732 KB |
testcase_04 | AC | 63 ms
20,872 KB |
testcase_05 | AC | 61 ms
20,808 KB |
testcase_06 | AC | 61 ms
20,812 KB |
testcase_07 | AC | 61 ms
20,716 KB |
testcase_08 | AC | 61 ms
20,868 KB |
testcase_09 | AC | 63 ms
22,900 KB |
testcase_10 | AC | 571 ms
111,212 KB |
testcase_11 | AC | 423 ms
84,488 KB |
testcase_12 | AC | 755 ms
143,460 KB |
testcase_13 | AC | 885 ms
159,252 KB |
testcase_14 | AC | 900 ms
165,584 KB |
testcase_15 | AC | 135 ms
43,524 KB |
testcase_16 | AC | 420 ms
90,636 KB |
testcase_17 | AC | 147 ms
46,736 KB |
testcase_18 | AC | 453 ms
97,484 KB |
testcase_19 | AC | 539 ms
109,548 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
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; 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 s=sc.Ia; var pq=new Rheap<Tuple<int,int>>(32); pq.Push(new Rheap<Tuple<int,int>>.Dt(s[0],Tuple.Create(1,1))); while(true){ var e=pq.Dequeue; if(e.d.Item1>=n){ Console.WriteLine(e.n); break; } if(e.d.Item1>e.d.Item2){ pq.Push(new Rheap<Tuple<int,int>>.Dt(e.n+s[0],Tuple.Create(e.d.Item1,e.d.Item1))); } pq.Push(new Rheap<Tuple<int,int>>.Dt(e.n+s[1],Tuple.Create(e.d.Item1+e.d.Item2,e.d.Item2))); } } } public class Rheap<T>{ public class Dt{ public long n; public T d; public Dt(long n,T d){this.n=n;this.d=d;} public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString(); } private const int m=65; private long la=0; private Dt[][] bf; private int[] h; public int cnt=0; public Rheap(int max){ bf=new Dt[m][]; h=new int[m]; for(int i = 0;i<m;i++) {bf[i]=new Dt[max];} } public void Push(Dt x){ int a=x.n!=la?Bsr(la^x.n)+1:0; if(h[a]==bf[a].Length){Extend(a);} bf[a][h[a]]=x; cnt++; h[a]++; } public Dt Peek{get{ if(h[0]==0){ for(int i = 1;i<m;i++) { if(h[i]>0){ int p=0; for(int j = 1;j<h[i];j++) { if(bf[i][p].n>bf[i][j].n){p=j;} } la=bf[i][p].n; for(int j = 0;j<h[i];j++) { Push(bf[i][j]); cnt--; } h[i]=0; break; } } } return bf[0][h[0]-1]; }} public Dt Dequeue{get{ var e=Peek; h[0]--; cnt--; return e; }} private void Extend(int n){ var nhe=new Dt[bf[n].Length<<1]; Array.Copy(bf[n],nhe,bf[n].Length); bf[n]=nhe; } private int Bsr(long b){ int n=0; if(b==0){return -1;} if((b&-4294967296)!=0){b=b&-4294967296;n+=32;} if((b&-281470681808896)!=0){b=b&-281470681808896;n+=16;} if((b&-71777214294589696)!=0){b=b&-71777214294589696;n+=8;} if((b&-1085102592571150096)!=0){b=b&-1085102592571150096;n+=4;} if((b&-3689348814741910324)!=0){b=b&-3689348814741910324;n+=2;} if((b&-6148914691236517206)!=0){b=b&-6148914691236517206;n+=1;} return n; } } 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(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);} public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),int.Parse);} public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}} public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);} public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),long.Parse);} public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}} public double[] Da3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),double.Parse);} public double[] Da3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).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;} }