Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <string>
- #include <vector>
- using namespace std;
- vector<vector<int>> graph;
- vector<int> color;
- vector<int> vertexes;
- void printCycle(int ver) {
- int counter = 0;
- for (int i = vertexes.size() - 1; i >= 0 && vertexes[i] != ver; i--) {
- counter++;
- }
- cout << counter + 1 << "\n";
- for (int i = vertexes.size() - 1; i >= 0 && vertexes[i] != ver; i--) {
- cout << vertexes[i] + 1 << " ";
- }
- cout << ver + 1 << "\n";
- exit(0);
- }
- void dfs(int v, int from) {
- color[v] = 1;
- vertexes.push_back(v);
- for (int i = 0; i < (int)graph[v].size(); i++) {
- int vertex = graph[v][i];
- if (color[vertex] == 0)
- dfs(vertex, v);
- if (color[vertex] == 1 && vertex != from) {
- cout << "YES\n";
- printCycle(vertex);
- }
- }
- vertexes.pop_back();
- color[v] = 2;
- }
- int main() {
- int n;
- cin >> n;
- graph.resize(n, vector<int>());
- color.resize(n);
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- int a;
- cin >> a;
- if (a == 1)
- graph[i].push_back(j);
- }
- }
- for (int i = 0; i < n; i++) {
- if (color[i] == 0)
- dfs(i, -1);
- }
- cout << "NO";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement