Submission #46370

#TimeUsernameProblemLanguageResultExecution timeMemory
46370sorry_BenqPipes (CEOI15_pipes)C++17
0 / 100
3482 ms5120 KiB
#include <bits/stdc++.h> using namespace std; int n; // number of nodes vector<vector<int>> adj; // adjacency list of graph vector<bool> visited; vector<int> tin, fup; int timer; void dfs(int v, int p = -1) { visited[v] = true; tin[v] = fup[v] = timer++; for (int to : adj[v]) { if (to == p) continue; if (visited[to]) { fup[v] = min(fup[v], tin[to]); } else { dfs(to, v); fup[v] = min(fup[v], fup[to]); if (fup[to] > tin[v]) cout << v + 1 << ' ' << to + 1 << endl; } } } void find_bridges() { timer = 0; visited.assign(n, false); tin.assign(n, -1); fup.assign(n, -1); for (int i = 0; i < n; ++i) { if (!visited[i]) dfs(i); } } int main(){ cin >> n; int M; cin >> M; adj.resize(n); for (int i = 0; i < M; i++){ int u, v; cin >> u >> v; } cout << 1/0 << endl; }

Compilation message (stderr)

pipes.cpp: In function 'int main()':
pipes.cpp:44:11: warning: division by zero [-Wdiv-by-zero]
  cout << 1/0 << endl;
          ~^~
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...