結果

問題 No.110 しましまピラミッド
ユーザー yuya178
提出日時 2017-11-21 20:45:06
言語 Java
(openjdk 23)
結果
AC  
実行時間 56 ms / 5,000 ms
コード長 4,727 bytes
コンパイル時間 2,682 ms
コンパイル使用メモリ 86,932 KB
実行使用メモリ 50,628 KB
最終ジャッジ日時 2024-12-31 11:38:57
合計ジャッジ時間 5,650 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    void solve()
    {
        int nw  = ni();
        int[] w = new int[nw];
        for(int i = 0; i < nw; i++){
            w[i] = ni();
        }
        int nb  = ni();
        int[] b = new int[nb];
        for(int i = 0; i < nb; i++){
            b[i] = ni();
        }

        Arrays.sort(w);
        Arrays.sort(b);
        int sw = nw-1;
        int sb = nb-1;
        int res = 0;
        while(true){
            while(b[sb]>=w[sw] && sb>0) sb--;
            if(b[sb]<w[sw]) res++;
            else break;
            while(w[sw]>=b[sb] && sw>0) sw--;
            if(w[sw]<b[sb]) res++;
            else break;
            // out.println(sw+" "+sb);
            // if(sw==0&&sb==0) break;
        }
        sw = nw-1;
        sb = nb-1;
        int ans = 0;
        while(true){
            while(w[sw]>=b[sb] && sw>0) sw--;
            if(w[sw]<b[sb]) ans++;
            else break;
            while(b[sb]>=w[sw] && sb>0) sb--;
            if(b[sb]<w[sw]) ans++;
            else break;
            // out.println(sw+" "+sb);
            // if(sw==0&&sb==0) break;
        }
        out.println(Math.max(res,ans)+1);
    }
   
    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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0