# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
175741 | _Enkognit | Bigger segments (IZhO19_segments) | C++14 | 119 ms | 24824 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>
#define ll long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pll pair<ll,ll>
#define y1 Enkognit
#define fi first
#define se second
#define pld pair<ld,ld>
using namespace std;
const ll MOD=1000000007;
ll l, r, n, m, k, x, y, a[1000001], bst[1000001], pr[1000001];
pll dp[1000001];
ll tt[1000001];
vector <ll> an;
ll binpow(ll h,ll r)
{
ll l=1;
while (r)
{
if (r&1) l*=h,l%=MOD;
h*=h;
h%=MOD;
r/=2;
}
# | 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... |