oj.uz

Submission #338484

# Submission time Handle Problem Language Result Execution time Memory
338484 2020-12-23T09:11:22 Z beksultan04 Beautiful row (IZhO12_beauty) C++14
0 / 100
 687 ms 262148 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 = 1048579,INF=1e9+7;
int q[N],dp[N][21],tr[30],dv[30],vis[N][21],g[50][50],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]);
}

int rec(int x,int j){
    if (x == (1<<n)-1)ret 1;
    if (vis[x][j]==1)ret dp[x][j];
    vis[x][j]=1;
    int ans=0,i;
    for (i=0;i<n;++i){
        if (i == j || (x&(1<<i)) || g[i][j] == 0)continue;
        ans += rec(x+(1<<i),i);
    }
    ret dp[x][j]=ans;
}


main(){
    int i,j,s,cnt=1;
    scan1(n)
    for (i=0;i<n;++i){
        scan1(q[i])
        tr[i]=troich(q[i]);
        dv[i]=dvoich(q[i]);
    }
    for (i=0;i<n;++i){
        for (j=i+1;j<n;++j){
            if (is(i,j)){
                g[i][j]=1;
                g[j][i]=1;
            }
        }
    }
    int ans=0;
    for (i=0;i<n;++i){
        ans+=rec((1<<i),i);
    }


    cout <<ans;




}

Compilation message

beauty.cpp:55:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main(){
      |      ^
beauty.cpp: In function 'int main()':
beauty.cpp:56:13: warning: unused variable 's' [-Wunused-variable]
   56 |     int i,j,s,cnt=1;
      |             ^
beauty.cpp:56:15: warning: unused variable 'cnt' [-Wunused-variable]
   56 |     int i,j,s,cnt=1;
      |               ^~~
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:57:5: note: in expansion of macro 'scan1'
   57 |     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:59:9: note: in expansion of macro 'scan1'
   59 |         scan1(q[i])
      |         ^~~~~

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 18 ms 5612 KB Output is correct
12 Correct 14 ms 5740 KB Output is correct
13 Correct 102 ms 21868 KB Output is correct
14 Correct 585 ms 86592 KB Output is correct
15 Correct 687 ms 86508 KB Output is correct
16 Correct 460 ms 86508 KB Output is correct
17 Correct 617 ms 86508 KB Output is correct
18 Correct 375 ms 86636 KB Output is correct
19 Runtime error 234 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -