# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468845 | mychecksedad | Exam (eJOI20_exam) | C++17 | 229 ms | 98888 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 int N = 1e5+10, K = 20;
#define pb push_back
#define all(v) v.begin(), v.end()
int n, a[N], b[N], rmq[N][K];
map<int, vector<int>> m;
int subtask2(){
int ans = 0;
vector<bool> is_taken(n + 5, 0);
for(int i = 1; i <= n; i++){
if(a[i] == b[1]){
ans++;
int l = i-1, r = i + 1;
is_taken[i] = 1;
for(; l >= 1 && !is_taken[l] && a[l] < b[1]; l--) ans++, is_taken[l] = 1;
for(; r <= n && !is_taken[r] && a[r] < b[1]; r++) ans++, is_taken[r] = 1;
}
}
return ans;
}
int Q(int l, int r){
int k = __lg((r-l+1));
return max(rmq[l][k], rmq[r - (1<<k) + 1][k]);
}
int subtask4(){
map<int, int> m;
for(int i = 1; i <= n; i++) m[a[i]] = i;
vector<int> dp(n+2), v, lis(1);
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... |