Submission #224615

#TimeUsernameProblemLanguageResultExecution timeMemory
224615AASGRice Hub (IOI11_ricehub)C++11
0 / 100
1079 ms7680 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B){
    long adr[L+10];
    memset(adr,0,sizeof(adr));
    for(long i=0;i<R;i++)adr[X[i]]=1;
    long mx=0;
  for(long i=1;i<=L;i++){
        long au=0;
        long long ab=B;
    for(long l=i;l<=L;l++){
        if(adr[l]>0 && ab-abs(i-l)>=0){au++;ab=ab-abs(i-l);}
    }
    for(long l=i-1;l>0;l--){
        if(adr[l]>0 && ab-abs(i-l)>=0){au++;ab=ab-abs(i-l);}
    }
    mx=max(mx,au);
  }
  R=mx;
  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...