oj.uz

답안 #613977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613977 2022-07-30T15:25:55 Z yuto1115 Newspapers (CEOI21_newspapers) C++17
100 / 100
 64 ms 4584 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);
            }
        }
    }
    vi rev = res;
    reverse(all(rev));
    res.insert(res.end(), all(rev));
    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
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 292 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 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 0 ms 212 KB Output is correct
55 Correct 0 ms 212 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 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 292 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 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 0 ms 212 KB Output is correct
55 Correct 0 ms 212 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 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 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 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 244 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 0 ms 212 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 340 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 336 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 1 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 1 ms 468 KB Output is correct
93 Correct 1 ms 468 KB Output is correct
94 Correct 1 ms 468 KB Output is correct
95 Correct 1 ms 468 KB Output is correct
96 Correct 2 ms 468 KB Output is correct
97 Correct 1 ms 468 KB Output is correct
98 Correct 1 ms 468 KB Output is correct
99 Correct 1 ms 468 KB Output is correct
100 Correct 1 ms 468 KB Output is correct
101 Correct 1 ms 468 KB Output is correct
102 Correct 1 ms 468 KB Output is correct
103 Correct 1 ms 468 KB Output is correct
104 Correct 1 ms 468 KB Output is correct
105 Correct 1 ms 388 KB Output is correct
106 Correct 1 ms 468 KB Output is correct
107 Correct 1 ms 412 KB Output is correct
108 Correct 1 ms 468 KB Output is correct
109 Correct 2 ms 468 KB Output is correct
110 Correct 1 ms 460 KB Output is correct
111 Correct 1 ms 468 KB Output is correct
112 Correct 1 ms 468 KB Output is correct
113 Correct 2 ms 468 KB Output is correct
114 Correct 1 ms 468 KB Output is correct
115 Correct 1 ms 484 KB Output is correct
116 Correct 1 ms 468 KB Output is correct
117 Correct 1 ms 468 KB Output is correct
118 Correct 1 ms 464 KB Output is correct
119 Correct 1 ms 468 KB Output is correct
120 Correct 2 ms 468 KB Output is correct
121 Correct 1 ms 468 KB Output is correct
122 Correct 1 ms 468 KB Output is correct
123 Correct 1 ms 468 KB Output is correct
124 Correct 1 ms 468 KB Output is correct
125 Correct 1 ms 468 KB Output is correct
126 Correct 1 ms 468 KB Output is correct
127 Correct 1 ms 468 KB Output is correct
128 Correct 1 ms 468 KB Output is correct
129 Correct 1 ms 340 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 15 ms 1216 KB Output is correct
135 Correct 14 ms 1364 KB Output is correct
136 Correct 29 ms 3800 KB Output is correct
137 Correct 19 ms 2260 KB Output is correct
138 Correct 35 ms 2892 KB Output is correct
139 Correct 57 ms 4584 KB Output is correct
140 Correct 8 ms 980 KB Output is correct
141 Correct 4 ms 596 KB Output is correct
142 Correct 55 ms 4456 KB Output is correct
143 Correct 64 ms 4384 KB Output is correct
144 Correct 2 ms 468 KB Output is correct
145 Correct 2 ms 468 KB Output is correct