結果

問題 No.3016 unordered_mapなるたけ落とすマン
ユーザー uwiuwi
提出日時 2018-05-23 20:26:37
言語 Java21
(openjdk 21)
結果
AC  
実行時間 377 ms / 1,000 ms
コード長 3,457 bytes
コンパイル時間 3,887 ms
コンパイル使用メモリ 80,484 KB
実行使用メモリ 47,732 KB
最終ジャッジ日時 2024-06-28 16:23:15
合計ジャッジ時間 23,740 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
37,820 KB
testcase_01 AC 70 ms
37,856 KB
testcase_02 AC 71 ms
37,948 KB
testcase_03 AC 256 ms
46,592 KB
testcase_04 AC 377 ms
46,180 KB
testcase_05 AC 341 ms
46,256 KB
testcase_06 AC 332 ms
46,480 KB
testcase_07 AC 325 ms
46,392 KB
testcase_08 AC 328 ms
46,156 KB
testcase_09 AC 350 ms
46,236 KB
testcase_10 AC 350 ms
46,348 KB
testcase_11 AC 346 ms
46,128 KB
testcase_12 AC 335 ms
46,084 KB
testcase_13 AC 353 ms
46,168 KB
testcase_14 AC 331 ms
46,164 KB
testcase_15 AC 338 ms
46,384 KB
testcase_16 AC 345 ms
46,136 KB
testcase_17 AC 338 ms
46,184 KB
testcase_18 AC 322 ms
46,080 KB
testcase_19 AC 332 ms
46,028 KB
testcase_20 AC 351 ms
46,280 KB
testcase_21 AC 312 ms
45,980 KB
testcase_22 AC 328 ms
46,228 KB
testcase_23 AC 342 ms
45,676 KB
testcase_24 AC 350 ms
46,224 KB
testcase_25 AC 335 ms
45,660 KB
testcase_26 AC 343 ms
45,424 KB
testcase_27 AC 334 ms
45,668 KB
testcase_28 AC 297 ms
45,692 KB
testcase_29 AC 325 ms
46,108 KB
testcase_30 AC 325 ms
45,560 KB
testcase_31 AC 329 ms
45,944 KB
testcase_32 AC 340 ms
45,944 KB
testcase_33 AC 344 ms
46,072 KB
testcase_34 AC 339 ms
45,396 KB
testcase_35 AC 294 ms
45,720 KB
testcase_36 AC 336 ms
46,156 KB
testcase_37 AC 346 ms
46,092 KB
testcase_38 AC 344 ms
45,672 KB
testcase_39 AC 291 ms
46,392 KB
testcase_40 AC 362 ms
45,824 KB
testcase_41 AC 72 ms
37,856 KB
testcase_42 AC 73 ms
38,148 KB
testcase_43 AC 72 ms
38,104 KB
testcase_44 AC 150 ms
40,480 KB
testcase_45 AC 154 ms
40,028 KB
testcase_46 AC 146 ms
40,112 KB
testcase_47 AC 311 ms
45,884 KB
testcase_48 AC 330 ms
45,800 KB
testcase_49 AC 322 ms
46,104 KB
testcase_50 AC 256 ms
47,732 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package etc;
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 N3016 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		long[] a = new long[n];
		for(int i = 0;i < n;i++){
			a[i] = nl();
		}
		Arrays.sort(a);
		for(int i = 0;i < m;i++){
			long b = nl();
			out.print(lowerBound(a, b+1) - lowerBound(a, b) + " ");
		}
	}
	
	public static int lowerBound(long[] a, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N3016().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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