Submission #703378

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
703378	2023-02-27T07:51:13 Z	niter	Self Study (JOI22_ho_t2)	C++14	0 / 100	564 ms	4984 KB

Main

#include <bits/stdc++.h>
#define loop(i,a,b) for(long long i=a;i<b;i++)
#define pii pair<long long,int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define STL(i, x) for(auto &i:x) cout << i << " "; cout << "\n";
using namespace std;

long long a[300050], b[300050], as[300050];

/*ostream& operator<<(ostream &os, pii XXX){
    cout << "[" << XXX.ff << ", " << XXX.ss << "]";
}*/
/*void db(){
    cout << "\n";
}
template<class T, class ...U>
void db(T XXX, U ...YYY){
    cout << XXX;  db(YYY...);
}*/

int main(){
    long long n, m, all;
    cin >> n >> m;
    all = n * m;
    loop(i,0,n) cin >> a[i];
    loop(i,0,n) cin >> b[i];
    long long l = 1, r = (long long)(9e18), mid;
    long long cost, tmp_pay, classes;
    while(l != r){
        mid = (l + r + 1) >> 1;
        //db("mid = ", mid);
        classes = 0;
        loop(i,0,n){
            cost = mid;
            if(b[i] >= a[i]){
                classes += ((cost-1) / b[i] + 1);
            }
            else{
                tmp_pay = min(((cost-1) / a[i] + 1), m);
                classes += tmp_pay;
                cost -= tmp_pay * a[i];
                if(cost > 0)
                    classes += ((cost-1) / b[i] + 1);
            }
            //db(i, ' ', classes);
        }
        if(classes > all){
            r = mid - 1;
        }
        else{
            l = mid;
        }
        //db();
    }
    cout << l << "\n";
    return 0;
}
/*
5 1
1 2 3 4 5
5 4 5 2 1
*/

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	6 ms	340 KB	Output is correct
11	Correct	356 ms	4860 KB	Output is correct
12	Correct	360 ms	4864 KB	Output is correct
13	Correct	267 ms	4932 KB	Output is correct
14	Incorrect	564 ms	4984 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	168 ms	2640 KB	Output is correct
10	Correct	121 ms	1740 KB	Output is correct
11	Correct	84 ms	1464 KB	Output is correct
12	Correct	65 ms	1236 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Incorrect	7 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	0 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	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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	6 ms	340 KB	Output is correct
11	Correct	356 ms	4860 KB	Output is correct
12	Correct	360 ms	4864 KB	Output is correct
13	Correct	267 ms	4932 KB	Output is correct
14	Incorrect	564 ms	4984 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	296 KB	Output is correct
9	Correct	168 ms	2640 KB	Output is correct
10	Correct	121 ms	1740 KB	Output is correct
11	Correct	84 ms	1464 KB	Output is correct
12	Correct	65 ms	1236 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Incorrect	7 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	0 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	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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	6 ms	340 KB	Output is correct
11	Correct	356 ms	4860 KB	Output is correct
12	Correct	360 ms	4864 KB	Output is correct
13	Correct	267 ms	4932 KB	Output is correct
14	Incorrect	564 ms	4984 KB	Output isn't correct
15	Halted	0 ms	0 KB	-