結果
| 問題 | No.484 収穫 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2017-02-10 23:29:22 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,960 bytes |
| コンパイル時間 | 1,039 ms |
| コンパイル使用メモリ | 112,640 KB |
| 実行使用メモリ | 31,872 KB |
| 最終ジャッジ日時 | 2024-06-09 04:49:31 |
| 合計ジャッジ時間 | 31,562 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 25 ms
18,176 KB |
| testcase_01 | AC | 26 ms
18,304 KB |
| testcase_02 | AC | 25 ms
18,304 KB |
| testcase_03 | AC | 25 ms
18,176 KB |
| testcase_04 | AC | 25 ms
18,304 KB |
| testcase_05 | AC | 25 ms
18,176 KB |
| testcase_06 | AC | 26 ms
18,048 KB |
| testcase_07 | AC | 25 ms
18,304 KB |
| testcase_08 | AC | 26 ms
18,432 KB |
| testcase_09 | AC | 51 ms
18,520 KB |
| testcase_10 | AC | 50 ms
18,524 KB |
| testcase_11 | AC | 50 ms
18,304 KB |
| testcase_12 | AC | 2,321 ms
31,616 KB |
| testcase_13 | AC | 2,340 ms
31,744 KB |
| testcase_14 | AC | 2,325 ms
31,744 KB |
| testcase_15 | AC | 2,332 ms
31,616 KB |
| testcase_16 | AC | 2,337 ms
31,616 KB |
| testcase_17 | AC | 2,548 ms
31,744 KB |
| testcase_18 | AC | 2,567 ms
31,616 KB |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | AC | 2,331 ms
31,616 KB |
| testcase_23 | AC | 2,341 ms
31,744 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.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Point = System.Numerics.Complex;
using Number = System.Int64;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var a = sc.Integer(n);
dp = new short[n, n, 2];
var l = a.Max() - 1; var r = a.Max() + 4050;
for (int _ = 0; _ < 12; _++)
{
var m = (l + r) / 2;
var b = Enumerate(n, x => m - a[x]);
t = b;
if (f(b)) r = m;
else l = m;
}
IO.Printer.Out.WriteLine(r);
}
int[] t;
short[,,] dp;
int dfs(int l, int r, int k)
{
if (dp[l, r, k] != -1) return dp[l, r, k];
if (k == 0)
{
var x = dfs(l + 1, r, 0) + 1;
var y = dfs(l + 1, r, 1) + r - l;
dp[l, r, k] = (short)Math.Min(x, y);
if (t[l] < dp[l, r, k]) dp[l, r, k] = 20000;
}
else
{
var x = dfs(l, r - 1, 0) + r - l;
var y = dfs(l, r - 1, 1) + 1;
dp[l, r, k] = (short)Math.Min(x, y);
if (t[r] < dp[l, r, k]) dp[l, r, k] = 20000;
}
return dp[l, r, k];
}
bool f(int[] t)
{
var n = t.Length;
if (t.Min() < 0) return false;
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++)
{
if (i != j) dp[i, j, 0] = dp[i, j, 1] = -1;
else dp[i, j, 0] = dp[i, j, 1] = 0;
}
if (dfs(0, n - 1, 0) < 20000) return true;
return dfs(0, n - 1, 1) < 20000;
}
public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
}
}
#region main
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Ex
namespace Program.IO
{
using System.IO;
using System.Text;
using System.Globalization;
public class Printer: StreamWriter
{
static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
public readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public string ScanLine()
{
var sb = new StringBuilder();
for (var b = Char(); b != '\n'; b = (char)read())
if (b == 0) break;
else if (b != '\r') sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != 0 && b != '-' && (b < '0' || '9' < b));
if (b == 0) return long.MinValue;
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public char[] Char(int n) { return enumerate(n, Char); }
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
}
}
#endregion