# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
815143 | MohamedAhmed04 | Self Study (JOI22_ho_t2) | C++14 | 220 ms | 9100 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 3e5 + 10 ;
int a[MAX] , b[MAX] ;
int n , m ;
bool check(long long x)
{
long long cnt = 0 ;
for(int i = 0 ; i < n ; ++i)
{
if(1ll * m * a[i] >= x)
cnt += m - (x + a[i] - 1ll) / a[i] ;
else
cnt -= (x - 1ll * m * a[i] + b[i] - 1ll) / b[i] ;
cnt = max(cnt , (long long)(-1ll * 1e18)) ;
}
return (cnt >= 0) ;
}
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n>>m ;
for(int i = 0 ; i < n ; ++i)
cin>>a[i] ;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |