제출 #241069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241069		lakshith_	쌀 창고 (IOI11_ricehub)	C++14	17 / 100	1077 ms	1012 KiB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
#define ll long long
#define pb push_back

using namespace std;

inline ll min(ll a,ll b){
  return a<b?a:b;
}

inline ll max(ll a,ll b){
  return a<b?b:a;
}

inline ll abs(ll a,ll b){
  return max(a,b)-min(a,b);
}

int besthub(int r,int l,int x[],ll b){
  int MAX = 0;
  for(int i=0;i<r;i++){
    vector<ll> vec;
    for(int j=0;j<r;j++){
      vec.pb(abs(x[i],x[j]));
    }
    sort(vec.begin(),vec.end());
    int Count = 0;
    ll cost = b;
    while(true){
      if(vec[Count]<=cost)
        cost -= vec[Count++];
      else 
        break;
    }
    MAX = max(MAX,Count);
  }
  return MAX;
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32