oj.uz

답안 #827501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
827501 2023-08-16T14:11:01 Z BERNARB01 Newspapers (CEOI21_newspapers) C++17
54 / 100
 3 ms 516 KB 
/**
 *    author:  BERNARD B.01
**/
#include <bits/stdc++.h>

using namespace std;

#ifdef B01
#include "deb.h"
#else
#define deb(...)
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  if (m != n - 1) {
    cout << "NO" << '\n';
    return 0;
  }
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  if (n == 1) {
    cout << "YES" << '\n';
    cout << 1 << '\n';
    cout << 1 << '\n';
    return 0;
  }
  if (n == 2) {
    cout << "YES" << '\n';
    cout << 2 << '\n';
    cout << 1 << '\n';
    cout << 1 << '\n';
    return 0;
  }
  int d = 0, to = 0;
  function<void(int, int, int)> Dfs = [&](int v, int pr, int dph) {
    if (dph >= d) {
      d = dph;
      to = v;
    }
    for (int u : g[v]) {
      if (u == pr) {
        continue;
      }
      Dfs(u, v, dph + 1);
    }
  };
  Dfs(0, -1, 0);
  int a = to;
  Dfs(to, -1, 0);
  int b = to;
  vector<int> que;
  vector<int> dist(n, -1);
  function<bool(int, int, int)> Mark = [&](int v, int pr, int tar) {
    if (v == tar) {
      que.push_back(v);
      dist[v] = 0;
      return true;
    }
    for (int u : g[v]) {
      if (u == pr) {
        continue;
      }
      if (Mark(u, v, tar)) {
        que.push_back(v);
        dist[v] = 0;
        return true;
      }
    }
    return false;
  };
  Mark(a, -1, b);
  for (int b = 0; b < (int) que.size(); b++) {
    for (int u : g[que[b]]) {
      if (dist[u] == -1) {
        dist[u] = dist[que[b]] + 1;
        que.push_back(u);
      }
    }
  }
  if (*max_element(dist.begin(), dist.end()) > 2) {
    cout << "NO" << '\n';
    return 0;
  }
  vector<int> z;
  function<void(int, int)> Dfs2 = [&](int v, int pr) {
    if (g[v].size() > 1) {
      z.push_back(v);
    }
    //bool bl = false;
    sort(g[v].begin(), g[v].end(), [&](int i, int j) {
      return dist[i] > dist[j];
    });
    bool bl = false;
    for (int u : g[v]) {
      if (u == pr) {
        continue;
      }
      Dfs2(u, v);
      if (g[v].size() > 1 && g[u].size() > 1) {
        z.push_back(v);
      } else if (g[v].size() > 1) {
        bl = true;
      }
    }
    if (bl) {
      z.push_back(v);
    }
  };
  Dfs2(a, -1);
  cout << "YES" << '\n';
  cout << (int) z.size() << '\n';
  for (int i = 0; i < (int) z.size(); i++) {
    if (i > 0) {
      cout << " ";
    }
    cout << z[i] + 1;
  }
  cout << '\n';
  return 0;
}

Subtask #1
6.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 Partially correct 0 ms 212 KB Provide a successful but not optimal 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 0 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 Correct 0 ms 212 KB Output is correct
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 0 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 1 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 0 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 1 ms 212 KB Failed to provide a successful strategy.
36 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
37 Partially correct 0 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 0 ms 212 KB Failed to provide a successful strategy.
44 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
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 Partially correct 0 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 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Partially correct 0 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 252 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 0 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 0 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 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 516 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #3
40.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 Partially correct 0 ms 212 KB Provide a successful but not optimal 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 0 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 Correct 0 ms 212 KB Output is correct
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 0 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 1 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 0 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 1 ms 212 KB Failed to provide a successful strategy.
36 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
37 Partially correct 0 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 0 ms 212 KB Failed to provide a successful strategy.
44 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
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 Partially correct 0 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 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Partially correct 0 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 252 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 0 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 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Partially correct 1 ms 272 KB Provide a successful but not optimal 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 0 ms 212 KB Failed to provide a successful strategy.
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 0 ms 352 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 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
90 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
91 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
92 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
93 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
94 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
95 Partially correct 1 ms 456 KB Failed to provide a successful strategy.
96 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
97 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
98 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
99 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
100 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
101 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
102 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
103 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
104 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
105 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
106 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
107 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
108 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
109 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
110 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
111 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
112 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
113 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
114 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
115 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
116 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
117 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
118 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
119 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
120 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
121 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
122 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
123 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
124 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
125 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
126 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
127 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
128 Partially correct 3 ms 340 KB Failed to provide a successful strategy.
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 0 ms 212 KB Output is correct
135 Correct 0 ms 212 KB Output is correct
136 Correct 0 ms 212 KB Output is correct
137 Correct 0 ms 212 KB Output is correct
138 Correct 0 ms 212 KB Output is correct
139 Correct 0 ms 212 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 0 ms 212 KB Output is correct
142 Correct 0 ms 212 KB Output is correct
143 Correct 0 ms 212 KB Output is correct
144 Correct 1 ms 468 KB Output is correct
145 Correct 1 ms 468 KB Output is correct