제출 #1226788

#제출 시각아이디문제언어결과실행 시간메모리
1226788shiocan나일강 (IOI24_nile)C++20
0 / 100
20 ms2628 KiB
#include <bits/stdc++.h>
#include <cstdlib>
#include <stdlib.h>
using namespace std;
#define ull unsigned long long 
#define ld long double
#define ll long long
// #define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
int mod = 1e9 + 7; 
// const int inf = 1e18;
const int N = 1e5 + 50, K = 22;

#include "nile.h"

vector<long long> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e){
    vector<ll> ans;

    int n = a.size();
    int q = e.size();

    if(n & 1){
        int sum = 0;
        int mn = 1e9, idx = 0;
        for(int i = 0; i < n; i++)  
            if(a[i] < mn)
                mn = a[i], idx = i;

        sum = mn;
        for(int i = 0; i < n; i++)
            if(idx != i)
                sum += b[i];

        for(auto i : e)
            ans.push_back(sum);
    }
    else{
        int sum = 0;
        for(auto i : b)
            sum += i;

        for(auto i : e)
            ans.push_back(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...