Submission #1230687

#TimeUsernameProblemLanguageResultExecution timeMemory
1230687mathias_abadie나일강 (IOI24_nile)C++20
6 / 100
2092 ms2632 KiB
#include <bits/stdc++.h>
#include <climits>

using namespace std;

vector<long long> calculate_costs(
    vector<int> W, vector<int> A, vector<int> B, vector<int> E
) {
    int N = W.size();
    int Q = E.size();

    long long total_cost = 0;
    int num = 0;
    vector<int> v;
    if (N%2 == 0){

        for (int i = 0; i < N; ++i) {
           total_cost += B[i];
        }
    } else {
        long long min_cost = LLONG_MAX;
        for (int i = 0; i < N; ++i) {
            long long x= 0;
            for (int j = 0; j < N; ++j) {
                x +=  B[j];
            }
            x += A[i];
            x -= B[i];
            if (x < min_cost){
                min_cost = x;
            }
        }
        total_cost=min_cost;

    }

   vector<long long> R(Q, total_cost);
   return R;
}
#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...