oj.uz

답안 #25728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
25728 2017-06-23T19:20:41 Z gs14004 Pipes (CEOI15_pipes) C++11
100 / 100
 477 ms 15656 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;
  
struct disj{
    int pa[100005];
    void init(int n){
        for(int i=0; i<=n; i++) pa[i] = i;
    }
    int find(int x){
        return pa[x] = (pa[x] == x ? x : find(pa[x]));
    }
    bool uni(int p, int q){
        p = find(p);
        q = find(q);
        if(p == q) return 0;
        pa[q] = p;
        find(q);
        return 1;
    }
}disj1, disj2;
  
int n, m;
vector<pi> tree, bri;
vector<int> graph[100005];
  
int par[100005][17], dep[100005];
bool vis[100005];
  
void dfs(int x, int pa){
    vis[x] = 1;
    par[x][0] = pa;
    for(int i=1; i<17; i++){
        par[x][i] = par[par[x][i-1]][i-1];
    }
    for (auto &i : graph[x]){
        if(i == pa) continue;
        dep[i] = dep[x] + 1;
        dfs(i,x);
    }
}
  
int lca(int x, int y){
    if(dep[x] < dep[y]) swap(x,y);
    int dx = dep[x] - dep[y];
    for(int i=0; i<17; i++){
        if((dx >> i) & 1) x = par[x][i];
    }
    for(int i=16; i>=0; i--){
        if(par[x][i] != par[y][i]){
            x = par[x][i];
            y = par[y][i];
        }
    }
    if(x != y) x = par[x][0];
    return x;
}
  
int up[100005];
  
void dfs2(int x, int pa){
    for (auto &i : graph[x]){
        if(i == pa) continue;
        dfs2(i,x);
        up[x] = max(up[x], up[i] - 1);
    }
    if(pa != 0 && up[x] == 0) printf("%d %d\n",pa,x);
}
int main(){
    scanf("%d %d\n",&n,&m);
    disj1.init(n);
    disj2.init(n);
    while(m--){
        int u = 0, v = 0;
        char str[15];
        fgets(str,15,stdin);
        int pos = 0;
        while(str[pos] != ' '){
            u = (10 * u) + (str[pos] - '0');
            pos++;
        }
        pos++;
        while(str[pos] != '\n' && str[pos]){
            v = (10 * v) + (str[pos] - '0');
            pos++;
        }
        if(disj1.uni(u,v)){
            tree.push_back(pi(u,v));
        }
        else if(disj2.uni(u,v)){
            bri.push_back(pi(u,v));
        }
    }
    for(auto &i : tree){
        graph[i.first].push_back(i.second);
        graph[i.second].push_back(i.first);
    }
  	auto cmp = [&](const pi &a, const pi &b){
      	return disj1.find(a.first) < disj1.find(b.first);
    };
  	sort(bri.begin(), bri.end(), cmp);
    for(int i=1; i<=n; i++){
        if(!vis[i]){
            int pos = disj1.find(i);
            dfs(pos,0);
          	int p = lower_bound(bri.begin(), bri.end(), pi(pos, -1), cmp) - bri.begin();
          	while(p < bri.size() && disj1.find(bri[p].first) == pos){
             	pi i = bri[p++];
                int l = lca(i.first,i.second);
                up[i.first] = max(up[i.first],dep[i.first] - dep[l]);
                up[i.second] = max(up[i.second],dep[i.second] - dep[l]);
            }
            dfs2(pos,0);
        }
    }
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:109:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
            while(p < bri.size() && disj1.find(bri[p].first) == pos){
                  ~~^~~~~~~~~~~~
pipes.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d\n",&n,&m);
     ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:78:14: warning: ignoring return value of 'char* fgets(char*, int, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         fgets(str,15,stdin);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3328 KB Output is correct
2 Correct 7 ms 3200 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 3120 KB Output is correct
2 Correct 35 ms 3064 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 3960 KB Output is correct
2 Correct 62 ms 3968 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 5696 KB Output is correct
2 Correct 106 ms 6388 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 11920 KB Output is correct
2 Correct 191 ms 11780 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 289 ms 13172 KB Output is correct
2 Correct 266 ms 12788 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 15532 KB Output is correct
2 Correct 369 ms 15552 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 432 ms 15656 KB Output is correct
2 Correct 458 ms 15644 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 472 ms 14972 KB Output is correct
2 Correct 477 ms 15332 KB Output is correct