# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988469 | amirhoseinfar1385 | Fish 3 (JOI24_fish3) | C++17 | 251 ms | 40544 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 long long maxn=300000+10;
long long n,q,d,all[maxn],res[maxn],suma[maxn],kaf=(1<<19);
vector<pair<long long,long long>>qu[maxn];
vector<long long>na;
struct fenwick{
long long fen[maxn];
void ins(long long i,long long w){
i++;
while(i<maxn){
fen[i]+=w;
i+=((-i)&i);
}
}
long long pors(long long i){
long long ret=0;
i++;
while(i>0){
ret+=fen[i];
i-=((-i)&i);
}
return ret;
}
}fensuma,fenssum,fensumkam;
void vorod(){
cin>>n>>d;
// if(n>3000){
# | 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... |