# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
173199 | 2020-01-03T14:52:19 Z | juggernaut | 아름다운 순열 (IZhO12_beauty) | C++14 | 1660 ms | 164500 KB |
//Just try and the idea will come! #include<bits/stdc++.h> #define int long long int using namespace std; int n,i,a[20],dp[1048576][20],ans,j,tri[20],bin[20],mask; main(){ scanf("%lld",&n); for(;i<n;i++){ scanf("%lld",&a[i]); dp[1<<i][i]=1; bin[i]=__builtin_popcount(a[i]); mask=a[i]; while(mask){ if(mask%3==1)tri[i]++; mask/=3; } } for(mask=0;mask<(1<<n);mask++) for(i=0;i<n;i++) if(mask&(1<<i)) for(j=0;j<n;j++) if(i!=j) if(mask&(1<<j)&&(tri[i]==tri[j]||bin[i]==bin[j]))dp[mask][i]+=dp[mask^(1<<i)][j]; for(i=0;i<n;i++)ans+=dp[(1<<n)-1][i]; printf("%lld",ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 504 KB | Output is correct |
7 | Correct | 3 ms | 504 KB | Output is correct |
8 | Correct | 3 ms | 508 KB | Output is correct |
9 | Correct | 3 ms | 504 KB | Output is correct |
10 | Correct | 3 ms | 504 KB | Output is correct |
11 | Correct | 17 ms | 2936 KB | Output is correct |
12 | Correct | 17 ms | 2908 KB | Output is correct |
13 | Correct | 78 ms | 10548 KB | Output is correct |
14 | Correct | 358 ms | 41468 KB | Output is correct |
15 | Correct | 341 ms | 41492 KB | Output is correct |
16 | Correct | 369 ms | 41344 KB | Output is correct |
17 | Correct | 347 ms | 41636 KB | Output is correct |
18 | Correct | 370 ms | 41396 KB | Output is correct |
19 | Correct | 1660 ms | 164500 KB | Output is correct |
20 | Correct | 1557 ms | 164420 KB | Output is correct |