oj.uz

Submission #613974

# Submission time Handle Problem Language Result Execution time Memory
613974 2022-07-30T15:20:51 Z yuto1115 Newspapers (CEOI21_newspapers) C++17
50 / 100
 72 ms 7316 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;
}

vi solve2(int n, vvi G) {
    if (n == 1) return {1};
    if (n == 2) return {1, 1};
    auto dfs = [&](auto &dfs, int u, int p) -> vi {
        vi res;
        for (int v: G[u]) {
            if (v == p) continue;
            vi now = dfs(dfs, v, u);
            if (SZ(now) > SZ(res)) res = now;
        }
        res.pb(u);
        return res;
    };
    int a = dfs(dfs, 0, -1)[0];
    vi dm = dfs(dfs, a, -1);
    vi res;
    rep2(i, 1, SZ(dm) - 1) {
        res.pb(dm[i] + 1);
        for (int j: G[dm[i]]) {
            if (j == dm[i - 1] or j == dm[i + 1]) continue;
            vi now = dfs(dfs, j, dm[i]);
            if (SZ(now) >= 3) return {};
            if (SZ(now) == 2) {
                res.pb(now.back() + 1);
                res.pb(dm[i] + 1);
            }
        }
    }
    res.insert(res.end(), all(res));
    return res;
}

vi solve(int n, vvi G) {
    if (n == 1) return {1};
    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) return {};
    vi ans;
    int now = 0;
    while (now < (1 << n) - 1) {
        ans.pb(pre[now].second + 1);
        now = pre[now].first;
    }
    reverse(all(ans));
    return ans;
}

random_device seed_gen;
mt19937 engine(seed_gen());

int rnd(int mn, int mx) {
    uniform_int_distribution<int> dist(mn, mx);
    return dist(engine);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
//    int n;
//    cin >> n;
//    rep(_, 10000) {
//        vvi G(n);
//        rep2(i, 1, n) {
//            int j = rnd(0, i - 1);
//            G[i].pb(j);
//            G[j].pb(i);
//        }
//        if (solve(n, G).empty() != solve2(n, G).empty()) {
//            cout << "#" << endl;
//            rep(i, n) {
//                for (int j: G[i]) {
//                    if (i < j) {
//                        cout << i << ' ' << j << endl;
//                    }
//                }
//            }
//        }
//    }
    int n, m;
    cin >> n >> m;
    vvi G(n);
    rep(i, m) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        G[u].pb(v);
        G[v].pb(u);
    }
    if (m > n - 1) {
        cout << "NO" << endl;
        return 0;
    }
    vi ans = solve2(n, G);
    if (ans.empty()) {
        cout << "NO" << endl;
        return 0;
    }
    cout << "YES" << endl;
    cout << SZ(ans) << endl;
    rep(i, SZ(ans)) cout << ans[i] << (i < SZ(ans) - 1 ? ' ' : '\n');
}

Subtask #1
6.0 / 12.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 328 KB Output is correct
4 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
5 Correct 1 ms 332 KB Output is correct
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Correct 0 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 Correct 1 ms 328 KB Output is correct
12 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
14 Correct 0 ms 212 KB Output is correct
15 Partially correct 1 ms 324 KB Failed to provide a successful strategy.
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
21 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
28 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
29 Correct 1 ms 328 KB Output is correct
30 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
31 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
32 Correct 1 ms 340 KB Output is correct
33 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
43 Correct 1 ms 340 KB Output is correct
44 Partially correct 1 ms 324 KB Failed to provide a successful strategy.
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 328 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
5 Correct 1 ms 212 KB Output is correct
6 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
7 Correct 1 ms 212 KB Output is correct
8 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
9 Correct 0 ms 212 KB Output is correct
10 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
11 Partially correct 2 ms 460 KB Failed to provide a successful strategy.
12 Correct 1 ms 468 KB Output is correct
13 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
15 Correct 1 ms 468 KB Output is correct
16 Partially correct 2 ms 468 KB Failed to provide a successful strategy.
17 Correct 2 ms 468 KB Output is correct
18 Partially correct 2 ms 468 KB Failed to provide a successful strategy.
19 Correct 2 ms 468 KB Output is correct
20 Partially correct 2 ms 468 KB Failed to provide a successful strategy.

Subtask #3
40.0 / 80.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 328 KB Output is correct
4 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
5 Correct 1 ms 332 KB Output is correct
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Correct 0 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 Correct 1 ms 328 KB Output is correct
12 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
14 Correct 0 ms 212 KB Output is correct
15 Partially correct 1 ms 324 KB Failed to provide a successful strategy.
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
21 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
28 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
29 Correct 1 ms 328 KB Output is correct
30 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
31 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
32 Correct 1 ms 340 KB Output is correct
33 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
43 Correct 1 ms 340 KB Output is correct
44 Partially correct 1 ms 324 KB Failed to provide a successful strategy.
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 328 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 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 332 KB Output is correct
68 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
69 Correct 1 ms 212 KB Output is correct
70 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
71 Correct 1 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 212 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
77 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
78 Correct 1 ms 332 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 1 ms 340 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 340 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 2 ms 468 KB Output is correct
90 Correct 1 ms 468 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 2 ms 468 KB Output is correct
93 Correct 1 ms 468 KB Output is correct
94 Correct 1 ms 460 KB Output is correct
95 Correct 2 ms 468 KB Output is correct
96 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
97 Correct 2 ms 460 KB Output is correct
98 Correct 1 ms 468 KB Output is correct
99 Correct 1 ms 468 KB Output is correct
100 Correct 2 ms 468 KB Output is correct
101 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
102 Correct 1 ms 468 KB Output is correct
103 Correct 1 ms 468 KB Output is correct
104 Partially correct 2 ms 468 KB Failed to provide a successful strategy.
105 Correct 2 ms 460 KB Output is correct
106 Correct 1 ms 468 KB Output is correct
107 Correct 1 ms 516 KB Output is correct
108 Correct 2 ms 464 KB Output is correct
109 Correct 2 ms 468 KB Output is correct
110 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
111 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
112 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
113 Correct 3 ms 468 KB Output is correct
114 Correct 1 ms 468 KB Output is correct
115 Correct 1 ms 468 KB Output is correct
116 Correct 1 ms 468 KB Output is correct
117 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
118 Correct 1 ms 468 KB Output is correct
119 Partially correct 2 ms 468 KB Failed to provide a successful strategy.
120 Partially correct 2 ms 468 KB Failed to provide a successful strategy.
121 Correct 1 ms 460 KB Output is correct
122 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
123 Correct 2 ms 468 KB Output is correct
124 Correct 1 ms 468 KB Output is correct
125 Correct 2 ms 468 KB Output is correct
126 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
127 Partially correct 1 ms 468 KB Failed to provide a successful strategy.
128 Correct 1 ms 464 KB Output is correct
129 Correct 1 ms 336 KB Output is correct
130 Correct 1 ms 340 KB Output is correct
131 Correct 1 ms 340 KB Output is correct
132 Correct 1 ms 340 KB Output is correct
133 Correct 1 ms 340 KB Output is correct
134 Correct 14 ms 2016 KB Output is correct
135 Correct 12 ms 1876 KB Output is correct
136 Correct 30 ms 5460 KB Output is correct
137 Correct 22 ms 3344 KB Output is correct
138 Correct 36 ms 4660 KB Output is correct
139 Correct 72 ms 7316 KB Output is correct
140 Correct 10 ms 1440 KB Output is correct
141 Correct 3 ms 724 KB Output is correct
142 Correct 58 ms 7116 KB Output is correct
143 Correct 69 ms 7176 KB Output is correct
144 Correct 1 ms 468 KB Output is correct
145 Partially correct 2 ms 468 KB Failed to provide a successful strategy.