結果
問題 | No.203 ゴールデン・ウィーク(1) |
ユーザー | EmKjp |
提出日時 | 2015-05-08 22:22:24 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 55 ms / 1,000 ms |
コード長 | 2,962 bytes |
コンパイル時間 | 3,976 ms |
コンパイル使用メモリ | 107,504 KB |
実行使用メモリ | 22,668 KB |
最終ジャッジ日時 | 2023-08-11 15:26:25 |
合計ジャッジ時間 | 7,093 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
20,440 KB |
testcase_01 | AC | 54 ms
20,440 KB |
testcase_02 | AC | 53 ms
20,676 KB |
testcase_03 | AC | 54 ms
22,556 KB |
testcase_04 | AC | 55 ms
22,644 KB |
testcase_05 | AC | 55 ms
22,612 KB |
testcase_06 | AC | 54 ms
18,524 KB |
testcase_07 | AC | 54 ms
22,560 KB |
testcase_08 | AC | 54 ms
20,644 KB |
testcase_09 | AC | 54 ms
20,660 KB |
testcase_10 | AC | 55 ms
20,596 KB |
testcase_11 | AC | 54 ms
20,604 KB |
testcase_12 | AC | 53 ms
20,556 KB |
testcase_13 | AC | 54 ms
22,648 KB |
testcase_14 | AC | 54 ms
20,712 KB |
testcase_15 | AC | 55 ms
20,572 KB |
testcase_16 | AC | 55 ms
22,668 KB |
testcase_17 | AC | 55 ms
22,604 KB |
testcase_18 | AC | 55 ms
20,600 KB |
testcase_19 | AC | 55 ms
20,568 KB |
testcase_20 | AC | 54 ms
20,640 KB |
testcase_21 | AC | 54 ms
20,576 KB |
testcase_22 | AC | 54 ms
20,444 KB |
testcase_23 | AC | 55 ms
20,540 KB |
testcase_24 | AC | 55 ms
20,560 KB |
testcase_25 | AC | 55 ms
20,548 KB |
testcase_26 | AC | 55 ms
20,556 KB |
testcase_27 | AC | 54 ms
22,628 KB |
testcase_28 | AC | 54 ms
20,508 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 s1 = ns(); var s2 = ns(); int renzoku = 0; int ans = 0; foreach (var c in s1 + s2) { if (c == 'o') { renzoku++; ans = Math.Max(ans, renzoku); } else { renzoku = 0; } } 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; } } }