結果

問題 No.1885 Flat Permutation
ユーザー 37zigen
提出日時 2022-03-25 22:24:09
言語 Java
(openjdk 23)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 3,378 bytes
コンパイル時間 4,473 ms
コンパイル使用メモリ 77,192 KB
実行使用メモリ 51,868 KB
最終ジャッジ日時 2024-10-14 06:19:44
合計ジャッジ時間 6,284 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

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

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();
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0