# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153978 | pit4h | Horses (IOI15_horses) | C++14 | 295 ms | 43932 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 "horses.h"
#define ll long long
using namespace std;
const int mod = 1e9+7, base = (1<<20), N = 5e5+1;
ll tree[2*base+1], push[2*base+1], x[N], y[N];
ll fastpow(ll a, ll b) {
if(b==0) {
return 1;
}
ll c = fastpow(a, b/2);
if(b%2==0) {
return (c*c)%mod;
}
else {
return ((c*c)%mod*a)%mod;
}
}
ll inv(ll num) {
return fastpow(num, mod-2);
}
void PUSH(int id, ll val) {
tree[id]=(tree[id]*val)%mod;
push[id]=(push[id]*val)%mod;
}
ll multiply(int id, int L, int R, int l, int r, ll val) {
if(L>r || R<r) {
return tree[id];
}
if(l<=L && r>=R) {
# | 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... |