oj.uz

Submission #500797

# Submission time Handle Problem Language Result Execution time Memory
500797 2022-01-01T09:43:29 Z SmolBrain Beautiful row (IZhO12_beauty) C++17
0 / 100
 9 ms 1612 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / y)
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl;
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,popcnt,fma")

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = 1e18 + 5;

bool can[20][20];
int dp[1 << 20][20];
vector<int> masks[25];

void solve(int test_case)
{
    int n; cin >> n;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

    auto binaryones = [](int x) {
        int cnt = 0;
        while (x) {
            cnt += (x & 1);
            x /= 2;
        }

        return cnt;
    };

    auto ternaryones = [](int x) {
        int cnt = 0;
        while (x) {
            if (x % 3 == 1) cnt++;
            x /= 3;
        }

        return cnt;
    };

    auto get = [&](int x, int y) -> bool {
        if (binaryones(x) == binaryones(y)) return true;
        if (ternaryones(x) == ternaryones(y)) return true;
        return false;
    };

    rep(i, n) {
        rep(j, n) {
            can[i][j] = get(a[i], a[j]);
        }
    }

    rep(i, (1 << n)) {
        masks[setbits(i) - 1].pb(i);
    }

    rep(i, n) {
        for (auto &j : masks[i]) {
            rep(k, n) {
                int f = 1 << k;
                if ((j & f) == 0) conts;

                if (!i) {
                    dp[j][k]++;
                    conts;
                }

                rep(prev, n) {
                    if (prev == k) conts;

                    int f2 = 1 << prev;
                    if((j & f2) == 0) conts;

                    if (can[prev][k]) {
                        dp[j][k] += dp[j ^ f][prev];
                    }
                }
            }
        }
    }

    int ans = 0;

    rep(k, n) {
        ans += dp[(1 << n) - 1][k];
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

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

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Incorrect 9 ms 1612 KB Output isn't correct
12 Halted 0 ms 0 KB -