結果

問題 No.610 区間賞(Section Award)
ユーザー しらっ亭しらっ亭
提出日時 2017-12-10 00:12:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 5,355 bytes
コンパイル時間 1,599 ms
コンパイル使用メモリ 120,400 KB
実行使用メモリ 4,896 KB
最終ジャッジ日時 2023-08-20 05:33:29
合計ジャッジ時間 4,004 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1 ms
4,384 KB
testcase_02 AC 2 ms
4,384 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,384 KB
testcase_07 AC 2 ms
4,384 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 2 ms
4,384 KB
testcase_11 AC 2 ms
4,380 KB
testcase_12 AC 2 ms
4,384 KB
testcase_13 AC 1 ms
4,384 KB
testcase_14 AC 2 ms
4,380 KB
testcase_15 AC 2 ms
4,384 KB
testcase_16 AC 2 ms
4,384 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 2 ms
4,384 KB
testcase_19 AC 6 ms
4,380 KB
testcase_20 AC 23 ms
4,380 KB
testcase_21 AC 4 ms
4,380 KB
testcase_22 AC 16 ms
4,380 KB
testcase_23 AC 4 ms
4,380 KB
testcase_24 AC 7 ms
4,380 KB
testcase_25 AC 3 ms
4,380 KB
testcase_26 AC 12 ms
4,380 KB
testcase_27 AC 24 ms
4,384 KB
testcase_28 AC 21 ms
4,384 KB
testcase_29 AC 15 ms
4,384 KB
testcase_30 AC 19 ms
4,380 KB
testcase_31 AC 11 ms
4,380 KB
testcase_32 AC 21 ms
4,380 KB
testcase_33 AC 5 ms
4,384 KB
testcase_34 AC 23 ms
4,380 KB
testcase_35 AC 11 ms
4,384 KB
testcase_36 AC 22 ms
4,380 KB
testcase_37 AC 19 ms
4,384 KB
testcase_38 AC 7 ms
4,384 KB
testcase_39 AC 24 ms
4,388 KB
testcase_40 AC 23 ms
4,380 KB
testcase_41 AC 23 ms
4,384 KB
testcase_42 AC 23 ms
4,384 KB
testcase_43 AC 23 ms
4,384 KB
testcase_44 AC 29 ms
4,704 KB
testcase_45 AC 33 ms
4,896 KB
testcase_46 AC 35 ms
4,804 KB
testcase_47 AC 20 ms
4,380 KB
testcase_48 AC 18 ms
4,380 KB
testcase_49 AC 20 ms
4,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <tuple>
#include <cstring>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

template <typename T> struct BinaryIndexedTree0 {
	const int N;
	vector<T> val;

	BinaryIndexedTree0(int N) : N(N), val(N) {}

	T sum(int i) const {
		T s = 0;
		--i;
		if (i >= N) i = N - 1;
		for (; i >= 0; i = (i & (i + 1)) - 1) s += val[i];
		return s;
	}

	T sum(int l, int r) const {
		return sum(r) - sum(l);
	}

	void add(int i, T x) {
		for (; i < N; i |= i + 1) val[i] += x;
	}

	void set(int i, T x) {
		T c = sum(i, i + 1);
		add(i, x - c);
	}

	int lower_bound(T w) const {
		int x = 0;

		for (int k = (1 << (31 - __builtin_clz(N))) - 1; ; k >>= 1) {
			if (x + k < N && val[x + k] < w) {
				w -= val[x + k];
				x += k + 1;
			}
			if (k == 0) break;
		}
		return x;
	}
};

void Main() {
	int n = ri();
	vector<int> A(n);
	rep(i, n) A[i] = ri() - 1;

	vector<int> R(n);
	rep(i, n) R[ri() - 1] = i;

	BinaryIndexedTree0<int> ft(n);

	vi ans;

	rrep(i, n) {
		int a = A[i];
		int r = R[a];
		if (ft.sum(r) == 0) ans.emplace_back(a+1);
		ft.add(r, 1);
	}

	sort(all(ans));

	forr(a, ans) {
		cout << a << '\n';
	}
	}

signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}
0