Submission #753647

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
753647	2023-06-05T15:49:44 Z	bgnbvnbv	Self Study (JOI22_ho_t2)	C++14	0 / 100	478 ms	10792 KB

Main

#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=3e5+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll a[maxN],b[maxN];
ll n,m;
bool check(ll mid)
{
    ll sum=0;
    for(int i=1;i<=n;i++)
    {
        ll cc=max(a[i],b[i]);
        cc=(mid+cc-1)/cc;
        if(cc<=m) sum+=m-cc;
        else
        {
            cc=max(a[i],b[i]);
            ll can=mid-cc*m;
            can=(can+b[i]-1)/b[i];
            sum-=can;
        }
        // cc*...>=mid
    }
    return sum>=0;
}
void solve()
{
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++) cin >> b[i];
    ll low=0,high=1e18;
    while(low<=high)
    {
        ll mid=low+high>>1;
        if(check(mid)) low=mid+1;
        else high=mid-1;
    }
    cout << high;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:42:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   42 |         ll mid=low+high>>1;
      |                ~~~^~~~~

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	239 ms	10756 KB	Output is correct
12	Correct	234 ms	10792 KB	Output is correct
13	Correct	245 ms	8812 KB	Output is correct
14	Incorrect	478 ms	8892 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	260 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	120 ms	5564 KB	Output is correct
10	Correct	81 ms	3808 KB	Output is correct
11	Correct	75 ms	2940 KB	Output is correct
12	Correct	51 ms	2392 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Incorrect	9 ms	340 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	239 ms	10756 KB	Output is correct
12	Correct	234 ms	10792 KB	Output is correct
13	Correct	245 ms	8812 KB	Output is correct
14	Incorrect	478 ms	8892 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	260 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	120 ms	5564 KB	Output is correct
10	Correct	81 ms	3808 KB	Output is correct
11	Correct	75 ms	2940 KB	Output is correct
12	Correct	51 ms	2392 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Incorrect	9 ms	340 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	239 ms	10756 KB	Output is correct
12	Correct	234 ms	10792 KB	Output is correct
13	Correct	245 ms	8812 KB	Output is correct
14	Incorrect	478 ms	8892 KB	Output isn't correct
15	Halted	0 ms	0 KB	-