oj.uz

Submission #94319

# Submission time Handle Problem Language Result Execution time Memory
94319 2019-01-17T17:28:04 Z theknife2001 Geppetto (COCI15_geppetto) C++17
80 / 80
 198 ms 444 KB 
#include <bits/stdc++.h>

using namespace std;
int n,m;
set < int > st[25];


int main()
{
    cin>>n>>m;
    int u,v;
    for(int i=0;i<m;i++)
    {
        cin>>u>>v;
        u--;
        v--;
        st[u].insert(v);
        st[v].insert(u);
    }
    int ans=0;
    bool q=0;
    for(int i=0;i<(1<<n);i++)
    {
        q=0;
        for(int j=0;j<n;j++)
        {
            if((1<<j)&i)
            {
                for(int k=j+1;k<n;k++)
                {
                    if((1<<k)&i)
                    {
                        if(st[j].find(k)!=st[j].end())
                        {
                            q=1;
                            break;
                        }
                    }
                }
                if(q)
                    break;
            }
        }
        if(!q)
            ans++;

    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 13 ms 376 KB Output is correct
4 Correct 17 ms 376 KB Output is correct
5 Correct 22 ms 376 KB Output is correct
6 Correct 38 ms 256 KB Output is correct
7 Correct 42 ms 444 KB Output is correct
8 Correct 66 ms 376 KB Output is correct
9 Correct 131 ms 376 KB Output is correct
10 Correct 198 ms 376 KB Output is correct