結果

問題 No.326 あみだますたー
ユーザー threepipes_s
提出日時 2015-12-19 00:27:03
言語 Java
(openjdk 23)
結果
AC  
実行時間 282 ms / 2,000 ms
コード長 3,287 bytes
コンパイル時間 2,998 ms
コンパイル使用メモリ 92,428 KB
実行使用メモリ 48,312 KB
最終ジャッジ日時 2024-11-07 23:17:06
合計ジャッジ時間 8,583 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
 
public class Main {
    public static void main(String[] args) throws NumberFormatException,
    IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
    void dump(int[]a){for(int i=0;i<a.length;i++)
        System.out.print(a[i]+" ");System.out.println();};
    void solve() throws NumberFormatException, IOException{
        final ContestScanner in = new ContestScanner();
        Writer out = new Writer();
        int n = in.nextInt();
        int k = in.nextInt();
        int[] a = new int[n];
        for(int i=0; i<n; i++){
            a[i] = i;
        }
        for(int i=0; i<k; i++){
            int x = in.nextInt()-1;
            int y = in.nextInt()-1;
            int tmp = a[x];
            a[x] = a[y];
            a[y] = tmp;
        }
        int[] map = new int[n];
        for(int i=0; i<n; i++){
            map[a[i]] = i;
        }
        List<String> list = new ArrayList<>();
        int[] b = new int[n];
        for(int i=0; i<n; i++){
            b[in.nextInt()-1] = i;
        }
        for(int i=0; i<n; i++){
            for(int j=map[b[i]]; j>i; j--){
                list.add((j)+" "+(j+1));
                map[a[j]]--;
                map[a[j-1]]++;
                int tmp = a[j-1];
                a[j-1] = a[j];
                a[j] = tmp;
            }
        }
        System.out.println(list.size());
        for(String s: list) System.out.println(s);
    }
}
class MultiSet<T> extends HashMap<T, Integer>{
    @Override
    public Integer get(Object key){return containsKey(key)?super.get(key):0;}
    public void add(T key,int v){put(key,get(key)+v);}
    public void add(T key){put(key,get(key)+1);}
    public void sub(T key){
        final int num = get(key);
        if(num==1) remove(key);
        else put(key, num-1);
    }
}
class Timer{
    long time;
    public void set(){time = System.currentTimeMillis();}
    public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
    public Writer(String filename) throws IOException
    {super(new BufferedWriter(new FileWriter(filename)));}
    public Writer() throws IOException{super(System.out);}
}
class ContestScanner {
    private BufferedReader reader;
    private String[] line;
    private int idx;
    public ContestScanner() throws FileNotFoundException 
    {reader = new BufferedReader(new InputStreamReader(System.in));}
    public ContestScanner(String filename) throws FileNotFoundException
    {reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
    public String nextToken() throws IOException {
        if (line == null || line.length <= idx) {
            line = reader.readLine().trim().split(" ");
            idx = 0;
        }
        return line[idx++];
    }
    public String readLine() throws IOException{return reader.readLine();}
    public long nextLong() throws IOException, NumberFormatException
    {return Long.parseLong(nextToken());}
    public int nextInt() throws NumberFormatException, IOException
    {return (int) nextLong();}
    public double nextDouble() throws NumberFormatException, IOException 
    {return Double.parseDouble(nextToken());}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0