結果

問題 No.1709 Indistinguishable by MEX
ユーザー ripity
提出日時 2022-07-05 19:01:29
言語 Kotlin
(2.1.0)
結果
RE  
実行時間 -
コード長 4,206 bytes
コンパイル時間 17,838 ms
コンパイル使用メモリ 455,976 KB
実行使用メモリ 73,808 KB
最終ジャッジ日時 2024-12-16 04:02:14
合計ジャッジ時間 27,964 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample RE * 3
other AC * 1 RE * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*
import java.util.*
import kotlin.math.*
fun main() {
val T = nextInt()
repeat(T) {solve()}
pw.flush()
// solve()
// pw.flush()
}
fun solve() {
val P = 998244353L
val N = nextInt()
val p = nextIntarr(N)
val ip = permInv(p)
var l = N
var r = -1
var ans = 1L
for( i in 0 until N ) {
l = min(l, ip[i])
r = max(r, ip[i])
if( l != ip[i] && r != ip[i] ) {
ans *= (r-l+1)-i
ans %= P
}
}
pw.println(ans)
}
/* struct begin */
data class Cell(val r: Int, val c: Int)
data class Point(val x: Long, val y: Long)
data class Pii(val fi: Int, val se: Int)
data class Edge(val to: Int, val w: Long)
class BinaryIndexedTree(n: Int) {
val N = n
var a = Array<Long>(N+1) { 0L }
fun sum(l: Int, r: Int): Long = sumSub(r-1)-sumSub(l-1)
fun sumSub(i: Int): Long {
var idx = i+1
var res = 0L
while( idx > 0 ) {
res += a[idx]
idx -= idx and (-idx)
}
return res
}
fun add(i: Int, x: Long) {
var idx = i+1
while( idx <= N ) {
a[idx] += x
idx += idx and (-idx)
}
}
}
class UnionFind(n: Int) {
val N = n
var parent = Array<Int>(N) {it}
var rank = Array<Int>(N) {1}
fun root(x: Int): Int {
if( parent[x] == x ) {
return x
}else {
parent[x] = root(parent[x])
return parent[x]
}
}
fun unite(x: Int, y: Int) {
val rx = root(x)
val ry = root(y)
parent[ry] = rx
}
fun same(x: Int, y: Int): Boolean = (root(x) == root(y))
}
/* struct end */
/* math begin */
fun intceil(x: Double) = ceil(x).toInt()
fun intfloor(x: Double) = floor(x).toInt()
fun gcd(x: Long, y: Long): Long {
var a = max(abs(x), abs(y))
var b = min(abs(x), abs(y))
var r: Long
do {
r = a%b
a = b
b = r
}while( r > 0 )
return a
}
fun modpow(X: Long, T: Long, P: Long = 9223372036854775807L): Long {
var x = X
var t = T
if( t == 0L ) {
return 1L
}else {
var res = 1L
while( t > 0 ) {
if( t%2L == 1L ) {
res *= x
res %= P
t -= 1L
}
x *= x
x %= P
t /= 2
}
return res%P
}
}
/* math end */
/* utility begin */
fun cumulativeSum(a: LongArray): LongArray {
val N = a.size
var s = LongArray(N+1) { 0L }
for( i in 1..N ) {
s[i] = s[i-1]+a[i-1]
}
return s
}
fun rlowerBound(a: LongArray, x: Long): Int {
val N = a.size
var high = N-1
var low = 0
var mid: Int
while( low < high ) {
mid = (high+low+1)/2
if( a[mid] > x ) high = mid-1
else low = high
}
return high
}
fun lowerBound(a: LongArray, x: Long): Int {
val N = a.size
var high = N-1
var low = 0
var mid: Int
while( low < high ) {
mid = (high+low)/2
if( a[mid] < x ) low = mid+1
else high = mid
}
return low
}
fun permInv(p: IntArray): IntArray {
val N = p.size
var res = IntArray(N) { -1 }
for( i in 0 until N ) {
res[p[i]] = i
}
return res
}
/* utility end */
/* I/O begin */
var st = StringTokenizer("")
val br = System.`in`.bufferedReader()
val pw = PrintWriter(System.out, false)
fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()!!
fun nextDouble() = next().toDouble()
fun nextStrarr(n: Int) = Array<String>(n) { next() }
fun nextIntarr(n: Int, dec: Int = 0) = IntArray(n) { nextInt()-dec }
fun nextLongarr(n: Int, dec: Long = 0L) = LongArray(n) { nextLong()-dec }
fun next(): String {
while( !st.hasMoreTokens() ) st = StringTokenizer(br.readLine()!!)
return st.nextToken()
}
/* I/O end */
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0