# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98873 | robot_dreams | Bosses (BOI16_bosses) | C++17 | 1179 ms | 1020 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>
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cout << setprecision(12);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> adj(n);
forn(v, n) {
int k; cin >> k;
forn(i, k) {
int u; cin >> u; u--;
adj[u].push_back(v);
}
}
ll ans = LLONG_MAX;
queue<int> q;
vector<int> depth;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |