# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841302 | serifefedartar | Political Development (BOI17_politicaldevelopment) | C++17 | 1154 ms | 26040 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 fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 50005
vector<set<int>> graph;
int deg[MAXN], active[MAXN];
int main() {
fast
int N, K, x, D;
cin >> N >> K;
graph = vector<set<int>>(N, set<int>());
queue<int> q;
for (int i = 0; i < N; i++)
active[i] = true;
for (int i = 0; i < N; i++) {
cin >> deg[i];
for (int j = 0; j < deg[i]; j++) {
cin >> x;
graph[i].insert(x);
}
if (deg[i] < K)
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... |