# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167385 | kostia244 | Horses (IOI15_horses) | C++17 | 477 ms | 50336 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>
using namespace std;
using ll = long long;
using vi = vector<int>;
const int mod = 1e9 + 7;
const int maxn = 1<<21;
int n, t[maxn], ans = 0;
set<int> chk;
ll mulal = 1;
vi x, ix, y;
void upd(int p, int v) {
for(t[p += n] = v; p>>=1;)
t[p] = max(t[p<<1], t[p<<1|1]);
}
int get(int l, int r) {
// cout << l << " " << r << " " << n << "q\n";
int ans = 0;
for(l+=n, r+=n+1; l < r; l>>=1, r>>=1) {
if(l&1) ans = max(ans, t[l++]);
if(r&1) ans = max(ans, t[--r]);
}
// cout << ans << "q\n";
return ans;
}
int bp(int a, int p) {
int r = 1;
while(p) {
if(p&1) r = (r*1ll*a)%mod;
a = (a*1ll*a)%mod;
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... |