結果

問題 No.2075 GCD Subsequence
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2022-09-17 09:02:15
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 2,053 ms / 4,000 ms
コード長 10,688 bytes
コンパイル時間 1,314 ms
コンパイル使用メモリ 120,540 KB
実行使用メモリ 52,608 KB
最終ジャッジ日時 2024-12-22 00:25:03
合計ジャッジ時間 28,031 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
30,208 KB
testcase_01 AC 50 ms
30,208 KB
testcase_02 AC 48 ms
30,080 KB
testcase_03 AC 49 ms
30,208 KB
testcase_04 AC 49 ms
29,824 KB
testcase_05 AC 50 ms
30,080 KB
testcase_06 AC 50 ms
29,952 KB
testcase_07 AC 50 ms
29,952 KB
testcase_08 AC 284 ms
46,080 KB
testcase_09 AC 451 ms
51,712 KB
testcase_10 AC 312 ms
46,464 KB
testcase_11 AC 391 ms
49,152 KB
testcase_12 AC 345 ms
47,872 KB
testcase_13 AC 259 ms
44,672 KB
testcase_14 AC 383 ms
49,152 KB
testcase_15 AC 280 ms
45,440 KB
testcase_16 AC 293 ms
45,952 KB
testcase_17 AC 457 ms
51,840 KB
testcase_18 AC 1,921 ms
52,608 KB
testcase_19 AC 1,939 ms
52,608 KB
testcase_20 AC 1,940 ms
52,608 KB
testcase_21 AC 1,924 ms
52,480 KB
testcase_22 AC 1,923 ms
52,608 KB
testcase_23 AC 1,939 ms
52,352 KB
testcase_24 AC 1,922 ms
52,480 KB
testcase_25 AC 1,933 ms
52,608 KB
testcase_26 AC 1,926 ms
52,608 KB
testcase_27 AC 1,919 ms
52,608 KB
testcase_28 AC 2,053 ms
52,352 KB
testcase_29 AC 49 ms
29,952 KB
testcase_30 AC 48 ms
29,952 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Text.RegularExpressions;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Diagnostics;
static class Program{
	const long inf=long.MaxValue>>1;
	const int mod=998244353;
	static Sc sc=new Sc();
	static void Main(){
		Pt pt=new Pt(Solve);
		pt.Sm();
	}
	static void Solve(Pt pt) {
		var n = sc.I;
		var a = sc.Ia;
		int m = 1000000;
		var osak = new Osak(m);
		var h = Enumerable.Repeat((Mint)1,m+1).ToArray();
		var dp = new Mint[n];
		for(int i = 0;i<n;i++) {
			if(a[i]==1) {
				dp[i]=1;
				continue;
			}
			var li = new List<int>();
			osak.Pf2(a[i],(g,p) => {
				li.Add(g);
			});
			int c = 1<<li.Count;
			for(int j = 1;j<c;j++) {
				int p = 1;
				for(int k = 0;k<li.Count;k++) {
					if(((j>>k)&1)==1) { p*=li[k]; }
				}
				Mint t = mod+((Pc(j)&1)<<1)-1;
				dp[i]+=h[p]*t;
			}
			for(int j = 1;j<c;j++) {
				int p = 1;
				for(int k = 0;k<li.Count;k++) {
					if(((j>>k)&1)==1) { p*=li[k]; }
				}
				h[p]+=dp[i];
			}
		}
		pt.Wl(dp.Sum());
	}
	static int Pc(long bits) {
		bits-=(bits>>1)&0x5555555555555555;
		bits=(bits&0x3333333333333333)+(bits>>2&0x3333333333333333);
		return (int)(((bits+(bits>>4))&0xf0f0f0f0f0f0f0f)*0x101010101010101>>56);
	}
	static string Binary(long a,int b) {
		string s = Convert.ToString(a,2);
		return (b>s.Length ? new string('0',b-s.Length) : "")+s;
	}
}
public struct Mint {
	const int mod = 998244353;
	private long d;
	public Mint(long d) { this.d=d; }
	public static implicit operator Mint(long d) { return new Mint(d%mod); }
	public static explicit operator long(Mint d) { return d.d; }
	public override string ToString() { return d.ToString(); }
	public static Mint operator +(Mint a,long b) { a.d=(mod+a.d+b%mod)%mod; return a; }
	public static Mint operator +(Mint a,Mint b) { a.d=(a.d+b.d)%mod; return a; }
	public static Mint operator -(Mint a,long b) { a.d=(mod+a.d-b%mod)%mod; return a; }
	public static Mint operator -(Mint a,Mint b) { a.d=(mod+a.d-b.d)%mod; return a; }
	public static Mint operator *(Mint a,long b) { a.d=b%mod*a.d%mod; return a; }
	public static Mint operator *(Mint a,Mint b) { a.d=a.d*b.d%mod; return a; }
	public static Mint operator /(Mint a,long b) { a.d=a.d*Mi(b)%mod; return a; }
	public static Mint operator /(Mint a,Mint b) { a.d=a.d*Mi(b.d)%mod; return a; }
	public static bool operator ==(Mint a,long b) { return (long)a==b; }
	public static bool operator !=(Mint a,long b) { return (long)a!=b; }
	public override bool Equals(object obj) { return false; }
	public override int GetHashCode() { return 0; }
	public static long Mi(long a) {
		a=(a+mod)%mod;
		long b = mod, u = 1, v = 0;
		while(b>0) {
			long t = a/b;
			a-=t*b; (a, b)=(b, a);
			u-=t*v; (u, v)=(v, u);
		}
		u%=mod;
		if(u<0) { u+=mod; }
		return u%mod;
	}
}
static class MintEx {
	public static Mint Sum(this IEnumerable<Mint> source) {
		Mint num = 0;
		foreach(Mint item in source) { num+=item; }
		return num;
	}
}
public class Osak {
	public int[] b;
	public Osak(int n) {
		b=new int[n+1];
		int m = (int)Sqrt(n);
		for(int i = 2;i<=m;i++) {
			if(b[i]==0) {
				for(int j = i*i;j<=n;j+=i) {
					if(b[j]==0) { b[j]=i; }
				}
			}
		}
	}
	public bool this[int i] { get { return b[i]==0; } }
	public void Pf(int n,Action<int> f) {
		if(n==1) { return; }
		while(b[n]!=0) {
			f(b[n]);
			n/=b[n];
		}
		f(n);
	}
	public void Pf2(int n,Action<int,int> f) {
		if(n==1) { return; }
		int g = b[n], p = 0;
		while(b[n]!=0) {
			if(b[n]!=g) {
				f(g,p);
				g=b[n];
				p=0;
			}
			p++;
			n/=b[n];
		}
		if(g!=n&&g!=0) {
			f(g,p);
			p=0;
		}
		f(n,p+1);
	}
}
public class Pt{
	private StringBuilder sb=new StringBuilder();
	public Pt(Action<Pt> f){f(this);}
	public void W(int s){sb.Append(s);}
	public void W(long s){sb.Append(s);}
	public void W(double s){sb.Append(s);}
	public void W(decimal s){sb.Append(s);}
	public void W(char s){sb.Append(s);}
	public void W(string s){sb.Append(s);}
	public void W(object s){sb.Append(s);}
	public void W(params object[] s){sb.Append(string.Join(" ",s));}
	public void Wl(int s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(long s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(double s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(decimal s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(char s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(string s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(object s){sb.Append(s).Append(Environment.NewLine);}
	public void Wl(int[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(long[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(double[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(string[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(params object[] s){sb.Append(string.Join(" ",s)).Append(Environment.NewLine);}
	public void Wl(){sb.Append(Environment.NewLine);}
	public void Sm(){Console.Write(sb);}
	public void Op(StreamWriter sw){
		sw.Write(sb);
		sw.Close();
	}
	public static bool operator==(Pt a,Pt b){return a.sb.ToString()==b.sb.ToString();}
	public static bool operator!=(Pt a,Pt b){return a.sb.ToString()!=b.sb.ToString();}
	public override bool Equals(object obj){return false;}
	public override int GetHashCode(){return 0;}
}
public class Sc{
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string Rl(){return Console.ReadLine();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected virtual string[] Sp(string st){return st.Split();}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
	public virtual int I{get{return int.Parse(Rl());}}
	public virtual long L{get{return long.Parse(Rl());}}
	public virtual double D{get{return double.Parse(Rl());}}
	public virtual string S{get{return Rl();}}
	public int[] Ia{get{return Array.ConvertAll(Sp(Rl()),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Sp(Rl()),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Sp(Rl()),double.Parse);}}
	public string[] Sa{get{return Sp(Rl());}}
	public object[] Oa{get{return Sp(Rl());}}
	public int[] Ia2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),int.Parse);}}
	public int[] Ia3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),int.Parse);}
	public int[] Ia3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),long.Parse);}}
	public long[] La3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),long.Parse);}
	public long[] La3(int a){return Array.ConvertAll(Sp(Rl()+" "+a.ToString()),long.Parse);}
	public double[] Da2{get{return Array.ConvertAll(Sp("0 "+Rl()+" 0"),double.Parse);}}
	public double[] Da3(string a,string b){return Array.ConvertAll(Sp(a+Rl()+b),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(Sp(Rl()));}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,Sp(Rl()));}return a;}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T) Tp2<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T) Tp3<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T) Tp4<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T) Tp5<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T,T,T,T,T,T) Tp6<T>(){var s=Sp(Rl());return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]),Ct<T>(s[4]),Ct<T>(s[5]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T2) Tp2<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	public (T1,T1,T2) Tp3<T1,T2>(){var s=Sp(Rl());return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
}
public class Scr:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	private bool bo=false;
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){
		if(bo){return li[l++%li.Count];}
		li.Add(Console.ReadLine());
		return li[li.Count-1];
	}
	public void Again(){bo=true;}
}
public class Scs:Sc{
	private StreamReader sr;
	public Scs(string t){sr=new StreamReader(t);}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){return sr.ReadLine();}
	public void Close(){sr.Close();}
}
public class Sc2:Sc{
	private string[] sps=new string[]{" ","　","\t"};
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string[] Sp(string st){return st.Split(sps,StringSplitOptions.RemoveEmptyEntries);}
	public override int I{get{return int.Parse(Sp(Rl())[0]);}}
	public override long L{get{return long.Parse(Sp(Rl())[0]);}}
	public override double D{get{return double.Parse(Sp(Rl())[0]);}}
	public override string S{get{return Sp(Rl())[0];}}
}
public class Scs2:Sc2{
	private StreamReader sr;
	public Scs2(string t){sr=new StreamReader(t);}
	[MethodImpl(MethodImplOptions.AggressiveInlining)]
	protected override string Rl(){return sr.ReadLine();}
	public void Close(){sr.Close();}
}
public class Sct:Sc{
	private List<string> li=new List<string>();
	private int l=0;
	public void Add(int s){li.Add(s.ToString());}
	public void Add(long s){li.Add(s.ToString());}
	public void Add(double s){li.Add(s.ToString());}
	public void Add(string s){li.Add(s.ToString());}
	public void Add(object s){li.Add(s.ToString());}
	public void Add(int[] s){li.Add(string.Join(" ",s));}
	public void Add(long[] s){li.Add(string.Join(" ",s));}
	public void Add(double[] s){li.Add(string.Join(" ",s));}
	public void Add(string[] s){li.Add(string.Join(" ",s));}
	public void Add(params object[] s){li.Add(string.Join(" ",s));}
	protected override string Rl(){return li[l++];}
	public void Clear(){li.Clear();l=0;}
	public void Again(){l=0;}
	public void Pf(){Console.WriteLine(string.Join("\n",li));}
}
0