# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
599096 | sofapuden | Horses (IOI15_horses) | C++14 | 246 ms | 133488 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"
using namespace std;
typedef long long ll;
const ll M = 1e9+7;
struct seg2 {
struct nod {
ll val;
ll val2;
};
int n;
vector<nod> st;
vector<ll> A;
seg2() {}
seg2(int sz) : n(sz), st(4*n) {}
seg2(vector<ll> &in) : seg2((int)in.size()) {
A = in;
build(0,n-1,1);
}
nod merge (nod a, nod b) {
nod c;
c.val = min(1ll<<30,a.val)*min(1ll<<30,b.val);
c.val2 = a.val2*b.val2%M;
return c;
# | 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... |