# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676490 | penguin133 | Mountains (NOI20_mountains) | C++17 | 290 ms | 19904 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;
priority_queue<pair<long long, int> >pq;
long long ft[300005];
long long in1[300005];
long long in2[300005];
int cnt2 = 1;
int ls(int x){
return x & -x;
}
int query(int x){
long long sum = 0;
for(;x;x -= ls(x)){
sum += ft[x];
}
return sum;
}
void update(int x, int v){
for(;x<=cnt2;x += ls(x)){
ft[x] += v;
}
}
int main(){
int n;
cin >> n;
long long cnt = 0;
cnt2 = 1;
pair<long long, int> d[n+1];
# | 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... |