結果
問題 | No.629 グラフの中に眠る門松列 |
ユーザー | sekiya9311 |
提出日時 | 2018-01-05 21:57:11 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 84 ms / 4,000 ms |
コード長 | 7,964 bytes |
コンパイル時間 | 3,313 ms |
コンパイル使用メモリ | 114,648 KB |
実行使用メモリ | 24,192 KB |
最終ジャッジ日時 | 2023-08-24 20:43:36 |
合計ジャッジ時間 | 7,948 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
21,892 KB |
testcase_01 | AC | 68 ms
21,880 KB |
testcase_02 | AC | 68 ms
21,904 KB |
testcase_03 | AC | 69 ms
22,004 KB |
testcase_04 | AC | 69 ms
23,808 KB |
testcase_05 | AC | 68 ms
21,920 KB |
testcase_06 | AC | 68 ms
21,916 KB |
testcase_07 | AC | 68 ms
24,044 KB |
testcase_08 | AC | 68 ms
21,876 KB |
testcase_09 | AC | 68 ms
21,976 KB |
testcase_10 | AC | 69 ms
23,904 KB |
testcase_11 | AC | 69 ms
23,852 KB |
testcase_12 | AC | 68 ms
21,876 KB |
testcase_13 | AC | 68 ms
21,892 KB |
testcase_14 | AC | 68 ms
19,928 KB |
testcase_15 | AC | 68 ms
21,948 KB |
testcase_16 | AC | 68 ms
21,904 KB |
testcase_17 | AC | 69 ms
21,940 KB |
testcase_18 | AC | 68 ms
21,884 KB |
testcase_19 | AC | 70 ms
24,008 KB |
testcase_20 | AC | 68 ms
21,888 KB |
testcase_21 | AC | 84 ms
22,252 KB |
testcase_22 | AC | 77 ms
20,108 KB |
testcase_23 | AC | 83 ms
22,096 KB |
testcase_24 | AC | 72 ms
21,928 KB |
testcase_25 | AC | 78 ms
21,944 KB |
testcase_26 | AC | 84 ms
22,104 KB |
testcase_27 | AC | 80 ms
24,176 KB |
testcase_28 | AC | 77 ms
24,116 KB |
testcase_29 | AC | 80 ms
22,084 KB |
testcase_30 | AC | 80 ms
24,192 KB |
testcase_31 | AC | 80 ms
22,160 KB |
testcase_32 | AC | 80 ms
22,120 KB |
testcase_33 | AC | 80 ms
22,080 KB |
testcase_34 | AC | 79 ms
22,184 KB |
testcase_35 | AC | 79 ms
24,164 KB |
testcase_36 | AC | 81 ms
22,156 KB |
testcase_37 | AC | 79 ms
22,088 KB |
testcase_38 | AC | 79 ms
20,204 KB |
testcase_39 | AC | 79 ms
20,144 KB |
testcase_40 | AC | 78 ms
22,092 KB |
testcase_41 | AC | 78 ms
20,068 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 MainClass : IDisposable { Scanner sc; Writer wr; string backPath = ".."; char dirSep = System.IO.Path.DirectorySeparatorChar; string inFilePath = null; string outFilePath = null; public MainClass() { this.inFilePath = this.backPath + this.dirSep + this.backPath + this.dirSep + "in.txt"; this.outFilePath = this.backPath + this.dirSep + this.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; } } void MakeTestCase() { Random rand = new Random(); if (this.wr != null) { this.wr.Dispose(); } this.wr = new Writer(inFilePath); } void Solve() { int N = sc.NextInt; int M = sc.NextInt; int[] a = sc.GetIntArray(N); var G = new List<int>[N].Select(e => new List<int>()).ToArray(); for (int i = 0; i < M; i++) { int u = sc.NextInt - 1; int v = sc.NextInt - 1; G[u].Add(v); G[v].Add(u); } for (int i = 0; i < N; i++) { int one = a[i]; foreach (var el1 in G[i]) { int two = a[el1]; foreach (var el2 in G[el1]) { if (one != two && two != a[el2] && one != a[el2] && ((one < two && a[el2] < two) || (one > two && a[el2] > two))) { wr.WriteLine("YES"); return; } } } } wr.WriteLine("NO"); } bool isReactive = false; // TODO: reactive check !! } 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) { 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; } } } }