Submission #636385

#	Time	Username	Problem	Language	Result	Execution time	Memory
636385		TranGiaHuy1508	Paths (BOI18_paths)	C++17	100 / 100	745 ms	100304 KiB

paths

/*
	Unknown's C++ Template (v3.2)
*/

#include "bits/stdc++.h"
using namespace std;

#define int long long

using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using vvii = vector<vii>;
template <class T> using maxpq = priority_queue<T>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mid ((l+r)>>1)
#define fi first
#define se second

#ifdef LOCAL
	#define debug(x) cout << #x << " = " << x << "\n";
#else
	#define debug(x) ;
#endif

template <class A, class B>
ostream& operator << (ostream& out, pair<A, B> x)
{ out << "(" << x.first << ", " << x.second << ")"; return out; }

template <class T>
ostream& operator << (ostream& out, vector<T> x){
	out << "[";
	for (int i=0; i<sz(x); i++) { out << (i ? ", " : "") << x[i]; }
	out << "]"; return out;
}

template <class T>
istream& operator >> (istream& in, vector<T> &x){
	for (auto &i: x) in >> i;
	return in;
}

const ld PI = acos(-1.0);
const int allmod[3] = {(int)1e9+7, 998244353, (int)1e9+9};
const int mod = allmod[0];
const int maxn = 3e5 + 64;
const ll inf = 1e18;
const ld eps = 1e-6;
const int multitest = 0;

int n, m, k, cl[maxn], dp[maxn][32];
vvi adj;

void main_program(){
	cin >> n >> m >> k;

	for (int i = 0; i < n; i++){
		int c; cin >> c;
		cl[i] = c - 1; 
		dp[i][1 << (c - 1)] = 1;
	}

	adj.resize(n);
	for (int i = 0; i < m; i++){
		int a, b; cin >> a >> b;
		a--; b--;

		adj[a].pb(b);
		adj[b].pb(a);
	}

	for (int it = 1; it <= k; it++){
		for (int mask = 0; mask < (1 << k); mask++){
			if (__builtin_popcount(mask) != it) continue;
			for (int u = 0; u < n; u++){
				for (auto v: adj[u]){
					if ((mask >> cl[v]) & 1) continue;
					dp[v][mask | (1 << cl[v])] += dp[u][mask];
				}
			}
		}
	}

	int res = 0;
	for (int mask = 0; mask < (1 << k); mask++){
		if (__builtin_popcount(mask) > 1){
			for (int i = 0; i < n; i++) res += dp[i][mask];
		}
	}

	cout << res << "\n";
}

void pre_main(){

}

signed main(){
	#ifdef LOCAL
		auto stime = chrono::high_resolution_clock::now();
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	#ifndef ONLINE_JUDGE
		if (fopen(".inp", "r")){
			freopen(".inp", "r", stdin);
			freopen(".out", "w", stdout);
		}
	#endif
	int t = 1; if (multitest) cin >> t;
	pre_main();
	while (t--) main_program();
	#ifdef LOCAL
		auto etime = chrono::high_resolution_clock::now();
		auto duration = chrono::duration_cast<chrono::milliseconds>(etime-stime).count();
		cout << "\n[" << duration << "ms]\n";
	#endif
}

Compilation message (stderr)

paths.cpp: In function 'int main()':
paths.cpp:112:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |    freopen(".inp", "r", stdin);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~
paths.cpp:113:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |    freopen(".out", "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 23 / 23
• Subtask 2: 20 / 20
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30