Submission #220799

#TimeUsernameProblemLanguageResultExecution timeMemory
220799Haunted_CppGeppetto (COCI15_geppetto)C++17
80 / 80
7 ms384 KiB
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <cassert> #include <string> #include <cstring> #include <bitset> #include <random> #include <chrono> #include <iomanip> #pragma GCC optimize ("Ofast") #pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma GCC optimize("unroll-loops") #define FOR(i, a, b) for(int i = a; i < (int) b; i++) #define F0R(i, a) FOR (i, 0, a) #define ROF(i, a, b) for(int i = a; i >= (int) b; i--) #define R0F(i, a) ROF(i, a, 0) #define GO(i, a) for (auto i : a) #define rsz resize #define eb emplace_back #define pb push_back #define sz(x) (int) x.size() #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define f first #define s second using namespace std; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vpii; typedef vector<vi> vvi; typedef vector<vpii> vvpii; typedef long long i64; typedef vector<i64> vi64; typedef vector<vi64> vvi64; typedef pair<i64, i64> pi64; typedef vector<pi64> vpi64; const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1}; const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1}; const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31}; const int N = 20 + 1; int n, m; vvi g (N); int solve (int p = 0, int mask = 0) { if (p >= n) return 1; int res = 0; res += solve (p + 1, mask); GO (to, g[p]) { if ((mask >> to) & 1) goto fim; } res += solve (p + 1, mask | (1 << p)); fim:; return res; } int main () { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; F0R (i, m) { int st, et; cin >> st >> et; --st; --et; g[st].eb(et); g[et].eb(st); } cout << solve () << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...