답안 #937904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937904 2024-03-04T16:29:55 Z Litusiano Self Study (JOI22_ho_t2) C++14
0 / 100
428 ms 7472 KB
#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+=m, need[i] = mid-m * z; // quan em falta per aprobar
		else tot+=k; // classes que mhan sobrat
	}
	for(int i = 0; i<n; i++){
		tot += max(0ll,(need[i] + 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.assign(n,{0,0});
	for(auto& x : v) cin>>x.first; //a
	for(auto& x : v) cin>>x.second; //b
	int l = 0; int r = 1e18+6;
	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; int tot = 0;
      |      ^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 412 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 249 ms 7452 KB Output is correct
12 Correct 245 ms 7472 KB Output is correct
13 Correct 231 ms 7468 KB Output is correct
14 Incorrect 428 ms 7464 KB Output isn't correct
15 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 544 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 127 ms 3920 KB Output is correct
10 Correct 84 ms 2648 KB Output is correct
11 Correct 63 ms 2136 KB Output is correct
12 Correct 51 ms 1880 KB Output is correct
13 Correct 1 ms 344 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 8 ms 344 KB Output isn't correct
19 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 412 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 249 ms 7452 KB Output is correct
12 Correct 245 ms 7472 KB Output is correct
13 Correct 231 ms 7468 KB Output is correct
14 Incorrect 428 ms 7464 KB Output isn't correct
15 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 544 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 127 ms 3920 KB Output is correct
10 Correct 84 ms 2648 KB Output is correct
11 Correct 63 ms 2136 KB Output is correct
12 Correct 51 ms 1880 KB Output is correct
13 Correct 1 ms 344 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 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 8 ms 344 KB Output isn't correct
19 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 412 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 249 ms 7452 KB Output is correct
12 Correct 245 ms 7472 KB Output is correct
13 Correct 231 ms 7468 KB Output is correct
14 Incorrect 428 ms 7464 KB Output isn't correct
15 Halted 0 ms 0 KB -