# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89291 | abil | Beautiful row (IZhO12_beauty) | C++14 | 301 ms | 632 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
Solution by Abil
**/
# include <bits/stdc++.h>
////////////////////////
# define fr first
# define sc second
# define pb push_back
# define mk make_pair
# define sz(s) s.size()
# define all(s) s.begin(),s.end()
# define int long long
using namespace std;
const long long N = (1e6 + 10);
const long long mod = (1e9 + 7);
vector<int > v;
int f(int x){
int cnt = 0;
while(x){
if(x % 3 == 1){
cnt++;
}
x = x / 3;
}
return cnt;
}
main()
{
int n, x;
cin >> n;
for(int i = 1;i <= n; i++){
cin >> x;
v.pb(x);
}
sort(all(v));
int ans = 0;
do{
bool f1 = true;
for(int i = 0;i < sz(v) - 1; i++){
if((__builtin_popcount(v[i])) != (__builtin_popcount(v[i + 1])) && (f(v[i]) != f(v[i + 1]))){
f1 = false;
break;
}
}
if(f1){
ans++;
}
}
while(next_permutation(all(v)));
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |