# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381710 | MohamedAhmed04 | Political Development (BOI17_politicaldevelopment) | C++14 | 302 ms | 312684 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 = 5e4 + 10 ;
vector<int>v[MAX] ;
int n , k ;
int ans = 0 ;
vector<int>taken ;
bitset<MAX>mark[MAX] ;
bool check(int x)
{
for(auto &i : taken)
{
if(!mark[x][i])
return false ;
}
return true ;
}
void solve(vector<int>&v1 , int idx)
{
if(idx == v1.size())
{
ans = max(ans , (int)(taken.size())) ;
return ;
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... |