結果

問題 No.1240 Or Sum of Xor Pair
ユーザー りあんりあん
提出日時 2020-09-25 21:58:08
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,767 ms / 2,000 ms
コード長 8,882 bytes
コンパイル時間 2,700 ms
コンパイル使用メモリ 121,924 KB
実行使用メモリ 134,364 KB
最終ジャッジ日時 2024-06-28 06:34:49
合計ジャッジ時間 20,267 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
19,328 KB
testcase_01 AC 29 ms
19,200 KB
testcase_02 AC 30 ms
19,072 KB
testcase_03 AC 58 ms
27,392 KB
testcase_04 AC 58 ms
27,520 KB
testcase_05 AC 55 ms
27,520 KB
testcase_06 AC 54 ms
27,648 KB
testcase_07 AC 52 ms
27,520 KB
testcase_08 AC 42 ms
23,552 KB
testcase_09 AC 55 ms
27,520 KB
testcase_10 AC 185 ms
48,640 KB
testcase_11 AC 203 ms
49,792 KB
testcase_12 AC 313 ms
60,308 KB
testcase_13 AC 284 ms
56,508 KB
testcase_14 AC 313 ms
60,016 KB
testcase_15 AC 1,634 ms
119,808 KB
testcase_16 AC 1,498 ms
119,860 KB
testcase_17 AC 1,524 ms
125,308 KB
testcase_18 AC 1,545 ms
127,540 KB
testcase_19 AC 1,504 ms
125,284 KB
testcase_20 AC 1,601 ms
125,708 KB
testcase_21 AC 1,539 ms
127,600 KB
testcase_22 AC 1,667 ms
127,460 KB
testcase_23 AC 1,422 ms
127,468 KB
testcase_24 AC 1,562 ms
128,024 KB
testcase_25 AC 1,767 ms
125,808 KB
testcase_26 AC 1,570 ms
127,740 KB
testcase_27 AC 31 ms
25,264 KB
testcase_28 AC 30 ms
25,392 KB
testcase_29 AC 388 ms
55,580 KB
testcase_30 AC 200 ms
45,516 KB
testcase_31 AC 239 ms
49,208 KB
testcase_32 AC 724 ms
134,364 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 28); // 256 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        int n, x;
        sc.Multi(out n, out x);
        --x;
        var a = sc.IntArr;
        var s = new string[n];
        var trie = new Trie('0', 2);
        for (int i = 0; i < n; i++)
        {
            var c = new char[18];
            for (int j = 0; j < 18; j++)
            {
                c[j] = (char)(((a[i] >> (18 - j - 1)) & 1) + '0');
            }
            s[i] = new string(c);
        }
        foreach (var item in s)
        {
            trie.insert(item);
        }
        long ans = 0;
        foreach (var item in a)
        {
            ans -= item;
            var node = trie;
            for (int i = 18 - 1; i >= 0 ; i--)
            {
                if (node == null) break;
                int xi = (x >> i) & 1;
                int ai = (item >> i) & 1;
                if (xi == 0) {
                    node = node.childs[ai];
                }
                else {
                    if (node.childs[ai] != null) {
                        for (int j = 0; j < 18; j++)
                        {
                            ans += (1 << (18 - j - 1)) * (long)node.childs[ai].cnt1[j];
                            ans += (item & (1 << (18 - j - 1))) * (long)(node.childs[ai].cnt - node.childs[ai].cnt1[j]);
                        }
                    }
                    node = node.childs[ai ^ 1];
                }
            }
            if (node != null) {
                for (int j = 0; j < 18; j++)
                {
                    ans += (1 << (18 - j - 1)) * (long)node.cnt1[j];
                    ans += (item & (1 << (18 - j - 1))) * (long)(node.cnt - node.cnt1[j]);
                }
            }
        }
        Prt(ans / 2);

    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}
class Trie {
    public int cnt, dep;
    private readonly char fir;
    private readonly int len;
    public int[] cnt1;
    public Trie[] childs;

    public Trie(char fir, int len) : this(fir, len, 0) {}
    Trie(char fir, int len, int dep) {
        cnt = 0;
        this.dep = dep;
        this.fir = fir;
        this.len = len;
        childs = new Trie[len];
        cnt1 = new int[18];
    }

    // Count(prefix == s)
    public int getcnt(string s) {
        if (dep == s.Length) return cnt;
        if (childs[s[dep] - fir] == null) return 0;
        return childs[s[dep] - fir].getcnt(s);
    }
    public int get_longest_prefix(string s) {
        if (dep == s.Length) return dep;
        if (childs[s[dep] - fir] == null) return dep;
        return childs[s[dep] - fir].get_longest_prefix(s);
    }
    public void insert(string s) {
        ++cnt;
        for (int i = 0; i < s.Length; i++)
        {
            if (s[i] == '1') {
                ++cnt1[i];
            }
        }
        if (dep == s.Length) return;
        if (childs[s[dep] - fir] == null) childs[s[dep] - fir] = new Trie(fir, len, dep + 1);
        childs[s[dep] - fir].insert(s);
    }
    public void calc() {}
}
0