oj.uz

Submission #874943

# Submission time Handle Problem Language Result Execution time Memory
874943 2023-11-18T07:05:23 Z Bahamin Pipes (CEOI15_pipes) C++17
70 / 100
 805 ms 63824 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
    
#define ar array
#define ll long long
#define ld long double
#define sze(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
#define sui cout.tie(NULL); cin.tie(NULL); ios_base::sync_with_stdio(false)
#define mset(a, x) memset(a, x, sizeof(a))
typedef priority_queue <int, vector<int>, greater<int> > max_heap;
typedef priority_queue <int> min_heap;
const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
    
int par[2][MAX_N];
vector<pair<int, int>> adj[MAX_N];
    
int getpar(int u, int k)
{
    return (par[k][u] == u ? u : par[k][u] = getpar(par[k][u], k));
}
    
bool merge(int u, int v, int k)
{   
    u = getpar(u, k), v = getpar(v, k);
    if (u == v) return false;
    par[k][v] = u;
    return true;
}
    
int dp[MAX_N];
int he[MAX_N];
    
void dfs(int u, int h, int p, int p2)
{
    he[u] = h;
    dp[u] = INF;
    for (pair<int, int> v : adj[u])
    {
        if (v.second == p) continue;
        if (he[v.first] == -1) dfs(v.first, h + 1, v.second, u), dp[u] = min(dp[v.first], dp[u]);
        else dp[u] = min(dp[u], min(he[v.first], h));
    }
    if (dp[u] >= h && p2 != -1) cout << u << " " << p2 << endl;
}
    
void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        par[0][i] = par[1][i] = i;
        dp[i] = INF;
        he[i] = -1;
        adj[i].clear();
    }
    int cnt = 0;
    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        if (merge(a, b, 0)) cnt++, adj[a].push_back(make_pair(b, cnt)), adj[b].push_back(make_pair(a, cnt));
        else if (merge(a, b, 1)) cnt++, adj[a].push_back(make_pair(b, cnt)), adj[b].push_back(make_pair(a, cnt));
    }
    for (int i = 1; i <= n; i++)
    {
        if (he[i] == -1) dfs(i, 0, -1, -1);
    }
}
    
int main() {
    sui;
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        solve();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3928 KB Output is correct
2 Correct 4 ms 3676 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 3672 KB Output is correct
2 Correct 63 ms 3676 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 4436 KB Output is correct
2 Correct 126 ms 4176 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 6388 KB Output is correct
2 Correct 175 ms 5988 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 12352 KB Output is correct
2 Correct 239 ms 8848 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 13464 KB Output is correct
2 Correct 422 ms 9812 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 15840 KB Output is correct
2 Runtime error 492 ms 52500 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 637 ms 15968 KB Output is correct
2 Runtime error 617 ms 63824 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 750 ms 15360 KB Output is correct
2 Runtime error 805 ms 25752 KB Memory limit exceeded
3 Halted 0 ms 0 KB -