結果

問題 No.2957 Combo Deck Builder
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-11-08 23:12:05
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 439 ms / 1,000 ms
コード長 6,720 bytes
コンパイル時間 8,468 ms
コンパイル使用メモリ 165,656 KB
実行使用メモリ 184,640 KB
最終ジャッジ日時 2024-11-08 23:12:44
合計ジャッジ時間 22,336 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
24,192 KB
testcase_01 AC 47 ms
23,936 KB
testcase_02 AC 47 ms
23,936 KB
testcase_03 AC 47 ms
24,056 KB
testcase_04 AC 49 ms
23,936 KB
testcase_05 AC 46 ms
24,064 KB
testcase_06 AC 414 ms
45,568 KB
testcase_07 AC 422 ms
45,568 KB
testcase_08 AC 439 ms
45,796 KB
testcase_09 AC 407 ms
45,696 KB
testcase_10 AC 410 ms
45,568 KB
testcase_11 AC 395 ms
45,696 KB
testcase_12 AC 401 ms
45,568 KB
testcase_13 AC 424 ms
45,696 KB
testcase_14 AC 312 ms
43,904 KB
testcase_15 AC 309 ms
43,904 KB
testcase_16 AC 303 ms
44,032 KB
testcase_17 AC 329 ms
44,032 KB
testcase_18 AC 318 ms
44,140 KB
testcase_19 AC 306 ms
43,904 KB
testcase_20 AC 325 ms
43,776 KB
testcase_21 AC 299 ms
43,904 KB
testcase_22 AC 298 ms
43,904 KB
testcase_23 AC 308 ms
43,904 KB
testcase_24 AC 295 ms
43,904 KB
testcase_25 AC 328 ms
44,032 KB
testcase_26 AC 312 ms
41,984 KB
testcase_27 AC 316 ms
42,112 KB
testcase_28 AC 319 ms
41,984 KB
testcase_29 AC 299 ms
42,112 KB
testcase_30 AC 148 ms
41,984 KB
testcase_31 AC 143 ms
41,984 KB
testcase_32 AC 390 ms
49,152 KB
testcase_33 AC 367 ms
49,152 KB
testcase_34 AC 228 ms
41,856 KB
testcase_35 AC 234 ms
41,984 KB
testcase_36 AC 46 ms
24,192 KB
testcase_37 AC 44 ms
23,936 KB
testcase_38 AC 44 ms
23,916 KB
testcase_39 AC 44 ms
184,640 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (97 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff #
プレゼンテーションモードにする

using Lib;
using System;
using System.Collections.Generic;
using System.Diagnostics;
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()
{
int n = ri;
var cards = new (int c, long x, long y)[n];
for (int i = 0; i < n; i++) cards[i] = (ri, rl, rl);
long ans = 0;
var plus = new List<(int c, long x, long y)>();
var minus = new List<(int c, long x, long y)>();
foreach (var (c, x, y) in cards)
{
if (x <= y)
{
plus.Add((c, x, y));
ans += x;
}
else
{
minus.Add((c, x, y));
ans += y;
}
}
{
var pq = new PriorityQueue<long, long>();
plus.Sort((p1, p2) => -(p1.c - p2.c));
int z = 0;
for (int i = plus.Count - 1; i >= 0; i--)
{
for (; z < plus.Count && plus[z].c > i; z++)
{
var (_, x, y) = plus[z];
long d = y - x;
pq.Enqueue(d, -d);
}
if (pq.Count > 0) ans += pq.Dequeue();
}
}
{
var pq = new PriorityQueue<long, long>();
minus.Sort((p1, p2) => p1.c - p2.c);
int z = 0;
for (int i = plus.Count; i < n; i++)
{
for (; z < minus.Count && minus[z].c <= i; z++)
{
var (_, x, y) = minus[z];
long d = x - y;
pq.Enqueue(d, -d);
}
if (pq.Count > 0) ans += pq.Dequeue();
}
}
Write(ans);
}
#pragma warning disable CS0162
public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); }
#pragma warning restore CS0162
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 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
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0