結果
問題 | No.678 2Dシューティングゲームの必殺ビーム |
ユーザー | sekiya9311 |
提出日時 | 2018-04-27 22:47:04 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 33 ms / 2,000 ms |
コード長 | 8,554 bytes |
コンパイル時間 | 995 ms |
コンパイル使用メモリ | 118,584 KB |
実行使用メモリ | 19,328 KB |
最終ジャッジ日時 | 2024-06-27 22:04:01 |
合計ジャッジ時間 | 2,263 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
19,328 KB |
testcase_01 | AC | 31 ms
19,072 KB |
testcase_02 | AC | 31 ms
19,072 KB |
testcase_03 | AC | 31 ms
19,200 KB |
testcase_04 | AC | 32 ms
19,072 KB |
testcase_05 | AC | 31 ms
18,816 KB |
testcase_06 | AC | 31 ms
19,072 KB |
testcase_07 | AC | 32 ms
19,072 KB |
testcase_08 | AC | 32 ms
19,200 KB |
testcase_09 | AC | 32 ms
19,072 KB |
testcase_10 | AC | 31 ms
19,200 KB |
testcase_11 | AC | 32 ms
19,328 KB |
testcase_12 | AC | 31 ms
19,200 KB |
testcase_13 | AC | 32 ms
19,328 KB |
testcase_14 | AC | 32 ms
19,200 KB |
testcase_15 | AC | 32 ms
19,200 KB |
testcase_16 | AC | 33 ms
19,200 KB |
testcase_17 | AC | 33 ms
19,200 KB |
コンパイルメッセージ
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.Text; namespace ProgrammingContest { class Writer : IDisposable { private System.IO.TextWriter writer; private StringBuilder sb; private bool isReactive; public Writer(string path) : this(new System.IO.StreamWriter(path)) { } public Writer(bool isReactive) : this(null, isReactive) { } public Writer(System.IO.TextWriter writer = null, bool isReactive = false) { this.writer = (writer ?? Console.Out); this.isReactive = isReactive; if (!this.isReactive) { this.sb = new StringBuilder(); } } public void Dispose() { if (!this.isReactive) { this.writer.Write(sb.ToString()); } if (!this.writer.Equals(Console.Out)) { this.writer.Dispose(); } } public void Write(object val) { if (this.isReactive) { this.writer.Write(val.ToString()); this.writer.Flush(); } else { this.sb.Append(val.ToString()); } } public void Write(string format, params object[] vals) { if (this.isReactive) { this.writer.Write(format, vals); this.writer.Flush(); } else { this.sb.AppendFormat(format, vals); } } public void WriteLine(object val = null) { this.Write((val ?? string.Empty).ToString() + System.Environment.NewLine); } public void WriteLine(int val) { this.WriteLine(val.ToString()); } public void WriteLine(long val) { this.WriteLine(val.ToString()); } public void WriteLine(string val) { this.WriteLine((object)val); } public void WriteLine(string format, params object[] vals) { this.Write(format + System.Environment.NewLine, vals); } } class Scanner : IDisposable { private Queue<string> buffer; private char[] sep; private System.IO.TextReader reader; public Scanner(string path, char[] sep = null) : this(new System.IO.StreamReader(path), sep) { } public Scanner(System.IO.TextReader reader = null, char[] sep = null) { this.buffer = new Queue<string>(); this.sep = (sep ?? new char[] { ' ' }); this.reader = (reader ?? Console.In); } private void CheckBuffer() { if (this.buffer.Count == 0 && this.reader.Peek() != -1) { string str = string.Empty; for (; string.IsNullOrEmpty(str); str = this.reader.ReadLine()) ; str.Split(this.sep).ToList() .ForEach(el => this.buffer.Enqueue(el)); } } public void Dispose() { if (!this.reader.Equals(Console.In)) { this.reader.Dispose(); } } public string Next { get { this.CheckBuffer(); return this.buffer.Dequeue(); } } public string[] GetStringArray(int N) { return Enumerable.Range(0, N) .Select(e => this.Next) .ToArray(); } public int NextInt { get { return int.Parse(this.Next); } } public int[] GetIntArray(int N) { return Enumerable.Range(0, N) .Select(e => this.NextInt) .ToArray(); } public double NextDouble { get { return double.Parse(this.Next); } } public double[] GetdoubleArray(int N) { return Enumerable.Range(0, N) .Select(e => this.NextDouble) .ToArray(); } public long NextLong { get { return long.Parse(this.Next); } } public long[] GetLongArray(int N) { return Enumerable.Range(0, N) .Select(e => this.NextLong) .ToArray(); } public bool IsEnd { get { this.CheckBuffer(); return this.buffer.Count == 0; } } } class MainClass : IDisposable { Scanner sc; Writer wr; const string backPath = ".."; char dirSep = System.IO.Path.DirectorySeparatorChar; string inFilePath = string.Empty; string outFilePath = string.Empty; public MainClass() { this.inFilePath = MainClass.backPath + this.dirSep + MainClass.backPath + this.dirSep + "in.txt"; this.outFilePath = MainClass.backPath + this.dirSep + MainClass.backPath + this.dirSep + "out.txt"; this.wr = new Writer(this.IsReactive); //this.wr = new Writer(this.outFilePath); #if DEBUG if (!this.IsReactive) { this.sc = new Scanner(this.inFilePath); } else { this.sc = new Scanner(); } #else this.sc = new Scanner(); #endif } static void Main(string[] args) { using (var mainClass = new MainClass()) { mainClass.Solve(); } } public void Dispose() { if (this.sc != null) { this.sc.Dispose(); this.sc = null; } if (this.wr != null) { this.wr.Dispose(); this.wr = null; } #if DEBUG Console.WriteLine("続行するには何かキーを押してください..."); Console.ReadKey(); #endif } void MakeTestCase() { var rand = new Random(); if (this.wr != null) { this.wr.Dispose(); } this.wr = new Writer(inFilePath); } void Solve() { int N = sc.NextInt; int xLB = sc.NextInt; int xRB = sc.NextInt; Hoge[] hoges = new Hoge[N]; for (int i = 0; i < N; i++) { hoges[i] = new Hoge() { xl = sc.NextInt, yu = sc.NextInt, xr = sc.NextInt, yd = sc.NextInt, idx = i, }; } Array.Sort(hoges); Array.Reverse(hoges); bool[] beam = new bool[12800 + 5000]; for (int i = xLB; i <= xRB; i++) { beam[i + 5000] = true; } int[] ans = new int[N]; foreach (var h in hoges) { bool hit = false; for (int i = h.xl; i <= Math.Min(1280, h.xr); i++) { if (beam[i + 5000]) { hit = true; beam[i + 5000] = false; } } ans[h.idx] = hit ? 1 : 0; } wr.WriteLine(string.Join(Environment.NewLine, ans)); } private bool IsReactive { get; } = false; // TODO: reactive check !! } struct Hoge : IComparable<Hoge> { public int xl, yu, xr, yd, idx; public int CompareTo(Hoge other) { return yd.CompareTo(other.yd); } } }