# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106205 | 2019-04-17T10:24:30 Z | Hideo | Beautiful row (IZhO12_beauty) | C++14 | 18 ms | 2816 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mk make_pair #define fr first #define sc second #define vi vector < int > #define vl vector < ll > #define pi pair < int, int > #define pii pair < int, pi > #define vii vector < pi > const int N = 1e5 + 7; const int mod = 1e9 + 7; int b[20], t[20]; int n; ll dp[(1 << 20)][20]; ll ans; int bin (int x, int c = 0){ if (x % 2 == 1) c++; if (!x) return c; bin(x / 2, c); } int ter (int x, int c = 0){ if (x % 3 == 1) c++; if (!x) return c; ter(x / 3, c); } main(){ cin >> n; for (int i = 0; i < n; i++){ int a; cin >> a; b[i] = bin(a); t[i] = ter(a); } for (int i = 0; i < n; i++) dp[(1 << i)][i] = 1; for (int val = 2; val <= n; val++){ for (int mask = 1; mask < (1 << n); mask++){ int cnt = 0; for (int sub = 0; sub < n; sub++){ if (mask & (1 << sub)) cnt++; } if (cnt != val) continue; for (int sub = 0; sub < n; sub++){ if (mask & (1 << sub)){ int submask = (mask ^ (1 << sub)); for (int last = 0; last < n; last++){ if (submask & (1 << last) && (b[last] == b[sub] || t[last] == t[sub])){ dp[mask][sub] += dp[submask][last]; dp[mask][sub] %= mod; } } } } if (val == n){ for (int last = 0; last < n; last++){ ans += dp[mask][last]; ans %= mod; } cout << ans; return 0; } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 512 KB | Output is correct |
7 | Correct | 4 ms | 512 KB | Output is correct |
8 | Correct | 3 ms | 512 KB | Output is correct |
9 | Correct | 3 ms | 512 KB | Output is correct |
10 | Correct | 3 ms | 560 KB | Output is correct |
11 | Incorrect | 18 ms | 2816 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |