#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector& vec, const V& val, int len) { vec.assign(len, val); } template void ndarray(vector& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template pair operator+(const pair &l, const pair &r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair &l, const pair &r) { return make_pair(l.first - r.first, l.second - r.second); } template vector sort_unique(vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template int arglb(const std::vector &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template int argub(const std::vector &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template istream &operator>>(istream &is, vector &vec) { for (auto &v : vec) is >> v; return is; } template ostream &operator<<(ostream &os, const vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template ostream &operator<<(ostream &os, const array &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template istream &operator>>(istream &is, tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template ostream &operator<<(ostream &os, const tuple &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template ostream &operator<<(ostream &os, const deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template ostream &operator<<(ostream &os, const set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const pair &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template ostream &operator<<(ostream &os, const map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr) #else #define dbg(x) (x) #define dbgif(cond, x) 0 #endif #include using S = pint; // min, num of min S op(S l, S r) { if (l.first < r.first) return l; if (l.first > r.first) return r; return {l.first, l.second + r.second}; } S e() { return {1 << 20, 0}; } using F = int; S mapping(F f, S x) { return {x.first + f, x.second}; } F composition(F f, F g) { return f + g; } F id() { return 0; } using Tree = atcoder::lazy_segtree; int main() { int N; cin >> N; vector A(N), B(N); cin >> A >> B; vector> a2i(400001), b2i = a2i; vector>> updates(N + 1); REP(i, N) { a2i[A[i]].push_back(i); b2i[B[i]].push_back(i); } REP(a, a2i.size()) { auto xa = a2i[a], xb = b2i[a]; int ia = 0, ib = 0, l = 0; if (xa.empty() and xb.empty()) continue; dbg(xa); dbg(xb); while (ia < int(xa.size()) or ib < int(xb.size())) { dbg(pint(ia, ib)); if (ia == xa.size()) { updates[l].emplace_back(xb[ib], N, 1); updates[xb[ib] + 1].emplace_back(xb[ib], N, -1); break; } else if (ib == xb.size()) { updates[l].emplace_back(xa[ia], N, 1); updates[xa[ia] + 1].emplace_back(xa[ia], N, -1); break; } else if (xa[ia] == xb[ib]) { l = xa[ia] + 1; ia++; ib++; continue; } else if (xa[ia] < xb[ib]) { updates[l].emplace_back(xa[ia], xb[ib], 1); updates[xa[ia] + 1].emplace_back(xa[ia], xb[ib], -1); l = xa[ia] + 1; ia++; } else { updates[l].emplace_back(xb[ib], xa[ia], 1); updates[xb[ib] + 1].emplace_back(xb[ib], xa[ia], -1); l = xb[ib] + 1; ib++; } } dbg(updates); } dbg(updates); lint ret = 0; Tree tree(vector(N, pint(0, 1))); REP(i, N) { for (auto [l, r, v] : updates[i]) { tree.apply(l, r, v); } auto pr = tree.prod(i, N); dbg(pr); if (pr.first == 0) ret += pr.second; } cout << ret << '\n'; }