oj.uz

Submission #163498

# Submission time Handle Problem Language Result Execution time Memory
163498 2019-11-13T14:42:22 Z tselmegkh Beautiful row (IZhO12_beauty) C++14
0 / 100
 3000 ms 239496 KB 
#include<bits/stdc++.h>
using namespace std;

vector<int> binary[33], trinary[33];
vector<int> a;
int n;
bool same[25], block[25];

int count(int x){
	int res = 0;
	while(x > 0){
		if(x % 3 == 1){
			res++;
		}
		x /= 3;
	}
	return res;
}

unordered_map<string, bool> calc;
int solve(int mask, string cur, int last){
	if(mask == (1 << n) - 1){
		//cout << cur << '\n';
		if(calc[cur])return 0;
		calc[cur] = 1;
		return 1;
	}
	if(calc[cur])return 0;
	calc[cur] = 1;
	int ans = 0;
	if(mask == 0){
		for(int j = 0; j < n; j++){
			int curmask = mask | (1 << j);
			string tmp;
			tmp += a[j] + '0';
			ans += solve(curmask, tmp, j);
		}
	}else{
		int binaryones = __builtin_popcount(a[last]), trinaryones = count(a[last]);
		for(int j = 0; j < binary[binaryones].size(); j++){
			int k = binary[binaryones][j];
			if(mask & (1 << k))continue;
			int curmask = mask | (1 << k);
			string tmp = cur;
			tmp += a[k] + '0';
			ans += solve(curmask, tmp, k);
		}
		for(int j = 0; j < trinary[trinaryones].size(); j++){
			int k = trinary[trinaryones][j];
			if(mask & (1 << k))continue;
			string tmp = cur;
			tmp += a[k] + '0';
			int curmask = mask | (1 << k);
			ans += solve(curmask, tmp, k);
		}
	}
	return ans;
}
int main(){
	cin >> n;
	a.resize(n);

	for(int i = 0; i < n; i++){
		cin >> a[i];
		int cnt3 = count(a[i]), cnt2 = __builtin_popcount(a[i]);
		binary[cnt2].push_back(i);
		trinary[cnt3].push_back(i);
	}

	cout << solve(0, "", -1) << '\n';
}

Compilation message

beauty.cpp: In function 'int solve(int, std::__cxx11::string, int)':
beauty.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < binary[binaryones].size(); j++){
                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
beauty.cpp:48:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < trinary[trinaryones].size(); j++){
                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 32 ms 4948 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Execution timed out 3061 ms 239496 KB Time limit exceeded
9 Halted 0 ms 0 KB -