# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134254 | Kastanda | Political Development (BOI17_politicaldevelopment) | C++11 | 536 ms | 28964 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 pb push_back
using namespace std;
const int N = 50005, K = 10;
int n, k, Mx, M[K], dp[1 << K];
set < int > Adj[N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++)
{
int d, v;
scanf("%d", &d);
for (int j = 0; j < d; j++)
scanf("%d", &v), Adj[i].insert(v);
}
set < pair < int , int > > A;
for (int i = 0; i < n; i++)
A.insert({(int)Adj[i].size(), i});
while (1)
{
if (A.size() <= 1)
{
Mx = max(Mx, (int)A.size());
break;
}
int v = A.begin()->second;
A.erase(A.begin());
vector < int > vec;
for (int u : Adj[v])
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... |