답안 #907526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
907526	2024-01-15T20:02:24 Z	AlphaMale06	Self Study (JOI22_ho_t2)	C++14	0 / 100	430 ms	10920 KB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define int long long


void solve(){
	int n, m;
	cin >> n >> m;
	int a[n], b[n];
	for(int i=0; i< n; i++)cin >> a[i];
	for(int i=0; i< n; i++)cin >> b[i];
	int l=1; int r=1e18+1;
	while(l<=r){
		int s=l+r>>1;
		int save=0;
		for(int i=0; i< n; i++){
			int mx=max(a[i], b[i]);
			int cnt=(s+mx-1)/mx;
			if(cnt<=m){
				save+=m-cnt;
			}
			else save-=(s-mx*m+b[i]-1)/b[i];
		}
		if(save>=0)l=s+1;
		else r=s-1;
	}
	cout << l-1 << '\n';
}


signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

Compilation message

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

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	452 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	456 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	4 ms	604 KB	Output is correct
11	Correct	218 ms	10920 KB	Output is correct
12	Correct	205 ms	10920 KB	Output is correct
13	Correct	216 ms	8936 KB	Output is correct
14	Incorrect	430 ms	8936 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	107 ms	5672 KB	Output is correct
10	Correct	72 ms	3780 KB	Output is correct
11	Correct	57 ms	2908 KB	Output is correct
12	Correct	44 ms	2396 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	8 ms	548 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	452 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	456 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	4 ms	604 KB	Output is correct
11	Correct	218 ms	10920 KB	Output is correct
12	Correct	205 ms	10920 KB	Output is correct
13	Correct	216 ms	8936 KB	Output is correct
14	Incorrect	430 ms	8936 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	107 ms	5672 KB	Output is correct
10	Correct	72 ms	3780 KB	Output is correct
11	Correct	57 ms	2908 KB	Output is correct
12	Correct	44 ms	2396 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	8 ms	548 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	452 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	456 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	4 ms	604 KB	Output is correct
11	Correct	218 ms	10920 KB	Output is correct
12	Correct	205 ms	10920 KB	Output is correct
13	Correct	216 ms	8936 KB	Output is correct
14	Incorrect	430 ms	8936 KB	Output isn't correct
15	Halted	0 ms	0 KB	-