Submission #815810

#TimeUsernameProblemLanguageResultExecution timeMemory
815810OzyDuathlon (APIO18_duathlon)C++17
0 / 100
21 ms5680 KiB
#include <bits/stdc++.h> using namespace std; #define lli long long int #define debug(a) cout << #a << " = " << a << endl #define debugsl(a) cout << #a << " = " << a << ", " #define rep(i,a,b) for(int i = (a); i <= (b); i++) #define repa(i,a,b) for(int i = (a); i >= (b); i--) #define pll pair<lli,lli> #define MAX 100000 lli n,m,a,b,tam,res; vector<lli> hijos[MAX+2]; lli vis[MAX+2]; bool ciclo(lli pos, lli padre) { tam++; vis[pos]=1; for(auto h : hijos[pos]) { if (h == padre) continue; if (vis[h]) return true; return ciclo(h,pos); } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; rep(i,1,m) { cin >> a >> b; hijos[a].push_back(b); } rep(i,1,n) { if(vis[i]) continue; tam = 0; if (ciclo(i,0)) a = (tam*(tam-1)*(tam-2))/2; else a = (tam*(tam-1)*(tam-2))/3; res += a; } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...