oj.uz

답안 #36329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36329 2017-12-07T13:11:28 Z Kerim 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 3000 ms 182240 KB 
#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=22;
int two[N],three[N],n;
ll dp[1<<20][N];
ll rec(int mask,int last){
	if(mask==(1<<n)-1)
		return 1;
	ll &ret=dp[mask][last];
	if(~ret)
		return ret;ret=0;
	for(int i=0;i<n;i++)	
		if(!(mask>>i&1)){
			if(last==n or (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);
    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);
	printf("%lld\n",rec(0,n));
	return 0;
}

Compilation message

beauty.cpp: In function 'int main()':
beauty.cpp:38:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
beauty.cpp:41: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 9 ms 182240 KB Output is correct
2 Correct 16 ms 182240 KB Output is correct
3 Correct 6 ms 182240 KB Output is correct
4 Correct 9 ms 182240 KB Output is correct
5 Correct 16 ms 182240 KB Output is correct
6 Correct 3 ms 182240 KB Output is correct
7 Correct 9 ms 182240 KB Output is correct
8 Correct 9 ms 182240 KB Output is correct
9 Correct 6 ms 182240 KB Output is correct
10 Correct 13 ms 182240 KB Output is correct
11 Correct 19 ms 182240 KB Output is correct
12 Correct 39 ms 182240 KB Output is correct
13 Correct 103 ms 182240 KB Output is correct
14 Correct 589 ms 182240 KB Output is correct
15 Correct 689 ms 182240 KB Output is correct
16 Correct 449 ms 182240 KB Output is correct
17 Correct 583 ms 182240 KB Output is correct
18 Correct 346 ms 182240 KB Output is correct
19 Execution timed out 3000 ms 182240 KB Execution timed out
20 Halted 0 ms 0 KB -