oj.uz

답안 #803680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
803680 2023-08-03T05:26:30 Z vjudge1 Self Study (JOI22_ho_t2) C++14
10 / 100
 50 ms 5000 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 = 1e18, 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)
        {
            bool flag = 0 ;
            ll mid = (l + r) / 2, cnt = 0 ;
            for(ll i = 1 ; i <= n ; i++)
            {
                cnt += (mid + b[i] - 1) / b[i] ;
                if(cnt < 0 || (mid + b[i] - 1) / b[i])
                    flag = 1 ;
            }
            if(cnt > n * m || flag)
                r = mid ;
            else
                l = mid ;
        }
        cout << l ;
        return 0 ;
    }
    return 0 ;
}

Subtask #1
10.0 / 10.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 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 49 ms 4940 KB Output is correct
12 Correct 46 ms 5000 KB Output is correct
13 Correct 35 ms 4940 KB Output is correct
14 Correct 35 ms 4912 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 24 ms 4940 KB Output is correct
17 Correct 48 ms 4996 KB Output is correct
18 Correct 50 ms 4948 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 24 ms 4940 KB Output is correct
3 Correct 48 ms 4996 KB Output is correct
4 Correct 50 ms 4948 KB Output is correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.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 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 49 ms 4940 KB Output is correct
12 Correct 46 ms 5000 KB Output is correct
13 Correct 35 ms 4940 KB Output is correct
14 Correct 35 ms 4912 KB Output is correct
15 Incorrect 0 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.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 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 49 ms 4940 KB Output is correct
12 Correct 46 ms 5000 KB Output is correct
13 Correct 35 ms 4940 KB Output is correct
14 Correct 35 ms 4912 KB Output is correct
15 Incorrect 0 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -