結果
| 問題 | No.1545 [Cherry 2nd Tune N] Anthem |
| ユーザー |
 りあん
|
| 提出日時 | 2021-06-12 00:09:19 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 2,410 ms / 3,000 ms |
| コード長 | 12,346 bytes |
| コンパイル時間 | 4,321 ms |
| コンパイル使用メモリ | 118,360 KB |
| 実行使用メモリ | 328,360 KB |
| 最終ジャッジ日時 | 2023-08-21 15:25:51 |
| 合計ジャッジ時間 | 46,940 ms |
|
ジャッジサーバーID （参考情報） |
judge12 / judge13 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 69 ms
22,188 KB |
| testcase_01 | AC | 66 ms
22,060 KB |
| testcase_02 | AC | 71 ms
21,992 KB |
| testcase_03 | AC | 71 ms
24,036 KB |
| testcase_04 | AC | 724 ms
126,716 KB |
| testcase_05 | AC | 2,410 ms
301,004 KB |
| testcase_06 | AC | 766 ms
121,672 KB |
| testcase_07 | AC | 774 ms
104,492 KB |
| testcase_08 | AC | 1,941 ms
215,400 KB |
| testcase_09 | AC | 601 ms
84,088 KB |
| testcase_10 | AC | 311 ms
50,444 KB |
| testcase_11 | AC | 1,091 ms
163,036 KB |
| testcase_12 | AC | 1,911 ms
253,072 KB |
| testcase_13 | AC | 466 ms
81,780 KB |
| testcase_14 | AC | 812 ms
143,272 KB |
| testcase_15 | AC | 150 ms
35,124 KB |
| testcase_16 | AC | 1,150 ms
189,844 KB |
| testcase_17 | AC | 215 ms
37,792 KB |
| testcase_18 | AC | 703 ms
63,172 KB |
| testcase_19 | AC | 853 ms
118,532 KB |
| testcase_20 | AC | 487 ms
85,772 KB |
| testcase_21 | AC | 1,310 ms
215,404 KB |
| testcase_22 | AC | 776 ms
108,264 KB |
| testcase_23 | AC | 657 ms
74,848 KB |
| testcase_24 | AC | 116 ms
38,448 KB |
| testcase_25 | AC | 149 ms
53,792 KB |
| testcase_26 | AC | 67 ms
24,028 KB |
| testcase_27 | AC | 96 ms
33,672 KB |
| testcase_28 | AC | 185 ms
57,920 KB |
| testcase_29 | AC | 160 ms
53,284 KB |
| testcase_30 | AC | 141 ms
48,864 KB |
| testcase_31 | AC | 143 ms
49,248 KB |
| testcase_32 | AC | 92 ms
30,860 KB |
| testcase_33 | AC | 174 ms
55,804 KB |
| testcase_34 | AC | 156 ms
54,132 KB |
| testcase_35 | AC | 552 ms
109,788 KB |
| testcase_36 | AC | 381 ms
91,196 KB |
| testcase_37 | AC | 81 ms
28,712 KB |
| testcase_38 | AC | 186 ms
60,628 KB |
| testcase_39 | AC | 84 ms
29,076 KB |
| testcase_40 | AC | 103 ms
38,760 KB |
| testcase_41 | AC | 74 ms
24,088 KB |
| testcase_42 | AC | 134 ms
47,468 KB |
| testcase_43 | AC | 165 ms
54,456 KB |
| testcase_44 | AC | 75 ms
24,144 KB |
| testcase_45 | AC | 92 ms
37,512 KB |
| testcase_46 | AC | 137 ms
49,892 KB |
| testcase_47 | AC | 213 ms
67,116 KB |
| testcase_48 | AC | 342 ms
103,548 KB |
| testcase_49 | AC | 370 ms
102,440 KB |
| testcase_50 | AC | 622 ms
153,432 KB |
| testcase_51 | AC | 84 ms
29,732 KB |
| testcase_52 | AC | 917 ms
209,368 KB |
| testcase_53 | AC | 309 ms
88,556 KB |
| testcase_54 | AC | 97 ms
34,804 KB |
| testcase_55 | AC | 656 ms
162,196 KB |
| testcase_56 | AC | 77 ms
24,280 KB |
| testcase_57 | AC | 490 ms
123,396 KB |
| testcase_58 | AC | 356 ms
99,668 KB |
| testcase_59 | AC | 99 ms
37,376 KB |
| testcase_60 | AC | 107 ms
40,596 KB |
| testcase_61 | AC | 169 ms
55,452 KB |
| testcase_62 | AC | 455 ms
117,728 KB |
| testcase_63 | AC | 218 ms
71,324 KB |
| testcase_64 | AC | 1,629 ms
292,436 KB |
| testcase_65 | AC | 105 ms
36,732 KB |
| testcase_66 | AC | 1,514 ms
328,360 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, s, t, k;
sc.Multi(out n, out s, out t, out k);
--s;
--t;
int N = n * k;
var edge = new List<pair<long, int>>[N];
var rev = new List<pair<long, int>>[N];
for (int i = 0; i < N; i++)
{
edge[i] = new List<pair<long, int>>();
rev[i] = new List<pair<long, int>>();
}
var x = sc.LongArr;
int m = sc.Int;
for (int i = 0; i < m; i++)
{
int u, v;
long c;
sc.Multi(out u, out v, out c);
--u;
--v;
c += x[v];
for (int j = 0; j < k - 1; j++)
{
edge[u * k + j].Add(new pair<long, int>(c, v * k + j + 1));
rev[v * k + j + 1].Add(new pair<long, int>(c, u * k + j));
}
edge[u * k + k - 1].Add(new pair<long, int>(c, v * k + k - 1));
rev[v * k + k - 1].Add(new pair<long, int>(c, u * k + k - 1));
}
var dist = ShortestPath.Dijkstra(edge, s * k, LM);
if (dist[t * k + k - 1] == LM) {
Prt("Impossible");
return;
}
var lis = new List<int>();
int now = t * k + k - 1;
while (now != s * k) {
lis.Add(now / k + 1);
foreach (var item in rev[now])
{
if (dist[item.v2] == dist[now] - item.v1) {
now = item.v2;
break;
}
}
}
lis.Add(s + 1);
lis.Reverse();
Prt("Possible");
Prt(dist[t * k + k - 1] + x[s]);
Prt(lis.Count);
Prt(lis);
}
}
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);
}
}
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);
}