Submission #1245363

#TimeUsernameProblemLanguageResultExecution timeMemory
1245363CyberCowNile (IOI24_nile)C++20
17 / 100
2095 ms4188 KiB
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
using 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();
  vector<long long> R;
  sort(W.begin(), W.end());
  for(auto g: E)
  {
    int qan = 0, anc = -1;
    for (int i = 0; i < W.size(); i++)
    {
      if(anc == -1)
      {
        anc = W[i];
      }
      else
      {
        if(W[i] - anc <= g)
        {
          qan++;
          anc = -1;
        }
        else
        anc = W[i];
      }
    }
    R.push_back(2 * W.size() - 2 * qan);
  }
  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...