#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n);
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
x -= 1, y -= 1;
adj[x].push_back(y);
adj[y].push_back(x);
}
auto bfs = [&](int source) {
vector<int> dist(n, -1), par(n, -1);
dist[source] = 0;
queue<int> q;
q.push(source);
while (!q.empty()) {
int v = q.front();
q.pop();
if (dist[v] > 3) {
break;
}
for (int to : adj[v]) {
if (to != par[v] && dist[to] < dist[v] + 1) {
dist[to] = dist[v] + 1;
q.push(to);
par[to] = v;
}
}
}
return dist;
};
auto tmp = bfs(0);
int d = max_element(tmp.begin(), tmp.end()) - tmp.begin();
auto dist = bfs(d);
// if (*max_element(dist.begin(), dist.end()) > 3) {
// cout << "NO\n";
// return 0;
// }
cout << "YES\n";
cout << "1\n1\n";
return 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 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
212 KB |
Failed to provide a successful strategy. |
8 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
9 |
Partially correct |
1 ms |
316 KB |
Failed to provide a successful strategy. |
10 |
Partially correct |
0 ms |
212 KB |
Failed to provide a successful strategy. |
11 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
12 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
13 |
Partially correct |
0 ms |
324 KB |
Failed to provide a successful strategy. |
14 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
15 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
16 |
Partially correct |
1 ms |
320 KB |
Failed to provide a successful strategy. |
17 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
18 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
19 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
20 |
Partially correct |
1 ms |
340 KB |
Failed to provide a successful strategy. |
# |
결과 |
실행 시간 |
메모리 |
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 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |