結果

問題 No.1194 Replace
ユーザー 👑 hos.lyric
提出日時 2020-08-22 13:49:42
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 395 ms / 2,000 ms
コード長 2,558 bytes
コンパイル時間 1,196 ms
コンパイル使用メモリ 127,596 KB
実行使用メモリ 30,348 KB
最終ジャッジ日時 2024-06-22 08:13:15
合計ジャッジ時間 10,463 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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)); }
void main() {
  try {
    for (; ; ) {
      const N = readLong();
      const M = readInt();
      auto B = new long[M];
      auto C = new long[M];
      foreach (i; 0 .. M) {
        B[i] = readLong();
        C[i] = readLong();
      }
      
      auto xs = B ~ C;
      xs = xs.sort.uniq.array;
      const xsLen = cast(int)(xs.length);
      debug {
        writeln("B = ", B);
        writeln("C = ", C);
        writeln("xs = ", xs);
      }
      
      auto graph = new int[][xsLen];
      foreach (i; 0 .. M) {
        const u = xs.lowerBound(B[i]);
        const v = xs.lowerBound(C[i]);
        graph[v] ~= u;
      }
      
      auto que = new int[xsLen];
      int qb, qe;
      
      auto mxs = new int[xsLen];
      mxs[] = -1;
      foreach_reverse (s; 0 .. xsLen) {
        if (mxs[s] == -1) {
          mxs[s] = s;
          qb = qe = 0;
          que[qe++] = s;
          for (; qb != qe; ) {
            const u = que[qb++];
            foreach (v; graph[u]) {
              if (mxs[v] == -1) {
                mxs[v] = s;
                que[qe++] = v;
              }
            }
          }
        }
      }
      debug {
        writeln("mxs = ", mxs);
      }
      
      long ans = N * (N + 1) / 2;
      foreach (u; 0 .. xsLen) {
        ans -= xs[u];
        ans += xs[mxs[u]];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0