oj.uz

Submission #36328

# Submission time Handle Problem Language Result Execution time Memory
36328 2017-12-07T12:58:24 Z Kerim Beautiful row (IZhO12_beauty) C++14
0 / 100
 19 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,0));
	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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 182240 KB Output is correct
2 Correct 13 ms 182240 KB Output is correct
3 Correct 19 ms 182240 KB Output is correct
4 Correct 16 ms 182240 KB Output is correct
5 Incorrect 13 ms 182240 KB Output isn't correct
6 Halted 0 ms 0 KB -