結果

問題 No.326 あみだますたー
ユーザー yuya178yuya178
提出日時 2017-11-08 23:09:32
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,115 bytes
コンパイル時間 2,640 ms
コンパイル使用メモリ 80,624 KB
実行使用メモリ 41,672 KB
最終ジャッジ日時 2024-05-03 07:54:21
合計ジャッジ時間 9,696 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,104 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 54 ms
36,996 KB
testcase_06 AC 124 ms
40,492 KB
testcase_07 AC 59 ms
37,396 KB
testcase_08 AC 166 ms
41,196 KB
testcase_09 AC 177 ms
41,292 KB
testcase_10 AC 178 ms
41,416 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 95 ms
40,236 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 82 ms
38,768 KB
testcase_21 AC 81 ms
38,624 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
権限があれば一括ダウンロードができます

ソースコード

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[][] x = new int[20000][2];
        for(int i = 0; i < k; i++){
            x[i] = new int[]{ni(), ni()};
        }
        int[] g = new int[n+1];
        for(int i = 0; i < n; i++){
            g[i+1] = ni();
        }
        int total = k;
        for(int i = 1; i <= n; i++){
            int cur = i;
            for(int j = 0; j < total; j++){
                if(x[j][0]==cur){
                    cur = x[j][1];
                }
                else if(x[j][1] == cur){
                    cur = x[j][0];
                }
            }
            while(cur!=g[i]){
                if(cur>g[i]){
                    x[total][0] = cur-1;
                    x[total][1] = cur;
                    cur--;
                }
                else if(cur<g[i]){
                    x[total][0] = cur;
                    x[total][1] = cur+1;
                    cur++;
                }
                total++;
            }
        }
        out.println(total-k);
        for(int i = k; i < total; i++){
            out.println(x[i][0]+" "+x[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