oj.uz

Submission #65682

# Submission time Handle Problem Language Result Execution time Memory
65682 2018-08-08T11:44:53 Z forestryks Geppetto (COCI15_geppetto) C++14
80 / 80
 23 ms 788 KB 
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////

const int MAXN = 25;

int n, m;
vector<pii> e;

int main() {
    FAST_IO;
    cin >> n >> m;
    rep(i, m) {
        int a, b;
        cin >> a >> b;
        e.push_back({a - 1, b - 1});
    }

    ll res = 0;
    for (int mask = 0; mask < (1 << n); ++mask) {
        bool flag = false;
        for (auto it : e) {
            if ((mask & (1 << it.f)) && (mask & (1 << it.s))) {
                flag = true;
                break;
            }
        }

        if (!flag) {
            res++;
        }
    }

    cout << res << endl;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 15 ms 472 KB Output is correct
4 Correct 18 ms 492 KB Output is correct
5 Correct 17 ms 712 KB Output is correct
6 Correct 15 ms 732 KB Output is correct
7 Correct 17 ms 732 KB Output is correct
8 Correct 20 ms 732 KB Output is correct
9 Correct 23 ms 768 KB Output is correct
10 Correct 11 ms 788 KB Output is correct