oj.uz

Submission #534142

# Submission time Handle Problem Language Result Execution time Memory
534142 2022-03-08T01:35:48 Z PixelCat Self Study (JOI22_ho_t2) C++14
0 / 100
 221 ms 2652 KB 
#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forr(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define eb emplace_back
#define INF (LL)(9e18)
#define int __int128_t
using namespace std;
using LL=long long;
using pii=pair<int,int>;

const int MAXN=300030;

int a[MAXN];
int b[MAXN];

bool check(int n,int m,int tar){
    int s=0;
    For(i,1,n){
        s+=(tar+a[i]-1)/a[i];
    }
    return s<=n*m;
}

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    // OAO
    LL n,m; cin>>n>>m;
    For(i,1,n){
        LL t; cin>>t;
        a[i]=t;
    }
    int hi=1e18+10;
    hi=hi*hi;
    int lo=0;
    while(hi-lo>1){
        int mi=lo+(hi-lo)/2;
        if(check(n,m,mi)) lo=mi;
        else hi=mi;
    }
    cout<<(LL)lo<<"\n";
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 221 ms 2652 KB Output is correct
10 Correct 145 ms 1872 KB Output is correct
11 Correct 109 ms 1484 KB Output is correct
12 Correct 89 ms 1244 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Incorrect 17 ms 332 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 221 ms 2652 KB Output is correct
10 Correct 145 ms 1872 KB Output is correct
11 Correct 109 ms 1484 KB Output is correct
12 Correct 89 ms 1244 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Incorrect 17 ms 332 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -