제출 #1230767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1230767		mathias_abadie	Nile (IOI24_nile)	C++20	0 / 100	17 ms	2632 KiB

nile

#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;
    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) {
            total_cost += B[i];   
            }
        long long x = 0;
        for (int i = 0; i < N; ++i) {
            int repetidor = 1;
            repetidor += i;
            
            if ((repetidor%2)== 0)continue;
                x =  total_cost - B[i] + A[i];
            if (x < min_cost){
                min_cost = x;
            }
        }
        total_cost=min_cost;

    }

   vector<long long> R(Q, total_cost);
   return R;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 13
• Subtask 3: 0 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18