# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437038 | BrunoPloumhans | Keys (IOI21_keys) | C++17 | 1 ms | 332 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 <vector>
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> r;
vector<int> cnts;
vector<int> ans;
struct edge {
int k;
int v;
};
vector<vector<edge>> adj;
vector<int> visited_sets;
vector<unordered_set<int>> setlist;
int min_count = 1e9;
vector<bool> vis;
vector<int> visited_indices;
bool a_contains_all_b(unordered_set<int>& a, vector<int>& b) {
for(int i : b) {
if (a.count(i) == 0) return false;
}
return true;
}
void compute_cnt(int start) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |