oj.uz

Submission #1035133

# Submission time Handle Problem Language Result Execution time Memory
1035133 2024-07-26T05:08:56 Z vjudge1 Pipes (CEOI15_pipes) C++14
40 / 100
 676 ms 65536 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; 
    int n , m;
    void dfs(int c, int depth, int par){
    	par1.par[c] = depth;
    	par2.par[c] = par1.par[c];
    	int op = par;
    	for (int i : adj[c]){
    		if (i == par){par = -1; continue;}
    		if (par1.par[i] != -1){ par2.par[c] = min( par2.par[c] ,par1.par[i]); continue;}
    		dfs(i,depth+1,c);
    		par2.par[c] = min(par2.par[c] , par2.par[i]);
    	}
    	if (par2.par[c]  >= depth && op != -1) cout << c << " " << op << '\n';
    }
     
    void solve() {
      
        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);
             //   cout << u << ' ' <<  v<< '\n';
            }
            else if(par2.union_set(u , v)){
                adj[u].push_back(v);
                adj[v].push_back(u);
              //  cout << u << ' '<< v << '\n';
            }
        }
        for(int  i = 1; i <= n ; i ++){
            par1.par[i] = par2.par[i] = -1;
        }
        for(int i = 1; i <= n ; i++){
            if(par1.par[i] == -1)dfs(i , 0 , -1);
        }
        
    }
     
    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 'int main()':
pipes.cpp:76:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |             freopen(_ "inp", "r", stdin);
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
pipes.cpp:77:20: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |             freopen(_ "out", "w", stdout);
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3164 KB Output is correct
2 Correct 3 ms 2908 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3156 KB Output is correct
2 Correct 57 ms 2908 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 3664 KB Output is correct
2 Correct 109 ms 3160 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 5200 KB Output is correct
2 Runtime error 140 ms 18512 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 10004 KB Output is correct
2 Runtime error 197 ms 24656 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 11160 KB Output is correct
2 Runtime error 341 ms 41552 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 13116 KB Output is correct
2 Runtime error 482 ms 49548 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 553 ms 13140 KB Output is correct
2 Runtime error 558 ms 61012 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 655 ms 15700 KB Output is correct
2 Runtime error 676 ms 65536 KB Memory limit exceeded
3 Halted 0 ms 0 KB -