# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674567 | guagua0407 | Self Study (JOI22_ho_t2) | C++17 | 0 ms | 212 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.
/*
希望全國賽不要墊底
全國賽策略:
0:00-0:15:讀題
0:15-3:00:寫掉有把握的
3:00-5:00:撈分+寫掉快好的
記得上廁所
記得吃東西
*/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
ll n,m;
pair<int,int> num[300005];
bool check(ll k){
ll need=0,avail=0;
for(int i=0;i<n;i++){
int tmp=min(m,(k+num[i].f-1)/num[i].f);
if(k>tmp*num[i].f){
need+=(k-tmp*num[i].f+num[i].s-1)/num[i].s;
}
else{
avail+=m-tmp;
}
}
return avail>=need;
}
int main() {_
//setIO("wayne");
cin>>n>>m;
int ans=1e9+5;
for(int i=0;i<n;i++){
cin>>num[i].f>>num[i].s;
num[i].f=max(num[i].f,num[i].s);
}
ll l=1,r=(ll)1e18;
while(l<r){
ll mid=(l+r+1)/2;
if(check(mid)){
l=mid;
}
else{
r=mid-1;
}
}
cout<<l;
return 0;
}
//maybe its multiset not set
Compilation message (stderr)
# | 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... |