oj.uz

Submission #1026988

# Submission time Handle Problem Language Result Execution time Memory
1026988 2024-07-18T16:43:36 Z vjudge1 Pipes (CEOI15_pipes) C++17
0 / 100
 633 ms 7540 KB 
#include <bits/stdc++.h>

#define ll long long
using namespace std;
const int N = 1e5;
vector < int > adj[N + 2];
struct dsu{
    int par[N + 2];
    int find_par(const int &u){
        if(par[u] < 0)return u;
        par[u] = find_par(par[u]);
        return par[u];
    }
    bool union_set(int u , int v){
        u = find_par(u);
        v = find_par(v);
        if(u != v){
            if(par[u] > par[v])swap(u , v);
            par[u] += par[v];
            par[v] = u;
            return true;
        }
        return false;
    }

} par1 , par2;
int timer = 0;
void dfs(int &u , int &p){
    par1.par[u] = par2.par[u] = ++timer;
    for(int &v:adj[u]){
        if(v == p) continue;
        if(!par2.par[v]){
            dfs(v , u);
            par1.par[u] = min(par1.par[u] , par1.par[v]);
            if(par1.par[v] > par2.par[u]){
                cout << u << " " << v <<'\n';
            } 
        }
        else par1.par[u] = min(par1.par[u] , par2.par[v]);

    }
}
void solve() {
    int n , m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        par1.par[i] = par2.par[i] = -1;
    }
    for(int i = 1; i <= m ;i ++){
        int u , v;
        cin >> u >> v;
        if(par1.union_set(u , v)){
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
        else if(par2.union_set(u , v)){
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
    }
    for(int  i = 1; i <= n ; i ++){
        par1.par[i] = par1.par[i] = 0;
    }
    for(int i = 1; i <= n ; i++){
        if(!par2.par[i])dfs(i , i);
    }
    
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    
    #define _ "maxseq."
    if (fopen(_ "inp", "r")) {
        freopen(_ "inp", "r", stdin);
        freopen(_ "out", "w", stdout);
    }
    
    solve();
}

Compilation message

pipes.cpp: In function 'void solve()':
pipes.cpp:62:21: warning: operation on 'par1.dsu::par[i]' may be undefined [-Wsequence-point]
   62 |         par1.par[i] = par1.par[i] = 0;
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:75:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |         freopen(_ "inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
pipes.cpp:76:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |         freopen(_ "out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3420 KB Output is correct
2 Incorrect 54 ms 3416 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 3676 KB Output is correct
2 Incorrect 108 ms 3676 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 4440 KB Output is correct
2 Incorrect 126 ms 4272 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 6236 KB Output is correct
2 Incorrect 174 ms 6228 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 6608 KB Output is correct
2 Incorrect 308 ms 6052 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 7540 KB Output is correct
2 Incorrect 390 ms 7448 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 7504 KB Output is correct
2 Incorrect 485 ms 7508 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 633 ms 7248 KB Output is correct
2 Incorrect 559 ms 6736 KB Wrong number of edges
3 Halted 0 ms 0 KB -