# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981137 | aymanrs | Fish 3 (JOI24_fish3) | C++14 | 222 ms | 56404 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;
struct que{
int l, r, id;
};
void f(int l, int r, list<que>& v, long long a[], long long ans[], long long c[]){
if(l==r){
for(auto& i : v){
ans[i.id] = 0;
}
return;
}
int m = l+r>>1;
list<que> L, R, M;
for(const que& i : v){
if(i.r <= m) L.push_back(i);
else if(i.l > m) R.push_back(i);
else M.push_back(i);
}
v.clear();
f(l, m, L, a, ans, c);
f(m+1, r, R, a, ans, c);
long long S = 0;
vector<pair<long long, int>> p;
stack<pair<long long, int>> s;
long long fs[r-m], Fs[r-m];
for(int i = m+1;i <= r;i++){
if(i==m+1) Fs[i-m-1]=0;
else Fs[i-m-1] = Fs[i-m-2];
if(a[i] <= 0) {
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... |