結果
問題 | No.653 E869120 and Lucky Numbers |
ユーザー | yuya178 |
提出日時 | 2018-02-23 23:07:34 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 67 ms / 2,000 ms |
コード長 | 5,117 bytes |
コンパイル時間 | 2,501 ms |
コンパイル使用メモリ | 81,420 KB |
実行使用メモリ | 50,364 KB |
最終ジャッジ日時 | 2024-09-13 18:15:40 |
合計ジャッジ時間 | 5,511 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
49,872 KB |
testcase_01 | AC | 55 ms
50,068 KB |
testcase_02 | AC | 55 ms
50,112 KB |
testcase_03 | AC | 55 ms
50,272 KB |
testcase_04 | AC | 54 ms
50,136 KB |
testcase_05 | AC | 55 ms
49,940 KB |
testcase_06 | AC | 55 ms
50,140 KB |
testcase_07 | AC | 53 ms
50,292 KB |
testcase_08 | AC | 57 ms
50,144 KB |
testcase_09 | AC | 54 ms
49,936 KB |
testcase_10 | AC | 54 ms
50,304 KB |
testcase_11 | AC | 53 ms
50,120 KB |
testcase_12 | AC | 53 ms
50,028 KB |
testcase_13 | AC | 53 ms
50,232 KB |
testcase_14 | AC | 53 ms
50,128 KB |
testcase_15 | AC | 53 ms
49,908 KB |
testcase_16 | AC | 53 ms
49,696 KB |
testcase_17 | AC | 52 ms
49,844 KB |
testcase_18 | AC | 54 ms
49,848 KB |
testcase_19 | AC | 53 ms
50,168 KB |
testcase_20 | AC | 52 ms
49,608 KB |
testcase_21 | AC | 51 ms
49,908 KB |
testcase_22 | AC | 52 ms
50,300 KB |
testcase_23 | AC | 53 ms
49,800 KB |
testcase_24 | AC | 53 ms
50,136 KB |
testcase_25 | AC | 54 ms
50,060 KB |
testcase_26 | AC | 53 ms
49,772 KB |
testcase_27 | AC | 53 ms
50,132 KB |
testcase_28 | AC | 67 ms
50,364 KB |
testcase_29 | AC | 67 ms
50,352 KB |
testcase_30 | AC | 65 ms
50,216 KB |
testcase_31 | AC | 53 ms
50,140 KB |
testcase_32 | AC | 53 ms
49,884 KB |
testcase_33 | AC | 53 ms
50,224 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main{ InputStream is; PrintWriter out; String INPUT = ""; int mod = 1_000_000_007; long inf = Long.MAX_VALUE/5; void solve(){ char[] c = ns().toCharArray(); int n = c.length; int[] num = new int[n]; for(int i = 0; i < n; i++){ num[i] = c[i] - '0'; } int res = 0; int[] d1 = new int[n]; int[] d2 = new int[n]; for(int i = n-1; i >= 0; i--){ res += num[i]; if(res==2){ d1[i] = 6; d2[i] = 6; res=-1; } else if(res==3){ d1[i] = 6; d2[i] = 7; res=-1; } else if(res==4){ d1[i] = 7; d2[i] = 7; res=-1; } else if(res==6){ d1[i] = 0; d2[i] = 6; res = 0; } else if(res==7){ d1[i] = 0; d2[i] = 7; res = 0; } else if(res==0){ d1[i] = 0; d2[i] = 0; res = 0; } else{ out.println("No"); return; } } if(res!=0){ out.println("No"); return; } boolean flag1 = true; boolean flag2 = true; for(int i = 0; i < n; i++){ if(d1[i]!=0){ flag1 = false; } if(d2[i]!=0){ flag2 = false; } if(d1[i]==0&&!flag1){ out.println("No"); return; } if(d2[i]==0&&!flag2){ out.println("No"); return; } } if(flag1||flag2){ out.println("No"); return; } out.println("Yes"); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }