#357405 (C#(csc)) No.850 企業コンテスト2位

• 問題: No.850 企業コンテスト2位
• ユーザー: claw88
• 提出日時: 2019-07-05 23:54:07
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 62 ms / 2,000 ms
• コード長: 5,445 bytes
• コンパイル時間: 4,776 ms
• コンパイル使用メモリ: 118,068 KB
• 実行使用メモリ: 35,192 KB
• 平均クエリ数: 200.11
• 最終ジャッジ日時: 2024-07-16 17:38:14
• 合計ジャッジ時間: 5,434 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	47 ms; 34,776 KB
testcase_01	AC	44 ms; 34,520 KB
testcase_02	AC	46 ms; 34,776 KB
testcase_03	AC	46 ms; 34,776 KB
testcase_04	AC	44 ms; 34,520 KB
testcase_05	AC	46 ms; 34,648 KB
testcase_06	AC	45 ms; 34,776 KB
testcase_07	AC	49 ms; 35,032 KB
testcase_08	AC	52 ms; 34,648 KB
testcase_09	AC	49 ms; 34,392 KB
testcase_10	AC	53 ms; 34,648 KB
testcase_11	AC	52 ms; 35,192 KB
testcase_12	AC	53 ms; 34,904 KB
testcase_13	AC	62 ms; 34,904 KB
testcase_14	AC	56 ms; 34,776 KB
testcase_15	AC	56 ms; 34,776 KB
testcase_16	AC	52 ms; 34,648 KB
testcase_17	AC	54 ms; 34,392 KB
testcase_18	AC	54 ms; 34,520 KB
testcase_19	AC	53 ms; 34,520 KB
testcase_20	AC	54 ms; 34,264 KB
testcase_21	AC	55 ms; 34,264 KB
testcase_22	AC	52 ms; 34,520 KB
testcase_23	AC	53 ms; 34,648 KB
testcase_24	AC	54 ms; 35,032 KB
testcase_25	AC	53 ms; 34,264 KB
testcase_26	AC	52 ms; 34,776 KB
testcase_27	AC	42 ms; 34,520 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.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        var defeat = new int[N];

        for (int i = 0; i < N; i++)
        {
            defeat[i] = -1;
        }

        bool flag = true;
        while (flag)
        {
            flag = false;
            for (int i = 0; i < N; i++)
            {
                if (defeat[i] != -1)
                {
                    continue;
                }
                for (int j = i + 1; j < N; j++)
                {
                    if (defeat[j] != -1)
                    {
                        continue;
                    }

                    flag = true;
                    WriteLine($"? {i + 1} {j + 1}");
                    if (cin.nextint == i + 1)
                    {
                        defeat[j] = i;
                    }
                    else
                    {
                        defeat[i] = j;
                    }

                    i = j;
                    break;
                }
            }
        }
        int winner = -1;
        for (int i = 0; i < N; i++)
        {
            if(defeat[i] == -1)
            {
                winner = i;
                break;
            }
        }


        flag = true;
        while (flag)
        {
            flag = false;
            for (int i = 0; i < N; i++)
            {
                if (defeat[i] != winner)
                {
                    continue;
                }
                for (int j = i + 1; j < N; j++)
                {
                    if (defeat[j] != winner)
                    {
                        continue;
                    }

                    flag = true;
                    WriteLine($"? {i + 1} {j + 1}");
                    if (cin.nextint == i + 1)
                    {
                        defeat[j] = i;
                    }
                    else
                    {
                        defeat[i] = j;
                    }

                    i = j;
                    break;
                }
            }
        }

        for (int i = 0; i < N; i++)
        {
            if (defeat[i] == winner)
            {
                WriteLine($"! {i + 1}");
                return;
            }
        }
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}