Submission #302972
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.InputMismatchException; import java.util.List; import java.util.Map; public class Main { static StringBuilder out = new StringBuilder(); static String ls = System.lineSeparator(); static final String OK = "Possible"; static final String NG = "Impossible"; static FastReader fr = new FastReader(); // static final int INF = Integer.MAX_VALUE - 300000000; public static void main(String[] args) throws Exception, IOException { int n = fr.nextInt(); Map<String, Integer> counts = new HashMap<>(); for (int i = 0; i < n; i++) { String poll = fr.next(); if (counts.containsKey(poll)) { counts.put(poll, counts.get(poll) + 1); } else counts.put(poll, 1); } int max = 0; String win = null; for (String name : counts.keySet()) { int count = counts.get(name); if (max < count) { win = name; max = count; } } System.out.println(win); } static void printExit(String msg) { System.out.println(msg); System.exit(0); } } class FastReader { private InputStream in = System.in; private byte[] buf = new byte[1024]; private int charNum; private int charLen; private StringBuilder sb = new StringBuilder(); public int read() { if (charLen == -1) throw new InputMismatchException(); if (charNum >= charLen) { charNum = 0; try { charLen = in.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (charLen <= 0) return -1; } return buf[charNum++]; } public String next() { int c = read(); while (isWhitespace(c)) { c = read(); } sb.setLength(0); do { sb.appendCodePoint(c); c = read(); } while (!isWhitespace(c)); return sb.toString(); } public char[] nextCharArray() { return next().toCharArray(); } public int nextInt() { return (int) nextLong(); } public int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } public List<Integer> nextIntList(int n) { Integer[] array = new Integer[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return Arrays.asList(array); } public int[][] nextIntArray2D(int n, int m) { int[][] array = new int[n][m]; for (int i = 0; i < n; i++) array[i] = nextIntArray(m); return array; } public List<int[]> nextIntsList(int n, int m) { List<int[]> list = new ArrayList<>(n); for (int i = 0; i < n; i++) list.add(nextIntArray(m)); return list; } public long nextLong() { int c = read(); while (isWhitespace(c)) { c = read(); } int sgn = 1; if (c == '-') { sgn = -1; c = read(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res *= 10; res += c - '0'; c = read(); } while (!isWhitespace(c)); return res * sgn; } public double nextDouble() { return Double.parseDouble(next()); } public double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } public boolean isWhitespace(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | toiro |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 3443 Byte |
Status | AC |
Exec Time | 415 ms |
Memory | 20532 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
case_01.txt | AC | 410 ms | 20400 KB |
case_02.txt | AC | 395 ms | 20396 KB |
case_03.txt | AC | 386 ms | 20396 KB |
case_04.txt | AC | 383 ms | 20448 KB |
case_05.txt | AC | 385 ms | 20408 KB |
case_06.txt | AC | 391 ms | 20468 KB |
case_07.txt | AC | 396 ms | 20472 KB |
case_08.txt | AC | 384 ms | 20468 KB |
case_09.txt | AC | 398 ms | 20516 KB |
case_10.txt | AC | 402 ms | 20372 KB |
case_11.txt | AC | 415 ms | 20532 KB |
case_12.txt | AC | 408 ms | 20388 KB |
case_13.txt | AC | 405 ms | 20396 KB |
case_14.txt | AC | 409 ms | 20452 KB |
case_15.txt | AC | 402 ms | 20512 KB |
sample_01.txt | AC | 392 ms | 20484 KB |
sample_02.txt | AC | 386 ms | 20488 KB |
sample_03.txt | AC | 408 ms | 20420 KB |