結果

問題 No.1660 Matrix Exponentiation
ユーザー rniyarniya
提出日時 2021-08-27 22:57:38
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 123 ms / 2,000 ms
コード長 7,144 bytes
コンパイル時間 2,355 ms
コンパイル使用メモリ 211,400 KB
実行使用メモリ 24,116 KB
最終ジャッジ日時 2023-08-13 10:26:22
合計ジャッジ時間 4,594 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,388 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 8 ms
9,900 KB
testcase_11 AC 7 ms
8,912 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 56 ms
10,748 KB
testcase_20 AC 38 ms
10,244 KB
testcase_21 AC 40 ms
6,812 KB
testcase_22 AC 7 ms
7,472 KB
testcase_23 AC 22 ms
8,456 KB
testcase_24 AC 112 ms
22,896 KB
testcase_25 AC 28 ms
10,584 KB
testcase_26 AC 123 ms
22,812 KB
testcase_27 AC 35 ms
15,068 KB
testcase_28 AC 58 ms
12,760 KB
testcase_29 AC 98 ms
24,116 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    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 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

template <int i, typename T> void print_tuple(ostream&, const T&) {}
template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {
    if (i) os << ',';
    os << get<i>(t);
    print_tuple<i + 1, T, Args...>(os, t);
}
template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    os << '{';
    print_tuple<0, tuple<Args...>, Args...>(os, t);
    return os << '}';
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief Cycle Detection
 * @docs docs/graph/CycleDetection.md
 */
template <bool directed> struct CycleDetection {
    vector<vector<int>> G;
    vector<int> seen, finished;
    stack<int> hist;
    int pos;
    CycleDetection(int n) : G(n), seen(n, 0), finished(n, 0), pos(-1) {}
    void add_edge(int u, int v) { G[u].emplace_back(v); }
    void dfs(int v, int p) {
        seen[v] = 1;
        hist.emplace(v);
        for (int u : G[v]) {
            if (!directed && u == p) continue;
            if (finished[u]) continue;
            if (seen[u] && !finished[u]) {
                pos = u;
                return;
            }
            dfs(u, v);
            if (~pos) return;
        }
        finished[v] = 1;
        hist.pop();
    }
    vector<int> build() {
        for (int v = 0; v < (int)G.size(); v++) {
            if (!seen[v]) dfs(v, -1);
            if (~pos) break;
        }
        vector<int> res;
        while (!hist.empty()) {
            int t = hist.top();
            hist.pop();
            res.emplace_back(t);
            if (t == pos) break;
        }
        return res;
    }
};

/**
 * @brief Topological Sort
 * @docs docs/graph/TopologicalSort.md
 */
struct TopologicalSort {
    vector<vector<int>> G;
    vector<int> seen, order;
    TopologicalSort(int n) : G(n), seen(n) {}
    void add_edge(int u, int v) { G[u].emplace_back(v); }
    void dfs(int v) {
        seen[v] = 1;
        for (int u : G[v]) {
            if (!seen[u]) dfs(u);
        }
        order.emplace_back(v);
    }
    vector<int> build() {
        for (int i = 0; i < (int)G.size(); i++) {
            if (!seen[i]) dfs(i);
        }
        reverse(order.begin(), order.end());
        return order;
    }
    int operator[](int i) { return order[i]; }
};

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    if (K == 0) {
        cout << 1 << '\n';
        return 0;
    }

    CycleDetection<true> CD(N);
    TopologicalSort TS(N);
    for (; K--;) {
        int r, c;
        cin >> r >> c;
        r--, c--;
        CD.add_edge(r, c);
        TS.add_edge(r, c);
    }

    if (!CD.build().empty()) {
        cout << -1 << '\n';
        return 0;
    }

    TS.build();
    auto& G = TS.G;
    vector<int> dp(N, 0);
    int ans = 0;

    for (int i = N - 1; i >= 0; i--) {
        int v = TS[i];
        for (int& u : G[v]) chmax(dp[v], dp[u] + 1);
        chmax(ans, dp[v]);
    }

    cout << ans + 1 << '\n';
    return 0;
}
0