oj.uz

Submission #743124

# Submission time Handle Problem Language Result Execution time Memory
743124 2023-05-17T08:14:35 Z vjudge1 Rice Hub (IOI11_ricehub) C++17
42 / 100
 1000 ms 724 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
priority_queue<long long, vector<long long>, greater<long long>> q;
int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  for(int i=0;i<R;i++) {
    while (!q.empty()) q.pop();
    for(int j=0;j<R;j++) {
      q.push(abs(X[i] - X[j]));
    }
    long long cou = 0;
    int now = 0;
    while (!q.empty()) {
      long long t = q.top(); q.pop();
      cou += t;
      if (cou>B) break;
      now++;
    }
    ans = max(ans, now);
  }
  
  return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 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 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 11 ms 212 KB Output is correct
22 Correct 10 ms 316 KB Output is correct
23 Correct 15 ms 212 KB Output is correct
24 Correct 15 ms 312 KB Output is correct
25 Correct 16 ms 212 KB Output is correct
26 Correct 16 ms 320 KB Output is correct
27 Correct 15 ms 212 KB Output is correct
28 Correct 15 ms 320 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 53 ms 212 KB Output is correct
4 Correct 56 ms 212 KB Output is correct
5 Correct 10 ms 212 KB Output is correct
6 Correct 9 ms 312 KB Output is correct
7 Correct 53 ms 212 KB Output is correct
8 Correct 53 ms 212 KB Output is correct
9 Correct 20 ms 212 KB Output is correct
10 Correct 14 ms 212 KB Output is correct
11 Correct 38 ms 212 KB Output is correct
12 Correct 38 ms 212 KB Output is correct
13 Correct 62 ms 212 KB Output is correct
14 Correct 66 ms 304 KB Output is correct
15 Correct 15 ms 316 KB Output is correct
16 Correct 14 ms 324 KB Output is correct
17 Correct 39 ms 212 KB Output is correct
18 Correct 38 ms 316 KB Output is correct
19 Correct 67 ms 316 KB Output is correct
20 Correct 60 ms 320 KB Output is correct
21 Execution timed out 1070 ms 340 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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