#include <bits/stdc++.h> #include <math.h> using namespace std; #define endl "\n" #define mp make_pair #define st first #define nd second #define pii pair<int, int> #define pb push_back #define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0); #define REP(i, n) for (int i = 0; i < (n); ++i) #define FWD(i, a, b) for (int i = (a); i < (b); ++i) #define rep(i, n) for (int32_t i = 0; i < (n); ++i) #define fwd(i, a, b) for (int i = (a); i < (b); ++i) #define all(c) (c).begin(), (c).end() #define sz(X) (int)((X).size()) #define what(x) cerr << #x << " is " << x << endl; ostream &operator<<(ostream &out, string str) { for (char c : str) out << c; return out; } template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; } template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) { out << '{'; for (auto it = a.begin(); it != a.end(); it = next(it)) out << (it != a.begin() ? ", " : "") << *it; return out << '}'; } void dump() { cerr << "\n"; } template <class T, class... Ts> void dump(T a, Ts... x) { cerr << a << ", "; dump(x...); } #define DEBUG false #define debug(...) \ if (DEBUG) \ cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__) const int MAXN = 5e5 + 99; const long long MOD = 1e9 + 7; struct Node { Node *right, *left; int r_rozmiar, l_rozmiar, rozmiar; Node() : right(NULL), left(NULL), r_rozmiar(0), l_rozmiar(0), rozmiar(0) {} }; // ostream &operator<<(ostream &out, Node node) { return out << "{" << node.id << ": " << node.l_rozmiar << "," << node.r_rozmiar << "}"; } Node *tab1[MAXN]; Node *tab2[MAXN]; Node *prostaR[MAXN]; Node *prostaL[MAXN]; Node *root1; Node *root2; int n; long long result; void dfs(Node *x) { if (x->left != NULL) { dfs(x->left); x->l_rozmiar = x->left->rozmiar; } if (x->right != NULL) { dfs(x->right); x->r_rozmiar = x->right->rozmiar; } x->rozmiar = x->l_rozmiar + x->r_rozmiar + 1; } inline void add(int x) { result = (result + x); } void wczytaj(Node *&root, Node *tab[MAXN]) { for (int i = 1; i <= n; i++) { int a; cin >> a; if (a == -1) { root = tab[i]; continue; } if (a < i) tab[a]->right = tab[i]; else tab[a]->left = tab[i]; } } // node1 - nasz, node2 -docelowy void solve(Node *node1, Node *node2, int lewo, int prawo) { if (node1 == node2) return; if (node1 == NULL) { if (prawo > 0) { node1 = prostaL[prawo]; prawo = 0; } if (lewo > 0) { node1 = prostaR[lewo]; lewo = 0; } } if (node2 == NULL) { if (prawo < 0) { node2 = prostaL[-prawo]; prawo = 0; } if (lewo < 0) { node2 = prostaR[-lewo]; lewo = 0; } } if (node1 == NULL || node2 == NULL) { return; } if (prawo == 0 && lewo == 0) { int T = node2->l_rozmiar - node1->l_rozmiar; add(abs(T)); solve(node1->left, node2->left, 0, node2->l_rozmiar - node1->l_rozmiar); solve(node1->right, node2->right, node2->r_rozmiar - node1->r_rozmiar, 0); return; } if (prawo < 0) { int T = node1->r_rozmiar; add(T); solve(node1->right, prostaR[T], 0, 0); solve(node1->left, node2, 0, prawo + T + 1); return; } if (lewo < 0) { int T = node1->l_rozmiar; add(T); solve(node1->left, prostaL[T], 0, 0); solve(node1->right, node2, lewo + T + 1, 0); } if (prawo > 0) { int T = node2->r_rozmiar; add(T); solve(prostaR[T], node2->right, 0, 0); solve(node1, node2->left, 0, prawo - T - 1); return; } if (lewo > 0) { int T = node2->l_rozmiar; add(T); solve(prostaL[T], node2->left, 0, 0); solve(node1, node2->right, lewo - T - 1, 0); return; } } void pre() { cin >> n; prostaR[0] = prostaL[0] = NULL; for (int j = 1; j < MAXN; j++) { prostaR[j] = new Node(); prostaL[j] = new Node(); prostaR[j]->right = prostaR[j - 1]; prostaL[j]->left = prostaL[j - 1]; } rep(i, n + 1) { tab1[i] = new Node(); tab2[i] = new Node(); } wczytaj(root1, tab1); wczytaj(root2, tab2); dfs(prostaR[MAXN - 1]); dfs(prostaL[MAXN - 1]); dfs(root1); dfs(root2); } int32_t main() { _upgrade; pre(); solve(root1, root2, 0, 0); // TU MA BYC MODUL // cerr << MOD << endl; cout << result % MOD << endl; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 | #include <bits/stdc++.h> #include <math.h> using namespace std; #define endl "\n" #define mp make_pair #define st first #define nd second #define pii pair<int, int> #define pb push_back #define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0); #define REP(i, n) for (int i = 0; i < (n); ++i) #define FWD(i, a, b) for (int i = (a); i < (b); ++i) #define rep(i, n) for (int32_t i = 0; i < (n); ++i) #define fwd(i, a, b) for (int i = (a); i < (b); ++i) #define all(c) (c).begin(), (c).end() #define sz(X) (int)((X).size()) #define what(x) cerr << #x << " is " << x << endl; ostream &operator<<(ostream &out, string str) { for (char c : str) out << c; return out; } template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; } template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) { out << '{'; for (auto it = a.begin(); it != a.end(); it = next(it)) out << (it != a.begin() ? ", " : "") << *it; return out << '}'; } void dump() { cerr << "\n"; } template <class T, class... Ts> void dump(T a, Ts... x) { cerr << a << ", "; dump(x...); } #define DEBUG false #define debug(...) \ if (DEBUG) \ cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__) const int MAXN = 5e5 + 99; const long long MOD = 1e9 + 7; struct Node { Node *right, *left; int r_rozmiar, l_rozmiar, rozmiar; Node() : right(NULL), left(NULL), r_rozmiar(0), l_rozmiar(0), rozmiar(0) {} }; // ostream &operator<<(ostream &out, Node node) { return out << "{" << node.id << ": " << node.l_rozmiar << "," << node.r_rozmiar << "}"; } Node *tab1[MAXN]; Node *tab2[MAXN]; Node *prostaR[MAXN]; Node *prostaL[MAXN]; Node *root1; Node *root2; int n; long long result; void dfs(Node *x) { if (x->left != NULL) { dfs(x->left); x->l_rozmiar = x->left->rozmiar; } if (x->right != NULL) { dfs(x->right); x->r_rozmiar = x->right->rozmiar; } x->rozmiar = x->l_rozmiar + x->r_rozmiar + 1; } inline void add(int x) { result = (result + x); } void wczytaj(Node *&root, Node *tab[MAXN]) { for (int i = 1; i <= n; i++) { int a; cin >> a; if (a == -1) { root = tab[i]; continue; } if (a < i) tab[a]->right = tab[i]; else tab[a]->left = tab[i]; } } // node1 - nasz, node2 -docelowy void solve(Node *node1, Node *node2, int lewo, int prawo) { if (node1 == node2) return; if (node1 == NULL) { if (prawo > 0) { node1 = prostaL[prawo]; prawo = 0; } if (lewo > 0) { node1 = prostaR[lewo]; lewo = 0; } } if (node2 == NULL) { if (prawo < 0) { node2 = prostaL[-prawo]; prawo = 0; } if (lewo < 0) { node2 = prostaR[-lewo]; lewo = 0; } } if (node1 == NULL || node2 == NULL) { return; } if (prawo == 0 && lewo == 0) { int T = node2->l_rozmiar - node1->l_rozmiar; add(abs(T)); solve(node1->left, node2->left, 0, node2->l_rozmiar - node1->l_rozmiar); solve(node1->right, node2->right, node2->r_rozmiar - node1->r_rozmiar, 0); return; } if (prawo < 0) { int T = node1->r_rozmiar; add(T); solve(node1->right, prostaR[T], 0, 0); solve(node1->left, node2, 0, prawo + T + 1); return; } if (lewo < 0) { int T = node1->l_rozmiar; add(T); solve(node1->left, prostaL[T], 0, 0); solve(node1->right, node2, lewo + T + 1, 0); } if (prawo > 0) { int T = node2->r_rozmiar; add(T); solve(prostaR[T], node2->right, 0, 0); solve(node1, node2->left, 0, prawo - T - 1); return; } if (lewo > 0) { int T = node2->l_rozmiar; add(T); solve(prostaL[T], node2->left, 0, 0); solve(node1, node2->right, lewo - T - 1, 0); return; } } void pre() { cin >> n; prostaR[0] = prostaL[0] = NULL; for (int j = 1; j < MAXN; j++) { prostaR[j] = new Node(); prostaL[j] = new Node(); prostaR[j]->right = prostaR[j - 1]; prostaL[j]->left = prostaL[j - 1]; } rep(i, n + 1) { tab1[i] = new Node(); tab2[i] = new Node(); } wczytaj(root1, tab1); wczytaj(root2, tab2); dfs(prostaR[MAXN - 1]); dfs(prostaL[MAXN - 1]); dfs(root1); dfs(root2); } int32_t main() { _upgrade; pre(); solve(root1, root2, 0, 0); // TU MA BYC MODUL // cerr << MOD << endl; cout << result % MOD << endl; } |