結果

問題 No.710 チーム戦
ユーザー claw88
提出日時 2018-06-29 23:40:20
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 274 ms / 3,000 ms
コード長 2,873 bytes
コンパイル時間 889 ms
コンパイル使用メモリ 113,616 KB
実行使用メモリ 26,256 KB
最終ジャッジ日時 2024-07-01 00:22:54
合計ジャッジ時間 8,111 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;
class Program
{
static void Main()
{
//SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
new Program().solve();
Out.Flush();
}
Scanner cin = new Scanner();
readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
readonly int mod = 1000000007;
void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }
void solve()
{
int N = cin.nextint;
int M = 100001;
var A = new int[2, M];// AiB
for (int i = 0; i < M; i++)
{
A[0, i] = int.MaxValue / 3;
}
A[0, 0] = 0;
var B = new bool[A.Length];
for (int i = 0; i < N; i++)
{
int a = cin.nextint;
int b = cin.nextint;
int p = (i + 1) % 2;
int q = i % 2;
for (int j = 0; j < M; j++)
{
A[p, j] = int.MaxValue / 3;
}
for (int j = 0; j < M; j++)
{
if(j + a < M)chmin(ref A[p, j + a], A[q, j]);
chmin(ref A[p, j], A[q, j] + b);
}
//for (int j = 0; j <= 105; j++)
//{
// WriteLine(j + " " + A[p, j]);
//}
//WriteLine();
}
int ans = int.MaxValue;
for (int i = 0; i < M; i++)
{
chmin(ref ans, Math.Max(i, A[N % 2, i]));
}
WriteLine(ans);
}
}
class Scanner
{
string[] s; int i;
char[] cs = new char[] { ' ' };
public Scanner() { s = new string[0]; i = 0; }
public string[] scan { get { return ReadLine().Split(); } }
public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
public string next
{
get
{
if (i < s.Length) return s[i++];
string st = ReadLine();
while (st == "") st = ReadLine();
s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
i = 0;
return next;
}
}
public int nextint { get { return int.Parse(next); } }
public long nextlong { get { return long.Parse(next); } }
public double nextdouble { get { return double.Parse(next); } }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0