Submission #897748

#	Time	Username	Problem	Language	Result	Execution time	Memory
897748		LCJLY	Paths (BOI18_paths)	C++14	100 / 100	269 ms	107580 KiB

paths

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;

int n,m,k;
int arr[300005];
vector<int>adj[300005];
int memo[300005][35];

int dp(int index, int mask){
	if(memo[index][mask]!=-1) return memo[index][mask];
	int ans=0;
	if(__builtin_popcount(mask)>1) ans=1;
	
	for(auto it:adj[index]){
		if(mask&(1<<arr[it])) continue;
		int next=mask|(1<<arr[it]);
		ans+=dp(it,next);
	}
	return memo[index][mask]=ans;
}

void solve(){	
	cin >> n >> m >> k;
	
	for(int x=1;x<=n;x++){
		cin >> arr[x];
		arr[x]--;
	}
	
	int temp,temp2;
	for(int x=0;x<m;x++){
		cin >> temp >> temp2;
		adj[temp].push_back(temp2);
		adj[temp2].push_back(temp);
	}
	
	memset(memo,-1,sizeof(memo));
	int counter=0;
	for(int x=1;x<=n;x++){
		counter+=dp(x,1<<arr[x]);
	}
	cout << counter;
}
 
int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("redistricting.in", "r", stdin);
	//freopen("redistricting.out", "w", stdout);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}

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