Submission #831111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
831111	2023-08-19T18:49:58 Z	jasmin	Self Study (JOI22_ho_t2)	C++17	0 / 100	72 ms	5480 KB

Main

//JOI 2022 Final round
#include<bits/stdc++.h>
using namespace std;
#define int long long

const int INF=1e18;

bool possible(int x, int n, int m, vector<int>& a, vector<int>& b){
    
    int d=0;
    for(int i=0; i<n; i++){

        if(a[i] > b[i]){

            int da = min(m, (x+a[i]-1)/a[i]);
            int db = ((x - da*a[i]) + b[i]-1)/b[i];

            d += da + db;
        }
        else{

            int db = (x+b[i] -1)/b[i];
            d += db;
        }

    }

    return d <= n*m;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for(int i=0; i<n; i++){
        cin >> a[i];
    }
    vector<int> b(n);
    for(int i=0; i<n; i++){
        cin >> b[i];
    }

    int l=0; int r=INF;
    int ans=0;
    while(l<=r){
        int mi=l+(r-l)/2;

        if(possible(mi, n, m, a, b)){
            ans=mi;
            l=mi+1;
        }
        else{
            r=mi-1;
        }
    }

    cout << ans << "\n";
}

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Incorrect	1 ms	212 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.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	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	72 ms	5480 KB	Output is correct
10	Correct	49 ms	3800 KB	Output is correct
11	Correct	37 ms	2956 KB	Output is correct
12	Correct	31 ms	2412 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Incorrect	5 ms	412 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	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Incorrect	1 ms	212 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.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	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	72 ms	5480 KB	Output is correct
10	Correct	49 ms	3800 KB	Output is correct
11	Correct	37 ms	2956 KB	Output is correct
12	Correct	31 ms	2412 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	312 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	320 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Incorrect	5 ms	412 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	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Incorrect	1 ms	212 KB	Output isn't correct
5	Halted	0 ms	0 KB	-