| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347342 | sdkjflkjsldkfj | 나일강 (IOI24_nile) | C++20 | 13 ms | 2608 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector<ll> calculate_costs(vector<int>w,vector<int>a,vector<int>b,vector<int>e){
//subtask 2
/*
sum = sum of b[i] over all indexes
case 1: 2|n -> return sum
case 2:
*/
ll sum=0;
int n=w.size();
int q=e.size();
for(int i=0;i<n;i++) sum+=b[i];
if(n%2==0){
vector<ll> ans(q,sum);
return ans;
}
int mn=0;
for(int i=0;i<n;i++) if(a[mn]-b[mn]>a[i]-b[i]) mn=i;
int mn_2=0;
for(int i=0;i<n;i+=2) if(a[mn_2]-b[mn_2]>a[i]-b[i]) mn_2=i;
vector<ll>ans(q);
for(int i=0;i<q;i++){
if(e[i]!=1) ans[i]=sum+a[mn]-b[mn];
else ans[i]=sum-b[mn_2]+a[mn_2];
}
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... | ||||
