oj.uz

Submission #820100

# Submission time Handle Problem Language Result Execution time Memory
820100 2023-08-10T19:18:07 Z nemethm Rice Hub (IOI11_ricehub) C++17
42 / 100
 1000 ms 864 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long int;

int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  for(int i = 1; i <= L; ++i){
    priority_queue<int> q;
    for(int j = 0; j < R; ++j){
      q.push(-abs(i - X[j]));
    }
    ll cost = 0;
    int actual = 0;
    while(!q.empty() && cost + (-q.top()) <= B){
      ++actual;
      cost += -q.top();
      q.pop();
    }
    ans = max(ans, actual);
  }
  return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 312 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 2 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 4 ms 212 KB Output is correct
23 Correct 142 ms 212 KB Output is correct
24 Correct 139 ms 316 KB Output is correct
25 Correct 142 ms 212 KB Output is correct
26 Correct 144 ms 308 KB Output is correct
27 Correct 65 ms 304 KB Output is correct
28 Correct 68 ms 300 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 320 KB Output is correct
2 Correct 14 ms 312 KB Output is correct
3 Execution timed out 1074 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1048 ms 864 KB Time limit exceeded
2 Halted 0 ms 0 KB -