# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112876 | zNatsumi | Real Mountains (CCO23_day1problem2) | C++17 | 1 ms | 2552 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;
using ii = pair<int, int>;
const int N = 1e6 + 5,
mod = 1e6 + 3;
int n, a[N];
bool DKL[N], DKR[N];
namespace sub1{
priority_queue<ii, vector<ii>, greater<>> pq;
void solve(){
for(int i = 1; i <= n; i++) pq.push({a[i], i});
int res = 0;
while(pq.size()){
auto idx = pq.top().second; pq.pop();
int posL = -1, posR = -1;
{
int l = 1, r = idx - 1;
while(l <= r){
int mid = l + r >> 1;
if(a[mid] > a[idx]) l = (posL = mid) + 1;
else r = mid - 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |