oj.uz

Submission #613816

# Submission time Handle Problem Language Result Execution time Memory
613816 2022-07-30T11:28:49 Z yuto1115 Newspapers (CEOI21_newspapers) C++17
12 / 100
 8 ms 12648 KB 
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); ++i)
#define rrep(i, n) for(ll i = ll(n) - 1; i >= 0; --i)
#define rrep2(i, n, t) for(ll i = ll(n) - 1; i >= ll(t); --i)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define SZ(a) int(a.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    if (n == 1) {
        cout << "YES\n1\n1\n" << endl;
        return 0;
    }
    vvi G(n);
    rep(i, m) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        G[u].pb(v);
        G[v].pb(u);
    }
    assert(n <= 20);
    vi d(1 << n, inf);
    vp pre(1 << n);
    queue<int> q;
    d[(1 << n) - 1] = 0;
    q.push((1 << n) - 1);
    while (not q.empty()) {
        int now = q.front();
        q.pop();
        int nx = 0;
        rep(i, n) {
            for (int j: G[i]) {
                if (now >> j & 1) nx |= 1 << i;
            }
        }
        rep(i, n) {
            if (~nx >> i & 1) continue;
            nx -= 1 << i;
            if (chmin(d[nx], d[now] + 1)) {
                q.push(nx);
                pre[nx] = {now, i};
            }
            nx += 1 << i;
        }
    }
    if (d[0] == inf) {
        cout << "NO" << endl;
        return 0;
    }
    cout << "YES" << endl;
    vi ans;
    int now = 0;
    while (now < (1 << n) - 1) {
        ans.pb(pre[now].second + 1);
        now = pre[now].first;
    }
    reverse(all(ans));
    cout << SZ(ans) << endl;
    rep(i, SZ(ans)) cout << ans[i] << (i < SZ(ans) - 1 ? ' ' : '\n');
//    if (m > n - 1) {
//        cout << "NO" << endl;
//        return 0;
//    }
////    vb in(n);
////    rep(i, n) in[i] = SZ(G[i]) > 1;
////    rep(i, n) {
////        if (!in[i]) continue;
////        int cnt = 0;
////        for (int j: G[i]) if (in[j]) ++cnt;
////        if (cnt > 3) {
////            cout << "NO" << endl;
////            return 0;
////        }
////    }
//    cout << "YES" << endl;
//    cout << "1\n1\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 440 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 1 ms 660 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1108 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1876 KB Output is correct
44 Correct 1 ms 1876 KB Output is correct
45 Correct 2 ms 1860 KB Output is correct
46 Correct 1 ms 1876 KB Output is correct
47 Correct 3 ms 3412 KB Output is correct
48 Correct 3 ms 3412 KB Output is correct
49 Correct 2 ms 3412 KB Output is correct
50 Correct 2 ms 3396 KB Output is correct
51 Correct 4 ms 6484 KB Output is correct
52 Correct 4 ms 6488 KB Output is correct
53 Correct 3 ms 6468 KB Output is correct
54 Correct 3 ms 6484 KB Output is correct
55 Correct 6 ms 12608 KB Output is correct
56 Correct 7 ms 12628 KB Output is correct
57 Correct 8 ms 12608 KB Output is correct
58 Correct 6 ms 12628 KB Output is correct
59 Correct 8 ms 12648 KB Output is correct
60 Correct 7 ms 12608 KB Output is correct
61 Correct 6 ms 12628 KB Output is correct
62 Correct 6 ms 12564 KB Output is correct
63 Correct 6 ms 12612 KB Output is correct
64 Correct 6 ms 12628 KB Output is correct

Subtask #2
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Runtime error 2 ms 596 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 440 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 724 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 1 ms 660 KB Output is correct
39 Correct 1 ms 1108 KB Output is correct
40 Correct 1 ms 1108 KB Output is correct
41 Correct 1 ms 1108 KB Output is correct
42 Correct 1 ms 1108 KB Output is correct
43 Correct 1 ms 1876 KB Output is correct
44 Correct 1 ms 1876 KB Output is correct
45 Correct 2 ms 1860 KB Output is correct
46 Correct 1 ms 1876 KB Output is correct
47 Correct 3 ms 3412 KB Output is correct
48 Correct 3 ms 3412 KB Output is correct
49 Correct 2 ms 3412 KB Output is correct
50 Correct 2 ms 3396 KB Output is correct
51 Correct 4 ms 6484 KB Output is correct
52 Correct 4 ms 6488 KB Output is correct
53 Correct 3 ms 6468 KB Output is correct
54 Correct 3 ms 6484 KB Output is correct
55 Correct 6 ms 12608 KB Output is correct
56 Correct 7 ms 12628 KB Output is correct
57 Correct 8 ms 12608 KB Output is correct
58 Correct 6 ms 12628 KB Output is correct
59 Correct 8 ms 12648 KB Output is correct
60 Correct 7 ms 12608 KB Output is correct
61 Correct 6 ms 12628 KB Output is correct
62 Correct 6 ms 12564 KB Output is correct
63 Correct 6 ms 12612 KB Output is correct
64 Correct 6 ms 12628 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 0 ms 324 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 328 KB Output is correct
77 Correct 1 ms 324 KB Output is correct
78 Correct 1 ms 324 KB Output is correct
79 Runtime error 1 ms 584 KB Execution killed with signal 6
80 Halted 0 ms 0 KB -