# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928409 | VMaksimoski008 | Horses (IOI15_horses) | C++14 | 205 ms | 101264 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;
using ll = long long;
using Node = pair<double, int>;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;
int n;
vector<int> X(5*maxn), Y(5*maxn), PS(5*maxn);
vector<double> logX(5*maxn), logY(5*maxn), PL(5*maxn);
Node merge(Node a, Node b) {
if(a.first > b.first) return a;
return b;
}
struct SegTree {
int N;
vector<ll> prod;
vector<Node> tree;
vector<double> lazy;
void init() {
N = n;
prod.resize(5*N+5);
tree.resize(5*N+5);
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... |