# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66222 | daniel_02 | Horses (IOI15_horses) | C++17 | 1046 ms | 411620 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 ll long long
#define fr first
#define sc second
#define double long double
using namespace std;
const int MOD = 1e9 + 7;
const int sz = 5e6 + 7;
ll n, x[sz], y[sz];
pair<double, ll> t[sz * 2], ad[sz * 2], an[sz];
pair<double, ll> maxp(pair<double, ll> a, pair<double, ll> b)
{
if (a.fr > b.fr)
{
return a;
}
else
{
return b;
}
}
ll bin_pow(ll a, ll k)
{
if (k == 1)return a;
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... |