# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
815543 | ZeroCool | Exam (eJOI20_exam) | C++14 | 331 ms | 221908 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>
#define INF 1e18
#define LL long long
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e18;
const int mxn = 1e5 +5;
struct FenwickTree{
vector<int> bit;
int n;
FenwickTree(int _n){
n = _n + 69;
bit.resize(n,0);
}
void update(int pos,int val){
for(pos++;pos<n;pos += pos & -pos)bit[pos] = max(bit[pos],val);
}
int query(int pos){
int ans = 0;
for(pos++;pos;pos -= pos & -pos)ans = max(bit[pos],ans);
return ans;
}
};
int n;
# | 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... |