結果
問題 | No.116 門松列(1) |
ユーザー | EmKjp |
提出日時 | 2015-05-10 22:20:09 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 68 ms / 5,000 ms |
コード長 | 3,033 bytes |
コンパイル時間 | 3,004 ms |
コンパイル使用メモリ | 105,876 KB |
実行使用メモリ | 22,856 KB |
最終ジャッジ日時 | 2023-09-07 06:40:27 |
合計ジャッジ時間 | 5,390 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
22,792 KB |
testcase_01 | AC | 67 ms
22,652 KB |
testcase_02 | AC | 64 ms
22,724 KB |
testcase_03 | AC | 63 ms
20,780 KB |
testcase_04 | AC | 62 ms
20,808 KB |
testcase_05 | AC | 65 ms
20,784 KB |
testcase_06 | AC | 66 ms
20,680 KB |
testcase_07 | AC | 62 ms
22,856 KB |
testcase_08 | AC | 63 ms
20,696 KB |
testcase_09 | AC | 61 ms
20,800 KB |
testcase_10 | AC | 64 ms
20,780 KB |
testcase_11 | AC | 62 ms
20,680 KB |
testcase_12 | AC | 66 ms
20,632 KB |
testcase_13 | AC | 62 ms
20,624 KB |
testcase_14 | AC | 67 ms
22,680 KB |
testcase_15 | AC | 64 ms
22,856 KB |
testcase_16 | AC | 66 ms
22,672 KB |
testcase_17 | AC | 68 ms
20,684 KB |
testcase_18 | AC | 66 ms
20,808 KB |
testcase_19 | AC | 62 ms
22,748 KB |
testcase_20 | AC | 62 ms
20,756 KB |
testcase_21 | AC | 62 ms
20,744 KB |
testcase_22 | AC | 62 ms
20,636 KB |
testcase_23 | AC | 59 ms
18,788 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 A = ni(N); int ans = 0; for (int i = 0; i + 2 < N; i++) { int j = i + 1; int k = i + 2; if (A[i] >= A[j] && A[j] >= A[k]) continue; if (A[i] <= A[j] && A[j] <= A[k]) continue; if (A[i] == A[j] || A[j] == A[k] || A[i] == A[k]) continue; ans++; } cout.WriteLine(ans); } } // 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 string ns() { return Next(); } } 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; } } }