Submission #350241
Source Code Expand
using System; using System.IO; using System.Linq; using System.Text; using System.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { void Solve() { int N = reader.Int(); int maxDist = -1, v = -1; for (int i = 2; i <= N; i++) { Console.WriteLine("? 1 " + i); int d = reader.Int(); if (d > maxDist) { maxDist = d; v = i; } } maxDist = -1; for (int i = 1; i <= N; i++) if (i != v) { Console.WriteLine("? " + v + " " + i); int d = reader.Int(); if (d > maxDist) { maxDist = d; } } Console.WriteLine("! " + maxDist); } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public Reader(string file) { reader = new StreamReader(file); } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }
Submission Info
Submission Time | |
---|---|
Task | D - 高橋くんと木の直径 |
User | eitaho |
Language | C# (Mono 2.10.8.1) |
Score | 100 |
Code Size | 2476 Byte |
Status | AC |
Exec Time | 176 ms |
Memory | 8556 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 80 / 80 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt |
Subtask1 | subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_20.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt |
All | subtask0_0.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_20.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 162 ms | 8448 KB |
subtask1_0.txt | AC | 164 ms | 8476 KB |
subtask1_1.txt | AC | 162 ms | 8464 KB |
subtask1_10.txt | AC | 164 ms | 8456 KB |
subtask1_11.txt | AC | 168 ms | 8440 KB |
subtask1_12.txt | AC | 166 ms | 8464 KB |
subtask1_13.txt | AC | 161 ms | 8492 KB |
subtask1_14.txt | AC | 163 ms | 8556 KB |
subtask1_15.txt | AC | 166 ms | 8456 KB |
subtask1_16.txt | AC | 176 ms | 8464 KB |
subtask1_17.txt | AC | 165 ms | 8472 KB |
subtask1_18.txt | AC | 166 ms | 8456 KB |
subtask1_19.txt | AC | 164 ms | 8464 KB |
subtask1_2.txt | AC | 164 ms | 8468 KB |
subtask1_20.txt | AC | 160 ms | 8440 KB |
subtask1_3.txt | AC | 165 ms | 8468 KB |
subtask1_4.txt | AC | 162 ms | 8452 KB |
subtask1_5.txt | AC | 166 ms | 8468 KB |
subtask1_6.txt | AC | 169 ms | 8456 KB |
subtask1_7.txt | AC | 169 ms | 8464 KB |
subtask1_8.txt | AC | 163 ms | 8460 KB |
subtask1_9.txt | AC | 166 ms | 8460 KB |
subtask2_0.txt | AC | 163 ms | 8472 KB |
subtask2_1.txt | AC | 167 ms | 8472 KB |
subtask2_10.txt | AC | 165 ms | 8472 KB |
subtask2_11.txt | AC | 165 ms | 8476 KB |
subtask2_12.txt | AC | 164 ms | 8456 KB |
subtask2_13.txt | AC | 166 ms | 8456 KB |
subtask2_14.txt | AC | 163 ms | 8464 KB |
subtask2_15.txt | AC | 167 ms | 8484 KB |
subtask2_16.txt | AC | 170 ms | 8460 KB |
subtask2_17.txt | AC | 165 ms | 8460 KB |
subtask2_18.txt | AC | 167 ms | 8456 KB |
subtask2_19.txt | AC | 169 ms | 8452 KB |
subtask2_2.txt | AC | 164 ms | 8448 KB |
subtask2_3.txt | AC | 168 ms | 8460 KB |
subtask2_4.txt | AC | 163 ms | 8452 KB |
subtask2_5.txt | AC | 172 ms | 8484 KB |
subtask2_6.txt | AC | 163 ms | 8448 KB |
subtask2_7.txt | AC | 167 ms | 8468 KB |
subtask2_8.txt | AC | 169 ms | 8464 KB |
subtask2_9.txt | AC | 165 ms | 8532 KB |