제출 #642141

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

Main

#include <bits/stdc++.h>
using namespace std;
//#ifndef EVAL
//#include "grader.h"
//#endif
#define Baytoro_MayrambekovOrz void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}
int c,n,s,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_MayrambekovOrz{
	cin>>n>>m;
	vector<int> a(n),b(n);
	for(i=0;i<n;i++)
		cin>>a[i];
	for(i=0;i<n;i++)
		cin>>b[i];
	int l=0,r=1e18;
	while(r-l>1){
		int md=(l+r)/2;
		cnt=n*m;
		for(i=0;i<n;i++){
			if(a[i]>=b[i]){
				if(a[i]*m>=md)
					cnt-=md/a[i]+((md%a[i])>0);
				else
					cnt-=m+(md-a[i]*m)/b[i]+(((md-a[i]*m)%b[i])>0);
			}
			else
				cnt-=md/b[i]+((md%b[i])>0);
			if(cnt>n*m){
				r=md-1;
				break;
			}
		}
		if(cnt<=n*m)
			l=md;
	}
	cout<<l<<endl;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

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

Main.cpp:62:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main(){
      | ^~~~
Main.cpp: In function 'void fopn(std::string)':
Main.cpp:18:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:19:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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