# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
989053 | crafticat | Horses (IOI15_horses) | C++17 | 655 ms | 107564 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>
using namespace std;
constexpr int MOD = 1e9 + 7;
using ll = __int128;
vector<int> x, y;
set<int> exists;
ll global = 1;
int n;
ll myPOW(ll a, ll b) {
if (b == 0) return 1;
ll v = myPOW(a, b / 2);
v *= v;
v %= MOD;
if (b % 2 == 1) v *= a;
v %= MOD;
return v;
}
ll inv(ll v) {
return myPOW(v, MOD - 2);
}
struct Segment {
Segment *left = nullptr, *right = nullptr;
int l, r, mid;
ll val = 1;
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... |