結果

問題 No.1209 XOR Into You
ユーザー りあんりあん
提出日時 2020-08-30 13:35:50
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 209 ms / 2,000 ms
コード長 7,366 bytes
コンパイル時間 2,107 ms
コンパイル使用メモリ 123,908 KB
実行使用メモリ 53,520 KB
最終ジャッジ日時 2024-04-27 07:00:16
合計ジャッジ時間 10,471 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
25,460 KB
testcase_01 AC 32 ms
25,324 KB
testcase_02 AC 34 ms
25,520 KB
testcase_03 AC 32 ms
25,396 KB
testcase_04 AC 107 ms
42,556 KB
testcase_05 AC 106 ms
44,724 KB
testcase_06 AC 171 ms
52,404 KB
testcase_07 AC 188 ms
49,464 KB
testcase_08 AC 172 ms
53,520 KB
testcase_09 AC 163 ms
47,296 KB
testcase_10 AC 140 ms
48,480 KB
testcase_11 AC 167 ms
51,260 KB
testcase_12 AC 151 ms
50,248 KB
testcase_13 AC 173 ms
51,940 KB
testcase_14 AC 149 ms
49,912 KB
testcase_15 AC 154 ms
52,608 KB
testcase_16 AC 153 ms
52,472 KB
testcase_17 AC 148 ms
49,856 KB
testcase_18 AC 209 ms
52,616 KB
testcase_19 AC 152 ms
50,288 KB
testcase_20 AC 173 ms
50,204 KB
testcase_21 AC 139 ms
48,196 KB
testcase_22 AC 178 ms
50,652 KB
testcase_23 AC 177 ms
53,376 KB
testcase_24 AC 184 ms
52,348 KB
testcase_25 AC 195 ms
50,320 KB
testcase_26 AC 197 ms
52,512 KB
testcase_27 AC 197 ms
48,996 KB
testcase_28 AC 195 ms
53,336 KB
testcase_29 AC 197 ms
50,928 KB
testcase_30 AC 195 ms
52,524 KB
testcase_31 AC 142 ms
51,532 KB
testcase_32 AC 141 ms
49,488 KB
testcase_33 AC 144 ms
51,672 KB
testcase_34 AC 149 ms
51,060 KB
testcase_35 AC 144 ms
51,672 KB
testcase_36 AC 143 ms
51,408 KB
testcase_37 AC 144 ms
51,856 KB
testcase_38 AC 170 ms
49,272 KB
testcase_39 AC 148 ms
51,200 KB
testcase_40 AC 187 ms
50,600 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>;
using Number = System.Int64;

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 = sc.Int;
        var a = sc.IntArr;
        var b = sc.IntArr;
        if (a[0] != b[0] || a.Last() != b.Last()) {
            Prt(-1);
            return;
        }
        var xa = new int[n - 1];
        var xb = new int[n - 1];
        var dic = new Dictionary<int, Queue<int>>();
        for (int i = 0; i < n - 1; i++)
        {
            xa[i] = a[i] ^ a[i + 1];
            xb[i] = b[i] ^ b[i + 1];
            if (!dic.ContainsKey(xa[i])) {
                dic.Add(xa[i], new Queue<int>());
            }
            dic[xa[i]].Enqueue(i);
        }
        var bit = new BIT(n - 1);
        long ans = 0;
        foreach (var item in xb)
        {
            if (!dic.ContainsKey(item) || !dic[item].Any()) {
                Prt(-1);
                return;
            }
            int i = dic[item].Dequeue();
            ans += i - bit.sum(i);
            bit.add(i, 1);
        }
        Prt(ans);
    }
}

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 BIT {
    int n;
    Number[] bit;
    public BIT(int n) {
        this.n = n;
        bit = new Number[n];
    }
    public void add(int j, Number w) {
        for (int i = j; i < n; i |= i + 1) bit[i] += w;
    }
    public Number sum(int j) {
        Number res = 0;
        for (int i = j - 1; i >= 0; i = (i & i + 1) - 1) res += bit[i];
        return res;
    }
    public Number sum(int j, int k) => sum(k) - sum(j);
}
0