# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
596474 | 2022-07-14T19:09:08 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 = 1015; const int LOG = 25; 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]; void init(int n, string S){ for(int i = 0; i < n; i++) s += S[i], ans[i][0] = S[i]; int log = log2(n) + 1; for(int j = 1; j < log; j++){ for(int i = 0; i < n; i++){ ans[i][j] = ans[i][j - 1]; if(i + (1 << j) >= n) continue; for(int k = 0; k < sz(ans[i][j - 1]); k++){ ans[i][j] += ans[i][j - 1][k]; ans[i][j] += ans[i + (1 << (j - 1))][j - 1][k]; } } } } int query(int I, int K){ string aux; for(int i = I; i < (I + (1 << K)); i++) aux += s[i]; return aux == ans[I][K]; }