Submission #1223259

#TimeUsernameProblemLanguageResultExecution timeMemory
1223259adriines06나일강 (IOI24_nile)C++20
17 / 100
2095 ms4164 KiB
#include "nile.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
                                       std::vector<int> B, std::vector<int> E) {
  int N=(int)W.size();
  int Q = (int)E.size();
  std::vector<long long> R(Q, 0);
  sort(W.begin(),W.end());

  for(int j=0;j<Q;j++){
    ll ans=0;
    for(int i=0;i<N;i++){
      //cout<<i<<" ";
      if(i!=N-1){
        if(W[i+1]-W[i]<=E[j]){
          ans+=2;
          i++;
        }
        else{
          ans+=2;
        }
      }
      else ans+=2;
      //cout<<ans<<"\n";
    }
    R[j]=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...