# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419107 | 2021-06-06T12:32:08 Z | acm | Geppetto (COCI15_geppetto) | C++14 | 1 ms | 312 KB |
#include <bits/stdc++.h> #define speed \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define precision \ cout.precision(30); \ cerr.precision(10); #define ll long long #define ld long double #define pll pair<ll, ll> #define pii pair<int, int> #define forn(n) for (int i = 1; i <= n; i++) #define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++)) #define pb(x) push_back(x) #define sz(x) (int)x.size() #define mp(x, y) make_pair(x, y) #define all(x) x.begin(), x.end() #define pc(x) __builtin_popcount(x) #define pcll(x) __builtin_popcountll(x) #define F first #define S second using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void ioi(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } ll n, m, k, p[50], sz[50]; ll get(ll v) { return p[v] = (v == p[v] ? v : get(p[v])); } void add(ll u, ll v) { if ((u = get(u)) == (v = get(v))) return; if (sz[u] < sz[v]) swap(u, v); sz[u] += sz[v], p[v] = u; } int main() { speed; precision; // code cin >> n >> m; for (int i = 1; i <= n; i++) p[i] = i, sz[i] = 1; while (m--) { ll u, v; cin >> u >> v; add(u, v); } for (int i = 1; i <= n; i++) k += (i == get(i)) * (1 << sz[get(i)]) - 1; cout << ++k; // endl #ifndef ONLINE_JUDGE cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Incorrect | 1 ms | 204 KB | Output isn't correct |
5 | Incorrect | 1 ms | 204 KB | Output isn't correct |
6 | Incorrect | 1 ms | 204 KB | Output isn't correct |
7 | Incorrect | 1 ms | 312 KB | Output isn't correct |
8 | Incorrect | 1 ms | 204 KB | Output isn't correct |
9 | Incorrect | 1 ms | 204 KB | Output isn't correct |
10 | Incorrect | 1 ms | 204 KB | Output isn't correct |