# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62316 | nvmdava | Horses (IOI15_horses) | C++17 | 516 ms | 62652 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>
#define SIZE 500100
#define INF 1<<30
#define MOD 1000000007
using namespace std;
long long mult[SIZE * 3];
int maxLoc[SIZE * 3];
long double lazy[SIZE * 3], A[SIZE], maxValue[SIZE * 3];
int X[SIZE], Y[SIZE], N;
void update(int id, int l, int r, int k){
if(l == k && r == k){
mult[id] = X[k];
return;
}
int m = (l + r) >> 1;
if(m >= k){
update(id << 1, l, m, k);
} else {
update(id << 1 | 1, m + 1, r, k);
}
mult[id] = mult[id << 1] * mult[id << 1 | 1] % MOD;
}
void add(int id,int l, int r,int L,int R, long double diff){
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... |