oj.uz

Submission #842835

# Submission time Handle Problem Language Result Execution time Memory
842835 2023-09-03T12:03:52 Z _Avocado_ Self Study (JOI22_ho_t2) C++14
0 / 100
 420 ms 5140 KB 
#include <bits/stdc++.h>
#define int int64_t
using namespace std;

int n, m;

int up(int a, int b){
	return (a + (b-1))/b;
}

int check(int x, auto&a, auto&b){
	int sum = 0;
	for(int i = 0; i<n; ++i){
		int days = up(x, a[i]);
		sum += min(m, days);
		if(days > m){
			int rest = x - (m*a[i]);
			int extra_days = up(rest, b[i]);
			sum += extra_days;
		}
	}
	
	if(sum <= n*m) return 1;
	return 0;
}
			

int bsearch(auto&a, auto&b){
	int l = -1;
	int r = 1e18+18;
	
	while(r-l > 1){
		int x = (r+l)/2;
		
		if(check(x, a, b)) l = x;
		else r = x;
	}
	
	return l;
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	
	cin>>n>>m;
	
	vector<int>a(n);
	for(auto&u: a) cin>>u;
	vector<int>b(n);
	for(auto&u: b) cin>>u;
	
	for(int i = 0; i<n; ++i){
		a[i] = max(a[i], b[i]);
	}
	
	cout<<bsearch(a, b);
	
	cout<<'\n';
}

Compilation message

Main.cpp:11:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   11 | int check(int x, auto&a, auto&b){
      |                  ^~~~
Main.cpp:11:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   11 | int check(int x, auto&a, auto&b){
      |                          ^~~~
Main.cpp:28:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   28 | int bsearch(auto&a, auto&b){
      |             ^~~~
Main.cpp:28:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   28 | int bsearch(auto&a, auto&b){
      |                     ^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 203 ms 5140 KB Output is correct
12 Correct 204 ms 5140 KB Output is correct
13 Correct 208 ms 4952 KB Output is correct
14 Incorrect 420 ms 5140 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 106 ms 2792 KB Output is correct
10 Correct 71 ms 2012 KB Output is correct
11 Correct 51 ms 1624 KB Output is correct
12 Correct 43 ms 1368 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Incorrect 8 ms 344 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 203 ms 5140 KB Output is correct
12 Correct 204 ms 5140 KB Output is correct
13 Correct 208 ms 4952 KB Output is correct
14 Incorrect 420 ms 5140 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 106 ms 2792 KB Output is correct
10 Correct 71 ms 2012 KB Output is correct
11 Correct 51 ms 1624 KB Output is correct
12 Correct 43 ms 1368 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Incorrect 8 ms 344 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 3 ms 344 KB Output is correct
11 Correct 203 ms 5140 KB Output is correct
12 Correct 204 ms 5140 KB Output is correct
13 Correct 208 ms 4952 KB Output is correct
14 Incorrect 420 ms 5140 KB Output isn't correct
15 Halted 0 ms 0 KB -