結果

問題 No.1028 闇討ち
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2020-04-17 22:46:00
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 506 ms / 2,000 ms
コード長 3,821 bytes
コンパイル時間 2,314 ms
コンパイル使用メモリ 115,532 KB
実行使用メモリ 41,088 KB
最終ジャッジ日時 2024-10-03 14:26:28
合計ジャッジ時間 8,551 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
19,072 KB
testcase_01 AC 29 ms
18,816 KB
testcase_02 AC 29 ms
19,072 KB
testcase_03 AC 28 ms
18,816 KB
testcase_04 AC 28 ms
19,072 KB
testcase_05 AC 30 ms
19,200 KB
testcase_06 AC 29 ms
19,200 KB
testcase_07 AC 28 ms
18,944 KB
testcase_08 AC 29 ms
19,200 KB
testcase_09 AC 48 ms
23,120 KB
testcase_10 AC 55 ms
23,168 KB
testcase_11 AC 133 ms
27,008 KB
testcase_12 AC 470 ms
40,960 KB
testcase_13 AC 466 ms
41,088 KB
testcase_14 AC 269 ms
38,016 KB
testcase_15 AC 104 ms
26,240 KB
testcase_16 AC 496 ms
41,088 KB
testcase_17 AC 497 ms
40,960 KB
testcase_18 AC 499 ms
40,960 KB
testcase_19 AC 500 ms
41,088 KB
testcase_20 AC 506 ms
40,832 KB
testcase_21 AC 499 ms
40,832 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Linq;
using System.Collections.Generic;
using System.Diagnostics;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using static System.Math;

using Number = System.Int64;
using static System.Numerics.BigInteger;
namespace Program {
	public class Solver {
		Random rnd = new Random(0);
		public void Solve() {
			var n = ri;
			var pos = Enumerate(n, x => new List<KeyValuePair<int, int>>());
			for (int i = 0; i < n; i++)
				for (int j = 0; j < n; j++) {
					var p = ri - 1; pos[p].Add(new KeyValuePair<int, int>(i, j));
				}

			var ans = 0L;
			for (int i = 0; i < n; i++) {
				var a = pos[i];
				Func<int, long> f = y => {
					var ret = 0L;
					foreach (var kv in a)
						ret += Max(Abs(kv.Key - y), kv.Value);
					return ret;
				};
				var l = -1; var r = n;
				while (r - l > 1) {
					var x = (l + r) / 2;
					var u = f(x);
					var v = f(x + 1);
					if (u >= v) l = x;
					else r = x;
				}
				ans += f(r);

			}
			Console.WriteLine(ans);
		}
		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		int ri { get { return sc.Integer(); } }
		long rl { get { return sc.Long(); } }
		double rd { get { return sc.Double(); } }
		string rs { get { return sc.Scan(); } }
		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 < a.Length; ++i) a[i] = f(i); return a;
		}
		static T[][] Enumerate<T>(int n, int m, Func<int, int, T> f) {
			return Enumerate(n, x => Enumerate(m, y => f(x, y)));
		}
		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(ie.ToArray()); }
	static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
		return string.Join(st, ie);
	}
	static public void Main() {
		Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
		var solver = new Program.Solver();
		var t = new System.Threading.Thread(solver.Solve, 100000000);
		t.Start();
		t.Join();
		//*/
		//solver.Solve();
		Console.Out.Flush();
	}
}
#endregion
#region Ex
namespace Program.IO {
	using System.IO;
	using System.Text;
	using System.Globalization;

	public class Printer : StreamWriter {
		public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
		public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
	}

	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 != 0; b = (char)read()) if (b != '\r') sb.Append(b);
			return sb.ToString();
		}
		public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
		public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
		public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
	}
}

#endregion
0