| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1336415 | ariuk | 나일강 (IOI24_nile) | C++20 | 18 ms | 2608 KiB |
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A,
vector<int> B, vector<int> E) {
int Q = (int)E.size();
vector<long long> R(Q, 0);
int mn = INT_MAX;
int idx = 0;
for(int i = 0; i < A.size(); i++){
if(A[i] < mn) mn = A[i], idx = i;
}
int res = A[idx];
for(int i = 0; i < B.size(); i++){
if(i != idx){
res += B[i];
}
}
for(int i = 0; i < Q; i++){
R[i] = res;
}
return R;
}
// 1 1 1 1 1
// 5 4 5 6 3
// 1 2 2 3 2
// 5 9 1
// 1 2 2 2 3
// 5 4 5 3 6
// 5 9 1
// 3 4 5 5 6
// 2 2 1 2 3 - > 3 2 1 2 3
// for all n values -> same
// b[i] + b[j] > a[i] + a[j]
// b[i] < a[i]
// min(b[i] + b[j], a[i] + a[j]);
// min a[i] + rest b[j]?
| # | 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... | ||||
