oj.uz

Submission #887706

# Submission time Handle Problem Language Result Execution time Memory
887706 2023-12-15T03:27:42 Z Maite_Morale Self Study (JOI22_ho_t2) C++14
0 / 100
 476 ms 6780 KB 
#include<bits/stdc++.h>
#define F first
#define S second
#define MAX 500005
#define oo 1e19
#define mod 1000000007
#define fast_in ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
using namespace std;
typedef long long ll;
#define pll pair<ll , ll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
 
ll n,k;
pll a[MAX];
ll OK(ll x){
    ll m=k*n,r=0;
    for(int i=0;i<n;i++){
        ll moves=min(k,(x+a[i].F-1)/a[i].F);
        r+=(max((ll)0,x-(a[i].F*moves))+a[i].S-1)/a[i].S;
        m-=moves;
    }
    if(r<=m)return 1;
return 0;
}
int main(){
    fast_in
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>a[i].F;
    }
    for(int i=0;i<n;i++){
        cin>>a[i].S;a[i].F=max(a[i].S,a[i].F);
    }
    ll p=0,f=oo;
    while(abs(p-f)!=1){
        ll m=(p+f)/2;
        if(OK(m)==1)p=m;
        else        f=m;
    }
    cout<<p;
return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:5:12: warning: overflow in conversion from 'double' to 'll' {aka 'long long int'} changes value from '1.0e+19' to '9223372036854775807' [-Woverflow]
    5 | #define oo 1e19
      |            ^~~~
Main.cpp:36:14: note: in expansion of macro 'oo'
   36 |     ll p=0,f=oo;
      |              ^~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 256 ms 6748 KB Output is correct
12 Correct 255 ms 6748 KB Output is correct
13 Correct 253 ms 6780 KB Output is correct
14 Incorrect 476 ms 6736 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 130 ms 4748 KB Output is correct
10 Correct 90 ms 2648 KB Output is correct
11 Correct 65 ms 2672 KB Output is correct
12 Correct 52 ms 2652 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 9 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 256 ms 6748 KB Output is correct
12 Correct 255 ms 6748 KB Output is correct
13 Correct 253 ms 6780 KB Output is correct
14 Incorrect 476 ms 6736 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 130 ms 4748 KB Output is correct
10 Correct 90 ms 2648 KB Output is correct
11 Correct 65 ms 2672 KB Output is correct
12 Correct 52 ms 2652 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 9 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 256 ms 6748 KB Output is correct
12 Correct 255 ms 6748 KB Output is correct
13 Correct 253 ms 6780 KB Output is correct
14 Incorrect 476 ms 6736 KB Output isn't correct
15 Halted 0 ms 0 KB -