oj.uz

답안 #927861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927861 2024-02-15T12:13:51 Z 79brue Pipes (CEOI15_pipes) C++17
70 / 100
 5000 ms 14320 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int K = 17;

vector<int> link[100002];
int par[100002], LCADB[100002][K], sz[100002], depth[100002];
int val[100002];

inline int find(int x){
    if(x==par[x]) return x;
    return find(par[x]);
}

inline void sps_dfs(int x, int p){
    for(int i=1; i<K; i++) LCADB[x][i] = LCADB[LCADB[x][i-1]][i-1];
    for(int y: link[x]){
        if(p != y){
            par[y] = LCADB[y][0] = x;
            depth[y] = depth[x] + 1;
            sps_dfs(y, x);
        }
    }
}

inline bool merge(int x, int y){
    int rx = find(x), ry = find(y);
    if(rx==ry) return false;
    if(sz[rx] < sz[ry]) swap(rx, ry), swap(x, y);
    link[x].push_back(y), link[y].push_back(x);
    LCADB[y][0] = par[y] = x, sz[rx] += sz[ry];
    depth[y] = depth[x] + 1;
    sps_dfs(y, x);
    return true;
}

inline int getLCA(int x, int y){
    if(depth[x] > depth[y]) swap(x, y);
    for(int d=0; d<K; d++) if((depth[y]-depth[x])&(1<<d)) y = LCADB[y][d];
    if(x==y) return x;
    for(int d=K-1; d>=0; d--) if(LCADB[x][d] != LCADB[y][d]) x = LCADB[x][d], y = LCADB[y][d];
    return par[x];
}

int n, m;

inline void dfs(int x, int p=-1){
    for(int y: link[x]){
        if(y==p) continue;
        dfs(y, x);
        val[x] += val[y];
    }
}

int main(){
    scanf("%d %d", &n, &m);
    for(int i=1; i<=n; i++) par[i] = i, sz[i] = 1;
    while(m--){
        int x, y;
        scanf("%d %d", &x, &y);
        if(!merge(x, y)){
            val[x]++, val[y]++;
            val[getLCA(x, y)] -= 2;
        }
    }
    for(int i=1; i<=n; i++) if(par[i] == i) dfs(i);
    for(int i=1; i<=n; i++){
        if(par[i] != i && !val[i]) printf("%d %d\n", par[i], i);
    }
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Incorrect 1 ms 6492 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 6748 KB Output is correct
2 Correct 5 ms 6784 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 6748 KB Output is correct
2 Correct 209 ms 6820 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 523 ms 7000 KB Output is correct
2 Correct 494 ms 7036 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 863 ms 9588 KB Output is correct
2 Correct 746 ms 9044 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1974 ms 12660 KB Output is correct
2 Correct 1333 ms 12624 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3212 ms 13516 KB Output is correct
2 Correct 2374 ms 13496 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4637 ms 14164 KB Output is correct
2 Correct 3473 ms 14320 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5096 ms 13904 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5034 ms 14076 KB Time limit exceeded
2 Halted 0 ms 0 KB -