結果
問題 | No.3 ビットすごろく |
ユーザー | nokonoko |
提出日時 | 2017-09-24 07:35:41 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 28 ms / 5,000 ms |
コード長 | 3,584 bytes |
コンパイル時間 | 969 ms |
コンパイル使用メモリ | 116,472 KB |
実行使用メモリ | 18,176 KB |
最終ジャッジ日時 | 2024-07-01 08:49:05 |
合計ジャッジ時間 | 2,789 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
17,408 KB |
testcase_01 | AC | 24 ms
17,536 KB |
testcase_02 | AC | 25 ms
17,536 KB |
testcase_03 | AC | 26 ms
17,664 KB |
testcase_04 | AC | 25 ms
17,664 KB |
testcase_05 | AC | 26 ms
17,536 KB |
testcase_06 | AC | 25 ms
17,536 KB |
testcase_07 | AC | 25 ms
17,920 KB |
testcase_08 | AC | 26 ms
17,792 KB |
testcase_09 | AC | 26 ms
18,048 KB |
testcase_10 | AC | 26 ms
18,176 KB |
testcase_11 | AC | 26 ms
17,664 KB |
testcase_12 | AC | 26 ms
17,536 KB |
testcase_13 | AC | 26 ms
17,536 KB |
testcase_14 | AC | 26 ms
18,048 KB |
testcase_15 | AC | 26 ms
17,892 KB |
testcase_16 | AC | 27 ms
18,176 KB |
testcase_17 | AC | 27 ms
17,888 KB |
testcase_18 | AC | 25 ms
17,536 KB |
testcase_19 | AC | 27 ms
17,896 KB |
testcase_20 | AC | 26 ms
17,536 KB |
testcase_21 | AC | 25 ms
17,280 KB |
testcase_22 | AC | 27 ms
18,176 KB |
testcase_23 | AC | 27 ms
18,024 KB |
testcase_24 | AC | 28 ms
17,896 KB |
testcase_25 | AC | 28 ms
17,920 KB |
testcase_26 | AC | 25 ms
17,664 KB |
testcase_27 | AC | 25 ms
17,536 KB |
testcase_28 | AC | 26 ms
17,920 KB |
testcase_29 | AC | 27 ms
18,048 KB |
testcase_30 | AC | 26 ms
17,280 KB |
testcase_31 | AC | 26 ms
17,664 KB |
testcase_32 | AC | 26 ms
17,536 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.Linq; using System.Text; using System.Collections.Generic; using STR = System.String; using INT = System.Int64; using DEC = System.Double; class Program { public static IO IO = new IO(); static void Main(string[] args) { INT n = IO.INT(); BFSINT<INT> Q = new BFSINT<INT>(n + 1); INT o = -1; Q.PUSH(1, 1); while (Q.SIZE() != 0) { PAIR<INT, INT> b = Q.POP(); INT bit = BIT(b.KEY); if (b.KEY == n) { o = b.VALUE; break; } Q.PUSH(b.KEY - bit, b.VALUE + 1); Q.PUSH(b.KEY + bit, b.VALUE + 1); } IO.WRITE(o); IO.FLUSH(); } public static int BIT(INT n) { int ret = 0; for (int i = 0; i < 32; i++) { if ((1 << i & n) != 0) { ret++; } } return ret; } } public class BFSINT<T> : QUEUE<PAIR<INT, T>> { private bool[] f; private INT MIN; public BFSINT(INT max, INT min = 0) : base(max) { MIN = min; f = new bool[max - min]; } public void PUSH(INT key, T value) { PUSH(new PAIR<INT, T>(key, value)); } public override void PUSH(PAIR<INT, T> v) { INT k = v.KEY - MIN; if (k >= 0 && k < m - MIN && !f[k]) { f[k] = true; base.PUSH(v); } } } public class QUEUE<T> { protected INT m; private INT s, e, c; private T[] q; public QUEUE(INT max) { m = max; q = new T[m]; CLEAR(); } public void CLEAR() { e = 0; s = 0; c = 0; } public INT SIZE() { return c; } public T TOP() { return q[0]; } public T POP() { T r = q[s++]; s %= m; c--; return r; } public virtual void PUSH(T v) { q[e++] = v; e %= m; c++; } public bool EMPTY() { return SIZE() == 0; } } public class PAIR<T, U> : IEquatable<PAIR<T, U>> where T : IEquatable<T> { public T KEY; public U VALUE; public PAIR(T key, U value) { KEY = key; VALUE = value; } public bool SAME(PAIR<T, U> b) { return Equals(b); } public bool Equals(PAIR<T, U> b) { return KEY.Equals(b.KEY); } } public class IO { private const int WMAX = 1000; private StringBuilder S = new StringBuilder(); private T R<T>(Func<string, T> f) { return f(Console.ReadLine()); } private T[] R<T>(Func<string, T> f, char c) { return STR().Split(c).Select(f).ToArray(); } private T[] R<T>(Func<string, T> f, int l) { T[] r = new T[l]; for (int i = 0; i < l; i++) { r[i] = R(f); } return r; } private T[][] R<T>(Func<string, T> f, int l, char c) { T[][] r = new T[l][]; for (int i = 0; i < l; i++) { r[i] = R<T>(f, c); } return r; } private void W<T>(Func<T, string> f, T v, bool lf = true) { S.Append(f(v)); if (lf) { S.Append('\n'); } if (S.Length >= WMAX) { FLUSH(); } } public STR STR() { return R(s => s); } public STR[] STR(char c) { return R(s => s, c); } public STR[] STR(int l) { return R(s => s, l); } public STR[][] STR(int l, char c) { return R(s => s, l, c); } public INT INT() { return R(long.Parse); } public INT[] INT(char c) { return R(long.Parse, c); } public INT[] INT(int l) { return R(long.Parse, l); } public INT[][] INT(int l, char c) { return R(long.Parse, l, c); } public DEC DEC() { return R(double.Parse); } public DEC[] DEC(char c) { return R(double.Parse, c); } public DEC[] DEC(int l) { return R(double.Parse, l); } public DEC[][] DEC(int l, char c) { return R(double.Parse, l, c); } public void WRITE(object s, bool lf = true) { W(v => v.ToString(), s, lf); } public void FLUSH() { Console.Write(S); S.Length = 0; } }