oj.uz

답안 #82470

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
82470 2018-10-31T02:48:33 Z Just_Solve_The_Problem 아름다운 순열 (IZhO12_beauty) C++11
0 / 100
 2 ms 500 KB 
#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
#define int long long
#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];
 
main() {
	int n;
	scanf("%lld", &n);
	for (int i = 0; i < n; i++) {
		int x;
		scanf("%lld", &x);
		a[i] = x;
		dp[1 << 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++) {
			if ((mask >> j) & 1 ^ 1) continue;
			for (int k = 0; k < n; k++) {
				if (((mask >> k) & 1 ^ 1) && ok[j][k]) {
					dp[mask | (1 << k)] += dp[mask];
				}
			}
		}
	}
	int ans = 0;
	ans += dp[(1 << n) - 1];
	printf("%lld", ans);
}

Compilation message

beauty.cpp:33:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
beauty.cpp: In function 'int main()':
beauty.cpp:49:20: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
    if ((mask >> j) & 1 ^ 1) continue;
        ~~~~~~~~~~~~^~~
beauty.cpp:51:22: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
     if (((mask >> k) & 1 ^ 1) && ok[j][k]) {
          ~~~~~~~~~~~~^~~
beauty.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
beauty.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &x);
   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Incorrect 2 ms 500 KB Output isn't correct
4 Halted 0 ms 0 KB -