結果
問題 | No.1865 Make Cycle |
ユーザー | tokusakurai |
提出日時 | 2022-03-04 21:40:24 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 817 ms / 3,000 ms |
コード長 | 5,036 bytes |
コンパイル時間 | 2,290 ms |
コンパイル使用メモリ | 212,600 KB |
実行使用メモリ | 17,280 KB |
最終ジャッジ日時 | 2023-09-26 00:21:57 |
合計ジャッジ時間 | 13,246 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 411 ms
12,124 KB |
testcase_01 | AC | 229 ms
10,428 KB |
testcase_02 | AC | 546 ms
13,272 KB |
testcase_03 | AC | 94 ms
11,356 KB |
testcase_04 | AC | 259 ms
14,980 KB |
testcase_05 | AC | 446 ms
14,728 KB |
testcase_06 | AC | 433 ms
13,380 KB |
testcase_07 | AC | 328 ms
12,560 KB |
testcase_08 | AC | 565 ms
15,464 KB |
testcase_09 | AC | 423 ms
14,304 KB |
testcase_10 | AC | 440 ms
14,456 KB |
testcase_11 | AC | 426 ms
14,860 KB |
testcase_12 | AC | 373 ms
12,720 KB |
testcase_13 | AC | 403 ms
12,304 KB |
testcase_14 | AC | 292 ms
11,976 KB |
testcase_15 | AC | 559 ms
14,144 KB |
testcase_16 | AC | 649 ms
15,380 KB |
testcase_17 | AC | 379 ms
12,156 KB |
testcase_18 | AC | 464 ms
14,796 KB |
testcase_19 | AC | 817 ms
17,280 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 1 ms
4,380 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < n; i++) #define rep2(i, x, n) for (int i = x; i <= n; i++) #define rep3(i, x, n) for (int i = x; i >= n; i--) #define each(e, v) for (auto &e : v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; const int inf = (1 << 30) - 1; const ll INF = (1LL << 60) - 1; const int MOD = 1000000007; // const int MOD = 998244353; template <bool directed = true> struct Graph { struct edge { int to, id; edge(int to, int id) : to(to), id(id) {} }; vector<vector<edge>> es; const int n; int m; Graph(int n) : es(n), n(n), m(0) {} void add_edge(int from, int to) { es[from].emplace_back(to, m); if (!directed) es[to].emplace_back(from, m); m++; } }; template <bool directed = true> struct Strongly_Connected_Components { struct edge { int to, id; edge(int to, int id) : to(to), id(id) {} }; vector<vector<edge>> es, rs; vector<int> vs; vector<int> comp; const int n; int m; Strongly_Connected_Components(int n) : es(n), rs(n), comp(n), n(n), m(0) {} void add_edge(int from, int to) { es[from].emplace_back(to, m), rs[to].emplace_back(from, m); if (!directed) es[to].emplace_back(from, m), rs[from].emplace_back(to, m); m++; } void _dfs(int now) { if (comp[now] != -1) return; comp[now] = 1; for (auto &e : es[now]) _dfs(e.to); vs.push_back(now); } void _rdfs(int now, int col) { if (comp[now] != -1) return; comp[now] = col; for (auto &e : rs[now]) _rdfs(e.to, col); } Graph<true> decompose() { fill(begin(comp), end(comp), -1); for (int i = 0; i < n; i++) { if (comp[i] == -1) _dfs(i); } fill(begin(comp), end(comp), -1); reverse(begin(vs), end(vs)); int cnt = 0; for (auto &e : vs) { if (comp[e] == -1) _rdfs(e, cnt++); } Graph<true> G(cnt); for (int i = 0; i < n; i++) { for (auto &e : es[i]) { int u = comp[i], v = comp[e.to]; if (u != v) G.add_edge(u, v); } } return G; } int operator[](int k) const { return comp[k]; } }; int main() { int N, Q; cin >> N >> Q; vector<int> u(Q), v(Q); rep(i, Q) { cin >> u[i] >> v[i]; u[i]--, v[i]--; } int l = -1, r = Q; while (r - l > 1) { int m = (l + r) / 2; Strongly_Connected_Components G(N); rep(i, m + 1) G.add_edge(u[i], v[i]); int K = G.decompose().n; (K == N ? l : r) = m; } cout << (r == Q ? -1 : r + 1) << '\n'; }