結果
問題 | No.1885 Flat Permutation |
ユーザー | 37zigen |
提出日時 | 2022-03-25 22:24:09 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 3,378 bytes |
コンパイル時間 | 3,187 ms |
コンパイル使用メモリ | 74,248 KB |
実行使用メモリ | 49,812 KB |
最終ジャッジ日時 | 2023-08-04 09:20:14 |
合計ジャッジ時間 | 6,782 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,128 KB |
testcase_01 | AC | 43 ms
49,272 KB |
testcase_02 | AC | 43 ms
49,356 KB |
testcase_03 | AC | 44 ms
49,188 KB |
testcase_04 | AC | 43 ms
49,280 KB |
testcase_05 | AC | 43 ms
49,616 KB |
testcase_06 | AC | 43 ms
49,444 KB |
testcase_07 | AC | 42 ms
49,464 KB |
testcase_08 | AC | 43 ms
49,360 KB |
testcase_09 | AC | 41 ms
49,216 KB |
testcase_10 | AC | 42 ms
49,260 KB |
testcase_11 | AC | 41 ms
49,204 KB |
testcase_12 | AC | 42 ms
49,140 KB |
testcase_13 | AC | 42 ms
47,168 KB |
testcase_14 | AC | 43 ms
49,204 KB |
testcase_15 | AC | 41 ms
49,408 KB |
testcase_16 | AC | 43 ms
49,556 KB |
testcase_17 | AC | 43 ms
49,372 KB |
testcase_18 | AC | 43 ms
49,164 KB |
testcase_19 | AC | 43 ms
49,496 KB |
testcase_20 | AC | 42 ms
49,548 KB |
testcase_21 | AC | 41 ms
49,060 KB |
testcase_22 | AC | 42 ms
49,708 KB |
testcase_23 | AC | 42 ms
49,200 KB |
testcase_24 | AC | 42 ms
49,288 KB |
testcase_25 | AC | 43 ms
49,140 KB |
testcase_26 | AC | 42 ms
49,200 KB |
testcase_27 | AC | 43 ms
49,244 KB |
testcase_28 | AC | 42 ms
49,244 KB |
testcase_29 | AC | 43 ms
49,272 KB |
testcase_30 | AC | 43 ms
49,052 KB |
testcase_31 | AC | 42 ms
47,740 KB |
testcase_32 | AC | 43 ms
49,444 KB |
testcase_33 | AC | 41 ms
49,208 KB |
testcase_34 | AC | 42 ms
49,220 KB |
testcase_35 | AC | 41 ms
49,812 KB |
testcase_36 | AC | 42 ms
49,528 KB |
testcase_37 | AC | 42 ms
49,144 KB |
testcase_38 | AC | 42 ms
49,192 KB |
testcase_39 | AC | 42 ms
49,044 KB |
testcase_40 | AC | 41 ms
49,276 KB |
testcase_41 | AC | 42 ms
49,252 KB |
testcase_42 | AC | 43 ms
49,748 KB |
testcase_43 | AC | 45 ms
49,432 KB |
testcase_44 | AC | 45 ms
49,144 KB |
testcase_45 | AC | 44 ms
49,232 KB |
testcase_46 | AC | 44 ms
49,036 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; public class Main implements Runnable { public static void main(String[] args) { new Main().run(); } public void run() { solve(); } long[][] mul(long[][] a, long[][] b) { if (a==null) return b; if (b==null) return a; long[][] c=new long[a.length][b[0].length]; for (int i=0;i<a.length;++i) { for (int j=0;j<b[i].length;++j) { for (int k=0;k<a[i].length;++k) { c[i][j]+=a[i][k]*b[k][j]%mod; c[i][j]%=mod; } } } return c; } long[][] pow(long[][] a, long n) { if (n==0) return null; long[][] ret=pow(mul(a, a), n/2); if (n%2==1) ret=mul(ret, a); return ret; } final long mod=998244353; void solve() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt(); int X=sc.nextInt(); int Y=sc.nextInt(); if (X>Y) { X^=Y;Y^=X;X^=Y; } if (X!=1) { X=X+1; } if (Y!=N) { Y=Y-1; } if (X>Y) { System.out.println(0); return; } N=Y-X+1; long[][] a=new long[][] {{1, 0, 1}, {1, 0, 0}, {0, 1, 0}}; long[][] v=new long[][] {{1},{1},{1}}; a=pow(a, N-1); a=mul(a, v); System.out.println(a[2][0]); pw.close(); } static void tr(Object...objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } }