oj.uz

Submission #957540

# Submission time Handle Problem Language Result Execution time Memory
957540 2024-04-04T02:34:27 Z yeediot Beautiful row (IZhO12_beauty) C++14
100 / 100
 1112 ms 164692 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    vector<int>v(n);
    vector<vector<int>>cnt(2,vector<int>(n));
    for(int i=0;i<n;i++){
        cin>>v[i];
        int x=v[i];
        while(x){
            if(x&1){
                cnt[0][i]++;
            }
            x>>=1;
        }
        x=v[i];
        while(x){
            if(x%3==1){
                cnt[1][i]++;
            }
            x/=3;
        }
    }
    int mx=(1<<n);
    int dp[n][mx];
    memset(dp,0,sizeof(dp));
    for(int i=0;i<n;i++){
        dp[i][(1<<i)]=1;
    }
    for(int i=0;i<mx;i++){
        for(int j=0;j<n;j++){
            if(i>>j&1){
                for(int k=0;k<n;k++){
                    if(k==j)continue;
                    if(i>>k&1 and (cnt[0][j]==cnt[0][k] or cnt[1][j]==cnt[1][k])){
                        dp[k][i]+=dp[j][i^(1<<k)];
                    }
                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        ans+=dp[i][mx-1];
    }
    cout<<ans<<'\n';
}
 /*
 input:
 
 */

Compilation message

beauty.cpp: In function 'void setIO(std::string)':
beauty.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
beauty.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 9 ms 2248 KB Output is correct
12 Correct 8 ms 2252 KB Output is correct
13 Correct 40 ms 8648 KB Output is correct
14 Correct 201 ms 37368 KB Output is correct
15 Correct 204 ms 37368 KB Output is correct
16 Correct 204 ms 37212 KB Output is correct
17 Correct 210 ms 37208 KB Output is correct
18 Correct 202 ms 37360 KB Output is correct
19 Correct 1041 ms 164584 KB Output is correct
20 Correct 1112 ms 164692 KB Output is correct