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

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

ファイルパターン	結果
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
#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 2000000000;
constexpr long long INF= 2000000000000000000;
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}
constexpr long long MOD = 998244353;
//graphをトポロジカルソートする。返り値のvectorにトポロジカル順序が格納される
vector<int> topological_sort(int& n,vector<vector<int>>& graph) {
    vector<int> indegree(n);
    for(int i = 0;i < n;i++) {
        indegree[i] = 0;
    }
    for(auto x:graph) {
        for(auto y:x) {
            indegree[y]++;
        }
    }
    stack<int> st;
    for(int i = 0;i < n;i++) {
        if(indegree[i] == 0) {
            st.push(i);
        }
    }
    vector<int> res;
    while(!st.empty()) {
        int i = st.top();
        st.pop();
        res.push_back(i);
        for(auto x:graph[i]) {
            indegree[x]--;
            if(indegree[x] == 0) {
                st.push(x);
            }
        }
    }
    return res;
}
int main() {
    int n,q;
    cin >> n >> q;
    vector<pair<int,int>> vec(q);
    for(auto& [a,b]: vec) {
        cin >> a >> b;
        a--;
        b--;
    }
    int ng = -1;
    int ok = q;
    while(ok - ng > 1) {
        int mid = (ng + ok) / 2;
        vector<vector<int>> graph(n);
        for(int i = 0;i <= mid;i++) {
            graph[vec[i].first].push_back(vec[i].second);
        }
        vector<int> res = topological_sort(n,graph);
        if(res.size() == n) ng = mid;
        else ok = mid;
    }
    if(ok == q) cout << -1 << endl;
    else cout << ok + 1 << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX