# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
919515 | TIN | Geppetto (COCI15_geppetto) | C++17 | 47 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FNAME "test"
const int N = 21;
int n, m;
int res = 0;
int bad[N];
void Task() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cout << fixed << setprecision(9);
if (fopen(FNAME".inp","r")) {
freopen(FNAME".inp","r",stdin);
freopen(FNAME".out","w",stdout);
}
}
void Solve() {
//Your Code
cin >> n >> m;
memset(bad, 0, sizeof(bad));
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
--u, --v;
bad[u] |= (1 << v);
bad[v] |= (1 << u);
}
for (int mask = 0; mask < (1 << n); mask++) {
res++;
for (int i = 0; i < n; i++) {
if (mask & (1 << i)) {
if (mask & bad[i]) {
res--;
break;
}
}
}
}
cout << res << '\n';
}
int main() {
Task();
Solve();
cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
return 37^37;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |