Submission #978732

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
978732	2024-05-09T14:52:33 Z	DobromirAngelov	Self Study (JOI22_ho_t2)	C++14	10 / 100	281 ms	11600 KB

Main

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

const int MAXN=3e5+5;
const long long INF=1e18+5;

int n,m;
long long a[MAXN];
long long b[MAXN];

bool check(long long val)
{
    long long s=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]*m>=val) s+=(val+a[i]-1)/a[i];
        else s+=m+(val-a[i]*m+b[i]-1)/b[i];
    }
    if(s>1LL*n*m) return 0;
    return 1;
}

int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>b[i];

for(int i=1;i<=n;i++) a[i]=max(a[i],b[i]);

long long l=1,r=INF;
while(l<r)
{
    long long mid=(l+r+1)/2;
    if(check(mid)) l=mid;
    else r=mid-1;
}

long long ans=INF;
for(int i=1;i<=n;i++) ans=min(ans, a[i]);

//if(ans<l) cout<<1/0<<endl;

cout<<ans<<endl;

return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2648 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	3 ms	2396 KB	Output is correct
11	Correct	144 ms	5080 KB	Output is correct
12	Correct	141 ms	4952 KB	Output is correct
13	Correct	134 ms	5136 KB	Output is correct
14	Correct	281 ms	5132 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	265 ms	6304 KB	Output is correct
17	Correct	153 ms	11600 KB	Output is correct
18	Correct	144 ms	10832 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	265 ms	6304 KB	Output is correct
3	Correct	153 ms	11600 KB	Output is correct
4	Correct	144 ms	10832 KB	Output is correct
5	Incorrect	1 ms	2396 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2648 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	3 ms	2396 KB	Output is correct
11	Correct	144 ms	5080 KB	Output is correct
12	Correct	141 ms	4952 KB	Output is correct
13	Correct	134 ms	5136 KB	Output is correct
14	Correct	281 ms	5132 KB	Output is correct
15	Incorrect	1 ms	2396 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	2396 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2648 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	3 ms	2396 KB	Output is correct
11	Correct	144 ms	5080 KB	Output is correct
12	Correct	141 ms	4952 KB	Output is correct
13	Correct	134 ms	5136 KB	Output is correct
14	Correct	281 ms	5132 KB	Output is correct
15	Incorrect	1 ms	2396 KB	Output isn't correct
16	Halted	0 ms	0 KB	-