結果
| 問題 | No.938 賢人を探せ |
| ユーザー |
 eSeF
|
| 提出日時 | 2019-12-03 00:34:35 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,041 bytes |
| コンパイル時間 | 1,055 ms |
| コンパイル使用メモリ | 119,796 KB |
| 実行使用メモリ | 30,948 KB |
| 最終ジャッジ日時 | 2024-11-25 03:02:32 |
| 合計ジャッジ時間 | 3,101 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
namespace AtCoder
{
class AC
{
const int MOD = 1000000007;
const int INF = int.MaxValue / 2;
const long SINF = long.MaxValue / 2;
const double EPS = 1e-8;
static readonly int[] dx = { 0, 1, 0, -1 };
static readonly int[] dy = { 1, 0, -1, 0 };
//static List<List<int>> G = new List<List<int>>();
//static List<List<Edge>>G = new List<List<Edge>>();
//static List<Edge> E = new List<Edge>();
static void Main(string[] args)
{
//var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
//Console.SetOut(sw);
var cin = new Scanner();
int N = int.Parse(Console.ReadLine());
var not = new Dictionary<string, bool>();
var B = new string[N];
for(var i = 0; i < N; i++)
{
var p = Console.ReadLine().Split();
not[p[0]] = true;
B[i] = p[1];
}
for(var i = 0; i < N; i++)
{
if (!not.ContainsKey(B[i]))
{
Console.WriteLine(B[i]);
not[B[i]] = true;
}
}
Console.WriteLine();
//Console.Out.Flush();
}
struct Edge
{
public int from;
public int to;
public long dist;
public Edge(int t, long c)
{
from = -1;
to = t;
dist = c;
}
public Edge(int f, int t, long c)
{
from = f;
to = t;
dist = c;
}
}
struct Pair<T, U> : IComparable<Pair<T, U>>
where T : IComparable<T>
where U : IComparable<U>
{
public T first;
public U second;
private readonly bool CompWithFirst;
public Pair(T f, U s, int comp)
{
first = f;
second = s;
CompWithFirst = comp == 1;
}
public Pair(T f, U s)
{
first = f;
second = s;
CompWithFirst = true;
}
public int CompareTo(Pair<T, U> other)
{
return CompWithFirst ? first.CompareTo(other.first) : second.CompareTo(other.second);
}
}
}
public class PriorityQueue<T> where T : IComparable<T>
{
private List<T> Q;
private readonly int r;
public PriorityQueue(bool ascending)
{
if (ascending)
{
r = 1;
}
else
{
r = -1;
}
Q = new List<T>();
}
private void PushHeap(List<T> list, T item)
{
int n = list.Count();
list.Add(item);
while (n != 0)
{
int pIndex = (n - 1) / 2;
if (list[n].CompareTo(list[pIndex]) * r > 0)
{
Swap(Q, n, pIndex);
}
else { break; }
n = pIndex;
}
}
private void PopHeap(List<T> list)
{
int n = list.Count() - 1;
list[0] = list[n];
list.RemoveAt(n);
int cur = 0;
int comp;
while (2 * cur + 1 <= n - 1)
{
int c1 = 2 * cur + 1;
int c2 = 2 * (cur + 1);
if (c1 == n - 1)
{
comp = c1;
}
else
{
comp = list[c1].CompareTo(list[c2]) * r > 0 ? c1 : c2;
}
if (list[cur].CompareTo(list[comp]) * r < 0)
{
Swap(Q, cur, comp);
}
else { break; }
cur = comp;
}
}
private void Swap(List<T> list, int a, int b)
{
T keep = list[a];
list[a] = list[b];
list[b] = keep;
}
public void Enqueue(T value)
{
PushHeap(Q, value);
}
public T Dequeue()
{
T ret = Q[0];
PopHeap(Q);
return ret;
}
public T Peek()
{
return Q[0];
}
public int Count()
{
return Q.Count();
}
public bool Contains(T search)
{
return Q.Contains(search);
}
}
public class Scanner
{
public int[] ReadSplit()
{
int[] array = Console.ReadLine().Split().Select(int.Parse).ToArray();
return array;
}
public long[] ReadSplitL()
{
long[] array = Console.ReadLine().Split().Select(long.Parse).ToArray();
return array;
}
}
public static class Tool
{
static public void Initialize<T>(ref T[] array, T initialvalue)
{
for (var i = 0; i < array.Length; i++)
{
array[i] = initialvalue;
}
}
static public void Swap<T>(ref T a, ref T b)
{
T keep = a;
a = b;
b = keep;
}
static public void Display<T>(T[,] array2d, int n, int m)
{
for(var i = 0; i < n; i++)
{
for(var j = 0; j < m; j++)
{
Console.Write($"{array2d[i, j]} ");
}
Console.WriteLine();
}
}
}
class SegmentTree<T>
{
}
}