Submission #703386

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
703386	2023-02-27T08:23:42 Z	niter	Self Study (JOI22_ho_t2)	C++14	0 / 100	566 ms	4976 KB

Main

#include <bits/stdc++.h>
#define loop(i,a,b) for(int 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];
 
/*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, 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{
                classes += min<long long>(((cost-1) / a[i] + 1), m);
                cost -= min<long long>(((cost-1) / a[i] + 1), m) * a[i];
 
                if(cost > 0)
                	classes += ((cost-1) / b[i] + 1);
            }
        }
        if(classes > n * m){
            r = mid - 1;
        }
        else{
            l = mid;
        }
    }
    cout << l << "\n";
    return 0;
}
/*
3 3
19 4 5
2 6 2
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:25:21: warning: variable 'all' set but not used [-Wunused-but-set-variable]
   25 |     long long n, m, all;
      |                     ^~~

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	1 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	1 ms	212 KB	Output is correct
10	Correct	5 ms	340 KB	Output is correct
11	Correct	370 ms	4960 KB	Output is correct
12	Correct	373 ms	4976 KB	Output is correct
13	Correct	269 ms	4884 KB	Output is correct
14	Incorrect	566 ms	4976 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	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	0 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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	213 ms	2640 KB	Output is correct
10	Correct	134 ms	1736 KB	Output is correct
11	Correct	102 ms	1464 KB	Output is correct
12	Correct	82 ms	1216 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	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Incorrect	10 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	1 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	1 ms	212 KB	Output is correct
10	Correct	5 ms	340 KB	Output is correct
11	Correct	370 ms	4960 KB	Output is correct
12	Correct	373 ms	4976 KB	Output is correct
13	Correct	269 ms	4884 KB	Output is correct
14	Incorrect	566 ms	4976 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	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	0 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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	213 ms	2640 KB	Output is correct
10	Correct	134 ms	1736 KB	Output is correct
11	Correct	102 ms	1464 KB	Output is correct
12	Correct	82 ms	1216 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	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Incorrect	10 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	1 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	1 ms	212 KB	Output is correct
10	Correct	5 ms	340 KB	Output is correct
11	Correct	370 ms	4960 KB	Output is correct
12	Correct	373 ms	4976 KB	Output is correct
13	Correct	269 ms	4884 KB	Output is correct
14	Incorrect	566 ms	4976 KB	Output isn't correct
15	Halted	0 ms	0 KB	-