oj.uz

Submission #743342

# Submission time Handle Problem Language Result Execution time Memory
743342 2023-05-17T10:02:31 Z vjudge1 Rice Hub (IOI11_ricehub) C++17
42 / 100
 1000 ms 740 KB 
#include "ricehub.h"

#include<bits/stdc++.h>

using namespace std ;

using ll = long long ; 
using pii = pair<ll , ll> ; 

const int N = 1e6+5 ; 

ll qs[N] , ans ; 

int besthub(int R, int L, int X[], long long B)
{
  for(int i=0;i<L;i++){
        ll cnt = 0 , sum = 0 ;
        vector<int> mn ;
        for(int j=0;j<R;j++){
            mn.push_back(abs(i - X[j])) ;
        }
        sort(mn.begin() , mn.end());
        int j = 0 ;
        while(j < R){
            if(sum + mn[j] > B) break;
            sum += mn[j] ;
            j++;
            cnt++ ;
        }
        ans = max(ans , cnt) ;
    }
  
  
    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 0 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
25.0 / 25.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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 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 2 ms 212 KB Output is correct
16 Correct 2 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 3 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 7 ms 320 KB Output is correct
22 Correct 6 ms 320 KB Output is correct
23 Correct 88 ms 304 KB Output is correct
24 Correct 96 ms 300 KB Output is correct
25 Correct 89 ms 212 KB Output is correct
26 Correct 90 ms 296 KB Output is correct
27 Correct 74 ms 300 KB Output is correct
28 Correct 77 ms 300 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 212 KB Output is correct
2 Correct 33 ms 212 KB Output is correct
3 Execution timed out 1083 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 1069 ms 740 KB Time limit exceeded
2 Halted 0 ms 0 KB -