-
H - Grid 1 / atcoder.jpatcoder.jp 2020. 1. 1. 17:45728x90
H - Grid 1 / atcoder.jp
문제 링크 : https://atcoder.jp/contests/dp/tasks/dp_h
Submission : https://atcoder.jp/contests/dp/submissions/9270190
Java Source : https://github.com/skysign/WSAPT/blob/master/atcoder.jp/H%20-%20Grid%201/src/Main.java한번 풀어봤던 문제였기도 했지만, 한번에 풀었습니다.
System.in 에서 입력받는 양이 많아 질 수록, Scanner의 next???() 메서드에서 사용되는 시간이 많이 집니다. readByte()를 사용해서 최대한 System.in 에서 읽는대 걸리는 시간을 최대한 줄여야 합니다.
import java.io.DataInputStream; import java.io.FileInputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.Scanner; // H - Grid 1 / atcoder.jp // 문제 링크 : https://atcoder.jp/contests/dp/tasks/dp_h // Submission : https://atcoder.jp/contests/dp/submissions/9270190 public class Main { public static int H; public static int W; public static void main(String[] args) throws IOException { Reader sc = new Reader(); // Scanner sc = new Scanner(System.in); PrintWriter p = new PrintWriter(System.out); H = sc.nextInt(); W = sc.nextInt(); long[][] dp = new long[H+1][W+1]; boolean[][] map = new boolean[H+1][W+1]; for(int i=1; i<=H; ++i) { for(int j=1; j<=W; ++j) { byte c = sc.readByte(); map[i][j] = (c=='.')? true: false; } sc.readByte(); } dp[1][1] = 1; long modulo = (long)(Math.pow(10, 9))+7; for(int i=1; i<=H; ++i) { for(int j=1; j<=W; ++j) { dp[i][j] += (map[i-1][j])? dp[i-1][j]: 0; // dp[i][j] %= modulo; dp[i][j] += (map[i][j-1])? dp[i][j-1]: 0; dp[i][j] %= modulo; } } p.println(dp[H][W]); p.close(); } static class Reader { static private int BUFFER_SIZE = 1 << 16; static private DataInputStream din; static private byte[] buffer; static private int bufferPointer, bytesRead; public Reader() { din = new DataInputStream(System.in); buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; } public Reader(String file_name) throws IOException { din = new DataInputStream(new FileInputStream(file_name)); buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; } public String nextLine() throws IOException { byte[] buf = new byte[64]; // line length int cnt = 0, c; while ((c = readByte()) != -1) { if (c == '\n') break; buf[cnt++] = (byte) c; } return new String(buf, 0, cnt); } public int nextInt() throws IOException { int ret = 0; byte c = readByte(); while (c <= ' ') c = readByte(); boolean neg = (c == '-'); if (neg) c = readByte(); do { ret = ret * 10 + c - '0'; } while ((c = readByte()) >= '0' && c <= '9'); if (neg) return -ret; return ret; } public long nextLong() throws IOException { long ret = 0; byte c = readByte(); while (c <= ' ') c = readByte(); boolean neg = (c == '-'); if (neg) c = readByte(); do { ret = ret * 10 + c - '0'; } while ((c = readByte()) >= '0' && c <= '9'); if (neg) return -ret; return ret; } public double nextDouble() throws IOException { double ret = 0, div = 1; byte c = readByte(); while (c <= ' ') c = readByte(); boolean neg = (c == '-'); if (neg) c = readByte(); do { ret = ret * 10 + c - '0'; } while ((c = readByte()) >= '0' && c <= '9'); if (c == '.') { while ((c = readByte()) >= '0' && c <= '9') { ret += (c - '0') / (div *= 10); } } if (neg) return -ret; return ret; } static private void fillBuffer() throws IOException { bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); if (bytesRead == -1) buffer[0] = -1; } public static byte readByte() throws IOException { if (bufferPointer == bytesRead) fillBuffer(); return buffer[bufferPointer++]; } public void close() throws IOException { if (din == null) return; din.close(); } public static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } public static int skip() throws IOException{ int b; while((b = readByte()) != -1 && isSpaceChar(b)) ; return b; } } }
728x90'atcoder.jp' 카테고리의 다른 글
K - Stones / atcoder.jp (0) 2020.01.16 I - Coins / atcoder.jp (0) 2020.01.13 G - Longest Path / atcoder.jp (0) 2020.01.01 F - LCS / atcoder.jp (0) 2019.12.31 E - Knapsack 2 / atcoder.jp (0) 2019.12.29