#111725 (C#(csc)) No.382 シャイな人たち (2)

提出ソース

結果

問題	No.382 シャイな人たち (2)
ユーザー	eitaho
提出日時	2016-08-19 22:32:21
言語	C#(csc) (csc 3.9.0)
結果	AC
実行時間	3,711 ms / 8,000 ms
コード長	6,782 bytes
コンパイル時間	4,090 ms
コンパイル使用メモリ	119,188 KB
実行使用メモリ	31,704 KB
最終ジャッジ日時	2024-11-07 18:54:40
合計ジャッジ時間	60,890 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3,236 ms 29,524 KB
testcase_01	AC	2,830 ms 29,396 KB
testcase_02	AC	2,455 ms 31,448 KB
testcase_03	AC	2,839 ms 29,784 KB
testcase_04	AC	2,685 ms 27,220 KB
testcase_05	AC	3,378 ms 31,448 KB
testcase_06	AC	3,014 ms 29,660 KB
testcase_07	AC	2,190 ms 29,520 KB
testcase_08	AC	2,564 ms 29,524 KB
testcase_09	AC	3,711 ms 27,600 KB
testcase_10	AC	2,216 ms 29,512 KB
testcase_11	AC	1,873 ms 29,520 KB
testcase_12	AC	3,116 ms 31,704 KB
testcase_13	AC	2,534 ms 31,444 KB
testcase_14	AC	2,959 ms 29,524 KB
testcase_15	AC	2,512 ms 31,688 KB
testcase_16	AC	2,573 ms 29,652 KB
testcase_17	AC	1,782 ms 29,388 KB
testcase_18	AC	1,948 ms 31,308 KB
testcase_19	AC	1,875 ms 29,644 KB
testcase_20	AC	29 ms 25,032 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

ソースコード

raw source code

using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

public class Program
{
    public void Solve()
    {
        var c = Init(Reader.Int());
        var set = c.Run();
        int ans = set.Count() + 1;
        if (ans > c.N) Console.WriteLine(-1);
        else Console.WriteLine(ans + "\n" + string.Join(" ", Enu.Range(1, c.N).Where(i => set.Get(i - 1))));
    }


    public class MaxClique
    {
        public readonly int N;
        public BitSet[] E;
        public BitSet Ans;
        public int AnsCount;

        public MaxClique(int n)
        {
            N = n;
            E = new BitSet[N];
        }
        public void AddEdge(int a, int b)
        {
            E[a].Set(b);
            E[b].Set(a);
        }
        public BitSet Run()
        {
            Ans = new BitSet();
            AnsCount = 0;
            BitSet rem = new BitSet();
            for (int i = 0; i < N; i++) rem.Set(i);
            SearchClique(new BitSet(), rem);
            return Ans;
        }

        void SearchClique(BitSet selected, BitSet rem, int depth = 0)
        {
            int count = selected.Count();
            if (count + rem.Count() <= AnsCount) return;
            if (count > AnsCount)
            {
                AnsCount = count;
                Ans = selected;
            }
            int[] cand, deg;
            SortCand(rem, out cand, out deg);
            if (!Coloring(AnsCount - selected.Count() + 1, rem, cand, deg)) return;
            foreach (int a in cand)
            {
                rem.Reset(a);
                selected.Set(a);
                SearchClique(selected, rem.And(E[a]), depth + 1);
                selected.Reset(a);
            }
        }

        void SortCand(BitSet rem, out int[] cand, out int[] deg)
        {
            int ni = 0, a;
            int count = rem.Count();
            cand = new int[count];
            deg = new int[count];
            for (var set = rem; set.Any(); set.Reset(a))
            {
                a = set.Rightmost();
                cand[ni] = a;
                deg[ni] = E[a].And(rem).Count();
                ni++;
            }
            Array.Sort(deg, cand);
        }

        bool Coloring(int atleast, BitSet rem, int[] cand, int[] deg)
        {
            int maxColor = 0;
            var colors = new BitSet[rem.Count()];
            for (int i = cand.Length - 1; i >= 0; i--)
            {
                if (maxColor + i + 1 < atleast) return false;
                int a = cand[i];
                var e = E[a];
                for (int c = 0; ; c++)
                    if (!e.And(colors[c]).Any())
                    {
                        if (c + 1 >= atleast) return true;
                        maxColor = Math.Max(maxColor, c + 1);
                        colors[c].Set(a);
                        break;
                    }
            }
            return false;
        }
    }

    public struct BitSet : IEquatable<BitSet>
    {
        public long M1, M2;

        public BitSet(long m1, long m2) { M1 = m1; M2 = m2; }
        public void Set(int i)
        {
            if (i < 64) M1 |= 1L << i;
            else M2 |= 1L << i;
        }
        public void Reset(int i)
        {
            if (i < 64) M1 &= ~(1L << i);
            else M2 &= ~(1L << i);
        }
        public bool Get(int i)
        {
            if (i < 64) return (M1 >> i & 1) == 1;
            else return (M2 >> i & 1) == 1;
        }
        public int Rightmost()
        {
            Debug.Assert(M1 != 0 || M2 != 0);
            if (M1 != 0) return BitCount64((M1 & -M1) - 1);
            else return 64 + BitCount64((M2 & -M2) - 1);
        }
        public BitSet And(BitSet B) { return new BitSet(M1 & B.M1, M2 & B.M2); }
        public bool Any() { return M1 != 0 || M2 != 0; }
        public int Count() { return BitCount64(M1) + BitCount64(M2); }
        public bool Equals(BitSet B) { return M1 == B.M1 && M2 == B.M2; }
        public override string ToString()
        {
            var list = new List<int>();
            for (int i = 0; i < 128; i++) if (Get(i)) list.Add(i);
            return string.Join(" ", list);
        }
    }

    public static int BitCount64(long x)
    {
        x -= x >> 1 & 0x5555555555555555;
        x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333);
        return (int)((x + (x >> 4) & 0x0f0f0f0f0f0f0f0f) * 0x0101010101010101 >> 56);
    }

    MaxClique Init(int S, int minN = 2, int maxN = 121)
    {
        Func<int> Next = () => S = (int)(S * 12345L % 1000003);
        Next();
        int N = minN + S % (maxN - minN + 1);
        var clique = new MaxClique(N);
        int P = Next();
        for (int a = 0; a < N; a++)
            for (int b = a + 1; b < N; b++)
                if (Next() < P) clique.AddEdge(a, b);
        return clique;
    }

}

class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード