Submission #1351527

#TimeUsernameProblemLanguageResultExecution timeMemory
1351527scalifrastico_098Nile (IOI24_nile)C++20
0 / 100
13 ms2608 KiB
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<long long> calculate_costs(vector<int> w, vector<int> a,vector<int> b, vector<int> e) {
  int q = (int)e.size(), n=a.size(); vector<long long> r; 
  while(q--)
  {
    int y=0, k=INT_MAX, o; if(n%2==0){for(ll i=0; i<n; i++){y+=b[i];}}
    else{for(ll i=0; i<n; i++){y+=b[i]; if(a[i]<k){k=a[i]; o=b[i];}} y-=o; y+=k;}
    r.push_back(y);
  }
  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...