結果
| 問題 | 
                            No.349 干支の置き物
                             | 
                    
| コンテスト | |
| ユーザー | 
                             yuya178
                         | 
                    
| 提出日時 | 2017-06-20 06:24:13 | 
| 言語 | Java  (openjdk 23)  | 
                    
| 結果 | 
                             
                                AC
                                 
                             
                            
                         | 
                    
| 実行時間 | 57 ms / 2,000 ms | 
| コード長 | 2,342 bytes | 
| コンパイル時間 | 2,072 ms | 
| コンパイル使用メモリ | 77,952 KB | 
| 実行使用メモリ | 37,324 KB | 
| 最終ジャッジ日時 | 2024-10-02 08:02:46 | 
| 合計ジャッジ時間 | 4,860 ms | 
| 
                            ジャッジサーバーID (参考情報)  | 
                        judge4 / judge2 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| sample | AC * 3 | 
| other | AC * 29 | 
ソースコード
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.OutputStream;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Task solver = new Task();
        solver.solve(1, in, out);
        out.close();
    }
    static class Task {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int N = in.nextInt();
            String eto[] ={"ne","ushi","tora","u","tatsu","mi","uma","hitsuji","saru","tori","inu","i"};
            int count[] = new int[12];
            for(int i=0; i<N; i++){
                String s = in.next();
                for(int j=0; j<12; j++){
                    if(s.equals(eto[j])){
                        count[j]++;
                    }
                }
            }
            for(int i=0; i<12; i++){
                if(count[i]>(N+1)/2){
                    out.println("NO");
                    return;
                }
            }
            out.println("YES");
        }
    }
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}
            
            
            
        
            
yuya178