結果

問題 No.326 あみだますたー
ユーザー yuya178yuya178
提出日時 2017-11-09 00:12:17
言語 Java21
(openjdk 21)
結果
AC  
実行時間 145 ms / 2,000 ms
コード長 4,978 bytes
コンパイル時間 2,551 ms
コンパイル使用メモリ 82,188 KB
実行使用メモリ 40,892 KB
最終ジャッジ日時 2024-05-03 07:54:48
合計ジャッジ時間 5,797 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,948 KB
testcase_01 AC 80 ms
37,904 KB
testcase_02 AC 90 ms
38,220 KB
testcase_03 AC 120 ms
38,848 KB
testcase_04 AC 105 ms
38,752 KB
testcase_05 AC 47 ms
36,680 KB
testcase_06 AC 91 ms
39,848 KB
testcase_07 AC 49 ms
36,808 KB
testcase_08 AC 131 ms
40,304 KB
testcase_09 AC 133 ms
40,892 KB
testcase_10 AC 145 ms
40,700 KB
testcase_11 AC 75 ms
38,288 KB
testcase_12 AC 97 ms
38,696 KB
testcase_13 AC 103 ms
38,504 KB
testcase_14 AC 90 ms
38,196 KB
testcase_15 AC 75 ms
38,088 KB
testcase_16 AC 74 ms
37,856 KB
testcase_17 AC 94 ms
38,412 KB
testcase_18 AC 96 ms
38,216 KB
testcase_19 AC 78 ms
39,744 KB
testcase_20 AC 68 ms
37,880 KB
testcase_21 AC 71 ms
38,188 KB
testcase_22 AC 90 ms
40,200 KB
testcase_23 AC 110 ms
39,032 KB
testcase_24 AC 95 ms
40,064 KB
testcase_25 AC 111 ms
40,320 KB
testcase_26 AC 81 ms
38,156 KB
testcase_27 AC 107 ms
40,060 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1000_000_007;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        int n = ni();
        int k = ni();
        int[] f = new int[n];
        for(int i = 0; i < n; i++){
            f[i] = i;
        }
        for(int i = 0; i < k; i++){
            int x = ni()-1;
            int y = ni()-1;
            int d = f[x];
            f[x] = f[y];
            f[y] = d;
        }
        int[] b = new int[n];
        for(int i = 0; i < n; i++){
            b[ni()-1] = i;
        }
        ArrayList<Integer> list = new ArrayList<>();
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                if(f[j]==b[i]){
                    for(int l = j; l > i; l--){
                        int d = f[l];
                        f[l] = f[l-1];
                        f[l-1] = d;
                        list.add(l);
                    }
                    break;
                }
            }
        }
        out.println(list.size());
        for(int i : list){
            out.println(i + " " + (i+1));
        }


    }

    private long pow(long a, long n, long MOD) {
        a %= MOD;
        if (a == 0) {
            return 0;
        }

        long loop = n;
        long ret = 1;
        long x = a;
        while (loop > 0) {
            if (loop % 2 == 1) {
                ret = ret * x % MOD;
            }
            x = x * x % MOD;
            loop /= 2;
        }

        return ret;
    }
 
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0