| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333782 | marzuq01 | 나일강 (IOI24_nile) | C++20 | 24 ms | 3376 KiB |
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
#define lint long long
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
std::vector<int> B, std::vector<int> E) {
lint n = W.size();
lint q = E.size();
//wi = 1
lint sum = 0ll;
for (auto i: B) sum += i;
vector<lint> arr(n);
for (lint i = 0; i < n;i++) arr[i] = A[i] - B[i];
sort(arr.begin(),arr.end());
if (n % 2 == 1) sum += arr[0];
vector<lint> ans(q);
for (auto &i: ans) i = sum;
return ans;
}
| # | 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... | ||||
