Submission #1279071
Source Code Expand
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func main() {
sc := NewScanner()
N, M := sc.NextInt(), sc.NextInt()
matrix := make([][]bool, N)
for i := 0; i < N; i++ {
matrix[i] = make([]bool, N)
}
for i := 0; i < M; i++ {
A, B := sc.NextInt(), sc.NextInt()
A--
B--
matrix[A][B] = true
matrix[B][A] = true
}
for i := 0; i < N; i++ {
count := 0
for j := 0; j < N; j++ {
if matrix[i][j] {
count++
}
}
fmt.Println(count)
}
}
type Scanner struct {
r *bufio.Reader
buf []byte
p int
}
func NewScanner() *Scanner {
rdr := bufio.NewReaderSize(os.Stdin, 1000)
return &Scanner{r: rdr}
}
func (s *Scanner) Next() string {
s.pre()
start := s.p
for ; s.p < len(s.buf); s.p++ {
if s.buf[s.p] == ' ' {
break
}
}
result := string(s.buf[start:s.p])
s.p++
return result
}
func (s *Scanner) NextLine() string {
s.pre()
start := s.p
s.p = len(s.buf)
return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
v, _ := strconv.Atoi(s.Next())
return v
}
func (s *Scanner) NextInt64() int64 {
v, _ := strconv.ParseInt(s.Next(), 10, 64)
return v
}
func (s *Scanner) NextIntArray() []int {
s.pre()
start := s.p
result := []int{}
for ; s.p < len(s.buf)+1; s.p++ {
if s.p == len(s.buf) || s.buf[s.p] == ' ' {
v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 0)
result = append(result, int(v))
start = s.p + 1
}
}
return result
}
func (s *Scanner) NextInt64Array() []int64 {
s.pre()
start := s.p
result := []int64{}
for ; s.p < len(s.buf)+1; s.p++ {
if s.p == len(s.buf) || s.buf[s.p] == ' ' {
v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 64)
result = append(result, v)
start = s.p + 1
}
}
return result
}
func (s *Scanner) NextMap() map[int]bool {
s.pre()
start := s.p
mp := map[int]bool{}
for ; s.p < len(s.buf); s.p++ {
if s.buf[s.p] == ' ' {
v, _ := strconv.Atoi(string(s.buf[start:s.p]))
mp[v] = true
start = s.p + 1
}
}
v, _ := strconv.Atoi(string(s.buf[start:s.p]))
mp[v] = true
return mp
}
func (s *Scanner) pre() {
if s.p >= len(s.buf) {
s.readLine()
s.p = 0
}
}
func (s *Scanner) readLine() {
s.buf = make([]byte, 0)
for {
l, p, e := s.r.ReadLine()
if e != nil {
panic(e)
}
s.buf = append(s.buf, l...)
if !p {
break
}
}
}
Submission Info
Submission Time |
|
Task |
B - Counting Roads |
User |
yuki2006 |
Language |
Go (1.6) |
Score |
0 |
Code Size |
2439 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
640 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
640 KB |
sample_02.txt |
WA |
1 ms |
640 KB |
sample_03.txt |
AC |
1 ms |
640 KB |
subtask_1_1.txt |
WA |
1 ms |
640 KB |
subtask_1_2.txt |
WA |
1 ms |
640 KB |
subtask_1_3.txt |
WA |
1 ms |
640 KB |
subtask_1_4.txt |
AC |
1 ms |
640 KB |
subtask_1_5.txt |
WA |
1 ms |
640 KB |
subtask_1_6.txt |
WA |
1 ms |
640 KB |
subtask_1_7.txt |
WA |
1 ms |
640 KB |