# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021637 | boyliguanhan | Hiring (IOI09_hiring) | C++17 | 604 ms | 55368 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>
#define N 1<<19
typedef long long ll;
#define int ll
using namespace std;
struct fenwick_tree{
ll T[N]{};
void upd(int x,int p){
while(x<N)
T[x]+=p,x+=x&-x;
}
ll qr(int x){
int ans=0;
while(x)
ans+=T[x],x-=x&-x;
return ans;
}
} X,cnt;
int h,g,p[N],CC,CC2;
pair<ll,ll>b;
void stuff(ll x,int i,ll A,ll B){
int l=0,r=5e5,res=0;
while(l<=r){
int mid=l+r>>1;
if(X.qr(mid)<=x)
l=mid+1,res=mid;
else r=mid-1;
}
ll K=cnt.qr(res),C=X.qr(res);
if(K>h||K==h&&b.first*B>b.second*A*C)
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... |
# | 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... |