oj.uz

Submission #890485

# Submission time Handle Problem Language Result Execution time Memory
890485 2023-12-21T10:13:49 Z irmuun Self Study (JOI22_ho_t2) C++17
0 / 100
 437 ms 13268 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m;
    cin>>n>>m;
    ll a[n+5],b[n+5];
    for(ll i=1;i<=n;i++){
        cin>>a[i];
    }
    for(ll i=1;i<=n;i++){
        cin>>b[i];
        a[i]=max(a[i],b[i]);
    }
    ll l=0,r=1e18;
    ll need[n+5];
    while(l<r){
        ll mid=(l+r+1)/2;
        fill(need+1,need+n+1,mid);
        ll left=0;
        for(ll i=1;i<=n;i++){
            ll x=min((need[i]+a[i]-1)/a[i],m);
            need[i]-=x*a[i];
            left+=m-x;
        }
        ll cur=0;
        for(ll i=1;i<=n;i++){
            if(need[i]>0){
                cur+=(need[i]+b[i]-1)/b[i];
            }
        }
        if(cur<=left){
            l=mid;
        }
        else{
            r=mid-1;
        }
    }
    cout<<l;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 344 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 4 ms 604 KB Output is correct
11 Correct 217 ms 13144 KB Output is correct
12 Correct 219 ms 13268 KB Output is correct
13 Correct 224 ms 11088 KB Output is correct
14 Incorrect 437 ms 11284 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 112 ms 6740 KB Output is correct
10 Correct 74 ms 4708 KB Output is correct
11 Correct 56 ms 3572 KB Output is correct
12 Correct 45 ms 2908 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 8 ms 584 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 344 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 4 ms 604 KB Output is correct
11 Correct 217 ms 13144 KB Output is correct
12 Correct 219 ms 13268 KB Output is correct
13 Correct 224 ms 11088 KB Output is correct
14 Incorrect 437 ms 11284 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 112 ms 6740 KB Output is correct
10 Correct 74 ms 4708 KB Output is correct
11 Correct 56 ms 3572 KB Output is correct
12 Correct 45 ms 2908 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 8 ms 584 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 344 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 4 ms 604 KB Output is correct
11 Correct 217 ms 13144 KB Output is correct
12 Correct 219 ms 13268 KB Output is correct
13 Correct 224 ms 11088 KB Output is correct
14 Incorrect 437 ms 11284 KB Output isn't correct
15 Halted 0 ms 0 KB -