結果
| 問題 | No.1442 I-wate Shortest Path Problem |
| ユーザー |
 りあん
|
| 提出日時 | 2021-03-26 22:23:38 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 2,022 ms / 3,000 ms |
| コード長 | 15,263 bytes |
| コンパイル時間 | 3,455 ms |
| コンパイル使用メモリ | 116,304 KB |
| 実行使用メモリ | 90,440 KB |
| 最終ジャッジ日時 | 2023-08-19 08:54:34 |
| 合計ジャッジ時間 | 28,669 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge10 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 70 ms
19,912 KB |
| testcase_01 | AC | 72 ms
23,944 KB |
| testcase_02 | AC | 91 ms
24,568 KB |
| testcase_03 | AC | 226 ms
29,044 KB |
| testcase_04 | AC | 93 ms
26,364 KB |
| testcase_05 | AC | 76 ms
27,800 KB |
| testcase_06 | AC | 226 ms
29,004 KB |
| testcase_07 | AC | 88 ms
26,100 KB |
| testcase_08 | AC | 216 ms
26,216 KB |
| testcase_09 | AC | 108 ms
28,856 KB |
| testcase_10 | AC | 250 ms
29,536 KB |
| testcase_11 | AC | 234 ms
29,700 KB |
| testcase_12 | AC | 1,176 ms
83,456 KB |
| testcase_13 | AC | 660 ms
80,000 KB |
| testcase_14 | AC | 895 ms
83,136 KB |
| testcase_15 | AC | 900 ms
81,356 KB |
| testcase_16 | AC | 1,332 ms
86,716 KB |
| testcase_17 | AC | 1,966 ms
90,440 KB |
| testcase_18 | AC | 2,022 ms
89,848 KB |
| testcase_19 | AC | 1,331 ms
87,088 KB |
| testcase_20 | AC | 2,002 ms
90,436 KB |
| testcase_21 | AC | 1,981 ms
86,456 KB |
| testcase_22 | AC | 718 ms
78,536 KB |
| testcase_23 | AC | 1,297 ms
86,568 KB |
| testcase_24 | AC | 608 ms
83,692 KB |
| testcase_25 | AC | 1,202 ms
84,812 KB |
| testcase_26 | AC | 594 ms
85,096 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, k;
sc.Multi(out n, out k);
var edge = new List<pair<long, int>>[n];
for (int i = 0; i < n; i++)
{
edge[i] = new List<pair<long, int>>();
}
for (int i = 0; i < n - 1; i++)
{
int u, v, c;
sc.Multi(out u, out v, out c);
--u;
--v;
edge[u].Add(new pair<long, int>(c * 2, v));
edge[v].Add(new pair<long, int>(c * 2, u));
}
var dists = new long[k][];
var p = new long[k];
for (int i = 0; i < k; i++)
{
int _;
sc.Multi(out _, out p[i]);
var v = sc.IntArr.Select(x => x - 1).ToArray();
dists[i] = new long[n];
for (int j = 0; j < n; j++)
{
dists[i][j] = LM;
}
foreach (var item in v)
{
dists[i][item] = p[i];
}
ShortestPath.Dijkstra(edge, dists[i]);
}
var distk = new long[k][];
for (int i = 0; i < k; i++)
{
distk[i] = new long[k];
for (int j = 0; j < k; j++)
{
distk[i][j] = LM;
for (int l = 0; l < n; l++)
{
distk[i][j] = Math.Min(distk[i][j], dists[i][l] + dists[j][l]);
}
}
distk[i][i] = 0;
}
ShortestPath.WarshallFloyd(distk);
var lca = new LCATree<long>(edge, (x, y) => x + y, 0);
int q = sc.Int;
for (int _ = 0; _ < q; _++)
{
int u, v;
sc.Multi(out u, out v);
--u;
--v;
long ans = lca.lca(u, v).v1;
for (int i = 0; i < k; i++)
{
for (int j = 0; j < k; j++)
{
ans = Math.Min(ans, dists[i][u] + distk[i][j] + dists[j][v]);
}
}
Prt(ans / 2);
}
}
}
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]);
}
}
static class ShortestPath {
public static void WarshallFloyd(Number[][] g) {
int n = g.Length;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
for (int k = 0; k < n; ++k)
g[j][k] = Math.Min(g[j][k], g[j][i] + g[i][k]);
}
class Heap {
int n;
Number[] values;
int[] keys, indices;
void Update(int i, Number val) {
if (indices[i] == -1) {
keys[n] = i;
indices[i] = n;
++n;
}
values[i] = val;
int p = indices[i];
while (p > 0) {
int par = p - 1 >> 1;
if (values[keys[par]] > val) {
keys[p] = keys[par];
indices[keys[p]] = p;
p = par;
}
else break;
}
keys[p] = i;
indices[i] = p;
}
int Pop() {
--n;
int ret = keys[0];
indices[ret] = -1;
int i = keys[n];
keys[n] = -1;
Number val = values[i];
if (n == 0) return ret;
int p = 0;
while ((p << 1 | 1) < n) {
int ch = p << 1 | 1;
if (ch < n - 1 && values[keys[ch]] > values[keys[ch + 1]]) ++ch;
if (val > values[keys[ch]]) {
keys[p] = keys[ch];
indices[keys[p]] = p;
p = ch;
}
else break;
}
keys[p] = i;
indices[i] = p;
return ret;
}
void init(int m, int s, Number inf) {
n = 1;
values = new Number[m];
keys = new int[m];
indices = new int[m];
for (int i = 0; i < m; i++) {
values[i] = inf;
keys[i] = -1;
indices[i] = -1;
}
values[s] = 0;
keys[0] = s;
indices[s] = 0;
}
void init(Number[] dist) {
n = dist.Length;
values = dist;
keys = new int[n];
for (int i = 0; i < n; i++) keys[i] = i;
Array.Sort(keys, (x, y) => values[x].CompareTo(values[y]));
indices = new int[n];
for (int i = 0; i < n; i++) indices[keys[i]] = i;
}
public void Run(List<pair<Number, int>>[] edges, Number[] dist) {
init(dist);
while (n > 0) {
int p = Pop();
foreach (var e in edges[p])
if (values[e.v2] > values[p] + e.v1)
Update(e.v2, values[p] + e.v1);
}
// return values;
}
public Number[] Run(List<pair<Number, int>>[] edges, int s, Number inf) {
init(edges.Length, s, inf);
while (n > 0) {
int p = Pop();
foreach (var e in edges[p])
if (values[e.v2] > values[p] + e.v1)
Update(e.v2, values[p] + e.v1);
}
return values;
}
public pair<Number[], long[]> Run(List<pair<Number, int>>[] edges, int s, long Mod, Number inf) {
init(edges.Length, s, inf);
var cnts = new long[edges.Length];
cnts[s] = 1;
while (n > 0) {
int p = Pop();
foreach (var e in edges[p])
if (values[e.v2] > values[p] + e.v1) {
cnts[e.v2] = cnts[p];
Update(e.v2, values[p] + e.v1);
}
else if (values[e.v2] == values[p] + e.v1)
cnts[e.v2] = (cnts[e.v2] + cnts[p]) % Mod;
}
return new pair<Number[], long[]>(values, cnts);
}
}
public static Number[] Dijkstra(List<pair<Number, int>>[] edges, int s, Number inf)
=> new Heap().Run(edges, s, inf);
public static void Dijkstra(List<pair<Number, int>>[] edges, Number[] dist)
=> new Heap().Run(edges, dist);
public static pair<Number[], long[]> Dijkstra(List<pair<Number, int>>[] edges, int s, long Mod, Number inf)
=> new Heap().Run(edges, s, Mod, inf);
}
class LCATree<T> {
int m;
int[][] parents;
T[][] values;
Func<T, T, T> func;
T identity;
int[] depth;
public LCATree(List<pair<T, int>>[] g, Func<T, T, T> func, T identity, int root = 0) {
int n = g.Length;
parents = new int[n][];
values = new T[n][];
depth = new int[n];
this.func = func;
this.identity = identity;
m = 1;
while ((1 << m - 1) < n) ++m;
for (int i = 0; i < n; i++) {
parents[i] = new int[m];
values[i] = new T[m];
depth[i] = -1;
for (int j = 0; j < m; j++) {
parents[i][j] = -1;
values[i][j] = identity;
}
}
depth[root] = 0;
var q = new Queue<int>();
q.Enqueue(root);
while (q.Count > 0) {
var p = q.Dequeue();
foreach (var item in g[p]) {
if (depth[item.v2] == -1) {
depth[item.v2] = depth[p] + 1;
parents[item.v2][0] = p;
values[item.v2][0] = item.v1;
for (int i = 1; i < m && parents[item.v2][i - 1] != -1; i++) {
parents[item.v2][i] = parents[parents[item.v2][i - 1]][i - 1];
values[item.v2][i] = func(values[item.v2][i - 1], values[parents[item.v2][i - 1]][i - 1]);
}
q.Enqueue(item.v2);
}
}
}
}
T climb(ref int p, int cnt) {
T val = identity;
for (int i = m - 1; i >= 0 ; i--) {
if (((cnt >> i) & 1) == 1) {
val = func(val, values[p][i]);
p = parents[p][i];
}
}
return val;
}
public pair<T, int> lca(int p, int q) {
T val = identity;
if (depth[p] > depth[q]) val = climb(ref p, depth[p] - depth[q]);
if (depth[p] < depth[q]) val = climb(ref q, depth[q] - depth[p]);
if (p == q) return new pair<T, int>(val, p);
for (int i = m - 1; i >= 0 ; i--) {
if (parents[p][i] != parents[q][i]) {
val = func(val, values[p][i]);
val = func(val, values[q][i]);
p = parents[p][i];
q = parents[q][i];
}
}
{
val = func(val, values[p][0]);
val = func(val, values[q][0]);
p = parents[p][0];
q = parents[q][0];
}
return new pair<T, int>(val, p);
}
}