#26859 (C#(csc)) No.190 Dry Wet Moist

• 問題: No.190 Dry Wet Moist
• ユーザー: りあん
• 提出日時: 2015-05-15 16:18:25
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 163 ms / 2,000 ms
• コード長: 3,283 bytes
• コンパイル時間: 937 ms
• コンパイル使用メモリ: 113,416 KB
• 実行使用メモリ: 36,864 KB
• 最終ジャッジ日時: 2024-07-06 03:57:01
• 合計ジャッジ時間: 4,343 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 2
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;
namespace Solver
{
    class Program
    {
        const int M = 1000000007;
        static void Main()
        {
            var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            var sc = new Scan();
            int n = sc.Int;
            var a = sc.IntArr;
            Array.Sort(a);
            var ans = new int[3];
            int j = a.Length - 1;
            for (int i = 0; ; i++)
            {
                while (a[i] + a[j] >= 0)
                {
                    --j;
                    if (i >= j)
                        break;
                }
                if (i >= j || a[i] >= 0)
                    break;
                if (a[i] + a[j] < 0)
                {
                    ++ans[0];
                    --j;
                }
            }
            j = 0;
            for (int i = a.Length - 1; ; i--)
            {
                while (a[i] + a[j] <= 0)
                {
                    ++j;
                    if (i <= j)
                        break;
                }
                if (i <= j || a[i] <= 0)
                    break;
                if (a[i] + a[j] > 0)
                {
                    ++ans[1];
                    ++j;
                }
            }
            j = a.Length - 1;
            for (int i = 0; ; i++)
            {
                while (a[i] + a[j] > 0)
                {
                    --j;
                    if (i >= j)
                        break;
                }
                if (i >= j || a[i] > 0 || a[j] < 0)
                    break;
                if (a[i] + a[j] == 0)
                {
                    ++ans[2];
                    --j;
                }
            }
            sw.WriteLine(String.Join(" ", ans));
            sw.Flush();
        }
    }
    class Scan
    {
        public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
        public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
        public string Str { get { return Console.ReadLine().Trim(); } }
        public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
        public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
        public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
        public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
        public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }
        public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }
        public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
        public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
        public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
        public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX