oj.uz

답안 #542515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542515 2022-03-26T19:54:30 Z inksamurai Šarenlist (COCI22_sarenlist) C++17
35 / 110
 18 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,x,n) for(int i=x;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3wByxeT ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

//snuke's mod int
template <ll mod>
struct modint{
	ll x; // typedef long long ll;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};
using mint=modint<1000'000'007>;

signed main(){
_3wByxeT;
	int n,m,k;
	cin>>n>>m>>k;

	vec(vi) adj(n);
	rep(i,n-1){
		int u,v;
		cin>>u>>v;
		u-=1,v-=1;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	using vp=vec(pii);
	vp es;
	rep(i,m){
		int u,v;
		cin>>u>>v;
		u-=1,v-=1;
		es.pb({u,v});
	}

	mint ans=0;

	rng(msk,1,(1<<m)){
		std::map<pii,int> mp,nmp;

		auto dfs=[&](auto self,int v,int par,int nd)->bool{
			if(v==nd) return 1;
			bool sok=0;
			for(auto u:adj[v]){
				if(u==par) continue;
				bool pok=self(self,u,v,nd);
				if(pok){
					nmp[minmax(u,v)]=1;
				}
				sok=sok or pok;
			}
			return sok;
		};

		mint now=1;

		auto add=[&](int u,int v){
			nmp.clear();
			dfs(dfs,v,-1,u);
			bool pok=0;
			for(auto p:nmp){
				if(mp.find(p.fi)!=mp.end()){
					pok=1;
				}
				mp[p.fi]=1;
			}
			if(!pok){
				now*=mint(k);
			}
		};

		rep(i,m){
			if(msk>>i&1){
				auto [u,v]=es[i];
				add(u,v);
			}
		}

		// {
		// 	print(".....");
		// 	rep(i,m){
		// 		if(msk>>i&1){
		// 			auto [u,v]=es[i];
		// 			print(u,v);
		// 		}
		// 	}
		// 	print(sz(mp));
		// 	print("......");
		// }

		// int now=sz(mp);
		// assert(now);
		if(__builtin_popcount(msk)%2){
			ans-=now*mint(k).pow(n-1-sz(mp));
		}else{
			ans+=now*mint(k).pow(n-1-sz(mp));
		}
	}

	ans+=mint(k).pow(n-1);
	print(ans.x);
//
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 18 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 18 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Incorrect 1 ms 212 KB Output isn't correct
22 Halted 0 ms 0 KB -