oj.uz

Submission #603888

# Submission time Handle Problem Language Result Execution time Memory
603888 2022-07-24T13:02:09 Z Theo830 Newspapers (CEOI21_newspapers) C++17
9 / 100
 40 ms 50508 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
bool ok[1<<20] = {0};
vll res[1<<20];
bool v[1<<20] = {0};
vector<vll>adj;
bool solve(ll mask){
    if(ok[mask]){
        return 1;
    }
    if(v[mask]){
        return 0;
    }
    v[mask] = 1;
    ll siz = 500;
    f(j,0,20){
        if(mask & (1LL<<j)){
            ll num = mask ^ (1LL<<j);
            ll neo = 0;
            f(i,0,20){
                if(num & (1LL<<i)){
                    for(auto x:adj[i]){
                        neo |= (1<<x);
                    }
                }
            }
            ok[mask] |= solve(neo);
            if(solve(neo)){
                if(res[neo].size() + 1 < siz){
                    siz = res[neo].size() + 1;
                    res[mask] = res[neo];
                    res[mask].insert(res[mask].begin(),j+1);
                }
            }
        }
    }
    return ok[mask];
}
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,m;
    cin>>n>>m;
    adj.assign(n+5,vll());
    f(i,0,m){
        ll a,b;
        cin>>a>>b;
        a--;
        b--;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    ok[0] = 1;
    ll num = (1<<n) - 1;
    if(solve(num)){
        cout<<"YES\n";
        cout<<res[num].size()<<"\n";
        for(auto x:res[num]){
            cout<<x<<" ";
        }
    }
    else{
        cout<<"NO\n";
    }
}

Compilation message

newspapers.cpp: In function 'bool solve(ll)':
newspapers.cpp:51:40: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   51 |                 if(res[neo].size() + 1 < siz){
      |                    ~~~~~~~~~~~~~~~~~~~~^~~~~

Subtask #1
9.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24916 KB Output is correct
2 Correct 12 ms 24916 KB Output is correct
3 Correct 14 ms 24936 KB Output is correct
4 Correct 16 ms 24832 KB Output is correct
5 Correct 13 ms 24916 KB Output is correct
6 Correct 20 ms 24956 KB Output is correct
7 Correct 16 ms 24920 KB Output is correct
8 Correct 13 ms 24916 KB Output is correct
9 Correct 17 ms 24852 KB Output is correct
10 Correct 12 ms 24844 KB Output is correct
11 Correct 13 ms 24928 KB Output is correct
12 Correct 13 ms 24852 KB Output is correct
13 Correct 12 ms 24916 KB Output is correct
14 Correct 13 ms 24948 KB Output is correct
15 Correct 14 ms 24940 KB Output is correct
16 Correct 13 ms 24916 KB Output is correct
17 Correct 15 ms 24852 KB Output is correct
18 Correct 13 ms 24916 KB Output is correct
19 Correct 13 ms 24852 KB Output is correct
20 Correct 14 ms 24864 KB Output is correct
21 Correct 14 ms 24844 KB Output is correct
22 Correct 13 ms 24924 KB Output is correct
23 Correct 13 ms 24916 KB Output is correct
24 Correct 12 ms 24968 KB Output is correct
25 Correct 15 ms 24916 KB Output is correct
26 Correct 13 ms 24924 KB Output is correct
27 Correct 12 ms 24916 KB Output is correct
28 Correct 13 ms 24932 KB Output is correct
29 Correct 16 ms 24916 KB Output is correct
30 Correct 12 ms 24936 KB Output is correct
31 Correct 12 ms 24916 KB Output is correct
32 Correct 14 ms 24996 KB Output is correct
33 Correct 13 ms 25004 KB Output is correct
34 Correct 16 ms 24916 KB Output is correct
35 Correct 12 ms 24916 KB Output is correct
36 Correct 16 ms 24916 KB Output is correct
37 Correct 12 ms 24916 KB Output is correct
38 Correct 13 ms 25044 KB Output is correct
39 Correct 15 ms 25028 KB Output is correct
40 Correct 14 ms 24992 KB Output is correct
41 Correct 13 ms 25044 KB Output is correct
42 Correct 14 ms 25044 KB Output is correct
43 Correct 13 ms 25196 KB Output is correct
44 Partially correct 16 ms 25044 KB Provide a successful but not optimal strategy.
45 Correct 15 ms 25044 KB Output is correct
46 Correct 14 ms 25032 KB Output is correct
47 Correct 13 ms 25132 KB Output is correct
48 Correct 13 ms 25368 KB Output is correct
49 Correct 13 ms 25044 KB Output is correct
50 Correct 12 ms 25184 KB Output is correct
51 Correct 12 ms 25320 KB Output is correct
52 Correct 12 ms 25072 KB Output is correct
53 Correct 14 ms 25172 KB Output is correct
54 Correct 14 ms 25308 KB Output is correct
55 Correct 13 ms 25172 KB Output is correct
56 Correct 13 ms 25044 KB Output is correct
57 Correct 13 ms 25496 KB Output is correct
58 Correct 13 ms 25216 KB Output is correct
59 Correct 12 ms 24916 KB Output is correct
60 Correct 13 ms 24936 KB Output is correct
61 Correct 16 ms 24932 KB Output is correct
62 Correct 16 ms 24956 KB Output is correct
63 Correct 16 ms 24960 KB Output is correct
64 Correct 17 ms 25040 KB Output is correct

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 24916 KB Output is correct
2 Correct 13 ms 24916 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Correct 12 ms 24916 KB Output is correct
5 Correct 16 ms 24916 KB Output is correct
6 Correct 12 ms 24956 KB Output is correct
7 Correct 12 ms 24916 KB Output is correct
8 Correct 12 ms 24888 KB Output is correct
9 Correct 16 ms 24940 KB Output is correct
10 Partially correct 16 ms 24964 KB Provide a successful but not optimal strategy.
11 Runtime error 40 ms 50500 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24916 KB Output is correct
2 Correct 12 ms 24916 KB Output is correct
3 Correct 14 ms 24936 KB Output is correct
4 Correct 16 ms 24832 KB Output is correct
5 Correct 13 ms 24916 KB Output is correct
6 Correct 20 ms 24956 KB Output is correct
7 Correct 16 ms 24920 KB Output is correct
8 Correct 13 ms 24916 KB Output is correct
9 Correct 17 ms 24852 KB Output is correct
10 Correct 12 ms 24844 KB Output is correct
11 Correct 13 ms 24928 KB Output is correct
12 Correct 13 ms 24852 KB Output is correct
13 Correct 12 ms 24916 KB Output is correct
14 Correct 13 ms 24948 KB Output is correct
15 Correct 14 ms 24940 KB Output is correct
16 Correct 13 ms 24916 KB Output is correct
17 Correct 15 ms 24852 KB Output is correct
18 Correct 13 ms 24916 KB Output is correct
19 Correct 13 ms 24852 KB Output is correct
20 Correct 14 ms 24864 KB Output is correct
21 Correct 14 ms 24844 KB Output is correct
22 Correct 13 ms 24924 KB Output is correct
23 Correct 13 ms 24916 KB Output is correct
24 Correct 12 ms 24968 KB Output is correct
25 Correct 15 ms 24916 KB Output is correct
26 Correct 13 ms 24924 KB Output is correct
27 Correct 12 ms 24916 KB Output is correct
28 Correct 13 ms 24932 KB Output is correct
29 Correct 16 ms 24916 KB Output is correct
30 Correct 12 ms 24936 KB Output is correct
31 Correct 12 ms 24916 KB Output is correct
32 Correct 14 ms 24996 KB Output is correct
33 Correct 13 ms 25004 KB Output is correct
34 Correct 16 ms 24916 KB Output is correct
35 Correct 12 ms 24916 KB Output is correct
36 Correct 16 ms 24916 KB Output is correct
37 Correct 12 ms 24916 KB Output is correct
38 Correct 13 ms 25044 KB Output is correct
39 Correct 15 ms 25028 KB Output is correct
40 Correct 14 ms 24992 KB Output is correct
41 Correct 13 ms 25044 KB Output is correct
42 Correct 14 ms 25044 KB Output is correct
43 Correct 13 ms 25196 KB Output is correct
44 Partially correct 16 ms 25044 KB Provide a successful but not optimal strategy.
45 Correct 15 ms 25044 KB Output is correct
46 Correct 14 ms 25032 KB Output is correct
47 Correct 13 ms 25132 KB Output is correct
48 Correct 13 ms 25368 KB Output is correct
49 Correct 13 ms 25044 KB Output is correct
50 Correct 12 ms 25184 KB Output is correct
51 Correct 12 ms 25320 KB Output is correct
52 Correct 12 ms 25072 KB Output is correct
53 Correct 14 ms 25172 KB Output is correct
54 Correct 14 ms 25308 KB Output is correct
55 Correct 13 ms 25172 KB Output is correct
56 Correct 13 ms 25044 KB Output is correct
57 Correct 13 ms 25496 KB Output is correct
58 Correct 13 ms 25216 KB Output is correct
59 Correct 12 ms 24916 KB Output is correct
60 Correct 13 ms 24936 KB Output is correct
61 Correct 16 ms 24932 KB Output is correct
62 Correct 16 ms 24956 KB Output is correct
63 Correct 16 ms 24960 KB Output is correct
64 Correct 17 ms 25040 KB Output is correct
65 Correct 15 ms 24816 KB Output is correct
66 Correct 13 ms 24960 KB Output is correct
67 Correct 13 ms 24896 KB Output is correct
68 Correct 13 ms 24940 KB Output is correct
69 Correct 12 ms 24844 KB Output is correct
70 Correct 16 ms 24916 KB Output is correct
71 Correct 16 ms 24920 KB Output is correct
72 Correct 12 ms 24916 KB Output is correct
73 Correct 15 ms 24916 KB Output is correct
74 Correct 14 ms 24916 KB Output is correct
75 Correct 13 ms 24956 KB Output is correct
76 Correct 14 ms 24916 KB Output is correct
77 Correct 12 ms 24956 KB Output is correct
78 Correct 12 ms 24916 KB Output is correct
79 Runtime error 35 ms 50508 KB Execution killed with signal 11
80 Halted 0 ms 0 KB -