結果

問題 No.1194 Replace
ユーザー ei1333333ei1333333
提出日時 2020-08-22 17:53:18
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 246 ms / 2,000 ms
コード長 4,331 bytes
コンパイル時間 2,316 ms
コンパイル使用メモリ 214,176 KB
実行使用メモリ 23,344 KB
最終ジャッジ日時 2023-08-05 14:38:20
合計ジャッジ時間 8,213 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 166 ms
17,084 KB
testcase_01 AC 178 ms
18,200 KB
testcase_02 AC 136 ms
15,128 KB
testcase_03 AC 115 ms
13,324 KB
testcase_04 AC 178 ms
18,356 KB
testcase_05 AC 161 ms
16,928 KB
testcase_06 AC 147 ms
16,120 KB
testcase_07 AC 237 ms
23,260 KB
testcase_08 AC 235 ms
23,264 KB
testcase_09 AC 241 ms
23,300 KB
testcase_10 AC 243 ms
23,256 KB
testcase_11 AC 246 ms
23,292 KB
testcase_12 AC 245 ms
23,344 KB
testcase_13 AC 159 ms
14,540 KB
testcase_14 AC 134 ms
13,032 KB
testcase_15 AC 108 ms
11,724 KB
testcase_16 AC 153 ms
14,168 KB
testcase_17 AC 103 ms
11,136 KB
testcase_18 AC 103 ms
10,884 KB
testcase_19 AC 146 ms
14,148 KB
testcase_20 AC 1 ms
4,380 KB
testcase_21 AC 2 ms
4,384 KB
testcase_22 AC 1 ms
4,384 KB
testcase_23 AC 41 ms
6,936 KB
testcase_24 AC 14 ms
4,728 KB
testcase_25 AC 8 ms
4,380 KB
testcase_26 AC 55 ms
7,584 KB
testcase_27 AC 12 ms
4,384 KB
testcase_28 AC 27 ms
5,132 KB
testcase_29 AC 4 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T = int >
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template< typename T = int >
struct Graph {
  vector< vector< Edge< T > > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  size_t size() const {
    return g.size();
  }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false, bool directed = false) {
    for(int i = 0; i < M; i++) {
      int a, b;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if(weighted) cin >> c;
      if(directed) add_directed_edge(a, b, c);
      else add_edge(a, b, c);
    }
  }
};

template< typename T = int >
using Edges = vector< Edge< T > >;

int main() {
  int N, M;
  cin >> N >> M;
  vector< int > B(M), C(M);
  vector< int > xs;
  xs.emplace_back(1);
  xs.emplace_back(N);
  for(int i = 0; i < M; i++) {
    cin >> B[i] >> C[i];
    xs.emplace_back(B[i]);
    xs.emplace_back(C[i]);
  }
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  Graph<> g(xs.size());
  for(int i = 0; i < M; i++) {
    B[i] = lower_bound(begin(xs), end(xs), B[i]) - begin(xs);
    C[i] = lower_bound(begin(xs), end(xs), C[i]) - begin(xs);
    g.add_directed_edge(C[i], B[i]);
  }
  vector< int > used(xs.size());
  int64 score = 0;
  for(int i = (int) xs.size() - 1; i >= 0; i--) {
    if(used[i]) continue;
    used[i] = true;
    queue< int > que;
    que.emplace(i);
    score += xs[i];
    while(!que.empty()) {
      int idx = que.front();
      que.pop();
      for(auto &to : g.g[idx]) {
        if(used[to]) continue;
        que.emplace(to);
        score += xs[i];
        used[to] = true;
      }
    }
  }
  for(int i = 1; i < xs.size(); i++) {
    int64 ue = 1LL * xs[i] * (xs[i] - 1) / 2;
    int64 sita = 1LL * xs[i - 1] * (xs[i - 1] + 1) / 2;
    score += ue;
    score -= sita;
  }

  cout << score << "\n";
}
0