Bus lines

//package kilo4;


import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;


/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */


/**
 *
 * @author asjuvone
 */
public class T3 {
    
    public static int n;
    public static int m;
    public static int k;
    public static Linja[] linjat;
    public static Linja[] poistot;
    public static int[] isa;
    public static int[] koko;
    public static int yhdistysCount;
    
    
    
    public static void main(String[] args) {
        IO io = new IO();
        
        n = io.nextInt();
        m = io.nextInt();
        k = io.nextInt();
        
        //HashMap<Linja, Integer> ekaEsiintyma = new HashMap<>();
        //HashMap<Linja, Integer> tuplat = new HashMap<>();
        
        linjat = new Linja[m+1];
        for (int i=1; i<=m; i++) {
            Linja uus = new Linja(io.nextInt(), io.nextInt());
            linjat[i] = (uus);
        }
        ArrayList<Linja> poistot = new ArrayList<>();
        for (int i=1; i<=k; i++) {
            int kek = io.nextInt();
            Linja poisto = linjat[kek];
            linjat[kek] = null;
            poistot.add(poisto);
        }
        
        yhdistysCount = 0;
        int[] vastaukset = new int[k+1];
        isa = new int[n+1];
        koko = new int[n+1];
        Arrays.fill(koko, 1);
        for (int i=1; i<=n; i++) isa[i] = i;
        
        for (int i=1; i<=m; i++) {
            if (linjat[i] == null) continue;
            yhdista(linjat[i]);
        }
        //System.out.println("Region count kaikkien rikkojen jälkeen: " + (n - yhdistysCount));
        for (int i=k; i>=1; i--) {
            //System.out.println("n: " + n + ", regincount: " + (n-yhdistysCount));
            vastaukset[i] = n - yhdistysCount;
            if (poistot.get(i-1).a > 0) yhdista(poistot.get(i-1));
        }
        //System.out.println(Arrays.toString(vastaukset));
        for (int i=1; i<=k; i++) {
            System.out.println(vastaukset[i]);
        }
        io.close();
    }
    
    public static void yhdista(Linja uus) {
        int a = uus.a;
        int b = uus.b;
        int rootA = isa[a];
        int rootB = isa[b];
        while (rootA != isa[a]) {
            rootA = isa[a];
        }
        while (rootB != isa[rootB]) rootB = isa[rootB];
        if (rootA == rootB) {
            
            return;
        }
        if (koko[rootA] > koko[rootB]) {
            isa[rootB] = rootA;
            koko[rootA] += koko[rootB];
        } else {
            isa[rootA] = rootB;
            koko[rootB] += koko[rootA];
        }
        yhdistysCount++;
    }
}

class Linja {
    public int a;
    public int b;

    public Linja(int a, int b) {
        this.a = a;
        this.b = b;
    }

    @Override
    public boolean equals(Object obj) {
        Linja toinen = (Linja) obj;
        if (toinen.a == this.b && toinen.b == this.a) return true;
        return toinen.a == this.a && toinen.b == this.b;
    }

    @Override
    public int hashCode() {
        return a + 36*b;
    }
    
    
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER