結果

問題 No.814 ジジ抜き
コンテスト
ユーザー 紙ぺーぱー
提出日時 2019-04-14 17:14:16
言語 C#(csc)
(csc 3.9.0)
結果
MLE  
実行時間 -
コード長 5,543 bytes
コンパイル時間 1,121 ms
コンパイル使用メモリ 118,916 KB
実行使用メモリ 119,048 KB
最終ジャッジ日時 2024-09-19 05:44:40
合計ジャッジ時間 9,199 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2 MLE * 1
other AC * 3 MLE * 1 -- * 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Trace;
using SB = System.Text.StringBuilder;
//using System.Numerics;
using static System.Math;
using Number = System.Int64;
namespace Program {
    public class Solver {
        Random rnd = new Random(0);
        public void Solve() {
            var n = ri;
            var A = Enumerate(60, x => new List<KeyValuePair<long, long>>());
            foreach (var i in Rep(n)) {
                var k = rl;
                var l = rl;
                var d = ri;
                A[d].Add(new KeyValuePair<long, long>(l, k));

            }
            var s = new SortedMap<long, SortedSet<long>>();
            for (int i = 0; i < 60; i++) {
                var ns = new SortedMap<long, SortedSet<long>>();
                if (i > 0) {
                    foreach (var x in s) {
                        foreach (var y in x.Value) {
                            var x0 = x.Key;
                            var x1 = x.Key + (1L << (i - 1));
                            var y0 = (y + 1) / 2;
                            var y1 = y / 2;
                            flip(ns, x0, y0);
                            flip(ns, x1, y1);
                        }
                    }
                }
                foreach (var kv in A[i]) {
                    var key = kv.Key % (1L << i);
                    var min = kv.Key >> i;
                    var max = (kv.Key >> i) + kv.Value;
                    //Debug.WriteLine(key);
                    //Debug.WriteLine(min);
                    //Debug.WriteLine(max);
                    flip(ns, key, min);
                    flip(ns, key, max);
                }
                //Debug.WriteLine("size");
                //Debug.WriteLine(ns.Count);
                s = ns;
            }

            var ans = -1L;
            foreach (var x in s) {
                //Debug.WriteLine(x.Value.AsJoinedString());
                if (x.Value.Count > 0) ans = x.Key + x.Value.Min * (1L << 59);
            }
            Console.WriteLine(ans);
        }
        void flip(SortedMap<long, SortedSet<long>> map, long k, long v) {
            if (!map[k].Add(v)) map[k].Remove(v);
        }

        const long INF = 1L << 60;
        int ri => sc.Integer();
        long rl => sc.Long();
        double rd => sc.Double();
        string rs => sc.Scan();
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static IEnumerable<int> Rep(int n) => Enumerable.Range(0, n);
        static IEnumerable<int> RRep(int n) => Enumerable.Range(0, n).Reverse();
        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < a.Length; ++i) a[i] = f(i);
            return a;
        }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}
#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer : StreamWriter {
        public override IFormatProvider FormatProvider => CultureInfo.InvariantCulture;
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0) {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }
        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}

#endregion


#region SortedMap<K,V>
public class SortedMap<K, V> : SortedDictionary<K, V>
where V : new() {
    //public SortedMap(IComparer<K> cmp) : base(cmp) { }
    new public V this[K i] {
        get {
            V v;
            return TryGetValue(i, out v) ? v : base[i] = new V();
        }
        set { base[i] = value; }
    }
}
#endregion
0