#989417 (C++23(gcc13)) No.1660 Matrix Exponentiation

• 問題: No.1660 Matrix Exponentiation
• ユーザー: ir5
• 提出日時: 2024-06-18 10:00:34
• 言語: C++23(gcc13) (gcc 13.2.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,037 bytes
• コンパイル時間: 1,905 ms
• コンパイル使用メモリ: 145,428 KB
• 実行使用メモリ: 13,696 KB
• 最終ジャッジ日時: 2024-06-18 10:00:40
• 合計ジャッジ時間: 5,312 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	AC	2 ms; 6,944 KB
testcase_02	WA	-
testcase_03	AC	2 ms; 6,944 KB
testcase_04	AC	2 ms; 6,944 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,940 KB
testcase_07	AC	2 ms; 6,940 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	WA	-
testcase_10	AC	4 ms; 6,940 KB
testcase_11	AC	4 ms; 6,940 KB
testcase_12	AC	2 ms; 6,940 KB
testcase_13	AC	2 ms; 6,940 KB
testcase_14	AC	2 ms; 6,944 KB
testcase_15	AC	2 ms; 6,944 KB
testcase_16	AC	2 ms; 6,940 KB
testcase_17	AC	2 ms; 6,940 KB
testcase_18	AC	2 ms; 6,940 KB
testcase_19	AC	65 ms; 6,944 KB
testcase_20	AC	42 ms; 6,940 KB
testcase_21	AC	64 ms; 6,940 KB
testcase_22	AC	4 ms; 6,940 KB
testcase_23	AC	26 ms; 6,940 KB
testcase_24	AC	94 ms; 12,876 KB
testcase_25	AC	51 ms; 6,944 KB
testcase_26	WA	-
testcase_27	AC	69 ms; 9,216 KB
testcase_28	AC	85 ms; 7,936 KB
testcase_29	AC	100 ms; 13,696 KB

ソースコード

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

ll solve() {
  int n, m; cin >> n >> m;
  vector<vector<int>> vg(n + 1);
  for (int i : range(m)) {
    int a, b; cin >> a >> b;
    vg[a].push_back(b);
  }

  if (m == 0) return 0;

  vector<int> ans(n + 1);
  auto dfs = [&](auto self, int idx) -> int {
    if (ans[idx]) return ans[idx];
    ans[idx] = n + 1;

    int res = 1;
    for (int to : vg[idx]) {
      res = max(res, 1 + self(self, to));
    }
    res = min(res, n + 1);
    return ans[idx] = res;
  };

  int res = 1;
  for (int i : range(n + 1)) res = max(res, dfs(dfs, i));

  for (int i : range(n + 1)) dump(i << " " << dfs(dfs, i));

  return res >= n ? -1 : res;
}

int main() {
  cout << fixed << setprecision(12);
  cout << solve() << endl;
}