답안 #753668

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
753668	2023-06-05T16:33:02 Z	bgnbvnbv	Self Study (JOI22_ho_t2)	C++14	10 / 100	78 ms	11468 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 mn=inf;
    for(int i=1;i<=n;i++) mn=min(mn,max(a[i],b[i]));
    cout << mn;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	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	244 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	56 ms	10744 KB	Output is correct
12	Correct	61 ms	10764 KB	Output is correct
13	Correct	52 ms	8752 KB	Output is correct
14	Correct	51 ms	8784 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	30 ms	6220 KB	Output is correct
17	Correct	78 ms	11468 KB	Output is correct
18	Correct	58 ms	10700 KB	Output is correct

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	30 ms	6220 KB	Output is correct
3	Correct	78 ms	11468 KB	Output is correct
4	Correct	58 ms	10700 KB	Output is correct
5	Incorrect	1 ms	328 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	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	244 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	56 ms	10744 KB	Output is correct
12	Correct	61 ms	10764 KB	Output is correct
13	Correct	52 ms	8752 KB	Output is correct
14	Correct	51 ms	8784 KB	Output is correct
15	Incorrect	1 ms	328 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	328 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	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	244 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	56 ms	10744 KB	Output is correct
12	Correct	61 ms	10764 KB	Output is correct
13	Correct	52 ms	8752 KB	Output is correct
14	Correct	51 ms	8784 KB	Output is correct
15	Incorrect	1 ms	328 KB	Output isn't correct
16	Halted	0 ms	0 KB	-