結果

問題 No.24 数当てゲーム
ユーザー amyu
提出日時 2015-12-01 19:02:48
言語 Java
(openjdk 23)
結果
AC  
実行時間 54 ms / 5,000 ms
コード長 4,581 bytes
コンパイル時間 2,924 ms
コンパイル使用メモリ 78,860 KB
実行使用メモリ 37,068 KB
最終ジャッジ日時 2024-09-14 05:45:57
合計ジャッジ時間 3,593 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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 {
        boolean[] judge1 = new boolean[10];
        boolean[] judge2 = new boolean[10];
        boolean flag = false;
        int n = sc.nextInt();
        for(int i=0;i<n;i++){
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();
            String r = sc.next();
            if(r.charAt(0)=='N'){
                judge1[a] = true;
                judge1[b] = true;
                judge1[c] = true;
                judge1[d] = true;
            }
            else{
                if(flag){
                    for(int j=0;j<10;j++){
                        if(j==a || j==b || j==c || j==d){
                            
                        }
                        else{
                            judge2[j] = false;
                        }
                    }
                }
                else{
                    flag = true;
                    judge2[a] = true;
                    judge2[b] = true;
                    judge2[c] = true;
                    judge2[d] = true;
                }
            }
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        for(int i=0;i<10;i++){
            if(!judge1[i]){
                list.add(i);
            }
        }
        if(list.size()!=1){
            for(int i=0;i<list.size();i++){
                int x = list.get(i);
                if(judge2[x]){
                    out.println(x);
                    out.flush();
                }
            }
        }
        else{
            out.println(list.get(0));
            out.flush();
        }
        sc.close();
        out.close();
    }
    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}
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();}};
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0