結果

問題 No.43 野球の試合
ユーザー yuya178
提出日時 2017-11-21 17:34:16
言語 Java
(openjdk 23)
結果
AC  
実行時間 862 ms / 5,000 ms
コード長 5,184 bytes
コンパイル時間 2,344 ms
コンパイル使用メモリ 82,696 KB
実行使用メモリ 56,072 KB
最終ジャッジ日時 2024-11-26 08:17:02
合計ジャッジ時間 6,609 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 7
権限があれば一括ダウンロードができます

ソースコード

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;
    int inf = 10000000;
    void solve()
    {
        int n = ni();
        char[][] map = nm(n,n);
        char[][] map2 = new char[n][n];
        int total = (n+1)*n/2;
        int ans = n;
        for(int i = 0; i < (1<<total); i++){
            for(int j = 0; j < total; j++){
                int x = 0;
                int y = j;
                for(int k = 1; k < n ; k++){
                    if(y>n-k){
                        y -= (n-k+1);
                        x++;
                    }
                    else break;
                }
                y += x;
                if(map[x][y]!='-'){
                    map2[x][y] = map[x][y];
                    map2[y][x] = map[y][x];
                    continue;
                }
                if(((i>>j) & 1) == 1){
                    map2[x][y] = 'o';
                    map2[y][x] = 'x';
                }
                else{
                    map2[x][y] = 'x';
                    map2[y][x] = 'o';
                }
            }
            int[] w = new int[n];
            for(int k = 0; k < n; k++){
                for(int l = 0; l < n; l++){
                    if(map2[k][l]=='o') w[k]++;
                }
            }
            int z = w[0];
            Arrays.sort(w);
            int res = 0;
            int prev = 0;
            for(int k = n-1; k >= 0; k--){
                if(w[k]!=prev) res++;
                if(z==w[k]){
                    break;
                }
                prev = w[k];
            }
            if(res<ans){
                ans = res;
            }
        }
        out.println(ans);
    }
   
    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);
        } 
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0