Submission #528122

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
528122	2022-02-19T10:33:54 Z	doowey	Self Study (JOI22_ho_t2)	C++14	10 / 100	69 ms	6120 KB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)3e5 + 10;
ll A[N];
ll B[N];
ll C[N];

int main(){
    fastIO;
    //freopen("in.txt","r",stdin);
    int n;
    cin >> n;
    ll m;
    cin >> m;
    for(int i = 1; i <= n; i ++ ){
        cin >> A[i];
    }
    ll maxi = (ll)1e18;
    for(int i = 1; i <= n; i ++ ){
        cin >> B[i];
        A[i] = max(A[i], B[i]);
        maxi = min(maxi, A[i]);
    }
    cout << maxi << "\n";
    return 0;
    ll li = 0;
    ll ri = (ll)1e16;
    ll mid;
    ll nd;
    while(li + 1 < ri){
        mid = (li + ri) / 2;
        ll can;
        nd = 0;
        for(int i = 1; i <= n; i ++ ){
            can = (mid + A[i] - 1) / A[i];
            if(can <= m){
                nd += m - can;
                C[i] = 0;
            }
            else{
                C[i] = mid - A[i] * 1ll * m;
            }
        }
        for(int i = 1; i <= n; i ++ ){
            nd -= (C[i] + B[i] - 1) / B[i];
        }
        if(nd >= 0){
            li = mid;
        }
        else{
            ri = mid;
        }
    }
    return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	53 ms	4956 KB	Output is correct
12	Correct	52 ms	4928 KB	Output is correct
13	Correct	47 ms	4884 KB	Output is correct
14	Correct	47 ms	4996 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	28 ms	5204 KB	Output is correct
17	Correct	69 ms	5708 KB	Output is correct
18	Correct	54 ms	6120 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	28 ms	5204 KB	Output is correct
3	Correct	69 ms	5708 KB	Output is correct
4	Correct	54 ms	6120 KB	Output is correct
5	Incorrect	0 ms	332 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	53 ms	4956 KB	Output is correct
12	Correct	52 ms	4928 KB	Output is correct
13	Correct	47 ms	4884 KB	Output is correct
14	Correct	47 ms	4996 KB	Output is correct
15	Incorrect	0 ms	332 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

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

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 ms	332 KB	Output is correct
7	Correct	0 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	53 ms	4956 KB	Output is correct
12	Correct	52 ms	4928 KB	Output is correct
13	Correct	47 ms	4884 KB	Output is correct
14	Correct	47 ms	4996 KB	Output is correct
15	Incorrect	0 ms	332 KB	Output isn't correct
16	Halted	0 ms	0 KB	-