# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197161 | arnold518 | Political Development (BOI17_politicaldevelopment) | C++14 | 3042 ms | 25860 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e4;
int N, K, ans=1;
set<int> adj[MAXN+10];
bool vis[MAXN+10];
int main()
{
int i, j, k;
scanf("%d%d", &N, &K);
for(i=1; i<=N; i++)
{
int s;
scanf("%d", &s);
while(s--) { int t; scanf("%d", &t); adj[i].insert(t+1); }
}
while(1)
{
pii t(987654321, 0);
for(i=1; i<=N; i++) if(!vis[i]) t=min(t, pii(adj[i].size(), i));
if(t.second==0) break;
int now=t.second;
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... |