Submission #1231446

#TimeUsernameProblemLanguageResultExecution timeMemory
1231446omarpaladines95Nile (IOI24_nile)C++20
6 / 100
19 ms4540 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

long long Z(vector<int> V) {
    long long sum=0;
    for (int i=0; i<V.size(); i++) {
        sum+=V[i];
    }
    return sum;
}

long long Min(vector<long long> V) {
    int m=V[0];
    for (int i=1; i<V.size(); i++) {
        if (V[i] < m) {
            m = V[i];
        }
    }
    return m;
}

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();
  int n = (int)A.size();
  std::vector<long long> R(Q, 0);
  vector<long long> C;
  for (int i=0; i<n; i++) {
    C.push_back(A[i]-B[i]);
  }
  long long ans;
  if (n%2==0) {
    ans = Z(B);
  } else {
    ans = Z(B)+Min(C);
  }
  for (int i=0; i<Q; i++) {
    R[i]=(ans);
  }
  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...