oj.uz

Submission #283691

# Submission time Handle Problem Language Result Execution time Memory
283691 2020-08-26T05:38:00 Z khangal Rice Hub (IOI11_ricehub) C++14
42 / 100
 1000 ms 29992 KB 
#include<bits/stdc++.h>
#include "ricehub.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
int besthub(int N, int L, int *X, long long B){
    n = N;
    for(int k=0;k<L;k++){
        vector<int> vec;
        for(int i=0;i<n;i++){
            vec.pb(abs(k-X[i]));
        }
        sort(vec.begin(),vec.end());
        ll cnt=0,cost=0;
        for(int j=0; j<n; j++){
            if(cost + vec[j] <= B) {cost += vec[j]; cnt++;}
            else break;
        }
        ans=max(ans,cnt);
    }
    return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 20 ms 29312 KB Output is correct
3 Correct 21 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 20 ms 29312 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 20 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 21 ms 29312 KB Output is correct
6 Correct 21 ms 29312 KB Output is correct
7 Correct 22 ms 29312 KB Output is correct
8 Correct 22 ms 29312 KB Output is correct
9 Correct 20 ms 29312 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 21 ms 29440 KB Output is correct
12 Correct 20 ms 29312 KB Output is correct
13 Correct 20 ms 29312 KB Output is correct
14 Correct 24 ms 29312 KB Output is correct
15 Correct 21 ms 29312 KB Output is correct
16 Correct 27 ms 29312 KB Output is correct
17 Correct 20 ms 29312 KB Output is correct
18 Correct 20 ms 29312 KB Output is correct
19 Correct 23 ms 29364 KB Output is correct
20 Correct 22 ms 29312 KB Output is correct
21 Correct 27 ms 29312 KB Output is correct
22 Correct 28 ms 29312 KB Output is correct
23 Correct 131 ms 29312 KB Output is correct
24 Correct 140 ms 29380 KB Output is correct
25 Correct 126 ms 29312 KB Output is correct
26 Correct 125 ms 29384 KB Output is correct
27 Correct 119 ms 29432 KB Output is correct
28 Correct 112 ms 29384 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 29384 KB Output is correct
2 Correct 54 ms 29312 KB Output is correct
3 Execution timed out 1101 ms 29312 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 1094 ms 29992 KB Time limit exceeded
2 Halted 0 ms 0 KB -