結果
問題 | No.274 The Wall |
ユーザー | EmKjp |
提出日時 | 2019-05-01 13:30:26 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 60 ms / 2,000 ms |
コード長 | 3,343 bytes |
コンパイル時間 | 3,301 ms |
コンパイル使用メモリ | 107,660 KB |
実行使用メモリ | 25,540 KB |
最終ジャッジ日時 | 2023-09-04 02:38:08 |
合計ジャッジ時間 | 5,992 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 57 ms
23,436 KB |
testcase_01 | AC | 57 ms
21,376 KB |
testcase_02 | AC | 57 ms
23,392 KB |
testcase_03 | AC | 59 ms
23,596 KB |
testcase_04 | AC | 56 ms
21,372 KB |
testcase_05 | AC | 57 ms
21,508 KB |
testcase_06 | AC | 57 ms
21,400 KB |
testcase_07 | AC | 57 ms
21,420 KB |
testcase_08 | AC | 56 ms
23,448 KB |
testcase_09 | AC | 57 ms
21,444 KB |
testcase_10 | AC | 56 ms
23,468 KB |
testcase_11 | AC | 59 ms
21,476 KB |
testcase_12 | AC | 58 ms
19,500 KB |
testcase_13 | AC | 56 ms
21,380 KB |
testcase_14 | AC | 57 ms
21,496 KB |
testcase_15 | AC | 59 ms
25,540 KB |
testcase_16 | AC | 60 ms
23,480 KB |
testcase_17 | AC | 59 ms
21,396 KB |
testcase_18 | AC | 60 ms
21,404 KB |
testcase_19 | AC | 59 ms
23,476 KB |
testcase_20 | AC | 58 ms
21,428 KB |
testcase_21 | AC | 59 ms
23,464 KB |
testcase_22 | AC | 59 ms
23,472 KB |
testcase_23 | AC | 59 ms
21,428 KB |
testcase_24 | AC | 58 ms
23,436 KB |
testcase_25 | AC | 58 ms
21,416 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.IO; using System.Collections.Generic; using System.Globalization; using System.Linq; using System.Text; partial class Solver { public void Run() { var N = ni(); var M = ni(); var L = new int[N]; var R = new int[N]; for (int i = 0; i < N; i++) { L[i] = ni(); R[i] = ni(); } var hist = new int[M + 1]; for (int i = 0; i < N; i++) { hist[L[i]]++; hist[R[i] + 1]--; hist[(M - 1 - R[i])]++; hist[(M - 1 - L[i]) + 1]--; } for (int i = 1; i <= M; i++) hist[i] += hist[i - 1]; cout.WriteLine(hist.Max() <= 2 ? "YES" : "NO"); } } // PREWRITEN CODE BEGINS FROM HERE partial class Solver : Scanner { public static void Main(string[] args) { new Solver(Console.In, Console.Out).Run(); } TextReader cin; TextWriter cout; public Solver(TextReader reader, TextWriter writer) : base(reader) { this.cin = reader; this.cout = writer; } public Solver(string input, TextWriter writer) : this(new StringReader(input), writer) { } public int ni() { return NextInt(); } public int[] ni(int n) { return NextIntArray(n); } public long nl() { return NextLong(); } public long[] nl(int n) { return NextLongArray(n); } public double nd() { return NextDouble(); } public string ns() { return Next(); } public string[] ns(int n) { return NextArray(n); } } public class Scanner { private TextReader Reader; private Queue<String> TokenQueue = new Queue<string>(); private CultureInfo ci = CultureInfo.InvariantCulture; public Scanner() : this(Console.In) { } public Scanner(TextReader reader) { this.Reader = reader; } public int NextInt() { return Int32.Parse(Next(), ci); } public long NextLong() { return Int64.Parse(Next(), ci); } public double NextDouble() { return double.Parse(Next(), ci); } public string[] NextArray(int size) { var array = new string[size]; for (int i = 0; i < size; i++) array[i] = Next(); return array; } public int[] NextIntArray(int size) { var array = new int[size]; for (int i = 0; i < size; i++) array[i] = NextInt(); return array; } public long[] NextLongArray(int size) { var array = new long[size]; for (int i = 0; i < size; i++) array[i] = NextLong(); return array; } public String Next() { if (TokenQueue.Count == 0) { if (!StockTokens()) throw new InvalidOperationException(); } return TokenQueue.Dequeue(); } public bool HasNext() { if (TokenQueue.Count > 0) return true; return StockTokens(); } private bool StockTokens() { while (true) { var line = Reader.ReadLine(); if (line == null) return false; var tokens = line.Trim().Split(" ".ToCharArray(), StringSplitOptions.RemoveEmptyEntries); if (tokens.Length == 0) continue; foreach (var token in tokens) TokenQueue.Enqueue(token); return true; } } }