Submission #1198757

#TimeUsernameProblemLanguageResultExecution timeMemory
1198757THXuanGeppetto (COCI15_geppetto)C++20
32 / 80
1099 ms49372 KiB
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <queue> #include <set> #include <map> #define INF 1e9 using namespace std; typedef long long ll; const ll MAXN = 100005; void solve() { int n, m; cin >> n >> m; int ans = (1 << n); map<int, int>vis; for (int i = 0; i < m; i++) { int u, v; cin >> u >> v; --u; --v; for (int mask = 0; mask < (1 << n); mask++) { if (mask & (1 << u) && mask & (1 << v))vis[mask]++; } } cout << ans - vis.size() << "\n"; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1;// cin>>t; while (t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...