Submission #689918

#TimeUsernameProblemLanguageResultExecution timeMemory
689918divadNorela (info1cup18_norela)C++14
75 / 100
1055 ms320 KiB
#include <bits/stdc++.h> #define int long long #define NMAX 62 #define MMAX 26 using namespace std; int n,m,q,x,ans; bitset<NMAX> b[MMAX]; vector<int> sol; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; ans = -1; for(int i = 1; i <= m; i++){ cin >> q; for(int j = 1; j <= q; j++){ cin >> x; b[i][x] = 1; } } for(int i = 0; i < (1<<m); i++){ bitset<NMAX> all; for(int j = 0; j < m; j++){ if(i&(1<<j)){ all ^= b[j+1]; } } if(all.count() == n){ if(ans == -1){ ans = i; for(int j = 0; j < m; j++){ if(i&(1<<j)){ sol.push_back(j+1); } } }else{ if(__builtin_popcount(ans) > __builtin_popcount(i)){ sol.clear(); for(int j = 0; j < m; j++){ if(i&(1<<j)){ sol.push_back(j+1); } } ans = i; }else if(__builtin_popcount(ans) == __builtin_popcount(i)){ vector<int> aux; int ok = -1; for(int j = 0; j < m; j++){ if(i&(1<<j)){ aux.push_back(j+1); int pos = aux.size()-1; if(ok == -1){ if(aux[pos] > sol[pos]){ ok = 0; }else if(aux[pos] < sol[pos]){ ok = 1; } } } } if(ok){ sol.clear(); for(auto it: aux){ sol.push_back(it); } ans = i; } } } } } cout << __builtin_popcount(ans) << "\n"; for(auto it: sol){ cout << it << " "; } return 0; }

Compilation message (stderr)

norela.cpp: In function 'int main()':
norela.cpp:30:24: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   30 |         if(all.count() == n){
      |            ~~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...