답안 #538660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
538660	2022-03-17T11:59:54 Z	Harry464	Self Study (JOI22_ho_t2)	C++14	0 / 100	603 ms	9692 KB

Main

#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

int main(){

    ll n, m;
    cin >> n >> m; 

    vector <long double> a(n);
    vector <long double> b(n);

    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++)
        cin >> b[i];

    for (int i = 0; i < n; i++)
        a[i] = max(a[i], b[i]);

    ll l = 1, r = 3000000000000000001;
    
    ll granica = n*m;

    while (l < r){

        ll mid = (l+r)/2;

        ll potrebno = 0;

        for (int i = 0; i < n; i++){

           ll maksa = ceil(((double) mid)/a[i]);
           potrebno += min(maksa, m);
           double iskor = min(maksa, m);

           ll maksb = ceil(((double)mid- iskor*a[i])/b[i]);
           potrebno += max((ll) 0, maksb);

        }

        if (potrebno <= granica)
          l = mid + 1;
        else
          r = mid;

    }

    cout << l - 1;

}

Subtask #1

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	0 ms	212 KB	Output is correct
4	Correct	0 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	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	10 ms	340 KB	Output is correct
11	Correct	603 ms	9688 KB	Output is correct
12	Correct	600 ms	9692 KB	Output is correct
13	Correct	532 ms	9688 KB	Output is correct
14	Incorrect	475 ms	9692 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	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	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	1 ms	212 KB	Output is correct
9	Correct	302 ms	4996 KB	Output is correct
10	Correct	201 ms	3432 KB	Output is correct
11	Correct	153 ms	2644 KB	Output is correct
12	Correct	121 ms	2132 KB	Output is correct
13	Correct	2 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	8 ms	456 KB	Output isn't correct
19	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	0 ms	212 KB	Output is correct
4	Correct	0 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	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	10 ms	340 KB	Output is correct
11	Correct	603 ms	9688 KB	Output is correct
12	Correct	600 ms	9692 KB	Output is correct
13	Correct	532 ms	9688 KB	Output is correct
14	Incorrect	475 ms	9692 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	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	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	1 ms	212 KB	Output is correct
9	Correct	302 ms	4996 KB	Output is correct
10	Correct	201 ms	3432 KB	Output is correct
11	Correct	153 ms	2644 KB	Output is correct
12	Correct	121 ms	2132 KB	Output is correct
13	Correct	2 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	8 ms	456 KB	Output isn't correct
19	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	0 ms	212 KB	Output is correct
4	Correct	0 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	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	10 ms	340 KB	Output is correct
11	Correct	603 ms	9688 KB	Output is correct
12	Correct	600 ms	9692 KB	Output is correct
13	Correct	532 ms	9688 KB	Output is correct
14	Incorrect	475 ms	9692 KB	Output isn't correct
15	Halted	0 ms	0 KB	-