Submission #528173

# Submission time Handle Problem Language Result Execution time Memory
528173 2022-02-19T15:16:51 Z Rafi22 Newspapers (CEOI21_newspapers) C++14
6 / 100
1000 ms 20352 KB
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

vector<int>G[1007];
vector<int>res;
bool ok;

void dfs(int v,int o)
{
    bool was=0;
    for(auto u:G[v])
    {
        if(u==o) continue;
        if(sz(G[u])>1)
        {
            if(!was) dfs(u,v);
            else ok=0;
            was=1;
        }
    }
}

map<int,int>odw;
int n;

void bt(int m)
{
    odw[m]=1;
    for(int j=0;j<n;j++)
    {
        if((m&(1<<j))) continue;
        m+=(1<<j);
        int nm=0;
        for(int i=1;i<=n;i++)
        {
            bool is=0;
            for(auto u:G[i])
            {
                if(!(m&(1<<(u-1)))) is=1;
            }
            if(!is) nm+=(1<<(i-1));
        }
        if(!odw[nm]) bt(nm);
        m-=(1<<j);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int m,a,b;
    cin>>n>>m;
    if(m!=n-1)
    {
        cout<<"NO";
        return 0;
    }
    for(int i=0;i<n-1;i++)
    {
        cin>>a>>b;
      //  a=i+2;
     //   b=rand()%(i+1)+1;
     //   cout<<a<<" "<<b<<endl;
        G[a].pb(b);
        G[b].pb(a);
    }
    vector<int>ans;
    bool is=0;
    for(int i=1;i<=n;i++)
    {
        ok=1;
        res.clear();
        dfs(i,0);
        if(ok)
        {
            is=1;
        }
    }
    /*if(!is) cout<<"NO"<<endl;
    else
    {
        cout<<"YES"<<endl;
        cout<<1<<endl<<1<<endl;
        //for(auto x:ans) cout<<1<<" ";
    }*/
    bt(0);
    if(odw[(1<<n)-1])
    {
        cout<<"YES"<<endl<<1<<endl<<1<<endl;
    }
    else cout<<"NO";

    return 0;
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:82:10: warning: variable 'is' set but not used [-Wunused-but-set-variable]
   82 |     bool is=0;
      |          ^~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
7 Correct 0 ms 332 KB Output is correct
8 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
9 Correct 0 ms 332 KB Output is correct
10 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 312 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
21 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
22 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 336 KB Failed to provide a successful strategy.
24 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
25 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
26 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
28 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
29 Correct 1 ms 332 KB Output is correct
30 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
31 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
32 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
33 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
34 Correct 1 ms 332 KB Output is correct
35 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
39 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
42 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
7 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
8 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
9 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
11 Execution timed out 1078 ms 880 KB Time limit exceeded
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
3 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 204 KB Failed to provide a successful strategy.
7 Correct 0 ms 332 KB Output is correct
8 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
9 Correct 0 ms 332 KB Output is correct
10 Partially correct 1 ms 204 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 312 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
21 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
22 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 336 KB Failed to provide a successful strategy.
24 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
25 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
26 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
28 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
29 Correct 1 ms 332 KB Output is correct
30 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
31 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
32 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
33 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
34 Correct 1 ms 332 KB Output is correct
35 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
39 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
42 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Partially correct 1 ms 336 KB Failed to provide a successful strategy.
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
67 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
68 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
69 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
70 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
71 Correct 1 ms 332 KB Output is correct
72 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
73 Correct 1 ms 336 KB Output is correct
74 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
75 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
76 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
77 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
78 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
79 Execution timed out 1086 ms 20352 KB Time limit exceeded
80 Halted 0 ms 0 KB -