Submission #1697732
Source Code Expand
package main import ( "bufio" "fmt" "log" "os" "strconv" ) // const abcd = "abcdefghijklnmopqrstuvwxyz" // const ABCD = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" // var dy = [...]int{1, 1, 0, -1, -1, -1, 0, 1} // var dx = [...]int{0, 1, 1, 1, 0, -1, -1, -1} // var dx = [...]int{0, 1, 0, -1} // var dy = [...]int{1, 0, -1, 0} var inf int = 1e13 var mod = 1000000007 // --------------------------------------------------------- func main() { log.SetFlags(log.Lshortfile) next := newScanner() h := next.Int() w := next.Int() a := make([]string, h) for i := 0; i < h; i++ { a[i] = next.next() } red := make([][]int, h) for i := 0; i < h; i++ { red[i] = make([]int, w) } blue := make([][]int, h) for i := 0; i < h; i++ { blue[i] = make([]int, w) } for i := 0; i < h; i++ { for j := 0; j < w; j++ { if (i%2 == 0 && j != w-1) || j == 0 { red[i][j] = 1 } else { blue[i][j] = 1 } if a[i][j] == '#' { red[i][j] = 1 blue[i][j] = 1 } } } for i := 0; i < h; i++ { for j := 0; j < w; j++ { if red[i][j] == 1 { fmt.Print("#") } else { fmt.Print(".") } } fmt.Println("") } fmt.Println() for i := 0; i < h; i++ { for j := 0; j < w; j++ { if blue[i][j] == 1 { fmt.Print("#") } else { fmt.Print(".") } } fmt.Println("") } } // --------------------------------------------------------- // Pair is liked C++ pair type Pair struct { a, b int } // Pairs is sorted by []Pair struct type Pairs []Pair func (p Pairs) Len() int { return len(p) } func (p Pairs) Swap(i, j int) { p[i], p[j] = p[j], p[i] } func (p Pairs) Less(i, j int) bool { if p[i].a < p[j].a { return true } else if p[i].a == p[j].a { return p[i].b < p[j].b } return false } // ------------------------------- func in(c, a, z int) bool { return c >= a && c < z } func btoi(b bool) int { if b { return 1 } return 0 } func itob(a int) bool { if a == 0 { return false } return true } func max(a ...int) int { r := a[0] for i := 0; i < len(a); i++ { if r < a[i] { r = a[i] } } return r } func sum(a ...int) int { r := a[0] if len(a) > 1 { for i := 1; i < len(a); i++ { r += a[i] } } return r } func min(a ...int) int { r := a[0] for i := 0; i < len(a); i++ { if r > a[i] { r = a[i] } } return r } func minmax(a, b int) (int, int) { if a > b { return b, a } return a, b } func abs(a int) int { if a < 0 { return -a } return a } // ---------- buffered scanner ----------------------------------------- type scanner struct { r *bufio.Reader buf []byte p int } func newScanner() *scanner { rdr := bufio.NewReaderSize(os.Stdin, 10000) 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) Line() string { s.pre() start := s.p s.p = len(s.buf) return string(s.buf[start:]) } func (s *scanner) Int() int { v, _ := strconv.Atoi(s.next()) return v } func (s *scanner) Int64() int64 { v, _ := strconv.ParseInt(s.next(), 10, 64) return v } 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 | C - AND Grid |
User | fmhr |
Language | Go (1.6) |
Score | 700 |
Code Size | 3634 Byte |
Status | AC |
Exec Time | 1071 ms |
Memory | 11008 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt |
All | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 640 KB |
0_01.txt | AC | 2 ms | 640 KB |
1_00.txt | AC | 1 ms | 640 KB |
1_01.txt | AC | 1055 ms | 11008 KB |
1_02.txt | AC | 1061 ms | 9728 KB |
1_03.txt | AC | 1049 ms | 9344 KB |
1_04.txt | AC | 1046 ms | 9344 KB |
1_05.txt | AC | 1058 ms | 10240 KB |
1_06.txt | AC | 1050 ms | 9344 KB |
1_07.txt | AC | 1048 ms | 9344 KB |
1_08.txt | AC | 1047 ms | 9508 KB |
1_09.txt | AC | 1056 ms | 9344 KB |
1_10.txt | AC | 1020 ms | 9088 KB |
1_11.txt | AC | 1043 ms | 9216 KB |
1_12.txt | AC | 1005 ms | 9088 KB |
1_13.txt | AC | 1041 ms | 9344 KB |
1_14.txt | AC | 1035 ms | 9212 KB |
1_15.txt | AC | 1062 ms | 9344 KB |
1_16.txt | AC | 1023 ms | 9216 KB |
1_17.txt | AC | 1054 ms | 9344 KB |
1_18.txt | AC | 1039 ms | 9216 KB |
1_19.txt | AC | 1053 ms | 9216 KB |
1_20.txt | AC | 1023 ms | 9216 KB |
1_21.txt | AC | 1045 ms | 9216 KB |
1_22.txt | AC | 1037 ms | 9344 KB |
1_23.txt | AC | 1035 ms | 9344 KB |
1_24.txt | AC | 1026 ms | 9216 KB |
1_25.txt | AC | 1041 ms | 9344 KB |
1_26.txt | AC | 1027 ms | 9216 KB |
1_27.txt | AC | 1010 ms | 9216 KB |
1_28.txt | AC | 1030 ms | 9216 KB |
1_29.txt | AC | 1042 ms | 9216 KB |
1_30.txt | AC | 1023 ms | 9216 KB |
1_31.txt | AC | 1011 ms | 9216 KB |
1_32.txt | AC | 1034 ms | 9344 KB |
1_33.txt | AC | 1054 ms | 9344 KB |
1_34.txt | AC | 1017 ms | 9216 KB |
1_35.txt | AC | 1037 ms | 9216 KB |
1_36.txt | AC | 1009 ms | 9216 KB |
1_37.txt | AC | 1049 ms | 9728 KB |
1_38.txt | AC | 1071 ms | 9344 KB |
1_39.txt | AC | 1059 ms | 9344 KB |
1_40.txt | AC | 1038 ms | 9344 KB |
1_41.txt | AC | 1052 ms | 9344 KB |
1_42.txt | AC | 1047 ms | 9728 KB |
1_43.txt | AC | 1059 ms | 9344 KB |
1_44.txt | AC | 1060 ms | 9216 KB |
1_45.txt | AC | 1056 ms | 9728 KB |
1_46.txt | AC | 1059 ms | 9344 KB |
1_47.txt | AC | 1049 ms | 9600 KB |
1_48.txt | AC | 1056 ms | 9344 KB |
1_49.txt | AC | 1033 ms | 9216 KB |
1_50.txt | AC | 1052 ms | 9344 KB |
1_51.txt | AC | 1035 ms | 9216 KB |
1_52.txt | AC | 1065 ms | 9216 KB |
1_53.txt | AC | 1053 ms | 9216 KB |
1_54.txt | AC | 1054 ms | 9216 KB |
1_55.txt | AC | 1038 ms | 9088 KB |
1_56.txt | AC | 1055 ms | 9344 KB |
1_57.txt | AC | 1055 ms | 9344 KB |
1_58.txt | AC | 1055 ms | 9216 KB |
1_59.txt | AC | 1065 ms | 9344 KB |
1_60.txt | AC | 1049 ms | 9344 KB |
1_61.txt | AC | 1050 ms | 10276 KB |
1_62.txt | AC | 1057 ms | 9600 KB |
1_63.txt | AC | 1014 ms | 9216 KB |