結果

問題 No.43 野球の試合
ユーザー amyuamyu
提出日時 2015-12-18 13:41:33
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,232 bytes
コンパイル時間 2,532 ms
コンパイル使用メモリ 79,296 KB
実行使用メモリ 49,880 KB
最終ジャッジ日時 2024-09-16 08:30:52
合計ジャッジ時間 4,012 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,032 KB
testcase_01 AC 53 ms
36,832 KB
testcase_02 AC 52 ms
36,876 KB
testcase_03 AC 53 ms
36,748 KB
testcase_04 AC 53 ms
36,400 KB
testcase_05 AC 52 ms
36,768 KB
testcase_06 AC 53 ms
36,784 KB
testcase_07 AC 55 ms
36,788 KB
testcase_08 AC 52 ms
36,876 KB
testcase_09 AC 53 ms
36,552 KB
testcase_10 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main{
    static final Reader sc = new Reader();
    static final PrintWriter out = new PrintWriter(System.out,false);

    public static void main(String[] args) throws Exception {
    	int n = sc.nextInt();
    	boolean[][] map = new boolean[n][n];
    	int[] rank = new int[n];
    	ArrayList<Point> list = new ArrayList<Point>();
    	for(int i=0;i<n;i++){
    		String str = sc.next();
    		for(int j=0;j<n;j++){
    			if(i==j){
    				continue;
    			}
    			if(map[i][j]){
    				continue;
    			}
    			if(i==0 && str.charAt(j)=='-'){
    				rank[i]++;
    				map[i][j] = true;
    				map[j][i] = true;
    			}
    			else if(str.charAt(j)=='x'){
    				rank[j]++;
    				map[i][j] = true;
    				map[j][i] = true;
    			}
    			else if(str.charAt(j)=='o'){
    				rank[i]++;
    				map[i][j] = true;
    				map[j][i] = true;
    			}
    			else{
    				Point p = new Point(i,j);
    				list.add(p);
    				map[i][j] = true;
    				map[j][i] = true;
    			}
    		}
    	}
    	int ans = 10;
    	int k = (int)Math.pow(2,list.size());
    	for(int i=0;i<k;i++){
    		int[] xrank = new int[10];
    		int[] num = new int[10];
    		for(int j=0;j<list.size();j++){
    			Point p = list.get(j);
    			int a = i>>>j;
    			if((a & 1) == 1){
    				xrank[p.x]++;
    			}
    			else{
    				xrank[p.y]++;
    			}
    		}
    		for(int j=0;j<n;j++){
    			num[rank[j]+xrank[j]]++;
    		}
    		int r = 1;
    		for(int j=9;j>=0;j--){
    			if(num[j]!=0 && j!=rank[0]){
    				r++;
    			}
    			else if(j==rank[0]){
    				break;
    			}
    		}
    		ans = Math.min(ans,r);
    	}
    	if(k==1){
    		int[] num = new int[10];
    		for(int i=0;i<n;i++){
    			num[rank[i]]++;
    		}
    		ans = 1;
    		for(int i=9;i>=0;i--){
    			if(num[i]!=0 && i!=rank[0]){
    				ans++;
    			}
    			else if(i==rank[0]){
    				break;
    			}
    		}
    	}
    	out.println(ans);
    	out.flush();
        sc.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}

class Point{
	int x;
	int y;
	Point(int x,int y){
		this.x = x;
		this.y = y;
	}
}

class Reader {

    private final InputStream in;
    private final byte[] buf = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    public Reader() { this(System.in);}
    public Reader(InputStream source) { this.in = source;}

    private boolean hasNextByte() {
        if (ptr < buflen) return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0) return false;
        return true;
    }

    private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    public boolean hasNext() {skip(); return hasNextByte();}

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

    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }

        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    public int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    public String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    public int[] nextIntArray(int n) {
        int[] res = new int[n];
        for (int i=0; i<n; i++) res[i] = nextInt();
        return res;
    }

    public char[] nextCharArray(int n) {
        char[] res = new char[n];
        for (int i=0; i<n; i++) res[i] = nextChar();
        return res;
    }

    public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
0