oj.uz

Submission #602294

# Submission time Handle Problem Language Result Execution time Memory
602294 2022-07-22T20:49:48 Z IvanJ Self Study (JOI22_ho_t2) C++17
0 / 100
 299 ms 5120 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 3e5 + 5;

int n;
ll m;
ll A[maxn], B[maxn];

int check(ll x) {
	ll ret = 0;
	for(int i = 0;i < n;i++) {
		ll a = max(A[i], B[i]) * m;
		if(x > a) ret -= (x - a + B[i] - 1) / B[i];
		else ret += (a - x) / max(A[i], B[i]);
	}
	return ret >= 0;
}

int main() {
	scanf("%d%lld", &n, &m);
	for(int i = 0;i < n;i++) scanf("%lld", A + i);
	for(int i = 0;i < n;i++) scanf("%lld", B + i);
	
	ll lo = 0, hi = 1e18, ans = -1;
	while(lo <= hi) {
		ll mid = (lo + hi) / 2;
		if(check(mid)) 
			ans = mid, lo = mid + 1;
		else hi = mid - 1;
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  scanf("%d%lld", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
Main.cpp:25:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  for(int i = 0;i < n;i++) scanf("%lld", A + i);
      |                           ~~~~~^~~~~~~~~~~~~~~
Main.cpp:26:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  for(int i = 0;i < n;i++) scanf("%lld", B + i);
      |                           ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 165 ms 5120 KB Output is correct
12 Correct 164 ms 4936 KB Output is correct
13 Correct 185 ms 5036 KB Output is correct
14 Incorrect 299 ms 4976 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 92 ms 2632 KB Output is correct
10 Correct 55 ms 1748 KB Output is correct
11 Correct 43 ms 1464 KB Output is correct
12 Correct 33 ms 1184 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 264 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Incorrect 5 ms 384 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 165 ms 5120 KB Output is correct
12 Correct 164 ms 4936 KB Output is correct
13 Correct 185 ms 5036 KB Output is correct
14 Incorrect 299 ms 4976 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 92 ms 2632 KB Output is correct
10 Correct 55 ms 1748 KB Output is correct
11 Correct 43 ms 1464 KB Output is correct
12 Correct 33 ms 1184 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 264 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Incorrect 5 ms 384 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 165 ms 5120 KB Output is correct
12 Correct 164 ms 4936 KB Output is correct
13 Correct 185 ms 5036 KB Output is correct
14 Incorrect 299 ms 4976 KB Output isn't correct
15 Halted 0 ms 0 KB -