結果

問題 No.497 入れ子の箱
ユーザー EmKjpEmKjp
提出日時 2019-06-03 22:43:49
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 42 ms / 5,000 ms
コード長 4,628 bytes
コンパイル時間 3,140 ms
コンパイル使用メモリ 114,580 KB
実行使用メモリ 27,552 KB
最終ジャッジ日時 2024-09-17 20:37:24
合計ジャッジ時間 5,505 ms
ジャッジサーバーID
（参考情報） 		judge6 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 31 ms
25,520 KB
testcase_01 AC 30 ms
27,508 KB
testcase_02 AC 30 ms
23,216 KB
testcase_03 AC 35 ms
25,268 KB
testcase_04 AC 35 ms
25,584 KB
testcase_05 AC 33 ms
25,392 KB
testcase_06 AC 33 ms
25,460 KB
testcase_07 AC 33 ms
25,388 KB
testcase_08 AC 36 ms
27,296 KB
testcase_09 AC 35 ms
25,332 KB
testcase_10 AC 38 ms
25,264 KB
testcase_11 AC 37 ms
25,248 KB
testcase_12 AC 40 ms
27,424 KB
testcase_13 AC 40 ms
25,072 KB
testcase_14 AC 39 ms
25,520 KB
testcase_15 AC 38 ms
23,344 KB
testcase_16 AC 39 ms
27,540 KB
testcase_17 AC 41 ms
25,328 KB
testcase_18 AC 37 ms
25,388 KB
testcase_19 AC 37 ms
25,324 KB
testcase_20 AC 37 ms
25,200 KB
testcase_21 AC 36 ms
27,440 KB
testcase_22 AC 37 ms
27,552 KB
testcase_23 AC 35 ms
25,644 KB
testcase_24 AC 35 ms
25,524 KB
testcase_25 AC 31 ms
25,392 KB
testcase_26 AC 31 ms
25,588 KB
testcase_27 AC 38 ms
25,456 KB
testcase_28 AC 35 ms
23,348 KB
testcase_29 AC 38 ms
25,516 KB
testcase_30 AC 42 ms
23,220 KB
testcase_31 AC 39 ms
25,372 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.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using E = System.Linq.Enumerable;

class Box
{
    public int X, Y, Z;
    public Box(int x, int y, int z)
    {
        var a = new[] { x, y, z };
        Array.Sort(a);
        X = a[0];
        Y = a[1];
        Z = a[2];
    }
    public bool CanHold(Box b)
    {
        return X > b.X && Y > b.Y && Z > b.Z;
    }
}

partial class Solver
{
    public void Run()
    {
        var N = ni();
        var boxes = E.Range(0, N)
            .Select(_ => new Box(ni(), ni(), ni()))
            .OrderBy(a => a.X)
            .ThenBy(a => a.Y)
            .ThenBy(a => a.Z)
            .ToArray();
        var dp = new int[N];

        for (int i = 0; i < N; i++)
        {
            var x = 1;
            for (int j = 0; j < i; j++)
            {
                if (boxes[i].CanHold(boxes[j]))
                {
                    x = Math.Max(x, dp[j] + 1);
                }
            }
            dp[i] = x;
        }

        cout.WriteLine(dp.Max());
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        return array;
    }

    public string Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}
0