結果

問題 No.1266 7 Colors
ユーザー EmKjp
提出日時 2020-10-24 18:17:21
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 490 ms / 3,000 ms
コード長 9,815 bytes
コンパイル時間 2,295 ms
コンパイル使用メモリ 121,776 KB
実行使用メモリ 63,680 KB
最終ジャッジ日時 2024-07-21 15:22:59
合計ジャッジ時間 9,730 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;
using E = System.Linq.Enumerable;
using System.Threading;
internal partial class Solver {
    private static int PopCount(ulong x) {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fUL;
        x += x >> 8;
        x += x >> 16;
        x += x >> 32;
        return (int)(x & 0x7FLU);
    }
    static int ToInt(string color) {
        int r = 0;
        for (int i = 0; i < color.Length; i++) {
            if (color[i] == '1') r |= 1 << i;
        }
        return r;
    }
    static int ToId(int x, int color) {
        return x * 7 + color;
    }
    public void Run() {
        var n = ni();
        var m = ni();
        var q = ni();
        var s = ns(n);
        var colors = s.Select(ToInt).ToArray();
        var adj = Enumerable.Range(0, n + 7).Select(_ => new List<int>()).ToArray();
        for (int i = 0; i < m; i++) {
            var a = ni() - 1;
            var b = ni() - 1;
            adj[a].Add(b);
            adj[b].Add(a);
        }
        var weight = new int[7 * n * 2];
        for (int i = 0; i < 7 * n; i++) {
            weight[i] = 1;
        }
        var D = new DisjointSet(7 * n * 2, weight);
        var offset = 7 * n;
        var exists = new bool[n, 7];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 7; j++) {
                if (s[i][j] == '1') {
                    exists[i, j] = true;
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 7; j++) {
                if (exists[i, j]) {
                    D.Unite(ToId(i, j), ToId(i, j) + offset);
                    int k = (j + 1) % 7;
                    if (exists[i, k]) {
                        D.Unite(ToId(i, j), ToId(i, k));
                    }
                    foreach (var next in adj[i]) {
                        if (exists[next, j]) {
                            D.Unite(ToId(i, j) + offset, ToId(next, j) + offset);
                        }
                    }
                }
            }
        }
        for (int _ = 0; _ < q; _++) {
            var t = ni();
            var x = ni();
            var y = ni();
            if (t == 1) {
                x--; y--;
                // Add color y to city x
                exists[x, y] = true;
                D.Unite(ToId(x, y), ToId(x, y) + offset);
                var y0 = (y + 8) % 7;
                if (exists[x, y0]) {
                    D.Unite(ToId(x, y), ToId(x, y0));
                }
                var y1 = (y + 6) % 7;
                if (exists[x, y1]) {
                    D.Unite(ToId(x, y), ToId(x, y1));
                }
                foreach (var next in adj[x]) {
                    if (exists[next, y]) {
                        D.Unite(ToId(x, y) + offset, ToId(next, y) + offset);
                    }
                }
            } else { // 2
                cout.WriteLine(D.Weight(ToId(x - 1, 0)));
            }
        }
    }
}
public class DisjointSet {
    private readonly long[] _group;
    private readonly long[] _weight;
    public int GroupCount { get; private set; }
    public DisjointSet(int n, int[] weight = null) {
        _group = new long[n];
        _weight = new long[n];
        for (int i = 0; i < _group.Length; i++) {
            _group[i] = -1;
            _weight[i] = weight[i];
        }
        GroupCount = n;
    }
    public bool Unite(int x, int y) {
        x = Root(x); y = Root(y);
        if (x == y) {
            return false;
        }
        if (_group[y] < _group[x]) {
            return Unite(y, x);
        }
        _group[x] += _group[y];
        _weight[x] += _weight[y];
        _group[y] = x;
        GroupCount--;
        return true;
    }
    public bool IsSameSet(int x, int y) { return Root(x) == Root(y); }
    public int Root(int x) { return _group[x] < 0 ? x : (int)(_group[x] = Root((int)_group[x])); }
    public long Size(int x) { return -_group[Root(x)]; }
    public long Weight(int x) { return _weight[Root(x)]; }
};
// PREWRITEN CODE BEGINS FROM HERE
static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}
internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }
#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052
    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }
    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
}
#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif
public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;
    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);
    public Scanner()
        : this(Console.In) {
    }
    public Scanner(TextReader reader) {
        Reader = reader;
    }
    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }
        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }
        return array;
    }
    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }
        return array;
    }
    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }
        return array;
    }
    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }
    public bool HasNext() {
        if (Token != null) {
            return true;
        }
        return StockToken();
    }
    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }
            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }
            return false;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0