結果
問題 | No.853 河原の石 |
ユーザー | りあん |
提出日時 | 2019-07-26 22:35:14 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,180 bytes |
コンパイル時間 | 963 ms |
コンパイル使用メモリ | 122,692 KB |
実行使用メモリ | 28,336 KB |
最終ジャッジ日時 | 2024-07-02 08:00:42 |
合計ジャッジ時間 | 3,736 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
26,168 KB |
testcase_01 | AC | 22 ms
26,292 KB |
testcase_02 | AC | 23 ms
23,980 KB |
testcase_03 | AC | 25 ms
28,336 KB |
testcase_04 | AC | 23 ms
26,168 KB |
testcase_05 | AC | 23 ms
24,060 KB |
testcase_06 | AC | 25 ms
24,064 KB |
testcase_07 | AC | 23 ms
24,184 KB |
testcase_08 | AC | 23 ms
24,248 KB |
testcase_09 | AC | 23 ms
24,316 KB |
testcase_10 | AC | 22 ms
22,192 KB |
testcase_11 | AC | 22 ms
26,104 KB |
testcase_12 | AC | 23 ms
24,112 KB |
testcase_13 | AC | 22 ms
22,196 KB |
testcase_14 | AC | 22 ms
24,108 KB |
testcase_15 | AC | 22 ms
23,932 KB |
testcase_16 | AC | 25 ms
23,988 KB |
testcase_17 | AC | 24 ms
25,912 KB |
testcase_18 | AC | 24 ms
25,912 KB |
testcase_19 | AC | 24 ms
23,804 KB |
testcase_20 | AC | 24 ms
26,292 KB |
testcase_21 | AC | 24 ms
24,316 KB |
testcase_22 | AC | 24 ms
24,108 KB |
testcase_23 | AC | 23 ms
24,196 KB |
testcase_24 | AC | 25 ms
23,936 KB |
testcase_25 | AC | 24 ms
24,248 KB |
testcase_26 | AC | 25 ms
23,804 KB |
testcase_27 | AC | 23 ms
26,048 KB |
testcase_28 | AC | 22 ms
24,064 KB |
testcase_29 | AC | 23 ms
26,292 KB |
testcase_30 | AC | 24 ms
24,320 KB |
testcase_31 | AC | 22 ms
26,292 KB |
testcase_32 | AC | 24 ms
24,196 KB |
testcase_33 | AC | 23 ms
26,228 KB |
testcase_34 | AC | 22 ms
24,324 KB |
testcase_35 | AC | 24 ms
26,172 KB |
testcase_36 | AC | 24 ms
26,040 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 25 ms
24,060 KB |
testcase_43 | WA | - |
testcase_44 | AC | 24 ms
26,428 KB |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | AC | 24 ms
26,164 KB |
testcase_49 | AC | 23 ms
26,096 KB |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 23 ms
22,196 KB |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | AC | 23 ms
26,156 KB |
testcase_56 | AC | 25 ms
24,316 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
コンパイルメッセージ
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.Generic;using System.Linq;using System.Linq.Expressions;using System.IO;using System.Text;using System.Diagnostics;using static util;using P = pair<int, int>;using Binary = System.Func<System.Linq.Expressions.ParameterExpression,System.Linq.Expressions.ParameterExpression,System.Linq.Expressions.BinaryExpression>;using Unary = System.Func<System.Linq.Expressions.ParameterExpression,System.Linq.Expressions.UnaryExpression>;class Program {static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };static Scan sc = new Scan();const int M = 1000000007;const int M2 = 998244353;const long LM = 1L << 60;const double eps = 1e-11;static void Main(string[] args){long h, w;sc.Multi(out h, out w);--w;if (h >= w) {long ans = h;for (long i = 1; ; i++){if (i * (i + 1) / 2 < w) {ans += i * i;}else {ans += (w - i * (i - 1) / 2) * i;break;}}Prt(ans);}else {long ans = h;long l = -1;long c = -1;long rem = w - h;for (long i = 1; ; i++){if (i * (i + 1) / 2 < h) {ans += i * i;}else {ans += (h - i * (i - 1) / 2) * i;l = i;c = h - i * (i - 1) / 2;break;}}ans += rem / l * (l * c + (l - 1) * (l - c));rem %= l;ans += Math.Min(rem, l - c) * (l - 1);rem = Math.Max(rem - (l - c), 0);ans += rem * l;Prt(ans);}sw.Flush();}static void DBG(string a) => Console.WriteLine(a);static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));static void DBG(params object[] a) => DBG(string.Join(" ", a));static void Prt(string a) => sw.WriteLine(a);static void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));static void Prt(params object[] a) => Prt(string.Join(" ", a));}class pair<T, U> : IComparable<pair<T, U>> {public T v1;public U v2;public pair() : this(default(T), default(U)) {}public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }public int CompareTo(pair<T, U> a) {int c = Comparer<T>.Default.Compare(v1, a.v1);return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);}public override string ToString() => v1 + " " + v2;public void Deconstruct(out T a, out U b) { a = v1; b = v2; }public static bool operator>(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) > 0;public static bool operator<(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) < 0;public static bool operator>=(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) >= 0;public static bool operator<=(pair<T, U> a, pair<T, U> b) => a.CompareTo(b) <= 0;}static class util {public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);public static T sq<T>(T a) => Operator<T>.Multiply(a, a);public static T Max<T>(params T[] a) => a.Max();public static T Min<T>(params T[] a) => a.Min();public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;static readonly int[] dd = { 0, 1, 0, -1 };static readonly string dstring = "RDLU";public static P[] adjacents(this P p) => adjacents(p.v1, p.v2);public static P[] adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);public static pair<P, char>[] adjacents_with_str(int i, int j)=> Enumerable.Range(0, dd.Length).Select(k => new pair<P, char>(new P(i + dd[k], j + dd[k ^ 1]), dstring[k])).ToArray();public static pair<P, char>[] adjacents_with_str(int i, int j, int h, int w)=> Enumerable.Range(0, dd.Length).Select(k => new pair<P, char>(new P(i + dd[k], j + dd[k ^ 1]), dstring[k])).Where(p => inside(p.v1.v1, p.v1.v2, h, w)).ToArray();public static P[] adjacents(int i, int j)=> Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).ToArray();public static P[] adjacents(int i, int j, int h, int w)=> Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])).Where(p => inside(p.v1, p.v2, h, w)).ToArray();public static void Assert(bool cond) { if (!cond) throw new Exception(); }public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)=> a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.Aggregate(Enumerable.Union));public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }public static T[] copy<T>(this IList<T> a) {var ret = new T[a.Count];for (int i = 0; i < a.Count; i++) ret[i] = a[i];return ret;}}static class Operator<T> {static readonly ParameterExpression x = Expression.Parameter(typeof(T), "x");static readonly ParameterExpression y = Expression.Parameter(typeof(T), "y");public static readonly Func<T, T, T> Add = Lambda(Expression.Add);public static readonly Func<T, T, T> Subtract = Lambda(Expression.Subtract);public static readonly Func<T, T, T> Multiply = Lambda(Expression.Multiply);public static readonly Func<T, T, T> Divide = Lambda(Expression.Divide);public static readonly Func<T, T> Plus = Lambda(Expression.UnaryPlus);public static readonly Func<T, T> Negate = Lambda(Expression.Negate);public static Func<T, T, T> Lambda(Binary op) => Expression.Lambda<Func<T, T, T>>(op(x, y), x, y).Compile();public static Func<T, T> Lambda(Unary op) => Expression.Lambda<Func<T, T>>(op(x), x).Compile();}class Scan {StreamReader sr;public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }public Scan(string path) { sr = new StreamReader(path); }public int Int => int.Parse(Str);public long Long => long.Parse(Str);public double Double => double.Parse(Str);public string Str => sr.ReadLine().Trim();public pair<T, U> Pair<T, U>() {T a; U b;Multi(out a, out b);return new pair<T, U>(a, b);}public P P => Pair<int, int>();public int[] IntArr => StrArr.Select(int.Parse).ToArray();public long[] LongArr => StrArr.Select(long.Parse).ToArray();public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);bool eq<T, U>() => typeof(T).Equals(typeof(U));T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s)): eq<T, long>() ? ct<T, long>(long.Parse(s)): eq<T, double>() ? ct<T, double>(double.Parse(s)): eq<T, char>() ? ct<T, char>(s[0]): ct<T, string>(s);public void Multi<T>(out T a) => a = cv<T>(Str);public void Multi<T, U>(out T a, out U b){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); }public void Multi<T, U, V>(out T a, out U b, out V c){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); }public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); }public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e){ var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); }}