# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
82333 | 2018-10-30T02:39:42 Z | Just_Solve_The_Problem | 아름다운 순열 (IZhO12_beauty) | C++11 | 14 ms | 1808 KB |
#include <stdio.h> #include <algorithm> using namespace std; #define ll long long int a[22]; int n; int ok[22][22]; int get(int x) { int res = 0; while (x) { res += (x % 3 == 1); x /= 3; } return res; } int get1(int x) { int res = 0; while (x) { res += (x % 2 == 1); x /= 2; } return res; } int dp[1 << 20][20]; main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) { int x; scanf("%d", &x); a[i] = x; dp[1 << i][i]++; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { ok[i][j] = (get(a[i]) == get(a[j]) || get1(a[i]) == get1(a[j])); } } for (int mask = 1; mask < (1 << n); mask++) { for (int j = 0; j < n; j++) { for (int k = 0; k < n; k++) { if (((mask >> k) & 1 ^ 1) && ok[j][k]) { dp[mask | (1 << k)][k] += dp[mask][j]; } } } } int ans = 0; for (int i = 0; i < n; i++) { ans += dp[(1 << n) - 1][i]; } printf("%d", ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 580 KB | Output is correct |
4 | Correct | 2 ms | 580 KB | Output is correct |
5 | Correct | 2 ms | 580 KB | Output is correct |
6 | Correct | 3 ms | 580 KB | Output is correct |
7 | Correct | 3 ms | 580 KB | Output is correct |
8 | Correct | 2 ms | 580 KB | Output is correct |
9 | Correct | 3 ms | 580 KB | Output is correct |
10 | Correct | 2 ms | 644 KB | Output is correct |
11 | Incorrect | 14 ms | 1808 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |