Submission #1198640

#TimeUsernameProblemLanguageResultExecution timeMemory
1198640KebabuVaikis15Nile (IOI24_nile)C++20
6 / 100
19 ms2632 KiB
#include "nile.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
                                       std::vector<int> B, std::vector<int> E) {
  int Q = (int)E.size(), N = W.size();
  std::vector<long long> R(Q, 0);
  long long s=0;
  int minD=INT_MAX;
  for (int i=0; i<N; i++)
  {
      minD=min(minD, A[i]-B[i]);
      s+=B[i];
  }
  if (N%2==1)
    s+=minD;
  for (int i=0; i<Q; i++)
      R[i]=s;
  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...