# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363230 | Tenis0206 | Norela (info1cup18_norela) | C++11 | 257 ms | 492 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;
int n,m;
int Min = 1e9;
long long v[10000005];
string s,rez;
void Back(int k, long long sum)
{
if(sum==(1LL<<(n+1))-2)
{
if(k-1<Min || (k-1==Min && s<rez))
{
Min = k-1;
rez = s;
}
}
if(k>m)
{
return;
}
for(int i=s[k-1]+1; i<=m; i++)
{
s.push_back(i);
Back(k+1,(sum^v[i]));
s.pop_back();
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=1; i<=m; i++)
{
int q;
cin>>q;
for(int j=1; j<=q; j++)
{
int b;
cin>>b;
v[i]+=(1LL<<b);
}
}
s.push_back(0);
Back(1,0);
cout<<Min<<'\n';
for(int i=1;i<rez.size();i++)
{
cout<<(int)(rez[i])<<' ';
}
return 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... |