結果

問題 No.625 ソンタクロース
コンテスト
ユーザー yuya178
提出日時 2017-12-25 10:19:37
言語 Java
(openjdk 23)
結果
AC  
実行時間 289 ms / 4,000 ms
コード長 5,102 bytes
コンパイル時間 2,952 ms
コンパイル使用メモリ 82,656 KB
実行使用メモリ 57,192 KB
最終ジャッジ日時 2024-12-17 19:34:42
合計ジャッジ時間 6,417 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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 = 998244353;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        int n = ni();
        int m = ni();
        int[] res = new int[n];
        int[] resc = new int[n];
        res[0] = m;
        resc[0] = m;
        List<int[]> list1 = new ArrayList<>();
        for(int i = 0; i < n; i++){
            int nokori = m;
            int count = 0;
            Collections.sort(list1, new Comparator<int[]>() {
                public int compare(int[] a, int[] b) {
                    if(a[1] != b[1])return Integer.compare(a[1],b[1]);
                    return Integer.compare(a[0],b[0]);
                }
            });
            // for(int[] r : list1){
            //     out.println(r[0]+" "+r[1]);
            // }
            for(int[] r : list1){
                count++;
                if((count)*2<=i+1){
                    resc[r[0]] = r[1] + 1;
                    nokori -= (r[1]+1);
                }
                else{
                    resc[r[0]] = 0;
                }
            }
            List<int[]> list2 = new ArrayList<>(); 
            if(nokori>=0){
                resc[i] = nokori;
                for(int j = 0; j < n; j++) res[j] = resc[j];
                for(int j = 0; j <= i; j++){
                    list2.add(new int[]{j, resc[j]});
                }
            }
            else{
                // out.println(1);
                res[i] = -1;
                for(int j = 0; j <= i; j++){
                    list2.add(new int[]{j, res[j]});
                }
            }
            list1 = list2;
        }
        Collections.sort(list1, new Comparator<int[]>() {
                public int compare(int[] a, int[] b) {
                    return -Integer.compare(a[0],b[0]);
                }
            });
        for(int[] r : list1){
            out.print(r[1]+" ");
        }
    }
    
    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)); }
 
}
0