Submission #914969

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
914969	2024-01-23T03:35:03 Z	ReLice	Self Study (JOI22_ho_t2)	C++14	10 / 100	107 ms	8528 KB

Main

#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool f=0;
    if (x>y){x=y;f=1;}
    return f;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool f=0;
    if (x<y){x=y;f=1;}
    return f;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
void solve(){
    ll i,j;
    ll n,m;
    cin>>n>>m;
    ll a[n],b[n];
    for(i=0;i<n;i++)cin>>a[i];
    for(i=0;i<n;i++){
        cin>>b[i];
        if(b[i]>a[i])a[i]=b[i];
    }
    if(m==1){
        ll ans=inf;
        for(i=0;i<n;i++) ans=min(ans,a[i]);
        cout<<ans<<endl;
        return;
    }
    ll l=1,r=2*inf;
    while(l+1<r){
        ll mid=(l+r)/2;
        ll sum=0;
        for(i=0;i<n;i++){
            ll in=(mid+a[i]-1)/a[i];
            if(in>m){
                in=m;
                ll out=(mid-a[i]*in+b[i]-1)/b[i];
                sum+=out;
            }
            sum+=in;
        }
        if(sum<=n*m)l=mid;
        else r=mid;
    }
    cout<<l<<endl;
}

signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*



*/

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:46:10: warning: unused variable 'j' [-Wunused-variable]
   46 |     ll i,j;
      |          ^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	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	1 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	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	48 ms	4956 KB	Output is correct
12	Correct	47 ms	4952 KB	Output is correct
13	Correct	35 ms	4952 KB	Output is correct
14	Correct	36 ms	4956 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	25 ms	5880 KB	Output is correct
17	Correct	51 ms	8528 KB	Output is correct
18	Correct	58 ms	8120 KB	Output is correct

Subtask #2
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	25 ms	5880 KB	Output is correct
3	Correct	51 ms	8528 KB	Output is correct
4	Correct	58 ms	8120 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	396 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	600 KB	Output is correct
13	Correct	107 ms	2652 KB	Output is correct
14	Correct	72 ms	1992 KB	Output is correct
15	Correct	53 ms	1372 KB	Output is correct
16	Correct	44 ms	1368 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Incorrect	9 ms	348 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #3
0 / 27.0

#	Verdict	Execution time	Memory	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	1 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	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	48 ms	4956 KB	Output is correct
12	Correct	47 ms	4952 KB	Output is correct
13	Correct	35 ms	4952 KB	Output is correct
14	Correct	36 ms	4956 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	396 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	600 KB	Output is correct
23	Correct	107 ms	2652 KB	Output is correct
24	Correct	72 ms	1992 KB	Output is correct
25	Correct	53 ms	1372 KB	Output is correct
26	Correct	44 ms	1368 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	9 ms	348 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 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	396 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	600 KB	Output is correct
9	Correct	107 ms	2652 KB	Output is correct
10	Correct	72 ms	1992 KB	Output is correct
11	Correct	53 ms	1372 KB	Output is correct
12	Correct	44 ms	1368 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 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	9 ms	348 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	Verdict	Execution time	Memory	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	1 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	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	48 ms	4956 KB	Output is correct
12	Correct	47 ms	4952 KB	Output is correct
13	Correct	35 ms	4952 KB	Output is correct
14	Correct	36 ms	4956 KB	Output is correct
15	Correct	0 ms	344 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	396 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	600 KB	Output is correct
23	Correct	107 ms	2652 KB	Output is correct
24	Correct	72 ms	1992 KB	Output is correct
25	Correct	53 ms	1372 KB	Output is correct
26	Correct	44 ms	1368 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Incorrect	9 ms	348 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

Submission #914969

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 0 / 25.0

Subtask #3 0 / 27.0

Subtask #4 0 / 29.0

Subtask #5 0 / 9.0

Subtask #1
10.0 / 10.0

Subtask #2
0 / 25.0

Subtask #3
0 / 27.0

Subtask #4
0 / 29.0

Subtask #5
0 / 9.0