Submission #907574

# Submission time Handle Problem Language Result Execution time Memory
907574 2024-01-15T21:24:08 Z vjudge1 Self Study (JOI22_ho_t2) C++17
10 / 100
74 ms 5140 KB
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	ll n,m;cin>>n>>m;
	vi a(n);rep(i,0,n)cin>>a[i];
	vi b(n);rep(i,0,n)cin>>b[i];
	bool eq = true;
	rep(i,0,n)if(a[i]!=b[i]) eq=false;
	ll worst = 2e18;
	if(m==1){
		rep(i,0,n) worst=min(worst,m*max(a[i],b[i]));
	}else if(eq){
		ll lo = 0;
		ll hi = 2e18;
		while(lo+1<hi){
			ll mid = lo+(hi-lo)/2;
			ll cost = 0;
			rep(i,0,n) cost += (mid+a[i]-1)/a[i];
			if(cost<=n*m) lo=mid;
			else hi=mid;
		}
		worst=lo;
	}else if(n*m <= 300000){
		// priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
		// rep(i,0,n) pq.push({0,i});
		// rep(_,0,n*m){
		// 	auto p = pq.top(); pq.pop();
		// 	pq.push({p.F + a[p.S], p.S});
		// }
		// worst = pq.top().F;
	}
	cout<<worst<<endl;
}
# 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 45 ms 5132 KB Output is correct
12 Correct 48 ms 5140 KB Output is correct
13 Correct 48 ms 5136 KB Output is correct
14 Correct 40 ms 4956 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 28 ms 4956 KB Output is correct
17 Correct 56 ms 5140 KB Output is correct
18 Correct 47 ms 4956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 28 ms 4956 KB Output is correct
3 Correct 56 ms 5140 KB Output is correct
4 Correct 47 ms 4956 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 74 ms 2664 KB Output is correct
14 Correct 50 ms 1884 KB Output is correct
15 Correct 38 ms 1628 KB Output is correct
16 Correct 34 ms 1400 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Incorrect 5 ms 528 KB Output isn't correct
23 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 45 ms 5132 KB Output is correct
12 Correct 48 ms 5140 KB Output is correct
13 Correct 48 ms 5136 KB Output is correct
14 Correct 40 ms 4956 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 74 ms 2664 KB Output is correct
24 Correct 50 ms 1884 KB Output is correct
25 Correct 38 ms 1628 KB Output is correct
26 Correct 34 ms 1400 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 5 ms 528 KB Output isn't correct
33 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 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 74 ms 2664 KB Output is correct
10 Correct 50 ms 1884 KB Output is correct
11 Correct 38 ms 1628 KB Output is correct
12 Correct 34 ms 1400 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 5 ms 528 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 45 ms 5132 KB Output is correct
12 Correct 48 ms 5140 KB Output is correct
13 Correct 48 ms 5136 KB Output is correct
14 Correct 40 ms 4956 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 74 ms 2664 KB Output is correct
24 Correct 50 ms 1884 KB Output is correct
25 Correct 38 ms 1628 KB Output is correct
26 Correct 34 ms 1400 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 5 ms 528 KB Output isn't correct
33 Halted 0 ms 0 KB -