# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851173 | kderylo | Political Development (BOI17_politicaldevelopment) | C++17 | 659 ms | 38224 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 <iostream>
#include <set>
#include <vector>
using namespace std;
const int stala=5e4+10;
const int st=(1<<12);
vector<int>w[stala];
vector<int>odw_w[stala];
int deg[stala];
set<pair<int,int> >s;
set<pair<int,int> >krawedzie;
vector<int>pom;
int tab[st];
int number_of_bits(int ile,int dl)
{
int wyn=0;
for(int i=0;i<dl;i++){
if((ile&(1<<i))>0){
wyn++;
}
}
return wyn;
}
int find_subset()
{
int dl=(int)pom.size();
int wyn=0;
for(int i=0;i<dl;i++){
tab[(1<<i)]=1;
for(int j=i+1;j<dl;j++){
# | 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... |