# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470227 | AmirrezaM | Dabbeh (INOI20_dabbeh) | C++17 | 1324 ms | 332892 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.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define vc vector
#define pb push_back
const int MAXN = 5e5 + 55 , ss = 1 << 19 , lg = 20;
const int p[2] = {233 , 253} , mod[2] = {1000000007 , 1000000009};
ll pw(ll a , ll b , int t){
ll ret = 1;
while(b){
if(b&1) ret = (ret * a) % mod[t];
a = (a * a) % mod[t];
b >>= 1;
}
return ret;
}
int n , q , l;
string s;
bitset<1000000020> mark[2];
int pp[2][MAXN] , inv[2][MAXN] , hsh[2][MAXN];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |