# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768644 | amirhoseinfar1385 | Dabbeh (INOI20_dabbeh) | C++17 | 928 ms | 132552 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>
using namespace std;
const long long maxn=500000+10;
vector<pair<long long ,long long>>allv[maxn];
long long mp[maxn],base=131,mod=2000000357,ps[maxn],maxa[maxn],sz,rev[maxn];
long long m,n;
string s;
long long lca[20][maxn];
long long mod2=1e9+7,mp2[maxn],rev2[maxn],ps2[maxn];
long long mypow2(long long m,long long y){
if(y==0){
return 1;
}
long long p=mypow2(m,(y>>1));
p*=p;
p%=mod2;
if(y&1){
p*=m;
p%=mod2;
}
return p;
}
long long mypow(long long m,long long y){
if(y==0){
return 1;
}
long long p=mypow(m,(y>>1));
p*=p;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |