結果

問題 No.397 NO MORE KADOMATSU
ユーザー yuya178yuya178
提出日時 2017-11-26 23:36:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 109 ms / 2,000 ms
コード長 4,477 bytes
コンパイル時間 4,094 ms
コンパイル使用メモリ 89,720 KB
実行使用メモリ 70,164 KB
平均クエリ数 36.83
最終ジャッジ日時 2024-07-17 01:32:28
合計ジャッジ時間 5,151 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 106 ms
69,364 KB
testcase_01 AC 104 ms
69,156 KB
testcase_02 AC 70 ms
66,880 KB
testcase_03 AC 104 ms
69,376 KB
testcase_04 AC 99 ms
69,320 KB
testcase_05 AC 97 ms
69,788 KB
testcase_06 AC 106 ms
69,576 KB
testcase_07 AC 106 ms
70,000 KB
testcase_08 AC 97 ms
69,352 KB
testcase_09 AC 67 ms
66,456 KB
testcase_10 AC 100 ms
69,616 KB
testcase_11 AC 70 ms
67,032 KB
testcase_12 AC 98 ms
70,164 KB
testcase_13 AC 98 ms
69,476 KB
testcase_14 AC 109 ms
69,664 KB
testcase_15 AC 109 ms
69,160 KB
testcase_16 AC 67 ms
66,868 KB
testcase_17 AC 66 ms
67,056 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

    long MOD = 1_000_000_007;
    void solve()
    {
        int n = ni();
        int[] a = new int[n];
        for(int i = 0; i < n ;i++){
            a[i] = ni();
        }
        int[][] res = new int[1000][2];
        int s = 0;
        int ans = 0;
        while(s<n){
            int min = 1000;
            int c = 0;
            for(int i = s; i < n; i++){
                if(a[i]<min){
                    min = a[i];
                    c = i;
                }
            }
            if(s==c){
                s++;
                continue;
            }
            res[ans][0] = s;
            res[ans][1] = c;            
            int tmp = a[s];
            a[s] = a[c];
            a[c] = tmp;
            s++;
            ans++;
        }
        out.println(ans);
        for(int i = 0; i < ans; i++){
            out.println(res[i][0] + " " + res[i][1]);
        }
        out.flush();
        int d = ni();
    }

    
    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