Submission #1308028

#TimeUsernameProblemLanguageResultExecution timeMemory
1308028felirivera나일강 (IOI24_nile)C++20
0 / 100
18 ms2608 KiB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<ll> calculate_costs(
  vector<int> W,
  vector<int> A,
  vector<int> B,
  vector<int> E){
    
  int n = W.size();
  int w = 0;
  for (auto b : B){
    w += b;
  }
  
  if (n % 2 == 1){
    int minind = 0;
    ll dif = LLONG_MAX;
    
    for (int i = 0; i < n; i++){
      if (A[i] - B[i] < dif){
        dif = A[i] - B[i];
        minind = i;
      }
    }
    w -= B[minind];
    
    w += A[minind];
  }
  
  vector<ll> ans(E.size(), w);
  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...