結果
| 問題 |
No.1207 グラフX
|
| コンテスト | |
| ユーザー |
 suta28407928
|
| 提出日時 | 2020-08-30 13:32:00 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,321 bytes |
| コンパイル時間 | 1,069 ms |
| コンパイル使用メモリ | 101,672 KB |
| 最終ジャッジ日時 | 2025-03-14 00:22:17 |
| 合計ジャッジ時間 | 6,661 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp:66:16: error: ‘std::uint_fast64_t’ has not been declared
66 | template <std::uint_fast64_t Modulus> class modint {
| ^~~~~~~~~~~~~
main.cpp:67:20: error: ‘uint_fast64_t’ in namespace ‘std’ does not name a type
67 | using u64 = std::uint_fast64_t;
| ^~~~~~~~~~~~~
main.cpp:19:1: note: ‘std::uint_fast64_t’ is defined in header ‘<cstdint>’; did you forget to ‘#include <cstdint>’?
18 | #include <complex>
+++ |+#include <cstdint>
19 | using namespace std;
main.cpp:70:3: error: ‘u64’ does not name a type
70 | u64 a;
| ^~~
main.cpp:72:26: error: ‘u64’ does not name a type
72 | constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
| ^~~
main.cpp:73:13: error: ‘u64’ does not name a type
73 | constexpr u64 &value() noexcept { return a; }
| ^~~
main.cpp:74:19: error: ‘u64’ does not name a type
74 | constexpr const u64 &value() const noexcept { return a; }
| ^~~
main.cpp: In function ‘int main()’:
main.cpp:192:9: error: ‘mint’ was not declared in this scope; did you mean ‘uint’?
192 | mint ans = 0;
| ^~~~
| uint
main.cpp: In lambda function:
main.cpp:200:25: error: ‘ans’ was not declared in this scope; did you mean ‘abs’?
200 | ans += tmp * modpow(x,v.second,mod);
| ^~~
| abs
main.cpp:200:32: error: ‘tmp’ was not declared in this scope; did you mean ‘tm’?
200 | ans += tmp * modpow(x,v.second,mod);
| ^~~
| tm
main.cpp: In function ‘int main()’:
main.cpp:205:17: error: ‘ans’ was not declared in this scope; did you mean ‘abs’?
205 | cout << ans.value() << "\n";
| ^~~
|
ソースコード
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
rep(i,a.size()) cout << a[i] << " ";
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
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 {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
using mint = modint<mod>;
ll modpow(ll x, ll n, ll mod){
ll res = 1;
while(n > 0){
if(n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
struct UnionFind{
vl p;
vl rank;
vl cnt;
UnionFind(ll n){
rank.resize(n,0);
p.resize(n,0);
cnt.resize(n,0);
rep(i,n){
p[i] = i;
rank[i] = 0;
cnt[i] = 1;
}
}
ll find(ll x){
if(x != p[x]) p[x] = find(p[x]);
return p[x];
}
bool same(ll x, ll y){
return find(x) == find(y);
}
void unite(ll x, ll y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] > rank[y]){
p[y] = x;
cnt[x] += cnt[y];
}else{
p[x] = y;
cnt[y] += cnt[x];
if(rank[x] == rank[y]) rank[y]++;
}
}
ll size(ll x){
return cnt[find(x)];
}
};
int main(){
ll n,m,x; cin >> n >> m >> x;
vector<tapu> edge(m);
rep(i,m){
ll x,y,z; scanf("%lld%lld%lld",&x,&y,&z); x--; y--;
edge[i] = tie(z,x,y);
}
sort(all(edge));
UnionFind uf(n);
vector<vpl> G(n);
rep(i,m){
ll x,y,z;
tie(z,x,y) = edge[i];
if(uf.same(x,y)) continue;
uf.unite(x,y);
G[x].emplace_back(y,z);
G[y].emplace_back(x,z);
}
mint ans = 0;
function<ll(ll,ll)> dfs = [&](ll u, ll p) -> ll {
ll res = 1;
for(auto v : G[u]){
if(v.first == p) continue;
ll df = dfs(v.first,u);
res += df;
mint tmp = df * (n - df);
ans += tmp * modpow(x,v.second,mod);
}
return res;
};
dfs(0,-1);
cout << ans.value() << "\n";
}