oj.uz

답안 #756541

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756541 2023-06-11T20:53:49 Z michao Self Study (JOI22_ho_t2) C++14
0 / 100
 1 ms 328 KB 
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=3e5+5;
const int inf=(int)1e18+9;
int a[MAX],b[MAX];
int n,m;
int gora(int x,int y){
  if (x%y==0)return x/y;
  return x/y+1;
}
bool check(int mid){
  int balans=0;
  for (int i=1;i<=n;i++){
    int wale=max(a[i],b[i]);
    int need=gora(mid,wale);
    if (need<m)balans+=m-need;
    else{
      int sum=mid-wale*m;
      int odejmij=gora(sum,b[i]);
      balans-=odejmij;
    }
  }
  return balans>=0;
}
int32_t main()
{
  BOOST;
  cin>>n>>m;
  for (int i=1;i<=n;i++)cin>>a[i];
  for (int i=1;i<=n;i++)cin>>b[i];
  int ip=0,ik=inf;
  while (ip+1<ik){
    int mid=(ip+ik)>>1;
    if (check(mid))ip=mid;
    else ik=mid;
  }
  cout<<ip;
  return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 328 KB Output isn't correct
2 Halted 0 ms 0 KB -