結果

問題 No.2242 Cities and Teleporters
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-03-10 23:13:22
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 12,123 bytes
コンパイル時間 9,089 ms
コンパイル使用メモリ 169,724 KB
実行使用メモリ 252,008 KB
最終ジャッジ日時 2024-09-18 05:23:35
合計ジャッジ時間 43,504 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
31,232 KB
testcase_01 AC 59 ms
31,360 KB
testcase_02 AC 59 ms
29,440 KB
testcase_03 AC 58 ms
29,568 KB
testcase_04 AC 62 ms
31,104 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 1,539 ms
91,776 KB
testcase_12 AC 1,476 ms
90,624 KB
testcase_13 AC 1,537 ms
92,268 KB
testcase_14 AC 1,578 ms
92,672 KB
testcase_15 AC 1,537 ms
92,288 KB
testcase_16 AC 1,581 ms
93,036 KB
testcase_17 AC 1,616 ms
93,824 KB
testcase_18 AC 1,492 ms
95,876 KB
testcase_19 AC 1,484 ms
91,904 KB
testcase_20 AC 1,486 ms
91,904 KB
testcase_21 AC 1,477 ms
90,752 KB
testcase_22 AC 1,415 ms
90,368 KB
testcase_23 AC 1,558 ms
92,672 KB
testcase_24 AC 1,535 ms
92,544 KB
testcase_25 AC 1,517 ms
252,008 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (96 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using System.Diagnostics;
using System;
using System.Linq;
using System.Numerics;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Text;
using System.Runtime.CompilerServices;
using static Functions;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {
        Solve();
    }

    void Solve()
    {
        int n = ri;
        var h = new int[n];
        var t = new int[n];
        for (int i = 0; i < n; i++) h[i] = ri;
        for (int i = 0; i < n; i++) t[i] = ri;
        var ht = new List<(int i, int h, int t)>();
        for (int i = 0; i < n; i++) ht.Add((i, h[i], t[i]));
        ht.Sort((p1, p2) => p1.h - p2.h);

        var set = new SortedSet<int>();
        for (int i = 0; i < n; i++) set.Add(h[i]);
        for (int i = 0; i < n; i++) set.Add(t[i]);
        var list = set.ToList();
        var dic = new Dictionary<int, int>();
        for (int i = 0; i < list.Count; i++) dic.Add(list[i], i);
        var bit = new BinaryIndexedTree<int>(set.Count, (x, y) => Math.Max(x, y), -1);
        for (int i = 0; i < n; i++) bit.Add(dic[ht[i].h], i);

        int log = 0;
        while ((1 << log) < n) log++;
        var db = new int[n, log];
        for (int i = 0; i < n; i++) db[i, 0] = bit.Sum(dic[ht[i].t]);
        for (int i = 0; i + 1 < n; i++) Chmax(ref db[i + 1, 0], db[i, 0]);
        for (int l = 1; l < log; l++)
            for (int i = 0; i < n; i++)
                db[i, l] = db[i, l - 1] == -1 ? -1 : db[db[i, l - 1], l - 1];

        var idx = new Dictionary<int, int>();
        for (int i = 0; i < n; i++) idx.Add(ht[i].i, i);
        int q = ri;
        var ans = new List<int>();
        for (int i = 0; i < q; i++)
        {
            int a = idx[ri - 1], b = idx[ri - 1];
            a = bit.Sum(dic[ht[a].t]);
            if (b <= a)
            {
                ans.Add(1);
                continue;
            }
            if (a == -1)
            {
                ans.Add(-1);
                continue;
            }
            if (db[a, log - 1] < b)
            {
                ans.Add(-1);
                continue;
            }
            int cnt = 1;
            int x = log - 1;
            while (true)
            {
                if (db[a, 0] >= b)
                {
                    cnt++;
                    break;
                }
                while (db[a, x] >= b) x--;
                cnt += 1 << x;
                a = db[a, x];
            }
            ans.Add(cnt);
        }
        WriteJoin("\n", ans);
    }

    const long INF = 1L << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    ulong rul { get { return sc.UInteger(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    string rline { get { return sc.Line(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t));
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteMat<T>(T[,] a)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var s = new List<string>();
            for (int j = 0; j < sz2; j++) s.Add(a[i, j].ToString());
            WriteJoin(" ", s);
        }
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteFlush(object t)
    { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteError(object t) => Console.Error.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void YN(bool t) => Console.WriteLine(t ? "YES" : "NO");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void yn(bool t) => Console.WriteLine(t ? "yes" : "no");
}

public static class Functions
{
    public static int Popcount(ulong x)
    {
        x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL);
        x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL);
        x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL);
        x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL);
        x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL);
        x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL);
        return (int)x;
    }
    public static int Popcount(int x)
    {
        x = (x & 0x55555555) + ((x >> 1) & 0x55555555);
        x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
        x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f);
        x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff);
        x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff);
        return x;
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((ulong)((x & -x) - 1));
    }
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + m : r;
    }
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + m : r;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound<T>(in T[] arr, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (arr.Length == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = arr.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(arr[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int LowerBound<T>(in List<T> list, Func<T, int> comp, int l = -1, int r = -1)
    {
        if (list.Count == 0) return -1;
        if (l == -1) l = 0;
        if (r == -1) r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x]) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
}

public class StreamScanner
{
    public StreamScanner(Stream stream) { str = stream; }
    private 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) throw new EndOfStreamException();
        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);
        return (char)b;
    }
    public string Line()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    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 long Integer()
    {
        long ret = 0; byte b = 0; var ng = false;
        do b = read();
        while (b != '-' && (b < '0' || '9' < b));
        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 ulong UInteger()
    {
        ulong ret = 0; byte b = 0;
        do b = read();
        while (b < '0' || '9' < b);
        for (; true; b = read())
        {
            if (b < '0' || '9' < b) return ret;
            else ret = ret * 10 + b - '0';
        }
    }
    public double Double() { return double.Parse(Scan()); }
}

class BinaryIndexedTree<T>
{
    int size;
    T[] data;
    T e;
    Func<T, T, T> op;
    Func<T, T> inv;
    public BinaryIndexedTree(int _size, Func<T, T, T> _op, T _e)
    {
        size = _size + 1;
        op = _op;
        e = _e;
        data = new T[size];
        for (int i = 0; i < size; i++) data[i] = e;
    }
    public BinaryIndexedTree(int _size, Func<T, T, T> _op, Func<T, T> _inv, T _e)
    {
        size = _size + 1;
        op = _op;
        inv = _inv;
        e = _e;
        data = new T[size];
        for (int i = 0; i < size; i++) data[i] = e;
    }
    public BinaryIndexedTree(T[] arr, Func<T, T, T> _op, Func<T, T> _inv, T _e)
    {
        size = arr.Length + 1;
        op = _op;
        inv = _inv;
        data = new T[size];
        for (int i = 0; i < size; i++) data[i] = e;
        for (int i = 0; i < size - 1; i++) AddSub(i + 1, arr[i]);
    }
    public void Add(int x, T v) => AddSub(x + 1, v);
    private void AddSub(int x, T v)
    {
        for (int i = x; i < size; i += i & -i) data[i] = op(data[i], v);
    }

    public T Sum(int l, int r) => op(SumSub(r + 1), inv(SumSub(l)));

    public T Sum(int x) => SumSub(x + 1);
    private T SumSub(int x)
    {
        T ret = e;
        for (int i = x; i > 0; i -= i & -i) ret = op(ret, data[i]);
        return ret;
    }
}
0