| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1169482 | rayan_bd | 나일강 (IOI24_nile) | C++20 | 19 ms | 3400 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> calculate_costs(vector<int> W,vector<int> A,vector<int> B,vector<int> E){
vector<ll> ans;
int N = W.size(),mn_a=0;
ll tot=0;
for(int i=0;i<N;++i){
if(A[mn_a]>A[i]) mn_a=i;
tot+=B[i];
}
if(N&1) tot=A[mn_a]-B[mn_a];
ans.resize(N,tot);
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... | ||||
