oj.uz

Submission #842765

# Submission time Handle Problem Language Result Execution time Memory
842765 2023-09-03T11:11:50 Z _Avocado_ Self Study (JOI22_ho_t2) C++14
0 / 100
 425 ms 10004 KB 
#include <bits/stdc++.h>
#define int int64_t
using namespace std;

int n, m;

int up(int a, int b){
	int ret = a/b;
	if(a%b) ++ret;
	return ret;
}

int check(int x, auto&a, auto&b){
	int extra = 0;
	for(int i = 0; i<n; ++i){
		int days = up(x, a[i]);
		if(days <= m) extra -= (m-days);
		else{
			int rest = x - (m*a[i]);
			assert(rest > 0);
			int extra_days = up(rest, b[i]);
			extra += extra_days;
		}
	}
	
	if(extra <= 0) 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){
		if(a[i] < b[i]) a[i] = b[i];
	}
	
	cout<<bsearch(a, b);
	
	cout<<'\n';
}

Compilation message

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

Subtask #1
0 / 10.0

# 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 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 213 ms 10004 KB Output is correct
12 Correct 213 ms 9824 KB Output is correct
13 Correct 209 ms 8464 KB Output is correct
14 Incorrect 425 ms 5592 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 105 ms 5456 KB Output is correct
10 Correct 70 ms 3716 KB Output is correct
11 Correct 52 ms 3076 KB Output is correct
12 Correct 43 ms 2396 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 600 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 213 ms 10004 KB Output is correct
12 Correct 213 ms 9824 KB Output is correct
13 Correct 209 ms 8464 KB Output is correct
14 Incorrect 425 ms 5592 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 105 ms 5456 KB Output is correct
10 Correct 70 ms 3716 KB Output is correct
11 Correct 52 ms 3076 KB Output is correct
12 Correct 43 ms 2396 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 600 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 213 ms 10004 KB Output is correct
12 Correct 213 ms 9824 KB Output is correct
13 Correct 209 ms 8464 KB Output is correct
14 Incorrect 425 ms 5592 KB Output isn't correct
15 Halted 0 ms 0 KB -