# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139552 | Plurm | Horses (IOI15_horses) | C++11 | 539 ms | 115672 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;
multimap<long double, int> mm;
const int MOD = 1e9+7;
long double FT1[500005];
int FT2[500005];
int modpow(int base, int expo){
if(expo == 0) return 1;
int res = modpow(base, expo/2);
if(expo % 2 == 0){
return (1ll * res * res) % MOD;
}else{
return 1ll * ((1ll * res * res) % MOD) * base % MOD;
}
}
int invmod(int x){
return modpow(x, MOD-2);
}
void sub(int idx, int amt){
idx++;
while(idx < 500005){
FT1[idx] -= log2l(amt);
FT2[idx] = (1ll * FT2[idx] * invmod(amt)) % MOD;
idx += idx & -idx;
}
}
void add(int idx, int amt){
idx++;
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... |