#146354 (C#(csc)) No.479 頂点は要らない

• 問題: No.479 頂点は要らない
• ユーザー: claw88
• 提出日時: 2017-01-27 23:28:54
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 318 ms / 1,500 ms
• コード長: 3,046 bytes
• コンパイル時間: 1,425 ms
• コンパイル使用メモリ: 110,080 KB
• 実行使用メモリ: 45,032 KB
• 最終ジャッジ日時: 2024-12-23 17:02:42
• 合計ジャッジ時間: 7,066 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 38

コンパイルメッセージ

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
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<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;
    readonly string alfa = "abcdefghijklmnopqrstuvwxyz";
    void Solve()
    {
        int N = cin.Nextint;
        int M = cin.Nextint;
        var G = Enumerable.Range(0, N).Select(i => new List<int>()).ToArray();//頂点と辺
        var W = Enumerable.Range(0, N).Select(i => new List<int>()).ToArray();//頂点と頂点
        for (int i = 0; i < M; i++)
        {
            int a = cin.Nextint, b = cin.Nextint;
            G[a].Add(i);
            G[b].Add(i);
            W[a].Add(b);
            W[b].Add(a);
        }
        var A = new int[N];//購入した頂点は１
        var B = new int[M];//購入した辺は１
        var cnt = 0; //購入した辺の数
        //最後の頂点はは買わないので
        int high = N - 1;
        while (cnt < M)
        {
            while (A[high] == 1) high--;
            foreach (var v in W[high])//買う頂点番号
            {
                if (A[v] == 1) continue;
                A[v] = 1;
                foreach (var z in G[v])//買う辺番号
                {
                    if (B[z] == 1) continue;
                    B[z] = 1;
                    cnt++;
                }
            }
            high--;
        }
        bool fl = false;
        for (int i = N - 1; i >= 0; i--)
        {
            if (fl)
            {
                Write(A[i]);
            }
            else
            {
                if (A[i] == 1)
                {
                    i++;
                    fl = true;
                }
            }
        }
        WriteLine();
    }
}
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