結果
問題 | No.3 ビットすごろく |
ユーザー | nokonoko |
提出日時 | 2016-11-06 19:16:03 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 27 ms / 5,000 ms |
コード長 | 4,194 bytes |
コンパイル時間 | 1,016 ms |
コンパイル使用メモリ | 116,852 KB |
実行使用メモリ | 26,020 KB |
最終ジャッジ日時 | 2024-07-01 08:09:06 |
合計ジャッジ時間 | 2,768 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
26,000 KB |
testcase_01 | AC | 25 ms
23,640 KB |
testcase_02 | AC | 25 ms
21,680 KB |
testcase_03 | AC | 26 ms
25,904 KB |
testcase_04 | AC | 26 ms
23,964 KB |
testcase_05 | AC | 27 ms
23,732 KB |
testcase_06 | AC | 26 ms
23,884 KB |
testcase_07 | AC | 26 ms
23,632 KB |
testcase_08 | AC | 26 ms
23,636 KB |
testcase_09 | AC | 27 ms
23,640 KB |
testcase_10 | AC | 27 ms
23,764 KB |
testcase_11 | AC | 26 ms
23,768 KB |
testcase_12 | AC | 26 ms
25,924 KB |
testcase_13 | AC | 26 ms
26,020 KB |
testcase_14 | AC | 26 ms
23,752 KB |
testcase_15 | AC | 27 ms
25,728 KB |
testcase_16 | AC | 27 ms
23,940 KB |
testcase_17 | AC | 27 ms
21,556 KB |
testcase_18 | AC | 26 ms
23,892 KB |
testcase_19 | AC | 27 ms
25,848 KB |
testcase_20 | AC | 26 ms
23,672 KB |
testcase_21 | AC | 25 ms
23,852 KB |
testcase_22 | AC | 27 ms
23,496 KB |
testcase_23 | AC | 27 ms
23,664 KB |
testcase_24 | AC | 26 ms
21,684 KB |
testcase_25 | AC | 27 ms
25,856 KB |
testcase_26 | AC | 25 ms
23,772 KB |
testcase_27 | AC | 26 ms
25,648 KB |
testcase_28 | AC | 27 ms
23,744 KB |
testcase_29 | AC | 27 ms
25,692 KB |
testcase_30 | AC | 25 ms
23,836 KB |
testcase_31 | AC | 24 ms
21,556 KB |
testcase_32 | AC | 26 ms
23,516 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using LIB; using System; using System.Linq; using System.Text; using System.Collections.Generic; class Program { public static IO IO = new IO(); static void Main(string[] args) { int n = IO.INT(); BFSNUMBER<int> Q = new BFSNUMBER<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; } } #region BFS namespace LIB { public class BFSNUMBER<T> : QUEUE<PAIR<int, T>> { private bool[] f; private int MIN; public BFSNUMBER(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[v.KEY]) { f[k] = true; base.PUSH(v); } } } } #endregion #region QUEUE namespace LIB { 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; } } } #endregion #region PAIR namespace LIB { 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); } } } #endregion namespace LIB { 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 STRING().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 string STRING() { return R(s => s); } public string[] STRING(char c) { return R(s => s, c); } public string[] STRING(int l) { return R(s => s, l); } public string[][] STRING(int l, char c) { return R(s => s, l, c); } public int INT() { return R(int.Parse); } public int[] INT(char c) { return R(int.Parse, c); } public int[] INT(int l) { return R(int.Parse, l); } public int[][] INT(int l, char c) { return R(int.Parse, l, c); } public long LONG() { return R(long.Parse); } public long[] LONG(char c) { return R(long.Parse, c); } public long[] LONG(int l) { return R(long.Parse, l); } public long[][] LONG(int l, char c) { return R(long.Parse, l, c); } public double DOUBLE() { return R(double.Parse); } public double[] DOUBLE(char c) { return R(double.Parse, c); } public double[] DOUBLE(int l) { return R(double.Parse, l); } public double[][] DOUBLE(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; } } }