# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128403 | Kerim | Political Development (BOI17_politicaldevelopment) | C++20 | 0 ms | 324 KiB |
#include<iostream>
#include<vector>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<bitset>
using namespace std;
int n,k;
vector<int> degree;
vector<vector<int> > G;
vector<bool> done;
vector<int> current;
vector<int> degOrdering;
vector<int> degOrderingPos;
//for debugging;
vector<int> maxCliqueFound;
void readInput() {
scanf("%d%d", &n, &k);
degree = vector<int> (n,0);
for(int i = 0; i < n; ++i) {
scanf("%d", &(degree[i]));
G.push_back(vector<int> (degree[i], 0));
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... |