| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333758 | marzuq01 | Nile (IOI24_nile) | C++20 | 17 ms | 2608 KiB |
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
std::vector<int> B, std::vector<int> E) {
int q = (int)E.size();
int n = (int)W.size();
std::vector<long long> r(q, 0);
//case 1: wi = 1
int sum = 0;
for (auto i: B) sum += i;
int mini = A[0] - B[0];
for (int i = 0; i < n;i++) mini = min(mini,A[i] - B[i]);
if (n % 2 == 0) sum += mini;
for (auto &i: r) i = sum;
return r;
}
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
