#222484 (Java21) No.610 区間賞(Section Award)

提出ソース

結果

問題	No.610 区間賞(Section Award)
ユーザー	uwi
提出日時	2017-12-10 00:07:30
言語	Java21 (openjdk 21)
結果	AC
実行時間	218 ms / 2,000 ms
コード長	4,056 bytes
コンパイル時間	5,394 ms
コンパイル使用メモリ	82,768 KB
実行使用メモリ	57,452 KB
最終ジャッジ日時	2023-08-20 05:26:10
合計ジャッジ時間	9,962 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	44 ms 49,460 KB
testcase_01	AC	47 ms 49,452 KB
testcase_02	AC	45 ms 49,476 KB
testcase_03	AC	46 ms 49,204 KB
testcase_04	AC	45 ms 49,132 KB
testcase_05	AC	46 ms 49,296 KB
testcase_06	AC	47 ms 49,408 KB
testcase_07	AC	45 ms 49,420 KB
testcase_08	AC	47 ms 49,352 KB
testcase_09	AC	45 ms 49,240 KB
testcase_10	AC	47 ms 49,268 KB
testcase_11	AC	47 ms 49,544 KB
testcase_12	AC	46 ms 49,432 KB
testcase_13	AC	46 ms 49,244 KB
testcase_14	AC	47 ms 49,348 KB
testcase_15	AC	46 ms 49,632 KB
testcase_16	AC	46 ms 49,228 KB
testcase_17	AC	46 ms 49,472 KB
testcase_18	AC	45 ms 49,416 KB
testcase_19	AC	76 ms 51,852 KB
testcase_20	AC	98 ms 54,248 KB
testcase_21	AC	61 ms 51,880 KB
testcase_22	AC	94 ms 52,460 KB
testcase_23	AC	61 ms 51,748 KB
testcase_24	AC	74 ms 51,792 KB
testcase_25	AC	52 ms 49,240 KB
testcase_26	AC	91 ms 52,152 KB
testcase_27	AC	95 ms 53,760 KB
testcase_28	AC	94 ms 54,164 KB
testcase_29	AC	89 ms 52,148 KB
testcase_30	AC	86 ms 54,124 KB
testcase_31	AC	90 ms 52,224 KB
testcase_32	AC	99 ms 54,396 KB
testcase_33	AC	73 ms 51,840 KB
testcase_34	AC	102 ms 54,348 KB
testcase_35	AC	88 ms 51,656 KB
testcase_36	AC	98 ms 54,872 KB
testcase_37	AC	98 ms 54,076 KB
testcase_38	AC	80 ms 52,092 KB
testcase_39	AC	102 ms 54,784 KB
testcase_40	AC	99 ms 54,300 KB
testcase_41	AC	100 ms 54,280 KB
testcase_42	AC	100 ms 56,284 KB
testcase_43	AC	101 ms 54,516 KB
testcase_44	AC	186 ms 56,352 KB
testcase_45	AC	218 ms 56,500 KB
testcase_46	AC	215 ms 57,452 KB
testcase_47	AC	95 ms 53,952 KB
testcase_48	AC	95 ms 53,992 KB
testcase_49	AC	95 ms 54,156 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package adv2017;
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 N610 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] b = na(n);
		for(int i = 0;i < n;i++)a[i]--;
		for(int i = 0;i < n;i++)b[i]--;
		int[] ia = new int[n];
		for(int i = 0;i < n;i++)ia[a[i]] = i;
		int[] rets = new int[n];
		int p = 0;
		int back = -1;
		for(int i = 0;i < n;i++){
			if(ia[b[i]] > back){
				back = ia[b[i]];
				rets[p++] = b[i];
			}
		}
		rets = radixSort(rets, p);
		for(int i = 0;i < p;i++){
			out.println(rets[i]+1);
		}
	}
	
	public static int[] radixSort(int[] f){ return radixSort(f, f.length); }
	public static int[] radixSort(int[] f, int n)
	{
		int[] to = new int[n];
		{
			int[] b = new int[65537];
			for(int i = 0;i < n;i++)b[1+(f[i]&0xffff)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < n;i++)to[b[f[i]&0xffff]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		{
			int[] b = new int[65537];
			for(int i = 0;i < n;i++)b[1+(f[i]>>>16)]++;
			for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
			for(int i = 0;i < n;i++)to[b[f[i]>>>16]++] = f[i];
			int[] d = f; f = to;to = d;
		}
		return f;
	}

	
	
	
	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 N610().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)); }
}

yukicoder

結果

テストケース

ソースコード