結果

問題 No.2967 Nana's Plus Permutation Game
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-11-16 16:40:56
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 616 ms / 2,000 ms
コード長 6,176 bytes
コンパイル時間 8,592 ms
コンパイル使用メモリ 166,768 KB
実行使用メモリ 45,920 KB
平均クエリ数 4170.09
最終ジャッジ日時 2024-11-16 16:41:46
合計ジャッジ時間 36,330 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 126 ms
44,376 KB
testcase_01 AC 255 ms
44,752 KB
testcase_02 AC 165 ms
44,752 KB
testcase_03 AC 195 ms
44,492 KB
testcase_04 AC 283 ms
44,604 KB
testcase_05 AC 246 ms
45,008 KB
testcase_06 AC 224 ms
44,624 KB
testcase_07 AC 272 ms
44,464 KB
testcase_08 AC 134 ms
44,528 KB
testcase_09 AC 277 ms
44,624 KB
testcase_10 AC 245 ms
45,016 KB
testcase_11 AC 133 ms
44,760 KB
testcase_12 AC 135 ms
44,892 KB
testcase_13 AC 239 ms
44,504 KB
testcase_14 AC 254 ms
45,144 KB
testcase_15 AC 194 ms
44,372 KB
testcase_16 AC 155 ms
45,016 KB
testcase_17 AC 271 ms
44,760 KB
testcase_18 AC 209 ms
44,888 KB
testcase_19 AC 140 ms
44,880 KB
testcase_20 AC 188 ms
45,144 KB
testcase_21 AC 380 ms
45,272 KB
testcase_22 AC 409 ms
44,756 KB
testcase_23 AC 331 ms
44,760 KB
testcase_24 AC 387 ms
45,124 KB
testcase_25 AC 376 ms
44,868 KB
testcase_26 AC 418 ms
45,144 KB
testcase_27 AC 315 ms
44,632 KB
testcase_28 AC 414 ms
44,612 KB
testcase_29 AC 409 ms
44,888 KB
testcase_30 AC 450 ms
45,272 KB
testcase_31 AC 321 ms
45,016 KB
testcase_32 AC 343 ms
45,016 KB
testcase_33 AC 337 ms
45,016 KB
testcase_34 AC 305 ms
44,760 KB
testcase_35 AC 404 ms
44,760 KB
testcase_36 AC 321 ms
45,016 KB
testcase_37 AC 459 ms
45,400 KB
testcase_38 AC 394 ms
45,272 KB
testcase_39 AC 379 ms
44,356 KB
testcase_40 AC 370 ms
45,272 KB
testcase_41 AC 516 ms
45,152 KB
testcase_42 AC 484 ms
45,128 KB
testcase_43 AC 479 ms
45,272 KB
testcase_44 AC 593 ms
45,024 KB
testcase_45 AC 521 ms
45,280 KB
testcase_46 AC 582 ms
45,516 KB
testcase_47 AC 596 ms
44,896 KB
testcase_48 AC 574 ms
45,280 KB
testcase_49 AC 482 ms
45,280 KB
testcase_50 AC 531 ms
45,116 KB
testcase_51 AC 493 ms
45,392 KB
testcase_52 AC 586 ms
45,624 KB
testcase_53 AC 466 ms
45,008 KB
testcase_54 AC 457 ms
44,732 KB
testcase_55 AC 453 ms
45,004 KB
testcase_56 AC 591 ms
45,152 KB
testcase_57 AC 616 ms
45,792 KB
testcase_58 AC 601 ms
45,536 KB
testcase_59 AC 614 ms
45,920 KB
testcase_60 AC 592 ms
45,280 KB
testcase_61 AC 120 ms
44,624 KB
testcase_62 AC 122 ms
45,264 KB
testcase_63 AC 122 ms
44,624 KB
testcase_64 AC 122 ms
44,624 KB
testcase_65 AC 133 ms
44,368 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (128 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff #

using Lib;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
    const bool MultiTestCase = false;
    void Solve()
    {
        int n = ri;

        int Guess(int i, int j)
        {
            WriteFlush($"1 {i + 1} {j + 1}");
            int r = ri;
            return r == -1 ? -1 : r - 1;
        }

        var q = new int[n];
        for (int i = 0; i < n; i++) q[i] = Guess(i, i);
        var p = new int[n];
        Array.Fill(p, -1);
        for (int i = 0; i < n; i++) if (q[i] != -1) p[q[i]] = i;

        var d = new int[n];
        var st = new Stack<int>();
        for (int i = 0; i < n; i++) if (q[i] == -1) st.Push(i);
        while (st.Count > 0)
        {
            int x = st.Pop();
            if (p[x] == -1) continue;
            st.Push(p[x]);
            d[p[x]] = d[x] + 1;
        }

        int u = -1;
        for (int i = 0; i < n; i++) if (p[i] == -1 && (u == -1 || d[i] > d[u])) u = i;

        var ans = new int[n];
        ans[u] = 1;
        int v = u;
        for (int i = 2; i <= n; i++)
        {
            v = Guess(v, u);
            ans[v] = i;
        }
        WriteFlush($"2 {string.Join(" ", ans)}");
    }


#pragma warning disable CS0162
    public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162

    const int IINF = 1 << 30;
    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
    void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
    void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
    void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
    void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}

static class Program
{
    static public void Main(string[] args)
    {
        SourceExpander.Expander.Expand();
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(b^'0');return ng?-ret:ret;}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b;do b=Read();while(b<'0'||'9'<b);for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(ulong)(b^'0');return ret;}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander
0