# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247526 | ernestvw | Horses (IOI15_horses) | C++11 | 1590 ms | 75600 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;
using ll = long long;
const ll mod = 1e9 + 7;
int n;
vector<ll> C, P;
ll preprod = 1;
ll fp(ll x, ll y){
ll res=1;
while(y){
if(y%2LL)res*=x;
res%=mod;
x*=x;
x%=mod;
y/=2LL;
}
return res;
}
ll inv(ll x){return fp(x,mod-2LL);}
set<int> _indices, _negindices;
int prochain(int i) {
if(_indices.size() == 0 || i >= *_indices.rbegin()) return n;
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... |