結果
問題 | No.836 じょうよ |
ユーザー | sekiya9311 |
提出日時 | 2019-06-14 22:05:17 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 69 ms / 1,000 ms |
コード長 | 7,309 bytes |
コンパイル時間 | 2,137 ms |
コンパイル使用メモリ | 119,720 KB |
実行使用メモリ | 38,720 KB |
最終ジャッジ日時 | 2024-04-26 16:42:40 |
合計ジャッジ時間 | 4,041 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
36,476 KB |
testcase_01 | AC | 33 ms
27,228 KB |
testcase_02 | AC | 31 ms
25,572 KB |
testcase_03 | AC | 31 ms
25,388 KB |
testcase_04 | AC | 33 ms
27,460 KB |
testcase_05 | AC | 33 ms
27,452 KB |
testcase_06 | AC | 33 ms
25,320 KB |
testcase_07 | AC | 32 ms
25,260 KB |
testcase_08 | AC | 31 ms
25,136 KB |
testcase_09 | AC | 32 ms
25,148 KB |
testcase_10 | AC | 31 ms
25,324 KB |
testcase_11 | AC | 35 ms
25,380 KB |
testcase_12 | AC | 35 ms
27,484 KB |
testcase_13 | AC | 33 ms
25,244 KB |
testcase_14 | AC | 33 ms
27,356 KB |
testcase_15 | AC | 36 ms
25,408 KB |
testcase_16 | AC | 69 ms
37,744 KB |
testcase_17 | AC | 68 ms
38,720 KB |
testcase_18 | AC | 36 ms
25,828 KB |
testcase_19 | AC | 39 ms
26,848 KB |
testcase_20 | AC | 54 ms
32,844 KB |
testcase_21 | AC | 34 ms
27,480 KB |
testcase_22 | AC | 38 ms
27,764 KB |
testcase_23 | AC | 46 ms
26,852 KB |
testcase_24 | AC | 35 ms
23,200 KB |
testcase_25 | AC | 39 ms
27,544 KB |
testcase_26 | AC | 33 ms
27,488 KB |
testcase_27 | AC | 34 ms
25,444 KB |
testcase_28 | AC | 33 ms
25,200 KB |
testcase_29 | AC | 34 ms
25,064 KB |
testcase_30 | AC | 34 ms
25,188 KB |
testcase_31 | AC | 36 ms
25,260 KB |
testcase_32 | AC | 35 ms
25,392 KB |
testcase_33 | AC | 34 ms
27,352 KB |
testcase_34 | AC | 33 ms
25,328 KB |
testcase_35 | AC | 34 ms
27,036 KB |
testcase_36 | AC | 40 ms
26,116 KB |
testcase_37 | AC | 39 ms
25,776 KB |
testcase_38 | AC | 42 ms
26,340 KB |
testcase_39 | AC | 40 ms
26,216 KB |
testcase_40 | AC | 52 ms
31,516 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; using System.Collections.Generic; using System.Linq; using System.Text; using System.Numerics; namespace ProgrammingContest { class Writer : IDisposable { private System.IO.TextWriter Out { get; } private StringBuilder Sb { get; } private bool IsReactive { get; } public Writer(string path) : this(new System.IO.StreamWriter(path)) { } public Writer(bool isReactive) : this(null, isReactive) { } public Writer(System.IO.TextWriter writer = null, bool isReactive = false) { this.Out = (writer ?? Console.Out); this.IsReactive = isReactive; if (!this.IsReactive) { this.Sb = new StringBuilder(); } } public void Dispose() { if (!this.IsReactive) { this.Out.Write(Sb.ToString()); } if (!this.Out.Equals(Console.Out)) { this.Out.Dispose(); } } public void Write(object val) { if (this.IsReactive) { this.Out.Write(val.ToString()); this.Out.Flush(); } else { this.Sb.Append(val.ToString()); } } public void WriteFormat(string format, params object[] vals) { if (this.IsReactive) { this.Out.Write(format, vals); this.Out.Flush(); } else { this.Sb.AppendFormat(format, vals); } } public void WriteLine(object val = null) => this.WriteFormat((val?.ToString() ?? string.Empty) + Environment.NewLine); public void WriteLine(int val) => this.WriteLine(val.ToString()); public void WriteLine(long val) => this.WriteLine(val.ToString()); public void WriteLine(string val) => this.WriteLine((object)val); public void WriteLine(string format, params object[] vals) => this.WriteFormat(format + Environment.NewLine, vals); } class Scanner : IDisposable { private Queue<string> Buffer { get; } private char[] Sep { get; } private System.IO.TextReader Reader { get; } public Scanner(string path, char[] sep = null) : this(new System.IO.StreamReader(path), sep) { } public Scanner(System.IO.TextReader reader = null, char[] sep = null) { this.Buffer = new Queue<string>(); this.Sep = (sep ?? new char[] { ' ' }); this.Reader = (reader ?? Console.In); } private void CheckBuffer() { if (this.Buffer.Count == 0 && this.Reader.Peek() != -1) { string str = string.Empty; for (; string.IsNullOrEmpty(str) || string.IsNullOrWhiteSpace(str); str = this.Reader.ReadLine()) ; var strs = str.Split(this.Sep) .Where(el => !(string.IsNullOrEmpty(el) || string.IsNullOrWhiteSpace(el))); foreach (var el in strs) { this.Buffer.Enqueue(el); } } } public void Dispose() { if (!this.Reader.Equals(Console.In)) { this.Reader.Dispose(); } } public string Next() { this.CheckBuffer(); return this.Buffer.Dequeue(); } public string[] GetStringArray(int N) => Enumerable.Range(0, N) .Select(e => this.Next()) .ToArray(); public int NextInt() => int.Parse(this.Next()); public int[] GetIntArray(int N) => Enumerable.Range(0, N) .Select(e => this.NextInt()) .ToArray(); public double NextDouble() => double.Parse(this.Next()); public double[] GetdoubleArray(int N) => Enumerable.Range(0, N) .Select(e => this.NextDouble()) .ToArray(); public long NextLong() => long.Parse(this.Next()); public long[] GetLongArray(int N) => Enumerable.Range(0, N) .Select(e => this.NextLong()) .ToArray(); public BigInteger NextBigInt() => BigInteger.Parse(this.Next()); public BigInteger[] GetBigIntArray(int N) => Enumerable.Range(0, N) .Select(e => this.NextBigInt()) .ToArray(); public bool IsEnd { get { this.CheckBuffer(); return this.Buffer.Count == 0; } } } class MainClass : IDisposable { private Scanner Sc { get; } private Writer Wr { get; } private string InFilePath => "in.txt"; private string OutFilePath => "out.txt"; public MainClass() { this.Wr = new Writer(this.IsReactive); //this.Wr = new Writer(this.OutFilePath); #if DEBUG if (!this.IsReactive) { this.Sc = new Scanner(this.InFilePath); } else { this.Sc = new Scanner(); } #else this.Sc = new Scanner(); #endif this.Solve(); } static void Main(string[] args) { using (new MainClass()) { } } public void Dispose() { this.Sc?.Dispose(); this.Wr?.Dispose(); #if DEBUG Console.WriteLine("press any key to continue..."); Console.ReadKey(); #endif } // 範囲内のmodごとの数 // [l, r] 閉区間 List<long> ModCountInRange(long left, long right, int mod) { long range = (right - left + 1); List <long> modCount = Enumerable.Range(0, mod).Select(e => range / mod).ToList(); if (range % mod > 0) { long add_of_rest_left = left % mod; long add_of_rest_right; if (left % mod <= right % mod) { add_of_rest_right = right % mod; } else { add_of_rest_right = right % mod + mod; } for (long i = add_of_rest_left; i <= add_of_rest_right; i++) { modCount[(int)(i % mod)]++; } } return modCount; } void Solve() { var l = Sc.NextLong(); var r = Sc.NextLong(); var n = Sc.NextInt(); var ans = ModCountInRange(l, r, n); Wr.WriteLine(string.Join(Environment.NewLine, ans)); } private bool IsReactive => false; // TODO: reactive check !! } }