oj.uz

답안 #613964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613964 2022-07-30T15:01:29 Z yuto1115 Newspapers (CEOI21_newspapers) C++17
50 / 100
 74 ms 8252 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};
    auto dfs = [&](auto &dfs, int u, int p) -> int {
        int mx = 0;
        for (int v: G[u]) {
            if (v == p) continue;
            chmax(mx, dfs(dfs, v, u));
        }
        return mx + 1;
    };
    rep(i, n) {
        int cnt = 0;
        for (int j: G[i]) {
            if (dfs(dfs, j, i) >= 3) ++cnt;
        }
        if (cnt >= 3) return {};
    }
    return {1};
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
7 Correct 0 ms 212 KB Output is correct
8 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
9 Correct 0 ms 212 KB Output is correct
10 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
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 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
19 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
21 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
22 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
24 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
25 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
26 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
27 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
28 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
29 Correct 0 ms 212 KB Output is correct
30 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
32 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
34 Correct 0 ms 212 KB Output is correct
35 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
38 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
39 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
40 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
41 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
42 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
44 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 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 1 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 0 ms 212 KB Output is correct

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
7 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
8 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
11 Partially correct 10 ms 340 KB Failed to provide a successful strategy.
12 Partially correct 3 ms 340 KB Failed to provide a successful strategy.
13 Partially correct 5 ms 328 KB Failed to provide a successful strategy.
14 Partially correct 5 ms 340 KB Failed to provide a successful strategy.
15 Partially correct 5 ms 340 KB Failed to provide a successful strategy.
16 Partially correct 12 ms 472 KB Failed to provide a successful strategy.
17 Partially correct 12 ms 476 KB Failed to provide a successful strategy.
18 Partially correct 11 ms 468 KB Failed to provide a successful strategy.
19 Partially correct 10 ms 468 KB Failed to provide a successful strategy.
20 Partially correct 12 ms 468 KB Failed to provide a successful strategy.

Subtask #3
40.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
6 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
7 Correct 0 ms 212 KB Output is correct
8 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
9 Correct 0 ms 212 KB Output is correct
10 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
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 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
19 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
21 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
22 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
24 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
25 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
26 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
27 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
28 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
29 Correct 0 ms 212 KB Output is correct
30 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
32 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
34 Correct 0 ms 212 KB Output is correct
35 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
38 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
39 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
40 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
41 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
42 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
44 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
55 Correct 0 ms 212 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 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 1 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 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
67 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
68 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
69 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
70 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
71 Correct 0 ms 212 KB Output is correct
72 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
73 Correct 0 ms 212 KB Output is correct
74 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
75 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
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 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
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 344 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 1 ms 336 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 344 KB Output is correct
89 Partially correct 18 ms 464 KB Failed to provide a successful strategy.
90 Partially correct 12 ms 340 KB Failed to provide a successful strategy.
91 Partially correct 14 ms 340 KB Failed to provide a successful strategy.
92 Partially correct 11 ms 336 KB Failed to provide a successful strategy.
93 Partially correct 16 ms 460 KB Failed to provide a successful strategy.
94 Partially correct 11 ms 340 KB Failed to provide a successful strategy.
95 Partially correct 17 ms 456 KB Failed to provide a successful strategy.
96 Partially correct 20 ms 340 KB Failed to provide a successful strategy.
97 Partially correct 11 ms 340 KB Failed to provide a successful strategy.
98 Partially correct 21 ms 340 KB Failed to provide a successful strategy.
99 Partially correct 12 ms 340 KB Failed to provide a successful strategy.
100 Partially correct 14 ms 340 KB Failed to provide a successful strategy.
101 Partially correct 13 ms 448 KB Failed to provide a successful strategy.
102 Partially correct 13 ms 444 KB Failed to provide a successful strategy.
103 Partially correct 14 ms 448 KB Failed to provide a successful strategy.
104 Partially correct 9 ms 340 KB Failed to provide a successful strategy.
105 Partially correct 10 ms 444 KB Failed to provide a successful strategy.
106 Partially correct 16 ms 340 KB Failed to provide a successful strategy.
107 Partially correct 14 ms 340 KB Failed to provide a successful strategy.
108 Partially correct 16 ms 460 KB Failed to provide a successful strategy.
109 Partially correct 13 ms 340 KB Failed to provide a successful strategy.
110 Partially correct 12 ms 340 KB Failed to provide a successful strategy.
111 Partially correct 11 ms 436 KB Failed to provide a successful strategy.
112 Partially correct 11 ms 340 KB Failed to provide a successful strategy.
113 Partially correct 17 ms 468 KB Failed to provide a successful strategy.
114 Partially correct 14 ms 340 KB Failed to provide a successful strategy.
115 Partially correct 11 ms 444 KB Failed to provide a successful strategy.
116 Partially correct 14 ms 444 KB Failed to provide a successful strategy.
117 Partially correct 17 ms 340 KB Failed to provide a successful strategy.
118 Partially correct 16 ms 452 KB Failed to provide a successful strategy.
119 Partially correct 12 ms 440 KB Failed to provide a successful strategy.
120 Partially correct 15 ms 340 KB Failed to provide a successful strategy.
121 Partially correct 15 ms 468 KB Failed to provide a successful strategy.
122 Partially correct 11 ms 344 KB Failed to provide a successful strategy.
123 Partially correct 10 ms 440 KB Failed to provide a successful strategy.
124 Partially correct 16 ms 340 KB Failed to provide a successful strategy.
125 Partially correct 9 ms 436 KB Failed to provide a successful strategy.
126 Partially correct 10 ms 340 KB Failed to provide a successful strategy.
127 Partially correct 10 ms 432 KB Failed to provide a successful strategy.
128 Partially correct 16 ms 464 KB Failed to provide a successful strategy.
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 2004 KB Output is correct
135 Correct 11 ms 2004 KB Output is correct
136 Correct 30 ms 5456 KB Output is correct
137 Correct 20 ms 3276 KB Output is correct
138 Correct 49 ms 4684 KB Output is correct
139 Correct 63 ms 7884 KB Output is correct
140 Correct 9 ms 1492 KB Output is correct
141 Correct 3 ms 724 KB Output is correct
142 Correct 55 ms 7508 KB Output is correct
143 Correct 74 ms 8252 KB Output is correct
144 Partially correct 10 ms 468 KB Failed to provide a successful strategy.
145 Partially correct 11 ms 480 KB Failed to provide a successful strategy.