Submission #1753883
Source Code Expand
import java.util.*; import java.io.*; public class Main { static IO io = new IO(); public static void main(String[] args) { int n = io.nextInt(); Map<String,Integer> k = new HashMap<>(); int max = 0; String ans = ""; for (int i=0; i<n; i++) { String ge = io.next(); if (k.containsKey(ge)) { k.replace(ge, k.get(ge)+1); if (k.get(ge)>max) { max = k.get(ge); ans = ge; } } else { k.put(ge, 1); if (k.get(ge)>max) { max = k.get(ge); ans = ge; } } } System.out.println(ans); //System.out.println(k.toString()); } static class IO extends PrintWriter { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public IO() { this(System.in);} public IO(InputStream source) { super(System.out); this.in = source;} private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private static boolean isNewLine(int c) { return c == '\n' || c == '\r';} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public boolean hasNextLine() { skipNewLine(); 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 char[] nextCharArray(int len) { if (!hasNext()) { throw new NoSuchElementException(); } char[] s = new char[len]; int i = 0; int b = readByte(); while(isPrintableChar(b)) { if (i == len) { throw new InputMismatchException(); } s[i++] = (char) b; b = readByte(); } return s; } public String nextLine() { if (!hasNextLine()) { throw new NoSuchElementException(); } StringBuilder sb = new StringBuilder(); int b = readByte(); while(!isNewLine(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) { throw new NoSuchElementException(); } long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) { throw new NumberFormatException(); } return (int) nl; } public char nextChar() { if (!hasNext()) { throw new NoSuchElementException(); } return (char) readByte(); } public double nextDouble() { return Double.parseDouble(next());} public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;} public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;} public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;} public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();} public int[][] matrixInt(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;} public char[][] charMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;} public void close() { super.close(); try { in.close(); } catch (IOException ignored) {} } } }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | creep04 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 4456 Byte |
Status | AC |
Exec Time | 80 ms |
Memory | 23252 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 | 78 ms | 21076 KB |
case_02.txt | AC | 75 ms | 20948 KB |
case_03.txt | AC | 76 ms | 21460 KB |
case_04.txt | AC | 78 ms | 18132 KB |
case_05.txt | AC | 76 ms | 21332 KB |
case_06.txt | AC | 80 ms | 20948 KB |
case_07.txt | AC | 78 ms | 22868 KB |
case_08.txt | AC | 75 ms | 21460 KB |
case_09.txt | AC | 76 ms | 20820 KB |
case_10.txt | AC | 75 ms | 19028 KB |
case_11.txt | AC | 75 ms | 23252 KB |
case_12.txt | AC | 75 ms | 20692 KB |
case_13.txt | AC | 79 ms | 21332 KB |
case_14.txt | AC | 78 ms | 22612 KB |
case_15.txt | AC | 77 ms | 19028 KB |
sample_01.txt | AC | 75 ms | 21332 KB |
sample_02.txt | AC | 74 ms | 20948 KB |
sample_03.txt | AC | 76 ms | 20948 KB |