#952872 (D) No.2638 Initial fare

• 問題: No.2638 Initial fare
• ユーザー: 👑 hos.lyric
• 提出日時: 2024-02-19 22:30:05
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 128 ms / 2,000 ms
• コード長: 1,897 bytes
• コンパイル時間: 1,488 ms
• コンパイル使用メモリ: 108,544 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2024-02-19 22:30:12
• 合計ジャッジ時間: 5,223 ms
• ジャッジサーバーID （参考情報）: judge16 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,676 KB
testcase_01	AC	1 ms; 6,676 KB
testcase_02	AC	1 ms; 6,676 KB
testcase_03	AC	1 ms; 6,676 KB
testcase_04	AC	109 ms; 6,676 KB
testcase_05	AC	114 ms; 6,676 KB
testcase_06	AC	2 ms; 6,676 KB
testcase_07	AC	128 ms; 6,676 KB
testcase_08	AC	100 ms; 6,676 KB
testcase_09	AC	108 ms; 6,676 KB
testcase_10	AC	105 ms; 6,676 KB
testcase_11	AC	1 ms; 6,676 KB
testcase_12	AC	116 ms; 6,676 KB
testcase_13	AC	97 ms; 6,676 KB
testcase_14	AC	112 ms; 6,676 KB
testcase_15	AC	109 ms; 6,676 KB
testcase_16	AC	1 ms; 6,676 KB
testcase_17	AC	109 ms; 6,676 KB
testcase_18	AC	117 ms; 6,676 KB
testcase_19	AC	110 ms; 6,676 KB
testcase_20	AC	114 ms; 6,676 KB
testcase_21	AC	108 ms; 6,676 KB
testcase_22	AC	1 ms; 6,676 KB
testcase_23	AC	108 ms; 6,676 KB
testcase_24	AC	112 ms; 6,676 KB
testcase_25	AC	1 ms; 6,676 KB
testcase_26	AC	123 ms; 6,676 KB
testcase_27	AC	112 ms; 6,676 KB

ソースコード

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

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new int[N - 1];
      auto B = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      
      auto deg = new int[N];
      foreach (i; 0 .. N - 1) {
        ++deg[A[i]];
        ++deg[B[i]];
      }
      
      long[4] ans;
      foreach (i; 0 .. N - 1) {
        ans[1] += 1;
        ans[2] += (deg[A[i]] - 1);
        ans[2] += (deg[B[i]] - 1);
        ans[3] += 1L * (deg[A[i]] - 1) * (deg[B[i]] - 1);
      }
      ans[2] /= 2;
      debug {
        writeln("ans = ", ans);
      }
      writeln(ans[1] + ans[2] + ans[3]);
    }
  } catch (EOFException e) {
  }
}