Submission #1289724

#TimeUsernameProblemLanguageResultExecution timeMemory
1289724amodiNorela (info1cup18_norela)C++20
0 / 100
49 ms572 KiB
#include <bits/stdc++.h> using namespace std; #define int long long //her ceviz yuvarlaktır ama her yuvarlak ceviz değildir... vector<vector<int>>a; int n; int m; vector<int>mn; int mnsz=1e9+5; void f(vector<int>suan,int i,vector<bool>b) { if(i+1>m)return; vector<int>v=suan; vector<bool>c=b; int sz=a[i].size(); if(count(b.begin(),b.end(),0)==0){ if(suan.size()<=mnsz){ if((suan.size()<mnsz)||(suan.size()==mnsz&&suan<mn)){ mnsz=suan.size(); mn=suan; return; } } } for(int j=0;j<sz;j++) { if(b[a[i][j]]==0)b[a[i][j]]=1; else b[a[i][j]]=0; } v.push_back(i+1); if(v.size()<mnsz)f(v,i+1,b); f(suan,i+1,c); } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cin>>n>>m; vector<bool>bas(n,0); a.resize(m); for(int i=0;i<m;i++) { int k; cin>>k; a[i].resize(k); for(int j=0;j<k;j++) { cin>>a[i][j]; a[i][j]--; } } f({},0,bas); cout<<mnsz<<endl; for(int i=0;i<mnsz;i++){ cout<<mn[i]<<" "; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...