답안 #828176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828176 2023-08-17T06:19:47 Z RaresFelix Self Study (JOI22_ho_t2) C++17
0 / 100
539 ms 4988 KB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int MN = 300001;
const ll INF = 1e18 + 71;

ll n, m, A[MN], B[MN];
ll mini = INF;

bool ok(ll val, int dbg) {
    if(!val) return 1;
    ll nr_sar = 0;
    for(int i = 1; i <= n; ++i) {
        if((val - 1) / A[i] + 1 <= m) {
            nr_sar += m - ((val - 1) / A[i] + 1);
            if(dbg && (nr_sar > 0) && A[i] == 1) assert(0);
        } else {
            nr_sar -= (val - m * A[i] - 1) / B[i] + 1;
        }
    }
    return (nr_sar >= 0);
}

int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> A[i];
    for(int i = 1; i <= n; ++i) {
        cin >> B[i];
        if(A[i] < B[i]) A[i] = B[i];
    }
    for(int i = 1; i <= n; ++i) mini = min(A[i], mini);
    ll st = 0, dr = INF, mij;
    while(st < dr) {
        mij = st + (dr - st + 1) / 2;
        if(ok(mij, 0)) {
            st = mij;
        }  else dr = mij - 1;
    }
    if(m == 1) {
        ok(st, 1);
        cout << st << "\n";
    } else 
        cout << st << "\n";
    return 0;
}
# 결과 실행 시간 메모리 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 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 6 ms 380 KB Output is correct
11 Correct 319 ms 4872 KB Output is correct
12 Correct 329 ms 4980 KB Output is correct
13 Correct 294 ms 4976 KB Output is correct
14 Incorrect 539 ms 4988 KB Output isn't correct
15 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 166 ms 2612 KB Output is correct
10 Correct 128 ms 1856 KB Output is correct
11 Correct 82 ms 1468 KB Output is correct
12 Correct 70 ms 1232 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 9 ms 380 KB Output isn't correct
19 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 6 ms 380 KB Output is correct
11 Correct 319 ms 4872 KB Output is correct
12 Correct 329 ms 4980 KB Output is correct
13 Correct 294 ms 4976 KB Output is correct
14 Incorrect 539 ms 4988 KB Output isn't correct
15 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 166 ms 2612 KB Output is correct
10 Correct 128 ms 1856 KB Output is correct
11 Correct 82 ms 1468 KB Output is correct
12 Correct 70 ms 1232 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 9 ms 380 KB Output isn't correct
19 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 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 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 6 ms 380 KB Output is correct
11 Correct 319 ms 4872 KB Output is correct
12 Correct 329 ms 4980 KB Output is correct
13 Correct 294 ms 4976 KB Output is correct
14 Incorrect 539 ms 4988 KB Output isn't correct
15 Halted 0 ms 0 KB -