結果
問題 | No.1265 Balloon Survival |
ユーザー | EmKjp |
提出日時 | 2020-10-24 16:46:33 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,819 bytes |
コンパイル時間 | 2,618 ms |
コンパイル使用メモリ | 108,840 KB |
実行使用メモリ | 38,604 KB |
最終ジャッジ日時 | 2023-09-28 20:30:06 |
合計ジャッジ時間 | 10,779 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
20,564 KB |
testcase_01 | AC | 54 ms
20,776 KB |
testcase_02 | AC | 54 ms
20,588 KB |
testcase_03 | AC | 57 ms
20,520 KB |
testcase_04 | AC | 57 ms
20,668 KB |
testcase_05 | AC | 58 ms
22,708 KB |
testcase_06 | AC | 58 ms
20,580 KB |
testcase_07 | AC | 56 ms
20,612 KB |
testcase_08 | AC | 57 ms
20,616 KB |
testcase_09 | AC | 56 ms
20,564 KB |
testcase_10 | AC | 58 ms
20,612 KB |
testcase_11 | AC | 56 ms
20,524 KB |
testcase_12 | AC | 58 ms
22,692 KB |
testcase_13 | AC | 57 ms
22,696 KB |
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 | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 59 ms
20,704 KB |
testcase_35 | 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; using System.Collections.Generic; using System.Diagnostics; using System.Globalization; using System.IO; using System.Text; using System.Linq; using E = System.Linq.Enumerable; using System.Threading; internal partial class Solver { public void Run() { var n = ni(); var x = new int[n]; var y = new int[n]; for (int i = 0; i < n; i++) { x[i] = ni(); y[i] = ni(); } var deleted = new bool[n]; var events = new List<(double time, int p0, int p1)>(); for (int i = 0; i < n; i++) { for (int j = 0; j < i; j++) { var dx = x[i] - x[j]; var dy = y[i] - y[j]; var d = Math.Sqrt(dx * dx + dy * dy); events.Add((d, i, j)); } } events.Sort(); int ans = 0; foreach (var (time, p0, p1) in events) { if (deleted[p0] || deleted[p1]) continue; if (p0 == 0) { deleted[p1] = true; ans++; } else if (p1 == 0) { deleted[p0] = true; ans++; } else { deleted[p0] = true; deleted[p1] = true; } } cout.WriteLine(ans); } } // PREWRITEN CODE BEGINS FROM HERE static public class StringExtensions { static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") { return string.Join(separator, source); } } internal partial class Solver : Scanner { static readonly int? StackSizeInMebiByte = null; //50; public static void StartAndJoin(Action action, int maxStackSize) { var thread = new Thread(new ThreadStart(action), maxStackSize); thread.Start(); thread.Join(); } public static void Main() { #if LOCAL byte[] inputBuffer = new byte[1000000]; var inputStream = Console.OpenStandardInput(inputBuffer.Length); using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) { Console.SetIn(reader); new Solver(Console.In, Console.Out).Run(); } #else Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); if (StackSizeInMebiByte.HasValue) { StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024); } else { new Solver(Console.In, Console.Out).Run(); } Console.Out.Flush(); #endif } #pragma warning disable IDE0052 private readonly TextReader cin; private readonly TextWriter cout; private readonly TextWriter cerr; #pragma warning restore IDE0052 public Solver(TextReader reader, TextWriter writer) : base(reader) { cin = reader; cout = writer; cerr = Console.Error; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } #pragma warning disable IDE1006 #pragma warning disable IDE0051 private int ni() { return NextInt(); } private int[] ni(int n) { return NextIntArray(n); } private long nl() { return NextLong(); } private long[] nl(int n) { return NextLongArray(n); } private double nd() { return NextDouble(); } private double[] nd(int n) { return NextDoubleArray(n); } private string ns() { return Next(); } private string[] ns(int n) { return NextArray(n); } #pragma warning restore IDE1006 #pragma warning restore IDE0051 } #if DEBUG internal static class LinqPadExtension { public static string TextDump<T>(this T obj) { if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump(); else return obj.ToString().Dump(); } public static T Dump<T>(this T obj) { return LINQPad.Extensions.Dump(obj); } } #endif public class Scanner { private readonly TextReader Reader; private readonly CultureInfo ci = CultureInfo.InvariantCulture; private readonly char[] buffer = new char[2 * 1024]; private int cursor = 0, length = 0; private string Token; private readonly StringBuilder sb = new StringBuilder(1024); public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { Reader = reader; } public int NextInt() { return checked((int)NextLong()); } public long NextLong() { var s = Next(); long r = 0; int i = 0; bool negative = false; if (s[i] == '-') { negative = true; i++; } for (; i < s.Length; i++) { r = r * 10 + (s[i] - '0'); #if DEBUG if (!char.IsDigit(s[i])) throw new FormatException(); #endif } return negative ? -r : r; } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { string[] array = new string[size]; for (int i = 0; i < size; i++) { array[i] = Next(); } return array; } public int[] NextIntArray(int size) { int[] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = NextInt(); } return array; } public long[] NextLongArray(int size) { long[] array = new long[size]; for (int i = 0; i < size; i++) { array[i] = NextLong(); } return array; } public double[] NextDoubleArray(int size) { double[] array = new double[size]; for (int i = 0; i < size; i++) { array[i] = NextDouble(); } return array; } public string Next() { if (Token == null) { if (!StockToken()) { throw new Exception(); } } var token = Token; Token = null; return token; } public bool HasNext() { if (Token != null) { return true; } return StockToken(); } private bool StockToken() { while (true) { sb.Clear(); while (true) { if (cursor >= length) { cursor = 0; if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) { break; } } var c = buffer[cursor++]; if (33 <= c && c <= 126) { sb.Append(c); } else { if (sb.Length > 0) break; } } if (sb.Length > 0) { Token = sb.ToString(); return true; } return false; } } }