| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357122 | ezzzay | Horses (IOI15_horses) | C++20 | 12 ms | 4524 KiB |
#include "horses.h"
#include<bits/stdc++.h>
using namespace std;
int init(int N, int X[], int Y[]) {
int p=1;
int mx=1;
for(int i=0;i<N;i++){
p=p*X[i];
mx=max(mx,p*Y[i]);
}
return mx;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
