Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <vector> using namespace std; const int maxn = 1e5 + 10; vector<int> graph[maxn]; int color[maxn]; bool dfs(int node) { color[node] = 1; for(int i = 0; i < (int) graph[node].size(); i++) { int neighbour = graph[node][i]; if(color[neighbour] == 1) { return true; } if(color[neighbour] == 0 and dfs(neighbour)) { return true; } } color[node] = 2; return false; } int main() { int n, m; cin >> n >> m; for(int i = 0; i < m; i++) { int a, b; cin >> a >> b; a--; b--; graph[a].push_back(b); } for(int i = 0; i < n; i++) { color[i] = 0; } for(int i = 0; i < n; i++) { if(color[i] == 0) { if(dfs(i)) { cout << "cycle" << endl; return 0; } } } cout << "no cycle" << endl; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
