# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059057 | andrei_iorgulescu | Horses (IOI15_horses) | C++14 | 1310 ms | 51028 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;
int modulo = (int)1e9 + 7;
int lgpow(int lul1, int lul2)
{
int lul3 = 1;
while (lul2 != 0)
{
if (lul2 % 2 == 1)
lul3 = 1ll * lul3 * lul1 % modulo;
lul1 = 1ll * lul1 * lul1 % modulo;
lul2 /= 2;
}
return lul3;
}
int x[500005], y[500005];
int n;
set<int> grx;
int aint[2000005];
ll allx = 1;
void build(int nod, int l, int r)
{
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... |