제출 #948489

#제출 시각아이디문제언어결과실행 시간메모리
948489vjudge1Pipes (CEOI15_pipes)C++17
30 / 100
91 ms16352 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define ff first #define ss second #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define sz(v) (short)v.size() //const short INF = 1e18; //const short mod = 998244353; const short N = 5000; short n; vector<pair<short,int> > adj[N]; vector<bool> visited(N); vector<short> tin(N), low(N); short timer; void IS_BRIDGE(short u, short v){ cout << u + 1 << ' ' << v + 1 << '\n'; } void dfs(short v, int ind = -1) { visited[v] = true; tin[v] = low[v] = timer++; for (auto [to, nxt] : adj[v]) { if (nxt == ind) continue; if (visited[to]) { low[v] = min(low[v], tin[to]); } else { dfs(to, nxt); low[v] = min(low[v], low[to]); if (low[to] > tin[v]) IS_BRIDGE(v, to); } } } void find_bridges() { timer = 0; for (short i = 0; i < n; i++) { if (!visited[i]) dfs(i); } } void solve(){ cin >> n; int m; cin >> m; for(int i = 0; i < m; i++){ short u, v; cin >> u >> v; u--; v--; adj[u].pb({v, i}); adj[v].pb({u, i}); } find_bridges(); } main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); short tt = 1; //cin >> tt; while (tt--) { solve(); } }

컴파일 시 표준 에러 (stderr) 메시지

pipes.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){
      | ^~~~
#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...