# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855331 | willychan | Chorus (JOI23_chorus) | C++14 | 7059 ms | 4180 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;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
#define int ll
const int N = 1e5+5;
pair<ll,int> dp[N];
int Bpa[N];
ll Bpasum[N];
int n,K;
ll cost(int i,int j){
int l = i;
int r = j+1;
while(r-l>1){
int mid = (l+r)/2;
if(Bpa[mid]<j) l = mid;
else r = mid;
}
ll cnt = l-i;
ll ans = Bpasum[l]-Bpasum[i];
return cnt*j-ans;
}
struct seg{
int pos;int l;int r;
seg(int _pos,int _l,int _r):pos(_pos),l(_l),r(_r){}
};
# | 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... |