結果

問題 No.1364 [Renaming] Road to Cherry from Zelkova
ユーザー rniyarniya
提出日時 2021-01-22 22:23:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 253 ms / 2,500 ms
コード長 9,587 bytes
コンパイル時間 2,973 ms
コンパイル使用メモリ 216,992 KB
最終ジャッジ日時 2025-01-18 04:35:10
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 45
権限があれば一括ダウンロードができます

ソースコード

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, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
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;
}
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; }
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
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;
/**
* @brief modint
* @docs docs/modulo/modint.md
*/
template <uint32_t mod> class modint {
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
public:
u32 v;
constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}
constexpr u32& value() noexcept { return v; }
constexpr const u32& value() const noexcept { return v; }
constexpr modint operator+(const modint& rhs) const noexcept { return modint(*this) += rhs; }
constexpr modint operator-(const modint& rhs) const noexcept { return modint(*this) -= rhs; }
constexpr modint operator*(const modint& rhs) const noexcept { return modint(*this) *= rhs; }
constexpr modint operator/(const modint& rhs) const noexcept { return modint(*this) /= rhs; }
constexpr modint& operator+=(const modint& rhs) noexcept {
v += rhs.v;
if (v >= mod) v -= mod;
return *this;
}
constexpr modint& operator-=(const modint& rhs) noexcept {
if (v < rhs.v) v += mod;
v -= rhs.v;
return *this;
}
constexpr modint& operator*=(const modint& rhs) noexcept {
v = (u64)v * rhs.v % mod;
return *this;
}
constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.pow(mod - 2); }
constexpr modint pow(u64 exp) const noexcept {
modint self(*this), res(1);
while (exp > 0) {
if (exp & 1) res *= self;
self *= self;
exp >>= 1;
}
return res;
}
constexpr modint& operator++() noexcept {
if (++v == mod) v = 0;
return *this;
}
constexpr modint& operator--() noexcept {
if (v == 0) v = mod;
return --v, *this;
}
constexpr modint operator++(int) noexcept {
modint t = *this;
return ++*this, t;
}
constexpr modint operator--(int) noexcept {
modint t = *this;
return --*this, t;
}
constexpr modint operator-() const noexcept { return modint(mod - v); }
template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }
template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }
template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }
template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }
constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }
constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }
constexpr bool operator!() const noexcept { return !v; }
friend istream& operator>>(istream& s, modint& rhs) noexcept {
i64 v;
rhs = modint{(s >> v, v)};
return s;
}
friend ostream& operator<<(ostream& s, const modint& rhs) noexcept { return s << rhs.v; }
};
/**
* @brief Strongly Connected Components
* @docs docs/graph/StronglyConnectedComponents.md
*/
struct StronglyConnectedComponents {
vector<vector<int>> G, rG, C, T;
vector<int> vs, cmp, used;
StronglyConnectedComponents(int n) : G(n), rG(n), cmp(n), used(n) {}
void add_edge(int u, int v) {
G[u].emplace_back(v);
rG[v].emplace_back(u);
}
void dfs(int v) {
used[v] = 1;
for (int u : G[v])
if (!used[u]) dfs(u);
vs.emplace_back(v);
}
void rdfs(int v, int k) {
used[v] = 1;
cmp[v] = k;
C[k].emplace_back(v);
for (int u : rG[v])
if (!used[u]) rdfs(u, k);
}
int build() {
int n = G.size();
for (int i = 0; i < n; i++)
if (!used[i]) dfs(i);
fill(used.begin(), used.end(), 0);
int k = 0;
for (int i = n - 1; i >= 0; --i) {
if (!used[vs[i]]) {
C.emplace_back(), T.emplace_back();
rdfs(vs[i], k++);
}
}
for (int v = 0; v < n; v++) {
for (int u : G[v]) {
if (cmp[v] != cmp[u]) {
T[cmp[v]].emplace_back(cmp[u]);
}
}
}
for (int i = 0; i < k; i++) {
sort(T[i].begin(), T[i].end());
T[i].erase(unique(T[i].begin(), T[i].end()), T[i].end());
}
return k;
}
int operator[](int i) const { return cmp[i]; }
};
using mint = modint<MOD>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> u(M), v(M), l(M), a(M);
StronglyConnectedComponents SCC(N + 1);
for (int i = 0; i < M; i++) {
cin >> u[i] >> v[i] >> l[i] >> a[i];
SCC.add_edge(u[i], v[i]);
}
int n = SCC.build();
vector<mint> cnt(n, 0), sum(n, 0);
cnt[SCC[0]] = 1;
vector<int> reach(n, 0), roop(n, 0);
reach[SCC[0]] = 1;
vector<vector<tuple<int, int, int>>> G(n);
for (int i = 0; i < M; i++) {
int U = SCC[u[i]], V = SCC[v[i]];
if (U == V) continue;
G[U].emplace_back(V, l[i], a[i]);
}
for (int i = 0; i < n; ++i) {
if (reach[i] && SCC.C[i].size() > 1) roop[i] |= 1;
for (auto e : G[i]) {
int to, len, na;
tie(to, len, na) = e;
reach[to] |= reach[i];
roop[to] |= roop[i];
cnt[to] += cnt[i] * na;
sum[to] += sum[i] * na + cnt[i] * na * len;
}
}
if (roop[SCC[N]]) {
cout << "INF" << '\n';
return 0;
}
cout << sum[SCC[N]] << '\n';
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0