제출 #830028

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
830028	2023-08-18 17:45:18	OAleksa	쌀 창고 (IOI11_ricehub)	C++14	42 / 100	1085 ms	660 KiB

ricehub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "ricehub.h"
#define f first
#define s second
using namespace std; 
int besthub(int R, int L, int X[], long long B)
{
    int n = R;
    int a[n];
    for(int i = 0;i < n;i++)
      a[i] = X[i];
  int ans = 0;
  for(int i = 0;i < n;i++) {
    multiset<int> st;
    for(int j = i;j >= 0;j--) {
      if(a[i] - a[j] > B)
        break;
      st.insert(abs(a[j] - a[i]));
    }
    for(int j = i + 1;j < n;j++) {
      if(a[j] - a[i] > B)
        break;
      st.insert(abs(a[j] - a[i]));
    }
    int res = 0;
    long long t = 0;
    for(auto x : st) {
      if(t + x <= B) {
        t += x;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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