Submission #1232483

#TimeUsernameProblemLanguageResultExecution timeMemory
1232483nicolo_010Rarest Insects (IOI22_insects)C++20
0 / 100
0 ms408 KiB
#include <bits/stdc++.h> #include "insects.h" using namespace std; template <typename T> using v = vector<T>; using pii = pair<int, int>; using ll = long long; #define rep(i, k, n) for (int i = k; i < n; i++) int sz; v<bool> vis; v<v<int>> adj; void dfs(int n) { vis[n] = true; sz++; for (auto x : adj[n]) { if (!vis[x]) { dfs(x); } } } int min_cardinality(int N) { adj.resize(N); rep(i, 0, N) { move_inside(i); rep(j, i+1, N) { move_inside(j); int a = press_button(); if (a == 2) { adj[i].push_back(j); adj[j].push_back(i); } } } vis.assign(N, false); int ans = 1e9; rep(i, 0, N) { if (!vis[i]) { sz = 0; dfs(i); ans = min(ans, sz); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...