제출 #1324360

#제출 시각아이디문제언어결과실행 시간메모리
1324360sh_qaxxorov_571One-Way Streets (CEOI17_oneway)C++20
컴파일 에러
0 ms0 KiB
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

const int MAXN = 100005;
vector<pair<int, int>> adj[MAXN];
int tin[MAXN], low[MAXN], timer;
bool is_bridge[MAXN];
int up[MAXN][20], depth[MAXN];
int comp[MAXN], comp_cnt;
int d_up[MAXN], d_down[MAXN]; // Difference arrays

// Ko'priklarni topish (Tarjan algoritmi)
void find_bridges(int u, int p_edge = -1) {
    tin[u] = low[u] = ++timer;
    for (auto& edge : adj[u]) {
        int v = edge.first;
        int id = edge.second;
        if (id == p_edge) continue;
        if (tin[v]) {
            low[u] = min(low[u], tin[v]);
        } else {
            find_bridges(v, id);
            low[u] = min(low[u], low[v]);
            if (low[v] > tin[u]) is_bridge[id] = true;
        }
    }
}

// LCA va daraxt bo'yicha yo'nalishlarni yig'ish (bu yerda kod davom etadi...)
// ...

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

/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/13/../../../x86_64-linux-gnu/crt1.o: in function `_start':
(.text+0x1b): undefined reference to `main'
collect2: error: ld returned 1 exit status