제출 #1347307

#제출 시각아이디문제언어결과실행 시간메모리
1347307sdkjflkjsldkfj나일강 (IOI24_nile)C++20
0 / 100
13 ms2608 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 1
    //if n even then put everyone together
    //if n odd then put the minimum a[i] alone and others together
    ll sum=0;
    int n=b.size();
    int q=e.size();
    for(int i=0;i<n;i++) sum+=b[i];
    if(n%2==1){
        int mn=0; //index of min a[i]
        for(int i=0;i<n;i++){
            if(a[mn]>a[i]) mn=i;
        }
        sum-=b[mn];
        sum+=a[mn];
    }
    vector<ll> ans(q,sum);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...