| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1348805 | ElayV13 | Horses (IOI15_horses) | C++20 | 1595 ms | 4100 KiB |
#include "horses.h"
#include "bits/stdc++.h"
using namespace std;
const int mod=1e9+7;
int init(int N,int X[],int Y[])
{
for(int bp=0;bp<N;bp++){
int cur=1;
bool br=1;
for(int j=bp+1;j<N;j++){
cur*=X[j];
if(cur*Y[j]>Y[bp]) br=0;
}
if(br){
int res=1;
for(int j=0;j<=bp;j++){
res*=X[j];
res%=mod;
if(j==bp){
res*=Y[j];
res%=mod;
}
}
return res;
}
}
}
int updateX(int pos,int val)
{
}
int updateY(int pos,int val)
{
}
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... | ||||
