oj.uz

답안 #534347

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534347 2022-03-08T05:56:06 Z PikaQ Self Study (JOI22_ho_t2) C++17
0 / 100
 1 ms 312 KB 
#include<bits/stdc++.h>
#define forn(i,n) for(int i = 0;i < (n);i++)
#define Forn(i,n) for(int i = 1;i <= (n);i++)
#define all(p) p.begin(),p.end()
#define pb push_back
#define F first
#define S second
#define rz resize
#define sz(x) x.size()
#define int long long
#define vi vector<int>
#define pii pair<int,int>
using namespace std;
const int INF = 5000009;
int n,m; 

void solve(){
	cin >> n >> m;
	vi a(n),b(n);
	forn(i,n) cin >> a[i];
	forn(i,n) cin >> b[i];
	forn(i,n){
		if(b[i] > a[i]) a[i] = max(b[i],a[i]);
	}
	int lo = 0,hi = 2e18;
	while(lo != hi-1){
		int mid = (lo+hi)/2;
		int res = 0;
		forn(i,n){
			if(a[i] * m < mid){
				res -= ceil(((double)mid - a[i] * m) / b[i]);
				continue;
			}
			int c = ceil(mid/a[i]);
			res += (m-c);
		}
		if(res >= 0) lo = mid;
		else hi = mid;
	}
	cout << lo << '\n';
}
 
signed main(){
	cin.tie(NULL);
	cout.tie(NULL);
	ios_base::sync_with_stdio(0);
	solve();
	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 9.0

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