oj.uz

Submission #703398

# Submission time Handle Problem Language Result Execution time Memory
703398 2023-02-27T09:00:07 Z Aestivate Self Study (JOI22_ho_t2) C++17
0 / 100
 328 ms 9980 KB 
#include<bits/stdc++.h>
#include<random>
using namespace std;

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

#define float double
#define ss(n) fixed<<setprecision(n) 
#define ll long long
#define int ll
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define rep(i,a) for(int i=1;i<=a;i++)
#define rep0(i,a) for(int i=0;i<a;i++)
#define F first
#define S second
#define uni(a) a.resize(distance(a.begin(),unique(a.begin(),a.end())));
#define unisort(a) sort(a.begin(),a.end()); uni(a);

ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}

const ld pi=3.14159265358979323846264338327950288419716939931;
const int lar=3e18;
const int mol1=1e9+7;
const int mol2=998244353;


void solve()
{
    int n,m;
    cin>>n>>m;
    int a[n+1],b[n+1];
    rep(i,n) cin>>a[i];
    rep(i,n) cin>>b[i];
    int ans=lar;
    rep(i,n){
        ans=min(ans,max(a[i],b[i]));
    }
    int l=m,r=8e18;
    while(l<r){
        int tt=0;
        int mid=l+r+1>>1;
        rep(i,n){
            if(a[i]>b[i]){
                if(a[i]*m>=mid){
                    tt+=(mid/a[i])+(mid%a[i]?1:0);
                }
                else{
                    tt+=m;
                    int g1=mid-a[i]*m;
                    tt+=(g1/b[i])+(g1%b[i]?1:0);
                }
            }
            else{
                tt+=(mid/b[i])+(mid%b[i]?1:0);
            }
        }
        if(tt<=n*m) {
            l=mid;
        }
        else{
            r=mid-1;
        }
    }
    if(l>ans)
    assert(l==ans);
    cout<<l<<"\n";
    
}

signed main()
{
    IO
    solve();
    return 0;
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:46:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |         int mid=l+r+1>>1;
      |                 ~~~^~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 176 ms 5000 KB Output is correct
12 Correct 184 ms 4948 KB Output is correct
13 Correct 158 ms 4996 KB Output is correct
14 Runtime error 328 ms 9980 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 176 ms 5000 KB Output is correct
12 Correct 184 ms 4948 KB Output is correct
13 Correct 158 ms 4996 KB Output is correct
14 Runtime error 328 ms 9980 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 176 ms 5000 KB Output is correct
12 Correct 184 ms 4948 KB Output is correct
13 Correct 158 ms 4996 KB Output is correct
14 Runtime error 328 ms 9980 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -