結果

問題 No.1115 二つの数列 / Two Sequences
ユーザー yupiteru_kunyupiteru_kun
提出日時 2020-07-17 21:31:57
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 251 ms / 2,000 ms
コード長 8,344 bytes
コンパイル時間 3,526 ms
コンパイル使用メモリ 113,320 KB
実行使用メモリ 36,824 KB
最終ジャッジ日時 2023-08-19 23:53:38
合計ジャッジ時間 12,112 ms
ジャッジサーバーID
（参考情報） 		judge10 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 121 ms
25,180 KB
testcase_01 AC 111 ms
26,796 KB
testcase_02 AC 112 ms
24,880 KB
testcase_03 AC 230 ms
33,676 KB
testcase_04 AC 250 ms
34,776 KB
testcase_05 AC 231 ms
35,692 KB
testcase_06 AC 220 ms
35,288 KB
testcase_07 AC 249 ms
34,728 KB
testcase_08 AC 117 ms
26,788 KB
testcase_09 AC 185 ms
29,100 KB
testcase_10 AC 245 ms
36,696 KB
testcase_11 AC 112 ms
24,932 KB
testcase_12 AC 251 ms
34,716 KB
testcase_13 AC 251 ms
36,824 KB
testcase_14 AC 250 ms
34,712 KB
testcase_15 AC 110 ms
22,904 KB
testcase_16 AC 112 ms
26,808 KB
testcase_17 AC 112 ms
24,816 KB
testcase_18 AC 112 ms
26,784 KB
testcase_19 AC 112 ms
24,808 KB
testcase_20 AC 112 ms
24,896 KB
testcase_21 AC 112 ms
24,832 KB
testcase_22 AC 112 ms
26,904 KB
testcase_23 AC 122 ms
27,280 KB
testcase_24 AC 159 ms
29,748 KB
testcase_25 AC 214 ms
33,140 KB
testcase_26 AC 132 ms
23,988 KB
testcase_27 AC 170 ms
30,288 KB
testcase_28 AC 191 ms
29,196 KB
testcase_29 AC 221 ms
33,224 KB
testcase_30 AC 246 ms
34,316 KB
testcase_31 AC 142 ms
28,480 KB
testcase_32 AC 132 ms
27,672 KB
testcase_33 AC 230 ms
33,740 KB
testcase_34 AC 112 ms
26,804 KB
testcase_35 AC 112 ms
26,680 KB
testcase_36 AC 112 ms
22,792 KB
testcase_37 AC 112 ms
24,888 KB
testcase_38 AC 110 ms
24,832 KB
testcase_39 AC 113 ms
26,860 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.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using Library;

namespace Program
{
    public static class ProblemC
    {
        static bool SAIKI = false;
        static public int numberOfRandomCases = 0;
        static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
        {
        }
        static public void Solve()
        {
            var n = NN;
            var aList = NNList(n);
            var bList = NNList(n);
            var dic = aList.Select((e, i) => new { e, i }).OrderBy(e => e.e).Select(e => e.i + 1).ToArray();
            var list = bList.Select(e => dic[e - 1]).ToArray();
            var ans = 0L;
            var bit = new LIB_BinaryIndexedTree(n);
            for (var i = 0; i < n; i++)
            {
                ans += i - bit.Sum(list[i]);
                bit[list[i]] += 1;
            }
            Console.WriteLine(ans);
        }
        class Printer : StreamWriter
        {
            public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
            public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
            public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
        }
        static LIB_FastIO fastio = new LIB_FastIODebug();
        static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
        static long NN => fastio.Long();
        static double ND => fastio.Double();
        static string NS => fastio.Scan();
        static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
        static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
        static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
        static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
        static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
        static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
        static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
        static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
        static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
        static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
        static IEnumerator<uint> _xsi = _xsc();
        static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
    }
}
namespace Library {
    class LIB_BinaryIndexedTree
    {
        long n;
        long[] dat;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_BinaryIndexedTree(long size)
        {
            n = size;
            dat = new long[n + 1];
        }
        public long this[long idx]
        {
            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            get { return Sum(idx) - Sum(idx - 1); }
            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            set { Add(idx, -this[idx]); Add(idx, value); }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public long Sum(long idx)
        {
            var ret = 0L;
            while (idx > 0)
            {
                ret += dat[idx];
                idx -= idx & -idx;
            }
            return ret;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public void Add(long idx, long value)
        {
            if (idx <= 0) throw new Exception("1-indexed");
            while (idx <= n)
            {
                dat[idx] += value;
                idx += idx & -idx;
            }
        }
    }
    class LIB_FastIO
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIO() { str = Console.OpenStandardInput(); }
        readonly Stream str;
        readonly byte[] buf = new byte[1024];
        int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream
        {
            [MethodImpl(MethodImplOptions.AggressiveInlining)]
            get { return isEof; }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        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++];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        char Char()
        {
            byte b = 0;
            do b = read();
            while (b < 33 || 126 < b);
            return (char)b;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public long Long()
        {
            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';
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
    class LIB_FastIODebug : LIB_FastIO
    {
        Queue<string> param = new Queue<string>();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIODebug() { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string Scan() => NextString();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override long Long() => long.Parse(NextString());
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override double Double() => double.Parse(NextString());
    }
}
0