#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
using namespace std;
/* -------------------- Typedefs -------------------- */
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef float fl;
typedef double db;
typedef long double ld;
/* -------------------- Usings -------------------- */
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/* -------------------- Defines -------------------- */
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()
/* -------------------- Constants -------------------- */
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);
/* -------------------- Functions -------------------- */
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void precision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll range_sum(ll a, ll b) {
ll dif = a - 1, cnt = b - a + 1;
ll ans = ((b - a + 1) * (b - a + 2)) / 2;
ans += ((b - a + 1) * dif);
return ans;
}
string dec_to_bin(ll a) {
string s = "";
for (ll i = a; i > 0; ) {
ll k = i % 2;
i /= 2;
char c = k + 48;
s += c;
}
if (a == 0) {
s = "0";
}
reverse(all(s));
return s;
}
ll bin_to_dec(string s) {
ll num = 0;
for (int i = 0; i < s.size(); i++) {
num *= 2ll;
num += (s[i] - '0');
}
return num;
}
int isPrime(ll a) {
if (a == 1) return 0;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) return 0;
}
return 1;
}
ll binpow(ll a, ll b) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
}
b >>= 1;
a *= a;
}
return ans;
}
ll binpow_by_mod(ll a, ll b, ll mod) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
/* -------------------- Solution -------------------- */
const int N = 21, M = (1 << 20);
int a[N], path[N][N];
pii cnt[N];
ll dp[M][N];
void slv() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
dp[1 << i][i] = 1ll;
int num = a[i];
while (num) {
if (num % 2) ++cnt[i].ff;
num /= 2;
}
while (a[i]) {
if (a[i] % 3 == 1) ++cnt[i].ss;
a[i] /= 3;
}
}
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (cnt[i].ff == cnt[j].ff || cnt[i].ss == cnt[j].ss) {
path[i][j] = path[j][i] = 1;
}
}
}
for (int s = 1; s < (1 << n); ++s) {
vi v;
for (int mask = 0; mask < n; ++mask) {
if (s & (1 << mask)) v.pub(mask);
}
for (int i = 0; i < v.size(); ++i) {
for (int j = 0; j < v.size(); ++j) {
if (i == j || !path[v[j]][v[i]]) continue;
dp[s][v[i]] += dp[s ^ (1 << v[i])][v[j]];
}
}
}
ll ans = 0;
for (int i = 0; i < n; i++) ans += dp[(1 << n) - 1][i];
cout << ans;
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
//precision(0);
cs();
return 0;
}
Compilation message
beauty.cpp: In function 'll range_sum(ll, ll)':
beauty.cpp:90:21: warning: unused variable 'cnt' [-Wunused-variable]
90 | ll dif = a - 1, cnt = b - a + 1;
| ^~~
beauty.cpp: In function 'll bin_to_dec(std::string)':
beauty.cpp:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
113 | for (int i = 0; i < s.size(); i++) {
| ~~^~~~~~~~~~
beauty.cpp: In function 'void slv()':
beauty.cpp:191:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
191 | for (int i = 0; i < v.size(); ++i) {
| ~~^~~~~~~~~~
beauty.cpp:192:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
192 | for (int j = 0; j < v.size(); ++j) {
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
604 KB |
Output is correct |
| 7 |
Correct |
1 ms |
604 KB |
Output is correct |
| 8 |
Correct |
1 ms |
604 KB |
Output is correct |
| 9 |
Correct |
1 ms |
604 KB |
Output is correct |
| 10 |
Correct |
1 ms |
604 KB |
Output is correct |
| 11 |
Correct |
5 ms |
4700 KB |
Output is correct |
| 12 |
Correct |
6 ms |
4700 KB |
Output is correct |
| 13 |
Correct |
22 ms |
12952 KB |
Output is correct |
| 14 |
Correct |
101 ms |
43604 KB |
Output is correct |
| 15 |
Correct |
89 ms |
43600 KB |
Output is correct |
| 16 |
Correct |
103 ms |
43672 KB |
Output is correct |
| 17 |
Correct |
114 ms |
43688 KB |
Output is correct |
| 18 |
Correct |
122 ms |
43672 KB |
Output is correct |
| 19 |
Correct |
468 ms |
172636 KB |
Output is correct |
| 20 |
Correct |
410 ms |
172628 KB |
Output is correct |
