結果

問題 No.1023 Cyclic Tour
ユーザー ei1333333ei1333333
提出日時 2020-04-10 22:19:43
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 459 ms / 2,000 ms
コード長 5,556 bytes
コンパイル時間 2,797 ms
コンパイル使用メモリ 230,044 KB
実行使用メモリ 48,740 KB
最終ジャッジ日時 2024-09-15 20:48:22
合計ジャッジ時間 21,382 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 207 ms
26,852 KB
testcase_05 AC 205 ms
26,864 KB
testcase_06 AC 243 ms
29,804 KB
testcase_07 AC 249 ms
28,188 KB
testcase_08 AC 215 ms
33,920 KB
testcase_09 AC 200 ms
32,880 KB
testcase_10 AC 196 ms
32,952 KB
testcase_11 AC 217 ms
34,752 KB
testcase_12 AC 205 ms
37,396 KB
testcase_13 AC 178 ms
35,464 KB
testcase_14 AC 189 ms
35,176 KB
testcase_15 AC 209 ms
36,108 KB
testcase_16 AC 368 ms
40,280 KB
testcase_17 AC 363 ms
40,468 KB
testcase_18 AC 359 ms
38,288 KB
testcase_19 AC 345 ms
37,796 KB
testcase_20 AC 442 ms
40,068 KB
testcase_21 AC 444 ms
40,828 KB
testcase_22 AC 396 ms
41,660 KB
testcase_23 AC 444 ms
43,208 KB
testcase_24 AC 417 ms
48,740 KB
testcase_25 AC 379 ms
40,100 KB
testcase_26 AC 376 ms
40,276 KB
testcase_27 AC 349 ms
38,932 KB
testcase_28 AC 420 ms
47,360 KB
testcase_29 AC 393 ms
48,524 KB
testcase_30 AC 425 ms
47,684 KB
testcase_31 AC 415 ms
44,164 KB
testcase_32 AC 383 ms
41,944 KB
testcase_33 AC 459 ms
45,760 KB
testcase_34 AC 393 ms
39,560 KB
testcase_35 AC 403 ms
40,772 KB
testcase_36 AC 397 ms
40,568 KB
testcase_37 AC 383 ms
41,500 KB
testcase_38 AC 390 ms
44,808 KB
testcase_39 AC 385 ms
43,504 KB
testcase_40 AC 408 ms
43,848 KB
testcase_41 AC 391 ms
43,892 KB
testcase_42 AC 394 ms
40,788 KB
testcase_43 AC 387 ms
46,552 KB
testcase_44 AC 199 ms
26,740 KB
testcase_45 AC 218 ms
42,260 KB
testcase_46 AC 179 ms
26,384 KB
testcase_47 AC 205 ms
29,712 KB
testcase_48 AC 345 ms
39,440 KB
testcase_49 AC 340 ms
40,200 KB
testcase_50 AC 338 ms
39,376 KB
testcase_51 AC 364 ms
39,948 KB
testcase_52 AC 348 ms
39,228 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 > >;

/**
 * @brief Strongly-Connected-Components(強連結成分分解)
 */
template< typename T = int >
struct StronglyConnectedComponents : Graph< T > {
public:
  using Graph< T >::Graph;
  using Graph< T >::g;
  vector< int > comp;
  Graph< T > dag;
  vector< vector< int > > group;

  void build() {
    rg = Graph< T >(g.size());
    for(int i = 0; i < g.size(); i++) {
      for(auto &e : g[i]) {
        rg.add_directed_edge(e.to, e.from, e.cost);
      }
    }
    comp.assign(g.size(), -1);
    used.assign(g.size(), 0);
    for(int i = 0; i < g.size(); i++) dfs(i);
    reverse(begin(order), end(order));
    int ptr = 0;
    for(int i : order) if(comp[i] == -1) rdfs(i, ptr), ptr++;
    dag = Graph< T >(ptr);
    for(int i = 0; i < g.size(); i++) {
      for(auto &e : g[i]) {
        int x = comp[e.from], y = comp[e.to];
        if(x == y) continue;
        dag.add_directed_edge(x, y, e.cost);
      }
    }
    group.resize(ptr);
    for(int i = 0; i < g.size(); i++) {
      group[comp[i]].emplace_back(i);
    }
  }

  int operator[](int k) const {
    return comp[k];
  }

private:
  vector< int > order, used;
  Graph< T > rg;

  void dfs(int idx) {
    if(exchange(used[idx], true)) return;
    for(auto &to : g[idx]) dfs(to);
    order.push_back(idx);
  }

  void rdfs(int idx, int cnt) {
    if(comp[idx] != -1) return;
    comp[idx] = cnt;
    for(auto &to : rg.g[idx]) rdfs(to, cnt);
  }
};


int main() {
  int V, E;
  cin >> V >> E;
  StronglyConnectedComponents< int > scc(V);
  map< pair< int, int >, int > mp;
  vector< pair< int, int > > tap, tap2;
  for(int i = 0; i < E; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    --a, --b;
    if(c == 1) {
      scc.add_edge(a, b, c);
      tap.emplace_back(a, b);
    } else {
      scc.add_directed_edge(a, b, c);
      tap2.emplace_back(a, b);
    }
    mp[minmax(a, b)]++;
  }
  scc.build();
  auto group = scc.group;
  vector< int > sz(group.size()), sz2(group.size());
  for(auto &z : tap) {
    sz[scc[z.first]]++;
  }
  for(auto &z : tap2) {
    if(scc[z.first] == scc[z.second]) sz2[scc[z.first]]++;
  }
  int ptr = 0;
  for(auto &p : group) {
    if(p.size() >= 3 && (sz[ptr] + 1 != p.size() || sz2[ptr] != 0)) {
      cout << "Yes" << endl;
      return 0;
    }
    if(p.size() == 2) {
      if(mp[minmax(p[0], p[1])] >= 2) {
        cout << "Yes" << endl;
        return 0;
      }
    }
    ++ptr;
  }
  cout << "No" << endl;
}
0