結果

問題 No.200 カードファイト！
ユーザー uwiuwi
提出日時 2015-04-29 05:42:20
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,925 bytes
コンパイル時間 3,658 ms
コンパイル使用メモリ 83,644 KB
実行使用メモリ 50,460 KB
最終ジャッジ日時 2024-07-05 16:39:31
合計ジャッジ時間 6,119 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 AC 53 ms
37,012 KB
testcase_03 AC 53 ms
37,140 KB
testcase_04 AC 53 ms
37,068 KB
testcase_05 AC 53 ms
37,172 KB
testcase_06 AC 53 ms
36,876 KB
testcase_07 WA -
testcase_08 AC 53 ms
37,100 KB
testcase_09 AC 54 ms
37,228 KB
testcase_10 AC 53 ms
37,208 KB
testcase_11 AC 53 ms
37,172 KB
testcase_12 AC 53 ms
37,036 KB
testcase_13 AC 53 ms
36,640 KB
testcase_14 AC 52 ms
37,076 KB
testcase_15 AC 53 ms
36,964 KB
testcase_16 AC 53 ms
37,028 KB
testcase_17 AC 54 ms
36,640 KB
testcase_18 AC 53 ms
36,992 KB
testcase_19 AC 53 ms
36,752 KB
testcase_20 AC 53 ms
37,024 KB
testcase_21 AC 52 ms
36,852 KB
testcase_22 AC 54 ms
37,072 KB
testcase_23 AC 52 ms
37,084 KB
testcase_24 AC 53 ms
36,768 KB
testcase_25 AC 52 ms
36,948 KB
testcase_26 AC 52 ms
37,056 KB
testcase_27 AC 52 ms
36,928 KB
testcase_28 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q297_G {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	// 1 5 3 4 2
	// 2 3 1
	void solve()
	{
		int n = ni();
		int u = ni();
		int[] a = na(u);
		int v = ni();
		int[] b = na(v);
		Arrays.sort(a);
		Arrays.sort(b);
		
		int ua = 0, ub = 0;
		int ct = 0;
		outer:
		for(int i = 0;i < n;i++){
			if(i % u == 0)ua = 0;
			if(i % v == 0)ub = 0;
			int maxa = 0;
			for(int j = 0;j < u;j++){
				if(ua<<~j>=0){
					if(a[j] > maxa){
						maxa = a[j];
					}
				}
			}
			int minb = -1;
			for(int j = 0;j < v;j++){
				if(ub<<~j>=0 && b[j] < maxa){
					if(b[j] > minb){
						minb = b[j];
					}
				}
			}
			for(int j = 0;j < u;j++){
				if(ua<<~j>=0){
					for(int k = v-1;k >= 0;k--){
						if(ub<<~k>=0 && a[j] > b[k]){
							ua |= 1<<j;
							ub |= 1<<k;
							ct++;
							continue outer;
						}
					}
				}
			}
			
			int mina = 9999;
			int arga = -1;
			for(int j = 0;j < u;j++){
				if(ua<<~j>=0){
					if(a[j] < mina){
						mina = a[j];
						arga = j;
					}
				}
			}
			
			int maxb = -1;
			int argb = -1;
			for(int j = 0;j < v;j++){
				if(ub<<~j>=0){
					if(b[j] > maxb){
						maxb = b[j];
						argb = j;
					}
				}
			}
			ua |= 1<<arga;
			ub |= 1<<argb;
		}
		out.println(ct);
	}
	
	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 Q297_G().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))){ // when nextLine, (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)); }
}
0