Contest Duration: ~ (local time) (120 minutes) Back to Home

Submission #588132

Source Code Expand

Copy
```using System;
using System.Linq;
using System.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{

public class Solver
{
public void Solve()
{
var w = sc.Integer();
var h = sc.Integer();
var n = sc.Integer();
var xs = new List<int>() { 0, w - 1 };
var ys = new List<int>() { 0, h - 1 };
var X = new int[n];
var Y = new int[n];
for (int i = 0; i < n; i++)
{
X[i] = sc.Integer() - 1;
Y[i] = sc.Integer() - 1;
for (int d = -1; d <= 1; d++)
{
if (0 <= X[i] + d && X[i] + d <= w - 1)
if (0 <= Y[i] + d && Y[i] + d <= h - 1)
}
}
xs = xs.Distinct().ToList();
ys = ys.Distinct().ToList();
xs.Sort();
ys.Sort();
var dp = new int[xs.Count, ys.Count, xs.Count, ys.Count];
for (int i = 0; i < xs.Count; i++)
for (int j = 0; j < ys.Count; j++)
for (int k = 0; k < xs.Count; k++)
for (int l = 0; l < ys.Count; l++)
dp[i, j, k, l] = -1000000000;
Func<int, int, int, int, int> dfs = null;
dfs = (l, t, r, b) =>
{
if (l < 0 || t < 0 || r < 0 || b < 0) return 0;
if (l >= xs.Count || t >= ys.Count || r >= xs.Count || b >= ys.Count) return 0;
if (dp[l, t, r, b] >= 0) return dp[l, t, r, b];
var max = 0;
for (int i = 0; i < n; i++)
{
var p = xs.BinarySearch(X[i]);
var q = ys.BinarySearch(Y[i]);
if (p < l || r < p) continue;
if (q < t || b < q) continue;
var val = (xs[r] - xs[l] + ys[b] - ys[t] + 1);
val += dfs(l, t, p - 1, q - 1);
val += dfs(p + 1, t, r, q - 1);
val += dfs(l, q + 1, p - 1, b);
val += dfs(p + 1, q + 1, r, b);
max = Math.Max(max, val);
}
return dp[l, t, r, b] = max;
};
IO.Printer.Out.WriteLine(dfs(0, 0, xs.Count - 1, ys.Count - 1));

}
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; }
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
{
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;
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(Scan(), 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
```

#### Submission Info

Submission Time 2015-12-05 18:27:13+0900 D - 金塊ゲーム camypaper C# (Mono 2.10.8.1) 100 6783 Byte AC 2214 ms 291016 KB

#### Judge Result

Score / Max Score 0 / 0 80 / 80 19 / 19 1 / 1
Status
 AC × 3
 AC × 25
 AC × 50
 AC × 75
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
sample_01.txt 146 ms 10556 KB
sample_02.txt 142 ms 10556 KB
sample_03.txt 146 ms 10552 KB