# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835777 | MohamedAliSaidane | Sumtree (INOI20_sumtree) | C++14 | 72 ms | 14500 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;
typedef long long ll;
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
ll MOD = 1e9 + 7;
ll mod(ll x, ll m = MOD){return (x + m)%m;}
const int nax= 2e5 + 5;
const int rax= 3e5 + 5;
ll fact[2 * rax];
ll binpow(ll a, ll b, ll m= MOD)
{
ll res = 1ll;
while(b)
{
if(b & 1)
res = mod(res * 1ll * a);
a = mod(a * 1ll * a);
b /= 2ll;
}
return res;
}
ll inv(ll x, ll m = MOD)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |