Untitled
plain_text
a month ago
2.3 kB
1
Indexable
Never
typedef long double ld; typedef long long ll; /* ──────▄▌▐▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▌ ───▄▄██▌█ beep beep ▄▄▄▌▐██▌█ code delivery ███████▌█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▌ ▀(@)▀▀▀▀▀▀▀(@)(@)▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀(@)▀ */ #include <bits/stdc++.h> #include <cmath> #include <stdio.h> #include <time.h> // #pragma GCC optimize("Ofast") // #pragma GCC optimization("O3") // #pragma GCC optimization("unroll-loops") // #define _GLIBCXX_DEBUG using namespace std; const ll inf = 1e18 + 7, mod = 1e9 + 7; vector<vector<vector<vector<ll>>>> dp(51, vector<vector<vector<ll>>>(51)); vector<ll> k; ll n = 50; void dfs(ll st, ll tec) { if (tec == 0) { return; } for (ll i = tec; i >= 1; --i) { k.push_back(i); dp[st][tec % i].push_back(k); dfs(st, tec % i); k.pop_back(); } } int main() { clock_t st = clock(); //////////////////////////////// // freopen("input.txt", "r", stdin); cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); for (ll i = 1; i <= 50; ++i) { dfs(i, i); } ////////////////////////// clock_t en = clock(); cin >> n; vector<ll> a(n), b(n); for (ll i = 0; i < n; ++i) { cin >> a[i]; } for (ll i = 0; i < n; ++i) { cin >> b[i]; } set<ll> tec; vector<ll> used(n); for (ll g = 0; g < n; ++g) { ll mx_ind = 0, mx = 0; for (ll i = 0; i < n; ++i) { if (!used[i]) { ll mn_gl = inf, mn_ind_gl = 0; for (ll j = 0; j < dp[a[i]][b[i]].size(); ++j) { ll mx_loc = 0; for (ll t = 0; t < dp[a[i]][b[i]][j].size(); ++t) { if (!tec.count(dp[a[i]][b[i]][j][t])) { mx_loc = max(mx_loc, dp[a[i]][b[i]][j][t]); } } if(mn < mn_gl){ } } } } } return 0; }