제출 #1088258

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1088258		nguyen31hoang08minh2003	Geppetto (COCI15_geppetto)	C++17	80 / 80	4 ms	604 KiB

geppetto

#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define fort(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

int main() {
    const int maxN = 20;
    int n, m, a, b, res = 0, adj[maxN]{};
    function<void(int, int)> rec = [&](int i, int mask) {
        if (i >= n) {
            ++res;
            return;
        }
        rec(i + 1, mask);
        if (!(mask & (1 << i)))
            rec(i + 1, mask | adj[i]);
    };
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    fort(_, 1, m) {
        cin >> a >> b;
        --a;
        --b;
        adj[a] |= 1 << b;
        adj[b] |= 1 << a;
    }
    rec(0, 0);
    cout << res << '\n';
    return 0;
}

• Subtask 1: 80 / 80