# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145137 | tincamatei | Political Development (BOI17_politicaldevelopment) | C++14 | 704 ms | 29076 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;
const int MAX_N = 50000;
const int MAX_K = 10;
set<int> graph[MAX_N];
set<pair<unsigned int, int> > nodes;
bool off[MAX_N];
int adj[MAX_K];
int bkt(int K) {
int rez = 0;
for(int i = 1; i < (1 << K); ++i) {
int sz = 0;
for(int j = 0; j < K; ++j)
if((1 << j) & i) {
++sz;
if((i & adj[j]) != i)
sz = -K;
}
rez = max(rez, sz);
}
return rez;
}
int maxclique(int nod) {
vector<int> nodeset;
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... |