結果

問題 No.742 にゃんにゃんにゃん 猫の挨拶
ユーザー claw88claw88
提出日時 2018-10-05 21:40:59
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 54 ms / 2,500 ms
コード長 2,604 bytes
コンパイル時間 1,010 ms
コンパイル使用メモリ 113,100 KB
実行使用メモリ 31,532 KB
最終ジャッジ日時 2024-10-12 13:55:11
合計ジャッジ時間 2,254 ms
ジャッジサーバーID
(参考情報)
judge2 / judge
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;
class Program
{
static void Main()
{
//SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
new Program().solve();
Out.Flush();
}
Scanner cin = new Scanner();
readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
readonly int mod = 1000000007;
void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }
void solve()
{
int N = cin.nextint;
var A = new int[N];
for (int i = 0; i < N; i++)
{
int a = cin.nextint - 1;
A[i] = a;
}
WriteLine(merge_count(A));
}
long merge_count(int[] A)
{
int n = A.Length;
if (n <= 1) return 0;
long cnt = 0;
var B = A.Take(n / 2).ToArray();
var C = A.Skip(n / 2).ToArray();
cnt += merge_count(B);
cnt += merge_count(C);
int ai = 0, bi = 0, ci = 0;
while (ai < n)
{
if (bi < B.Length && (ci == C.Length || B[bi] <= C[ci]))
{
A[ai++] = B[bi++];
}
else
{
cnt += n / 2 - bi;
A[ai++] = C[ci++];
}
}
return cnt;
}
}
class Scanner
{
string[] s; int i;
char[] cs = new char[] { ' ' };
public Scanner() { s = new string[0]; i = 0; }
public string[] scan { get { return ReadLine().Split(); } }
public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
public string next
{
get
{
if (i < s.Length) return s[i++];
string st = ReadLine();
while (st == "") st = ReadLine();
s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
i = 0;
return next;
}
}
public int nextint { get { return int.Parse(next); } }
public long nextlong { get { return long.Parse(next); } }
public double nextdouble { get { return double.Parse(next); } }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0