Submission #1271976


Source Code Expand

using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using Number = System.Int64;
using static System.Math;
using P = System.Int64;
namespace Program
{
    public class Solver
    {
        const int B = 32;
        const long M = (1L << 32) - 1;
        const long U = ~M;
        public void Solve()
        {

            var n = ri;
            var G = Enumerate(n, x => new List<KeyValuePair<int, int>>());
            for (int i = 0; i < n - 1; i++)
            {
                var a = ri - 1;
                var b = i + 1;
                var w = ri;
                G[a].Add(new KeyValuePair<int, int>(b, w));
            }
            Func<List<P>, List<P>, List<P>> g = (a, b) =>
            {
                var ret = new List<P>();
                var min = 1000000000000000;
                int i = 0, j = 0;
                while (i < a.Count && j < b.Count)
                {
                    var l = a[i];
                    var r = b[j];
                    if (min <= (l & M)) { i++; continue; }
                    if (min <= (r & M)) { j++; continue; }
                    if (l.CompareTo(r) <= 0) { i++; min = (l & M); ret.Add(l); }
                    else { j++; min = (r & M); ret.Add(r); }
                }
                while (i < a.Count)
                {
                    if (min <= (a[i] & M)) i++;
                    else { min = (a[i] & M); ret.Add(a[i++]); }
                }
                while (j < b.Count)
                {
                    if (min <= (b[j] & M)) j++;
                    else { min = (b[j] & M); ret.Add(b[j++]); }
                }

                return ret;
            };

            var s = Enumerate(n, x => new List<P>());
            Func<long, bool> f = null;
            f = x =>
            {
                for (int cur = n - 1; cur >= 0; cur--)
                {
                    if (G[cur].Count == 0) { s[cur] = new List<P>() { 0 }; continue; }
                    var l = s[G[cur][0].Key];
                    var r = s[G[cur][1].Key];
                    if (l.Count == 0) return false;
                    if (r.Count == 0) return false;
                    var u = G[cur][0].Value;
                    var v = G[cur][1].Value;
                    var a = new List<P>();
                    var b = new List<P>();

                    if (l.Count > r.Count) { Swap(ref l, ref r); Swap(ref u, ref v); }
                    var i = 0; var j = 0; var k = 0;
                    while (i < l.Count)
                    {
                        while (j < r.Count && (l[i] >> B) + (r[j] & M) + u + v > x) j++;
                        while (k + 1 < r.Count && (l[i] & M) + (r[k + 1] >> B) + u + v <= x) k++;
                        if (k < r.Count && (l[i] & M) + (r[k] >> B) + u + v <= x) a.Add((((l[i] >> B) + u) << B) + (r[k] & M) + v);
                        if (j < r.Count) b.Add((((r[j] >> B) + v) << B) + ((l[i] & M) + u));
                        i++;
                    }

                    s[cur] = g(a, b);
                }
                //Debug.WriteLine($"[{cur}], {ret.AsJoinedString()}");
                return s[0].Count > 0;
            };

            {
                long l = -1, r = 100000000;
                while (r - l > 1)
                {
                    var m = (l + r) / 2;
                    if (f(m)) r = m;
                    else l = m;
                }
                IO.Printer.Out.WriteLine(r);
            }
        }
        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 T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++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(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    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;
        public bool IsEndOfStream { get { return isEof; } }
        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 = (char)read())
                if (b == 0) break;
                else if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
#endregion
#region Compair
static public class Pair
{
    static public Pair<FT, ST> Create<FT, ST>(FT f, ST s) where FT : IComparable<FT> where ST : IComparable<ST>
    {
        return new Pair<FT, ST>(f, s);
    }
    static public Pair<FT, ST> Min<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q) where FT : IComparable<FT> where ST : IComparable<ST>
    {
        return (p.CompareTo(q) <= 0) ? p : q;
    }
    static public Pair<FT, ST> Max<FT, ST>(Pair<FT, ST> p, Pair<FT, ST> q) where FT : IComparable<FT> where ST : IComparable<ST>
    {
        return (p.CompareTo(q) >= 0) ? p : q;
    }
}
public struct Pair<FT, ST>: IComparable<Pair<FT, ST>> where FT : IComparable<FT> where ST : IComparable<ST>
{
    public FT x;
    public ST y;
    public Pair(FT f, ST s) : this() { x = f; y = s; }

    public int CompareTo(Pair<FT, ST> other)
    {
        var cmp = x.CompareTo(other.x);
        return cmp != 0 ? cmp : y.CompareTo(other.y);
    }
    public override string ToString() { return string.Format("[{0} {1}]", x, y); }
}
#endregion

Submission Info

Submission Time
Task E - Shik and Travel
User camypaper
Language C# (Mono 4.6.2.0)
Score 0
Code Size 8972 Byte
Status WA
Exec Time 1408 ms
Memory 80936 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 4
AC × 50
WA × 4
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt, example3.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, example0.txt, example1.txt, example2.txt, example3.txt
Case Name Status Exec Time Memory
000.txt AC 36 ms 16036 KB
001.txt AC 36 ms 18212 KB
002.txt AC 37 ms 18084 KB
003.txt AC 37 ms 20132 KB
004.txt AC 37 ms 20132 KB
005.txt AC 38 ms 18084 KB
006.txt AC 37 ms 18212 KB
007.txt AC 37 ms 16036 KB
008.txt AC 36 ms 16036 KB
009.txt AC 37 ms 13988 KB
010.txt AC 1306 ms 65204 KB
011.txt AC 1250 ms 60808 KB
012.txt AC 1330 ms 63112 KB
013.txt AC 1275 ms 67200 KB
014.txt AC 1151 ms 63264 KB
015.txt AC 1306 ms 63176 KB
016.txt AC 1318 ms 63168 KB
017.txt AC 1357 ms 65188 KB
018.txt AC 1264 ms 63072 KB
019.txt AC 1266 ms 63144 KB
020.txt AC 1288 ms 63068 KB
021.txt AC 1331 ms 65128 KB
022.txt AC 1351 ms 65208 KB
023.txt AC 1390 ms 67248 KB
024.txt AC 1338 ms 67228 KB
025.txt AC 1318 ms 67284 KB
026.txt AC 1275 ms 63084 KB
027.txt AC 1249 ms 65240 KB
028.txt AC 1295 ms 63144 KB
029.txt AC 1295 ms 63220 KB
030.txt AC 1258 ms 65348 KB
031.txt AC 1405 ms 63240 KB
032.txt AC 1323 ms 65188 KB
033.txt AC 1237 ms 69464 KB
034.txt AC 1267 ms 65352 KB
035.txt AC 1408 ms 63036 KB
036.txt AC 1277 ms 65360 KB
037.txt AC 1237 ms 67384 KB
038.txt AC 1270 ms 65320 KB
039.txt AC 1275 ms 65256 KB
040.txt AC 1280 ms 80532 KB
041.txt AC 1101 ms 78524 KB
042.txt AC 1078 ms 80936 KB
043.txt AC 1067 ms 79092 KB
044.txt AC 858 ms 63208 KB
045.txt WA 845 ms 65208 KB
046.txt WA 849 ms 61212 KB
047.txt WA 846 ms 64912 KB
048.txt WA 846 ms 65204 KB
049.txt AC 25 ms 9428 KB
example0.txt AC 25 ms 9428 KB
example1.txt AC 25 ms 11476 KB
example2.txt AC 25 ms 11476 KB
example3.txt AC 25 ms 11476 KB