結果

問題 No.197 手品
ユーザー EmKjpEmKjp
提出日時 2015-04-29 02:50:45
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 3,268 bytes
コンパイル時間 934 ms
コンパイル使用メモリ 109,184 KB
実行使用メモリ 19,072 KB
最終ジャッジ日時 2024-06-27 08:41:43
合計ジャッジ時間 3,624 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 25 ms
18,432 KB
testcase_04 AC 25 ms
18,816 KB
testcase_05 AC 25 ms
18,816 KB
testcase_06 AC 25 ms
18,816 KB
testcase_07 AC 24 ms
18,816 KB
testcase_08 AC 25 ms
18,688 KB
testcase_09 AC 24 ms
18,688 KB
testcase_10 AC 25 ms
18,816 KB
testcase_11 AC 25 ms
18,560 KB
testcase_12 WA -
testcase_13 AC 25 ms
18,688 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 25 ms
18,816 KB
testcase_24 AC 25 ms
18,688 KB
testcase_25 AC 26 ms
18,688 KB
testcase_26 AC 26 ms
18,816 KB
testcase_27 WA -
testcase_28 AC 26 ms
18,560 KB
testcase_29 WA -
testcase_30 AC 25 ms
18,816 KB
testcase_31 AC 25 ms
18,816 KB
testcase_32 AC 26 ms
18,688 KB
testcase_33 WA -
testcase_34 AC 25 ms
18,688 KB
testcase_35 AC 24 ms
18,816 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 26 ms
18,816 KB
testcase_39 WA -
testcase_40 AC 25 ms
18,816 KB
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 26 ms
18,816 KB
testcase_44 WA -
testcase_45 AC 26 ms
19,072 KB
testcase_46 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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 cnt = 0, total = 0;
        foreach (var c in s) {
            if (c == 'o')
                cnt++;
            else
                total += cnt;
        }
        return total;
    }
    public void Run() {
        var before = ns();
        var N = ni();
        var after = ns();
        bool ans = false;

        if (before.Count(c => c == 'o') != after.Count(c => c == 'o'))
            ans = true;
        else {
            var diff = Math.Abs(CountInversion(before) - CountInversion(after));
            if (diff <= N && (N - diff) % 2 == 0)
                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;
        }
    }
}
0