結果
問題 | No.610 区間賞(Section Award) |
ユーザー | Gosu_Hiroo |
提出日時 | 2020-06-30 02:20:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 155 ms / 2,000 ms |
コード長 | 9,997 bytes |
コンパイル時間 | 1,514 ms |
コンパイル使用メモリ | 173,288 KB |
実行使用メモリ | 5,888 KB |
最終ジャッジ日時 | 2024-07-19 06:14:13 |
合計ジャッジ時間 | 5,147 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 1 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 9 ms
5,376 KB |
testcase_20 | AC | 36 ms
5,632 KB |
testcase_21 | AC | 6 ms
5,376 KB |
testcase_22 | AC | 24 ms
5,376 KB |
testcase_23 | AC | 4 ms
5,376 KB |
testcase_24 | AC | 10 ms
5,376 KB |
testcase_25 | AC | 4 ms
5,376 KB |
testcase_26 | AC | 18 ms
5,376 KB |
testcase_27 | AC | 36 ms
5,632 KB |
testcase_28 | AC | 32 ms
5,504 KB |
testcase_29 | AC | 22 ms
5,376 KB |
testcase_30 | AC | 30 ms
5,376 KB |
testcase_31 | AC | 16 ms
5,376 KB |
testcase_32 | AC | 34 ms
5,504 KB |
testcase_33 | AC | 7 ms
5,376 KB |
testcase_34 | AC | 38 ms
5,760 KB |
testcase_35 | AC | 19 ms
5,376 KB |
testcase_36 | AC | 34 ms
5,632 KB |
testcase_37 | AC | 28 ms
5,376 KB |
testcase_38 | AC | 8 ms
5,376 KB |
testcase_39 | AC | 35 ms
5,760 KB |
testcase_40 | AC | 36 ms
5,760 KB |
testcase_41 | AC | 36 ms
5,888 KB |
testcase_42 | AC | 36 ms
5,760 KB |
testcase_43 | AC | 35 ms
5,888 KB |
testcase_44 | AC | 127 ms
5,504 KB |
testcase_45 | AC | 155 ms
5,632 KB |
testcase_46 | AC | 153 ms
5,632 KB |
testcase_47 | AC | 30 ms
5,504 KB |
testcase_48 | AC | 29 ms
5,376 KB |
testcase_49 | AC | 31 ms
5,504 KB |
ソースコード
/*** code generated by JHelper* More info: https://github.com/AlexeyDmitriev/JHelper* @author*/#include <bits/stdc++.h>using namespace std;using ll = long long;//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#define VI vector<int>#define G(size_1) vector<vector<int>>(size_1, vector<int>())#define SZ(x) ((int)(x).size())#define READ ({int t;cin >> t;t;})#define PII pair<int, int>#define FOR(i, _begin, _end) for (__typeof(_end) end = _end, begin = _begin, i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1- 2 * ((begin) > (end)))#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)#define ALL(x) (x).begin(),(x).end()#define F first#define S second#define y0 y3487465#define y1 y8687969#define j0 j1347829#define j1 j234892#define MOD(x, m) ((((x) % (m)) + (m)) % (m))#define BIT(n) (1LL<<(n))#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define EB emplace_back#define PB push_back#define fcout cout << fixed << setprecision(12)#define fcerr cerr << fixed << setprecision(12)#define print(x) cout << (x) << endl#define fprint(x) cout << fixed << setprecision(12) << (x) << endl# define BYE(a) do { cout << (a) << endl; return ; } while (false)#ifdef DEBUG#define ERR(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); _err(cerr,_it, args); }#define DBG(x) cerr << #x << " is " << x << endl;#else#define DBG(x) {};#define ERR(args...) {};#endifvoid _err(std::ostream& cerr,istream_iterator<string> it) {cerr << endl;}template<typename T, typename... Args>void _err(std::ostream& cerr, istream_iterator<string> it, T a, Args... args) {cerr << *it << " = " << a << " ";_err(cerr,++it, args...);}const double pi = 2 * acos(.0);const int inf = 0x3f3f3f3f;const ll mod = (ll) (1e9) + 7;template<class T>bool Chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool Chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template <typename T>istream& operator >> (istream& is, vector<T>& V) {for(auto&& ele : V)is >> ele;return is;}template <typename T>ostream& operator << (ostream& os, const vector<T> V) {os << "[";int cnt = 0;T curr;if(!V.empty()){for (int i = 0; i < V.size() - 1; ++i) {if(V[i] == curr)cnt ++;else cnt = 0;if(cnt == 4)os << "... ";if(cnt < 4)os << i << ":" << V[i] << " ";curr = V[i];}os << V.size() - 1 << ":" << V.back();}os << "]\n";return os;}template <typename T, typename U>ostream& operator << (ostream& os, const pair<T,U> P) {os << "(";os << P.first << "," << P.second;os << ")";return os;}template <typename T, typename U>ostream& operator << (ostream& os, const set<T,U> V) {os << "{";if(!V.empty()){auto it = V.begin();for (int i = 0; i < V.size() -1; ++i) {os << *it << " ";it++;}os << *it;}os << "}\n";return os;}template <typename K, typename H, typename P>ostream& operator << (ostream& os, const unordered_set<K, H, P> V) {os << "{";if(!V.empty()){auto it = V.begin();for (int i = 0; i < V.size() -1; ++i) {os << *it << " ";it++;}os << *it;}os << "}\n";return os;}template <typename K, typename C>ostream& operator << (ostream& os, const multiset<K, C> V) {os << "{";if(!V.empty()){auto it = V.begin();for (int i = 0; i < V.size() -1; ++i) {os << *it << " ";it++;}os << *it;}os << "}";return os;}template <typename K, typename T, typename C>ostream& operator << (ostream& os, const map<K,T,C> V) {os << "{";if(!V.empty()){auto it = V.begin();for (int i = 0; i < V.size() -1; ++i) {os << "(";os << it->first << "," << it->second;os << ") ";it++;}os << "(";os << it->first << "," << it->second;os << ")";}os << "}\n";return os;}template <typename K, typename T, typename C>ostream& operator << (ostream& os, const unordered_map<K,T,C> V) {os << "{";if(!V.empty()){auto it = V.begin();for (int i = 0; i < V.size() -1; ++i) {os << "(";os << it->first << "," << it->second;os << ") ";it++;}os << "(";os << it->first << "," << it->second;os << ")";}os << "}\n";return os;}template <typename T>ostream& operator << (ostream& os, const deque<T> V) {os << "[";if (!V.empty()) {for (int i = 0; i < V.size() - 1; ++i) {os << V[i] << "->";}if (!V.empty())os << V.back();}os << "]\n";return os;};template <typename T, typename Cont, typename Comp>ostream& operator << (ostream& os, const priority_queue<T, Cont, Comp> V) {priority_queue<T, Cont, Comp> _V = V;os << "[";if(!_V.empty()){while(_V.size() > 1){os << _V.top() << "->";_V.pop();}os << _V.top();}os << "]\n";return os;};template <class F>struct y_combinator {F f; // the lambda will be stored here// a forwarding operator():template <class... Args>decltype(auto) operator()(Args&&... args) const {// we pass ourselves to f, then the arguments.// the lambda should take the first argument as `auto&& recurse` or similar.return f(*this, std::forward<Args>(args)...);}};// helper function that deduces the type of the lambda:template <class F>y_combinator<std::decay_t<F>> recursive(F&& f){return {std::forward<F>(f)};}struct hash_pair {template <class T1, class T2>size_t operator()(const pair<T1, T2>& p) const{auto hash1 = hash<T1>{}(p.first);auto hash2 = hash<T2>{}(p.second);return hash1 ^ hash2;}};template <typename T, typename U>std::vector<T> multi_vector(int n, U v) {return std::vector<T>(n, v);}template <typename U, typename... Args>auto multi_vector(int n, Args... args) {auto val = multi_vector<U>(std::forward<Args>(args)...);return std::vector<decltype(val)>(n, std::move(val));}template< typename Monoid >struct SegmentTree {using F = function< Monoid(Monoid, Monoid) >;int sz;vector< Monoid > seg;const F f;const Monoid M1;SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {sz = 1;while(sz < n) sz <<= 1;seg.assign(2 * sz, M1);}void set(int k, const Monoid &x) {seg[k + sz] = x;}void build() {for(int k = sz - 1; k > 0; k--) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}void update(int k, const Monoid &x) {k += sz;seg[k] = x;while(k >>= 1) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}Monoid query(int a, int b) {Monoid L = M1, R = M1;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) L = f(L, seg[a++]);if(b & 1) R = f(seg[--b], R);}return f(L, R);}Monoid operator[](const int &k) const {return seg[k + sz];}template< typename C >int find_subtree(int a, const C &check, Monoid &M, bool type) {while(a < sz) {Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);if(check(nxt)) a = 2 * a + type;else M = nxt, a = 2 * a + 1 - type;}return a - sz;}template< typename C >int find_first(int a, const C &check) {Monoid L = M1;if(a <= 0) {if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);return -1;}int b = sz;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) {Monoid nxt = f(L, seg[a]);if(check(nxt)) return find_subtree(a, check, L, false);L = nxt;++a;}}return -1;}template< typename C >int find_last(int b, const C &check) {Monoid R = M1;if(b >= sz) {if(check(f(seg[1], R))) return find_subtree(1, check, R, true);return -1;}int a = sz;for(b += sz; a < b; a >>= 1, b >>= 1) {if(b & 1) {Monoid nxt = f(seg[--b], R);if(check(nxt)) return find_subtree(b, check, R, true);R = nxt;}}return -1;}};class Task {public:ll power_mod(ll x, ll y, ll p) {if (y < 0)return 0;ll res = 1;x = x % p;while (y) {if (y & 1)res = (res * x) % p;y = y >> 1;x = (x * x) % p;}return res;}void solve(std::istream& cin, std::ostream& cout, std::ostream& cerr) {int N;cin >> N;VI a(N), c(N), b(N);cin >> a >> c;REP(i,N)a[i]--, c[i]--;SegmentTree<int> seg(N+1, [](int a, int b){return min(a,b);}, inf);REP(i,N)b[c[i]] = i;ERR(a,b,c)REP(i,N)seg.update(i, b[a[i]]);VI ans(N, 1);REP(i,N){ERR(seg.query(i,N), b[a[i]])if(seg.query(i,N) < b[a[i]])ans[a[i]] = 0;}ERR(seg.seg)REP(i,N)if(ans[i])print(i+1);}};#undef intint main() {Task solver;std::istream& in(std::cin);std::ostream& out(std::cout);std::ostringstream err;in.tie(0); ios::sync_with_stdio(0);solver.solve(in, out,err);return 0;}