結果
問題 | No.78 クジ付きアイスバー |
ユーザー |
![]() |
提出日時 | 2015-06-13 15:17:20 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 25 ms / 5,000 ms |
コード長 | 3,087 bytes |
コンパイル時間 | 971 ms |
コンパイル使用メモリ | 110,208 KB |
実行使用メモリ | 18,816 KB |
最終ジャッジ日時 | 2024-11-08 00:31:10 |
合計ジャッジ時間 | 2,914 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 35 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Linq; using System.Text; using System.Collections.Generic; using System.Diagnostics; using System.Numerics; using Enu = System.Linq.Enumerable; class Program { public void Solve() { int N = Reader.Int(), K = Reader.Int(); var S = Reader.String(); int hit = S.Sum(c => c - '0'); int bought = 0, gain = 0, rem = 0; var last = new Tuple<int, int>[S.Length]; // turns, bought for (int turns = 0; ; turns++) { for (int i = 0; i < N; i++) { gain++; if (rem > 0) rem--; else { bought++; if (last[i] == null) last[i] = new Tuple<int, int>(turns, bought); else { int len = (turns - last[i].Item1) * N; int repeat = (K - gain - 1) / len; gain += repeat * len; bought += repeat * (bought - last[i].Item2); } } rem += S[i] - '0'; if (gain == K) { Console.WriteLine(bought); return; } } if (hit >= N) { Console.WriteLine(bought); return; } } } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }