# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841285 | serifefedartar | Political Development (BOI17_politicaldevelopment) | C++17 | 3049 ms | 25724 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 200005
vector<set<int>> graph;
vector<pair<int,int>> degree;
int main() {
fast
int N, K, x, D;
cin >> N >> K;
graph = vector<set<int>>(N, set<int>());
degree = vector<pair<int,int>>(N);
for (int i = 0; i < N; i++)
degree[i] = {0, i};
for (int i = 0; i < N; i++) {
cin >> D;
for (int j = 0; j < D; j++) {
cin >> x;
graph[x].insert(i);
graph[i].insert(x);
degree[i].f++;
degree[x].f++;
# | 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... |