oj.uz

Submission #669602

# Submission time Handle Problem Language Result Execution time Memory
669602 2022-12-06T20:08:04 Z BlackC Pipes (CEOI15_pipes) C++17
70 / 100
 934 ms 17636 KB 
//
//  main.cpp
//  C
//
//  Created by Sajad Zare on 4/23/22.
//
 
 
#include <iostream>
#include <math.h>
#include <string>
#include <string.h>
#include <vector>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <deque>
#include <utility>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <numeric>
#include <iomanip>
#include <bitset>
using namespace std;
const int maxn=1e5+2;
int parent[maxn];
int parent2[maxn];
int sz[maxn];
int sz2[maxn];
bitset<maxn>seen;
int st[maxn];
//int parent3[maxnn];
int lowest[maxn];
int tmm=0;
vector<int> N[maxn];
vector<pair<int, int>>t1;
vector<pair<int, int>>t2;
//map<pair<int, int>, int>sss;
int x,y;
int get_root(int v){
    if (parent[v]!=v){
        parent[v]=get_root(parent[v]);
    }
    return parent[v];
}
int get_root2(int v){
    if (parent2[v]!=v){
        parent2[v]=get_root2(parent2[v]);
    }
    return parent2[v];
}
bool Union(int u,int v){
    u=get_root(u);
    v=get_root(v);
    if (u==v){
        return 1;
    }
    if (sz[v]<sz[u]){
        parent[v]=u;
        sz[u]+=sz[v];
    }
    else{
        parent[u]=v;
        sz[v]+=sz[u];
    }
    return 0;
}
bool Union2(int u,int v){
    x=u;
    y=v;
    u=get_root2(u);
    v=get_root2(v);
    if (u==v){
        return 0;
    }
    t2.push_back({x,y});
    if (sz2[v]<sz2[u]){
        parent2[v]=u;
        sz2[u]+=sz2[v];
    }
    else{
        parent2[u]=v;
        sz2[v]+=sz2[u];
    }
    return 1;
}
void dfs(int node,int pp){
    seen[node]=1;
    tmm+=1;
    st[node]=tmm;
    lowest[node]=tmm;
    //stft.push_back(node);
    for (int n: N[node]){
        if (seen[n]!=1){
            //parent3[n]=node;
            dfs(n,node);
            lowest[node]=min(lowest[node], lowest[n]);
            if (lowest[n]>st[node] && count(N[node].begin(),N[node].end(),n)==1){
                cout << node << ' ' << n << "\n";
            }
        }
        else if (n!=pp){
            lowest[node]=min(lowest[node],st[n]);
        }
    }
    //ft[node]=t;
    //stft.push_back(node);
}
//const int M = 1000000007;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m;
    cin >> n >> m;
    for (int i=1;i<n+1;i++){
        parent[i]=i;
        sz[i]=1;
    }
    for (int i=1;i<n+1;i++){
        parent2[i]=i;
        sz2[i]=1;
    }
    int u,v;
    for (int i=0;i<m;i++){
        cin >> u >> v;
        if (Union(u, v)){
            Union2(u, v);
        }
        else{
            t1.push_back({u,v});
        }
    }
    int f,ff;
    //int startnode=t1[0].first;
    for (int i=0;i<t1.size();i++){
        f=t1[i].first;
        ff=t1[i].second;
        N[f].push_back(ff);
        N[ff].push_back(f);
        //sss[{f,ff}]=1;
    }
    for (int i=0;i<t2.size();i++){
        f=t2[i].first;
        ff=t2[i].second;
        /*
        if (sss.find({f,ff})==sss.end()){
            sss[{f,ff}]=1;
            N[f].push_back(ff);
            N[ff].push_back(f);
        }
        else{
            sss[{f,ff}]=2;
        }
        */
        N[f].push_back(ff);
        N[ff].push_back(f);
    }
    //cout << startnode << endl;
    for (int i=1;i<n+1;i++){
        if (seen[i]!=1){
            dfs(i,-1);
        }
    }
    return 0;
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:138:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |     for (int i=0;i<t1.size();i++){
      |                  ~^~~~~~~~~~
pipes.cpp:145:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for (int i=0;i<t2.size();i++){
      |                  ~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3284 KB Output is correct
2 Correct 5 ms 3028 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 3224 KB Output is correct
2 Correct 77 ms 2964 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 4024 KB Output is correct
2 Correct 163 ms 3508 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 6220 KB Output is correct
2 Correct 187 ms 5836 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 13184 KB Output is correct
2 Correct 256 ms 9140 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 14668 KB Output is correct
2 Correct 427 ms 11288 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 620 ms 17636 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 756 ms 17552 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 934 ms 16872 KB Memory limit exceeded
2 Halted 0 ms 0 KB -