| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 150669 | Ragtag Volunteers (#200) | Crosses on the Grid (FXCUP4_cross) | C++17 | 89 ms | 3692 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 "cross.h"
#include <algorithm>
using namespace std;
using ll = long long;
long long SelectCross(const int k, std::vector<int> I, std::vector<int> O) {
const int n = I.size();
ll res = 0;
for (int i = 0; i < n; i++) {
res = max(res, ll(2 * O[i] - I[i]) * I[i]);
}
return res;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
