結果
問題 | No.3011 品物の並び替え (Extra) |
ユーザー | 紙ぺーぱー |
提出日時 | 2015-05-04 00:20:25 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 7,256 bytes |
コンパイル時間 | 931 ms |
コンパイル使用メモリ | 113,408 KB |
実行使用メモリ | 25,088 KB |
最終ジャッジ日時 | 2024-07-05 18:28:30 |
合計ジャッジ時間 | 14,225 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 2,044 ms
24,960 KB |
testcase_05 | WA | - |
testcase_06 | AC | 1,196 ms
24,704 KB |
testcase_07 | AC | 1,603 ms
24,960 KB |
testcase_08 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Linq; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; using System.Diagnostics; namespace Program { public class Solver { public void Solve() { var n = sc.Integer(); var m = sc.Integer(); var G = Enumerate(n, x => new List<KeyValuePair<int, int>>()); var RG = Enumerate(n, x => new List<KeyValuePair<int, int>>()); for (int i = 0; i < m; i++) { var a = sc.Integer(); var b = sc.Integer(); var c = sc.Integer(); G[a].Add(new KeyValuePair<int, int>(b, c)); RG[b].Add(new KeyValuePair<int, int>(a, c)); } int k; var scc = DSCCHelper.SCC(G, RG, out k); var group = Enumerate(k, x => new List<int>()); for (int i = 0; i < scc.Length; i++) group[scc[i]].Add(i); var max = 0; var ans = new List<int>(); var plus = 0; var rand = new Random(); for (int i = 0; i < k; i++) { foreach (var x in group[i]) foreach (var kv in G[x]) if (scc[kv.Key] != i) plus += kv.Value; var ord = group[i].OrderBy(x => rand.Next()).ToArray(); var maxval = 0; var maxlist = new int[0]; for (int _ = 0; _ < 50000; _++) { var x = rand.Next() % ord.Length; var y = rand.Next() % ord.Length; Swap(ref ord[x], ref ord[y]); var visit = new HashSet<int>(); var val = 0; foreach (var p in ord) { visit.Add(p); foreach (var kv in G[p]) { if (!visit.Contains(kv.Key)) val += kv.Value; } } if (val > maxval) { maxval = val; maxlist = ord.ToArray(); } } max += maxval; foreach (var y in maxlist) ans.Add(y); } IO.Printer.Out.WriteLine(max + plus); IO.Printer.Out.WriteLine(ans.AsJoinedString()); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); } public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public 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) return 0; 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 Long() { if (isEof) return long.MinValue; 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 int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } private T[] enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } static class Ex { static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region DecomposiitonOfStronglyConnectedComponents static public class DSCCHelper { static public int[] SCC(List<KeyValuePair<int, int>>[] G, List<KeyValuePair<int, int>>[] RG, out int k) { var n = G.Length; var used = new bool[n]; var vs = new List<int>(n); var cmp = new int[n]; Action<int> dfs = null; dfs = v => { used[v] = true; foreach (var to in G[v]) if (!used[to.Key]) dfs(to.Key); vs.Add(v); }; Action<int, int> rdfs = null; rdfs = (v, t) => { used[v] = true; cmp[v] = t; foreach (var to in RG[v]) if (!used[to.Key]) rdfs(to.Key, t); }; for (int i = 0; i < used.Length; i++) if (!used[i]) dfs(i); used = new bool[n]; k = 0; for (int i = vs.Count - 1; i >= 0; i--) if (!used[vs[i]]) rdfs(vs[i], k++); return cmp; } } #endregion