Submission #1304574

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304574		yus1f_m	Norela (info1cup18_norela)	C++20	0 / 100	1095 ms	332 KiB

norela

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000;
using namespace std;
void solve()
{
    ll n,m,num,Num;
    bool flag;
    cin>>n>>m;
    vector<ll>counts(n+1),res,ans;
    vector<vector<ll>>nums(n+1);
    for(int i=0;i<n;i++)
    {
        ans.pb(INF);
    }
    for(int i=0;i<m;i++)
    {
        cin>>num;
        for(int j=0;j<num;j++)
        {
            cin>>Num;
            nums[i].pb(Num);
        }
    }
    for(int i=1;i<pow(2,n);i++)
    {
        flag=false,fill(all(counts),0),res.clear();
        for(int j=0;j<n;j++)
        {
            if(i&(ll)pow(2,j))
            {
                res.pb(j+1);
                for(int k=0;k<nums[j].size();k++)
                {
                    counts[nums[j][k]]++;
                }
            }
        }
        for(int j=1;j<=n;j++)
        {
            if(counts[j]%2==0)
            {
                flag=true;
                break;
            }
        }
        if(!flag)
        {
            ans=min(ans,res);
        }
    }
    cout<<ans.size()<<"\n";
    for(int i=0;i<ans.size();i++)
    {
        cout<<ans[i]<<" ";
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25