제출 #1293275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293275		Minbaev	Self Study (JOI22_ho_t2)	C++20	0 / 100	1 ms	332 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define pb      push_back
#define all(x)  x.begin(),x.end()
#define int     long long
#define ar      array

template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}

namespace FAST {
    template<typename T>
    istream &operator>>(istream &cin, vector<T> &a) {
    for (T &i: a) cin >> i;
        return cin;
    }

    template<typename T>
    ostream &operator<<(ostream &cout, vector<T> &a) {
          for (T i: a) cout << i << ' ';
        return cout;
    }
}
using namespace FAST;

const int inf = 3e18 + 7;
const int mod = 1e9 + 7;
const int N = 6e5 + 5;
const int md = 998244353;

int n,m,k;

int solve(){
	
	cin >> n >> m;
	vector<int>a(n), b(n);
	cin >> a >> b;
	
	int l = 0, r = 3e18, ans = -1;
	while(l <= r){
		int mid = (l + r) / 2;
		//~ mid = 18;
		int cnt = 0;
		for(int i = 0;i<n;i++){
			int mx = max(a[i], b[i]);
			if(mx * m >= mid){
				int cont = mx * m - mid;
				cnt += cont / max(a[i], b[i]);
			}
		}
		
		for(int i = 0;i<n;i++){
			int mx = max(a[i], b[i]);
			if(mx * m >= mid)continue;
			int cont = mid - m * mx;
			cnt -= (cont + b[i] - 1) / b[i];
		}
		
		if(cnt >= 0){
			l = mid + 1;
			ans = mid;
		}
		else r = mid - 1;
		//~ return;
	}
	
	cout << ans << " ";
}
/*


*/
 signed main()
{
//  freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
    ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
    int tt=1;//cin >> tt;
    while(tt--)solve();	

}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'long long int solve()':
Main.cpp:70:1: warning: no return statement in function returning non-void [-Wreturn-type]
   70 | }
      | ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9