oj.uz

답안 #595225

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595225 2022-07-13T12:52:24 Z PoPularPlusPlus Self Study (JOI22_ho_t2) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

void solve(){
	ll n , m;
	cin >> n >> m;
	ll arr[n] , b[n];
	for(int i = 0; i < n; i++)cin >> arr[i];
	for(int i = 0; i < n; i++)cin >> b[i];
	ll l = 1,  r = 1e7 , ans;
	while(l <= r){
		ll mid = (l + r)/2;
		ll chance = 0;
		for(int i = 0; i < n; i++){
			ll sum = max(arr[i] , b[i]) * m;
			if(sum <= mid){
				ll x = mid - sum;
				chance -= x / b[i] + remender(x , b[i]);
			}
			else {
				ll need = mid / max(arr[i] , b[i]) + remender(mid , max(arr[i] , b[i]));
				chance += m - need;
			}
			if(chance + n * m < 0)break;
		}
		if(chance >= 0){
			ans = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 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 0 ms 212 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 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -