# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854584 | ancuber1031 | Foehn Phenomena (JOI17_foehn_phenomena) | C++14 | 122 ms | 9044 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.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define p_q priority_queue
#define pb push_back
struct BIT{
vector<int> a;
int sz;
void init(int _n) {
a.assign(_n+5,0);
sz = _n;
}
void mdf(int p, int x) {
while(p <= sz) {
a[p] += x;
p += p&-p;
}
}
int val(int p) {
int ans = 0;
while(p) {
ans += a[p];
p -= p&-p;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |