제출 #46371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46371		sorry_Benq	Pipes (CEOI15_pipes)	C++17	0 / 100	958 ms	5140 KiB

pipes

#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(){
    ios_base::sync_with_stdio(0); cin.tie(0);
	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;
}

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

pipes.cpp: In function 'int main()':
pipes.cpp:45:11: warning: division by zero [-Wdiv-by-zero]
  cout << 1/0 << endl;
          ~^~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10