# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984246 | LucaIlie | Horses (IOI15_horses) | C++17 | 1567 ms | 46520 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;
const int MAX_N = 5e5;
const int MOD = 1e9 + 7;
struct AIB1 {
int aib[MAX_N + 1];
void init() {
for ( int i = 0; i <= MAX_N; i++ )
aib[i] = 1;
}
void update( int i, int x ) {
while ( i <= MAX_N ) {
aib[i] = (long long)aib[i] * x % MOD;
i += (i & -i);
}
}
int query( int i ) {
int p = 1;
while ( i > 0 ) {
p = (long long)p * aib[i] % MOD;
i -= (i & -i);
}
return p;
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... |