제출 #1289718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289718		amodi	Norela (info1cup18_norela)	C++20	0 / 100	64 ms	572 KiB

norela

#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;
// vector<int>no={731231265,76543,8765432,987654,7654345,432345,345653,654323456,5432345,3456543,34565432,3456,12345,23456,12345,12345,2345,2345,23456,123456,23456,12345,12345,12345,1234,1234,1234,234,1234,22131231,33213123,2345,12345,123456};
 /*vector<int>*/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);
	 f(v,i+1,b);
	 if(suan.size()<mnsz)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);
   /*vector<vector<int>>mn;
   int sz=1e9;
   for(auto go:yes){
	   if(go.size()<=sz){
		   //for(int i=0;i<go.size();i++)cout<<go[i]<<" ";
		   //if(go.size()<sz)mn.clear();
		   sort(go.begin(),go.end());
		   mn.push_back(go);
		   int tsz=go.size();
		   sz=min(tsz,sz);
	   }
   }
  for(int i=0;i<mn.size();i++) {
	   for(int j=0;j<mn[i].size();j++)cout<<mn[i][j]<<" ";
	   cout<<endl;
   }
   sort(mn.begin(),mn.end());
   vector<int> mnn = {898989898,75842579};
   for(int i=0;i<mn.size();i++){
	   if(mn[i].size()==sz)mnn=min(mnn,mn[i]);
   }*/
   cout<<mnsz<<endl;
   for(int i=0;i<mnsz;i++){
	   cout<<mn[i]<<" ";
   }
   return 0;
  }

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