oj.uz

답안 #603903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603903 2022-07-24T13:07:36 Z Theo830 Newspapers (CEOI21_newspapers) C++17
4 / 100
 16 ms 25052 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;
    if(n == 1){
        cout<<"YES\n";
        cout<<"1\n 1\n";
    }
    else if(n <= 3){
        cout<<"YES\n";
        cout<<"2\n2 2\n";
    }
    else if(m == n-1){
        cout<<"YES\n";
        vll ans;
        f(i,2,n){
            ans.pb(i);
        }
        f(i,2,n){
            ans.pb(i);
        }
        cout<<ans.size()<<"\n";
        for(auto x:ans){
            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
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24844 KB Output is correct
2 Correct 13 ms 24916 KB Output is correct
3 Correct 13 ms 24888 KB Output is correct
4 Partially correct 13 ms 24944 KB Failed to provide a successful strategy.
5 Partially correct 12 ms 24916 KB Failed to provide a successful strategy.
6 Partially correct 14 ms 24832 KB Failed to provide a successful strategy.
7 Incorrect 12 ms 24868 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 24948 KB Output is correct
2 Correct 12 ms 24884 KB Output is correct
3 Correct 11 ms 24916 KB Output is correct
4 Partially correct 16 ms 24968 KB Failed to provide a successful strategy.
5 Correct 12 ms 24864 KB Output is correct
6 Partially correct 12 ms 24884 KB Failed to provide a successful strategy.
7 Correct 12 ms 24916 KB Output is correct
8 Partially correct 12 ms 24896 KB Failed to provide a successful strategy.
9 Correct 12 ms 24916 KB Output is correct
10 Partially correct 13 ms 24916 KB Failed to provide a successful strategy.
11 Partially correct 13 ms 24936 KB Failed to provide a successful strategy.
12 Correct 13 ms 24916 KB Output is correct
13 Partially correct 14 ms 24948 KB Failed to provide a successful strategy.
14 Partially correct 13 ms 24976 KB Failed to provide a successful strategy.
15 Correct 13 ms 24916 KB Output is correct
16 Partially correct 12 ms 25044 KB Failed to provide a successful strategy.
17 Correct 13 ms 25044 KB Output is correct
18 Partially correct 12 ms 25052 KB Failed to provide a successful strategy.
19 Correct 13 ms 25044 KB Output is correct
20 Partially correct 13 ms 25044 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 24844 KB Output is correct
2 Correct 13 ms 24916 KB Output is correct
3 Correct 13 ms 24888 KB Output is correct
4 Partially correct 13 ms 24944 KB Failed to provide a successful strategy.
5 Partially correct 12 ms 24916 KB Failed to provide a successful strategy.
6 Partially correct 14 ms 24832 KB Failed to provide a successful strategy.
7 Incorrect 12 ms 24868 KB Output isn't correct
8 Halted 0 ms 0 KB -