| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1186249 | jasonic | Horses (IOI15_horses) | C++20 | 16 ms | 4932 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)
#define MOD 1000000007
ll init(int N, int X[], int Y[]) {
ll ans = 0;
ll cnt = 1;
for(int i = 0; i < N; i++) {
cnt *= X[i];
ans = max(ans, cnt * Y[i]);
}
return ans;
}
ll updateX(int i, int v) {
return i;
}
ll updateY(int i, int v) {
return i;
}
| # | 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... | ||||
