Submission #528128

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
528128	2022-02-19T10:47:25 Z	doowey	Self Study (JOI22_ho_t2)	C++14	10 / 100	176 ms	7328 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];
    }
    ll maxi = (ll)1e18;
    for(int i = 1; i <= n; i ++ ){
        cin >> B[i];
        A[i] = max(A[i], B[i]);
        maxi = min(maxi, A[i]);
    }
    ll li = 1;
    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;
                if(C[i] < 0) C[i] = 0;
            }
        }
        for(int i = 1; i <= n; i ++ ){
            if(C[i] > 0) nd = -1;
        }
        if(nd >= 0){
            li = mid;
        }
        else{
            ri = mid;
        }
    }
    cout << li << "\n";
    return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 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	204 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	3 ms	332 KB	Output is correct
11	Correct	153 ms	7256 KB	Output is correct
12	Correct	152 ms	7236 KB	Output is correct
13	Correct	146 ms	7292 KB	Output is correct
14	Correct	145 ms	7328 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	176 ms	7288 KB	Output is correct
17	Correct	165 ms	7260 KB	Output is correct
18	Correct	152 ms	7324 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	176 ms	7288 KB	Output is correct
3	Correct	165 ms	7260 KB	Output is correct
4	Correct	152 ms	7324 KB	Output is correct
5	Incorrect	1 ms	332 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 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	204 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	3 ms	332 KB	Output is correct
11	Correct	153 ms	7256 KB	Output is correct
12	Correct	152 ms	7236 KB	Output is correct
13	Correct	146 ms	7292 KB	Output is correct
14	Correct	145 ms	7328 KB	Output is correct
15	Incorrect	1 ms	332 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	332 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 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	204 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	3 ms	332 KB	Output is correct
11	Correct	153 ms	7256 KB	Output is correct
12	Correct	152 ms	7236 KB	Output is correct
13	Correct	146 ms	7292 KB	Output is correct
14	Correct	145 ms	7328 KB	Output is correct
15	Incorrect	1 ms	332 KB	Output isn't correct
16	Halted	0 ms	0 KB	-