# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597032 | 2022-07-15T12:07:03 Z | Hacv16 | Brperm (RMI20_brperm) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; const int MAX = 100010; const int LOG = 18; const int INF = 0x3f3f3f3f; const int MOD = 1e9 + 7; #define pb push_back #define sz(x) (int) x.size() #define fr first #define sc second #define mp make_pair #define all(x) x.begin(), x.end() #define dbg(x) cout << #x << ": " << "[ " << x << " ]\n" string s, ans[MAX][LOG]; map<pii, string> memo; int query(int I, int K){ if(I + (1 << K) > sz(s)) return 0; string aux = s.substr(I, (1 << K)); return aux == ans[I][K]; } void init(int n, const char S[]){ for(int i = 0; i < n; i++) s += S[i], ans[i][0] = S[i]; for(int j = 1; j < LOG; j++){ for(int i = 0; i + (1 << j) <= n; i++){ for(int k = 0; k < min(sz(ans[i][j - 1]), sz(ans[i + (1 << (j - 1))][j - 1])); k++){ ans[i][j] += ans[i][j - 1][k]; ans[i][j] += ans[i + (1 << (j - 1))][j - 1][k]; } //cout << ans[i][j] << '\n'; } } } void init(int n, const char S[]){ for(int i = 0; i < n; i++) s += S[i], ans[i][0] = S[i]; for(int j = 1; j < LOG; j++){ for(int i = 0; i + (1 << j) <= n; i++){ for(int k = 0; k < min(sz(ans[i][j - 1]), sz(ans[i + (1 << (j - 1))][j - 1])); k++){ ans[i][j] += ans[i][j - 1][k]; ans[i][j] += ans[i + (1 << (j - 1))][j - 1][k]; } //cout << ans[i][j] << '\n'; } } }