結果

問題 No.610 区間賞(Section Award)
ユーザー GrenacheGrenache
提出日時 2017-12-12 18:52:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 491 ms / 2,000 ms
コード長 5,028 bytes
コンパイル時間 4,171 ms
コンパイル使用メモリ 82,832 KB
実行使用メモリ 59,992 KB
最終ジャッジ日時 2024-12-14 06:18:43
合計ジャッジ時間 14,153 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,552 KB
testcase_01 AC 58 ms
50,456 KB
testcase_02 AC 57 ms
50,140 KB
testcase_03 AC 59 ms
50,500 KB
testcase_04 AC 57 ms
50,572 KB
testcase_05 AC 60 ms
50,404 KB
testcase_06 AC 69 ms
50,296 KB
testcase_07 AC 59 ms
49,992 KB
testcase_08 AC 82 ms
50,980 KB
testcase_09 AC 61 ms
50,388 KB
testcase_10 AC 70 ms
50,776 KB
testcase_11 AC 68 ms
50,240 KB
testcase_12 AC 57 ms
50,520 KB
testcase_13 AC 79 ms
50,776 KB
testcase_14 AC 80 ms
50,956 KB
testcase_15 AC 66 ms
50,904 KB
testcase_16 AC 67 ms
50,424 KB
testcase_17 AC 60 ms
50,372 KB
testcase_18 AC 62 ms
50,520 KB
testcase_19 AC 154 ms
52,932 KB
testcase_20 AC 235 ms
55,084 KB
testcase_21 AC 130 ms
52,692 KB
testcase_22 AC 205 ms
53,088 KB
testcase_23 AC 117 ms
52,484 KB
testcase_24 AC 165 ms
52,740 KB
testcase_25 AC 96 ms
52,036 KB
testcase_26 AC 184 ms
53,076 KB
testcase_27 AC 228 ms
55,136 KB
testcase_28 AC 215 ms
54,896 KB
testcase_29 AC 208 ms
53,044 KB
testcase_30 AC 224 ms
55,204 KB
testcase_31 AC 186 ms
52,756 KB
testcase_32 AC 233 ms
55,028 KB
testcase_33 AC 130 ms
52,744 KB
testcase_34 AC 238 ms
55,256 KB
testcase_35 AC 194 ms
53,100 KB
testcase_36 AC 234 ms
55,044 KB
testcase_37 AC 217 ms
55,024 KB
testcase_38 AC 133 ms
52,956 KB
testcase_39 AC 223 ms
55,032 KB
testcase_40 AC 230 ms
55,128 KB
testcase_41 AC 225 ms
55,092 KB
testcase_42 AC 229 ms
55,044 KB
testcase_43 AC 239 ms
55,088 KB
testcase_44 AC 439 ms
59,992 KB
testcase_45 AC 491 ms
59,956 KB
testcase_46 AC 479 ms
59,572 KB
testcase_47 AC 222 ms
55,312 KB
testcase_48 AC 208 ms
55,284 KB
testcase_49 AC 225 ms
56,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder610 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();

		int[] a = new int[n];
		int[] ra = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt() - 1;
			ra[a[i]] = i;
		}

		SegmentTree st = new SegmentTree(n);
		int[] b = new int[n];
		List<Integer> ans = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			b[i] = sc.nextInt() - 1;

			if (st.query(ra[b[i]], n) == 0) {
				ans.add(b[i]);
			}

			st.update(ra[b[i]], 1);
		}
		Collections.sort(ans);

		for (int e : ans) {
			pr.println(e + 1);
		}
	}

	private static class SegmentTree {
		int[] st;
		int n;

		SegmentTree(int n) {
			this.n = 1;
			while (this.n < n) {
				this.n *= 2;
			}
			st = new int[2 * this.n - 1];
		}

		// i:0-indexed
		void update(int i, int x) {
			i = n - 1 + i;
			st[i] += x;
			while (i > 0) {
				i = (i - 1) / 2;
				st[i] += x;
			}
		}

		// a, b:0-indexed
		// [a, b)
		int query(int a, int b) {
			return query(a, b, 0, 0, n);
		}

		private int query(int a, int b, int i, int l, int r) {
			if (a >= r || b <= l) {
				return 0;
			}
			if (a <= l && b >= r) {
				return st[i];
			}

			return query(a, b, i * 2 + 1, l, (l + r) / 2) + query(a, b, i * 2 + 2, (l + r) / 2, r);
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0