답안 #331284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
331284	2020-11-28T00:33:34 Z	AnythingWithJ	A Huge Tower (CEOI10_tower)	Java 11	컴파일 오류	0 ms	0 KB

tower

import com.sun.source.tree.Tree;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Tower {
    static TreeSet<Integer> visited;
    static int MOD = 1000000009;
    static List<List<Integer>> graph;
    static int N, D;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer s = new StringTokenizer(br.readLine());
        N = Integer.parseInt(s.nextToken());
        D = Integer.parseInt(s.nextToken());
        int [] towers = new int[N+1];
        s = new StringTokenizer(br.readLine());
        for (int i = 1; i <= N; i++) {
            towers[i] = Integer.parseInt(s.nextToken());
        }
        graph = new ArrayList<>();
        for (int i = 0; i <= N; i++) {
            graph.add(new ArrayList<>());
        }
        for (int i = 1; i <= N; i++) {
            for (int j = 1; j <= N; j++) {
                if (j==i) continue;
                if (towers[i] <= towers[j]+D) {
                    graph.get(i).add(j);
                }
            }
        }
        visited = new TreeSet<>();
        long res = 0;
        for (int i = 1; i <= N; i++) {
            visited.clear();
            res += dfs (i);
            res %= MOD;
        }
        System.out.println(res);
    }
    static long dfs (int currNode) {
        if (visited.contains(currNode)) return 0;
        visited.add(currNode);
        //System.out.println(currNode+" start");
        //System.out.println(visited);
        if (visited.size() == N) {
            visited.remove(currNode);
            return 1;
        }
        long currRes = 0;
        for (int adj : graph.get(currNode)) {
            if (!visited.contains(adj)) currRes += dfs(adj);
            currRes %= MOD;
        }
        visited.remove(currNode);
        //System.out.println(currNode+" end");
        //System.out.println(visited);
        return currRes;
    }
}

Compilation message

tower.java:12: error: class Tower is public, should be declared in a file named Tower.java
public class Tower {
       ^
1 error