Submission #54602026

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<vector>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>
#include<unordered_map>
#include<string>
#include<unordered_set>
#include<queue>
#include<stack>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long  ll;
typedef unsigned long long ull;
int main()
{
    int n,m;
    cin>>n>>m;
    vector<string> a(n);
    for(auto& i:a)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<vector>
#include<algorithm>
#include<vector>
#include<cmath>
#include<set>
#include<unordered_map>
#include<string>
#include<unordered_set>
#include<queue>
#include<stack>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long  ll;
typedef unsigned long long ull;
int main()
{
    int n,m;
    cin>>n>>m;
    vector<string> a(n);
    for(auto& i:a)
        cin>>i;
    int mi=n+1;
    vector<bool> v(m);
    for(int bit=1;bit<(1<<n);bit++)
    {
        bool flag=false;
        for(int d=0;d<m;d++)
            v[d]=false;
        for(int i=0;i<n;i++)
        {
            if(bit&(1<<i))
            {
                string str=a[i];
                for(int j=0;j<m;j++)
                {
                    if(str[j]=='o')
                        v[j]=true;
                }
                bool f=true;
                for(auto k:v)
                {
                    if(k==false)
                        f=false;
                }
                if(f==true)
                {
                    flag=true;
                    break;
                }
            }
        }
        if(flag==true)
        {
            int tem;
            tem= __builtin_popcount(bit);
            mi=min(tem,mi);
        }
    }
    cout<<mi<<endl;
    
    return 0;
}

Submission Info

Judge Result