結果
問題 | No.1480 Many Complete Graphs |
ユーザー |
👑 |
提出日時 | 2021-08-14 12:21:14 |
言語 | D (dmd 2.109.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,472 bytes |
コンパイル時間 | 840 ms |
コンパイル使用メモリ | 121,876 KB |
実行使用メモリ | 13,316 KB |
最終ジャッジ日時 | 2024-06-22 12:06:11 |
合計ジャッジ時間 | 5,219 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 WA * 10 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }enum INF = 10L^^18;void main() {try {for (; ; ) {const N = readInt();const M = readInt();auto K = new int[M];auto C = new long[M];auto S = new int[][M];foreach (m; 0 .. M) {K[m] = readInt();C[m] = readLong();S[m] = new int[K[m]];foreach (k; 0 .. K[m]) {S[m][k] = readInt() - 1;}}auto mss = new int[][N];foreach (m; 0 .. M) {foreach (k; 0 .. K[m]) {mss[S[m][k]] ~= m;}}auto dist = new long[N];dist[] = INF;auto sub = new long[2][M];foreach (m; 0 .. M) {sub[m][] = INF;}dist[0] = 0;foreach (u; 0 .. N) {// outforeach (m; mss[u]) {if ((u + 1) % 2 == 0) {chmin(dist[u], sub[m][0] + (u + 1) / 2);}chmin(dist[u], sub[m][1] + (u + 1) / 2);}// inforeach (m; mss[u]) {if ((u + 1) % 2 == 0) {chmin(sub[m][0], dist[u] + (u + 1) / 2 + C[m]);}chmin(sub[m][1], dist[u] + (u + 1) / 2 + C[m] + 1);}}const ans = dist[N - 1];writeln((ans >= INF) ? -1 : ans);}} catch (EOFException e) {}}