Submission #603888

#TimeUsernameProblemLanguageResultExecution timeMemory
603888Theo830Newspapers (CEOI21_newspapers)C++17
9 / 100
40 ms50508 KiB
#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 (stderr)

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){
      |                    ~~~~~~~~~~~~~~~~~~~~^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...