oj.uz

답안 #2699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
2699 2013-07-30T22:53:22 Z tncks0121 간선 파괴 (GA5_destroy) C++
100 / 100
 1368 ms 1880 KB 
#include <stdio.h>
#include <memory.h>
#include <algorithm>

using namespace std;

const int N_ = 1005;
const int M_ = 200005;

int N, M, Q;
short A[M_], B[M_];

short parent[N_];
short rank[N_];

void init() { for(int i = 1; i <= N; i++) parent[i] = i, rank[i] = 1; }

short get(short u) {
    int r = u;
    while(parent[r] != r) r = parent[r];
    while(u != r) {
        int p = parent[u];
        parent[u] = r;
        u = p;
    }
    return r;
}

bool merge (short a, short b) {
    a = get(a); b = get(b);
  if(rank[a] < rank[b]) {
    parent[a] = b;
  }else if(rank[a] > rank[b]) {
    parent[b] = a;
  }else {
    parent[b] = a;
    ++rank[a];
  }
    return a != b;
}

int R[N_*2], RN;

int main () {
    int i, j, k;

    scanf("%d%d", &N, &M);
    for(i = 1; i <= M; i++) scanf("%d%d", A+i, B+i);

    init();
    for(i = 1; i <= M; i++) if(merge(A[i], B[i])) R[++RN] = i;

    init();
    for(i = M; i > 0; i--) if(merge(A[i], B[i])) R[++RN] = i;

    scanf("%d", &Q);
    while(Q--) {
        int x, y, ret = N;
        scanf("%d%d", &x, &y);

        init();
        for(i = 1; i <= RN; i++) {
            if(R[i] < x || y < R[i]) if(merge(A[R[i]], B[R[i]])) --ret;
        }
        printf("%d\n", ret);
    }
    return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1880 KB Output is correct
2 Correct 0 ms 1880 KB Output is correct
3 Correct 0 ms 1880 KB Output is correct
4 Correct 0 ms 1880 KB Output is correct
5 Correct 0 ms 1880 KB Output is correct
6 Correct 0 ms 1880 KB Output is correct
7 Correct 0 ms 1880 KB Output is correct
8 Correct 0 ms 1880 KB Output is correct
9 Correct 0 ms 1880 KB Output is correct
10 Correct 0 ms 1880 KB Output is correct
11 Correct 0 ms 1880 KB Output is correct
12 Correct 0 ms 1880 KB Output is correct
13 Correct 0 ms 1880 KB Output is correct
14 Correct 0 ms 1880 KB Output is correct
15 Correct 0 ms 1880 KB Output is correct
16 Correct 0 ms 1880 KB Output is correct
17 Correct 0 ms 1880 KB Output is correct
18 Correct 0 ms 1880 KB Output is correct
19 Correct 0 ms 1880 KB Output is correct
20 Correct 0 ms 1880 KB Output is correct
21 Correct 0 ms 1880 KB Output is correct
22 Correct 0 ms 1880 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1880 KB Output is correct
2 Correct 32 ms 1880 KB Output is correct
3 Correct 32 ms 1880 KB Output is correct
4 Correct 36 ms 1880 KB Output is correct
5 Correct 40 ms 1880 KB Output is correct
6 Correct 320 ms 1880 KB Output is correct
7 Correct 328 ms 1880 KB Output is correct
8 Correct 312 ms 1880 KB Output is correct
9 Correct 32 ms 1880 KB Output is correct
10 Correct 32 ms 1880 KB Output is correct
11 Correct 32 ms 1880 KB Output is correct
12 Correct 40 ms 1880 KB Output is correct
13 Correct 40 ms 1880 KB Output is correct
14 Correct 44 ms 1880 KB Output is correct
15 Correct 32 ms 1880 KB Output is correct
16 Correct 32 ms 1880 KB Output is correct
17 Correct 24 ms 1880 KB Output is correct
18 Correct 20 ms 1880 KB Output is correct
19 Correct 12 ms 1880 KB Output is correct
20 Correct 8 ms 1880 KB Output is correct
21 Correct 0 ms 1880 KB Output is correct
22 Correct 0 ms 1880 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1336 ms 1880 KB Output is correct
2 Correct 1188 ms 1880 KB Output is correct
3 Correct 1268 ms 1880 KB Output is correct
4 Correct 1340 ms 1880 KB Output is correct
5 Correct 1272 ms 1880 KB Output is correct
6 Correct 1252 ms 1880 KB Output is correct
7 Correct 1196 ms 1880 KB Output is correct
8 Correct 1368 ms 1880 KB Output is correct
9 Correct 1180 ms 1880 KB Output is correct
10 Correct 1196 ms 1880 KB Output is correct
11 Correct 1168 ms 1880 KB Output is correct
12 Correct 1256 ms 1880 KB Output is correct
13 Correct 1204 ms 1880 KB Output is correct
14 Correct 1168 ms 1880 KB Output is correct
15 Correct 1168 ms 1880 KB Output is correct
16 Correct 1152 ms 1880 KB Output is correct
17 Correct 952 ms 1880 KB Output is correct
18 Correct 884 ms 1880 KB Output is correct
19 Correct 312 ms 1880 KB Output is correct
20 Correct 452 ms 1880 KB Output is correct
21 Correct 60 ms 1880 KB Output is correct
22 Correct 60 ms 1880 KB Output is correct