답안 #528117

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528117	2022-02-19T10:21:54 Z	doowey	Self Study (JOI22_ho_t2)	C++14	0 / 100	378 ms	11888 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];
    }
    for(int i = 1; i <= n; i ++ ){
        cin >> B[i];
        A[i] = max(A[i], B[i]);
    }
    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;
        }
    }
    cout << li << "\n";
    return 0;
}

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 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	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	4 ms	460 KB	Output is correct
11	Correct	252 ms	11888 KB	Output is correct
12	Correct	232 ms	11716 KB	Output is correct
13	Correct	235 ms	8952 KB	Output is correct
14	Incorrect	378 ms	10948 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	204 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	204 KB	Output is correct
9	Correct	120 ms	5956 KB	Output is correct
10	Correct	82 ms	3396 KB	Output is correct
11	Correct	61 ms	2660 KB	Output is correct
12	Correct	53 ms	2232 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Incorrect	8 ms	332 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 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	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	4 ms	460 KB	Output is correct
11	Correct	252 ms	11888 KB	Output is correct
12	Correct	232 ms	11716 KB	Output is correct
13	Correct	235 ms	8952 KB	Output is correct
14	Incorrect	378 ms	10948 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	0 ms	204 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	204 KB	Output is correct
9	Correct	120 ms	5956 KB	Output is correct
10	Correct	82 ms	3396 KB	Output is correct
11	Correct	61 ms	2660 KB	Output is correct
12	Correct	53 ms	2232 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	0 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Incorrect	8 ms	332 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 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	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	324 KB	Output is correct
10	Correct	4 ms	460 KB	Output is correct
11	Correct	252 ms	11888 KB	Output is correct
12	Correct	232 ms	11716 KB	Output is correct
13	Correct	235 ms	8952 KB	Output is correct
14	Incorrect	378 ms	10948 KB	Output isn't correct
15	Halted	0 ms	0 KB	-