# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154143 | popovicirobert | Horses (IOI15_horses) | C++14 | 1153 ms | 114896 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 "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int) 1e9 + 7;
const int MAXN = (int) 5e5;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
static int X[MAXN + 1], Y[MAXN + 1];
static int n;
struct Node {
int rem, lazy_rem;
long double mx, lazy;
}aint[4 * MAXN];
inline void refresh(int nod) {
if(aint[2 * nod + 1].mx + aint[2 * nod + 1].lazy > aint[2 * nod + 2].mx + aint[2 * nod + 2].lazy) {
aint[nod].mx = aint[2 * nod + 1].mx + aint[2 * nod + 1].lazy;
aint[nod].rem = (1LL * aint[2 * nod + 1].rem * aint[2 * nod + 1].lazy_rem) % MOD;
Compilation message (stderr)
# | 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... |