結果

問題 No.2453 Seat Allocation
ユーザー AsahiAsahi
提出日時 2023-09-01 23:42:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 472 ms / 2,000 ms
コード長 5,565 bytes
コンパイル時間 3,042 ms
コンパイル使用メモリ 92,040 KB
実行使用メモリ 61,008 KB
最終ジャッジ日時 2024-06-25 09:36:07
合計ジャッジ時間 9,980 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,128 KB
testcase_01 AC 54 ms
37,384 KB
testcase_02 AC 53 ms
37,508 KB
testcase_03 AC 54 ms
37,568 KB
testcase_04 AC 56 ms
37,724 KB
testcase_05 AC 321 ms
54,860 KB
testcase_06 AC 220 ms
44,584 KB
testcase_07 AC 157 ms
49,100 KB
testcase_08 AC 126 ms
40,988 KB
testcase_09 AC 374 ms
55,044 KB
testcase_10 AC 427 ms
57,348 KB
testcase_11 AC 472 ms
61,008 KB
testcase_12 AC 212 ms
44,272 KB
testcase_13 AC 233 ms
44,880 KB
testcase_14 AC 202 ms
44,464 KB
testcase_15 AC 253 ms
45,236 KB
testcase_16 AC 231 ms
44,572 KB
testcase_17 AC 58 ms
37,380 KB
testcase_18 AC 326 ms
50,420 KB
testcase_19 AC 363 ms
53,464 KB
testcase_20 AC 214 ms
45,708 KB
testcase_21 AC 249 ms
44,908 KB
testcase_22 AC 304 ms
47,656 KB
testcase_23 AC 56 ms
37,548 KB
testcase_24 AC 54 ms
37,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main implements Runnable{

    // introduced in Java 16
    record pair(long first , int second) { } 
    record problem(long a , long b , int number , int index) { }
    
    void solve() {  
        int n = in.nextInt() , m = in.nextInt();
        long [] A = in.LongArray(n);
        long [] B = in.LongArray(m);
        Comparator<problem> comp = new Comparator<>() {
            @Override
            public int compare(problem o1 , problem o2) {
                long l = (long) o1.a * o2.b ;
                long r = (long) o2.a * o1.b ;
                return l == r ? Integer.compare(o1.number, o2.number) : Long.compare(r , l); 
            }
        };
        PriorityQueue<problem> Q = new PriorityQueue<>(comp);
        for(int i = 0 ; i < n ; i ++ ) {
            Q.add(new problem(A[i], B[0] , i , 0 ));
        }
        for(int i = 0 ; i < m ; i ++ ) {
            var now = Q.poll();
            out.println(now.number + 1);
            if(now.index + 1 < m) Q.add(new problem(A[now.number], B[now.index + 1], now.number, now.index + 1));
        }
    }  

    public static void main(String[] args) {
        new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); 
    }

    public void run() {   
        solve();
        out.flush();
    }
    
    PrintWriter out = new PrintWriter(System.out);
    In in = new In();

}

class In{

    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;
    }

    public boolean hasNext() { 
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++; 
        }
        return hasNextByte();
    }

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

    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();
        }
    }
    int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    char nextChar() {
        return next().charAt(0);
    }
    
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
    char [][] CharArray2(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                Array[i][j] = next().charAt(0);
            }
        }
        return Array;
    }
    List<Integer> [] Graph(int n) {
        @SuppressWarnings("unchecked")
        List<Integer> [] G = new ArrayList[n];
        for(int i = 0 ; i < n ; i ++ ) {
            G[i] = new ArrayList<>();
        }
        return G ;
    }
}
0