Submission #907538

# Submission time Handle Problem Language Result Execution time Memory
907538 2024-01-15T20:24:44 Z AlphaMale06 Self Study (JOI22_ho_t2) C++14
0 / 100
273 ms 5140 KB
#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=0; int r=1e18+1;
	int ans=0;
	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]);
			if(mx*m>=s)save+=m-(s+mx-1)/mx;
			else save-=(s-mx*m+b[i]-1)/b[i];
		}
		if(save>=0){ 
			ans=s;
			l=s+1;
		}
		else r=s-1;
	}
	cout << ans << '\n';
}


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

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:24:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |   int s=l+r>>1;
      |         ~^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 144 ms 5140 KB Output is correct
12 Correct 145 ms 5108 KB Output is correct
13 Correct 133 ms 4956 KB Output is correct
14 Incorrect 273 ms 4956 KB Output isn't correct
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 428 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 71 ms 2648 KB Output is correct
10 Correct 48 ms 1884 KB Output is correct
11 Correct 36 ms 1372 KB Output is correct
12 Correct 29 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 756 KB Output is correct
18 Incorrect 4 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 144 ms 5140 KB Output is correct
12 Correct 145 ms 5108 KB Output is correct
13 Correct 133 ms 4956 KB Output is correct
14 Incorrect 273 ms 4956 KB Output isn't correct
15 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 428 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 71 ms 2648 KB Output is correct
10 Correct 48 ms 1884 KB Output is correct
11 Correct 36 ms 1372 KB Output is correct
12 Correct 29 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 756 KB Output is correct
18 Incorrect 4 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 144 ms 5140 KB Output is correct
12 Correct 145 ms 5108 KB Output is correct
13 Correct 133 ms 4956 KB Output is correct
14 Incorrect 273 ms 4956 KB Output isn't correct
15 Halted 0 ms 0 KB -