# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
842160 | konber | Exam (eJOI20_exam) | C++14 | 250 ms | 4832 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 <iostream>
#include <vector>
using namespace std;
vector<int> A, b, st;
int N;
void build(int p, int L, int R){
if(L==R){
st[p] = A[L];
return;
}
build(2*p, L, (L+R)/2);
build(2*p+1, (L+R)/2+1, R);
st[p] = max(st[2*p], st[2*p+1]);
}
int rmq(int p, int L, int R, int i, int j){
if(j < L || i > R) return -1;
if(L >= i && R <= j) return st[p];
int mid=(L+R)/2;
return max(rmq(2*p, L, mid, i, j), rmq(2*p+1, mid+1, R, i, j));
}
int f(vector<int> a, int i){
if(i==N){
int ans=0;
for(int j=0; j < N; j++) ans += a[j]==b[j];
return ans;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |