結果
問題 | No.110 しましまピラミッド |
ユーザー | Tsukasa_Type |
提出日時 | 2018-03-11 14:20:46 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,308 bytes |
コンパイル時間 | 2,412 ms |
コンパイル使用メモリ | 78,340 KB |
実行使用メモリ | 50,276 KB |
最終ジャッジ日時 | 2024-10-15 00:16:07 |
合計ジャッジ時間 | 4,829 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 52 ms
36,824 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 51 ms
36,608 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 52 ms
36,640 KB |
testcase_20 | AC | 54 ms
36,748 KB |
testcase_21 | AC | 51 ms
36,512 KB |
testcase_22 | WA | - |
testcase_23 | AC | 52 ms
36,752 KB |
testcase_24 | AC | 58 ms
36,736 KB |
testcase_25 | AC | 52 ms
36,676 KB |
testcase_26 | AC | 54 ms
36,684 KB |
testcase_27 | AC | 51 ms
36,488 KB |
testcase_28 | AC | 52 ms
36,796 KB |
testcase_29 | WA | - |
ソースコード
import java.io.*; import java.util.*; import static java.lang.System.*; import java.math.*; public class Main { static FastScanner sc = new FastScanner(System.in); public static void main(String[] args) { int nw = sc.nextInt(); int[] white = new int[nw]; for (int i=0; i<nw; i++) {white[i] = sc.nextInt();} Arrays.sort(white); int nb = sc.nextInt(); int[] black = new int[nb]; for (int i=0; i<nb; i++) {black[i] = sc.nextInt();} Arrays.sort(black); int w_pos = nw-1; int b_pos = nb-1; int top = Integer.MAX_VALUE; int i; int w_base_num = 0; while (true) { if (w_pos < 0 || b_pos < 0) {break;} for (i=w_pos; i>=0; i--) { if (white[i] < top) { top = white[i]; w_base_num++; break; } } if (w_pos>=0) {w_pos = i-1;} if (w_pos < 0 || b_pos < 0) {break;} for (i=b_pos; i>=0; i--) { if (black[i] < top) { top = black[i]; w_base_num++; break; } } if (b_pos>=0) {b_pos = i-1;} } w_pos = nw-1; b_pos = nb-1; top = Integer.MAX_VALUE; int b_base_num = 0; while (true) { if (w_pos < 0 || b_pos < 0) {break;} for (i=b_pos; i>=0; i--) { if (black[i] < top) { top = black[i]; b_base_num++; break; } } if (b_pos>=0) {b_pos = i-1;} if (w_pos < 0 || b_pos < 0) {break;} for (i=w_pos; i>=0; i--) { if (white[i] < top) { top = white[i]; b_base_num++; break; } } if (w_pos>=0) {w_pos = i-1;} } out.println(Math.max(b_base_num,w_base_num)); } } class FastScanner implements Closeable { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) {this.in = in;} 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();} public 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(); } public 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(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} public void close() { try {in.close();} catch (IOException e) {} } }