結果
問題 | No.197 手品 |
ユーザー |
![]() |
提出日時 | 2015-04-29 03:13:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 34 ms / 1,000 ms |
コード長 | 3,672 bytes |
コンパイル時間 | 3,892 ms |
コンパイル使用メモリ | 109,056 KB |
実行使用メモリ | 19,456 KB |
最終ジャッジ日時 | 2024-07-20 03:36:27 |
合計ジャッジ時間 | 3,734 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 43 |
コンパイルメッセージ
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 { int CountInversion(string s) { int total = 0; for (int i = 0; i < s.Length; i++) { for (int j = i + 1; j < s.Length; j++) { if (s[i] > s[j]) total++; } } return total; } bool ConsecutiveSameChar(string s) { return s.Zip(s.Skip(1), (c1, c2) => c1 == c2 ? 1 : 0).Sum() > 0; } public void Run() { var before = ns(); var N = nl(); var after = ns(); bool ans = false; if (before.Count(c => c == 'o') != after.Count(c => c == 'o')) ans = true; else if (before.Distinct().Count() == 1) { ans = false; } else { var diff = Math.Abs(CountInversion(before) - CountInversion(after)); if (after == before && !ConsecutiveSameChar(after)) { if (N == 1) ans = true; else ans = false; } else { if (diff <= N) ans = false; else ans = true; } } cout.WriteLine(ans ? "SUCCESS" : "FAILURE"); } } // 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 long nl() { return NextLong(); } 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; } } }