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> #include <algorithm> using namespace std; const int maxn = 1e5 + 10; vector<int> graph[maxn]; bool visited[maxn]; int size_of_island; void dfs(int node) { visited[node] = true; size_of_island++; for(int i = 0; i < (int) graph[node].size(); i++) { int neighbour = graph[node][i]; if(!visited[neighbour]) { dfs(neighbour); } } } int main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for(int i = 0; i < m; i++) { int a, b; cin >> a >> b; graph[a].push_back(b); graph[b].push_back(a); } for(int i = 0; i < n; i++) { visited[i] = false; } long long res = 0; for(int i = 0; i < n; i++) { if(!visited[i]) { size_of_island = 0; dfs(i); res += size_of_island * (n - size_of_island); } } cout << res / 2 << 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)
