oj.uz

답안 #944490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944490 2024-03-12T19:05:40 Z Zena_Hossam 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 3000 ms 436 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double
#define ll int
//#define ll1 long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
ll c=0,n;vector<vector<ll>>s;
void solve(vector<ll>v,ll k,ll o){vector<ll>e=v;e[k]=1;//cout<<k<<" ";
if(o==n-1){
    c++;return;

}
for(ll i=0;i<s[k].sz;i++){

    if(e[s[k][i]])continue;
    solve(e,s[k][i],o+1);
}return;
}
int main()
{
   // freopen("measurement.in","r",stdin);freopen("measurement.out","w",stdout);
    ll T=1;fi
    //cin>>T;ll oo=0;
    while(T--)
    {
       cin>>n;
       ll arr[n];s.resize(n+5);
       for(ll i=0;i<n;i++){
        cin>>arr[i];
       }ll m[n+5]={};ll d[n+5]={};
       for(ll i=0;i<n;i++){
            ll a=arr[i];ll p=0;
            while(a!=0){
                if(a%2==1)p++;
                a/=2;
            }
            m[i]=p;
            ll b=arr[i];ll pp=0;
            while(b!=0){
                if(b%3==1)pp++;
                b/=3;
            }
            d[i]=pp;
       }
       for(ll i=0;i<n;i++){
        for(ll j=i+1;j<n;j++){if(i==j)continue;
            if(m[i]==m[j]){s[i].push_back(j);//cout<<i<<" "<<j<<"k\n";
            s[j].push_back(i);}
            else if(d[i]==d[j]){s[i].push_back(j);//cout<<i<<" "<<j<<"k\n";
            s[j].push_back(i); }
        }
       }vector<ll>r(n+9,0);
       for(ll i=0;i<n;i++){
       solve(r,i,0);//cout<<"\n";
       }cout<<c;
    }
}

Compilation message

beauty.cpp: In function 'void solve(std::vector<int>, int, int)':
beauty.cpp:18:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | for(ll i=0;i<s[k].sz;i++){
      |             ^

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 488 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 200 ms 436 KB Output is correct
11 Execution timed out 3052 ms 348 KB Time limit exceeded
12 Halted 0 ms 0 KB -