Submission #467657

#TimeUsernameProblemLanguageResultExecution timeMemory
467657jam_xd_Rice Hub (IOI11_ricehub)C++17
42 / 100
1086 ms460 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; //si solo era esto me muero >:v. int besthub(int R, int L, int X[], long long B) { int suma_d=0, campos=0; int jamon=0;//auxiliar for(int i=0;i<R;i++){ deque<int>diferencias; for(int j=0;j<R;j++){ int dif=0; /*dif = i-X[j]; if(dif <= 0)dif = dif * -1; */ dif = abs(X[i]-X[j]); diferencias.push_back(dif); } sort(diferencias.begin(), diferencias.end()); for(int k=0;k<diferencias.size();k++){ if(suma_d + diferencias[k] <= B){ suma_d = suma_d + diferencias[k]; campos++; }else break; } int maximo = max(jamon, campos); jamon = maximo; suma_d=0; campos=0; //comparar anterior y el de ahora //y me quedo con el mayor. } return jamon; }

Compilation message (stderr)

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:25:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   for(int k=0;k<diferencias.size();k++){
      |               ~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...