#743529 (C++17) No.1865 Make Cycle

• 問題: No.1865 Make Cycle
• ユーザー: Be11T_
• 提出日時: 2022-03-04 22:40:24
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 551 ms / 3,000 ms
• コード長: 2,795 bytes
• コンパイル時間: 4,325 ms
• コンパイル使用メモリ: 257,744 KB
• 最終ジャッジ日時: 2025-01-28 05:51:01
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 4
other	AC * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
#define bit(n, k) ((n >> k) & 1)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18;
const double pi = acos(-1);
using Graph = vector<vector<ll>>;
using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>;
using PQ = priority_queue<ll>;
//typedef atcoder::modint998244353 mint;
typedef atcoder::modint1000000007 mint;
const int SIZE = 200010;
ll powll(ll n, ll x) {
    // return n ^ x;
    ll ret = 1;
    rep(i, x) ret *= n;
    return ret;
}
/*struct Edge { ll u, v, cost; };
bool comp(const Edge& e1, const Edge& e2) {
    return e1.cost < e2.cost;
}*/
void OutputYesNo(bool val) {
    if (val) cout << "Yes" << endl;
    else cout << "No" << endl;
}
void OutputTakahashiAoki(bool val) {
    if (val) cout << "Takahashi" << endl;
    else cout << "Aoki" << endl;
}
void OutPutInteger(ll x) { cout << x << endl; }
void OutPutString(string x) { cout << x << endl; }
int n;
int a[SIZE];
int b[SIZE];
bool Toposo(const Graph& G, const Graph& G_rev) {
    vector<int> ret;
    vector<int> index(n), index_rev(n);
    queue<int> q;
    rep(i, n) {
        for (auto v : G[i]) {
            index[v]++;
        }    
    }
    rep(i, n) {
        for (auto v : G_rev[i]) {
            index_rev[v]++;
        }
    }
    rep(i, n) if (index_rev[i] > 0 and index[i] == 0) q.push(i);
    int sz = 0;
    rep(i, n) if (index_rev[i] + index[i] > 0) sz++;
    while (!q.empty()) {
        int cur = q.front(); 
        ret.push_back(cur);
        q.pop();
        for (auto v : G[cur]) {
            index[v]--;
            if (index[v] == 0) {
                q.push(v);
            }
        }
    }
    if (SZ(ret) != sz) return true;
    return false;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int q; cin >> n >> q;
    rep(i, q) {
        cin >> a[i] >> b[i];
        a[i]--, b[i]--;
    }
    int mi = 1, ma = q;
    bool ok = false;
    while (ma - mi > 1) {
        int mid = (mi + ma) / 2;
        Graph G(n), G_rev(n);
        rep(i, mid) {
            G[a[i]].push_back(b[i]);
            G_rev[b[i]].push_back(a[i]);
        }
        if (Toposo(G, G_rev)) {
            ma = mid;
            ok = true;
        }
        else mi = mid;
    }
    if (ok) OutPutInteger(mi +1);
    else OutPutInteger(-1);
 }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX