#938559 (C++14) No.2588 Increasing Record

提出ソース

結果

問題	No.2588 Increasing Record
ユーザー	👑 hos.lyric
提出日時	2023-12-16 00:33:41
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	255 ms / 3,000 ms
コード長	6,119 bytes
コンパイル時間	1,469 ms
コンパイル使用メモリ	133,668 KB
実行使用メモリ	44,000 KB
最終ジャッジ日時	2023-12-16 00:33:51
合計ジャッジ時間	9,892 ms
ジャッジサーバーID （参考情報）	judge12 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	2 ms 6,676 KB
testcase_05	AC	1 ms 6,676 KB
testcase_06	AC	1 ms 6,676 KB
testcase_07	AC	2 ms 6,676 KB
testcase_08	AC	1 ms 6,676 KB
testcase_09	AC	1 ms 6,676 KB
testcase_10	AC	1 ms 6,676 KB
testcase_11	AC	2 ms 6,676 KB
testcase_12	AC	48 ms 7,936 KB
testcase_13	AC	49 ms 7,808 KB
testcase_14	AC	51 ms 7,936 KB
testcase_15	AC	65 ms 8,576 KB
testcase_16	AC	134 ms 16,768 KB
testcase_17	AC	179 ms 24,516 KB
testcase_18	AC	217 ms 32,236 KB
testcase_19	AC	215 ms 37,440 KB
testcase_20	AC	217 ms 38,516 KB
testcase_21	AC	217 ms 38,680 KB
testcase_22	AC	220 ms 38,688 KB
testcase_23	AC	208 ms 38,700 KB
testcase_24	AC	202 ms 38,692 KB
testcase_25	AC	144 ms 25,680 KB
testcase_26	AC	187 ms 32,356 KB
testcase_27	AC	188 ms 38,848 KB
testcase_28	AC	182 ms 38,620 KB
testcase_29	AC	179 ms 38,960 KB
testcase_30	AC	166 ms 23,660 KB
testcase_31	AC	201 ms 31,576 KB
testcase_32	AC	255 ms 37,576 KB
testcase_33	AC	237 ms 38,964 KB
testcase_34	AC	243 ms 39,008 KB
testcase_35	AC	239 ms 39,016 KB
testcase_36	AC	239 ms 39,140 KB
testcase_37	AC	216 ms 39,132 KB
testcase_38	AC	159 ms 25,372 KB
testcase_39	AC	165 ms 42,668 KB
testcase_40	AC	149 ms 42,832 KB
testcase_41	AC	140 ms 43,252 KB
testcase_42	AC	141 ms 43,328 KB
testcase_43	AC	134 ms 44,000 KB
testcase_44	AC	165 ms 27,340 KB
testcase_45	AC	149 ms 32,768 KB
testcase_46	AC	163 ms 39,464 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


int N, M;
vector<int> A, B;

vector<vector<int>> graph, hparg;

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    A.resize(M);
    B.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
      if (A[i] > B[i]) {
        swap(A[i], B[i]);
      }
    }
    
    graph.assign(N, {});
    hparg.assign(N, {});
    for (int i = 0; i < M; ++i) {
      graph[A[i]].push_back(B[i]);
      hparg[B[i]].push_back(A[i]);
    }
    
    uf.assign(N, -1);
    vector<Mint> dp(N, 0);
    vector<Mint> lz(N, 0);
    vector<set<int>> neiss(N);
    for (int u = 0; u < N; ++u) {
// cerr<<COLOR("33")<<"u = "<<u<<COLOR()<<endl;
      vector<int> rvs;
      for (const int v : hparg[u]) {
        rvs.push_back(root(v));
      }
      sort(rvs.begin(), rvs.end());
      rvs.erase(unique(rvs.begin(), rvs.end()), rvs.end());
      int ru = root(u);
      for (const int rv : rvs) {
        assert(ru != rv);
        if (neiss[ru].size() < neiss[rv].size()) {
          swap(lz[ru], lz[rv]);
          swap(neiss[ru], neiss[rv]);
        }
        for (const int v : neiss[rv]) {
          dp[v] += lz[rv];
          if (neiss[ru].insert(v).second) {
            dp[v] -= lz[ru];
          }
        }
        lz[rv] = 0;
        neiss[rv].clear();
        connect(ru, rv);
        if (root(ru) == rv) {
          swap(lz[ru], lz[rv]);
          swap(neiss[ru], neiss[rv]);
        }
        ru = root(ru);
      }
      for (const int v : graph[u]) {
        if (neiss[ru].insert(v).second) {
          dp[v] -= lz[ru];
        }
      }
      {
        auto it = neiss[ru].find(u);
        if (it != neiss[ru].end()) {
          dp[u] += lz[ru];
          neiss[ru].erase(it);
        }
      }
      dp[u] += 1;
      lz[ru] += dp[u];
// cerr<<"  dp = "<<dp<<endl;
// cerr<<"  lz = "<<lz<<endl;
// for(int r=0;r<N;++r)if(uf[r]<0){cerr<<"  neiss["<<r<<"] = ";pv(neiss[r].begin(),neiss[r].end());}
    }
// cerr<<"dp = "<<dp<<endl;
    
    Mint ans = 0;
    for (int u = 0; u < N; ++u) {
      ans += dp[u];
    }
    printf("%u\n", ans.x);
  }
  return 0;
}

yukicoder

結果

テストケース

ソースコード