Ice cream

/*
 * 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.
 */

//package javaapplication8;

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

/**
 *
 * @author tuukkatu
 */
public class JavaApplication8 {

    public static int[] visited;
    public static ArrayList<ArrayList> graph;
    //public static IO io;
    public static int count;
    public static int[] id;
    public static ArrayList<HashSet> iceCreamsInComponent;
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        
        IO io = new IO();
	
	//String a = io.next(); // Lukee seuraavan välein erotellun merkkijonon.
	//int b = io.nextInt(); // Lukee seuraavan välein erotellun int-kokonaisluvun.
	//long c = io.nextLong(); // Lukee seuraavan välein erotellun long-kokonaisluvun.
	//double d = io.nextDouble(); // Lukee seuraavan välein erotellun double-liukuluvun.
	
	// Toimii kuten System.out.println.
        
        int n = io.nextInt();
        int m = io.nextInt();
        
        int i = 0;
        
        ArrayList<Integer> iceCreams = new ArrayList();
        iceCreamsInComponent = new ArrayList();
        graph = new ArrayList();
        
        
        for (int j = 0; j <= n; j++) {
            ArrayList<Integer> listToAdd = new ArrayList();
            HashSet<Integer> setToAdd = new HashSet();
            if (j > 0) iceCreams.add(io.nextInt());
            else iceCreams.add(0);
            
            graph.add(listToAdd);
            iceCreamsInComponent.add(setToAdd);
        }
        
        //while (true) {
        //    if (i == n + 1) {
        //        break;
        //    }
            
        //    iceCreams.add(io.nextInt());
            
        //    i++;
        //}
        
        /* for (int j = 1; j <= n; j++) {
            iceCreams.add(io.nextInt());
        } */
        
        i = 0;
        
        //System.out.println("mau");
        
        /*while (true) {
            if (i == m + 1) {
                break;
            }
            
            int a = io.nextInt();
            int b = io.nextInt();
            
            graph.get(a).add(b);
            graph.get(b).add(a);
            
            i++;
        }*/
        
        for (int j = 1; j <= m; j++) {
            
            int a = io.nextInt();
            int b = io.nextInt();
            
            graph.get(a).add(b);
            graph.get(b).add(a);
        }
            
        
        //for (ArrayList node : graph) {
        //    io.println(node);
        //}
        
        visited = new int[n + 1];
        id = new int[n + 1]; // id of component
        count = 1;
        
        for (int j = 1; j < graph.size(); j++) {
            if (visited[j] == 1) {
                continue;
            }
            
            dfs(j);
            count++;
        }
        
        //io.println("komponentit");
        //io.println(Arrays.toString(id));
        
        for (int j = 1; j <= n; j++) {
            int iceCream = iceCreams.get(j);
            
            int component = id[j];
            
            //io.println("component of " + j + " is " + component);
            
            iceCreamsInComponent.get(component).add(iceCream);
        }
                
        //io.println(iceCreamsInComponent);
        
        for (int j = 1; j <= n; j++) {
            // j = kaupunki
            
            int component = id[j];
            
            io.println(iceCreamsInComponent.get(component).size());
        }
        
        
        //for (ArrayList node : graph) {
        //    
        //}
        
        io.close(); // TÄYTYY KUTSUA LOPUKSI, muuten tuloste voi jäädä kirjoittamatta

    }
    
    private static void dfs(int s) {
        if (visited[s] == 1) {
            return;
        }
        
        visited[s] = 1;
        id[s] = count;
        
        for (int i = 0; i < graph.get(s).size(); i++) {
            int node = (int) graph.get(s).get(i);
            dfs(node);
        }
        
    }
    
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED