Submission #527257

#	Time	Username	Problem	Language	Result	Execution time	Memory
527257		ecxx	Pipes (CEOI15_pipes)	C++17	30 / 100	3544 ms	65540 KiB

pipes

#include <bits/stdc++.h>
using namespace std;
    
int N;
const int MAXN = 100005;
uint16_t depth[MAXN] = {(uint16_t)0};
uint16_t low[MAXN] = {(uint16_t)0};
vector<int> AL[MAXN];
void AP(int i, uint16_t d, int pa) {
    depth[i] = d; low[i] = d;
    uint16_t paedges = 0;
    for (int ch : AL[i]) {
        if (ch==pa) {
            paedges++;
            continue;
        }
        if (depth[ch] != UINT16_MAX) {
            low[i] = min(low[i], depth[ch]);
        } else {
            AP(ch, d+1, i);
            low[i] = min(low[i], low[ch]);
        }
    }
    if (pa==-1) return;
    if (low[i] > depth[pa] && paedges == 1) {
        cout << i+1 << " " << pa+1 << "\n";
    }
}
    
int main() {
    
    int N, M, a, b; cin >> N >> M;
    for (int i = 0; i < M; i++) {
        cin >> a >> b; a--;b--;
        AL[a].push_back(b); AL[b].push_back(a);
    }
    
    for (int i = 0; i < N; i++) {
        depth[i] = UINT16_MAX;
    }
    
    for (int i = 0; i < N; i++) {
        if (depth[i] == UINT16_MAX)  AP(i,(uint16_t)0,-1);
    }
    
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 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