제출 #927013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927013		vjudge1	Paths (BOI18_paths)	C++17	100 / 100	407 ms	94880 KiB

paths

//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 2e3 + 1, mod = 1e9 + 7;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slv() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> s[k + 1], c(n + 1);
	for (int i = 1; i <= n; i++) {
		cin >> c[i];
		s[c[i]].push_back(i);
   	}
	vector<int> g[n + 1][k + 1];
	while (m--) {
	    int u, v;
	    cin >> u >> v;
    	g[u][c[v]].push_back(v);
    	g[v][c[u]].push_back(u);
	}	
    ll dp[(1 << k)][n + 1];
    for (int i = 0; i < (1 << k); i++) {
    	for (int j = 0; j <= n; j++) 
    		dp[i][j] = 0;
    }
    ll ans = 0;
    for (int msk = 1; msk < (1 << k); msk++) {
    	vector<int> h;
    	for (int i = 0; i < k; i++) {
    		if (msk >> i & 1) 
    			h.push_back(i + 1);
    	}
    	if (sz(h) == 1) {
    		for (int v: s[h[0]]) 	
    			dp[msk][v] = 1;
    		continue;
    	}
    	for (int i = 0; i < sz(h); i++) {
    		int mk = msk - (1 << (h[i] - 1));
    		for (int v: s[h[i]]) {
    			for (int j = 0; j < sz(h); j++) {
    				if (i == j) continue;
    				for (int to: g[v][h[j]]) {
    					dp[msk][v] += dp[mk][to];
    				}
    			}
    			ans += dp[msk][v];
    		}
    	}
    }
    cout << ans;
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama                                              

컴파일 시 표준 에러 (stderr) 메시지

paths.cpp:79:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   79 | main() {
      | ^~~~

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