| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1308028 | felirivera | 나일강 (IOI24_nile) | C++20 | 18 ms | 2608 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> calculate_costs(
vector<int> W,
vector<int> A,
vector<int> B,
vector<int> E){
int n = W.size();
int w = 0;
for (auto b : B){
w += b;
}
if (n % 2 == 1){
int minind = 0;
ll dif = LLONG_MAX;
for (int i = 0; i < n; i++){
if (A[i] - B[i] < dif){
dif = A[i] - B[i];
minind = i;
}
}
w -= B[minind];
w += A[minind];
}
vector<ll> ans(E.size(), w);
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... | ||||
