結果
問題 | No.831 都市めぐり |
ユーザー | EmKjp |
提出日時 | 2019-05-24 21:53:22 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 33 ms / 2,000 ms |
コード長 | 3,991 bytes |
コンパイル時間 | 883 ms |
コンパイル使用メモリ | 110,672 KB |
実行使用メモリ | 26,016 KB |
最終ジャッジ日時 | 2024-09-17 10:37:15 |
合計ジャッジ時間 | 2,214 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
25,804 KB |
testcase_01 | AC | 26 ms
25,808 KB |
testcase_02 | AC | 25 ms
23,644 KB |
testcase_03 | AC | 26 ms
26,016 KB |
testcase_04 | AC | 26 ms
23,840 KB |
testcase_05 | AC | 26 ms
24,116 KB |
testcase_06 | AC | 26 ms
25,808 KB |
testcase_07 | AC | 26 ms
25,944 KB |
testcase_08 | AC | 26 ms
25,940 KB |
testcase_09 | AC | 26 ms
25,684 KB |
testcase_10 | AC | 26 ms
23,640 KB |
testcase_11 | AC | 26 ms
25,888 KB |
testcase_12 | AC | 26 ms
24,108 KB |
testcase_13 | AC | 27 ms
25,888 KB |
testcase_14 | AC | 26 ms
23,896 KB |
testcase_15 | AC | 28 ms
23,776 KB |
testcase_16 | AC | 27 ms
23,768 KB |
testcase_17 | AC | 29 ms
23,772 KB |
testcase_18 | AC | 31 ms
23,764 KB |
testcase_19 | AC | 33 ms
26,016 KB |
testcase_20 | AC | 33 ms
23,968 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.Globalization;using System.IO;using System.Linq;partial class Solver{public void Run(){var N = ni();long ans = 0;if (N == 1){}else{long lower = 2, upper = N;long left = 1, right = 1;while (lower <= upper){// biggerfor (int i = 0; i < 2 && lower <= upper; i++){if (left > right){ans += right * upper;right = upper;}else{ans += left * upper;left = upper;}upper--;}// smallerfor (int i = 0; i < 2 && lower <= upper; i++){if (left < right){ans += right * lower;right = lower;}else{ans += left * lower;left = lower;}lower++;}}ans += left * right;}cout.WriteLine(ans);}}// PREWRITEN CODE BEGINS FROM HEREpartial 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 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;}}}