답안 #937895

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
937895	2024-03-04T16:19:19 Z	Litusiano	Self Study (JOI22_ho_t2)	C++17	0 / 100	431 ms	7520 KB

Main

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
 
vector<pair<int,int>> v;
int n,m;
bool check(int mid){
	vector<int> need(n,0);
	int left = 0;
	int tot = 0;
	for(int i = 0; i<n; i++){
		int z = max(v[i].first, v[i].second); // a la clase i, estudio o hi vaig
		int k = (mid+z-1)/z; // numero de veces que tengo que estudiar o ir 
		if(k <=m){
			tot += k; continue; 
		}
		tot+=m;
		tot+= ((mid-z*m) + v[i].second-1)/v[i].second;
	}
	return tot<=n*m;
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	v.resize(n);
	for(auto& x : v) cin>>x.first; //a
	for(auto& x : v) cin>>x.second; //b
	int l = 1; int r = 1e18;
	while(r > l+1){
		int mid = (l+r)/2;
		if(check(mid)) l = mid;
		else r = mid;
	}
	cout<<l<<endl;
}	

Compilation message

Main.cpp: In function 'bool check(long long int)':
Main.cpp:10:6: warning: unused variable 'left' [-Wunused-variable]
   10 |  int left = 0;
      |      ^~~~

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 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	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	204 ms	7468 KB	Output is correct
12	Correct	206 ms	7464 KB	Output is correct
13	Correct	214 ms	7520 KB	Output is correct
14	Incorrect	431 ms	7484 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	106 ms	3924 KB	Output is correct
10	Correct	71 ms	2652 KB	Output is correct
11	Correct	56 ms	2136 KB	Output is correct
12	Correct	43 ms	1884 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	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Incorrect	8 ms	568 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 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	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	204 ms	7468 KB	Output is correct
12	Correct	206 ms	7464 KB	Output is correct
13	Correct	214 ms	7520 KB	Output is correct
14	Incorrect	431 ms	7484 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	106 ms	3924 KB	Output is correct
10	Correct	71 ms	2652 KB	Output is correct
11	Correct	56 ms	2136 KB	Output is correct
12	Correct	43 ms	1884 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	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Incorrect	8 ms	568 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 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	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	204 ms	7468 KB	Output is correct
12	Correct	206 ms	7464 KB	Output is correct
13	Correct	214 ms	7520 KB	Output is correct
14	Incorrect	431 ms	7484 KB	Output isn't correct
15	Halted	0 ms	0 KB	-