結果

問題 No.1709 Indistinguishable by MEX
ユーザー fgwiebfaoishfgwiebfaoish
提出日時 2021-10-15 22:31:14
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 154 ms / 2,000 ms
コード長 5,676 bytes
コンパイル時間 4,138 ms
コンパイル使用メモリ 108,800 KB
実行使用メモリ 44,032 KB
最終ジャッジ日時 2024-09-17 17:43:15
合計ジャッジ時間 8,145 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
//using nint=System.Int32;
static class Program{
const int mod=(int)1e9+7;
static void Main(){
Sc sc=new Sc();
//var (n,m)=sc.Tp2<int>();
var n=sc.I;
var a=sc.Ia;
var h=new int[n];
var b=new bool[n+1];
for(int i = 0;i<n;i++) {h[a[i]]=i;}
var g=h[0];
b[0]=true;
Cb c=new Cb(n<<1);
Mint ans=1;
for(int i = 1,l=g,r=g;i<n;i++) {
if(g<h[i]){
g=r+1;
for(int j = g;j<=h[i];j++) {b[a[j]]=true;}
r=h[i];
}
else{
g=l-1;
for(int j = g;j>=h[i];j--) {b[a[j]]=true;}
l=h[i];
}
int p=0,d=i;
while(b[i+1]){
i++;
p++;
}
ans*=c.C1(r-l-d,p)*c.r[p];
}
Console.WriteLine("{0}",ans);
}
}
public class Cb{
private const int mod=998244353;
public long[] r,f,v;
public Cb(int n){
r=new long[n];
f=new long[n];
v=new long[n];
r[0]=r[1]=f[0]=f[1]=v[1]=1;
for(int i=2;i<n;i++){
r[i]=r[i-1]*i%mod;
v[i]=mod-v[mod%i]*(mod/i)%mod;
f[i]=f[i-1]*v[i]%mod;
}
}
public long C1(long n,long k){return r[n]*(f[k]*f[n-k]%mod)%mod;}
public long C2(long n,long k){
long l=1;
n%=mod;
for(int i=1;i<=k;i++){l=l*(n-i+1)%mod;l=l*v[i]%mod;}
return l;
}
public long C3(long n,long k){return (r[n]*Mi(r[k]*r[n-k]))%mod;}
public long P1(long n,long k){return n>=k?r[n]*Mi(r[n-k])%mod:0;}
public 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;
}
}
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;
}
}
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]));}
public (T,T,T,T) Tp4<T>(){var s=Console.ReadLine().Split();return (Ct<T>(s[0]),Ct<T>(s[1]),Ct<T>(s[2]),Ct<T>(s[3]));}
public (T1,T2) Tp2<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T2>(s[1]));}
public (T1,T1,T2) Tp3<T1,T2>(){var s=Console.ReadLine().Split();return (Ct<T1>(s[0]),Ct<T1>(s[1]),Ct<T2>(s[2]));}
private T Ct<T>(string s){return (T)Convert.ChangeType(s,typeof(T));}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0