結果
| 問題 | No.19 ステージの選択 |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-01-17 16:32:04 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,071 bytes |
| コンパイル時間 | 3,719 ms |
| コンパイル使用メモリ | 121,148 KB |
| 実行使用メモリ | 27,232 KB |
| 最終ジャッジ日時 | 2024-06-22 17:55:08 |
| 合計ジャッジ時間 | 2,759 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 26 ms
26,856 KB |
| testcase_01 | AC | 27 ms
24,884 KB |
| testcase_02 | AC | 27 ms
26,856 KB |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | AC | 27 ms
22,576 KB |
| testcase_12 | AC | 26 ms
24,812 KB |
| testcase_13 | AC | 28 ms
24,676 KB |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | 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;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var val = new double[n];
var G = Enumerate(n, x => new List<int>());
var RG = Enumerate(n, x => new List<int>());
for (int i = 0; i < n; i++)
{
val[i] = sc.Integer();
var to = sc.Integer() - 1;
if (to == i) continue;
G[i].Add(to);
RG[to].Add(i);
}
int sz;
var scc = DSCCHelper.SCC(G, RG, out sz);
var l = Enumerate(sz, x => new List<int>());
for (int i = 0; i < n; i++) l[scc[i]].Add(i);
var ans = 0.0;
for (int i = sz - 1; i >= 0; i--)
{
var min = double.MaxValue;
foreach (var x in l[i])
{
if (val[x] < min) min = val[x];
ans += val[x] / 2;
}
ans += min / 2;
foreach (var x in l[i])
if (G[x].Count > 0) val[G[x][0]] /= 2;
}
IO.Printer.Out.WriteLine("{0:F1}",ans);
}
internal IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static 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; }
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; }
}
}
#region Ex
namespace Program.IO
{
using System.IO;
using System.Linq;
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 System.Globalization.CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new System.Text.UTF8Encoding(false, true)) { }
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; }
private 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 char[] Char(int n) { var a = new char[n]; for (int i = 0; i < n; i++) a[i] = Char(); return a; }
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(), System.Globalization.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 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); }
public void Flush() { str.Flush(); }
}
}
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<int>[] G, List<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]) dfs(to);
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]) rdfs(to, 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