oj.uz

Submission #97909

# Submission time Handle Problem Language Result Execution time Memory
97909 2019-02-19T13:40:04 Z 314rate Norela (info1cup18_norela) C++14
100 / 100
 91 ms 512 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

int n,m;
ll mask[30];

int st[30],vf=0;

int best=100;
int sir[30];

void go(int p,ll cur)
{
        if(p>m)
        {
                if(cur==0 && vf<best)
                {
                        best=vf;
                        for(int i=1;i<=vf;i++)
                        {
                                sir[i]=st[i];
                        }
                }
        }
        else
        {
                st[++vf]=p;
                go(p+1,(cur^mask[p]));
                vf--;
                go(p+1,cur);
        }
}

int main()
{
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        cin>>n>>m;
        for(int i=1;i<=m;i++)
        {
                int l;
                cin>>l;
                for(int j=1;j<=l;j++)
                {
                        int bit;
                        cin>>bit;
                        bit--;
                        mask[i]+=(1LL<<bit);
                }
        }
        go(1,(1LL<<n)-1);
        cout<<best<<"\n";
        for(int i=1;i<=best;i++)
        {
                cout<<sir[i]<<" ";
        }
        cout<<"\n";
        return 0;
}
/**

**/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 12 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 15 ms 512 KB Output is correct
11 Correct 11 ms 356 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 12 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 15 ms 512 KB Output is correct
11 Correct 11 ms 356 KB Output is correct
12 Correct 12 ms 384 KB Output is correct
13 Correct 22 ms 384 KB Output is correct
14 Correct 22 ms 384 KB Output is correct
15 Correct 22 ms 384 KB Output is correct
16 Correct 29 ms 384 KB Output is correct
17 Correct 25 ms 384 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 12 ms 384 KB Output is correct
9 Correct 13 ms 384 KB Output is correct
10 Correct 15 ms 512 KB Output is correct
11 Correct 11 ms 356 KB Output is correct
12 Correct 12 ms 384 KB Output is correct
13 Correct 22 ms 384 KB Output is correct
14 Correct 22 ms 384 KB Output is correct
15 Correct 22 ms 384 KB Output is correct
16 Correct 29 ms 384 KB Output is correct
17 Correct 25 ms 384 KB Output is correct
18 Correct 46 ms 384 KB Output is correct
19 Correct 42 ms 384 KB Output is correct
20 Correct 91 ms 388 KB Output is correct
21 Correct 85 ms 384 KB Output is correct
22 Correct 71 ms 384 KB Output is correct
23 Correct 81 ms 504 KB Output is correct