#910276 (Java) No.2453 Seat Allocation

• 問題: No.2453 Seat Allocation
• ユーザー: Asahi
• 提出日時: 2023-09-01 23:42:50
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 435 ms / 2,000 ms
• コード長: 5,565 bytes
• コンパイル時間: 3,520 ms
• コンパイル使用メモリ: 99,692 KB
• 実行使用メモリ: 60,176 KB
• 最終ジャッジ日時: 2025-06-20 01:48:10
• 合計ジャッジ時間: 10,412 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 23

ソースコード

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