oj.uz

Submission #868150

# Submission time Handle Problem Language Result Execution time Memory
868150 2023-10-30T13:46:07 Z Cookie Pipes (CEOI15_pipes) C++14
50 / 100
 763 ms 14460 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("HCN.INP");
ofstream fout("HCN.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
//using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 1e5 + 5, mxq = 2e5 + 5, sq = 200, mxv = 2e6 + 5;
const ll inf = 1e17 + 5;
//const int base= (1 << 18);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
struct DSU{
    int pa[mxn + 1];
    int fp(int u){
        if(pa[u] < 0)return(u);
        return(pa[u] = fp(pa[u]));
    }
    bool unon(int u, int v){
        u = fp(u); v = fp(v);
        if(u == v)return(0);
        if(abs(pa[u]) < abs(pa[v]))swap(u, v);
        pa[u] += pa[v]; pa[v] = u;
        return(1);
    }
    void init(){
        for(int i = 1; i <= n; i++)pa[i] = -1;
    }
};
DSU norma, cool;
vt<int>adj[mxn + 1];
int edge[2 * mxn + 1];
vt<pii>res;
int num[mxn + 1], low[mxn + 1], tt = 0;
bool used[mxn + 1];
void dfs(int s){
    num[s] = low[s] = ++tt;
    for(auto id: adj[s]){
        if(used[id])continue;
        used[id] = 1;
        int v = edge[id] ^ s;
        if(!num[v]){
            dfs(v);
            if(low[v] > num[s]){
                cout << s << " " << v << "\n";
            }
            low[s] = min(low[s], low[v]);
        }else{
            low[s] = min(low[s], num[v]);
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m;
    norma.init(); cool.init();
    int id = 0;
    for(int i = 0; i < m; i++){
        int u, v; cin >> u >> v;
        if(norma.unon(u, v)){
            id++;
            adj[u].pb(id); adj[v].pb(id);
            edge[id] = u ^ v;
        }else if(cool.unon(u, v)){
            id++;
            adj[u].pb(id); adj[v].pb(id);
            edge[id] = u ^ v;
        }
    }
    assert(id <= 2 * n);
    for(int i = 1; i <= n; i++){
        if(!num[i]){
            dfs(i);
        }
    }
    
   
    return(0);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4956 KB Output is correct
2 Correct 3 ms 4748 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 4724 KB Output is correct
2 Correct 66 ms 4716 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 5504 KB Output is correct
2 Correct 147 ms 4984 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 6896 KB Output is correct
2 Correct 204 ms 6636 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 240 ms 11600 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 380 ms 12504 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 489 ms 14448 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 684 ms 14460 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 763 ms 13940 KB Wrong number of edges
2 Halted 0 ms 0 KB -