結果
問題 | No.1649 Manhattan Square |
ユーザー | りあん |
提出日時 | 2021-08-13 21:59:57 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,495 ms / 3,000 ms |
コード長 | 8,802 bytes |
コンパイル時間 | 2,807 ms |
コンパイル使用メモリ | 115,712 KB |
実行使用メモリ | 60,160 KB |
最終ジャッジ日時 | 2024-11-08 14:06:27 |
合計ジャッジ時間 | 61,243 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
19,584 KB |
testcase_01 | AC | 33 ms
19,456 KB |
testcase_02 | AC | 48 ms
20,688 KB |
testcase_03 | AC | 48 ms
20,824 KB |
testcase_04 | AC | 49 ms
20,688 KB |
testcase_05 | AC | 49 ms
20,432 KB |
testcase_06 | AC | 48 ms
20,680 KB |
testcase_07 | AC | 1,471 ms
59,904 KB |
testcase_08 | AC | 1,449 ms
59,904 KB |
testcase_09 | AC | 1,485 ms
59,776 KB |
testcase_10 | AC | 1,451 ms
59,904 KB |
testcase_11 | AC | 1,466 ms
59,776 KB |
testcase_12 | AC | 1,464 ms
60,160 KB |
testcase_13 | AC | 1,476 ms
60,032 KB |
testcase_14 | AC | 1,460 ms
59,904 KB |
testcase_15 | AC | 1,474 ms
60,032 KB |
testcase_16 | AC | 1,460 ms
59,904 KB |
testcase_17 | AC | 1,455 ms
60,160 KB |
testcase_18 | AC | 1,482 ms
60,032 KB |
testcase_19 | AC | 1,481 ms
60,160 KB |
testcase_20 | AC | 1,449 ms
60,160 KB |
testcase_21 | AC | 1,495 ms
60,160 KB |
testcase_22 | AC | 1,444 ms
60,032 KB |
testcase_23 | AC | 1,449 ms
59,904 KB |
testcase_24 | AC | 1,457 ms
60,160 KB |
testcase_25 | AC | 1,462 ms
60,160 KB |
testcase_26 | AC | 1,443 ms
60,160 KB |
testcase_27 | AC | 1,443 ms
60,032 KB |
testcase_28 | AC | 1,476 ms
60,032 KB |
testcase_29 | AC | 1,456 ms
59,904 KB |
testcase_30 | AC | 1,436 ms
59,904 KB |
testcase_31 | AC | 1,451 ms
60,032 KB |
testcase_32 | AC | 1,453 ms
60,032 KB |
testcase_33 | AC | 1,442 ms
60,032 KB |
testcase_34 | AC | 1,451 ms
60,032 KB |
testcase_35 | AC | 1,416 ms
59,904 KB |
testcase_36 | AC | 1,429 ms
60,032 KB |
testcase_37 | AC | 1,455 ms
60,160 KB |
testcase_38 | AC | 1,458 ms
60,032 KB |
testcase_39 | AC | 1,465 ms
59,904 KB |
testcase_40 | AC | 1,463 ms
60,160 KB |
testcase_41 | AC | 1,445 ms
60,032 KB |
testcase_42 | AC | 1,315 ms
60,160 KB |
testcase_43 | AC | 34 ms
19,328 KB |
testcase_44 | AC | 34 ms
19,584 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Threading; using System.Text; using System.Text.RegularExpressions; using System.Diagnostics; using static util; using P = pair<int, int>; using Number = System.Int64; class Program { static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var solver = new Solver(sw); // var t = new Thread(solver.solve, 1 << 28); // 256 MB // t.Start(); // t.Join(); solver.solve(); sw.Flush(); } } class Solver { StreamWriter sw; Scan sc; void Prt(string a) => sw.WriteLine(a); void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a)); void Prt(params object[] a) => Prt(string.Join(" ", a)); public Solver(StreamWriter sw) { this.sw = sw; this.sc = new Scan(); } public void solve() { int n = sc.Int; var p = new P[n]; for (int i = 0; i < n; i++) { p[i] = sc.P; } long s1 = calc(p.Select(x => new P(x.v1, x.v1)).ToArray()); long s2 = calc(p.Select(x => new P(x.v2, x.v2)).ToArray()); long s3 = calc(p); Prt((s1 + s2 + s3 * 2) % M); } long calc(P[] p) { int n = p.Length; Array.Sort(p); var ys = p.Select(x => x.v2).ToArray(); var idx = new int[n]; for (int i = 0; i < n; i++) { idx[i] = i; } Array.Sort(ys, idx); var rev = new int[n]; for (int i = 0; i < n; i++) { rev[idx[i]] = i; } var bit = new BIT(n); var bit2 = new BIT(n); var bit3 = new BIT(n); var bit4 = new BIT(n); for (int i = 0; i < n; i++) { bit.add(rev[i], p[i].v1 * (long)p[i].v2 % M); bit2.add(rev[i], p[i].v1); bit3.add(rev[i], p[i].v2); bit4.add(rev[i], 1); } long sum = 0; for (int i = 0; i < n; i++) { { long c = bit2.sum(rev[i]) % M; long s = bit.sum(rev[i]) % M; long l = bit3.sum(rev[i]) % M; long cc = bit4.sum(rev[i]) % M; sum += c * p[i].v2 % M - s - (p[i].v2 * cc % M - l) % M * p[i].v1 % M; } { long c = bit2.sum(rev[i] + 1, n) % M; long s = bit.sum(rev[i] + 1, n) % M; long l = bit3.sum(rev[i] + 1, n) % M; long cc = bit4.sum(rev[i] + 1, n) % M; sum += s - c * p[i].v2 % M - (l - p[i].v2 * cc % M) % M * p[i].v1 % M; } sum = (sum % M + M) % M; bit.add(rev[i], -(p[i].v1 * (long)p[i].v2 % M)); bit2.add(rev[i], -p[i].v1); bit3.add(rev[i], -p[i].v2); bit4.add(rev[i], -1); } return sum; } } class pair<T, U> : IComparable<pair<T, U>> { public T v1; public U v2; public pair() : this(default(T), default(U)) {} public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(pair<T, U> a) { int c = Comparer<T>.Default.Compare(v1, a.v1); return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2); } public override string ToString() => $"{v1} {v2}"; public void Deconstruct(out T a, out U b) { a = v1; b = v2; } } static class util { // public static readonly int M = 1000000007; public static readonly int M = 998244353; public static readonly long LM = 1L << 60; public static readonly double eps = 1e-11; public static void DBG(string a) => Console.Error.WriteLine(a); public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a)); public static void DBG(params object[] a) => DBG(string.Join(" ", a)); public static void Assert(params bool[] conds) { if (conds.Any(x => !x)) throw new Exception(); } public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2); public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> { for (int i = 0; i < a.Count && i < b.Count; i++) if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]); return a.Count.CompareTo(b.Count); } public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w; public static readonly int[] dd = { 0, 1, 0, -1 }; // static readonly string dstring = "RDLU"; public static IEnumerable<P> adjacents(int i, int j) { for (int k = 0; k < 4; k++) yield return new P(i + dd[k], j + dd[k ^ 1]); } public static IEnumerable<P> adjacents(int i, int j, int h, int w) { for (int k = 0; k < 4; k++) if (inside(i + dd[k], j + dd[k ^ 1], h, w)) yield return new P(i + dd[k], j + dd[k ^ 1]); } public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2); public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w); public static IEnumerable<int> all_subset(this int p) { for (int i = 0; ; i = i - p & p) { yield return i; if (i == p) break; } } public static Dictionary<T, int> compress<T>(this IEnumerable<T> a) => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i); public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x)); public static T[] inv<T>(this Dictionary<T, int> dic) { var res = new T[dic.Count]; foreach (var item in dic) res[item.Value] = item.Key; return res; } public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; } public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; } public static T[] copy<T>(this IList<T> a) { var ret = new T[a.Count]; for (int i = 0; i < a.Count; i++) ret[i] = a[i]; return ret; } } class Scan { StreamReader sr; public Scan() { sr = new StreamReader(Console.OpenStandardInput()); } public Scan(string path) { sr = new StreamReader(path); } public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => ReadLine.Trim(); public string ReadLine => sr.ReadLine(); public pair<T, U> Pair<T, U>() { T a; U b; Multi(out a, out b); return new pair<T, U>(a, b); } public P P => Pair<int, int>(); public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries); bool eq<T, U>() => typeof(T).Equals(typeof(U)); T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T)); T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s)) : eq<T, long>() ? ct<T, long>(long.Parse(s)) : eq<T, double>() ? ct<T, double>(double.Parse(s)) : eq<T, char>() ? ct<T, char>(s[0]) : ct<T, string>(s); public void Multi<T>(out T a) => a = cv<T>(Str); public void Multi<T, U>(out T a, out U b) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); } public void Multi<T, U, V>(out T a, out U b, out V c) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); } public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); } public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); } public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) { var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]); } } class BIT { int n; Number[] bit; public BIT(int n) { this.n = n; bit = new Number[n]; } public void add(int j, Number w) { for (int i = j; i < n; i |= i + 1) bit[i] += w; } public Number sum(int j) { Number res = 0; for (int i = j - 1; i >= 0; i = (i & i + 1) - 1) res += bit[i]; return res; } public Number sum(int j, int k) => sum(k) - sum(j); }