oj.uz

답안 #36331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36331 2017-12-07T13:15:55 Z Kerim 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 3000 ms 174052 KB 
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("avx") 
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=21;
int two[N],three[N],n;
ll dp[N][1<<20];
int T;
ll rec(int mask,int last){
	if(mask==T)
		return 1;
	ll &ret=dp[last][mask];
	if(~ret)
		return ret;ret=0;
	for(int i=0;i<n;i++)	
		if(!(mask>>i&1)){
			if((two[last]==two[i] or three[last]==three[i]))
				ret+=rec(mask|(1<<i),i);
		}
	return ret;	
}
int main(){
    //~ freopen("file.in", "r", stdin);
    scanf("%d",&n);T=(1<<n)-1;
    for(int i=0;i<n;i++){
		int x;
		scanf("%d",&x);
		two[i]=__builtin_popcount(x);
		while(x>=1){
			three[i]+=(x%3==1);
			x/=3;
		}
	}
	memset(dp,-1,sizeof dp);
	ll ans=0;
	for(int i=0;i<n;i++)
		ans+=rec(1<<i,i);
	printf("%lld\n",ans);
	return 0;
}

Compilation message

beauty.cpp: In function 'int main()':
beauty.cpp:41:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);T=(1<<n)-1;
                   ^
beauty.cpp:44:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
                 ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 174052 KB Output is correct
2 Correct 9 ms 174052 KB Output is correct
3 Correct 19 ms 174052 KB Output is correct
4 Correct 16 ms 174052 KB Output is correct
5 Correct 13 ms 174052 KB Output is correct
6 Correct 19 ms 174052 KB Output is correct
7 Correct 6 ms 174052 KB Output is correct
8 Correct 23 ms 174052 KB Output is correct
9 Correct 19 ms 174052 KB Output is correct
10 Correct 6 ms 174052 KB Output is correct
11 Correct 19 ms 174052 KB Output is correct
12 Correct 26 ms 174052 KB Output is correct
13 Correct 143 ms 174052 KB Output is correct
14 Correct 583 ms 174052 KB Output is correct
15 Correct 569 ms 174052 KB Output is correct
16 Correct 469 ms 174052 KB Output is correct
17 Correct 566 ms 174052 KB Output is correct
18 Correct 349 ms 174052 KB Output is correct
19 Execution timed out 3000 ms 174052 KB Execution timed out
20 Halted 0 ms 0 KB -