Submission #880165

# Submission time Handle Problem Language Result Execution time Memory
880165 2023-11-28T22:57:15 Z andro Rice Hub (IOI11_ricehub) C++14
42 / 100
1000 ms 1064 KB
#include <bits/stdc++.h>

#include "ricehub.h"

using namespace std;
int besthub(int R, int L, int X[], long long B){
    int ans=0;
    for(int i=1;i<=R;i++){
        vector<int>v;
        for(int j=1;j<=R;j++){
            v.push_back(abs(X[j]-X[i]));
        }
        sort(v.begin(),v.end());
        int u=0;
        int c=0;
        for(auto it:v){
            c+=it;
            if(c>B)break;
            u++;
        }
        ans=max(ans,u);
    }
    return ans;
}
/*
signed main(){
    int X[4]={0,10,12,14};
    cout<<besthub(3,14,X,6);
}*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 7 ms 348 KB Output is correct
24 Correct 7 ms 344 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 7 ms 448 KB Output is correct
27 Correct 7 ms 444 KB Output is correct
28 Correct 7 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 24 ms 348 KB Output is correct
4 Correct 24 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 15 ms 348 KB Output is correct
8 Correct 15 ms 468 KB Output is correct
9 Correct 6 ms 348 KB Output is correct
10 Correct 6 ms 348 KB Output is correct
11 Correct 19 ms 468 KB Output is correct
12 Correct 19 ms 440 KB Output is correct
13 Correct 32 ms 500 KB Output is correct
14 Correct 32 ms 532 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 18 ms 452 KB Output is correct
18 Correct 18 ms 348 KB Output is correct
19 Correct 31 ms 348 KB Output is correct
20 Correct 30 ms 344 KB Output is correct
21 Correct 612 ms 524 KB Output is correct
22 Correct 635 ms 516 KB Output is correct
23 Execution timed out 1045 ms 344 KB Time limit exceeded
24 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1036 ms 1064 KB Time limit exceeded
2 Halted 0 ms 0 KB -