Submission #3410109


Source Code Expand

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)

// NextLine reads a line text from stdin, and then returns its string.
func NextLine() string {
	sc.Scan()
	return sc.Text()
}

// NextIntsLine reads a line text, that consists of **ONLY INTEGERS DELIMITED BY SPACES**, from stdin.
// And then returns intergers slice.
func NextIntsLine() []int {
	ints := []int{}
	intsStr := NextLine()
	tmp := strings.Split(intsStr, " ")
	for _, s := range tmp {
		integer, _ := strconv.Atoi(s)
		ints = append(ints, integer)
	}
	return ints
}

// NextRunesLine reads a line text, that consists of **ONLY CHARACTERS ARRANGED CONTINUOUSLY**, from stdin.
// Ant then returns runes slice.
func NextRunesLine() []rune {
	return []rune(NextLine())
}

var n, m int
var count int
var nodes []int
var U, V []int

func main() {
	tmp := NextIntsLine()
	n, m = tmp[0], tmp[1]
	for i := 0; i < n; i++ {
		nodes = append(nodes, 0)
	}
	for i := 0; i < m; i++ {
		tmp := NextIntsLine()
		U = append(U, tmp[0]-1)
		V = append(V, tmp[1]-1)
	}

	count = 0
	for i := 0; i < n; i++ {
		if nodes[i] == 0 {
			if dfs(i) {
				count++
			}
		}
	}
	fmt.Println(count)
}

func dfs(current int) bool {
	nodes[current] = 1
	retVal := true
	for i := 0; i < m; i++ {
		if U[i] == current {
			if nodes[V[i]] == 0 {
				retVal = dfs(V[i])
			} else {
				retVal = false
			}
		}
	}
	return retVal
}

Submission Info

Submission Time
Task B - バウムテスト
User maguroguma
Language Go (1.6)
Score 0
Code Size 1489 Byte
Status WA
Exec Time 4 ms
Memory 1280 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 18
WA × 16
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 640 KB
subtask0_sample_02.txt AC 1 ms 640 KB
subtask0_sample_03.txt AC 1 ms 640 KB
subtask1_01.txt WA 1 ms 640 KB
subtask1_02.txt AC 1 ms 640 KB
subtask1_03.txt AC 1 ms 640 KB
subtask1_04.txt AC 1 ms 640 KB
subtask1_05.txt AC 1 ms 640 KB
subtask1_06.txt AC 1 ms 640 KB
subtask1_07.txt WA 1 ms 640 KB
subtask1_08.txt WA 1 ms 640 KB
subtask1_09.txt AC 1 ms 640 KB
subtask1_10.txt WA 1 ms 640 KB
subtask1_11.txt AC 1 ms 640 KB
subtask1_12.txt AC 1 ms 640 KB
subtask1_13.txt WA 1 ms 640 KB
subtask1_14.txt WA 1 ms 640 KB
subtask1_15.txt WA 1 ms 640 KB
subtask1_16.txt AC 1 ms 640 KB
subtask1_17.txt WA 1 ms 640 KB
subtask1_18.txt WA 1 ms 640 KB
subtask1_19.txt WA 1 ms 640 KB
subtask1_20.txt WA 1 ms 640 KB
subtask1_21.txt AC 1 ms 640 KB
subtask1_22.txt WA 1 ms 640 KB
subtask1_23.txt AC 1 ms 640 KB
subtask1_24.txt WA 1 ms 640 KB
subtask1_25.txt AC 1 ms 640 KB
subtask1_26.txt WA 1 ms 640 KB
subtask1_27.txt WA 1 ms 640 KB
subtask1_28.txt WA 1 ms 640 KB
subtask1_29.txt AC 4 ms 1280 KB
subtask1_30.txt AC 4 ms 1280 KB
subtask1_31.txt AC 1 ms 640 KB