Submission #17309

#	Time	Username	Problem	Language	Result	Execution time	Memory
17309		gs14004	Beautiful row (IZhO12_beauty)	C++14	50 / 100	3000 ms	165560 KiB

beauty

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;

bool adj[20][20];
int a[20], n;

lint dp[1<<20][20];

lint f(int bit, int pos){
	if(bit == (1<<n) - 1) return 1;
	if(~dp[bit][pos]) return dp[bit][pos];
	lint ret = 0;
	for(int i=0; i<n; i++){
		if(((bit >> i) & 1) == 0 && adj[pos][i]){
			ret += f(bit | 1 << i, i);
		}
	}
	return ret;
}

bool mat(int p, int q){
	int cp = 0, cq = 0;
	for(int i=0; i<31; i++){
		if((p >> i) & 1) cp++;
		if((q >> i) & 1) cq++;
	}
	if(cp == cq) return 1;
	cp = cq = 0;
	while(p || q){
		if(p%3 == 1) cp++;
		if(q%3 == 1) cq++;
		p /= 3, q /= 3;
	}
	return cp == cq;
}

int main(){
	memset(dp,-1,sizeof(dp));
	scanf("%d",&n);
	for(int i=0; i<n; i++){
		scanf("%d",&a[i]);
	}
	for(int i=0; i<n; i++){
		for(int j=i+1; j<n; j++){
			if(mat(a[i], a[j])) adj[i][j] = adj[j][i] = 1;
		}
	}
	lint ret = 0;
	for(int i=0; i<n; i++){
		ret += f((1 << i) ,i);
	}
	printf("%lld",ret);
}

• Subtask 1: 50 / 100