結果

問題 No.2152 [Cherry Anniversary 2] 19 Petals of Cherry
ユーザー 👑 KazunKazun
提出日時 2022-11-28 02:59:59
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,129 bytes
コンパイル時間 6,170 ms
コンパイル使用メモリ 251,800 KB
最終ジャッジ日時 2025-02-09 01:46:22
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In function 'll calc(int, bool)':
main.cpp:250:15: error: reference to 'popcount' is ambiguous
  250 |         if (B[popcount[S]][j]){
      |               ^~~~~~~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bits/align.h:35,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/memory:71,
                 from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:82,
                 from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bit:426:5: note: candidates are: 'template<class _Tp> constexpr std::_If_is_unsigned_integer<_Tp, int> std::popcount(_Tp)'
  426 |     popcount(_Tp __x) noexcept
      |     ^~~~~~~~
main.cpp:233:13: note:                 'std::vector<int> popcount'
  233 | vector<int> popcount(K,0);
      |             ^~~~~~~~
main.cpp: In function 'int main()':
main.cpp:269:9: error: reference to 'popcount' is ambiguous
  269 |         popcount[S]=popcount[S>>1]+(S&1);
      |         ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bit:426:5: note: candidates are: 'template<class _Tp> constexpr std::_If_is_unsigned_integer<_Tp, int> std::popcount(_Tp)'
  426 |     popcount(_Tp __x) noexcept
      |     ^~~~~~~~
main.cpp:233:13: note:                 'std::vector<int> popcount'
  233 | vector<int> popcount(K,0);
      |             ^~~~~~~~
main.cpp:269:21: error: reference to 'popcount' is ambiguous
  269 |         popcount[S]=popcount[S>>1]+(S&1);
      |                     ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.4.0/include/c++/12/bit:426:5: note: candidates are: 'template<class _Tp> constexpr std::_If_is_unsigned_integer<_Tp, int> std::popcount(_Tp)'
  426 |     popcount(_Tp __x) noexcept
      |     ^~~~~~~~
main.cpp:233:13: note:                 'std::vector<int> popcount'
  233 | vector<int> popcount(K,0);
      |             ^~~~~~~~

ソースコード

diff # 

#include<bits/stdc++.h>

using namespace std;
using ll=long long;

// マクロの定義
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define unless(cond) if (!(cond))

// オーバーロードマクロ
#define overload2(_1, _2, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload5(_1, _2, _3, _4, _5, name, ...) name

// 繰り返し系
#define rep1(n) for (ll i=0; i<n; i++)
#define rep2(i,n) for (ll i=0; i<n; i++)
#define rep3(i,a,b) for (ll i=a; i<b; i++)
#define rep4(i,a,b,c) for (ll i=a; i<b; i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)

#define foreach1(x,a) for (auto &&x: a)
#define foreach2(x,y,a) for (auto &&[x,y]: a)
#define foreach3(x,y,z,a) for (auto &&[x,y,z]: a)
#define foreach4(x,y,z,w,a) for (auto &&[x,y,z,w]: a)
#define foreach(...) overload5(__VA_ARGS__,foreach4,foreach3,foreach2,foreach1)(__VA_ARGS__)

// 除算に関する関数
template<typename T, typename U>
T floor(T x, U y){return (x>0 ? x/y: (x-y+1)/y);}

template<typename T, typename U>
T ceil(T x, U y){return (x>0 ? (x+y-1)/y: x/y);}

template<typename T, typename U>
T mod(T x, U y){
    T q=floor(x,y);
    return x-q*y;
}

template<typename T, typename U>
pair<T,T> divmod(T x, U y){
    T q=floor(x,y);
    return {q,x-q*y};
}

// 指数に関する関数
ll intpow(ll x, ll y){
    ll a=1;
    while (y){
        if (y&1) a*=x;
        x*=x;
        y>>=1;
    }
    return a;
}

ll modpow(ll x, ll y, ll z){
    ll a=1;
    while (y){
        if (y&1) (a*=x)%=z;
        (x*=x)%=z;
        y>>=1;
    }
    return a;
}

ll sum(vector<int> &X){
    ll y=0;
    for (auto &&x: X) y+=x;
    return y;
}

template<typename T>
T sum(vector<T> &X){
    T y=T(0);
    for (auto &&x: X) y+=x;
    return y;
}

// max, min
template<typename T, typename U>
inline bool chmax(T &a, const U b){
    return (a<b ? a=b, 1: 0);
}

template<typename T, typename U>
inline bool chmin(T &a, const U b){
    return (a>b ? a=b, 1: 0);
}

template<class... T>
constexpr auto max(T... a){
    return max(initializer_list<common_type_t<T...>>{a...});
}
template<class... T>
constexpr auto min(T... a){
    return min(initializer_list<common_type_t<T...>>{a...});
}

template<class T>
T max(vector<T> X){
    T alpha=X[0];
    for (auto x:X) chmax(alpha, x);
    return alpha;
}

template<class T>
T min(vector<T> X){
    T alpha=X[0];
    for (auto x:X) chmin(alpha, x);
    return alpha;
}

//特別な演算

template<class T, class U>
pair<T,U> operator+(const pair<T,U> &lhs, const pair<T,U> &rhs){
    return pair<T,U>(lhs.first + rhs.first, lhs.second + rhs.second);
}

template<class T, class U>
pair<T,U> operator-(const pair<T,U> &lhs, const pair<T,U> &rhs){
    return pair<T,U>(lhs.first - rhs.first, lhs.second - rhs.second);
}

template<class T, class U>
pair<T,U> operator+=(pair<T,U> &lhs, const pair<T,U> &rhs){return lhs=lhs+rhs;}

template<class T, class U>
pair<T,U> operator-=(pair<T,U> &lhs, const pair<T,U> &rhs){return lhs=lhs-rhs;}

// 入出力
template<class... T>
void input(T&... a){(cin >> ... >> a);}

void print(){cout << "\n";}

template<class T, class... Ts>
void print(const T& a, const Ts&... b){
    cout << a;
    (cout << ... << (cout << " ", b));
    cout << "\n";
}

template<typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &P){
    is >> P.first >> P.second;
    return is;
}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T,U> &P){
    os << "(" << P.first << ", " << P.second << ")";
    return os;
}

template<typename T>
vector<T> vector_input(int N, int index){
    vector<T> X(N+index);
    for (int i=index; i<index+N; i++) cin >> X[i];
    return X;
}

template<typename T>
istream &operator>>(istream &is, vector<T> &X){
    for (auto &x: X) is >> x;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &X){
    int N=(int)len(X);
    os << "[";
    rep(i,N) os << (i ? ", ": "") << X[i];
    return os << "]";
}

template<typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &S){
    os << "{{";
    int i=0;
    for (T a: S) {os << (i ? ", ": "") << a; i++;}
    return os << "}}";
}

template<typename T>
ostream &operator<<(ostream &os, const set<T> &S){
    os << "{";
    int i=0;
    for (T a: S) {os << (i ? ", ": "") << a; i++;}
    return os << "}";
}

template<typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &S){
    os << "{{";
    int i=0;
    for (T a: S) {os << (i ? ", ": "") << a; i++;}
    return os << "}}";
}

template<typename T>
ostream &operator<<(ostream &os, const multiset<T> &S){
    os << "{";
    int i=0;
    for (T a: S) {os << (i ? ", ": "") << a; i++;}
    return os << "}";
}

template<typename A, typename T>
ostream &operator<<(ostream &os, const unordered_map<A,T> &M){
    os << "{{";
    int i=0;
    for (auto p:M) {os << (i ? ", ": "") << p.first << ": " << p.second; i++;}
    return os << "}}";
}

template<typename A, typename T>
ostream &operator<<(ostream &os, const map<A,T> &M){
    os << "{";
    int i=0;
    for (auto p:M) {os << (i ? ", ": "") << p.first << ": " << p.second; i++;}
    return os << "}";
}

const int N=19;
const int K=1<<N;
vector<vector<ll>> Memo(K, vector<ll>(2,-1));
vector<int> popcount(K,0);
vector<vector<bool>> B(N, vector<bool>(N, false));

bool bit(int S, int k){
    return (S>>k)&1;
}

ll calc(int S, bool flag){
    if (Memo[S][flag]>=0){
        return Memo[S][flag];
    }

    Memo[S][flag]=0;
    int t=0;
    for (int j=0; j<N; j++){
        if (bit(S,j)) continue;

        if (B[popcount[S]][j]){
            Memo[S][flag]+=calc(S|(1<<j), flag^(t&1));
        }
        t++;
    }

    return Memo[S][flag];
}

int main(){
    for (int i=0; i<N; i++){
        int L; cin >> L;
        for (int j=0; j<L; j++){
            int a; cin >> a;
            B[i][a-1]=true;
        }
    }

    for (int S=1; S<(1<<N)-1; S++){
        popcount[S]=popcount[S>>1]+(S&1);
    }

    Memo[K-1][0]=1; Memo[K-1][1]=0;

    print(calc(0,0), calc(0,1));
}
0