답안 #803678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
803678 2023-08-03T05:25:34 Z vjudge1 Self Study (JOI22_ho_t2) C++14
10 / 100
54 ms 5112 KB
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = 3e5 ;
bool flag1 ;
ll n, m, l = 0, r = 1e13, a[N + 1], b[N + 1] ;
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n >> m ;
    for(ll i = 1 ; i <= n ; i++)
        cin >> a[i] ;
    for(ll i = 1 ; i <= n ; i++)
    {
        cin >> b[i] ;
        if(a[i] != b[i])
            flag1 = 1 ;
    }
    if(m == 1)
    {
        ll mn = 1e18 ;
        for(ll i = 1 ; i <= n ; i++)
            mn = min(mn, max(a[i], b[i])) ;
        cout << mn << '\n' ;
        return 0 ;
    }
    if(!flag1)
    {
        while(l + 1 < r)
        {
            ll mid = (l + r) / 2, cnt = 0 ;
            for(ll i = 1 ; i <= n ; i++)
                cnt += (mid + b[i] - 1) / b[i] ;
            if(cnt > n * m)
                r = mid ;
            else
                l = mid ;
        }
        cout << l ;
        return 0 ;
    }
    return 0 ;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 45 ms 4900 KB Output is correct
12 Correct 46 ms 4980 KB Output is correct
13 Correct 36 ms 4884 KB Output is correct
14 Correct 35 ms 4940 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 26 ms 4972 KB Output is correct
17 Correct 51 ms 5112 KB Output is correct
18 Correct 45 ms 4896 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 26 ms 4972 KB Output is correct
3 Correct 51 ms 5112 KB Output is correct
4 Correct 45 ms 4896 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 54 ms 2660 KB Output is correct
14 Correct 35 ms 1884 KB Output is correct
15 Correct 28 ms 1492 KB Output is correct
16 Correct 22 ms 1260 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Incorrect 0 ms 212 KB Output isn't correct
20 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 45 ms 4900 KB Output is correct
12 Correct 46 ms 4980 KB Output is correct
13 Correct 36 ms 4884 KB Output is correct
14 Correct 35 ms 4940 KB Output is correct
15 Correct 0 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 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 54 ms 2660 KB Output is correct
24 Correct 35 ms 1884 KB Output is correct
25 Correct 28 ms 1492 KB Output is correct
26 Correct 22 ms 1260 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 0 ms 212 KB Output isn't correct
30 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 54 ms 2660 KB Output is correct
10 Correct 35 ms 1884 KB Output is correct
11 Correct 28 ms 1492 KB Output is correct
12 Correct 22 ms 1260 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Incorrect 0 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 45 ms 4900 KB Output is correct
12 Correct 46 ms 4980 KB Output is correct
13 Correct 36 ms 4884 KB Output is correct
14 Correct 35 ms 4940 KB Output is correct
15 Correct 0 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 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 54 ms 2660 KB Output is correct
24 Correct 35 ms 1884 KB Output is correct
25 Correct 28 ms 1492 KB Output is correct
26 Correct 22 ms 1260 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Incorrect 0 ms 212 KB Output isn't correct
30 Halted 0 ms 0 KB -