제출 #253611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253611		Vimmer	Geppetto (COCI15_geppetto)	C++14	80 / 80	53 ms	512 KiB

geppetto

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10005
#define M ll(998244353)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



set <int> se[100];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m;

    cin >> n >> m;

    int ans = 0;

    for (; m > 0; m--)
    {
        int x, y;

        cin >> x >> y;

        x--; y--;

        se[x].insert(y);

        se[y].insert(x);
    }

    for (int msk = 1; msk < (1 << n); msk++)
    {
        bool bad = 0;

        for (int i = 0; i < n && !bad; i++)
            if ((1 << i) & msk)
              for (auto it : se[i]) if ((1 << it) & msk) {bad = 1; break;}

        if (!bad) ans++;
    }

    cout << ans + 1 << endl;
}

• Subtask 1: 80 / 80