結果

問題 No.1045 直方体大学
コンテスト
ユーザー 紙ぺーぱー
提出日時 2020-05-01 21:35:53
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,792 ms / 2,000 ms
コード長 4,435 bytes
コンパイル時間 2,496 ms
コンパイル使用メモリ 113,536 KB
実行使用メモリ 100,340 KB
最終ジャッジ日時 2024-12-24 23:04:02
合計ジャッジ時間 19,230 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 17
権限があれば一括ダウンロードができます
コンパイルメッセージ
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 Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
using static System.Math;
using static System.Numerics.BigInteger;
using static Program.IO.Scanner;

using Number = System.Int64;
#region IO
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)) { }
	}
	static public class Scanner {
		public static StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
		public static int ri => sc.Integer();
		public static long rl => sc.Long();
		public static string rs => sc.Scan();
		public static double rd => sc.Double();
	}
	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

#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, 50000000);
		t.Start();
		t.Join();
		//*/
		//solver.Solve();
		Console.Out.Flush();
	}
}
#endregion

namespace Program {
	public class Solver {
		Random rnd = new Random(0);
		public void Solve() {
			var n = ri % 360;
			var P = Enumerate(n, x => new long[] { rl, rl, rl });
			var Ps = Enumerate(n + 1, 3, (x, y) => new List<long>());
			for (int j = 0; j <= n; j++)
				for (int k = 0; k < 3; k++) {
					var v = new List<long>();
					if (j == n) { v.Add(INF); v.Add(INF); }
					else {
						for (int l = 0; l < 3; l++) if (l != k) v.Add(P[j][l]);
					}
					v.Sort();
					Ps[j][k] = v;
				}
			var dp = Enumerate(1 << n, n + 1, (x, y) => new long[3]);
			for (int i = 0; i < 1 << n; i++)
				for (int j = 0; j < n; j++)
					for (int k = 0; k < 3; k++) dp[i][j][k] = -INF;
			dp[0][n][0] = 0;
			for (int mask = 0; mask < 1 << n; mask++)
				for (int j = 0; j <= n; j++)
					for (int k = 0; k < 3; k++) if (dp[mask][j][k] >= 0) {
							for (int p = 0; p < n; p++) if ((mask >> p & 1) == 0) {
									for (int q = 0; q < 3; q++) {
										if (Ps[j][k][0] >= Ps[p][q][0] && Ps[j][k][1] >= Ps[p][q][1]) {
											Debug.WriteLine($"{Ps[j][k].AsJoinedString()} -> {Ps[p][q].AsJoinedString()}");
											dp[mask | 1 << p][p][q] = Max(dp[mask | 1 << p][p][q], dp[mask][j][k] + P[p][q]);
										}
									}
								}
						}
			var max = dp.SelectMany(x => x).SelectMany(x => x).Max();
			Console.WriteLine(max);

		}

		const long INF = 1L << 60;
		static int[] dx = { -1, 0, 1, 0 };
		static int[] dy = { 0, 1, 0, -1 };
		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; }
	}
}
0