結果

問題 No.1365 [Cherry 1st Tune] Whose Fault?
ユーザー りあんりあん
提出日時 2021-01-22 22:26:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 911 ms / 2,000 ms
コード長 8,728 bytes
コンパイル時間 2,399 ms
コンパイル使用メモリ 116,224 KB
実行使用メモリ 40,320 KB
最終ジャッジ日時 2024-06-09 06:54:13
合計ジャッジ時間 26,769 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
20,096 KB
testcase_01 AC 31 ms
19,968 KB
testcase_02 AC 30 ms
19,456 KB
testcase_03 AC 32 ms
20,096 KB
testcase_04 AC 31 ms
20,096 KB
testcase_05 AC 31 ms
20,096 KB
testcase_06 AC 32 ms
20,224 KB
testcase_07 AC 32 ms
20,096 KB
testcase_08 AC 32 ms
19,968 KB
testcase_09 AC 32 ms
20,096 KB
testcase_10 AC 31 ms
19,968 KB
testcase_11 AC 32 ms
20,224 KB
testcase_12 AC 32 ms
19,712 KB
testcase_13 AC 114 ms
24,960 KB
testcase_14 AC 92 ms
25,728 KB
testcase_15 AC 50 ms
22,016 KB
testcase_16 AC 44 ms
22,272 KB
testcase_17 AC 82 ms
25,088 KB
testcase_18 AC 59 ms
23,296 KB
testcase_19 AC 111 ms
25,344 KB
testcase_20 AC 97 ms
24,832 KB
testcase_21 AC 105 ms
25,088 KB
testcase_22 AC 95 ms
24,960 KB
testcase_23 AC 203 ms
32,128 KB
testcase_24 AC 370 ms
34,560 KB
testcase_25 AC 709 ms
34,944 KB
testcase_26 AC 503 ms
33,920 KB
testcase_27 AC 614 ms
29,056 KB
testcase_28 AC 314 ms
26,368 KB
testcase_29 AC 234 ms
28,672 KB
testcase_30 AC 911 ms
36,736 KB
testcase_31 AC 772 ms
39,936 KB
testcase_32 AC 451 ms
37,248 KB
testcase_33 AC 736 ms
31,744 KB
testcase_34 AC 576 ms
31,232 KB
testcase_35 AC 347 ms
34,944 KB
testcase_36 AC 647 ms
39,168 KB
testcase_37 AC 171 ms
27,904 KB
testcase_38 AC 211 ms
36,096 KB
testcase_39 AC 845 ms
34,560 KB
testcase_40 AC 829 ms
34,176 KB
testcase_41 AC 628 ms
36,736 KB
testcase_42 AC 647 ms
28,416 KB
testcase_43 AC 31 ms
19,968 KB
testcase_44 AC 265 ms
40,320 KB
testcase_45 AC 280 ms
23,168 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

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>;

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() {
        // P == 0 !!!!!!
        int n = sc.Int;
        var a = sc.IntArr;
        var b = sc.IntArr;
        var p = sc.IntArr;
        var ab = new int[n];
        var ip = new double[n];
        for (int i = 0; i < n; i++)
        {
            ab[i] = a[i] - b[i];
            ip[i] = p[i] == 0 ? -1 : 1.0 / p[i];
        }
        var uf = new UnionFind(n, ab, ip);
        double get_cost(int i) {
            i = uf.getpar(i);
            if (ip[i] == -1) {
                return 0;
            }
            return ab[i] * ab[i] / ip[i];
        }
        int q = sc.Int;
        double ans = 0;
        for (int i = 0; i < n; i++)
        {
            ans += get_cost(i);
        }
        for (int _ = 0; _ < q; _++)
        {
            int u, v;
            sc.Multi(out u, out v);
            --u;
            --v;
            if (!uf.same(u, v)) {
                ans -= get_cost(u);
                ans -= get_cost(v);
                uf.unite(u, v);
                ans += get_cost(u);
            }
            Prt(ans);
        }

    }
}

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)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    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]);
    }
}
class UnionFind {
    int num;
    int[] par, sz, rank;
    int[] asum;
    double[] ipsum;
    public UnionFind(int n, int[] a, double[] ip) {
        num = n;
        par = new int[n];
        sz = new int[n];
        rank = new int[n];
        asum = a;
        ipsum = ip;
        for (int i = 0; i < n; ++i) {
            par[i] = i;
            sz[i] = 1;
            rank[i] = 0;
        }
    }
    int find(int x) => par[x] == x ? x : (par[x] = find(par[x]));
    public bool same(int x, int y) => find(x) == find(y);
    public int unionsize(int x) => sz[find(x)];
    public int unioncount => num;
    public bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        --num;
        if (rank[x] < rank[y]) {
            par[x] = y;
            sz[y] += sz[x];
            asum[y] += asum[x];
            if (ipsum[y] < 0 || ipsum[x] < 0) {
                ipsum[y] = -1;
            }
            else {
                ipsum[y] += ipsum[x];
            }
        }
        else {
            par[y] = x;
            sz[x] += sz[y];
            asum[x] += asum[y];
            if (ipsum[x] < 0 || ipsum[y] < 0) {
                ipsum[x] = -1;
            }
            else {
                ipsum[x] += ipsum[y];
            }
            if (rank[x] == rank[y]) ++rank[x];
        }
        return true;
    }
    public bool ispar(int x) => x == find(x);
    public int getpar(int x) => find(x);
}
0