#802562 (C#) No.2089 置換の符号

提出ソース

結果

問題	No.2089 置換の符号
ユーザー	KumaTachiRen
提出日時	2022-09-30 21:29:03
言語	C# (.NET 8.0.203)
結果	AC
実行時間	47 ms / 2,000 ms
コード長	6,902 bytes
コンパイル時間	11,175 ms
コンパイル使用メモリ	143,988 KB
実行使用メモリ	163,680 KB
最終ジャッジ日時	2023-08-24 14:45:27
合計ジャッジ時間	13,443 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	39 ms 23,032 KB
testcase_01	AC	46 ms 27,868 KB
testcase_02	AC	40 ms 23,140 KB
testcase_03	AC	39 ms 23,132 KB
testcase_04	AC	45 ms 28,072 KB
testcase_05	AC	45 ms 27,740 KB
testcase_06	AC	40 ms 23,120 KB
testcase_07	AC	45 ms 27,748 KB
testcase_08	AC	39 ms 23,216 KB
testcase_09	AC	45 ms 27,928 KB
testcase_10	AC	45 ms 28,028 KB
testcase_11	AC	39 ms 23,044 KB
testcase_12	AC	39 ms 23,052 KB
testcase_13	AC	39 ms 25,180 KB
testcase_14	AC	45 ms 27,832 KB
testcase_15	AC	40 ms 23,132 KB
testcase_16	AC	39 ms 23,328 KB
testcase_17	AC	45 ms 29,780 KB
testcase_18	AC	39 ms 23,280 KB
testcase_19	AC	44 ms 27,776 KB
testcase_20	AC	46 ms 28,052 KB
testcase_21	AC	40 ms 23,064 KB
testcase_22	AC	40 ms 23,180 KB
testcase_23	AC	46 ms 27,680 KB
testcase_24	AC	39 ms 23,212 KB
testcase_25	AC	40 ms 23,372 KB
testcase_26	AC	45 ms 27,944 KB
testcase_27	AC	45 ms 27,988 KB
testcase_28	AC	47 ms 27,760 KB
testcase_29	AC	47 ms 29,864 KB
testcase_30	AC	46 ms 27,816 KB
testcase_31	AC	47 ms 27,788 KB
testcase_32	AC	46 ms 163,680 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 155 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.0/publish/

ソースコード

raw source code

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 static Functions;

using N = System.Int64;

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

public class Solver
{
    public void Solve()
    {
        int n = ri;
        var bit = new BinaryIndexedTree<int>(n, (x, y) => x ^ y, 0);
        int ans = (n * (n - 1) / 2) & 1;
        for (int i = 0; i < n; i++)
        {
            int a = ri - 1;
            ans ^= bit.Sum(a);
            bit.Add(a, 1);
        }
        Write(ans == 0 ? 1 : -1);
    }

    class BinaryIndexedTree<T>
    {
        int size;
        T[] data;
        T e;
        Func<T, T, T> op;
        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(T[] arr, Func<T, T, T> _op, T _e)
        {
            size = arr.Length + 1;
            op = _op;
            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 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;
        }
    }

    const long inf = (long)1 << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    void WriteJoin<T>(string s, T[] t) { Console.WriteLine(string.Join(s, t)); }
    void WriteJoin<T>(string s, List<T> t) { Console.WriteLine(string.Join(s, t)); }
    void Write<T>(T t) { Console.WriteLine(t.ToString()); }
    void WriteFlush<T>(T t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    void WriteError<T>(T t) { Console.Error.WriteLine(t.ToString()); }
    void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); }
    void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); }
    void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); }
}

public static class Functions
{
    public static int Popcount(long x)
    {
        x = x - ((x >> 1) & 0x5555555555555555);
        x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333);
        x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f;
        x = x + (x >> 8);
        x = x + (x >> 16);
        x = x + (x >> 32);
        return (int)(x & 0x0000007f);
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((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;
    }
    public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    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);
    public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    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, S>(in T[] list, S val, Func<T, S, int> comp)
    {
        if (list.Length == 0) return -1;
        if (comp(list.Last(), val) <= 0) return list.Length;
        int l = 0, r = list.Length;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int LowerBound<T, S>(in List<T> list, S val, Func<T, S, int> comp)
    {
        if (list.Count == 0) return -1;
        if (comp(list.Last(), val) <= 0) return list.Count;
        int l = 0, r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) < 0) l = x + 1;
            else r = x;
        }
        return l;
    }
    public static int UpperBound<T, S>(in List<T> list, S val, Func<T, S, int> comp)
    {
        if (list.Count == 0) return 0;
        if (comp(list.Last(), val) < 0) return list.Count;
        int l = 0, r = list.Count;
        while (l < r)
        {
            int x = (l + r) / 2;
            if (comp(list[x], val) <= 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 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 double Double() { return double.Parse(Scan()); }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード