oj.uz

Submission #528138

# Submission time Handle Problem Language Result Execution time Memory
528138 2022-02-19T11:27:11 Z doowey Self Study (JOI22_ho_t2) C++14
0 / 100
 269 ms 5028 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)3e5 + 10;
ll A[N];
ll B[N];

ll ceil(ll x, ll y){
    return (x + y - 1) / y;
}

int main(){
    fastIO;
    //freopen("in.txt","r",stdin);
    ll m;
    int n;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++ ){
        cin >> A[i];
    }
    for(int i = 1; i <= n; i ++ ){
        cin >> B[i];
    }
    for(int i = 1; i <= n; i ++ ){
        A[i] = max(A[i], B[i]);
    }
    ll li = 1;
    ll ri = (ll)1e17;
    ll mid;
    ll have = 0;
    ll need = 0;
    ll take;
    ll rem;
    while(li + 1 < ri){
        mid = (li + ri) / 2ll;
        have = 0;
        for(int i = 1; i <= n; i ++ ){
            if(mid <= A[i] * 1ll * m){
                have += ceil(mid, A[i]);
            }
            else{
                have += m + ceil(mid - A[i] * 1ll * m, B[i]);
            }
        }
        if(have <= n * 1ll * m){
            li = mid;
        }
        else{
            ri = mid;
        }
    }
    cout << li << "\n";
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:40:8: warning: unused variable 'need' [-Wunused-variable]
   40 |     ll need = 0;
      |        ^~~~
Main.cpp:41:8: warning: unused variable 'take' [-Wunused-variable]
   41 |     ll take;
      |        ^~~~
Main.cpp:42:8: warning: unused variable 'rem' [-Wunused-variable]
   42 |     ll rem;
      |        ^~~

Subtask #1
0 / 10.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 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 148 ms 4948 KB Output is correct
12 Correct 151 ms 5028 KB Output is correct
13 Correct 144 ms 4932 KB Output is correct
14 Incorrect 269 ms 4972 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 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 74 ms 2600 KB Output is correct
10 Correct 50 ms 1872 KB Output is correct
11 Correct 37 ms 1448 KB Output is correct
12 Correct 32 ms 1272 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 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Incorrect 4 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 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 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 148 ms 4948 KB Output is correct
12 Correct 151 ms 5028 KB Output is correct
13 Correct 144 ms 4932 KB Output is correct
14 Incorrect 269 ms 4972 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 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 74 ms 2600 KB Output is correct
10 Correct 50 ms 1872 KB Output is correct
11 Correct 37 ms 1448 KB Output is correct
12 Correct 32 ms 1272 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 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Incorrect 4 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 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 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 148 ms 4948 KB Output is correct
12 Correct 151 ms 5028 KB Output is correct
13 Correct 144 ms 4932 KB Output is correct
14 Incorrect 269 ms 4972 KB Output isn't correct
15 Halted 0 ms 0 KB -