結果
問題 | No.1194 Replace |
ユーザー | りあん |
提出日時 | 2020-08-22 14:15:17 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 929 ms / 2,000 ms |
コード長 | 7,256 bytes |
コンパイル時間 | 1,216 ms |
コンパイル使用メモリ | 115,712 KB |
実行使用メモリ | 71,320 KB |
最終ジャッジ日時 | 2024-10-15 08:30:28 |
合計ジャッジ時間 | 17,730 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 603 ms
55,940 KB |
testcase_01 | AC | 624 ms
55,428 KB |
testcase_02 | AC | 507 ms
56,172 KB |
testcase_03 | AC | 425 ms
51,780 KB |
testcase_04 | AC | 642 ms
55,568 KB |
testcase_05 | AC | 608 ms
60,052 KB |
testcase_06 | AC | 558 ms
57,764 KB |
testcase_07 | AC | 928 ms
71,056 KB |
testcase_08 | AC | 918 ms
70,944 KB |
testcase_09 | AC | 924 ms
70,936 KB |
testcase_10 | AC | 915 ms
71,320 KB |
testcase_11 | AC | 929 ms
71,060 KB |
testcase_12 | AC | 917 ms
70,944 KB |
testcase_13 | AC | 445 ms
48,892 KB |
testcase_14 | AC | 377 ms
45,184 KB |
testcase_15 | AC | 356 ms
47,224 KB |
testcase_16 | AC | 437 ms
47,988 KB |
testcase_17 | AC | 333 ms
44,928 KB |
testcase_18 | AC | 304 ms
43,636 KB |
testcase_19 | AC | 440 ms
40,984 KB |
testcase_20 | AC | 41 ms
19,712 KB |
testcase_21 | AC | 42 ms
19,584 KB |
testcase_22 | AC | 42 ms
19,968 KB |
testcase_23 | AC | 168 ms
34,428 KB |
testcase_24 | AC | 89 ms
28,544 KB |
testcase_25 | AC | 60 ms
24,048 KB |
testcase_26 | AC | 186 ms
33,024 KB |
testcase_27 | AC | 68 ms
23,768 KB |
testcase_28 | AC | 106 ms
26,368 KB |
testcase_29 | AC | 50 ms
21,840 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>; 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, m; sc.Multi(out n, out m); var u = new int[m]; var v = new int[m]; for (int i = 0; i < m; i++) { sc.Multi(out u[i], out v[i]); } var cmp = compress(u, v); var inv = cmp.inv(); int N = cmp.Count; var edge = new List<int>[N]; for (int i = 0; i < N; i++) { edge[i] = new List<int>(); } for (int i = 0; i < m; i++) { edge[cmp[v[i]]].Add(cmp[u[i]]); } var max = new int[N]; for (int i = 0; i < N; i++) { max[i] = i; } for (int i = N - 1; i >= 0 ; i--) { if (max[i] != i) continue; var q = new Queue<int>(); q.Enqueue(i); while (q.Any()) { var p = q.Dequeue(); foreach (var item in edge[p]) { if (max[item] < max[p]) { max[item] = max[p]; q.Enqueue(item); } } } } long ans = n * (long)(n + 1) / 2; foreach (var item in cmp) { ans += inv[max[item.Value]] - item.Key; } Prt(ans); } } 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) => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])); public static IEnumerable<P> adjacents(int i, int j, int h, int w) => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w)); 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]); } }