結果

問題 No.938 賢人を探せ
ユーザー uwiuwi
提出日時 2019-12-01 01:01:47
言語 Java
(openjdk 23)
結果
AC  
実行時間 178 ms / 2,000 ms
コード長 3,307 bytes
コンパイル時間 4,077 ms
コンパイル使用メモリ 84,288 KB
実行使用メモリ 45,892 KB
最終ジャッジ日時 2024-12-14 11:41:32
合計ジャッジ時間 7,732 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 178 ms
45,688 KB
testcase_01 AC 48 ms
36,536 KB
testcase_02 AC 51 ms
36,944 KB
testcase_03 AC 48 ms
36,692 KB
testcase_04 AC 50 ms
37,056 KB
testcase_05 AC 47 ms
37,140 KB
testcase_06 AC 47 ms
36,652 KB
testcase_07 AC 51 ms
37,128 KB
testcase_08 AC 125 ms
45,332 KB
testcase_09 AC 129 ms
45,252 KB
testcase_10 AC 52 ms
37,136 KB
testcase_11 AC 131 ms
45,352 KB
testcase_12 AC 144 ms
45,096 KB
testcase_13 AC 138 ms
45,404 KB
testcase_14 AC 142 ms
45,628 KB
testcase_15 AC 142 ms
45,260 KB
testcase_16 AC 142 ms
45,368 KB
testcase_17 AC 140 ms
45,308 KB
testcase_18 AC 144 ms
45,668 KB
testcase_19 AC 145 ms
45,716 KB
testcase_20 AC 140 ms
45,672 KB
testcase_21 AC 141 ms
45,344 KB
testcase_22 AC 166 ms
45,892 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package adv2019;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;
public class D01 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
Set<String> paku = new HashSet<>();
String[] rare = new String[n];
for(int i = 0;i < n;i++){
paku.add(ns());
rare[i] = ns();
}
for(int i = 0;i < n;i++){
if(paku.add(rare[i])){
out.println(rare[i]);
}
}
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new D01().run(); }
private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0