oj.uz

Submission #820069

# Submission time Handle Problem Language Result Execution time Memory
820069 2023-08-10T18:47:00 Z nemethm Rice Hub (IOI11_ricehub) C++17
17 / 100
 1000 ms 736 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 = 0; i < R; ++i){
    priority_queue<int> q;
    for(int j = 0; j < R; ++j){
      q.push(-abs(X[i] - X[j]));
    }
    ll cost = 0;
    int actual = 0;
    while(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 312 KB Output is correct
2 Correct 0 ms 340 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 212 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Incorrect 44 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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