oj.uz

답안 #338329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338329 2020-12-23T02:53:02 Z beksultan04 아름다운 순열 (IZhO12_beauty) C++14
0 / 100
 3000 ms 23936 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+11,INF=1e9+7;
int tr[30],dv[30],vis[300],ans,n;
vector <int> g[N];
int troich(int x){
    int ans=0;
    while (x > 0){
        if (x%3==1)ans++;
        x /=3;
    }
    ret ans;
}
int dvoich(int x){
    int ans=0;
    while (x > 0){
        if (x%2==1)ans++;
        x /=2;
    }
    ret ans;
}

bool is(int a,int b){
    ret (tr[a] == tr[b] || dv[a] == dv[b]);
}

void dfs(int x,int cnt){
    if (cnt == n){
        ans++;
        ret ;
    }
    for (int i=0;i<g[x].size();++i){
        if (vis[g[x][i]]==1)continue;
        vis[g[x][i]]=1;
        dfs(g[x][i],cnt+1);
        vis[g[x][i]]=0;
    }

}

main(){
    int i,j;
    scan1(n)
    for (i=0;i<n;++i){
        int x;
        scan1(x)
        tr[i]=troich(x);
        dv[i]=dvoich(x);
    }
    for (i=0;i<n;++i){
        for (j=i+1;j<n;++j){
            if (is(i,j)){
                g[i+1].pb(j+1);
                g[j+1].pb(i+1);
            }
        }
    }
    for (i=1;i<=n;++i){
        vis[i]=1;
        dfs(i,1);
        vis[i]=0;
    }
    cout <<ans;

}

Compilation message

beauty.cpp: In function 'void dfs(long long int, long long int)':
beauty.cpp:48:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i=0;i<g[x].size();++i){
      |                  ~^~~~~~~~~~~~
beauty.cpp: At global scope:
beauty.cpp:57:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main(){
      |      ^
beauty.cpp: In function 'int main()':
beauty.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
beauty.cpp:59:5: note: in expansion of macro 'scan1'
   59 |     scan1(n)
      |     ^~~~~
beauty.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
beauty.cpp:62:9: note: in expansion of macro 'scan1'
   62 |         scan1(x)
      |         ^~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23916 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 14 ms 23788 KB Output is correct
4 Correct 14 ms 23788 KB Output is correct
5 Correct 14 ms 23788 KB Output is correct
6 Correct 18 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 235 ms 23936 KB Output is correct
9 Correct 18 ms 23788 KB Output is correct
10 Correct 113 ms 23788 KB Output is correct
11 Execution timed out 3085 ms 23788 KB Time limit exceeded
12 Halted 0 ms 0 KB -