#86310 (C#(csc)) No.91 赤、緑、青の石

• 問題: No.91 赤、緑、青の石
• ユーザー: 14番
• 提出日時: 2016-04-10 12:39:38
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 29 ms / 5,000 ms
• コード長: 3,025 bytes
• コンパイル時間: 948 ms
• コンパイル使用メモリ: 113,072 KB
• 実行使用メモリ: 26,516 KB
• 最終ジャッジ日時: 2024-06-24 06:58:05
• 合計ジャッジ時間: 3,025 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 28

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
using System;
using System.Collections.Generic;
using System.Text;
class Program
{
    public void Proc()
    {
        Reader.IsDebug = false;
        List<int> numList = new List<int>();
        numList.AddRange(Reader.GetInt());
        numList.Sort();
        // 要分配
        while (numList[2] - numList[0] > 2)
        {
            if (numList[2] - numList[1] > 4 && numList[1] - numList[0] <= 1)
            {
                // 一番大きいものから小さいもの2つへ
                int must = (numList[2] - numList[1]) / 5;
                numList[2] -= must * 4;
                numList[1] += must;
                numList[0] += must;
            }
            else if (numList[1] - numList[0] > 3 && numList[2] - numList[1] <= 1)
            {
                // 大きいもの２つから一番小さいものへ
                int must = (numList[1] - numList[0]) / 4;
                if (must == 0)
                {
                    break;
                }
                numList[2] -= must * 2;
                numList[1] -= must * 2;
                numList[0] += must * 2;
            }
            else
            {
                // 一番大きいものから小さいものへ
                if (numList[2] - numList[1] <= 1)
                {
                    numList[2] -= 2;
                    numList[0] += 1;
                }
                else
                {
                    int must = Math.Min((numList[2] - numList[1]) / 2, numList[1] - numList[0]);
                    if (must == 0)
                    {
                        break;
                    }
                    numList[2] -= must * 2;
                    numList[0] += must;
                }
            }
            numList.Sort();
        }
        numList.Sort();
        Console.WriteLine(numList[0]);
    
    }
    public class Reader
    {
        public static bool IsDebug = true;
        private static String PlainInput = @"
7777777 3 9999999
 
";
        private static System.IO.StringReader Sr = null;
        public static string ReadLine()
        {
            if (IsDebug)
            {
                if (Sr == null)
                {
                    Sr = new System.IO.StringReader(PlainInput.Trim());
                }
                return Sr.ReadLine();
            }
            else
            {
                return Console.ReadLine();
            }
        }
        public static int[] GetInt(char delimiter = ' ', bool trim = false)
        {
            string inptStr = ReadLine();
            if (trim)
            {
                inptStr = inptStr.Trim();
            }
            string[] inpt = inptStr.Split(delimiter);
            int[] ret = new int[inpt.Length];
            for (int i = 0; i < inpt.Length; i++)
            {
                ret[i] = int.Parse(inpt[i]);
            }
            return ret;
        }
    }
    static void Main()
    {
        Program prg = new Program();
        prg.Proc();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX