| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1247197 | SpyrosAliv | Horses (IOI15_horses) | C++20 | 22 ms | 8536 KiB |
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
vector<int> x, y;
int init(int N, int X[], int Y[]) {
n = N;
for (int i = 0; i < n; i++) {
x.push_back(X[i]);
y.push_back(Y[i]);
}
int ans = 0;
int tot = 1;
for (int i = 0; i < n; i++) {
ans = max(ans, tot * y[i]);
tot *= 2;
}
return ans;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
| # | 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... | ||||
