結果
| 問題 |
No.5021 Addition Pyramid
|
| コンテスト | |
| ユーザー |
 KumaTachiRen
|
| 提出日時 | 2025-02-25 20:42:18 |
| 言語 | C# (.NET 8.0.404) |
| 結果 |
AC
|
| 実行時間 | 1,577 ms / 2,000 ms |
| コード長 | 8,523 bytes |
| コンパイル時間 | 16,365 ms |
| コンパイル使用メモリ | 172,672 KB |
| 実行使用メモリ | 229,280 KB |
| スコア | 1,703,533 |
| 最終ジャッジ日時 | 2025-02-25 20:44:08 |
| 合計ジャッジ時間 | 98,195 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
| 純コード判定しない問題か言語 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 50 |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (123 ミリ秒)。 main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.0/publish/
ソースコード
using Lib;
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using static Lib.OutputLib;
public class Solver
{
const bool MultiTestCase = false;
void Solve()
{
const int MOD = 100000000;
const int n = 50;
Contract.Assert(n == ri);
var a = new int[n * (n + 1) / 2];
for (int i = 0; i < n; i++)
for (int j = 0; j <= i; j++)
a[i * (i + 1) / 2 + j] = ri;
var b = new int[n * (n + 1) / 2];
a.AsSpan(a.Length - n).CopyTo(b.AsSpan(b.Length - n));
for (int i = n - 1; i > 0; i--)
{
var sp0 = b.AsSpan(i * (i - 1) / 2, i);
var sp1 = b.AsSpan(i * (i + 1) / 2, i + 1);
for (int j = 0; j < i; j++)
{
sp0[j] = sp1[j] + sp1[j + 1];
if (sp0[j] >= MOD) sp0[j] -= MOD;
}
}
var d = new int[n][];
for (int k = 0; k < n; k++)
{
d[k] = new int[n * (n + 1) / 2];
d[k][(n - 1) * n / 2 + k] = 1;
for (int i = n - 1; i > 0; i--)
{
var sp0 = a.AsSpan(i * (i - 1) / 2, i);
var sp1 = a.AsSpan(i * (i + 1) / 2, i + 1);
for (int j = 0; j < i; j++)
{
sp0[j] = sp1[j] + sp1[j + 1];
if (sp0[j] >= MOD) sp0[j] -= MOD;
}
}
}
var c = new double[n * (n + 1) / 2];
c[0] = 1;
for (int i = 1; i < c.Length; i++) c[i] = c[i - 1] * 0.9;
Array.Reverse(c);
[MethodImpl(256)]
double CalcScore()
{
var d = new int[b.Length];
for (int i = 0; i < b.Length; i++)
{
d[i] = Math.Abs(a[i] - b[i]);
if (d[i] > MOD - d[i]) d[i] = MOD - d[i];
}
Array.Sort(d);
double score = 0;
for (int i = 0; i < c.Length; i++) score += c[i] * d[i];
return score;
}
int counter = 0;
var start_time = DateTime.Now;
const int time_limit = 1500;
int time_diff = 0;
double start_temp = 1000000, end_temp = 10;
double temp = start_temp;
var rnd = new XORShift.XORShift32();
double score = CalcScore();
while (true)
{
if (counter++ % 1000 == 0)
{
time_diff = (int)(DateTime.Now - start_time).TotalMilliseconds;
if (time_diff > time_limit) break;
temp = start_temp + (end_temp - start_temp) * time_diff / time_limit;
}
int x = rnd.Int(n);
int y = rnd.Int(MOD);
b[x] += y;
if (b[x] >= MOD) b[x] -= MOD;
double score_diff = CalcScore() - score;
double prob = Math.Exp(-score_diff / temp); // when maximize
if (prob * uint.MaxValue > rnd.Next())
{
score += score_diff;
}
else
{
b[x] -= y;
if (b[x] < 0) b[x] += MOD;
}
}
WriteJoin(" ", b[(b.Length - n)..]);
}
#pragma warning disable CS0162, CS8618
public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162, CS8618
const int IINF = 1 << 30;
const long INF = 1L << 60;
int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
long rl { [MethodImpl(256)] get => sc.Integer(); }
uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
double rd { [MethodImpl(256)] get => sc.Double(); }
string rs { [MethodImpl(256)] get => sc.Scan(); }
string rline { [MethodImpl(256)] get => sc.Line(); }
public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; }
void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; }
void ReadArray<T>(out T[] a, int n, Func<T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); }
void ReadArray<T>(out T[] a, int n, Func<int, T> read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); }
}
static class Program
{
static public void Main(string[] args)
{
SourceExpander.Expander.Expand();
Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
new Solver();
Console.Out.Flush();
}
}
#region Expanded by https://github.com/kzrnm/SourceExpander
namespace Lib{public partial class StreamScanner{public StreamScanner(Stream stream){str=stream;}private readonly Stream str;private readonly byte[]buf=new byte[1024];private int len,ptr;public bool isEof=false;public bool IsEndOfStream{get{return isEof;}}[MethodImpl(256)]private byte Read(){if(isEof)throw new EndOfStreamException();if(ptr>=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b;do b=Read();while(b<33||126<b);return(char)b;}[MethodImpl(256)]public string Line(){var sb=new StringBuilder();for(var b=Char();b!=10&&!isEof;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public string Scan(){var sb=new StringBuilder();for(var b=Char();b>=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'<b));if(b=='-'){ng=true;b=Read();}for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(b^'0');return ng?-ret:ret;}[MethodImpl(256)]public ulong UInteger(){ulong ret=0;byte b;do b=Read();while(b<'0'||'9'<b);for(;'0'<=b&&b<='9';b=Read())ret=ret*10+(ulong)(b^'0');return ret;}[MethodImpl(256)]public double Double()=>double.Parse(Scan());}}
namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin<T>(string s,IEnumerable<T>t)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat<T>(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i<sz1;i++){for(int j=0;j<sz2;j++)b[j]=a[i,j];WriteJoin(sep,b);}}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat<T>(T[][]a,Func<T,string>map,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}}
namespace Lib{public class XORShift{public class XORShift32{uint x;public XORShift32(){x=2463534242;}public uint Next(){x^=x<<13;x^=x>>17;x^=x<<5;return x;}public int Int(int n)=>(int)(Next()%n);}public class XORShift64{ulong x;public XORShift64(){x=88172645463325252;}public ulong Next(){x^=x<<13;x^=x>>7;x^=x<<17;return x;}}}}
namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}}
#endregion Expanded by https://github.com/kzrnm/SourceExpander