oj.uz

Submission #978737

# Submission time Handle Problem Language Result Execution time Memory
978737 2024-05-09T14:57:05 Z DobromirAngelov Self Study (JOI22_ho_t2) C++14
10 / 100
 180 ms 5200 KB 
#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;
    bool fl=0;
    for(int i=1;i<=n;i++)
    {
        long long cur=0;
        if(a[i]*m>=val) cur+=(val+a[i]-1)/a[i];
        else cur+=m+(val-a[i]*m+b[i]-1)/b[i];
        s+=cur;
        if(cur>1) fl=1;
    }
    if(fl) return 0;
    return 1;
}

long long ans;

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]);

ans=INF;
for(int i=1;i<=n;i++) ans=min(ans, a[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;
}


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

cout<<l<<endl;

return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 142 ms 4968 KB Output is correct
12 Correct 145 ms 4956 KB Output is correct
13 Correct 139 ms 5128 KB Output is correct
14 Correct 180 ms 5136 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 178 ms 5128 KB Output is correct
17 Correct 145 ms 5128 KB Output is correct
18 Correct 143 ms 5200 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 178 ms 5128 KB Output is correct
3 Correct 145 ms 5128 KB Output is correct
4 Correct 143 ms 5200 KB Output is correct
5 Incorrect 1 ms 2392 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 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 142 ms 4968 KB Output is correct
12 Correct 145 ms 4956 KB Output is correct
13 Correct 139 ms 5128 KB Output is correct
14 Correct 180 ms 5136 KB Output is correct
15 Incorrect 1 ms 2392 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 2392 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 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 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 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 142 ms 4968 KB Output is correct
12 Correct 145 ms 4956 KB Output is correct
13 Correct 139 ms 5128 KB Output is correct
14 Correct 180 ms 5136 KB Output is correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Halted 0 ms 0 KB -