#include <vector>
#include <iostream>
using namespace std;
int N,k;
vector<int> bad,ans;
bool rec(int node, int cur) {
if (cur == k) {
//a.push_back(node);
return true;
}
if (node < 1 || node > N) return false;
if (ans[cur] == node) return false;
if (rec(node-1, cur+1)) {
bad.push_back(node);
return true;
}
if (rec(node+1, cur+1)) {
bad.push_back(node);
return true;
}
return false;
}
bool ok = true;
void dfs(int par, int node, vector<int> &vis, vector<vector<int>> &adj) {
vis[node] = 1;
for (int u : adj[node]) {
if (u == par) continue;
if (vis[u] == 0) dfs(node, u, vis, adj);
if (vis[u] == 1) ok = false;
}
vis[node] = 2;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n,m,a,b; cin >> n >> m;
vector<vector<int>> adj(n);
while (m--) {
cin >> a >> b;
adj[--a].push_back(--b);
adj[b].push_back(a);
}
vector<int> vis(n);
dfs(0,0,vis, adj);
cout << (ok ? "YES\n1\n1" : "NO");
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
1 ms |
456 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 8 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 10 |
Partially correct |
1 ms |
456 KB |
Failed to provide a successful strategy. |
| 11 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 12 |
Partially correct |
0 ms |
344 KB |
Failed to provide a successful strategy. |
| 13 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 14 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 15 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 16 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 17 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 18 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 19 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 20 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 3 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 4 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 5 |
Partially correct |
0 ms |
348 KB |
Failed to provide a successful strategy. |
| 6 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Partially correct |
1 ms |
348 KB |
Failed to provide a successful strategy. |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
