結果
問題 | No.2371 最大の試練それは起床 |
ユーザー |
|
提出日時 | 2023-07-07 21:26:29 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 52 ms / 2,000 ms |
コード長 | 8,710 bytes |
コンパイル時間 | 3,533 ms |
コンパイル使用メモリ | 93,280 KB |
実行使用メモリ | 37,128 KB |
最終ジャッジ日時 | 2024-07-21 17:07:16 |
合計ジャッジ時間 | 4,911 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
import java.util.*; import java.io.*; import java.math.*;class Main{static PrintWriter out = new PrintWriter(System.out);static In in = new In();static Out outer = new Out();static final int [] dx4 = {0,1,0,-1};static final int [] dy4 = {-1,0,1,0};static final int [] dx8 = {-1,-1,0,1,1,1,0,-1};static final int [] dy8 = {0,1,1,1,0,-1,-1,-1};static final long MOD7 = 1000000007;static final long MOD9 = 998244353 ;static final int inf = (1 << 30);static final long lnf = (1L << 60);final String yes = "Yes";final String no = "No" ;/** 考察メモ**/void solve() {int H = in.nextInt() , W = in.nextInt();if(H == 7) {if(30 <= W && W <= 59) {out.print("Late");}else{out.print(yes);}}else if(H == 8) {if(0 <= W && W < 30) {out.print("Late");}else{out.print(no);}}else if(H < 7) {out.print(yes);}else if(8 < H) {out.print(no);}}void yn(boolean ok) { out.println(ok ? yes : no ); }public static void main(String[] args) {new Main().solve();out.flush();}}/*▕▔▔▔▔▔▔▔▔▔▔▔╲▕╮╭┻┻╮╭┻┻╮╭▕╮╲▕╯┃╭╮┃┃╭╮┃╰▕╯╭▏▕╭┻┻┻┛┗┻┻┛ ╰▏ ▏▕╰━━━┓┈┈┈╭╮▕╭╮▏▕╭╮╰┳┳┳┳╯╰╯▕╰╯▏▕╰╯┈┗┛┗┛┈╭╮▕╮┈▏*/class Out{void print(int [] a) { System.out.println(Arrays.toString(a)) ; }void print(long [] a) { System.out.println(Arrays.toString(a)) ; }void print(String [] a) { System.out.println(Arrays.toString(a)) ; }void print(char [] a) { System.out.println(Arrays.toString(a)) ; }void print(double [] a) { System.out.println(Arrays.toString(a)) ; }void print(boolean[] a) { System.out.println(Arrays.toString(a)) ; }void print(int [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }void print(long [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }void print(String [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }void print(char [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }void print(double [][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }void print(boolean[][] a) { for(int i = 0 ; i < a.length ; i ++ ) System.out.println(Arrays.toString(a[i])) ; }void print(int begin , int end) { for(int i = begin ; i < end ; i ++ ) System.out.printf("%3d",i); }}class Pair implements Comparable<Pair>{private int first ;private int second;Pair(int first,int second) {this.first = first;this.second = second;}int first() {return this.first ;}int second() {return this.second;}@Overridepublic boolean equals(Object o) {if (!(o instanceof Pair)) {return false;}Pair that = (Pair)o;return first == that.first && second == that.second;}@Overridepublic int hashCode() {return Objects.hash(first, second);}@Overridepublic int compareTo(Pair o) {return first == o.first ? Integer.compare(second, o.second) : Integer.compare(first, o.first);}@Overridepublic String toString(){return first()+" "+second();}}class Triple {private int first;private int second;private int third;Triple(int first, int second, int third) {this.first = first;this.second = second;this.third = third;}int first() {return this.first;}int second() {return this.second;}int third() {return this.third;}@Overridepublic boolean equals(Object obj) {if (this == obj) {return true;}if (obj == null || getClass() != obj.getClass()) {return false;}Triple other = (Triple) obj;return this.first == other.first && this.second == other.second && this.third == other.third;}@Overridepublic int hashCode() {int result = 17;result = 31 * result + first;result = 31 * result + second;result = 31 * result + third;return result;}@Overridepublic String toString() {return this.first+" "+this.second+" "+this.third;}}class In{private final InputStream in = System.in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() {if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) {return 33 <= c && c <= 126;}public boolean hasNext() {while(hasNextByte() && !isPrintableChar(buffer[ptr])) {ptr++;}return hasNextByte();}String next() {if (!hasNext()) throw new NoSuchElementException();StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}long nextLong() {if (!hasNext()) throw new NoSuchElementException();long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();return (int) nl;}double nextDouble() {return Double.parseDouble(next());}char nextChar() {return next().charAt(0);}int [] IntArray(int n) {final int [] Array = new int [n];for(int i = 0 ; i < n ; i ++ ) {Array[i] = nextInt();}return Array;}int [][] IntArray(int n , int m) {final int [][] Array = new int [n][m];for(int i = 0 ; i < n ; i ++ ) {Array[i] = IntArray(m);}return Array;}long [] LongArray(int n) {final long [] Array = new long [n];for(int i = 0 ; i < n ; i ++ ) {Array[i] = nextLong();}return Array;}long [][] LongArray(int n , int m) {final long [][] Array = new long [n][m];for(int i = 0 ; i < n ; i ++ ) {Array[i] = LongArray(m);}return Array;}String [] StringArray(int n) {final String [] Array = new String [n];for(int i = 0 ; i < n ; i ++ ) {Array[i] = next();}return Array;}char [] CharArray(int n) {final char [] Array = new char[n];for(int i = 0 ; i < n ; i ++ ) {Array[i] = next().charAt(0);}return Array;}char [][] CharArray(int n , int m) {final char [][] Array = new char [n][m];for(int i = 0 ; i < n ; i ++ ) {Array[i] = next().toCharArray();}return Array;}char [][] CharArray2(int n , int m) {final char [][] Array = new char [n][m];for(int i = 0 ; i < n ; i ++ ) {for(int j = 0 ; j < n ; j ++ ) {Array[i][j] = next().charAt(0);}}return Array;}}