# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470671 | Carmel_Ab1 | Brperm (RMI20_brperm) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
os << "[";
for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
os << "]\n";
return os;
}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
#include "brperm.h"
#include "grader.cpp"
const ll m=1e9+7;
vector<vector<string>>a;
string S;
void init(int n, const char s[]) {
a.resize(n,vector<string>(20));
for(int i=0; i<n; i++)
S+=string(1,s[i]);
for(int i=0; i<n; i++)
a[i][0]=string(1,s[i]);
for(int j=1; j<20; j++)
for(int i=0; i+(1<<j)<=n; i++){
string s1=a[i][j-1],s2=a[i+(1<<(j-1))][j-1];
for(int k=0; k<s1.size(); k++)
a[i][j]+=s1[k],a[i][j]+=s2[k];
}
}
int query(int i, int k) {
return S.substr(i,(1<<k))==a[i][k];
}