結果

問題 No.1330 Multiply or Divide
ユーザー fgwiebfaoish
提出日時 2021-01-09 00:26:46
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 254 ms / 2,000 ms
コード長 5,063 bytes
コンパイル時間 1,277 ms
コンパイル使用メモリ 112,000 KB
実行使用メモリ 54,316 KB
最終ジャッジ日時 2024-11-16 19:57:54
合計ジャッジ時間 8,472 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 46
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
static void Main(){
Sc sc=new Sc();
var (n,m,p)=sc.Tp3<int>();
var a=sc.Ia;
var h=new int[n][];
var bo=false;
int f=0,g=0;
for(int i = 0;i<n;i++) {
h[i]=new int[]{a[i],1};
while(h[i][0]%p==0){
h[i][0]/=p;
h[i][1]++;
}
if(a[i]>m){bo=true;}
f=Max(f,a[i]);
g=Max(h[i][0],g);
}
if(g<=1){
Console.WriteLine(bo?1:-1);
return;
}
h=h.OrderByDescending(x=>x[0]).ThenBy(x=>x[1]).ToArray();
var li=new List<(int,int)>();
for(int i = 0,j=h[0][1];i<n;i++) {
if((i==0||h[i][1]<j)&&h[i][0]>1){li.Add((h[i][0],h[i][1]));}
}
var pq=new Rheap<long>(32);
pq.Push(new Rheap<long>.Dt(0,1));
var hs=new HashSet<long>();
while(true){
var e=pq.Dequeue;
if(e.d*f>m){
Console.WriteLine(e.n+1);
return;
}
if(hs.Contains(e.d)){continue;}
else{hs.Add(e.d);}
for(int i = 0;i<li.Count;i++) {
pq.Push(new Rheap<long>.Dt(e.n+li[i].Item2,li[i].Item1*e.d));
}
}
}
}
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(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;}
public (T,T) Tp2<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]));}
public (T,T,T) Tp3<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0